%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT020_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 : n028.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 22:18:54 EDT 2023 % Result : Theorem 4.61s 1.33s % Output : Proof 4.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT020_1 : TPTP v8.1.2. Released v5.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n028.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Thu Aug 24 14:22:19 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.63 Running up to 7 provers in parallel. % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.47/1.01 Prover 4: Preprocessing ... % 2.47/1.01 Prover 1: Preprocessing ... % 2.47/1.05 Prover 3: Preprocessing ... % 2.47/1.05 Prover 0: Preprocessing ... % 2.47/1.05 Prover 2: Preprocessing ... % 2.47/1.05 Prover 5: Preprocessing ... % 2.47/1.05 Prover 6: Preprocessing ... % 3.80/1.20 Prover 6: Constructing countermodel ... % 3.80/1.20 Prover 1: Constructing countermodel ... % 3.80/1.20 Prover 5: Proving ... % 3.80/1.20 Prover 0: Proving ... % 3.80/1.20 Prover 3: Constructing countermodel ... % 3.80/1.20 Prover 2: Proving ... % 3.80/1.20 Prover 4: Constructing countermodel ... % 4.61/1.33 Prover 3: proved (677ms) % 4.61/1.33 % 4.61/1.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.61/1.33 % 4.61/1.33 Prover 6: proved (684ms) % 4.61/1.33 % 4.61/1.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.61/1.33 % 4.61/1.33 Prover 1: Found proof (size 10) % 4.61/1.33 Prover 1: proved (693ms) % 4.61/1.33 Prover 2: stopped % 4.61/1.33 Prover 0: stopped % 4.61/1.33 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.61/1.33 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.61/1.33 Prover 5: stopped % 4.61/1.33 Prover 4: Found proof (size 10) % 4.61/1.33 Prover 4: proved (695ms) % 4.61/1.35 Prover 8: Preprocessing ... % 4.61/1.35 Prover 7: Preprocessing ... % 4.61/1.36 Prover 7: stopped % 4.61/1.39 Prover 8: Warning: ignoring some quantifiers % 4.61/1.39 Prover 8: Constructing countermodel ... % 4.61/1.40 Prover 8: stopped % 4.61/1.40 % 4.61/1.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.61/1.40 % 4.61/1.40 % SZS output start Proof for theBenchmark % 4.61/1.40 Assumptions after simplification: % 4.61/1.40 --------------------------------- % 4.61/1.40 % 4.61/1.40 (ax1) % 4.61/1.43 collection(empty) & ! [v0: int] : ~ (in(v0, empty) = 0) % 4.61/1.43 % 4.61/1.43 (ax4) % 4.61/1.44 ! [v0: int] : ! [v1: collection] : ! [v2: int] : ! [v3: collection] : ! % 4.61/1.44 [v4: int] : (v4 = 0 | ~ (add(v2, v1) = v3) | ~ (in(v0, v3) = v4) | ~ % 4.61/1.44 collection(v1) | ( ~ (v2 = v0) & ? [v5: int] : ( ~ (v5 = 0) & in(v0, v1) = % 4.61/1.44 v5))) & ! [v0: int] : ! [v1: collection] : ! [v2: int] : ! [v3: % 4.61/1.44 collection] : (v2 = v0 | ~ (add(v2, v1) = v3) | ~ (in(v0, v3) = 0) | ~ % 4.61/1.44 collection(v1) | in(v0, v1) = 0) % 4.61/1.44 % 4.61/1.44 (co1) % 4.61/1.44 collection(empty) & ? [v0: collection] : ? [v1: collection] : ? [v2: % 4.61/1.44 collection] : (add(5, empty) = v0 & add(3, v0) = v1 & add(1, v1) = v2 & % 4.61/1.44 in(4, v2) = 0 & collection(v2) & collection(v1) & collection(v0)) % 4.61/1.44 % 4.61/1.44 Further assumptions not needed in the proof: % 4.61/1.44 -------------------------------------------- % 4.61/1.44 ax2, ax3, ax5 % 4.61/1.44 % 4.61/1.44 Those formulas are unsatisfiable: % 4.61/1.44 --------------------------------- % 4.61/1.44 % 4.61/1.44 Begin of proof % 4.61/1.44 | % 4.61/1.44 | ALPHA: (ax1) implies: % 4.61/1.44 | (1) ! [v0: int] : ~ (in(v0, empty) = 0) % 4.61/1.44 | % 4.61/1.44 | ALPHA: (ax4) implies: % 4.61/1.44 | (2) ! [v0: int] : ! [v1: collection] : ! [v2: int] : ! [v3: collection] % 4.61/1.44 | : (v2 = v0 | ~ (add(v2, v1) = v3) | ~ (in(v0, v3) = 0) | ~ % 4.61/1.44 | collection(v1) | in(v0, v1) = 0) % 4.61/1.44 | % 4.61/1.44 | ALPHA: (co1) implies: % 4.61/1.44 | (3) collection(empty) % 4.61/1.45 | (4) ? [v0: collection] : ? [v1: collection] : ? [v2: collection] : % 4.61/1.45 | (add(5, empty) = v0 & add(3, v0) = v1 & add(1, v1) = v2 & in(4, v2) = 0 % 4.61/1.45 | & collection(v2) & collection(v1) & collection(v0)) % 4.61/1.45 | % 4.61/1.45 | DELTA: instantiating (4) with fresh symbols all_11_0, all_11_1, all_11_2 % 4.61/1.45 | gives: % 4.61/1.45 | (5) add(5, empty) = all_11_2 & add(3, all_11_2) = all_11_1 & add(1, % 4.61/1.45 | all_11_1) = all_11_0 & in(4, all_11_0) = 0 & collection(all_11_0) & % 4.61/1.45 | collection(all_11_1) & collection(all_11_2) % 4.61/1.45 | % 4.61/1.45 | ALPHA: (5) implies: % 4.61/1.45 | (6) collection(all_11_2) % 4.61/1.45 | (7) collection(all_11_1) % 4.61/1.45 | (8) in(4, all_11_0) = 0 % 4.61/1.45 | (9) add(1, all_11_1) = all_11_0 % 4.61/1.45 | (10) add(3, all_11_2) = all_11_1 % 4.61/1.45 | (11) add(5, empty) = all_11_2 % 4.61/1.45 | % 4.61/1.45 | GROUND_INST: instantiating (2) with 4, all_11_1, 1, all_11_0, simplifying with % 4.61/1.45 | (7), (8), (9) gives: % 4.61/1.45 | (12) in(4, all_11_1) = 0 % 4.61/1.45 | % 4.61/1.45 | GROUND_INST: instantiating (2) with 4, all_11_2, 3, all_11_1, simplifying with % 4.61/1.45 | (6), (10), (12) gives: % 4.61/1.45 | (13) in(4, all_11_2) = 0 % 4.61/1.45 | % 4.61/1.45 | GROUND_INST: instantiating (2) with 4, empty, 5, all_11_2, simplifying with % 4.61/1.45 | (3), (11), (13) gives: % 4.61/1.46 | (14) in(4, empty) = 0 % 4.61/1.46 | % 4.61/1.46 | GROUND_INST: instantiating (1) with 4, simplifying with (14) gives: % 4.61/1.46 | (15) $false % 4.61/1.46 | % 4.61/1.46 | CLOSE: (15) is inconsistent. % 4.61/1.46 | % 4.61/1.46 End of proof % 4.61/1.46 % SZS output end Proof for theBenchmark % 4.61/1.46 % 4.61/1.46 842ms %------------------------------------------------------------------------------