%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KLE007+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 : 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 05:34:09 EDT 2023 % Result : Theorem 13.25s 2.61s % Output : Proof 14.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KLE007+1 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n014.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 11:13:30 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.65 ________ _____ % 0.20/0.65 ___ __ \_________(_)________________________________ % 0.20/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.65 % 0.20/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.65 (2023-06-19) % 0.20/0.65 % 0.20/0.65 (c) Philipp Rümmer, 2009-2023 % 0.20/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.65 Amanda Stjerna. % 0.20/0.65 Free software under BSD-3-Clause. % 0.20/0.65 % 0.20/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.65 % 0.20/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.67 Running up to 7 provers in parallel. % 0.20/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.46/1.10 Prover 4: Preprocessing ... % 2.46/1.10 Prover 1: Preprocessing ... % 2.46/1.14 Prover 6: Preprocessing ... % 2.46/1.14 Prover 3: Preprocessing ... % 2.46/1.14 Prover 5: Preprocessing ... % 2.46/1.14 Prover 2: Preprocessing ... % 2.46/1.14 Prover 0: Preprocessing ... % 3.43/1.47 Prover 3: Constructing countermodel ... % 4.58/1.48 Prover 1: Constructing countermodel ... % 4.58/1.51 Prover 6: Proving ... % 5.64/1.55 Prover 4: Constructing countermodel ... % 5.64/1.56 Prover 0: Proving ... % 5.64/1.57 Prover 5: Proving ... % 6.23/1.64 Prover 2: Proving ... % 7.33/1.78 Prover 3: gave up % 7.33/1.79 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.65/1.83 Prover 7: Preprocessing ... % 8.83/1.99 Prover 7: Constructing countermodel ... % 13.25/2.61 Prover 0: proved (1937ms) % 13.25/2.61 % 13.25/2.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.25/2.61 % 13.25/2.62 Prover 5: stopped % 13.25/2.62 Prover 6: stopped % 13.25/2.62 Prover 2: stopped % 13.25/2.62 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 13.54/2.62 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 13.54/2.62 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 13.62/2.64 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 13.62/2.65 Prover 10: Preprocessing ... % 13.62/2.65 Prover 11: Preprocessing ... % 13.62/2.66 Prover 13: Preprocessing ... % 13.62/2.66 Prover 8: Preprocessing ... % 13.62/2.71 Prover 10: Constructing countermodel ... % 13.62/2.75 Prover 8: Warning: ignoring some quantifiers % 13.62/2.75 Prover 11: Constructing countermodel ... % 13.62/2.75 Prover 8: Constructing countermodel ... % 13.62/2.76 Prover 13: Warning: ignoring some quantifiers % 13.62/2.76 Prover 13: Constructing countermodel ... % 13.62/2.84 Prover 10: Found proof (size 32) % 13.62/2.84 Prover 10: proved (217ms) % 13.62/2.84 Prover 11: stopped % 13.62/2.84 Prover 8: stopped % 13.62/2.84 Prover 1: stopped % 13.62/2.84 Prover 7: stopped % 13.62/2.85 Prover 4: stopped % 13.62/2.85 Prover 13: stopped % 13.62/2.85 % 13.62/2.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.62/2.85 % 13.62/2.86 % SZS output start Proof for theBenchmark % 13.62/2.86 Assumptions after simplification: % 13.62/2.86 --------------------------------- % 13.62/2.86 % 13.62/2.86 (additive_commutativity) % 14.64/2.88 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (addition(v0, v1) = v2) | ~ % 14.64/2.88 $i(v1) | ~ $i(v0) | (addition(v1, v0) = v2 & $i(v2))) % 14.64/2.88 % 14.64/2.88 (goals) % 14.64/2.89 $i(one) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] % 14.64/2.89 : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ( ~ (v7 = one) & c(v1) = v5 & % 14.64/2.89 c(v0) = v2 & multiplication(v3, v5) = v6 & multiplication(v3, v1) = v4 & % 14.64/2.89 addition(v4, v6) = v7 & addition(v0, v2) = v3 & $i(v7) & $i(v6) & $i(v5) & % 14.64/2.89 $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & test(v1) & test(v0)) % 14.64/2.89 % 14.64/2.89 (multiplicative_left_identity) % 14.64/2.89 $i(one) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (multiplication(one, v0) = % 14.64/2.89 v1) | ~ $i(v0)) % 14.64/2.89 % 14.64/2.89 (right_distributivity) % 14.64/2.89 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 14.64/2.89 $i] : ( ~ (multiplication(v0, v2) = v4) | ~ (multiplication(v0, v1) = v3) | % 14.64/2.89 ~ (addition(v3, v4) = v5) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: $i] % 14.64/2.89 : (multiplication(v0, v6) = v5 & addition(v1, v2) = v6 & $i(v6) & $i(v5))) % 14.64/2.89 % 14.64/2.89 (test_2) % 14.64/2.90 $i(one) & $i(zero) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = one | ~ % 14.64/2.90 (addition(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ complement(v1, v0)) & % 14.64/2.90 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (addition(v0, v1) = v2) | ~ % 14.64/2.90 $i(v1) | ~ $i(v0) | ~ complement(v1, v0) | (multiplication(v1, v0) = zero % 14.64/2.90 & multiplication(v0, v1) = zero)) & ! [v0: $i] : ! [v1: $i] : ( ~ % 14.64/2.90 (addition(v0, v1) = one) | ~ $i(v1) | ~ $i(v0) | complement(v1, v0) | ? % 14.64/2.90 [v2: $i] : ? [v3: $i] : (( ~ (v3 = zero) & multiplication(v1, v0) = v3 & % 14.64/2.90 $i(v3)) | ( ~ (v2 = zero) & multiplication(v0, v1) = v2 & $i(v2)))) % 14.64/2.90 % 14.64/2.90 (test_3) % 14.64/2.90 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (c(v0) = v2) | ~ % 14.64/2.90 $i(v1) | ~ $i(v0) | ~ complement(v0, v1) | ~ test(v0)) & ! [v0: $i] : ! % 14.64/2.90 [v1: $i] : ( ~ (c(v0) = v1) | ~ $i(v1) | ~ $i(v0) | ~ test(v0) | % 14.64/2.90 complement(v0, v1)) % 14.64/2.90 % 14.64/2.90 (function-axioms) % 14.64/2.90 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.64/2.90 (multiplication(v3, v2) = v1) | ~ (multiplication(v3, v2) = v0)) & ! [v0: % 14.64/2.90 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (addition(v3, % 14.64/2.90 v2) = v1) | ~ (addition(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 14.64/2.90 [v2: $i] : (v1 = v0 | ~ (c(v2) = v1) | ~ (c(v2) = v0)) % 14.64/2.90 % 14.64/2.90 Further assumptions not needed in the proof: % 14.64/2.90 -------------------------------------------- % 14.64/2.90 additive_associativity, additive_idempotence, additive_identity, % 14.64/2.90 left_annihilation, left_distributivity, multiplicative_associativity, % 14.64/2.90 multiplicative_right_identity, order, right_annihilation, test_1, test_4 % 14.64/2.90 % 14.64/2.90 Those formulas are unsatisfiable: % 14.64/2.90 --------------------------------- % 14.64/2.90 % 14.64/2.90 Begin of proof % 14.64/2.90 | % 14.64/2.90 | ALPHA: (multiplicative_left_identity) implies: % 14.64/2.90 | (1) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (multiplication(one, v0) = % 14.64/2.90 | v1) | ~ $i(v0)) % 14.64/2.90 | % 14.64/2.90 | ALPHA: (test_2) implies: % 14.64/2.90 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = one | ~ (addition(v0, % 14.64/2.90 | v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ complement(v1, v0)) % 14.64/2.90 | % 14.64/2.90 | ALPHA: (test_3) implies: % 14.64/2.91 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (c(v0) = v1) | ~ $i(v1) | ~ $i(v0) | % 14.64/2.91 | ~ test(v0) | complement(v0, v1)) % 14.64/2.91 | % 14.64/2.91 | ALPHA: (goals) implies: % 14.64/2.91 | (4) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 14.64/2.91 | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ( ~ (v7 = one) & c(v1) = v5 & % 14.64/2.91 | c(v0) = v2 & multiplication(v3, v5) = v6 & multiplication(v3, v1) = % 14.64/2.91 | v4 & addition(v4, v6) = v7 & addition(v0, v2) = v3 & $i(v7) & $i(v6) % 14.64/2.91 | & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & test(v1) & % 14.64/2.91 | test(v0)) % 14.64/2.91 | % 14.64/2.91 | ALPHA: (function-axioms) implies: % 14.64/2.91 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.64/2.91 | (addition(v3, v2) = v1) | ~ (addition(v3, v2) = v0)) % 14.64/2.91 | % 14.64/2.91 | DELTA: instantiating (4) with fresh symbols all_20_0, all_20_1, all_20_2, % 14.64/2.91 | all_20_3, all_20_4, all_20_5, all_20_6, all_20_7 gives: % 14.64/2.91 | (6) ~ (all_20_0 = one) & c(all_20_6) = all_20_2 & c(all_20_7) = all_20_5 & % 14.64/2.91 | multiplication(all_20_4, all_20_2) = all_20_1 & % 14.64/2.91 | multiplication(all_20_4, all_20_6) = all_20_3 & addition(all_20_3, % 14.64/2.91 | all_20_1) = all_20_0 & addition(all_20_7, all_20_5) = all_20_4 & % 14.64/2.91 | $i(all_20_0) & $i(all_20_1) & $i(all_20_2) & $i(all_20_3) & % 14.64/2.91 | $i(all_20_4) & $i(all_20_5) & $i(all_20_6) & $i(all_20_7) & % 14.64/2.91 | test(all_20_6) & test(all_20_7) % 14.64/2.91 | % 14.64/2.91 | ALPHA: (6) implies: % 14.64/2.91 | (7) ~ (all_20_0 = one) % 14.64/2.91 | (8) test(all_20_7) % 14.64/2.91 | (9) test(all_20_6) % 14.64/2.91 | (10) $i(all_20_7) % 14.64/2.91 | (11) $i(all_20_6) % 14.64/2.91 | (12) $i(all_20_5) % 14.64/2.91 | (13) $i(all_20_3) % 14.64/2.91 | (14) $i(all_20_2) % 14.64/2.91 | (15) $i(all_20_1) % 14.64/2.91 | (16) addition(all_20_7, all_20_5) = all_20_4 % 14.64/2.91 | (17) addition(all_20_3, all_20_1) = all_20_0 % 14.64/2.91 | (18) multiplication(all_20_4, all_20_6) = all_20_3 % 14.64/2.91 | (19) multiplication(all_20_4, all_20_2) = all_20_1 % 14.64/2.91 | (20) c(all_20_7) = all_20_5 % 14.64/2.91 | (21) c(all_20_6) = all_20_2 % 14.64/2.91 | % 14.64/2.91 | GROUND_INST: instantiating (additive_commutativity) with all_20_7, all_20_5, % 14.64/2.91 | all_20_4, simplifying with (10), (12), (16) gives: % 14.64/2.91 | (22) addition(all_20_5, all_20_7) = all_20_4 & $i(all_20_4) % 14.64/2.91 | % 14.64/2.91 | ALPHA: (22) implies: % 14.64/2.92 | (23) $i(all_20_4) % 14.64/2.92 | (24) addition(all_20_5, all_20_7) = all_20_4 % 14.64/2.92 | % 14.64/2.92 | GROUND_INST: instantiating (additive_commutativity) with all_20_3, all_20_1, % 14.64/2.92 | all_20_0, simplifying with (13), (15), (17) gives: % 14.64/2.92 | (25) addition(all_20_1, all_20_3) = all_20_0 & $i(all_20_0) % 14.64/2.92 | % 14.64/2.92 | ALPHA: (25) implies: % 14.64/2.92 | (26) addition(all_20_1, all_20_3) = all_20_0 % 14.64/2.92 | % 14.64/2.92 | GROUND_INST: instantiating (right_distributivity) with all_20_4, all_20_6, % 14.64/2.92 | all_20_2, all_20_3, all_20_1, all_20_0, simplifying with (11), % 14.64/2.92 | (14), (17), (18), (19), (23) gives: % 14.64/2.92 | (27) ? [v0: $i] : (multiplication(all_20_4, v0) = all_20_0 & % 14.64/2.92 | addition(all_20_6, all_20_2) = v0 & $i(v0) & $i(all_20_0)) % 14.64/2.92 | % 14.64/2.92 | GROUND_INST: instantiating (3) with all_20_7, all_20_5, simplifying with (8), % 14.64/2.92 | (10), (12), (20) gives: % 14.64/2.92 | (28) complement(all_20_7, all_20_5) % 14.64/2.92 | % 14.64/2.92 | GROUND_INST: instantiating (3) with all_20_6, all_20_2, simplifying with (9), % 14.64/2.92 | (11), (14), (21) gives: % 14.64/2.92 | (29) complement(all_20_6, all_20_2) % 14.64/2.92 | % 14.64/2.92 | DELTA: instantiating (27) with fresh symbol all_32_0 gives: % 14.64/2.92 | (30) multiplication(all_20_4, all_32_0) = all_20_0 & addition(all_20_6, % 14.64/2.92 | all_20_2) = all_32_0 & $i(all_32_0) & $i(all_20_0) % 14.64/2.92 | % 14.64/2.92 | ALPHA: (30) implies: % 14.64/2.92 | (31) addition(all_20_6, all_20_2) = all_32_0 % 14.64/2.92 | % 14.64/2.92 | GROUND_INST: instantiating (additive_commutativity) with all_20_6, all_20_2, % 14.64/2.92 | all_32_0, simplifying with (11), (14), (31) gives: % 14.64/2.92 | (32) addition(all_20_2, all_20_6) = all_32_0 & $i(all_32_0) % 14.64/2.92 | % 14.64/2.92 | ALPHA: (32) implies: % 14.64/2.92 | (33) addition(all_20_2, all_20_6) = all_32_0 % 14.64/2.92 | % 14.64/2.92 | GROUND_INST: instantiating (2) with all_20_5, all_20_7, all_20_4, simplifying % 14.64/2.92 | with (10), (12), (24), (28) gives: % 14.64/2.92 | (34) all_20_4 = one % 14.64/2.92 | % 14.64/2.92 | GROUND_INST: instantiating (right_distributivity) with all_20_4, all_20_2, % 14.64/2.92 | all_20_6, all_20_1, all_20_3, all_20_0, simplifying with (11), % 14.64/2.92 | (14), (18), (19), (23), (26) gives: % 14.64/2.92 | (35) ? [v0: $i] : (multiplication(all_20_4, v0) = all_20_0 & % 14.64/2.92 | addition(all_20_2, all_20_6) = v0 & $i(v0) & $i(all_20_0)) % 14.64/2.92 | % 14.64/2.92 | DELTA: instantiating (35) with fresh symbol all_40_0 gives: % 14.64/2.92 | (36) multiplication(all_20_4, all_40_0) = all_20_0 & addition(all_20_2, % 14.64/2.92 | all_20_6) = all_40_0 & $i(all_40_0) & $i(all_20_0) % 14.64/2.92 | % 14.64/2.92 | ALPHA: (36) implies: % 14.64/2.92 | (37) $i(all_40_0) % 14.64/2.92 | (38) addition(all_20_2, all_20_6) = all_40_0 % 14.64/2.92 | (39) multiplication(all_20_4, all_40_0) = all_20_0 % 14.64/2.92 | % 14.64/2.92 | REDUCE: (34), (39) imply: % 14.64/2.92 | (40) multiplication(one, all_40_0) = all_20_0 % 14.64/2.92 | % 14.64/2.92 | GROUND_INST: instantiating (5) with all_32_0, all_40_0, all_20_6, all_20_2, % 14.64/2.92 | simplifying with (33), (38) gives: % 14.64/2.92 | (41) all_40_0 = all_32_0 % 14.64/2.92 | % 14.64/2.92 | REDUCE: (40), (41) imply: % 14.64/2.92 | (42) multiplication(one, all_32_0) = all_20_0 % 14.64/2.92 | % 14.64/2.92 | REDUCE: (37), (41) imply: % 14.64/2.92 | (43) $i(all_32_0) % 14.64/2.92 | % 14.64/2.93 | GROUND_INST: instantiating (2) with all_20_2, all_20_6, all_32_0, simplifying % 14.64/2.93 | with (11), (14), (29), (33) gives: % 14.64/2.93 | (44) all_32_0 = one % 14.64/2.93 | % 14.64/2.93 | GROUND_INST: instantiating (1) with all_32_0, all_20_0, simplifying with (42), % 14.64/2.93 | (43) gives: % 14.64/2.93 | (45) all_32_0 = all_20_0 % 14.64/2.93 | % 14.64/2.93 | COMBINE_EQS: (44), (45) imply: % 14.64/2.93 | (46) all_20_0 = one % 14.64/2.93 | % 14.64/2.93 | REDUCE: (7), (46) imply: % 14.64/2.93 | (47) $false % 14.64/2.93 | % 14.64/2.93 | CLOSE: (47) is inconsistent. % 14.64/2.93 | % 14.64/2.93 End of proof % 14.64/2.93 % SZS output end Proof for theBenchmark % 14.64/2.93 % 14.64/2.93 2275ms %------------------------------------------------------------------------------