%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU143+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 : n021.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:45 EDT 2023 % Result : Theorem 9.94s 2.09s % Output : Proof 15.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU143+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.12/0.33 % Computer : n021.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Thu Aug 24 01:41:24 EDT 2023 % 0.12/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.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 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 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 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 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 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 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 % 3.09/1.15 Prover 1: Preprocessing ... % 3.09/1.15 Prover 4: Preprocessing ... % 3.09/1.18 Prover 0: Preprocessing ... % 3.09/1.18 Prover 5: Preprocessing ... % 3.09/1.18 Prover 6: Preprocessing ... % 3.09/1.18 Prover 3: Preprocessing ... % 3.09/1.18 Prover 2: Preprocessing ... % 7.94/1.83 Prover 5: Proving ... % 7.94/1.90 Prover 1: Warning: ignoring some quantifiers % 8.70/1.94 Prover 3: Warning: ignoring some quantifiers % 8.70/1.96 Prover 1: Constructing countermodel ... % 8.70/1.96 Prover 6: Proving ... % 9.31/2.02 Prover 3: Constructing countermodel ... % 9.31/2.03 Prover 4: Warning: ignoring some quantifiers % 9.31/2.04 Prover 2: Proving ... % 9.31/2.08 Prover 5: proved (1450ms) % 9.31/2.08 % 9.94/2.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.94/2.09 % 9.94/2.09 Prover 4: Constructing countermodel ... % 9.94/2.09 Prover 6: stopped % 9.94/2.09 Prover 2: stopped % 9.94/2.10 Prover 3: stopped % 9.94/2.10 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.94/2.10 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.94/2.10 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.94/2.10 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.94/2.18 Prover 8: Preprocessing ... % 10.72/2.19 Prover 7: Preprocessing ... % 10.72/2.19 Prover 10: Preprocessing ... % 10.72/2.19 Prover 11: Preprocessing ... % 10.72/2.20 Prover 0: Proving ... % 10.72/2.20 Prover 0: stopped % 10.72/2.22 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.72/2.29 Prover 13: Preprocessing ... % 12.41/2.42 Prover 7: Warning: ignoring some quantifiers % 12.41/2.43 Prover 10: Warning: ignoring some quantifiers % 12.41/2.45 Prover 10: Constructing countermodel ... % 12.41/2.45 Prover 7: Constructing countermodel ... % 12.41/2.45 Prover 13: Warning: ignoring some quantifiers % 12.41/2.46 Prover 8: Warning: ignoring some quantifiers % 12.41/2.47 Prover 1: gave up % 12.41/2.49 Prover 13: Constructing countermodel ... % 12.41/2.49 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 12.41/2.50 Prover 8: Constructing countermodel ... % 13.09/2.51 Prover 4: gave up % 13.09/2.53 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 13.09/2.54 Prover 16: Preprocessing ... % 13.09/2.54 Prover 7: Found proof (size 8) % 13.09/2.54 Prover 7: proved (451ms) % 13.09/2.55 Prover 10: Found proof (size 8) % 13.09/2.55 Prover 10: proved (445ms) % 13.09/2.55 Prover 13: stopped % 13.09/2.55 Prover 8: stopped % 13.70/2.58 Prover 11: Warning: ignoring some quantifiers % 13.70/2.59 Prover 16: stopped % 13.70/2.59 Prover 19: Preprocessing ... % 13.70/2.60 Prover 11: Constructing countermodel ... % 13.70/2.63 Prover 11: stopped % 14.38/2.79 Prover 19: Warning: ignoring some quantifiers % 14.76/2.81 Prover 19: Constructing countermodel ... % 14.76/2.82 Prover 19: stopped % 14.76/2.83 % 14.76/2.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.76/2.83 % 14.76/2.83 % SZS output start Proof for theBenchmark % 14.76/2.84 Assumptions after simplification: % 14.76/2.84 --------------------------------- % 14.76/2.84 % 14.76/2.84 (d1_tarski) % 14.76/2.88 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v0) = v1) | % 14.76/2.88 ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ in(v2, v1)) & ? [v0: $i] : ! [v1: % 14.76/2.88 $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v1) = v2) | ~ $i(v1) | ~ % 14.76/2.88 $i(v0) | ? [v3: $i] : ($i(v3) & ( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | % 14.76/2.88 in(v3, v0)))) & ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | % 14.76/2.88 ~ $i(v1) | ~ $i(v0) | in(v0, v1)) % 14.76/2.88 % 14.76/2.88 (d1_xboole_0) % 14.76/2.88 $i(empty_set) & ! [v0: $i] : ( ~ $i(v0) | ~ in(v0, empty_set)) & ? [v0: $i] % 14.76/2.88 : (v0 = empty_set | ~ $i(v0) | ? [v1: $i] : ($i(v1) & in(v1, v0))) % 14.76/2.88 % 14.76/2.88 (l1_zfmisc_1) % 15.14/2.88 $i(empty_set) & ? [v0: $i] : (singleton(v0) = empty_set & $i(v0)) % 15.14/2.88 % 15.14/2.88 Further assumptions not needed in the proof: % 15.14/2.88 -------------------------------------------- % 15.14/2.88 antisymmetry_r2_hidden, antisymmetry_r2_xboole_0, commutativity_k2_tarski, % 15.14/2.88 commutativity_k2_xboole_0, commutativity_k3_xboole_0, d10_xboole_0, d2_tarski, % 15.14/2.88 d2_xboole_0, d3_tarski, d3_xboole_0, d4_xboole_0, d7_xboole_0, d8_xboole_0, % 15.14/2.88 dt_k1_tarski, dt_k1_xboole_0, dt_k2_tarski, dt_k2_xboole_0, dt_k3_xboole_0, % 15.14/2.88 dt_k4_xboole_0, fc1_xboole_0, fc2_xboole_0, fc3_xboole_0, % 15.14/2.88 idempotence_k2_xboole_0, idempotence_k3_xboole_0, irreflexivity_r2_xboole_0, % 15.14/2.88 l32_xboole_1, rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski, % 15.14/2.88 symmetry_r1_xboole_0, t12_xboole_1, t17_xboole_1, t19_xboole_1, t1_boole, % 15.14/2.88 t1_xboole_1, t26_xboole_1, t28_xboole_1, t2_boole, t2_tarski, t2_xboole_1, % 15.14/2.88 t33_xboole_1, t36_xboole_1, t37_xboole_1, t39_xboole_1, t3_boole, t3_xboole_0, % 15.14/2.88 t3_xboole_1, t40_xboole_1, t45_xboole_1, t48_xboole_1, t4_boole, t4_xboole_0, % 15.14/2.88 t60_xboole_1, t63_xboole_1, t69_enumset1, t6_boole, t7_boole, t7_xboole_1, % 15.14/2.88 t83_xboole_1, t8_boole, t8_xboole_1 % 15.14/2.88 % 15.14/2.88 Those formulas are unsatisfiable: % 15.14/2.88 --------------------------------- % 15.14/2.88 % 15.14/2.88 Begin of proof % 15.14/2.88 | % 15.14/2.89 | ALPHA: (d1_tarski) implies: % 15.14/2.89 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v1) | ~ % 15.14/2.89 | $i(v0) | in(v0, v1)) % 15.14/2.89 | % 15.14/2.89 | ALPHA: (d1_xboole_0) implies: % 15.14/2.89 | (2) ! [v0: $i] : ( ~ $i(v0) | ~ in(v0, empty_set)) % 15.14/2.89 | % 15.14/2.89 | ALPHA: (l1_zfmisc_1) implies: % 15.14/2.89 | (3) $i(empty_set) % 15.14/2.89 | (4) ? [v0: $i] : (singleton(v0) = empty_set & $i(v0)) % 15.14/2.89 | % 15.14/2.89 | DELTA: instantiating (4) with fresh symbol all_58_0 gives: % 15.14/2.89 | (5) singleton(all_58_0) = empty_set & $i(all_58_0) % 15.14/2.89 | % 15.14/2.89 | ALPHA: (5) implies: % 15.14/2.89 | (6) $i(all_58_0) % 15.14/2.89 | (7) singleton(all_58_0) = empty_set % 15.14/2.89 | % 15.14/2.89 | GROUND_INST: instantiating (1) with all_58_0, empty_set, simplifying with (3), % 15.14/2.89 | (6), (7) gives: % 15.14/2.89 | (8) in(all_58_0, empty_set) % 15.14/2.89 | % 15.14/2.89 | GROUND_INST: instantiating (2) with all_58_0, simplifying with (6), (8) gives: % 15.14/2.89 | (9) $false % 15.14/2.89 | % 15.14/2.89 | CLOSE: (9) is inconsistent. % 15.14/2.89 | % 15.14/2.89 End of proof % 15.14/2.89 % SZS output end Proof for theBenchmark % 15.14/2.89 % 15.14/2.89 2289ms %------------------------------------------------------------------------------