%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU267+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 : 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 : Thu Aug 31 17:43:45 EDT 2023 % Result : Theorem 5.87s 1.58s % Output : Proof 6.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU267+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.16/0.33 % Computer : n020.cluster.edu % 0.16/0.33 % Model : x86_64 x86_64 % 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.33 % Memory : 8042.1875MB % 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.33 % CPULimit : 300 % 0.16/0.33 % WCLimit : 300 % 0.16/0.33 % DateTime : Wed Aug 23 15:55:00 EDT 2023 % 0.16/0.34 % CPUTime : % 0.18/0.60 ________ _____ % 0.18/0.60 ___ __ \_________(_)________________________________ % 0.18/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.60 % 0.18/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.60 (2023-06-19) % 0.18/0.60 % 0.18/0.60 (c) Philipp Rümmer, 2009-2023 % 0.18/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.60 Amanda Stjerna. % 0.18/0.60 Free software under BSD-3-Clause. % 0.18/0.60 % 0.18/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.60 % 0.18/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.18/0.61 Running up to 7 provers in parallel. % 0.18/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.18/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.11/1.04 Prover 4: Preprocessing ... % 2.11/1.06 Prover 1: Preprocessing ... % 2.53/1.09 Prover 5: Preprocessing ... % 2.53/1.09 Prover 2: Preprocessing ... % 2.53/1.09 Prover 0: Preprocessing ... % 2.53/1.09 Prover 3: Preprocessing ... % 2.53/1.09 Prover 6: Preprocessing ... % 4.28/1.38 Prover 1: Warning: ignoring some quantifiers % 4.28/1.38 Prover 4: Warning: ignoring some quantifiers % 4.28/1.40 Prover 3: Warning: ignoring some quantifiers % 4.28/1.41 Prover 3: Constructing countermodel ... % 4.28/1.41 Prover 4: Constructing countermodel ... % 4.28/1.41 Prover 6: Proving ... % 4.28/1.41 Prover 0: Proving ... % 4.28/1.41 Prover 5: Proving ... % 4.28/1.42 Prover 1: Constructing countermodel ... % 5.13/1.53 Prover 2: Proving ... % 5.87/1.58 Prover 4: Found proof (size 11) % 5.87/1.58 Prover 4: proved (950ms) % 5.87/1.58 Prover 3: stopped % 5.87/1.58 Prover 6: stopped % 5.87/1.58 Prover 2: stopped % 5.87/1.58 Prover 1: stopped % 5.87/1.58 Prover 0: stopped % 5.87/1.58 Prover 5: stopped % 5.87/1.58 % 5.87/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.87/1.58 % 5.87/1.59 % SZS output start Proof for theBenchmark % 5.87/1.59 Assumptions after simplification: % 5.87/1.59 --------------------------------- % 5.87/1.59 % 5.87/1.59 (d1_mcart_1) % 6.07/1.63 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 6.07/1.63 $i] : (v2 = v1 | ~ (pair_first(v0) = v1) | ~ (ordered_pair(v4, v5) = v0) | % 6.07/1.63 ~ (ordered_pair(v2, v3) = v0) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ % 6.07/1.63 $i(v2) | ~ $i(v1) | ~ $i(v0)) & ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 6.07/1.63 ! [v3: $i] : ! [v4: $i] : (v2 = v0 | ~ (pair_first(v1) = v2) | ~ % 6.07/1.63 (ordered_pair(v3, v4) = v1) | ~ $i(v4) | ~ $i(v3) | ~ $i(v1) | ~ $i(v0) % 6.07/1.63 | ? [v5: $i] : ? [v6: $i] : ( ~ (v5 = v0) & ordered_pair(v5, v6) = v1 & % 6.07/1.63 $i(v6) & $i(v5))) % 6.07/1.63 % 6.07/1.63 (d2_mcart_1) % 6.07/1.64 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 6.07/1.64 $i] : (v3 = v1 | ~ (pair_second(v0) = v1) | ~ (ordered_pair(v4, v5) = v0) % 6.07/1.64 | ~ (ordered_pair(v2, v3) = v0) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ % 6.07/1.64 $i(v2) | ~ $i(v1) | ~ $i(v0)) & ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 6.07/1.64 ! [v3: $i] : ! [v4: $i] : (v2 = v0 | ~ (pair_second(v1) = v2) | ~ % 6.07/1.64 (ordered_pair(v3, v4) = v1) | ~ $i(v4) | ~ $i(v3) | ~ $i(v1) | ~ $i(v0) % 6.07/1.64 | ? [v5: $i] : ? [v6: $i] : ( ~ (v6 = v0) & ordered_pair(v5, v6) = v1 & % 6.07/1.64 $i(v6) & $i(v5))) % 6.07/1.64 % 6.07/1.64 (t7_mcart_1) % 6.17/1.64 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 6.17/1.64 (pair_second(v2) = v4 & pair_first(v2) = v3 & ordered_pair(v0, v1) = v2 & % 6.17/1.64 $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ( ~ (v4 = v1) | ~ (v3 = v0))) % 6.17/1.64 % 6.17/1.64 Further assumptions not needed in the proof: % 6.17/1.64 -------------------------------------------- % 6.17/1.64 antisymmetry_r2_hidden, dt_k1_mcart_1, dt_k1_xboole_0, dt_k2_mcart_1, % 6.17/1.64 dt_k4_tarski, dt_m1_subset_1, existence_m1_subset_1, fc1_xboole_0, fc1_zfmisc_1, % 6.17/1.64 rc1_xboole_0, rc2_xboole_0, t1_subset, t2_subset, t6_boole, t7_boole, t8_boole % 6.17/1.64 % 6.17/1.64 Those formulas are unsatisfiable: % 6.17/1.64 --------------------------------- % 6.17/1.64 % 6.17/1.64 Begin of proof % 6.17/1.64 | % 6.17/1.64 | ALPHA: (d1_mcart_1) implies: % 6.17/1.64 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 6.17/1.64 | ! [v5: $i] : (v2 = v1 | ~ (pair_first(v0) = v1) | ~ (ordered_pair(v4, % 6.17/1.64 | v5) = v0) | ~ (ordered_pair(v2, v3) = v0) | ~ $i(v5) | ~ % 6.17/1.64 | $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) % 6.17/1.64 | % 6.17/1.64 | ALPHA: (d2_mcart_1) implies: % 6.17/1.65 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 6.17/1.65 | ! [v5: $i] : (v3 = v1 | ~ (pair_second(v0) = v1) | ~ % 6.17/1.65 | (ordered_pair(v4, v5) = v0) | ~ (ordered_pair(v2, v3) = v0) | ~ % 6.17/1.65 | $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) % 6.17/1.65 | % 6.17/1.65 | DELTA: instantiating (t7_mcart_1) with fresh symbols all_18_0, all_18_1, % 6.17/1.65 | all_18_2, all_18_3, all_18_4 gives: % 6.17/1.65 | (3) pair_second(all_18_2) = all_18_0 & pair_first(all_18_2) = all_18_1 & % 6.17/1.65 | ordered_pair(all_18_4, all_18_3) = all_18_2 & $i(all_18_0) & % 6.17/1.65 | $i(all_18_1) & $i(all_18_2) & $i(all_18_3) & $i(all_18_4) & ( ~ % 6.17/1.65 | (all_18_0 = all_18_3) | ~ (all_18_1 = all_18_4)) % 6.17/1.65 | % 6.17/1.65 | ALPHA: (3) implies: % 6.17/1.65 | (4) $i(all_18_4) % 6.17/1.65 | (5) $i(all_18_3) % 6.17/1.65 | (6) $i(all_18_2) % 6.17/1.65 | (7) $i(all_18_1) % 6.17/1.65 | (8) $i(all_18_0) % 6.17/1.65 | (9) ordered_pair(all_18_4, all_18_3) = all_18_2 % 6.17/1.65 | (10) pair_first(all_18_2) = all_18_1 % 6.17/1.65 | (11) pair_second(all_18_2) = all_18_0 % 6.17/1.65 | (12) ~ (all_18_0 = all_18_3) | ~ (all_18_1 = all_18_4) % 6.17/1.65 | % 6.17/1.66 | GROUND_INST: instantiating (1) with all_18_2, all_18_1, all_18_4, all_18_3, % 6.17/1.66 | all_18_4, all_18_3, simplifying with (4), (5), (6), (7), (9), % 6.17/1.66 | (10) gives: % 6.17/1.66 | (13) all_18_1 = all_18_4 % 6.17/1.66 | % 6.17/1.66 | GROUND_INST: instantiating (2) with all_18_2, all_18_0, all_18_4, all_18_3, % 6.17/1.66 | all_18_4, all_18_3, simplifying with (4), (5), (6), (8), (9), % 6.17/1.66 | (11) gives: % 6.17/1.66 | (14) all_18_0 = all_18_3 % 6.17/1.66 | % 6.17/1.66 | BETA: splitting (12) gives: % 6.17/1.66 | % 6.17/1.66 | Case 1: % 6.17/1.66 | | % 6.17/1.66 | | (15) ~ (all_18_0 = all_18_3) % 6.17/1.66 | | % 6.17/1.66 | | REDUCE: (14), (15) imply: % 6.17/1.66 | | (16) $false % 6.17/1.66 | | % 6.17/1.66 | | CLOSE: (16) is inconsistent. % 6.17/1.66 | | % 6.17/1.66 | Case 2: % 6.17/1.66 | | % 6.17/1.66 | | (17) ~ (all_18_1 = all_18_4) % 6.17/1.66 | | % 6.17/1.66 | | REDUCE: (13), (17) imply: % 6.17/1.66 | | (18) $false % 6.17/1.66 | | % 6.17/1.66 | | CLOSE: (18) is inconsistent. % 6.17/1.66 | | % 6.17/1.66 | End of split % 6.17/1.66 | % 6.17/1.66 End of proof % 6.17/1.66 % SZS output end Proof for theBenchmark % 6.17/1.66 % 6.17/1.66 1061ms %------------------------------------------------------------------------------