%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KLE021+1 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n022.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 05:34:14 EDT 2023 % Result : Theorem 7.93s 1.85s % Output : Proof 10.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KLE021+1 : TPTP v8.1.2. Released v4.0.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n022.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Tue Aug 29 12:21:53 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.57/1.08 Prover 1: Preprocessing ... % 2.57/1.08 Prover 4: Preprocessing ... % 2.79/1.12 Prover 0: Preprocessing ... % 2.79/1.12 Prover 2: Preprocessing ... % 2.79/1.12 Prover 5: Preprocessing ... % 2.79/1.12 Prover 6: Preprocessing ... % 2.79/1.12 Prover 3: Preprocessing ... % 4.51/1.43 Prover 1: Constructing countermodel ... % 5.20/1.43 Prover 6: Proving ... % 5.20/1.43 Prover 3: Constructing countermodel ... % 5.20/1.45 Prover 5: Proving ... % 5.20/1.48 Prover 4: Constructing countermodel ... % 5.64/1.52 Prover 2: Proving ... % 5.64/1.52 Prover 0: Proving ... % 6.74/1.68 Prover 3: gave up % 6.74/1.68 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.74/1.71 Prover 7: Preprocessing ... % 7.93/1.83 Prover 0: proved (1206ms) % 7.93/1.83 Prover 1: gave up % 7.93/1.85 % 7.93/1.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.93/1.85 % 7.93/1.85 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.93/1.85 Prover 6: stopped % 7.93/1.85 Prover 5: stopped % 7.93/1.86 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.93/1.86 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.93/1.86 Prover 2: stopped % 8.44/1.87 Prover 7: Constructing countermodel ... % 8.44/1.87 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.44/1.87 Prover 8: Preprocessing ... % 8.44/1.87 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.44/1.88 Prover 11: Preprocessing ... % 8.44/1.89 Prover 16: Preprocessing ... % 8.44/1.89 Prover 10: Preprocessing ... % 8.44/1.89 Prover 13: Preprocessing ... % 8.95/1.95 Prover 16: Warning: ignoring some quantifiers % 8.95/1.96 Prover 16: Constructing countermodel ... % 8.95/1.97 Prover 8: Warning: ignoring some quantifiers % 8.95/1.97 Prover 8: Constructing countermodel ... % 8.95/1.98 Prover 10: Constructing countermodel ... % 8.95/1.99 Prover 13: Warning: ignoring some quantifiers % 9.38/1.99 Prover 13: Constructing countermodel ... % 9.63/2.04 Prover 11: Constructing countermodel ... % 10.23/2.11 Prover 13: Found proof (size 26) % 10.23/2.11 Prover 13: proved (248ms) % 10.23/2.11 Prover 7: stopped % 10.23/2.11 Prover 4: stopped % 10.23/2.11 Prover 11: stopped % 10.23/2.11 Prover 10: Found proof (size 25) % 10.23/2.11 Prover 10: proved (256ms) % 10.23/2.11 Prover 8: stopped % 10.23/2.11 Prover 16: stopped % 10.23/2.11 % 10.23/2.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.23/2.11 % 10.23/2.12 % SZS output start Proof for theBenchmark % 10.23/2.12 Assumptions after simplification: % 10.23/2.12 --------------------------------- % 10.23/2.12 % 10.23/2.12 (additive_commutativity) % 10.23/2.14 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (addition(v0, v1) = v2) | ~ % 10.23/2.14 $i(v1) | ~ $i(v0) | (addition(v1, v0) = v2 & $i(v2))) % 10.23/2.14 % 10.23/2.14 (goals) % 10.23/2.15 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 10.23/2.15 $i] : ( ~ (v5 = v0) & c(v1) = v3 & multiplication(v3, v0) = v4 & % 10.23/2.15 multiplication(v1, v0) = v2 & addition(v2, v4) = v5 & $i(v5) & $i(v4) & % 10.23/2.15 $i(v3) & $i(v2) & $i(v1) & $i(v0) & test(v1)) % 10.23/2.15 % 10.23/2.15 (left_distributivity) % 10.23/2.15 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 10.23/2.15 $i] : ( ~ (multiplication(v1, v2) = v4) | ~ (multiplication(v0, v2) = v3) | % 10.23/2.15 ~ (addition(v3, v4) = v5) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: $i] % 10.23/2.15 : (multiplication(v6, v2) = v5 & addition(v0, v1) = v6 & $i(v6) & $i(v5))) & % 10.23/2.15 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.23/2.15 ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] : (multiplication(v3, % 10.23/2.15 v2) = v4 & multiplication(v1, v2) = v6 & multiplication(v0, v2) = v5 & % 10.23/2.15 addition(v5, v6) = v4 & addition(v0, v1) = v3 & $i(v6) & $i(v5) & $i(v4) & % 10.23/2.15 $i(v3))) % 10.23/2.15 % 10.23/2.15 (multiplicative_left_identity) % 10.23/2.15 $i(one) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (multiplication(one, v0) = % 10.23/2.15 v1) | ~ $i(v0)) % 10.23/2.15 % 10.23/2.15 (test_2) % 10.23/2.16 $i(one) & $i(zero) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = one | ~ % 10.23/2.16 (addition(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ complement(v1, v0)) & % 10.23/2.16 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (addition(v0, v1) = v2) | ~ % 10.23/2.16 $i(v1) | ~ $i(v0) | ~ complement(v1, v0) | (multiplication(v1, v0) = zero % 10.23/2.16 & multiplication(v0, v1) = zero)) & ! [v0: $i] : ! [v1: $i] : ( ~ % 10.23/2.16 (addition(v0, v1) = one) | ~ $i(v1) | ~ $i(v0) | complement(v1, v0) | ? % 10.23/2.16 [v2: $i] : ? [v3: $i] : (multiplication(v1, v0) = v3 & multiplication(v0, % 10.23/2.16 v1) = v2 & $i(v3) & $i(v2) & ( ~ (v3 = zero) | ~ (v2 = zero)))) % 10.23/2.16 % 10.23/2.16 (test_3) % 10.23/2.16 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (c(v0) = v2) | ~ % 10.23/2.16 $i(v1) | ~ $i(v0) | ~ complement(v0, v1) | ~ test(v0)) & ! [v0: $i] : ! % 10.23/2.16 [v1: $i] : ( ~ (c(v0) = v1) | ~ $i(v1) | ~ $i(v0) | ~ test(v0) | % 10.23/2.16 complement(v0, v1)) & ? [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | % 10.23/2.16 ~ test(v1) | ? [v2: $i] : (c(v1) = v2 & $i(v2) & ( ~ (v2 = v0) | % 10.23/2.16 complement(v1, v0)) & (v2 = v0 | ~ complement(v1, v0)))) % 10.23/2.16 % 10.23/2.16 (function-axioms) % 10.23/2.16 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.23/2.16 (multiplication(v3, v2) = v1) | ~ (multiplication(v3, v2) = v0)) & ! [v0: % 10.23/2.16 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (addition(v3, % 10.23/2.16 v2) = v1) | ~ (addition(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 10.23/2.16 [v2: $i] : (v1 = v0 | ~ (c(v2) = v1) | ~ (c(v2) = v0)) % 10.23/2.16 % 10.23/2.16 Further assumptions not needed in the proof: % 10.23/2.16 -------------------------------------------- % 10.23/2.17 additive_associativity, additive_idempotence, additive_identity, % 10.23/2.17 left_annihilation, multiplicative_associativity, multiplicative_right_identity, % 10.23/2.17 order, right_annihilation, right_distributivity, test_1, test_4 % 10.23/2.17 % 10.23/2.17 Those formulas are unsatisfiable: % 10.23/2.17 --------------------------------- % 10.23/2.17 % 10.23/2.17 Begin of proof % 10.23/2.17 | % 10.23/2.17 | ALPHA: (multiplicative_left_identity) implies: % 10.23/2.17 | (1) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (multiplication(one, v0) = % 10.23/2.17 | v1) | ~ $i(v0)) % 10.23/2.17 | % 10.23/2.17 | ALPHA: (left_distributivity) implies: % 10.23/2.17 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 10.23/2.17 | ! [v5: $i] : ( ~ (multiplication(v1, v2) = v4) | ~ (multiplication(v0, % 10.23/2.17 | v2) = v3) | ~ (addition(v3, v4) = v5) | ~ $i(v2) | ~ $i(v1) | % 10.23/2.17 | ~ $i(v0) | ? [v6: $i] : (multiplication(v6, v2) = v5 & addition(v0, % 10.23/2.17 | v1) = v6 & $i(v6) & $i(v5))) % 10.23/2.17 | % 10.23/2.17 | ALPHA: (test_2) implies: % 10.23/2.17 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = one | ~ (addition(v0, % 10.23/2.17 | v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ complement(v1, v0)) % 10.57/2.17 | % 10.57/2.17 | ALPHA: (test_3) implies: % 10.57/2.17 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ (c(v0) = v1) | ~ $i(v1) | ~ $i(v0) | % 10.57/2.17 | ~ test(v0) | complement(v0, v1)) % 10.57/2.17 | % 10.57/2.17 | ALPHA: (function-axioms) implies: % 10.57/2.17 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.57/2.17 | (addition(v3, v2) = v1) | ~ (addition(v3, v2) = v0)) % 10.57/2.17 | % 10.57/2.17 | DELTA: instantiating (goals) with fresh symbols all_24_0, all_24_1, all_24_2, % 10.57/2.17 | all_24_3, all_24_4, all_24_5 gives: % 10.57/2.18 | (6) ~ (all_24_0 = all_24_5) & c(all_24_4) = all_24_2 & % 10.57/2.18 | multiplication(all_24_2, all_24_5) = all_24_1 & % 10.57/2.18 | multiplication(all_24_4, all_24_5) = all_24_3 & addition(all_24_3, % 10.57/2.18 | all_24_1) = all_24_0 & $i(all_24_0) & $i(all_24_1) & $i(all_24_2) & % 10.57/2.18 | $i(all_24_3) & $i(all_24_4) & $i(all_24_5) & test(all_24_4) % 10.57/2.18 | % 10.57/2.18 | ALPHA: (6) implies: % 10.57/2.18 | (7) ~ (all_24_0 = all_24_5) % 10.57/2.18 | (8) test(all_24_4) % 10.57/2.18 | (9) $i(all_24_5) % 10.57/2.18 | (10) $i(all_24_4) % 10.57/2.18 | (11) $i(all_24_3) % 10.57/2.18 | (12) $i(all_24_2) % 10.57/2.18 | (13) $i(all_24_1) % 10.57/2.18 | (14) addition(all_24_3, all_24_1) = all_24_0 % 10.57/2.18 | (15) multiplication(all_24_4, all_24_5) = all_24_3 % 10.57/2.18 | (16) multiplication(all_24_2, all_24_5) = all_24_1 % 10.57/2.18 | (17) c(all_24_4) = all_24_2 % 10.57/2.18 | % 10.57/2.18 | GROUND_INST: instantiating (additive_commutativity) with all_24_3, all_24_1, % 10.57/2.18 | all_24_0, simplifying with (11), (13), (14) gives: % 10.57/2.18 | (18) addition(all_24_1, all_24_3) = all_24_0 & $i(all_24_0) % 10.57/2.18 | % 10.57/2.18 | ALPHA: (18) implies: % 10.57/2.18 | (19) addition(all_24_1, all_24_3) = all_24_0 % 10.57/2.18 | % 10.57/2.18 | GROUND_INST: instantiating (2) with all_24_4, all_24_2, all_24_5, all_24_3, % 10.57/2.18 | all_24_1, all_24_0, simplifying with (9), (10), (12), (14), (15), % 10.57/2.18 | (16) gives: % 10.57/2.18 | (20) ? [v0: $i] : (multiplication(v0, all_24_5) = all_24_0 & % 10.57/2.18 | addition(all_24_4, all_24_2) = v0 & $i(v0) & $i(all_24_0)) % 10.57/2.18 | % 10.57/2.18 | GROUND_INST: instantiating (4) with all_24_4, all_24_2, simplifying with (8), % 10.57/2.18 | (10), (12), (17) gives: % 10.57/2.18 | (21) complement(all_24_4, all_24_2) % 10.57/2.18 | % 10.57/2.18 | DELTA: instantiating (20) with fresh symbol all_34_0 gives: % 10.57/2.18 | (22) multiplication(all_34_0, all_24_5) = all_24_0 & addition(all_24_4, % 10.57/2.18 | all_24_2) = all_34_0 & $i(all_34_0) & $i(all_24_0) % 10.57/2.18 | % 10.57/2.18 | ALPHA: (22) implies: % 10.57/2.18 | (23) addition(all_24_4, all_24_2) = all_34_0 % 10.57/2.18 | % 10.57/2.18 | GROUND_INST: instantiating (additive_commutativity) with all_24_4, all_24_2, % 10.57/2.18 | all_34_0, simplifying with (10), (12), (23) gives: % 10.57/2.18 | (24) addition(all_24_2, all_24_4) = all_34_0 & $i(all_34_0) % 10.57/2.18 | % 10.57/2.19 | ALPHA: (24) implies: % 10.57/2.19 | (25) addition(all_24_2, all_24_4) = all_34_0 % 10.57/2.19 | % 10.57/2.19 | GROUND_INST: instantiating (2) with all_24_2, all_24_4, all_24_5, all_24_1, % 10.57/2.19 | all_24_3, all_24_0, simplifying with (9), (10), (12), (15), (16), % 10.57/2.19 | (19) gives: % 10.57/2.19 | (26) ? [v0: $i] : (multiplication(v0, all_24_5) = all_24_0 & % 10.57/2.19 | addition(all_24_2, all_24_4) = v0 & $i(v0) & $i(all_24_0)) % 10.57/2.19 | % 10.57/2.19 | DELTA: instantiating (26) with fresh symbol all_42_0 gives: % 10.57/2.19 | (27) multiplication(all_42_0, all_24_5) = all_24_0 & addition(all_24_2, % 10.57/2.19 | all_24_4) = all_42_0 & $i(all_42_0) & $i(all_24_0) % 10.57/2.19 | % 10.57/2.19 | ALPHA: (27) implies: % 10.57/2.19 | (28) addition(all_24_2, all_24_4) = all_42_0 % 10.57/2.19 | (29) multiplication(all_42_0, all_24_5) = all_24_0 % 10.57/2.19 | % 10.57/2.19 | GROUND_INST: instantiating (5) with all_34_0, all_42_0, all_24_4, all_24_2, % 10.57/2.19 | simplifying with (25), (28) gives: % 10.57/2.19 | (30) all_42_0 = all_34_0 % 10.57/2.19 | % 10.57/2.19 | REDUCE: (29), (30) imply: % 10.57/2.19 | (31) multiplication(all_34_0, all_24_5) = all_24_0 % 10.57/2.19 | % 10.57/2.19 | GROUND_INST: instantiating (3) with all_24_2, all_24_4, all_34_0, simplifying % 10.57/2.19 | with (10), (12), (21), (25) gives: % 10.57/2.19 | (32) all_34_0 = one % 10.57/2.19 | % 10.57/2.19 | REDUCE: (31), (32) imply: % 10.57/2.19 | (33) multiplication(one, all_24_5) = all_24_0 % 10.57/2.19 | % 10.57/2.19 | GROUND_INST: instantiating (1) with all_24_5, all_24_0, simplifying with (9), % 10.57/2.19 | (33) gives: % 10.57/2.19 | (34) all_24_0 = all_24_5 % 10.57/2.19 | % 10.57/2.19 | REDUCE: (7), (34) imply: % 10.57/2.19 | (35) $false % 10.57/2.19 | % 10.57/2.19 | CLOSE: (35) is inconsistent. % 10.57/2.19 | % 10.57/2.19 End of proof % 10.57/2.19 % SZS output end Proof for theBenchmark % 10.57/2.19 % 10.57/2.19 1587ms %------------------------------------------------------------------------------