%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU169+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 : n032.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:43:00 EDT 2023 % Result : Theorem 6.81s 1.61s % Output : Proof 8.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : SEU169+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.31 % Computer : n032.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 300 % 0.11/0.31 % DateTime : Wed Aug 23 13:04:25 EDT 2023 % 0.11/0.31 % CPUTime : % 0.17/0.53 ________ _____ % 0.17/0.53 ___ __ \_________(_)________________________________ % 0.17/0.53 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.17/0.53 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.17/0.53 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.17/0.53 % 0.17/0.53 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.17/0.53 (2023-06-19) % 0.17/0.53 % 0.17/0.53 (c) Philipp Rümmer, 2009-2023 % 0.17/0.53 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.17/0.53 Amanda Stjerna. % 0.17/0.53 Free software under BSD-3-Clause. % 0.17/0.53 % 0.17/0.53 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.17/0.53 % 0.17/0.53 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.17/0.54 Running up to 7 provers in parallel. % 0.17/0.55 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.17/0.55 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.17/0.55 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.17/0.55 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.17/0.55 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.17/0.55 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.17/0.55 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.64/0.88 Prover 4: Preprocessing ... % 1.64/0.89 Prover 1: Preprocessing ... % 2.15/0.93 Prover 5: Preprocessing ... % 2.15/0.93 Prover 3: Preprocessing ... % 2.15/0.93 Prover 6: Preprocessing ... % 2.15/0.93 Prover 2: Preprocessing ... % 2.15/0.93 Prover 0: Preprocessing ... % 3.49/1.20 Prover 5: Proving ... % 4.02/1.24 Prover 2: Proving ... % 4.02/1.26 Prover 3: Warning: ignoring some quantifiers % 4.02/1.27 Prover 1: Warning: ignoring some quantifiers % 4.02/1.27 Prover 3: Constructing countermodel ... % 4.48/1.27 Prover 4: Warning: ignoring some quantifiers % 4.48/1.28 Prover 6: Proving ... % 4.48/1.28 Prover 1: Constructing countermodel ... % 4.48/1.28 Prover 0: Proving ... % 4.48/1.29 Prover 4: Constructing countermodel ... % 5.77/1.55 Prover 3: gave up % 6.44/1.55 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.49/1.59 Prover 7: Preprocessing ... % 6.81/1.61 Prover 2: proved (1062ms) % 6.81/1.61 % 6.81/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.81/1.61 % 6.81/1.61 Prover 6: stopped % 6.81/1.61 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.81/1.61 Prover 5: stopped % 6.81/1.62 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.81/1.62 Prover 0: stopped % 6.81/1.62 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.81/1.62 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.81/1.63 Prover 1: gave up % 6.81/1.63 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 6.81/1.64 Prover 8: Preprocessing ... % 7.05/1.65 Prover 7: Warning: ignoring some quantifiers % 7.05/1.66 Prover 13: Preprocessing ... % 7.05/1.66 Prover 7: Constructing countermodel ... % 7.05/1.66 Prover 16: Preprocessing ... % 7.05/1.66 Prover 11: Preprocessing ... % 7.05/1.67 Prover 10: Preprocessing ... % 7.05/1.69 Prover 13: Warning: ignoring some quantifiers % 7.05/1.69 Prover 10: Warning: ignoring some quantifiers % 7.05/1.70 Prover 10: Constructing countermodel ... % 7.05/1.70 Prover 13: Constructing countermodel ... % 7.05/1.72 Prover 8: Warning: ignoring some quantifiers % 7.05/1.72 Prover 8: Constructing countermodel ... % 7.05/1.73 Prover 16: Warning: ignoring some quantifiers % 7.05/1.74 Prover 16: Constructing countermodel ... % 7.78/1.78 Prover 11: Warning: ignoring some quantifiers % 7.78/1.79 Prover 11: Constructing countermodel ... % 8.20/1.81 Prover 7: Found proof (size 16) % 8.20/1.81 Prover 7: proved (256ms) % 8.20/1.81 Prover 10: stopped % 8.20/1.81 Prover 13: stopped % 8.20/1.81 Prover 4: stopped % 8.20/1.81 Prover 16: stopped % 8.20/1.81 Prover 11: stopped % 8.20/1.81 Prover 8: stopped % 8.20/1.81 % 8.20/1.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.20/1.81 % 8.20/1.81 % SZS output start Proof for theBenchmark % 8.20/1.81 Assumptions after simplification: % 8.20/1.81 --------------------------------- % 8.20/1.81 % 8.20/1.81 (d1_zfmisc_1) % 8.20/1.84 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (powerset(v0) = v1) | ~ $i(v2) % 8.20/1.84 | ~ $i(v1) | ~ $i(v0) | ~ subset(v2, v0) | in(v2, v1)) & ! [v0: $i] : ! % 8.20/1.84 [v1: $i] : ! [v2: $i] : ( ~ (powerset(v0) = v1) | ~ $i(v2) | ~ $i(v1) | ~ % 8.20/1.84 $i(v0) | ~ in(v2, v1) | subset(v2, v0)) & ? [v0: $i] : ! [v1: $i] : ! % 8.20/1.84 [v2: $i] : (v2 = v0 | ~ (powerset(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: % 8.20/1.84 $i] : ($i(v3) & ( ~ subset(v3, v1) | ~ in(v3, v0)) & (subset(v3, v1) | % 8.20/1.84 in(v3, v0)))) % 8.20/1.84 % 8.20/1.84 (d2_subset_1) % 8.20/1.85 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ element(v1, v0) | ~ % 8.20/1.85 empty(v0) | empty(v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) % 8.20/1.85 | ~ element(v1, v0) | empty(v0) | in(v1, v0)) & ! [v0: $i] : ! [v1: $i] : % 8.20/1.85 ( ~ $i(v1) | ~ $i(v0) | ~ empty(v1) | ~ empty(v0) | element(v1, v0)) & ! % 8.20/1.85 [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ in(v1, v0) | element(v1, % 8.20/1.85 v0) | empty(v0)) % 8.20/1.85 % 8.20/1.85 (d3_tarski) % 8.52/1.85 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 8.52/1.85 ~ subset(v0, v1) | ~ in(v2, v0) | in(v2, v1)) & ? [v0: $i] : ? [v1: $i] % 8.52/1.85 : ( ~ $i(v1) | ~ $i(v0) | subset(v0, v1) | ? [v2: $i] : ($i(v2) & in(v2, v0) % 8.52/1.85 & ~ in(v2, v1))) % 8.52/1.85 % 8.52/1.85 (l3_subset_1) % 8.52/1.85 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (powerset(v0) = v2 & % 8.52/1.85 $i(v3) & $i(v2) & $i(v1) & $i(v0) & element(v1, v2) & in(v3, v1) & ~ in(v3, % 8.52/1.85 v0)) % 8.52/1.85 % 8.52/1.85 (t7_boole) % 8.52/1.85 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ empty(v1) | ~ in(v0, % 8.52/1.85 v1)) % 8.52/1.85 % 8.52/1.85 Further assumptions not needed in the proof: % 8.52/1.85 -------------------------------------------- % 8.52/1.85 antisymmetry_r2_hidden, dt_k1_xboole_0, dt_k1_zfmisc_1, dt_m1_subset_1, % 8.52/1.85 existence_m1_subset_1, fc1_subset_1, fc1_xboole_0, rc1_subset_1, rc1_xboole_0, % 8.52/1.85 rc2_xboole_0, reflexivity_r1_tarski, t6_boole, t8_boole % 8.52/1.85 % 8.52/1.85 Those formulas are unsatisfiable: % 8.52/1.85 --------------------------------- % 8.52/1.85 % 8.52/1.85 Begin of proof % 8.52/1.85 | % 8.55/1.85 | ALPHA: (d1_zfmisc_1) implies: % 8.55/1.86 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (powerset(v0) = v1) | ~ % 8.55/1.86 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ in(v2, v1) | subset(v2, v0)) % 8.55/1.86 | % 8.55/1.86 | ALPHA: (d2_subset_1) implies: % 8.55/1.86 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ element(v1, v0) % 8.55/1.86 | | empty(v0) | in(v1, v0)) % 8.55/1.86 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ element(v1, v0) % 8.55/1.86 | | ~ empty(v0) | empty(v1)) % 8.55/1.86 | % 8.55/1.86 | ALPHA: (d3_tarski) implies: % 8.55/1.86 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 8.55/1.86 | $i(v0) | ~ subset(v0, v1) | ~ in(v2, v0) | in(v2, v1)) % 8.55/1.86 | % 8.55/1.86 | DELTA: instantiating (l3_subset_1) with fresh symbols all_20_0, all_20_1, % 8.55/1.86 | all_20_2, all_20_3 gives: % 8.55/1.86 | (5) powerset(all_20_3) = all_20_1 & $i(all_20_0) & $i(all_20_1) & % 8.55/1.86 | $i(all_20_2) & $i(all_20_3) & element(all_20_2, all_20_1) & % 8.55/1.86 | in(all_20_0, all_20_2) & ~ in(all_20_0, all_20_3) % 8.55/1.86 | % 8.55/1.86 | ALPHA: (5) implies: % 8.55/1.86 | (6) ~ in(all_20_0, all_20_3) % 8.55/1.86 | (7) in(all_20_0, all_20_2) % 8.55/1.86 | (8) element(all_20_2, all_20_1) % 8.55/1.86 | (9) $i(all_20_3) % 8.55/1.86 | (10) $i(all_20_2) % 8.55/1.86 | (11) $i(all_20_1) % 8.55/1.86 | (12) $i(all_20_0) % 8.55/1.86 | (13) powerset(all_20_3) = all_20_1 % 8.55/1.86 | % 8.55/1.86 | GROUND_INST: instantiating (2) with all_20_1, all_20_2, simplifying with (8), % 8.55/1.86 | (10), (11) gives: % 8.55/1.87 | (14) empty(all_20_1) | in(all_20_2, all_20_1) % 8.55/1.87 | % 8.55/1.87 | BETA: splitting (14) gives: % 8.55/1.87 | % 8.55/1.87 | Case 1: % 8.55/1.87 | | % 8.55/1.87 | | (15) empty(all_20_1) % 8.55/1.87 | | % 8.55/1.87 | | GROUND_INST: instantiating (3) with all_20_1, all_20_2, simplifying with % 8.55/1.87 | | (8), (10), (11), (15) gives: % 8.55/1.87 | | (16) empty(all_20_2) % 8.55/1.87 | | % 8.55/1.87 | | GROUND_INST: instantiating (t7_boole) with all_20_0, all_20_2, simplifying % 8.55/1.87 | | with (7), (10), (12), (16) gives: % 8.55/1.87 | | (17) $false % 8.55/1.87 | | % 8.55/1.87 | | CLOSE: (17) is inconsistent. % 8.55/1.87 | | % 8.55/1.87 | Case 2: % 8.55/1.87 | | % 8.55/1.87 | | (18) in(all_20_2, all_20_1) % 8.55/1.87 | | % 8.55/1.87 | | GROUND_INST: instantiating (1) with all_20_3, all_20_1, all_20_2, % 8.55/1.87 | | simplifying with (9), (10), (11), (13), (18) gives: % 8.55/1.87 | | (19) subset(all_20_2, all_20_3) % 8.55/1.87 | | % 8.55/1.87 | | GROUND_INST: instantiating (4) with all_20_2, all_20_3, all_20_0, % 8.55/1.87 | | simplifying with (6), (7), (9), (10), (12), (19) gives: % 8.55/1.87 | | (20) $false % 8.55/1.87 | | % 8.55/1.87 | | CLOSE: (20) is inconsistent. % 8.55/1.87 | | % 8.55/1.87 | End of split % 8.55/1.87 | % 8.55/1.87 End of proof % 8.55/1.87 % SZS output end Proof for theBenchmark % 8.55/1.87 % 8.55/1.87 1343ms %------------------------------------------------------------------------------