%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU122+2 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n002.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 : Thu Aug 31 17:42:36 EDT 2023 % Result : Theorem 5.81s 1.59s % Output : Proof 7.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU122+2 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n002.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 01:21:16 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.63 ________ _____ % 0.20/0.63 ___ __ \_________(_)________________________________ % 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.63 % 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.63 (2023-06-19) % 0.20/0.63 % 0.20/0.63 (c) Philipp Rümmer, 2009-2023 % 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.63 Amanda Stjerna. % 0.20/0.63 Free software under BSD-3-Clause. % 0.20/0.63 % 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.63 % 0.20/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 0.20/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.23/1.03 Prover 1: Preprocessing ... % 2.23/1.03 Prover 4: Preprocessing ... % 2.23/1.07 Prover 5: Preprocessing ... % 2.23/1.07 Prover 6: Preprocessing ... % 2.23/1.07 Prover 2: Preprocessing ... % 2.83/1.07 Prover 0: Preprocessing ... % 2.83/1.08 Prover 3: Preprocessing ... % 4.90/1.44 Prover 1: Warning: ignoring some quantifiers % 4.90/1.44 Prover 4: Warning: ignoring some quantifiers % 4.90/1.45 Prover 3: Warning: ignoring some quantifiers % 4.90/1.45 Prover 5: Proving ... % 4.90/1.45 Prover 6: Proving ... % 4.90/1.45 Prover 2: Proving ... % 4.90/1.46 Prover 1: Constructing countermodel ... % 4.90/1.46 Prover 3: Constructing countermodel ... % 4.90/1.47 Prover 4: Constructing countermodel ... % 5.72/1.51 Prover 0: Proving ... % 5.81/1.58 Prover 3: proved (926ms) % 5.81/1.59 % 5.81/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.81/1.59 % 5.81/1.59 Prover 6: stopped % 5.81/1.60 Prover 5: stopped % 5.81/1.60 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.81/1.60 Prover 0: stopped % 5.81/1.61 Prover 2: stopped % 6.48/1.61 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.48/1.61 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.48/1.61 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.48/1.61 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.48/1.61 Prover 4: Found proof (size 13) % 6.48/1.61 Prover 4: proved (955ms) % 6.48/1.61 Prover 1: Found proof (size 13) % 6.48/1.61 Prover 1: proved (963ms) % 6.48/1.62 Prover 7: Preprocessing ... % 6.48/1.63 Prover 8: Preprocessing ... % 6.48/1.64 Prover 10: Preprocessing ... % 6.48/1.64 Prover 13: Preprocessing ... % 6.48/1.64 Prover 11: Preprocessing ... % 6.48/1.64 Prover 7: stopped % 6.48/1.67 Prover 13: stopped % 6.48/1.67 Prover 10: stopped % 6.48/1.68 Prover 11: stopped % 6.99/1.72 Prover 8: Warning: ignoring some quantifiers % 6.99/1.73 Prover 8: Constructing countermodel ... % 6.99/1.74 Prover 8: stopped % 6.99/1.74 % 6.99/1.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.99/1.74 % 6.99/1.74 % SZS output start Proof for theBenchmark % 6.99/1.74 Assumptions after simplification: % 6.99/1.74 --------------------------------- % 6.99/1.74 % 6.99/1.74 (d1_xboole_0) % 6.99/1.77 $i(empty_set) & ! [v0: $i] : ( ~ (in(v0, empty_set) = 0) | ~ $i(v0)) & ? % 6.99/1.77 [v0: $i] : (v0 = empty_set | ~ $i(v0) | ? [v1: $i] : (in(v1, v0) = 0 & % 6.99/1.77 $i(v1))) % 6.99/1.77 % 6.99/1.77 (d3_tarski) % 6.99/1.77 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 6.99/1.77 (subset(v0, v1) = 0) | ~ (in(v2, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 6.99/1.77 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & in(v2, v0) = v4)) & ! [v0: $i] : ! % 6.99/1.77 [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ~ $i(v1) | ~ % 6.99/1.77 $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & in(v3, v1) = v4 & % 6.99/1.77 in(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 6.99/1.77 (subset(v0, v1) = 0) | ~ (in(v2, v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~ % 6.99/1.77 $i(v0) | in(v2, v1) = 0) % 6.99/1.77 % 6.99/1.77 (t2_xboole_1) % 7.44/1.78 $i(empty_set) & ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & subset(empty_set, % 7.44/1.78 v0) = v1 & $i(v0)) % 7.44/1.78 % 7.44/1.78 Further assumptions not needed in the proof: % 7.44/1.78 -------------------------------------------- % 7.44/1.78 antisymmetry_r2_hidden, commutativity_k3_xboole_0, d3_xboole_0, d7_xboole_0, % 7.44/1.78 dt_k1_xboole_0, dt_k3_xboole_0, fc1_xboole_0, idempotence_k3_xboole_0, % 7.44/1.78 rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski, symmetry_r1_xboole_0, % 7.44/1.78 t1_xboole_1, t3_xboole_0, t4_xboole_0, t6_boole, t7_boole, t8_boole % 7.44/1.78 % 7.44/1.78 Those formulas are unsatisfiable: % 7.44/1.78 --------------------------------- % 7.44/1.78 % 7.44/1.78 Begin of proof % 7.44/1.78 | % 7.44/1.78 | ALPHA: (d1_xboole_0) implies: % 7.44/1.78 | (1) ! [v0: $i] : ( ~ (in(v0, empty_set) = 0) | ~ $i(v0)) % 7.44/1.78 | % 7.44/1.78 | ALPHA: (d3_tarski) implies: % 7.44/1.78 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) % 7.44/1.78 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ % 7.44/1.78 | (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0 & $i(v3))) % 7.44/1.78 | % 7.44/1.78 | ALPHA: (t2_xboole_1) implies: % 7.44/1.78 | (3) $i(empty_set) % 7.44/1.78 | (4) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & subset(empty_set, v0) = v1 % 7.44/1.78 | & $i(v0)) % 7.44/1.78 | % 7.44/1.78 | DELTA: instantiating (4) with fresh symbols all_23_0, all_23_1 gives: % 7.44/1.78 | (5) ~ (all_23_0 = 0) & subset(empty_set, all_23_1) = all_23_0 & % 7.44/1.78 | $i(all_23_1) % 7.44/1.78 | % 7.44/1.78 | ALPHA: (5) implies: % 7.44/1.78 | (6) ~ (all_23_0 = 0) % 7.44/1.78 | (7) $i(all_23_1) % 7.44/1.78 | (8) subset(empty_set, all_23_1) = all_23_0 % 7.44/1.78 | % 7.44/1.79 | GROUND_INST: instantiating (2) with empty_set, all_23_1, all_23_0, simplifying % 7.49/1.79 | with (3), (7), (8) gives: % 7.49/1.79 | (9) all_23_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0, % 7.49/1.79 | all_23_1) = v1 & in(v0, empty_set) = 0 & $i(v0)) % 7.49/1.79 | % 7.49/1.79 | BETA: splitting (9) gives: % 7.49/1.79 | % 7.49/1.79 | Case 1: % 7.49/1.79 | | % 7.49/1.79 | | (10) all_23_0 = 0 % 7.49/1.79 | | % 7.49/1.79 | | REDUCE: (6), (10) imply: % 7.49/1.79 | | (11) $false % 7.49/1.79 | | % 7.49/1.79 | | CLOSE: (11) is inconsistent. % 7.49/1.79 | | % 7.49/1.79 | Case 2: % 7.49/1.79 | | % 7.49/1.79 | | (12) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0, all_23_1) = v1 & % 7.49/1.79 | | in(v0, empty_set) = 0 & $i(v0)) % 7.49/1.79 | | % 7.49/1.79 | | DELTA: instantiating (12) with fresh symbols all_38_0, all_38_1 gives: % 7.49/1.79 | | (13) ~ (all_38_0 = 0) & in(all_38_1, all_23_1) = all_38_0 & in(all_38_1, % 7.49/1.79 | | empty_set) = 0 & $i(all_38_1) % 7.49/1.79 | | % 7.49/1.79 | | ALPHA: (13) implies: % 7.49/1.79 | | (14) $i(all_38_1) % 7.49/1.79 | | (15) in(all_38_1, empty_set) = 0 % 7.49/1.79 | | % 7.49/1.79 | | GROUND_INST: instantiating (1) with all_38_1, simplifying with (14), (15) % 7.49/1.79 | | gives: % 7.49/1.79 | | (16) $false % 7.49/1.79 | | % 7.49/1.79 | | CLOSE: (16) is inconsistent. % 7.49/1.79 | | % 7.49/1.79 | End of split % 7.49/1.79 | % 7.49/1.79 End of proof % 7.49/1.79 % SZS output end Proof for theBenchmark % 7.49/1.79 % 7.49/1.79 1161ms %------------------------------------------------------------------------------