[EnvInject] - Loading node environment variables.
workermta1 (mta_big) in workspace /media/data/jenkins/workspace/isabelle-all Building remotely on
[isabelle-all] $ hg showconfig paths.default
[isabelle-all] $ hg pull --rev default
http://isabelle.in.tum.de/repos/isabelle/ pulling from
[isabelle-all] $ hg update --clean --rev default
0 files updated, 0 files merged, 0 files removed, 0 files unresolved
[isabelle-all] $ hg log --rev . --template {node}
[isabelle-all] $ hg log --rev . --template {rev}
[isabelle-all] $ hg log --rev 2c48be88f84718fa75d0e09779dba679fcb7a26d --template exists\n
[isabelle-all] $ hg log --template "<changeset node='{node}' author='{author|xmlescape}' rev='{rev}' date='{date}'><msg>{desc|xmlescape}</msg><added>{file_adds|stringify|xmlescape}</added><deleted>{file_dels|stringify|xmlescape}</deleted><files>{files|stringify|xmlescape}</files><parents>{parents}</parents></changeset>\n" --rev "ancestors('default') and not ancestors(2c48be88f84718fa75d0e09779dba679fcb7a26d)" --encoding UTF-8 --encodingmode replace
[afp] $ hg showconfig paths.default
https://bitbucket.org/isa-afp/afp-devel/ pulling from
[afp] $ hg update --clean --rev default
470 files updated, 0 files merged, 0 files removed, 0 files unresolved
[afp] $ hg --config extensions.purge= clean --all
[afp] $ hg log --rev . --template {node}
[afp] $ hg log --rev . --template {rev}
[afp] $ hg log --rev be1342e33484a08723edb3a7391ddbae105e2897 --template exists\n
[afp] $ hg log --template "<changeset node='{node}' author='{author|xmlescape}' rev='{rev}' date='{date}'><msg>{desc|xmlescape}</msg><added>{file_adds|stringify|xmlescape}</added><deleted>{file_dels|stringify|xmlescape}</deleted><files>{files|stringify|xmlescape}</files><parents>{parents}</parents></changeset>\n" --rev "ancestors('default') and not ancestors(be1342e33484a08723edb3a7391ddbae105e2897)" --encoding UTF-8 --encodingmode replace
[isabelle-all] $ /bin/sh -xe /tmp/jenkins565797341039671318.sh
### Building Isabelle/Scala ...
### Building Isabelle/jEdit ...
The following actions will be performed:
∗ install ocaml-base-compiler 4.05.0 [required by ocaml]
∗ install ocaml-config 1 [required by ocaml]
∗ install ocaml 4.05.0 [required by ocamlfind, zarith]
<><> Gathering sources ><><><><><><><><><><><><><><><><><><><><><><><><><><><><> [ocaml-base-compiler.4.05.0] found in cache
<><> Processing actions <><><><><><><><><><><><><><><><><><><><><><><><><><><><> ∗ installed base-bigarray.base ∗ installed ocaml-base-compiler.4.05.0 # Run eval $(opam env) to update the current shell environment [NOTE] Package zarith is already installed (current version is 1.7). stack will use a sandboxed GHC it installed For more information on paths, see 'stack path' and 'stack exec env' To use this GHC and packages outside of a project, consider using: stack ghc, stack ghci, stack runghc, or stack exec The Glorious Glasgow Haskell Compilation System, version 8.4.4
ML_HOME="/media/data/jenkins/.isabelle/contrib/polyml-5.8/x86_64-linux"
Session AFP/Abortable_Linearizable_Modules (AFP) Session AFP/Abstract-Hoare-Logics (AFP) Session AFP/AxiomaticCategoryTheory (AFP) Session AFP/BinarySearchTree (AFP) Session AFP/Binomial-Queues (AFP) Session AFP/Bounded_Deducibility_Security (AFP) Session AFP/BytecodeLogicJmlTypes (AFP) Session AFP/Sqrt_Babylonian (AFP) Session AFP/ClockSynchInst (AFP) Session AFP/Compiling-Exceptions-Correctly (AFP) Session AFP/ComponentDependencies (AFP) Session AFP/Concurrent_Revisions (AFP) Session AFP/Constructor_Funs (AFP) Session AFP/CryptoBasedCompositionalProperties (AFP) Session AFP/DPT-SAT-Solver (AFP) Session AFP/Depth-First-Search (AFP) Session AFP/Diophantine_Eqns_Lin_Hom (AFP) Session AFP/Example-Submission (AFP) Session AFP/FeatherweightJava (AFP) Session AFP/Featherweight_OCL (AFP) Session AFP/FileRefinement (AFP) Session AFP/FocusStreamsCaseStudies (AFP) Session AFP/Free-Boolean-Algebra (AFP) Session AFP/FunWithFunctions (AFP) Session AFP/FunWithTilings (AFP) Session AFP/GPU_Kernel_PL (AFP) Session AFP/Gauss-Jordan-Elim-Fun (AFP) Session AFP/General-Triangle (AFP) Session AFP/Generic_Deriving (AFP) Session AFP/GewirthPGCProof (AFP) Session AFP/Allen_Calculus (AFP) Session AFP/Dependent_SIFUM_Type_Systems (AFP) Session AFP/Dependent_SIFUM_Refinement (AFP) Session AFP/Case_Labeling (AFP) Session HOL/HOL-Hoare_Parallel (timing) Session HOL/HOL-Library (main timing) Session AFP/ArrowImpossibilityGS (AFP) Session AFP/BNF_Operations (AFP) Session AFP/Binomial-Heaps (AFP) Session AFP/Boolean_Expression_Checkers (AFP) Session AFP/Card_Multisets (AFP) Session AFP/Card_Number_Partitions (AFP) Session AFP/MonoidalCategory (AFP) Session AFP/Completeness (AFP) Session AFP/ConcurrentIMP (AFP) Session AFP/Concurrent_Ref_Alg (AFP) Session AFP/Decl_Sem_Fun_PL (AFP) Session AFP/Derangements (AFP) Session AFP/Discrete_Summation (AFP) Session AFP/Card_Partitions (AFP) Session AFP/Bell_Numbers_Spivey (AFP) Session AFP/Card_Equiv_Relations (AFP) Session AFP/Efficient-Mergesort (AFP) Session AFP/Encodability_Process_Calculi (AFP) Session AFP/Epistemic_Logic (AFP) Session AFP/Euler_Partition (AFP) Session AFP/FOL_Harrison (AFP) Session AFP/Factored_Transition_System_Bounding (AFP) Session AFP/Falling_Factorial_Sum (AFP) Session AFP/Finger-Trees (AFP) Session AFP/Graph_Saturation (AFP) Session AFP/Graph_Theory (AFP) Session AFP/ShortestPath (AFP) Session AFP/Group-Ring-Module (AFP) Session HOL/HOL-UNITY (timing) Session HOL/HOL-Cardinals (timing) Session AFP/Ordinals_and_Cardinals (AFP) Session AFP/Sort_Encodings (AFP) Session HOL/HOL-Computational_Algebra (main timing) Session AFP/Descartes_Sign_Rule (AFP) Session HOL/HOL-Algebra (main timing) Session HOL/HOL-Decision_Procs (timing) Session HOL/HOL-Quotient_Examples (timing) Session AFP/Localization_Ring (AFP) Session AFP/Orbit_Stabiliser (AFP) Session AFP/Perfect-Number-Thm (AFP) Session AFP/Secondary_Sylow (AFP) Session AFP/Jordan_Hoelder (AFP) Session HOL/HOL-Analysis (main timing) Session AFP/Cayley_Hamilton (AFP) Session AFP/DynamicArchitectures (AFP) Session AFP/Architectural_Design_Patterns (AFP) Session AFP/Lazy-Lists-II (AFP) Session AFP/Stream_Fusion_Code (AFP) Session AFP/First_Welfare_Theorem (AFP) Session HOL/HOL-Probability (main timing) Session AFP/Buffons_Needle (AFP) Session AFP/Density_Compiler (AFP) Session AFP/DiscretePricing (AFP) Session AFP/Ergodic_Theory (AFP) Session AFP/Gromov_Hyperbolicity (AFP) Session AFP/Fisher_Yates (AFP) Session AFP/Girth_Chromatic (AFP) Session AFP/Random_Graph_Subgraph_Threshold (AFP) Session HOL/HOL-Probability-ex (timing) Session AFP/Markov_Models (AFP) Session AFP/Monad_Normalisation (AFP) Session AFP/Monomorphic_Monad (AFP) Session AFP/Neumann_Morgenstern_Utility (AFP) Session AFP/Probabilistic_Noninterference (AFP) Session AFP/Probabilistic_System_Zoo (AFP) Session AFP/Probabilistic_System_Zoo-Non_BNFs (AFP) Session AFP/Source_Coding_Theorem (AFP) Session AFP/Irrationality_J_Hancl (AFP) Session AFP/Kuratowski_Closure_Complement (AFP) Session AFP/Lower_Semicontinuous (AFP) Session AFP/Minkowskis_Theorem (AFP) Session AFP/Probabilistic_System_Zoo-BNFs (AFP) Session AFP/Ptolemys_Theorem (AFP) Session AFP/Rank_Nullity_Theorem (AFP) Session AFP/Gauss_Jordan (AFP) Session AFP/Echelon_Form (AFP) Session AFP/Tarskis_Geometry (AFP) Session AFP/Chord_Segments (AFP) Session AFP/Stewart_Apollonius (AFP) Session HOL/HOL-Nonstandard_Analysis (timing) Session HOL/HOL-Nonstandard_Analysis-Examples (timing) Session HOL/HOL-Number_Theory (main timing) Session AFP/E_Transcendental (AFP) Session AFP/Elliptic_Curves_Group_Law (AFP) Session HOL/HOL-Data_Structures (timing) Session AFP/Automatic_Refinement (AFP) Session HOL/HOL-Codegenerator_Test Session AFP/Pratt_Certificate (AFP) Session AFP/Bertrands_Postulate (AFP) Session AFP/Prime_Harmonic_Series (AFP) Session AFP/Liouville_Numbers (AFP) Session AFP/Mason_Stothers (AFP) Session AFP/Polynomial_Interpolation (AFP) Session AFP/Probabilistic_Prime_Tests (AFP) Session AFP/Rep_Fin_Groups (AFP) Session AFP/Sturm_Sequences (AFP) Session AFP/Special_Function_Bounds (AFP) Session AFP/Sturm_Tarski (AFP) Session AFP/Budan_Fourier (AFP) Session AFP/Winding_Number_Eval (AFP) Session AFP/Count_Complex_Roots (AFP) Session HOL/HOL-Corec_Examples (timing) Session HOL/HOL-Datatype_Examples (timing) Session AFP/Abs_Int_ITP2012 (AFP) Session HOL/HOL-Imperative_HOL (timing) Session AFP/Auto2_Imperative_HOL (AFP) Session AFP/Imperative_Insertion_Sort (AFP) Session HOL/HOL-Metis_Examples (timing) Session HOL/HOL-MicroJava (timing) Session HOL/HOL-Nitpick_Examples Session HOL/HOL-Nominal-Examples (timing) Session AFP/Lam-ml-Normalization (AFP) Session AFP/SequentInvertibility (AFP) Session HOL/HOL-Predicate_Compile_Examples (timing) Session HOL/HOL-Quickcheck_Examples (timing) Session HOL/HOL-SET_Protocol (timing) Session AFP/HereditarilyFinite (AFP) Session AFP/Isabelle_Meta_Model (AFP) Session AFP/Stuttering_Equivalence (AFP) Session AFP/Lambda_Free_RPOs (AFP) Session AFP/Lambda_Free_EPO (AFP) Session AFP/Landau_Symbols (AFP) Session AFP/Catalan_Numbers (AFP) Session AFP/Error_Function (AFP) Session AFP/Euler_MacLaurin (AFP) Session AFP/Stirling_Formula (AFP) Session AFP/LightweightJava (AFP) Session AFP/LinearQuantifierElim (AFP) Session AFP/List-Infinite (AFP) Session AFP/Nat-Interval-Logic (AFP) Session AFP/AutoFocus-Stream (AFP) Session AFP/MuchAdoAboutTwo (AFP) Session AFP/Order_Lattice_Props (AFP) Session AFP/POPLmark-deBruijn (AFP) Session AFP/Pairing_Heap (AFP) Session AFP/Password_Authentication_Protocol (AFP) Session AFP/Presburger-Automata (AFP) Session AFP/Priority_Queue_Braun (AFP) Session AFP/Program-Conflict-Analysis (AFP) Session AFP/Regular-Sets (AFP) Session AFP/Abstract-Rewriting (AFP) Session AFP/Decreasing-Diagrams (AFP) Session AFP/First_Order_Terms (AFP) Session AFP/Matrix_Tensor (AFP) Session AFP/Coinductive_Languages (AFP) Session AFP/Finite_Automata_HF (AFP) Session AFP/Functional-Automata (AFP) Session AFP/Posix-Lexing (AFP) Session AFP/Ribbon_Proofs (AFP) Session AFP/SATSolverVerification (AFP) Session AFP/Selection_Heap_Sort (AFP) Session AFP/Amortized_Complexity (AFP) Session AFP/Dynamic_Tables (AFP) Session AFP/Root_Balanced_Tree (AFP) Session AFP/Stable_Matching (AFP) Session AFP/Tail_Recursive_Functions (AFP) Session AFP/TortoiseHare (AFP) Session AFP/Flyspeck-Tame (AFP) Session AFP/Twelvefold_Way (AFP) Session AFP/Vickrey_Clarke_Groves (AFP) Session HOL/HOL-Real_Asymp-Manual Session AFP/Smooth_Manifolds (AFP) Session HOL/HOL-Word (main timing) Session HOL/HOL-SPARK-Examples Session AFP/RIPEMD-160-SPARK (AFP) Session HOL/HOL-Word-SMT_Examples (timing) Session AFP/Kleene_Algebra (AFP) Session AFP/Multirelations (AFP) Session AFP/Transformer_Semantics (AFP) Session AFP/Regular_Algebras (AFP) Session AFP/Relation_Algebra (AFP) Session AFP/Residuated_Lattices (AFP) Session AFP/Refine_Monadic (AFP) Session AFP/Abstract_Completeness (AFP) Session AFP/Abstract_Soundness (AFP) Session AFP/Incredible_Proof_Machine (AFP) Session AFP/CAVA_Automata (AFP) Session AFP/DFS_Framework (AFP) Session AFP/Collections_Examples (AFP) Session AFP/Containers-Benchmarks (AFP) Session AFP/Datatype_Order_Generator (AFP) Session AFP/Old_Datatype_Show (AFP) Session AFP/QR_Decomposition (AFP) Session AFP/Dijkstra_Shortest_Path (AFP) Session AFP/Koenigsberg_Friendship (AFP) Session AFP/Transition_Systems_and_Automata (AFP) Session AFP/Buchi_Complementation (AFP) Session AFP/Partial_Order_Reduction (AFP) Session AFP/CAVA_LTL_Modelchecker (AFP) Session AFP/Transitive-Closure (AFP) Session AFP/Tree-Automata (AFP) Session AFP/Separation_Algebra (AFP) Session AFP/Separation_Logic_Imperative_HOL (AFP) Session AFP/Sepref_Prereq (AFP) Session AFP/UpDown_Scheme (AFP) Session AFP/IEEE_Floating_Point (AFP) Session AFP/IP_Addresses (AFP) Session AFP/Simple_Firewall (AFP) Session AFP/Iptables_Semantics (AFP) Session AFP/Iptables_Semantics_Examples (AFP) Session HOL/HOLCF (main timing) Session AFP/HOLCF-Prelude (AFP) Session AFP/Stream-Fusion (AFP) Session AFP/WorkerWrapper (AFP) Session AFP/Consensus_Refined (AFP) Session AFP/HotelKeyCards (AFP) Session Doc/How_to_Prove_it (no_doc) Session AFP/Hybrid_Multi_Lane_Spatial_Logic (AFP) Session Doc/Implementation (doc) Session AFP/Impossible_Geometry (AFP) Session AFP/Inductive_Confidentiality (AFP) Session AFP/InfPathElimination (AFP) Session AFP/JiveDataStoreModel (AFP) Session AFP/Algebraic_VCs (AFP) Session AFP/Key_Agreement_Strong_Adversaries (AFP) Session AFP/LatticeProperties (AFP) Session AFP/DataRefinementIBP (AFP) Session AFP/GraphMarkingIBP (AFP) Session AFP/Dict_Construction (AFP) Session AFP/Lifting_Definition_Option (AFP) Session AFP/Affine_Arithmetic (AFP) Session AFP/Taylor_Models (AFP) Session AFP/Comparison_Sort_Lower_Bound (AFP) Session AFP/Formula_Derivatives (AFP) Session AFP/Formula_Derivatives-Examples (AFP) Session AFP/Higher_Order_Terms (AFP) Session AFP/InformationFlowSlicing_Inter (AFP) Session AFP/InformationFlowSlicing (AFP) Session AFP/Ordinary_Differential_Equations (AFP) Session AFP/Differential_Dynamic_Logic (AFP) Session AFP/HOL-ODE-Numerics (AFP) Session AFP/HOL-ODE-ARCH-COMP (AFP) Session AFP/HOL-ODE-Examples (AFP large) Session AFP/Lorenz_Approximation (AFP) Session AFP/Lorenz_C0 (AFP large) Session AFP/Lorenz_C1 (AFP large) Session AFP/Quick_Sort_Cost (AFP) Session AFP/Randomised_BSTs (AFP) Session AFP/Randomised_Social_Choice (AFP) Session AFP/Fishburn_Impossibility (AFP) Session AFP/SDS_Impossibility (AFP) Session AFP/Refine_Imperative_HOL (AFP) Session AFP/Floyd_Warshall (AFP) Session AFP/Sepref_Basic (AFP) Session AFP/Flow_Networks (AFP) Session AFP/EdmondsKarp_Maxflow (AFP) Session AFP/MFMC_Countable (AFP) Session AFP/Prpu_Maxflow (AFP) Session AFP/Knuth_Morris_Pratt (AFP) Session AFP/VerifyThis2018 (AFP) Session AFP/List_Interleaving (AFP) Session AFP/List_Inversions (AFP) Session AFP/Lowe_Ontological_Argument (AFP) Session AFP/MSO_Regex_Equivalence (AFP) Session AFP/Latin_Square (AFP) Session AFP/Max-Card-Matching (AFP) Session AFP/Median_Of_Medians_Selection (AFP) Session AFP/Modular_Assembly_Kit_Security (AFP) Session AFP/Monad_Memo_DP (AFP) Session AFP/Hidden_Markov_Models (AFP) Session AFP/MonoBoolTranAlgebra (AFP) Session AFP/Name_Carrying_Type_Inference (AFP) Session AFP/Network_Security_Policy_Verification (AFP) Session AFP/No_FTL_observers (AFP) Session AFP/Incompleteness (AFP) Session AFP/Surprise_Paradox (AFP) Session AFP/Modal_Logics_for_NTS (AFP) Session AFP/Noninterference_CSP (AFP) Session AFP/Noninterference_Ipurge_Unwinding (AFP) Session AFP/Noninterference_Generic_Unwinding (AFP) Session AFP/Noninterference_Inductive_Unwinding (AFP) Session AFP/Noninterference_Sequential_Composition (AFP) Session AFP/Noninterference_Concurrent_Composition (AFP) Session AFP/Open_Induction (AFP) Session AFP/Well_Quasi_Orders (AFP) Session AFP/Decreasing-Diagrams-II (AFP) Session AFP/Myhill-Nerode (AFP) Session AFP/Symmetric_Polynomials (AFP) Session AFP/Pi_Transcendental (AFP) Session AFP/Nested_Multisets_Ordinals (AFP) Session AFP/Lambda_Free_KBOs (AFP) Session AFP/Ordered_Resolution_Prover (AFP) Session AFP/PSemigroupsConvolution (AFP) Session AFP/Paraconsistency (AFP) Session AFP/Partial_Function_MR (AFP) Session AFP/Certification_Monads (AFP) Session AFP/Pre_Polynomial_Factorization (AFP) Session AFP/Polynomial_Factorization (AFP) Session AFP/Dirichlet_Series (AFP) Session AFP/Zeta_Function (AFP) Session AFP/Prime_Number_Theorem (AFP) Session AFP/Prime_Distribution_Elementary (AFP) Session AFP/Functional_Ordered_Resolution_Prover (AFP) Session AFP/Jordan_Normal_Form (AFP) Session AFP/Deep_Learning (AFP) Session AFP/Groebner_Bases (AFP) Session AFP/Signature_Groebner (AFP) Session AFP/Linear_Recurrences (AFP) Session AFP/Perron_Frobenius (AFP) Session AFP/Stochastic_Matrices (AFP) Session AFP/Subresultants (AFP) Session AFP/Berlekamp_Zassenhaus (AFP) Session AFP/Algebraic_Numbers (AFP) Session AFP/LLL_Basis_Reduction (AFP) Session AFP/LLL_Factorization (AFP) Session AFP/Linear_Recurrences_Solver (AFP) Session AFP/Probabilistic_While (AFP) Session AFP/Pop_Refinement (AFP) Session AFP/Possibilistic_Noninterference (AFP) Session AFP/Projective_Geometry (AFP) Session AFP/Proof_Strategy_Language (AFP) Session AFP/Propositional_Proof_Systems (AFP) Session AFP/Ramsey-Infinite (AFP) Session AFP/Recursion-Theory-I (AFP) Session AFP/Minsky_Machines (AFP) Session AFP/RefinementReactive (AFP) Session AFP/Resolution_FOL (AFP) Session AFP/Robbins-Conjecture (AFP) Session AFP/Roy_Floyd_Warshall (AFP) Session AFP/SIFUM_Type_Systems (AFP) Session AFP/Security_Protocol_Refinement (AFP) Session AFP/SenSocialChoice (AFP) Session AFP/Planarity_Certificates (AFP) Session AFP/Stone_Algebras (AFP) Session AFP/Stone_Relation_Algebras (AFP) Session AFP/Stone_Kleene_Relation_Algebras (AFP) Session AFP/Aggregation_Algebras (AFP) Session AFP/Store_Buffer_Reduction (AFP) Session AFP/Strong_Security (AFP) Session AFP/Timed_Automata (AFP) Session AFP/Probabilistic_Timed_Automata (AFP) Session AFP/Transitive-Closure-II (AFP) Session AFP/Tree_Decomposition (AFP) Session Doc/Typeclass_Hierarchy (doc) Session AFP/Types_Tableaus_and_Goedels_God (AFP) Session AFP/UPF_Firewall (AFP) Session AFP/Universal_Turing_Machine (AFP) Session AFP/Verified-Prover (AFP) Session AFP/VolpanoSmith (AFP) Session AFP/WHATandWHERE_Security (AFP) Session AFP/Weight_Balanced_Trees (AFP) Session HOL/HOL-Proofs (timing) Session HOL/HOL-Proofs-Extraction (timing) Session HOL/HOL-Proofs-Lambda (timing) Session AFP/Applicative_Lifting (AFP) Session AFP/Constructive_Cryptography (AFP) Session AFP/Game_Based_Crypto (AFP) Session AFP/Locally-Nameless-Sigma (AFP) Session AFP/Stern_Brocot (AFP) Session Doc/Sledgehammer (doc) Session AFP/Regex_Equivalence (AFP) Building Randomised_Social_Choice ... Running Higher_Order_Terms ... Running Functional_Ordered_Resolution_Prover ... Running Noninterference_Generic_Unwinding ... Verified-Prover: theory Verified-Prover.Prover Smooth_Manifolds: theory HOL-Library.Function_Algebras Smooth_Manifolds: theory HOL-Library.Quotient_Syntax Smooth_Manifolds: theory HOL-Types_To_Sets.Prerequisites Smooth_Manifolds: theory HOL-Types_To_Sets.Types_To_Sets Smooth_Manifolds: theory HOL-Library.Quotient_Set Higher_Order_Terms: theory HOL-Library.AList Higher_Order_Terms: theory HOL-Library.Adhoc_Overloading Higher_Order_Terms: theory HOL-Library.Conditional_Parametricity Higher_Order_Terms: theory HOL-Library.Nat_Bijection Higher_Order_Terms: theory HOL-Library.Monad_Syntax Noninterference_Generic_Unwinding: theory Noninterference_Generic_Unwinding.GenericUnwinding Higher_Order_Terms: theory HOL-Library.State_Monad Smooth_Manifolds: theory HOL-Types_To_Sets.Group_On_With Valuation: theory Valuation.Valuation1 Randomised_Social_Choice: theory Randomised_Social_Choice.Lotteries Randomised_Social_Choice: theory Randomised_Social_Choice.QSOpt_Exact Randomised_Social_Choice: theory List-Index.List_Index Lambda_Free_EPO: theory HOL-Cardinals.Order_Union Lambda_Free_EPO: theory Lambda_Free_RPOs.Lambda_Free_Util Lambda_Free_RPOs: theory HOL-Cardinals.Order_Union Lambda_Free_RPOs: theory Lambda_Free_RPOs.Lambda_Free_Util Lambda_Free_EPO: theory HOL-Cardinals.Wellorder_Extension Higher_Order_Terms: theory HOL-Library.Old_Datatype Lambda_Free_RPOs: theory HOL-Cardinals.Wellorder_Extension Higher_Order_Terms: theory List-Index.List_Index Randomised_Social_Choice: theory Randomised_Social_Choice.Order_Predicates Smooth_Manifolds: theory HOL-Types_To_Sets.Linear_Algebra_On_With Higher_Order_Terms: theory HOL-Library.Countable Lambda_Free_EPO: theory Lambda_Free_RPOs.Infinite_Chain Lambda_Free_EPO: theory Lambda_Free_RPOs.Lambda_Free_Term Lambda_Free_RPOs: theory Lambda_Free_RPOs.Infinite_Chain Lambda_Free_RPOs: theory Lambda_Free_RPOs.Lambda_Free_Term Lambda_Free_EPO: theory Lambda_Free_RPOs.Extension_Orders Lambda_Free_RPOs: theory Lambda_Free_RPOs.Extension_Orders Randomised_Social_Choice: theory Randomised_Social_Choice.Preference_Profiles Smooth_Manifolds: theory HOL-Types_To_Sets.Linear_Algebra_On Higher_Order_Terms: theory HOL-Library.FSet Randomised_Social_Choice: theory Randomised_Social_Choice.Elections Randomised_Social_Choice: theory Randomised_Social_Choice.Utility_Functions Randomised_Social_Choice: theory Randomised_Social_Choice.Preference_Profile_Cmd Functional_Ordered_Resolution_Prover: theory Deriving.Comparator Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Fun_More Functional_Ordered_Resolution_Prover: theory Deriving.Generator_Aux Functional_Ordered_Resolution_Prover: theory Deriving.Derive_Manager Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Term Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Transitive_Closure_More Functional_Ordered_Resolution_Prover: theory HOL-Cardinals.Order_Union Functional_Ordered_Resolution_Prover: theory Deriving.Equality_Generator Valuation: theory Valuation.Valuation2 Functional_Ordered_Resolution_Prover: theory HOL-Cardinals.Wellorder_Extension Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Option_Monad Randomised_Social_Choice: theory Randomised_Social_Choice.Stochastic_Dominance Functional_Ordered_Resolution_Prover: theory Deriving.Equality_Instances Functional_Ordered_Resolution_Prover: theory Nested_Multisets_Ordinals.Multiset_More Functional_Ordered_Resolution_Prover: theory Abstract-Rewriting.Seq Functional_Ordered_Resolution_Prover: theory Deriving.Compare Lambda_Free_EPO: theory Lambda_Free_EPO.Embeddings Lambda_Free_RPOs: theory Lambda_Free_RPOs.Lambda_Encoding Randomised_Social_Choice: theory Randomised_Social_Choice.SD_Efficiency Lambda_Free_RPOs: theory Lambda_Free_RPOs.Lambda_Free_RPO_App Functional_Ordered_Resolution_Prover: theory Deriving.Comparator_Generator Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Seq_More Lambda_Free_RPOs: theory Lambda_Free_RPOs.Lambda_Free_RPO_Std Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Clausal_Logic Functional_Ordered_Resolution_Prover: theory HOL-Word.Bits Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Unifiers Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Term_Pair_Multiset Randomised_Social_Choice: theory Randomised_Social_Choice.Social_Decision_Schemes Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Subsumption Lambda_Free_KBOs: theory HOL-Cardinals.Order_Union Lambda_Free_KBOs: theory Abstract-Rewriting.Seq Lambda_Free_KBOs: theory HOL-Library.While_Combinator Lambda_Free_KBOs: theory Lambda_Free_RPOs.Lambda_Free_Util Lambda_Free_KBOs: theory HOL-Cardinals.Wellorder_Extension Lambda_Free_KBOs: theory Matrix.Utility Functional_Ordered_Resolution_Prover: theory HOL-Word.Bits_Bit Lambda_Free_KBOs: theory Regular-Sets.Regular_Set Functional_Ordered_Resolution_Prover: theory Deriving.Compare_Generator Lambda_Free_RPOs: theory Lambda_Free_RPOs.Lambda_Free_RPO_Optim Functional_Ordered_Resolution_Prover: theory HOL-Word.Misc_Numeric Functional_Ordered_Resolution_Prover: theory HOL-Word.Bit_Representation Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Herbrand_Interpretation Lambda_Free_KBOs: theory Lambda_Free_RPOs.Infinite_Chain Lambda_Free_KBOs: theory Lambda_Free_RPOs.Lambda_Free_Term Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Ground_Resolution_Model Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Inference_System Lambda_Free_KBOs: theory Lambda_Free_RPOs.Extension_Orders Functional_Ordered_Resolution_Prover: theory Deriving.Compare_Instances Valuation: theory Valuation.Valuation3 Lambda_Free_RPOs: theory Lambda_Free_RPOs.Lambda_Free_RPOs Functional_Ordered_Resolution_Prover: theory HOL-Word.Bits_Int Functional_Ordered_Resolution_Prover: theory HOL-Word.Word_Miscellaneous Lambda_Free_EPO: theory Lambda_Free_EPO.Chop Functional_Ordered_Resolution_Prover: theory HOL-Word.Misc_Typedef Lambda_Free_EPO: theory Lambda_Free_EPO.Lambda_Free_EPO Higher_Order_Terms: theory HOL-Library.Finite_Map Functional_Ordered_Resolution_Prover: theory Deriving.Countable_Generator Functional_Ordered_Resolution_Prover: theory Coinductive.Coinductive_Nat Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Verified-Prover Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Verified-Prover/document.pdf Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Verified-Prover/outline.pdf (see also /media/data/jenkins/workspace/isabelle-all/heaps/polyml-5.8_x86_64-linux/log/Verified-Prover) *** FEval (gs, g) e (NAtom p vs)\<rbrakk> *** \<Longrightarrow> FEval (gs, g) e (snd a) \<or> *** (\<exists>f\<in>set list. FEval (gs, g) e (snd f)) *** 2. \<And>n t gs g e a list p vs. *** \<lbrakk>init s; finite (deriv s); m \<in> fst ` deriv s; *** (\<exists>u. (y, u) \<in> deriv s) \<longrightarrow> y \<le> m; *** (m, a # list) \<in> deriv s; n = m; is_env (gs, g) e; t = a # list; *** snd a = PAtom p vs; NAtom p vs \<in> snd ` set list\<rbrakk> *** \<Longrightarrow> FEval (gs, g) e (PAtom p vs) \<or> *** FEval (gs, g) e (NAtom p vs) *** 3. \<And>n t gs g e a list. *** \<lbrakk>init s; finite (deriv s); m \<in> fst ` deriv s; *** (\<exists>u. (y, u) \<in> deriv s) \<longrightarrow> y \<le> m; *** (m, a # list) \<in> deriv s; n = m; is_env (gs, g) e; t = a # list; *** PAtom p vs \<in> snd ` set list\<rbrakk> *** \<Longrightarrow> FEval (gs, g) e (snd a) \<or> *** (\<exists>f\<in>set list. FEval (gs, g) e (snd f)) *** \<lbrakk>init s; finite (deriv s); m \<in> fst ` deriv s; *** (\<exists>u. (y, u) \<in> deriv s) \<longrightarrow> y \<le> m; *** (m, t) \<in> deriv s; n = m; is_env (gs, g) e; *** \<not> is_axiom (s_of_ns t)\<rbrakk> *** \<Longrightarrow> \<exists>f. *** f \<in> set (s_of_ns t) \<and> FEval (gs, g) e f *** \<lbrakk>init s; finite (deriv s); m \<in> fst ` deriv s; *** \<forall>y u. (y, u) \<in> deriv s \<longrightarrow> y \<le> m; *** n = m - na \<and> (na, t) \<in> deriv s \<longrightarrow> *** Svalid (s_of_ns t)\<rbrakk> *** \<Longrightarrow> \<forall>na t. *** (na, t) \<in> deriv s \<longrightarrow> *** At command "apply" (line 609 of "$AFP/Verified-Prover/Prover.thy") Functional_Ordered_Resolution_Prover: theory Matrix.Utility Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Ordered_Ground_Resolution Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Unordered_Ground_Resolution Randomised_Social_Choice: theory Randomised_Social_Choice.Random_Dictatorship Randomised_Social_Choice: theory Randomised_Social_Choice.SDS_Automation Randomised_Social_Choice: theory Randomised_Social_Choice.SDS_Lowering Functional_Ordered_Resolution_Prover: theory Polynomial_Factorization.Missing_List Randomised_Social_Choice: theory Randomised_Social_Choice.Random_Serial_Dictatorship Functional_Ordered_Resolution_Prover: theory Open_Induction.Restricted_Predicates Functional_Ordered_Resolution_Prover: theory HOL-Word.Bool_List_Representation Functional_Ordered_Resolution_Prover: theory Coinductive.Coinductive_List Lambda_Free_KBOs: theory Regular-Sets.Regular_Exp Randomised_Social_Choice: theory Randomised_Social_Choice.Randomised_Social_Choice Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Map2 Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Abstract_Substitution Functional_Ordered_Resolution_Prover: theory Native_Word.More_Bits_Int Lambda_Free_KBOs: theory Lambda_Free_RPOs.Lambda_Encoding Functional_Ordered_Resolution_Prover: theory HOL-Word.Word Lambda_Free_KBOs: theory Regular-Sets.NDerivative Lambda_Free_KBOs: theory Regular-Sets.Relation_Interpretation Functional_Ordered_Resolution_Prover: theory Native_Word.Bits_Integer Smooth_Manifolds: theory Smooth_Manifolds.Analysis_More Functional_Ordered_Resolution_Prover: theory Regular-Sets.Regular_Set Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_RPOs Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_RPOs/document.pdf Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_RPOs/outline.pdf (see also /media/data/jenkins/workspace/isabelle-all/heaps/polyml-5.8_x86_64-linux/log/Lambda_Free_RPOs) assumes "rpo_optim ground_heads_var (>\<^sub>s) extf arity_sym arity_var" Proofs for inductive predicate(s) "gt" Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... fixes ground_heads_var :: "'v \<Rightarrow> 's set" gt_sym :: "'s \<Rightarrow> 's \<Rightarrow> bool" (infix \<open>>\<^sub>s\<close> 50) "'s \<Rightarrow> (('s, 'v) tm \<Rightarrow> ('s, 'v) tm \<Rightarrow> bool) \<Rightarrow> ('s, 'v) tm list \<Rightarrow> ('s, 'v) tm list \<Rightarrow> bool" and arity_sym :: "'s \<Rightarrow> enat" and arity_var :: "'v \<Rightarrow> enat" assumes "rpo ground_heads_var (>\<^sub>s) extf arity_sym arity_var" ### theory "Lambda_Free_RPOs.Lambda_Free_RPO_Optim" ### 0.622s elapsed time, 2.492s cpu time, 0.000s GC time Loading theory "Lambda_Free_RPOs.Lambda_Free_RPOs" ### theory "Lambda_Free_RPOs.Lambda_Free_RPOs" ### 0.855s elapsed time, 3.296s cpu time, 0.224s GC time isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_RPOs/document -o pdf -n document isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_RPOs/outline -o pdf -n outline -t /proof,/ML *** Failed to finish proof (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy"): *** (y, f z) \<in> r \<longrightarrow> y \<notin> range f\<rbrakk> *** \<Longrightarrow> \<exists>z\<in>Q. *** (f y, f z) \<in> r \<longrightarrow> *** At command "by" (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy") Lambda_Free_KBOs: theory Regular-Sets.Equivalence_Checking Smooth_Manifolds: theory Smooth_Manifolds.Chart Smooth_Manifolds: theory Smooth_Manifolds.Smooth Lambda_Free_KBOs: theory Regular-Sets.Regexp_Method Functional_Ordered_Resolution_Prover: theory Regular-Sets.Regular_Exp Smooth_Manifolds: theory Smooth_Manifolds.Topological_Manifold Lambda_Free_KBOs: theory Abstract-Rewriting.Abstract_Rewriting Smooth_Manifolds: theory Smooth_Manifolds.Bump_Function Smooth_Manifolds: theory Smooth_Manifolds.Differentiable_Manifold Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Lazy_List_Liminf Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Lazy_List_Chain Functional_Ordered_Resolution_Prover: theory Native_Word.Word_Misc Smooth_Manifolds: theory Smooth_Manifolds.Partition_Of_Unity Smooth_Manifolds: theory Smooth_Manifolds.Product_Manifold Smooth_Manifolds: theory Smooth_Manifolds.Projective_Space Lambda_Free_KBOs: theory Abstract-Rewriting.SN_Orders Smooth_Manifolds: theory Smooth_Manifolds.Sphere Smooth_Manifolds: theory Smooth_Manifolds.Tangent_Space Higher_Order_Terms: theory Higher_Order_Terms.Disjoint_Sets Higher_Order_Terms: theory Higher_Order_Terms.Term_Utils Higher_Order_Terms: theory Higher_Order_Terms.Find_First Functional_Ordered_Resolution_Prover: theory Regular-Sets.NDerivative Functional_Ordered_Resolution_Prover: theory Regular-Sets.Relation_Interpretation Higher_Order_Terms: theory HOL-Library.Infinite_Set Higher_Order_Terms: theory HOL-Library.Cancellation Higher_Order_Terms: theory HOL-ex.Unification Higher_Order_Terms: theory Deriving.Derive_Manager Lambda_Free_KBOs: theory Polynomials.Polynomials Higher_Order_Terms: theory Datatype_Order_Generator.Derive_Aux Higher_Order_Terms: theory Datatype_Order_Generator.Order_Generator Higher_Order_Terms: theory HOL-Library.Countable_Set Higher_Order_Terms: theory Higher_Order_Terms.Fresh_Monad Higher_Order_Terms: theory Higher_Order_Terms.Name Higher_Order_Terms: theory HOL-Library.Multiset Higher_Order_Terms: theory HOL-Library.Countable_Complete_Lattices Higher_Order_Terms: theory Higher_Order_Terms.Fresh_Class Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Noninterference_Generic_Unwinding Noninterference_Generic_Unwinding FAILED (see also /media/data/jenkins/workspace/isabelle-all/heaps/polyml-5.8_x86_64-linux/log/Noninterference_Generic_Unwinding) Loading theory "Noninterference_Generic_Unwinding.GenericUnwinding" Proofs for inductive predicate(s) "rel_induct_auxp" Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... *** Failed to apply initial proof method (line 689 of "$AFP/Noninterference_Generic_Unwinding/GenericUnwinding.thy"): *** 1. unaffected_domains I D {D y} (ys @ [y']) \<noteq> {} *** At command "proof" (line 689 of "$AFP/Noninterference_Generic_Unwinding/GenericUnwinding.thy") *** Failed to apply initial proof method (line 787 of "$AFP/Noninterference_Generic_Unwinding/GenericUnwinding.thy"): *** 1. unaffected_domains I D {D y} (zs @ [z]) \<noteq> {} *** At command "proof" (line 787 of "$AFP/Noninterference_Generic_Unwinding/GenericUnwinding.thy") ### theory "Noninterference_Generic_Unwinding.GenericUnwinding" ### 2.164s elapsed time, 4.876s cpu time, 0.148s GC time isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Noninterference_Generic_Unwinding/document -o pdf -n document isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Noninterference_Generic_Unwinding/outline -o pdf -n outline -t /proof,/ML *** Failed to build document in "/media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Noninterference_Generic_Unwinding/document" *** Failed to apply initial proof method (line 787 of "$AFP/Noninterference_Generic_Unwinding/GenericUnwinding.thy"): *** 1. unaffected_domains I D {D y} (zs @ [z]) \<noteq> {} *** At command "proof" (line 787 of "$AFP/Noninterference_Generic_Unwinding/GenericUnwinding.thy") *** Failed to apply initial proof method (line 689 of "$AFP/Noninterference_Generic_Unwinding/GenericUnwinding.thy"): *** 1. unaffected_domains I D {D y} (ys @ [y']) \<noteq> {} *** At command "proof" (line 689 of "$AFP/Noninterference_Generic_Unwinding/GenericUnwinding.thy") Higher_Order_Terms: theory Higher_Order_Terms.Term_Class Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_EPO Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_EPO/document.pdf Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_EPO/outline.pdf (see also /media/data/jenkins/workspace/isabelle-all/heaps/polyml-5.8_x86_64-linux/log/Lambda_Free_EPO) Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Proofs for inductive predicate(s) "gt_chop" Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Proofs for inductive predicate(s) "gt_diff" Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Proofs for inductive predicate(s) "gt_same" Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### theory "Lambda_Free_EPO.Lambda_Free_EPO" ### 1.094s elapsed time, 3.968s cpu time, 0.192s GC time \<lbrakk>?X \<in> ?C; ?A \<in> ?X\<rbrakk> \<Longrightarrow> ?A \<in> \<Union> ?C ?P ?a \<Longrightarrow> ?a \<in> {x. ?P x} isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_EPO/document -o pdf -n document isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_EPO/outline -o pdf -n outline -t /proof,/ML *** Failed to finish proof (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy"): *** (y, f z) \<in> r \<longrightarrow> y \<notin> range f\<rbrakk> *** \<Longrightarrow> \<exists>z\<in>Q. *** (f y, f z) \<in> r \<longrightarrow> *** At command "by" (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy") Higher_Order_Terms: theory HOL-Library.Order_Continuity Functional_Ordered_Resolution_Prover: theory Regular-Sets.Equivalence_Checking Smooth_Manifolds: theory Smooth_Manifolds.Cotangent_Space Functional_Ordered_Resolution_Prover: theory Regular-Sets.Regexp_Method Functional_Ordered_Resolution_Prover: theory Native_Word.Uint32 Higher_Order_Terms: theory HOL-Library.Extended_Nat Functional_Ordered_Resolution_Prover: theory Abstract-Rewriting.Abstract_Rewriting Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Proving_Process Higher_Order_Terms: theory HOL-Library.Multiset_Order Functional_Ordered_Resolution_Prover: theory Collections.HashCode Lambda_Free_KBOs: theory Lambda_Free_KBOs.Lambda_Free_KBO_Util Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.Standard_Redundancy Higher_Order_Terms: theory Lambda_Free_RPOs.Lambda_Free_Util Functional_Ordered_Resolution_Prover: theory Deriving.Hash_Generator Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Abstract_Matching Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Abstract_Unification Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.FO_Ordered_Resolution Lambda_Free_KBOs: theory Lambda_Free_KBOs.Lambda_Free_KBO_App Higher_Order_Terms: theory Lambda_Free_RPOs.Lambda_Free_Term Functional_Ordered_Resolution_Prover: theory Deriving.Hash_Instances Functional_Ordered_Resolution_Prover: theory Deriving.Derive Lambda_Free_KBOs: theory Lambda_Free_KBOs.Lambda_Free_KBO_Std Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Unification Lambda_Free_KBOs: theory Lambda_Free_KBOs.Lambda_Free_KBO_Basic Higher_Order_Terms: theory Higher_Order_Terms.Nterm Higher_Order_Terms: theory Higher_Order_Terms.Term Functional_Ordered_Resolution_Prover: theory Ordered_Resolution_Prover.FO_Ordered_Resolution_Prover Functional_Ordered_Resolution_Prover: theory First_Order_Terms.Matching Functional_Ordered_Resolution_Prover: theory Functional_Ordered_Resolution_Prover.IsaFoR_Term Higher_Order_Terms: theory Higher_Order_Terms.Unification_Compat Lambda_Free_KBOs: theory Lambda_Free_KBOs.Lambda_Encoding_KBO Higher_Order_Terms: theory Higher_Order_Terms.Pats Lambda_Free_KBOs: theory Lambda_Free_KBOs.Lambda_Free_TKBO_Coefs Higher_Order_Terms: theory Higher_Order_Terms.Term_to_Nterm Higher_Order_Terms: theory Higher_Order_Terms.Lambda_Free_Compat Functional_Ordered_Resolution_Prover: theory Functional_Ordered_Resolution_Prover.Weighted_FO_Ordered_Resolution_Prover Functional_Ordered_Resolution_Prover: theory Functional_Ordered_Resolution_Prover.Executable_Subsumption Lambda_Free_KBOs: theory Lambda_Free_KBOs.Lambda_Free_KBOs Functional_Ordered_Resolution_Prover: theory Functional_Ordered_Resolution_Prover.Deterministic_FO_Ordered_Resolution_Prover Timing Randomised_Social_Choice (4 threads, 14.854s elapsed time, 55.324s cpu time, 2.332s GC time, factor 3.72) Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Randomised_Social_Choice Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Randomised_Social_Choice/document.pdf Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Randomised_Social_Choice/outline.pdf Finished Randomised_Social_Choice (0:00:41 elapsed time, 0:01:40 cpu time, factor 2.42) SDS_Impossibility: theory SDS_Impossibility.SDS_Impossibility Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Valuation Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Valuation/document.pdf Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Valuation/outline.pdf (see also /media/data/jenkins/workspace/isabelle-all/heaps/polyml-5.8_x86_64-linux/log/Valuation) ### ("_applC" ("_position" K) ("_position" P)) ("_position" j)) ### Fortunately, only one parse tree is well-formed and type-correct, ### but you may still want to disambiguate your grammar or your input. ### Ignoring duplicate rewrite rule: \<lbrakk>Ring K; b\<^bsup>\<hyphen> K\<^esup> \<in> carrier K; ?y \<in> carrier K; ?z \<in> carrier K\<rbrakk> \<Longrightarrow> (?y \<plusminus> ?z) \<cdot>\<^sub>r b\<^bsup>\<hyphen> K\<^esup> = b\<^bsup>\<hyphen> K\<^esup> \<plusminus> ?z \<cdot>\<^sub>r b\<^bsup>\<hyphen> K\<^esup> isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Valuation/document -o pdf -n document isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Valuation/outline -o pdf -n outline -t /proof,/ML *** Failed to apply proof method (line 899 of "$AFP/Valuation/Valuation1.thy"): *** \<lbrakk>valuation K v; \<exists>x\<in>carrier K. 0 < v x; *** {x \<in> v ` carrier K. 0 < x} \<subseteq> LBset 1; *** AMin {x \<in> v ` carrier K. 0 < x} \<in> v ` carrier K \<and> *** 0 < AMin {x \<in> v ` carrier K. 0 < x}; *** x \<in> v ` carrier K \<and> 0 < x \<longrightarrow> *** AMin {x \<in> v ` carrier K. 0 < x} \<le> x; *** x \<in> carrier K; v x \<noteq> \<infinity>; v x \<noteq> 0; *** \<Longrightarrow> \<exists>a. *** AMin {x \<in> v ` carrier K. 0 < x} = ant a *** At command "apply" (line 899 of "$AFP/Valuation/Valuation1.thy") *** Failed to apply proof method (line 947 of "$AFP/Valuation/Valuation1.thy"): *** 1. valuation K v \<Longrightarrow> *** \<forall>w\<in>carrier K - {\<zero>}. *** \<exists>z. v w = z *\<^sub>a AMin {x \<in> v ` carrier K. 0 < x} *** At command "apply" (line 947 of "$AFP/Valuation/Valuation1.thy") *** Failed to apply proof method (line 837 of "$AFP/Valuation/Valuation1.thy"): *** 1. valuation K v \<Longrightarrow> *** {x \<in> v ` carrier K. 0 < x} \<noteq> {} *** At command "apply" (line 837 of "$AFP/Valuation/Valuation1.thy") Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Higher_Order_Terms Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Higher_Order_Terms/document.pdf Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Higher_Order_Terms/outline.pdf (see also /media/data/jenkins/workspace/isabelle-all/heaps/polyml-5.8_x86_64-linux/log/Higher_Order_Terms) ### Introduced fixed type variable(s): 'd, 'e in "f__" ### Introduced fixed type variable(s): 'd in "X__" ### Introduced fixed type variable(s): 'd, 'e, 'f in "R__" or "S__" ### Introduced fixed type variable(s): 'd, 'e in "R__" ### Ignoring duplicate rewrite rule: ### mset (map ?f1 ?xs1) \<equiv> image_mset ?f1 (mset ?xs1) ### Ignoring duplicate rewrite rule: ### mset (map ?f1 ?xs1) \<equiv> image_mset ?f1 (mset ?xs1) ### Introduced fixed type variable(s): 'd in "z__" ### Introduced fixed type variable(s): 'd in "P__" *** Failed to finish proof (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy"): *** (y, f z) \<in> r \<longrightarrow> y \<notin> range f\<rbrakk> *** \<Longrightarrow> \<exists>z\<in>Q. *** (f y, f z) \<in> r \<longrightarrow> *** At command "by" (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy") ### Metis: Unused theorems: "Term_Class.list_comb_cond_inj_2" ### Metis: Unused theorems: "Term_Class.list_comb_cond_inj_1" ### Rule already declared as introduction (intro) ### \<lbrakk>rel_option ?R ?x ?y; ### \<And>a b. ?R a b \<Longrightarrow> rel_option ?R (?f a) (?g b)\<rbrakk> ### \<Longrightarrow> rel_option ?R (?x \<bind> ?f) (?y \<bind> ?g) isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Higher_Order_Terms/document -o pdf -n document isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Higher_Order_Terms/outline -o pdf -n outline -t /proof,/ML *** Failed to finish proof (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy"): *** (y, f z) \<in> r \<longrightarrow> y \<notin> range f\<rbrakk> *** \<Longrightarrow> \<exists>z\<in>Q. *** (f y, f z) \<in> r \<longrightarrow> *** At command "by" (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy") Timing SDS_Impossibility (4 threads, 32.470s elapsed time, 77.196s cpu time, 1.640s GC time, factor 2.38) Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/SDS_Impossibility Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/SDS_Impossibility/document.pdf Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/SDS_Impossibility/outline.pdf Finished SDS_Impossibility (0:00:37 elapsed time, 0:01:26 cpu time, factor 2.31) Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_KBOs Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_KBOs/document.pdf Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_KBOs/outline.pdf (see also /media/data/jenkins/workspace/isabelle-all/heaps/polyml-5.8_x86_64-linux/log/Lambda_Free_KBOs) Proving the simplification rules ... Proofs for inductive predicate(s) "gt_diff" Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... Proofs for inductive predicate(s) "gt_same" Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... "('v \<Rightarrow> ('s, 'v) tm) \<Rightarrow> ('v pvar \<Rightarrow> zhmultiset) \<Rightarrow> 'v pvar \<Rightarrow> zhmultiset" ### theory "Lambda_Free_KBOs.Lambda_Free_TKBO_Coefs" ### 3.714s elapsed time, 7.768s cpu time, 0.632s GC time Loading theory "Lambda_Free_KBOs.Lambda_Free_KBOs" ### theory "Lambda_Free_KBOs.Lambda_Free_KBOs" ### 1.356s elapsed time, 2.852s cpu time, 0.304s GC time Found termination order: "size <*mlex*> {}" :: "('s, 'v) hd \<Rightarrow> ('s, 'v) hd \<Rightarrow> bool" isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_KBOs/document -o pdf -n document isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Lambda_Free_KBOs/outline -o pdf -n outline -t /proof,/ML *** Failed to finish proof (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy"): *** (y, f z) \<in> r \<longrightarrow> y \<notin> range f\<rbrakk> *** \<Longrightarrow> \<exists>z\<in>Q. *** (f y, f z) \<in> r \<longrightarrow> *** At command "by" (line 160 of "$AFP/Lambda_Free_RPOs/Lambda_Free_Util.thy") Browser info at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Functional_Ordered_Resolution_Prover Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Functional_Ordered_Resolution_Prover/document.pdf Document at /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Functional_Ordered_Resolution_Prover/outline.pdf Functional_Ordered_Resolution_Prover FAILED (see also /media/data/jenkins/workspace/isabelle-all/heaps/polyml-5.8_x86_64-linux/log/Functional_Ordered_Resolution_Prover) compare_order: register types in class compare_order, options: (linorder) or () countable: register datatypes is class countable equality: generate an equality function, options are () and (eq) hash_code: generate a hash function, options are () and (hashcode) hashable: register types in class hashable linorder: register types in class linorder, options: (linorder) or () *** Failed to finish proof (line 78 of "$AFP/Functional_Ordered_Resolution_Prover/Deterministic_FO_Ordered_Resolution_Prover.thy"): *** (y, f z) \<in> r \<longrightarrow> y \<notin> range f\<rbrakk> *** \<Longrightarrow> \<exists>z\<in>Q. *** (f y, f z) \<in> r \<longrightarrow> *** At command "by" (line 78 of "$AFP/Functional_Ordered_Resolution_Prover/Deterministic_FO_Ordered_Resolution_Prover.thy") ### Ignoring duplicate rewrite rule: ### mset (filter ?P1 ?xs1) \<equiv> filter_mset ?P1 (mset ?xs1) Testing conjecture with Quickcheck-narrowing... [1 of 5] Compiling Data_Bits ( /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Data_Bits.hs.hs, /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Data_Bits.hs.o ) [2 of 5] Compiling Typerep ( /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Typerep.hs.hs, /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Typerep.hs.o ) [3 of 5] Compiling Generated_Code ( /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Generated_Code.hs, /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Generated_Code.o ) [4 of 5] Compiling Narrowing_Engine ( /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Narrowing_Engine.hs, /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Narrowing_Engine.o ) [5 of 5] Compiling Main ( /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Main.hs, /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/Main.o ) Linking /tmp/isabelle-jenkins/process4227127210108451432/Quickcheck_Narrowing4615200/isabelle_quickcheck_narrowing ... Quickcheck found no counterexample. isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Functional_Ordered_Resolution_Prover/document -o pdf -n document isabelle document -d /media/data/jenkins/workspace/isabelle-all/browser_info/AFP/Functional_Ordered_Resolution_Prover/outline -o pdf -n outline -t /proof,/ML *** Failed to finish proof (line 78 of "$AFP/Functional_Ordered_Resolution_Prover/Deterministic_FO_Ordered_Resolution_Prover.thy"): *** (y, f z) \<in> r \<longrightarrow> y \<notin> range f\<rbrakk> *** \<Longrightarrow> \<exists>z\<in>Q. *** (f y, f z) \<in> r \<longrightarrow> *** At command "by" (line 78 of "$AFP/Functional_Ordered_Resolution_Prover/Deterministic_FO_Ordered_Resolution_Prover.thy") (see also /media/data/jenkins/workspace/isabelle-all/heaps/polyml-5.8_x86_64-linux/log/Smooth_Manifolds) *** Failed to finish proof (line 587 of "$AFP/Smooth_Manifolds/Analysis_More.thy"): *** \<lbrakk>U \<subseteq> f ` topspace T; *** openin T (f -` U \<inter> topspace T)\<rbrakk> *** \<Longrightarrow> openin T {x \<in> topspace T. f x \<in> U} *** At command "by" (line 587 of "$AFP/Smooth_Manifolds/Analysis_More.thy") *** Failed to finish proof (line 552 of "$AFP/Smooth_Manifolds/Analysis_More.thy"): *** \<forall>x\<in>topspace (Y i). g (f i x) \<in> topspace Z; *** openin (Y i) {x \<in> topspace (Y i). g (f i x) \<in> V}\<rbrakk> *** \<Longrightarrow> openin (Y i) *** ((g \<circ> f i) -` V \<inter> topspace (Y i)) *** At command "by" (line 552 of "$AFP/Smooth_Manifolds/Analysis_More.thy") *** Failed to finish proof (line 540 of "$AFP/Smooth_Manifolds/Analysis_More.thy"): *** \<lbrakk>\<And>i. f i \<in> topspace (Y i) \<rightarrow> X; *** \<forall>i. openin (Y i) (f i -` U \<inter> topspace (Y i))\<rbrakk> *** \<Longrightarrow> openin (Y i) *** {x \<in> topspace (Y i). f i x \<in> U} *** At command "by" (line 540 of "$AFP/Smooth_Manifolds/Analysis_More.thy") *** Failed to finish proof (line 442 of "$AFP/Smooth_Manifolds/Analysis_More.thy"): *** \<lbrakk>\<forall>x\<in>topspace T1. x \<in> topspace T2; *** openin T2 U \<longrightarrow> *** openin T1 {x \<in> topspace T1. x \<in> U}; *** \<Longrightarrow> openin T1 (X \<inter> topspace T1) *** openin T2 X \<longrightarrow> *** openin T1 (X \<inter> topspace T1); *** topspace T1 \<subseteq> topspace T2; openin T2 U\<rbrakk> *** \<Longrightarrow> openin T1 {x \<in> topspace T1. x \<in> U} *** At command "by" (line 442 of "$AFP/Smooth_Manifolds/Analysis_More.thy") Unfinished session(s): Functional_Ordered_Resolution_Prover, Higher_Order_Terms, Lambda_Free_EPO, Lambda_Free_KBOs, Lambda_Free_RPOs, Noninterference_Generic_Unwinding, Smooth_Manifolds, Valuation, Verified-Prover
Group AFP: 0:27:36 elapsed time, 0:45:27 cpu time, factor 1.65 Group main: 0:00:00 elapsed time Group doc: 0:00:00 elapsed time Group timing: 0:00:00 elapsed time Group large: 0:00:00 elapsed time Group no_doc: 0:00:00 elapsed time Overall: 0:21:39 elapsed time, 0:45:27 cpu time, factor 2.10
Session Lambda_Free_KBOs: FAILED 2 Session Smooth_Manifolds: FAILED 1 Session Functional_Ordered_Resolution_Prover: FAILED 2 Session Higher_Order_Terms: FAILED 2 Session Noninterference_Generic_Unwinding: FAILED 2 Session Lambda_Free_EPO: FAILED 2
[32mSuccess: Generated topics.html[0m [32mSuccess: Generated index.html[0m [32mSuccess: Generated html files for 466 entries[0m [32mSuccess: Generated statistics.html[0m [32mSuccess: Generated download.html[0m [32mSuccess: Generated about.html[0m [32mSuccess: Generated citing.html[0m [32mSuccess: Generated updating.html[0m [32mSuccess: Generated search.html[0m [32mSuccess: Generated submitting.html[0m [32mSuccess: Generated using.html[0m [32mSuccess: Generated rss.xml[0m [32mSuccess: Generated status.html[0m
Entry Noninterference_Generic_Unwinding: WARNING no maintainers specified
Build step 'Execute shell' marked build as failure Started calculate disk usage of build Finished Calculation of disk usage of build in 0 seconds Started calculate disk usage of workspace Finished Calculation of disk usage of workspace in 0 seconds