%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT030_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 : n020.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:56 EDT 2023 % Result : Theorem 4.49s 1.41s % Output : Proof 5.76s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT030_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 : n020.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:49:45 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.43/1.08 Prover 4: Preprocessing ... % 2.43/1.08 Prover 1: Preprocessing ... % 2.85/1.12 Prover 5: Preprocessing ... % 2.85/1.12 Prover 3: Preprocessing ... % 2.85/1.12 Prover 2: Preprocessing ... % 2.85/1.12 Prover 6: Preprocessing ... % 2.85/1.12 Prover 0: Preprocessing ... % 3.79/1.26 Prover 5: Proving ... % 3.79/1.26 Prover 0: Proving ... % 3.79/1.27 Prover 2: Proving ... % 3.79/1.28 Prover 1: Constructing countermodel ... % 3.79/1.28 Prover 4: Constructing countermodel ... % 3.79/1.29 Prover 6: Proving ... % 3.79/1.30 Prover 3: Constructing countermodel ... % 4.49/1.40 Prover 4: Found proof (size 10) % 4.49/1.41 Prover 1: Found proof (size 12) % 4.49/1.41 Prover 2: proved (789ms) % 4.49/1.41 % 4.49/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.49/1.41 % 4.49/1.41 Prover 3: proved (780ms) % 4.49/1.41 % 4.49/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.49/1.41 % 4.49/1.43 Prover 1: proved (788ms) % 4.49/1.43 Prover 4: proved (779ms) % 4.49/1.43 Prover 5: proved (786ms) % 4.49/1.43 Prover 0: proved (792ms) % 4.49/1.43 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.49/1.43 Prover 6: stopped % 4.49/1.43 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.49/1.44 Prover 7: Preprocessing ... % 4.49/1.45 Prover 8: Preprocessing ... % 4.49/1.45 Prover 7: stopped % 5.09/1.50 Prover 8: Warning: ignoring some quantifiers % 5.09/1.50 Prover 8: Constructing countermodel ... % 5.09/1.51 Prover 8: stopped % 5.09/1.51 % 5.09/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.09/1.51 % 5.09/1.51 % SZS output start Proof for theBenchmark % 5.09/1.52 Assumptions after simplification: % 5.09/1.52 --------------------------------- % 5.09/1.52 % 5.09/1.52 (co1) % 5.09/1.54 ? [v0: collection] : ? [v1: collection] : (collection(v1) & collection(v0) & % 5.09/1.54 ! [v2: int] : ( ~ ($lesseq(v2, 0) | ~ (in(v2, v1) = 0)) & ! [v2: int] : ( % 5.09/1.54 ~ (in(v2, v0) = 0) | ? [v3: int] : (in($difference(v2, v3), v1) = 0 & % 5.09/1.54 in(v3, v1) = 0)) & ? [v2: int] : ($lesseq(v2, 1) & in(v2, v0) = 0)) % 5.09/1.54 % 5.09/1.54 Further assumptions not needed in the proof: % 5.09/1.54 -------------------------------------------- % 5.09/1.54 ax1, ax2, ax3, ax4, ax5 % 5.09/1.54 % 5.09/1.54 Those formulas are unsatisfiable: % 5.09/1.54 --------------------------------- % 5.09/1.54 % 5.09/1.54 Begin of proof % 5.09/1.54 | % 5.09/1.54 | DELTA: instantiating (co1) with fresh symbols all_11_0, all_11_1 gives: % 5.09/1.54 | (1) collection(all_11_0) & collection(all_11_1) & ! [v0: int] : ( ~ % 5.09/1.54 | ($lesseq(v0, 0) | ~ (in(v0, all_11_0) = 0)) & ! [v0: int] : ( ~ % 5.09/1.54 | (in(v0, all_11_1) = 0) | ? [v1: int] : (in($difference(v0, v1), % 5.09/1.54 | all_11_0) = 0 & in(v1, all_11_0) = 0)) & ? [v0: int] : % 5.09/1.54 | ($lesseq(v0, 1) & in(v0, all_11_1) = 0) % 5.09/1.54 | % 5.09/1.54 | ALPHA: (1) implies: % 5.09/1.55 | (2) ! [v0: int] : ( ~ (in(v0, all_11_1) = 0) | ? [v1: int] : % 5.09/1.55 | (in($difference(v0, v1), all_11_0) = 0 & in(v1, all_11_0) = 0)) % 5.09/1.55 | (3) ! [v0: int] : ( ~ ($lesseq(v0, 0) | ~ (in(v0, all_11_0) = 0)) % 5.09/1.55 | (4) ? [v0: int] : ($lesseq(v0, 1) & in(v0, all_11_1) = 0) % 5.09/1.55 | % 5.09/1.55 | DELTA: instantiating (4) with fresh symbol all_14_0 gives: % 5.09/1.55 | (5) $lesseq(all_14_0, 1) & in(all_14_0, all_11_1) = 0 % 5.09/1.55 | % 5.09/1.55 | ALPHA: (5) implies: % 5.09/1.55 | (6) $lesseq(all_14_0, 1) % 5.09/1.55 | (7) in(all_14_0, all_11_1) = 0 % 5.09/1.55 | % 5.09/1.55 | GROUND_INST: instantiating (2) with all_14_0, simplifying with (7) gives: % 5.09/1.55 | (8) ? [v0: int] : (in($difference(all_14_0, v0), all_11_0) = 0 & in(v0, % 5.09/1.55 | all_11_0) = 0) % 5.09/1.55 | % 5.09/1.55 | DELTA: instantiating (8) with fresh symbol all_25_0 gives: % 5.09/1.55 | (9) in($difference(all_14_0, all_25_0), all_11_0) = 0 & in(all_25_0, % 5.09/1.55 | all_11_0) = 0 % 5.09/1.55 | % 5.09/1.55 | ALPHA: (9) implies: % 5.09/1.55 | (10) in(all_25_0, all_11_0) = 0 % 5.09/1.55 | (11) in($difference(all_14_0, all_25_0), all_11_0) = 0 % 5.09/1.55 | % 5.09/1.55 | GROUND_INST: instantiating (3) with all_25_0, simplifying with (10) gives: % 5.09/1.55 | (12) $lesseq(1, all_25_0) % 5.09/1.55 | % 5.09/1.55 | GROUND_INST: instantiating (3) with $difference(all_14_0, all_25_0), % 5.09/1.55 | simplifying with (11) gives: % 5.09/1.55 | (13) $lesseq(1, $difference(all_14_0, all_25_0)) % 5.09/1.55 | % 5.09/1.55 | COMBINE_INEQS: (12), (13) imply: % 5.09/1.56 | (14) $lesseq(2, all_14_0) % 5.09/1.56 | % 5.09/1.56 | COMBINE_INEQS: (6), (14) imply: % 5.09/1.56 | (15) $false % 5.76/1.56 | % 5.76/1.56 | CLOSE: (15) is inconsistent. % 5.76/1.56 | % 5.76/1.56 End of proof % 5.76/1.56 % SZS output end Proof for theBenchmark % 5.76/1.56 % 5.76/1.56 953ms %------------------------------------------------------------------------------