%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI181_1 : TPTP v8.1.2. Released v5.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n015.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Aug 30 17:47:11 EDT 2023 % Result : Theorem 3.11s 1.20s % Output : Proof 3.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : ARI181_1 : TPTP v8.1.2. Released v5.0.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.36 % Computer : n015.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 300 % 0.14/0.36 % DateTime : Tue Aug 29 18:57:56 EDT 2023 % 0.14/0.36 % CPUTime : % 0.22/0.63 ________ _____ % 0.22/0.63 ___ __ \_________(_)________________________________ % 0.22/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.63 % 0.22/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.63 (2023-06-19) % 0.22/0.63 % 0.22/0.63 (c) Philipp Rümmer, 2009-2023 % 0.22/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.63 Amanda Stjerna. % 0.22/0.63 Free software under BSD-3-Clause. % 0.22/0.63 % 0.22/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.63 % 0.22/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.22/0.65 Running up to 7 provers in parallel. % 0.22/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.22/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.22/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.74/1.01 Prover 4: Preprocessing ... % 1.74/1.01 Prover 1: Preprocessing ... % 2.12/1.06 Prover 5: Preprocessing ... % 2.12/1.06 Prover 6: Preprocessing ... % 2.12/1.06 Prover 0: Preprocessing ... % 2.12/1.06 Prover 2: Preprocessing ... % 2.12/1.06 Prover 3: Preprocessing ... % 2.37/1.10 Prover 1: Constructing countermodel ... % 2.37/1.10 Prover 4: Constructing countermodel ... % 2.37/1.10 Prover 3: Constructing countermodel ... % 2.37/1.11 Prover 0: Proving ... % 2.37/1.11 Prover 2: Proving ... % 2.37/1.11 Prover 6: Proving ... % 2.37/1.11 Prover 5: Proving ... % 3.11/1.20 Prover 3: proved (527ms) % 3.11/1.20 % 3.11/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.11/1.20 % 3.11/1.20 Prover 1: Found proof (size 9) % 3.11/1.20 Prover 1: proved (547ms) % 3.11/1.20 Prover 4: Found proof (size 9) % 3.11/1.20 Prover 4: proved (528ms) % 3.11/1.20 Prover 5: stopped % 3.11/1.20 Prover 0: stopped % 3.11/1.20 Prover 6: stopped % 3.11/1.20 Prover 2: stopped % 3.11/1.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.11/1.21 Prover 7: Preprocessing ... % 3.11/1.22 Prover 7: Constructing countermodel ... % 3.11/1.22 Prover 7: stopped % 3.11/1.22 % 3.11/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.11/1.22 % 3.11/1.23 % SZS output start Proof for theBenchmark % 3.11/1.23 Assumptions after simplification: % 3.11/1.23 --------------------------------- % 3.11/1.23 % 3.11/1.23 (co1) % 3.44/1.27 ? [v0: int] : ? [v1: int] : ? [v2: int] : ($lesseq(v2, 8) & f(v1) = v2 & % 3.44/1.27 f(v0) = v1 & f(6) = v0 & ! [v3: int] : ! [v4: int] : ( ~ ($lesseq(v4, v3)) % 3.44/1.27 | ~ (f(v3) = v4))) % 3.44/1.27 % 3.44/1.27 Those formulas are unsatisfiable: % 3.44/1.27 --------------------------------- % 3.44/1.27 % 3.44/1.27 Begin of proof % 3.44/1.27 | % 3.44/1.27 | DELTA: instantiating (co1) with fresh symbols all_3_0, all_3_1, all_3_2 gives: % 3.44/1.27 | (1) $lesseq(all_3_0, 8) & f(all_3_1) = all_3_0 & f(all_3_2) = all_3_1 & % 3.44/1.27 | f(6) = all_3_2 & ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, v0)) | % 3.44/1.27 | ~ (f(v0) = v1)) % 3.44/1.27 | % 3.44/1.27 | ALPHA: (1) implies: % 3.44/1.28 | (2) $lesseq(all_3_0, 8) % 3.44/1.28 | (3) f(6) = all_3_2 % 3.44/1.28 | (4) f(all_3_2) = all_3_1 % 3.44/1.28 | (5) f(all_3_1) = all_3_0 % 3.44/1.28 | (6) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, v0)) | ~ (f(v0) = v1)) % 3.44/1.28 | % 3.44/1.28 | GROUND_INST: instantiating (6) with 6, all_3_2, simplifying with (3) gives: % 3.44/1.28 | (7) $lesseq(7, all_3_2) % 3.44/1.28 | % 3.44/1.28 | GROUND_INST: instantiating (6) with all_3_2, all_3_1, simplifying with (4) % 3.44/1.28 | gives: % 3.44/1.28 | (8) $lesseq(1, $difference(all_3_1, all_3_2)) % 3.44/1.28 | % 3.44/1.28 | GROUND_INST: instantiating (6) with all_3_1, all_3_0, simplifying with (5) % 3.44/1.28 | gives: % 3.44/1.28 | (9) $lesseq(1, $difference(all_3_0, all_3_1)) % 3.44/1.28 | % 3.44/1.28 | COMBINE_INEQS: (2), (9) imply: % 3.44/1.28 | (10) $lesseq(all_3_1, 7) % 3.44/1.28 | % 3.44/1.28 | COMBINE_INEQS: (8), (10) imply: % 3.44/1.28 | (11) $lesseq(all_3_2, 6) % 3.44/1.28 | % 3.44/1.28 | COMBINE_INEQS: (7), (11) imply: % 3.44/1.28 | (12) $false % 3.44/1.28 | % 3.44/1.28 | CLOSE: (12) is inconsistent. % 3.44/1.28 | % 3.44/1.28 End of proof % 3.44/1.28 % SZS output end Proof for theBenchmark % 3.44/1.28 % 3.44/1.28 648ms %------------------------------------------------------------------------------