%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU143+1 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n009.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:44 EDT 2023 % Result : Theorem 4.10s 1.30s % Output : Proof 5.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU143+1 : 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.34 % Computer : n009.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.19/0.34 % CPULimit : 300 % 0.19/0.34 % WCLimit : 300 % 0.19/0.34 % DateTime : Wed Aug 23 23:32:36 EDT 2023 % 0.19/0.34 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox/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 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 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 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 % 1.73/0.95 Prover 1: Preprocessing ... % 1.73/0.95 Prover 4: Preprocessing ... % 2.12/1.00 Prover 5: Preprocessing ... % 2.12/1.00 Prover 6: Preprocessing ... % 2.12/1.00 Prover 2: Preprocessing ... % 2.12/1.00 Prover 3: Preprocessing ... % 2.12/1.00 Prover 0: Preprocessing ... % 3.25/1.17 Prover 3: Warning: ignoring some quantifiers % 3.25/1.17 Prover 4: Warning: ignoring some quantifiers % 3.25/1.17 Prover 6: Proving ... % 3.25/1.17 Prover 0: Proving ... % 3.25/1.17 Prover 2: Proving ... % 3.25/1.17 Prover 5: Proving ... % 3.25/1.17 Prover 1: Warning: ignoring some quantifiers % 3.25/1.18 Prover 4: Constructing countermodel ... % 3.25/1.18 Prover 3: Constructing countermodel ... % 3.25/1.18 Prover 1: Constructing countermodel ... % 4.10/1.30 Prover 2: proved (672ms) % 4.10/1.30 % 4.10/1.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.10/1.30 % 4.10/1.30 Prover 3: stopped % 4.10/1.30 Prover 0: stopped % 4.10/1.32 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.10/1.32 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.10/1.32 Prover 5: stopped % 4.10/1.32 Prover 6: stopped % 4.10/1.33 Prover 7: Preprocessing ... % 4.10/1.33 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.10/1.33 Prover 8: Preprocessing ... % 4.10/1.33 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.10/1.33 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.10/1.33 Prover 1: gave up % 4.10/1.34 Prover 10: Preprocessing ... % 4.10/1.34 Prover 13: Preprocessing ... % 4.10/1.35 Prover 11: Preprocessing ... % 4.10/1.35 Prover 7: Warning: ignoring some quantifiers % 4.10/1.35 Prover 7: Constructing countermodel ... % 4.10/1.35 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 4.10/1.36 Prover 16: Preprocessing ... % 4.10/1.37 Prover 4: gave up % 4.10/1.38 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 4.10/1.38 Prover 8: Warning: ignoring some quantifiers % 4.10/1.39 Prover 8: Constructing countermodel ... % 4.10/1.39 Prover 19: Preprocessing ... % 4.10/1.39 Prover 10: Warning: ignoring some quantifiers % 4.10/1.40 Prover 10: Constructing countermodel ... % 4.10/1.40 Prover 11: Warning: ignoring some quantifiers % 4.72/1.40 Prover 11: Constructing countermodel ... % 4.72/1.41 Prover 7: Found proof (size 8) % 4.72/1.41 Prover 7: proved (106ms) % 4.72/1.41 Prover 8: stopped % 4.72/1.41 Prover 11: stopped % 4.72/1.41 Prover 10: stopped % 4.72/1.41 Prover 16: Warning: ignoring some quantifiers % 4.72/1.42 Prover 16: Constructing countermodel ... % 4.72/1.42 Prover 16: stopped % 4.72/1.42 Prover 13: Warning: ignoring some quantifiers % 4.72/1.43 Prover 13: Constructing countermodel ... % 4.72/1.43 Prover 13: stopped % 5.32/1.45 Prover 19: Warning: ignoring some quantifiers % 5.32/1.45 Prover 19: Constructing countermodel ... % 5.32/1.46 Prover 19: stopped % 5.32/1.46 % 5.32/1.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.32/1.46 % 5.32/1.46 % SZS output start Proof for theBenchmark % 5.32/1.46 Assumptions after simplification: % 5.32/1.46 --------------------------------- % 5.32/1.46 % 5.32/1.46 (d1_tarski) % 5.32/1.49 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v0) = v1) | % 5.32/1.49 ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ in(v2, v1)) & ? [v0: $i] : ! [v1: % 5.32/1.49 $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v1) = v2) | ~ $i(v1) | ~ % 5.32/1.49 $i(v0) | ? [v3: $i] : ($i(v3) & ( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | % 5.32/1.49 in(v3, v0)))) & ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | % 5.32/1.49 ~ $i(v1) | ~ $i(v0) | in(v0, v1)) % 5.32/1.49 % 5.32/1.49 (d1_xboole_0) % 5.32/1.49 $i(empty_set) & ! [v0: $i] : ( ~ $i(v0) | ~ in(v0, empty_set)) & ? [v0: $i] % 5.32/1.49 : (v0 = empty_set | ~ $i(v0) | ? [v1: $i] : ($i(v1) & in(v1, v0))) % 5.32/1.50 % 5.32/1.50 (l1_zfmisc_1) % 5.32/1.50 $i(empty_set) & ? [v0: $i] : (singleton(v0) = empty_set & $i(v0)) % 5.32/1.50 % 5.32/1.50 Further assumptions not needed in the proof: % 5.32/1.50 -------------------------------------------- % 5.32/1.50 antisymmetry_r2_hidden, dt_k1_tarski, dt_k1_xboole_0, fc1_xboole_0, % 5.32/1.50 rc1_xboole_0, rc2_xboole_0 % 5.32/1.50 % 5.32/1.50 Those formulas are unsatisfiable: % 5.32/1.50 --------------------------------- % 5.32/1.50 % 5.32/1.50 Begin of proof % 5.32/1.50 | % 5.32/1.50 | ALPHA: (d1_tarski) implies: % 5.32/1.50 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v1) | ~ % 5.32/1.50 | $i(v0) | in(v0, v1)) % 5.32/1.50 | % 5.32/1.50 | ALPHA: (d1_xboole_0) implies: % 5.32/1.50 | (2) ! [v0: $i] : ( ~ $i(v0) | ~ in(v0, empty_set)) % 5.32/1.50 | % 5.32/1.50 | ALPHA: (l1_zfmisc_1) implies: % 5.32/1.50 | (3) $i(empty_set) % 5.32/1.50 | (4) ? [v0: $i] : (singleton(v0) = empty_set & $i(v0)) % 5.32/1.50 | % 5.32/1.50 | DELTA: instantiating (4) with fresh symbol all_7_0 gives: % 5.32/1.50 | (5) singleton(all_7_0) = empty_set & $i(all_7_0) % 5.32/1.50 | % 5.32/1.50 | ALPHA: (5) implies: % 5.32/1.50 | (6) $i(all_7_0) % 5.32/1.50 | (7) singleton(all_7_0) = empty_set % 5.32/1.50 | % 5.32/1.51 | GROUND_INST: instantiating (1) with all_7_0, empty_set, simplifying with (3), % 5.32/1.51 | (6), (7) gives: % 5.32/1.51 | (8) in(all_7_0, empty_set) % 5.32/1.51 | % 5.32/1.51 | GROUND_INST: instantiating (2) with all_7_0, simplifying with (6), (8) gives: % 5.32/1.51 | (9) $false % 5.32/1.51 | % 5.32/1.51 | CLOSE: (9) is inconsistent. % 5.32/1.51 | % 5.32/1.51 End of proof % 5.32/1.51 % SZS output end Proof for theBenchmark % 5.32/1.51 % 5.32/1.51 901ms %------------------------------------------------------------------------------