%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KLE129+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 : n012.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:37 EDT 2023 % Result : Theorem 8.93s 1.92s % Output : Proof 10.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KLE129+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.33 % Computer : n012.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Tue Aug 29 11:17:54 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/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.64/1.05 Prover 1: Preprocessing ... % 2.90/1.06 Prover 4: Preprocessing ... % 2.90/1.09 Prover 3: Preprocessing ... % 2.90/1.09 Prover 5: Preprocessing ... % 2.90/1.09 Prover 2: Preprocessing ... % 2.90/1.09 Prover 0: Preprocessing ... % 2.90/1.09 Prover 6: Preprocessing ... % 4.90/1.52 Prover 3: Constructing countermodel ... % 6.17/1.52 Prover 1: Constructing countermodel ... % 6.17/1.53 Prover 6: Proving ... % 6.17/1.59 Prover 0: Proving ... % 6.17/1.59 Prover 4: Constructing countermodel ... % 6.75/1.64 Prover 5: Proving ... % 6.75/1.66 Prover 1: gave up % 6.75/1.66 Prover 3: gave up % 6.75/1.67 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.75/1.67 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.27/1.71 Prover 8: Preprocessing ... % 7.27/1.72 Prover 2: Proving ... % 7.27/1.73 Prover 7: Preprocessing ... % 8.36/1.83 Prover 8: Warning: ignoring some quantifiers % 8.36/1.86 Prover 8: Constructing countermodel ... % 8.93/1.92 Prover 5: proved (1299ms) % 8.93/1.92 % 8.93/1.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.93/1.92 % 8.93/1.93 Prover 6: stopped % 8.93/1.93 Prover 0: stopped % 8.93/1.97 Prover 7: Constructing countermodel ... % 8.93/1.97 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.93/1.97 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.93/1.97 Prover 2: stopped % 9.39/2.00 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.39/2.00 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 9.39/2.00 Prover 11: Preprocessing ... % 9.39/2.01 Prover 10: Preprocessing ... % 9.39/2.02 Prover 13: Preprocessing ... % 9.39/2.03 Prover 16: Preprocessing ... % 10.12/2.08 Prover 4: Found proof (size 23) % 10.12/2.08 Prover 4: proved (1463ms) % 10.12/2.08 Prover 7: stopped % 10.12/2.09 Prover 10: stopped % 10.12/2.09 Prover 8: stopped % 10.12/2.10 Prover 13: stopped % 10.12/2.12 Prover 16: stopped % 10.12/2.14 Prover 11: Constructing countermodel ... % 10.12/2.15 Prover 11: stopped % 10.12/2.15 % 10.12/2.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.12/2.15 % 10.12/2.16 % SZS output start Proof for theBenchmark % 10.12/2.16 Assumptions after simplification: % 10.12/2.16 --------------------------------- % 10.12/2.16 % 10.12/2.16 (additive_idempotence) % 10.34/2.20 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (addition(v0, v0) = v1) | ~ $i(v0)) % 10.34/2.20 % 10.34/2.20 (divergence1) % 10.34/2.20 ! [v0: $i] : ! [v1: $i] : ( ~ (divergence(v0) = v1) | ~ $i(v0) | % 10.34/2.20 (forward_diamond(v0, v1) = v1 & $i(v1))) % 10.34/2.20 % 10.34/2.20 (forward_diamond) % 10.34/2.20 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (domain(v1) = v2) % 10.34/2.20 | ~ (multiplication(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | ? [v4: $i] : % 10.34/2.20 (forward_diamond(v0, v1) = v4 & domain(v3) = v4 & $i(v4))) & ! [v0: $i] : % 10.34/2.20 ! [v1: $i] : ! [v2: $i] : ( ~ (forward_diamond(v0, v1) = v2) | ~ $i(v1) | ~ % 10.34/2.20 $i(v0) | ? [v3: $i] : ? [v4: $i] : (domain(v4) = v2 & domain(v1) = v3 & % 10.34/2.20 multiplication(v0, v3) = v4 & $i(v4) & $i(v3) & $i(v2))) % 10.34/2.20 % 10.34/2.20 (goals) % 10.34/2.20 $i(zero) & ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = zero) & divergence(v0) = v1 & % 10.34/2.20 $i(v1) & $i(v0) & ! [v2: $i] : ! [v3: $i] : (v3 = zero | ~ (domain(v2) = % 10.34/2.20 v3) | ~ $i(v2) | ? [v4: $i] : ? [v5: $i] : ( ~ (v5 = v4) & % 10.34/2.20 forward_diamond(v0, v3) = v4 & addition(v3, v4) = v5 & $i(v5) & % 10.34/2.20 $i(v4)))) % 10.34/2.20 % 10.34/2.20 (function-axioms) % 10.34/2.21 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.34/2.21 (backward_box(v3, v2) = v1) | ~ (backward_box(v3, v2) = v0)) & ! [v0: $i] % 10.34/2.21 : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (forward_box(v3, v2) % 10.34/2.21 = v1) | ~ (forward_box(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 10.34/2.21 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (backward_diamond(v3, v2) = v1) | ~ % 10.34/2.21 (backward_diamond(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 10.34/2.21 ! [v3: $i] : (v1 = v0 | ~ (forward_diamond(v3, v2) = v1) | ~ % 10.34/2.21 (forward_diamond(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 10.34/2.21 ! [v3: $i] : (v1 = v0 | ~ (domain_difference(v3, v2) = v1) | ~ % 10.34/2.21 (domain_difference(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.34/2.21 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (leq(v3, v2) % 10.34/2.21 = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 10.34/2.21 ! [v3: $i] : (v1 = v0 | ~ (multiplication(v3, v2) = v1) | ~ % 10.34/2.21 (multiplication(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 10.34/2.21 ! [v3: $i] : (v1 = v0 | ~ (addition(v3, v2) = v1) | ~ (addition(v3, v2) = % 10.34/2.21 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (star(v2) = % 10.34/2.21 v1) | ~ (star(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 % 10.34/2.21 = v0 | ~ (divergence(v2) = v1) | ~ (divergence(v2) = v0)) & ! [v0: $i] : % 10.34/2.21 ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (c(v2) = v1) | ~ (c(v2) = v0)) & ! % 10.34/2.21 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (codomain(v2) = v1) | ~ % 10.34/2.21 (codomain(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | % 10.34/2.21 ~ (coantidomain(v2) = v1) | ~ (coantidomain(v2) = v0)) & ! [v0: $i] : ! % 10.34/2.21 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (domain(v2) = v1) | ~ (domain(v2) = % 10.34/2.21 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 10.34/2.21 (antidomain(v2) = v1) | ~ (antidomain(v2) = v0)) % 10.34/2.21 % 10.34/2.21 Further assumptions not needed in the proof: % 10.34/2.21 -------------------------------------------- % 10.34/2.21 additive_associativity, additive_commutativity, additive_identity, backward_box, % 10.34/2.21 backward_diamond, codomain1, codomain2, codomain3, codomain4, complement, % 10.34/2.21 divergence2, domain1, domain2, domain3, domain4, domain_difference, forward_box, % 10.34/2.21 left_annihilation, left_distributivity, multiplicative_associativity, % 10.34/2.21 multiplicative_left_identity, multiplicative_right_identity, order, % 10.34/2.21 right_annihilation, right_distributivity % 10.34/2.21 % 10.34/2.21 Those formulas are unsatisfiable: % 10.34/2.21 --------------------------------- % 10.34/2.21 % 10.34/2.21 Begin of proof % 10.34/2.22 | % 10.34/2.22 | ALPHA: (forward_diamond) implies: % 10.34/2.22 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (forward_diamond(v0, v1) % 10.34/2.22 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: $i] : % 10.34/2.22 | (domain(v4) = v2 & domain(v1) = v3 & multiplication(v0, v3) = v4 & % 10.34/2.22 | $i(v4) & $i(v3) & $i(v2))) % 10.34/2.22 | % 10.34/2.22 | ALPHA: (goals) implies: % 10.34/2.22 | (2) ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = zero) & divergence(v0) = v1 & % 10.34/2.22 | $i(v1) & $i(v0) & ! [v2: $i] : ! [v3: $i] : (v3 = zero | ~ % 10.34/2.22 | (domain(v2) = v3) | ~ $i(v2) | ? [v4: $i] : ? [v5: $i] : ( ~ (v5 % 10.34/2.22 | = v4) & forward_diamond(v0, v3) = v4 & addition(v3, v4) = v5 & % 10.34/2.22 | $i(v5) & $i(v4)))) % 10.34/2.22 | % 10.34/2.22 | ALPHA: (function-axioms) implies: % 10.91/2.22 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.91/2.22 | (forward_diamond(v3, v2) = v1) | ~ (forward_diamond(v3, v2) = v0)) % 10.91/2.22 | % 10.91/2.22 | DELTA: instantiating (2) with fresh symbols all_32_0, all_32_1 gives: % 10.91/2.22 | (4) ~ (all_32_0 = zero) & divergence(all_32_1) = all_32_0 & $i(all_32_0) & % 10.91/2.22 | $i(all_32_1) & ! [v0: $i] : ! [v1: $i] : (v1 = zero | ~ (domain(v0) % 10.91/2.22 | = v1) | ~ $i(v0) | ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & % 10.91/2.22 | forward_diamond(all_32_1, v1) = v2 & addition(v1, v2) = v3 & $i(v3) % 10.91/2.22 | & $i(v2))) % 10.91/2.22 | % 10.91/2.22 | ALPHA: (4) implies: % 10.91/2.22 | (5) ~ (all_32_0 = zero) % 10.91/2.22 | (6) $i(all_32_1) % 10.91/2.22 | (7) divergence(all_32_1) = all_32_0 % 10.91/2.22 | (8) ! [v0: $i] : ! [v1: $i] : (v1 = zero | ~ (domain(v0) = v1) | ~ % 10.91/2.22 | $i(v0) | ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & % 10.91/2.22 | forward_diamond(all_32_1, v1) = v2 & addition(v1, v2) = v3 & $i(v3) % 10.91/2.22 | & $i(v2))) % 10.91/2.22 | % 10.93/2.23 | GROUND_INST: instantiating (divergence1) with all_32_1, all_32_0, simplifying % 10.93/2.23 | with (6), (7) gives: % 10.93/2.23 | (9) forward_diamond(all_32_1, all_32_0) = all_32_0 & $i(all_32_0) % 10.93/2.23 | % 10.93/2.23 | ALPHA: (9) implies: % 10.93/2.23 | (10) $i(all_32_0) % 10.93/2.23 | (11) forward_diamond(all_32_1, all_32_0) = all_32_0 % 10.93/2.23 | % 10.93/2.23 | GROUND_INST: instantiating (1) with all_32_1, all_32_0, all_32_0, simplifying % 10.93/2.23 | with (6), (10), (11) gives: % 10.93/2.23 | (12) ? [v0: $i] : ? [v1: $i] : (domain(v1) = all_32_0 & domain(all_32_0) % 10.93/2.23 | = v0 & multiplication(all_32_1, v0) = v1 & $i(v1) & $i(v0)) % 10.93/2.23 | % 10.93/2.23 | DELTA: instantiating (12) with fresh symbols all_46_0, all_46_1 gives: % 10.93/2.23 | (13) domain(all_46_0) = all_32_0 & domain(all_32_0) = all_46_1 & % 10.93/2.23 | multiplication(all_32_1, all_46_1) = all_46_0 & $i(all_46_0) & % 10.93/2.23 | $i(all_46_1) % 10.93/2.23 | % 10.93/2.23 | ALPHA: (13) implies: % 10.93/2.23 | (14) $i(all_46_0) % 10.93/2.23 | (15) domain(all_46_0) = all_32_0 % 10.93/2.23 | % 10.93/2.23 | GROUND_INST: instantiating (8) with all_46_0, all_32_0, simplifying with (14), % 10.93/2.23 | (15) gives: % 10.93/2.23 | (16) all_32_0 = zero | ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) & % 10.93/2.23 | forward_diamond(all_32_1, all_32_0) = v0 & addition(all_32_0, v0) = % 10.93/2.23 | v1 & $i(v1) & $i(v0)) % 10.93/2.23 | % 10.93/2.23 | BETA: splitting (16) gives: % 10.93/2.23 | % 10.93/2.23 | Case 1: % 10.93/2.23 | | % 10.93/2.23 | | (17) all_32_0 = zero % 10.93/2.23 | | % 10.93/2.23 | | REDUCE: (5), (17) imply: % 10.93/2.23 | | (18) $false % 10.93/2.23 | | % 10.93/2.23 | | CLOSE: (18) is inconsistent. % 10.93/2.23 | | % 10.93/2.23 | Case 2: % 10.93/2.23 | | % 10.93/2.23 | | (19) ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) & % 10.93/2.23 | | forward_diamond(all_32_1, all_32_0) = v0 & addition(all_32_0, v0) % 10.93/2.23 | | = v1 & $i(v1) & $i(v0)) % 10.93/2.23 | | % 10.93/2.23 | | DELTA: instantiating (19) with fresh symbols all_69_0, all_69_1 gives: % 10.93/2.23 | | (20) ~ (all_69_0 = all_69_1) & forward_diamond(all_32_1, all_32_0) = % 10.93/2.23 | | all_69_1 & addition(all_32_0, all_69_1) = all_69_0 & $i(all_69_0) & % 10.93/2.23 | | $i(all_69_1) % 10.93/2.23 | | % 10.93/2.23 | | ALPHA: (20) implies: % 10.93/2.23 | | (21) ~ (all_69_0 = all_69_1) % 10.93/2.23 | | (22) $i(all_69_1) % 10.93/2.23 | | (23) addition(all_32_0, all_69_1) = all_69_0 % 10.93/2.23 | | (24) forward_diamond(all_32_1, all_32_0) = all_69_1 % 10.93/2.23 | | % 10.93/2.23 | | GROUND_INST: instantiating (3) with all_32_0, all_69_1, all_32_0, all_32_1, % 10.93/2.23 | | simplifying with (11), (24) gives: % 10.93/2.23 | | (25) all_69_1 = all_32_0 % 10.93/2.23 | | % 10.93/2.23 | | REDUCE: (21), (25) imply: % 10.93/2.24 | | (26) ~ (all_69_0 = all_32_0) % 10.93/2.24 | | % 10.93/2.24 | | REDUCE: (23), (25) imply: % 10.93/2.24 | | (27) addition(all_32_0, all_32_0) = all_69_0 % 10.93/2.24 | | % 10.93/2.24 | | GROUND_INST: instantiating (additive_idempotence) with all_32_0, all_69_0, % 10.93/2.24 | | simplifying with (10), (27) gives: % 10.93/2.24 | | (28) all_69_0 = all_32_0 % 10.93/2.24 | | % 10.93/2.24 | | REDUCE: (26), (28) imply: % 10.93/2.24 | | (29) $false % 10.93/2.24 | | % 10.93/2.24 | | CLOSE: (29) is inconsistent. % 10.93/2.24 | | % 10.93/2.24 | End of split % 10.93/2.24 | % 10.93/2.24 End of proof % 10.93/2.24 % SZS output end Proof for theBenchmark % 10.93/2.24 % 10.93/2.24 1637ms %------------------------------------------------------------------------------