%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU208+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 : n014.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:16 EDT 2023 % Result : Theorem 11.01s 2.21s % Output : Proof 13.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU208+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.33 % Computer : n014.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 : Wed Aug 23 19:15:34 EDT 2023 % 0.12/0.33 % CPUTime : % 0.18/0.58 ________ _____ % 0.18/0.58 ___ __ \_________(_)________________________________ % 0.18/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.58 % 0.18/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.58 (2023-06-19) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2023 % 0.18/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.58 Amanda Stjerna. % 0.18/0.58 Free software under BSD-3-Clause. % 0.18/0.58 % 0.18/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.58 % 0.18/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.18/0.60 Running up to 7 provers in parallel. % 0.18/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.23/0.95 Prover 1: Preprocessing ... % 2.23/0.95 Prover 4: Preprocessing ... % 2.52/0.99 Prover 3: Preprocessing ... % 2.52/0.99 Prover 2: Preprocessing ... % 2.52/0.99 Prover 5: Preprocessing ... % 2.52/0.99 Prover 0: Preprocessing ... % 2.52/0.99 Prover 6: Preprocessing ... % 4.93/1.44 Prover 1: Warning: ignoring some quantifiers % 5.59/1.50 Prover 3: Warning: ignoring some quantifiers % 5.59/1.50 Prover 1: Constructing countermodel ... % 5.59/1.51 Prover 5: Proving ... % 5.59/1.51 Prover 3: Constructing countermodel ... % 5.59/1.53 Prover 4: Warning: ignoring some quantifiers % 5.59/1.54 Prover 2: Proving ... % 5.59/1.55 Prover 6: Proving ... % 6.47/1.56 Prover 4: Constructing countermodel ... % 6.66/1.59 Prover 0: Proving ... % 9.25/2.07 Prover 3: gave up % 9.25/2.07 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.25/2.11 Prover 7: Preprocessing ... % 11.01/2.20 Prover 7: Warning: ignoring some quantifiers % 11.01/2.21 Prover 7: Constructing countermodel ... % 11.01/2.21 Prover 0: proved (1611ms) % 11.01/2.21 % 11.01/2.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.01/2.21 % 11.01/2.21 Prover 6: stopped % 11.01/2.22 Prover 5: stopped % 11.01/2.22 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.01/2.22 Prover 2: stopped % 11.01/2.22 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.01/2.22 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 11.01/2.22 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 11.01/2.25 Prover 8: Preprocessing ... % 11.01/2.26 Prover 10: Preprocessing ... % 11.01/2.27 Prover 13: Preprocessing ... % 11.64/2.28 Prover 11: Preprocessing ... % 11.97/2.36 Prover 10: Warning: ignoring some quantifiers % 11.97/2.37 Prover 10: Constructing countermodel ... % 11.97/2.38 Prover 8: Warning: ignoring some quantifiers % 11.97/2.38 Prover 13: Warning: ignoring some quantifiers % 11.97/2.40 Prover 8: Constructing countermodel ... % 12.66/2.41 Prover 13: Constructing countermodel ... % 12.66/2.42 Prover 11: Warning: ignoring some quantifiers % 12.66/2.44 Prover 11: Constructing countermodel ... % 12.66/2.45 Prover 7: Found proof (size 17) % 12.66/2.45 Prover 7: proved (383ms) % 12.66/2.45 Prover 13: stopped % 12.66/2.45 Prover 11: stopped % 12.66/2.45 Prover 10: stopped % 12.66/2.45 Prover 8: stopped % 12.66/2.45 Prover 1: stopped % 12.66/2.46 Prover 4: stopped % 12.66/2.46 % 12.66/2.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.66/2.46 % 12.66/2.46 % SZS output start Proof for theBenchmark % 12.66/2.46 Assumptions after simplification: % 12.66/2.46 --------------------------------- % 12.66/2.46 % 12.66/2.46 (d14_relat_1) % 13.19/2.49 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 13.19/2.49 $i] : ( ~ (relation_inverse_image(v0, v1) = v2) | ~ (ordered_pair(v3, v4) = % 13.19/2.49 v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 13.19/2.49 relation(v0) | ~ in(v5, v0) | ~ in(v4, v1) | in(v3, v2)) & ! [v0: $i] : % 13.19/2.49 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (relation_inverse_image(v0, v1) = % 13.19/2.49 v2) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | ~ % 13.19/2.49 in(v3, v2) | ? [v4: $i] : ? [v5: $i] : (ordered_pair(v3, v4) = v5 & $i(v5) % 13.19/2.49 & $i(v4) & in(v5, v0) & in(v4, v1))) & ? [v0: $i] : ! [v1: $i] : ! [v2: % 13.19/2.49 $i] : ! [v3: $i] : (v3 = v0 | ~ (relation_inverse_image(v1, v2) = v3) | ~ % 13.19/2.49 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v1) | ? [v4: $i] : ? [v5: $i] % 13.19/2.49 : ? [v6: $i] : ($i(v5) & $i(v4) & ( ~ in(v4, v0) | ! [v7: $i] : ! [v8: % 13.19/2.49 $i] : ( ~ (ordered_pair(v4, v7) = v8) | ~ $i(v7) | ~ in(v8, v1) | ~ % 13.19/2.49 in(v7, v2))) & (in(v4, v0) | (ordered_pair(v4, v5) = v6 & $i(v6) & % 13.19/2.49 in(v6, v1) & in(v5, v2))))) % 13.19/2.49 % 13.19/2.49 (d5_relat_1) % 13.19/2.49 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 13.19/2.49 (relation_rng(v0) = v1) | ~ (ordered_pair(v3, v2) = v4) | ~ $i(v3) | ~ % 13.19/2.49 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | ~ in(v4, v0) | in(v2, % 13.19/2.49 v1)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_rng(v0) = % 13.19/2.49 v1) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | ~ in(v2, v1) % 13.19/2.49 | ? [v3: $i] : ? [v4: $i] : (ordered_pair(v3, v2) = v4 & $i(v4) & $i(v3) & % 13.19/2.49 in(v4, v0))) & ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ % 13.19/2.49 (relation_rng(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v1) | ? [v3: % 13.19/2.49 $i] : ? [v4: $i] : ? [v5: $i] : ($i(v4) & $i(v3) & ( ~ in(v3, v0) | ! % 13.19/2.49 [v6: $i] : ! [v7: $i] : ( ~ (ordered_pair(v6, v3) = v7) | ~ $i(v6) | % 13.19/2.49 ~ in(v7, v1))) & (in(v3, v0) | (ordered_pair(v4, v3) = v5 & $i(v5) & % 13.19/2.49 in(v5, v1))))) % 13.19/2.49 % 13.19/2.49 (t166_relat_1) % 13.19/2.50 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 13.19/2.50 $i] : ? [v6: $i] : (relation_rng(v2) = v4 & relation_inverse_image(v2, v1) % 13.19/2.50 = v3 & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & relation(v2) & % 13.19/2.50 ((ordered_pair(v0, v5) = v6 & $i(v6) & in(v6, v2) & in(v5, v4) & in(v5, v1) % 13.19/2.50 & ~ in(v0, v3)) | (in(v0, v3) & ! [v7: $i] : ! [v8: $i] : ( ~ % 13.19/2.50 (ordered_pair(v0, v7) = v8) | ~ $i(v7) | ~ in(v8, v2) | ~ in(v7, % 13.19/2.50 v4) | ~ in(v7, v1))))) % 13.19/2.50 % 13.19/2.50 Further assumptions not needed in the proof: % 13.19/2.50 -------------------------------------------- % 13.19/2.50 antisymmetry_r2_hidden, cc1_relat_1, commutativity_k2_tarski, d5_tarski, % 13.19/2.50 dt_k10_relat_1, dt_k1_tarski, dt_k1_xboole_0, dt_k2_relat_1, dt_k2_tarski, % 13.19/2.50 dt_k4_tarski, dt_m1_subset_1, existence_m1_subset_1, fc1_xboole_0, fc1_zfmisc_1, % 13.19/2.50 fc2_subset_1, fc3_subset_1, fc4_relat_1, fc6_relat_1, fc8_relat_1, rc1_relat_1, % 13.19/2.50 rc1_xboole_0, rc2_relat_1, rc2_xboole_0, t1_subset, t2_subset, t6_boole, % 13.19/2.50 t7_boole, t8_boole % 13.19/2.50 % 13.19/2.50 Those formulas are unsatisfiable: % 13.19/2.50 --------------------------------- % 13.19/2.50 % 13.19/2.50 Begin of proof % 13.19/2.50 | % 13.19/2.50 | ALPHA: (d14_relat_1) implies: % 13.19/2.50 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 13.19/2.50 | (relation_inverse_image(v0, v1) = v2) | ~ $i(v3) | ~ $i(v2) | ~ % 13.19/2.50 | $i(v1) | ~ $i(v0) | ~ relation(v0) | ~ in(v3, v2) | ? [v4: $i] : % 13.19/2.50 | ? [v5: $i] : (ordered_pair(v3, v4) = v5 & $i(v5) & $i(v4) & in(v5, % 13.19/2.50 | v0) & in(v4, v1))) % 13.19/2.50 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 13.19/2.50 | ! [v5: $i] : ( ~ (relation_inverse_image(v0, v1) = v2) | ~ % 13.19/2.50 | (ordered_pair(v3, v4) = v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ % 13.19/2.50 | $i(v1) | ~ $i(v0) | ~ relation(v0) | ~ in(v5, v0) | ~ in(v4, v1) % 13.19/2.50 | | in(v3, v2)) % 13.19/2.50 | % 13.19/2.50 | ALPHA: (d5_relat_1) implies: % 13.19/2.50 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( % 13.19/2.50 | ~ (relation_rng(v0) = v1) | ~ (ordered_pair(v3, v2) = v4) | ~ % 13.19/2.50 | $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | ~ % 13.19/2.50 | in(v4, v0) | in(v2, v1)) % 13.19/2.50 | % 13.19/2.50 | DELTA: instantiating (t166_relat_1) with fresh symbols all_33_0, all_33_1, % 13.19/2.50 | all_33_2, all_33_3, all_33_4, all_33_5, all_33_6 gives: % 13.19/2.50 | (4) relation_rng(all_33_4) = all_33_2 & relation_inverse_image(all_33_4, % 13.19/2.50 | all_33_5) = all_33_3 & $i(all_33_1) & $i(all_33_2) & $i(all_33_3) & % 13.19/2.51 | $i(all_33_4) & $i(all_33_5) & $i(all_33_6) & relation(all_33_4) & % 13.19/2.51 | ((ordered_pair(all_33_6, all_33_1) = all_33_0 & $i(all_33_0) & % 13.19/2.51 | in(all_33_0, all_33_4) & in(all_33_1, all_33_2) & in(all_33_1, % 13.19/2.51 | all_33_5) & ~ in(all_33_6, all_33_3)) | (in(all_33_6, all_33_3) % 13.19/2.51 | & ! [v0: $i] : ! [v1: $i] : ( ~ (ordered_pair(all_33_6, v0) = v1) % 13.19/2.51 | | ~ $i(v0) | ~ in(v1, all_33_4) | ~ in(v0, all_33_2) | ~ % 13.19/2.51 | in(v0, all_33_5)))) % 13.19/2.51 | % 13.19/2.51 | ALPHA: (4) implies: % 13.19/2.51 | (5) relation(all_33_4) % 13.19/2.51 | (6) $i(all_33_6) % 13.19/2.51 | (7) $i(all_33_5) % 13.19/2.51 | (8) $i(all_33_4) % 13.19/2.51 | (9) $i(all_33_3) % 13.19/2.51 | (10) $i(all_33_2) % 13.19/2.51 | (11) $i(all_33_1) % 13.19/2.51 | (12) relation_inverse_image(all_33_4, all_33_5) = all_33_3 % 13.19/2.51 | (13) relation_rng(all_33_4) = all_33_2 % 13.19/2.51 | (14) (ordered_pair(all_33_6, all_33_1) = all_33_0 & $i(all_33_0) & % 13.19/2.51 | in(all_33_0, all_33_4) & in(all_33_1, all_33_2) & in(all_33_1, % 13.19/2.51 | all_33_5) & ~ in(all_33_6, all_33_3)) | (in(all_33_6, all_33_3) & % 13.19/2.51 | ! [v0: $i] : ! [v1: $i] : ( ~ (ordered_pair(all_33_6, v0) = v1) | % 13.19/2.51 | ~ $i(v0) | ~ in(v1, all_33_4) | ~ in(v0, all_33_2) | ~ in(v0, % 13.19/2.51 | all_33_5))) % 13.19/2.51 | % 13.19/2.51 | BETA: splitting (14) gives: % 13.19/2.51 | % 13.19/2.51 | Case 1: % 13.19/2.51 | | % 13.19/2.51 | | (15) ordered_pair(all_33_6, all_33_1) = all_33_0 & $i(all_33_0) & % 13.19/2.51 | | in(all_33_0, all_33_4) & in(all_33_1, all_33_2) & in(all_33_1, % 13.19/2.51 | | all_33_5) & ~ in(all_33_6, all_33_3) % 13.19/2.51 | | % 13.19/2.51 | | ALPHA: (15) implies: % 13.19/2.51 | | (16) ~ in(all_33_6, all_33_3) % 13.19/2.51 | | (17) in(all_33_1, all_33_5) % 13.19/2.51 | | (18) in(all_33_0, all_33_4) % 13.19/2.51 | | (19) ordered_pair(all_33_6, all_33_1) = all_33_0 % 13.19/2.51 | | % 13.19/2.51 | | GROUND_INST: instantiating (2) with all_33_4, all_33_5, all_33_3, all_33_6, % 13.19/2.51 | | all_33_1, all_33_0, simplifying with (5), (6), (7), (8), (9), % 13.19/2.51 | | (11), (12), (16), (17), (18), (19) gives: % 13.19/2.51 | | (20) $false % 13.19/2.51 | | % 13.19/2.51 | | CLOSE: (20) is inconsistent. % 13.19/2.51 | | % 13.19/2.51 | Case 2: % 13.19/2.51 | | % 13.19/2.51 | | (21) in(all_33_6, all_33_3) & ! [v0: $i] : ! [v1: $i] : ( ~ % 13.19/2.51 | | (ordered_pair(all_33_6, v0) = v1) | ~ $i(v0) | ~ in(v1, % 13.19/2.51 | | all_33_4) | ~ in(v0, all_33_2) | ~ in(v0, all_33_5)) % 13.19/2.51 | | % 13.19/2.51 | | ALPHA: (21) implies: % 13.19/2.51 | | (22) in(all_33_6, all_33_3) % 13.19/2.51 | | (23) ! [v0: $i] : ! [v1: $i] : ( ~ (ordered_pair(all_33_6, v0) = v1) | % 13.19/2.51 | | ~ $i(v0) | ~ in(v1, all_33_4) | ~ in(v0, all_33_2) | ~ in(v0, % 13.19/2.51 | | all_33_5)) % 13.19/2.51 | | % 13.19/2.51 | | GROUND_INST: instantiating (1) with all_33_4, all_33_5, all_33_3, all_33_6, % 13.19/2.51 | | simplifying with (5), (6), (7), (8), (9), (12), (22) gives: % 13.19/2.51 | | (24) ? [v0: $i] : ? [v1: $i] : (ordered_pair(all_33_6, v0) = v1 & % 13.19/2.51 | | $i(v1) & $i(v0) & in(v1, all_33_4) & in(v0, all_33_5)) % 13.19/2.51 | | % 13.19/2.51 | | DELTA: instantiating (24) with fresh symbols all_70_0, all_70_1 gives: % 13.19/2.52 | | (25) ordered_pair(all_33_6, all_70_1) = all_70_0 & $i(all_70_0) & % 13.19/2.52 | | $i(all_70_1) & in(all_70_0, all_33_4) & in(all_70_1, all_33_5) % 13.19/2.52 | | % 13.19/2.52 | | ALPHA: (25) implies: % 13.19/2.52 | | (26) in(all_70_1, all_33_5) % 13.19/2.52 | | (27) in(all_70_0, all_33_4) % 13.19/2.52 | | (28) $i(all_70_1) % 13.19/2.52 | | (29) ordered_pair(all_33_6, all_70_1) = all_70_0 % 13.19/2.52 | | % 13.19/2.52 | | GROUND_INST: instantiating (3) with all_33_4, all_33_2, all_70_1, all_33_6, % 13.19/2.52 | | all_70_0, simplifying with (5), (6), (8), (10), (13), (27), % 13.19/2.52 | | (28), (29) gives: % 13.19/2.52 | | (30) in(all_70_1, all_33_2) % 13.19/2.52 | | % 13.19/2.52 | | GROUND_INST: instantiating (23) with all_70_1, all_70_0, simplifying with % 13.19/2.52 | | (26), (27), (28), (29) gives: % 13.19/2.52 | | (31) ~ in(all_70_1, all_33_2) % 13.19/2.52 | | % 13.19/2.52 | | PRED_UNIFY: (30), (31) imply: % 13.19/2.52 | | (32) $false % 13.19/2.52 | | % 13.19/2.52 | | CLOSE: (32) is inconsistent. % 13.19/2.52 | | % 13.19/2.52 | End of split % 13.19/2.52 | % 13.19/2.52 End of proof % 13.19/2.52 % SZS output end Proof for theBenchmark % 13.19/2.52 % 13.19/2.52 1933ms %------------------------------------------------------------------------------