TSTP Solution File: KLE064+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KLE064+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 : n009.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:26 EDT 2023
% Result : Theorem 7.79s 1.84s
% Output : Proof 13.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KLE064+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.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 11:19:35 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 2.38/1.06 Prover 1: Preprocessing ...
% 2.38/1.07 Prover 4: Preprocessing ...
% 2.38/1.10 Prover 3: Preprocessing ...
% 2.38/1.10 Prover 2: Preprocessing ...
% 2.38/1.10 Prover 5: Preprocessing ...
% 2.38/1.10 Prover 6: Preprocessing ...
% 2.38/1.10 Prover 0: Preprocessing ...
% 5.01/1.41 Prover 6: Constructing countermodel ...
% 5.01/1.42 Prover 1: Constructing countermodel ...
% 5.01/1.43 Prover 4: Constructing countermodel ...
% 5.01/1.43 Prover 3: Constructing countermodel ...
% 5.45/1.48 Prover 5: Proving ...
% 5.45/1.48 Prover 0: Proving ...
% 6.14/1.57 Prover 2: Proving ...
% 7.79/1.84 Prover 0: proved (1200ms)
% 7.79/1.84
% 7.79/1.84 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.79/1.84
% 7.79/1.84 Prover 3: stopped
% 7.79/1.85 Prover 6: stopped
% 7.79/1.86 Prover 2: stopped
% 7.79/1.86 Prover 5: stopped
% 7.79/1.86 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.79/1.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 7.79/1.86 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 7.79/1.86 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 7.79/1.86 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 8.51/1.87 Prover 7: Preprocessing ...
% 8.51/1.88 Prover 10: Preprocessing ...
% 8.51/1.89 Prover 11: Preprocessing ...
% 8.51/1.89 Prover 8: Preprocessing ...
% 8.74/1.92 Prover 13: Preprocessing ...
% 8.95/1.96 Prover 10: Constructing countermodel ...
% 8.95/1.97 Prover 8: Warning: ignoring some quantifiers
% 8.95/1.98 Prover 11: Constructing countermodel ...
% 8.95/1.98 Prover 8: Constructing countermodel ...
% 8.95/1.98 Prover 7: Constructing countermodel ...
% 8.95/2.00 Prover 13: Warning: ignoring some quantifiers
% 9.65/2.03 Prover 13: Constructing countermodel ...
% 12.61/2.45 Prover 4: Found proof (size 30)
% 12.61/2.45 Prover 4: proved (1807ms)
% 12.61/2.45 Prover 7: stopped
% 12.61/2.45 Prover 13: stopped
% 12.61/2.45 Prover 8: stopped
% 12.61/2.45 Prover 1: stopped
% 12.61/2.45 Prover 10: stopped
% 12.61/2.45 Prover 11: stopped
% 12.61/2.45
% 12.61/2.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.61/2.45
% 12.61/2.46 % SZS output start Proof for theBenchmark
% 12.61/2.46 Assumptions after simplification:
% 12.61/2.46 ---------------------------------
% 12.61/2.46
% 12.61/2.46 (additive_associativity)
% 13.07/2.49 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 13.07/2.49 (addition(v3, v0) = v4) | ~ (addition(v2, v1) = v3) | ~ $i(v2) | ~ $i(v1)
% 13.07/2.49 | ~ $i(v0) | ? [v5: $i] : (addition(v2, v5) = v4 & addition(v1, v0) = v5 &
% 13.07/2.49 $i(v5) & $i(v4))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i]
% 13.07/2.49 : ! [v4: $i] : ( ~ (addition(v2, v3) = v4) | ~ (addition(v1, v0) = v3) | ~
% 13.07/2.49 $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: $i] : (addition(v5, v0) = v4 &
% 13.07/2.49 addition(v2, v1) = v5 & $i(v5) & $i(v4)))
% 13.07/2.49
% 13.07/2.49 (domain1)
% 13.07/2.49 ! [v0: $i] : ! [v1: $i] : ( ~ (domain(v0) = v1) | ~ $i(v0) | ? [v2: $i] :
% 13.07/2.49 (multiplication(v1, v0) = v2 & addition(v0, v2) = v2 & $i(v2)))
% 13.07/2.49
% 13.07/2.49 (goals)
% 13.07/2.49 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 13.07/2.49 $i] : ( ~ (v5 = v4) & domain(v1) = v3 & domain(v0) = v2 & multiplication(v3,
% 13.07/2.49 v0) = v4 & addition(v2, v3) = v3 & addition(v0, v4) = v5 & $i(v5) & $i(v4)
% 13.07/2.49 & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 13.07/2.49
% 13.07/2.49 (left_distributivity)
% 13.07/2.50 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 13.07/2.50 $i] : ( ~ (multiplication(v1, v2) = v4) | ~ (multiplication(v0, v2) = v3) |
% 13.07/2.50 ~ (addition(v3, v4) = v5) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: $i]
% 13.07/2.50 : (multiplication(v6, v2) = v5 & addition(v0, v1) = v6 & $i(v6) & $i(v5))) &
% 13.07/2.50 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 13.07/2.50 (multiplication(v3, v2) = v4) | ~ (addition(v0, v1) = v3) | ~ $i(v2) | ~
% 13.07/2.50 $i(v1) | ~ $i(v0) | ? [v5: $i] : ? [v6: $i] : (multiplication(v1, v2) =
% 13.07/2.50 v6 & multiplication(v0, v2) = v5 & addition(v5, v6) = v4 & $i(v6) & $i(v5)
% 13.07/2.50 & $i(v4)))
% 13.07/2.50
% 13.07/2.50 (function-axioms)
% 13.17/2.50 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 13.17/2.50 [v3: $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0:
% 13.17/2.50 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 13.17/2.50 (multiplication(v3, v2) = v1) | ~ (multiplication(v3, v2) = v0)) & ! [v0:
% 13.17/2.50 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (addition(v3,
% 13.17/2.50 v2) = v1) | ~ (addition(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 13.17/2.50 [v2: $i] : (v1 = v0 | ~ (domain(v2) = v1) | ~ (domain(v2) = v0))
% 13.17/2.50
% 13.17/2.50 Further assumptions not needed in the proof:
% 13.17/2.50 --------------------------------------------
% 13.17/2.50 additive_commutativity, additive_idempotence, additive_identity, domain2,
% 13.17/2.50 domain3, domain4, domain5, left_annihilation, multiplicative_associativity,
% 13.17/2.50 multiplicative_left_identity, multiplicative_right_identity, order,
% 13.17/2.50 right_annihilation, right_distributivity
% 13.17/2.50
% 13.17/2.50 Those formulas are unsatisfiable:
% 13.17/2.50 ---------------------------------
% 13.17/2.50
% 13.17/2.50 Begin of proof
% 13.17/2.50 |
% 13.17/2.50 | ALPHA: (additive_associativity) implies:
% 13.17/2.51 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (
% 13.17/2.51 | ~ (addition(v2, v3) = v4) | ~ (addition(v1, v0) = v3) | ~ $i(v2) |
% 13.17/2.51 | ~ $i(v1) | ~ $i(v0) | ? [v5: $i] : (addition(v5, v0) = v4 &
% 13.17/2.51 | addition(v2, v1) = v5 & $i(v5) & $i(v4)))
% 13.17/2.51 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (
% 13.17/2.51 | ~ (addition(v3, v0) = v4) | ~ (addition(v2, v1) = v3) | ~ $i(v2) |
% 13.17/2.51 | ~ $i(v1) | ~ $i(v0) | ? [v5: $i] : (addition(v2, v5) = v4 &
% 13.17/2.51 | addition(v1, v0) = v5 & $i(v5) & $i(v4)))
% 13.17/2.51 |
% 13.17/2.51 | ALPHA: (left_distributivity) implies:
% 13.17/2.51 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (
% 13.17/2.51 | ~ (multiplication(v3, v2) = v4) | ~ (addition(v0, v1) = v3) | ~
% 13.17/2.51 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: $i] : ? [v6: $i] :
% 13.17/2.51 | (multiplication(v1, v2) = v6 & multiplication(v0, v2) = v5 &
% 13.17/2.51 | addition(v5, v6) = v4 & $i(v6) & $i(v5) & $i(v4)))
% 13.17/2.51 |
% 13.17/2.51 | ALPHA: (function-axioms) implies:
% 13.17/2.51 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 13.17/2.51 | (addition(v3, v2) = v1) | ~ (addition(v3, v2) = v0))
% 13.17/2.51 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 13.17/2.51 | (multiplication(v3, v2) = v1) | ~ (multiplication(v3, v2) = v0))
% 13.17/2.51 |
% 13.17/2.51 | DELTA: instantiating (goals) with fresh symbols all_20_0, all_20_1, all_20_2,
% 13.17/2.51 | all_20_3, all_20_4, all_20_5 gives:
% 13.17/2.51 | (6) ~ (all_20_0 = all_20_1) & domain(all_20_4) = all_20_2 &
% 13.17/2.51 | domain(all_20_5) = all_20_3 & multiplication(all_20_2, all_20_5) =
% 13.17/2.51 | all_20_1 & addition(all_20_3, all_20_2) = all_20_2 & addition(all_20_5,
% 13.17/2.51 | all_20_1) = all_20_0 & $i(all_20_0) & $i(all_20_1) & $i(all_20_2) &
% 13.17/2.51 | $i(all_20_3) & $i(all_20_4) & $i(all_20_5)
% 13.17/2.51 |
% 13.17/2.51 | ALPHA: (6) implies:
% 13.17/2.51 | (7) ~ (all_20_0 = all_20_1)
% 13.17/2.51 | (8) $i(all_20_5)
% 13.17/2.51 | (9) $i(all_20_3)
% 13.17/2.51 | (10) $i(all_20_2)
% 13.17/2.51 | (11) addition(all_20_5, all_20_1) = all_20_0
% 13.17/2.51 | (12) addition(all_20_3, all_20_2) = all_20_2
% 13.17/2.51 | (13) multiplication(all_20_2, all_20_5) = all_20_1
% 13.17/2.51 | (14) domain(all_20_5) = all_20_3
% 13.17/2.51 |
% 13.17/2.51 | GROUND_INST: instantiating (3) with all_20_3, all_20_2, all_20_5, all_20_2,
% 13.17/2.51 | all_20_1, simplifying with (8), (9), (10), (12), (13) gives:
% 13.17/2.52 | (15) ? [v0: $i] : ? [v1: $i] : (multiplication(all_20_2, all_20_5) = v1 &
% 13.17/2.52 | multiplication(all_20_3, all_20_5) = v0 & addition(v0, v1) =
% 13.17/2.52 | all_20_1 & $i(v1) & $i(v0) & $i(all_20_1))
% 13.17/2.52 |
% 13.17/2.52 | GROUND_INST: instantiating (domain1) with all_20_5, all_20_3, simplifying with
% 13.17/2.52 | (8), (14) gives:
% 13.17/2.52 | (16) ? [v0: $i] : (multiplication(all_20_3, all_20_5) = v0 &
% 13.17/2.52 | addition(all_20_5, v0) = v0 & $i(v0))
% 13.17/2.52 |
% 13.17/2.52 | DELTA: instantiating (16) with fresh symbol all_30_0 gives:
% 13.26/2.52 | (17) multiplication(all_20_3, all_20_5) = all_30_0 & addition(all_20_5,
% 13.26/2.52 | all_30_0) = all_30_0 & $i(all_30_0)
% 13.26/2.52 |
% 13.26/2.52 | ALPHA: (17) implies:
% 13.26/2.52 | (18) addition(all_20_5, all_30_0) = all_30_0
% 13.26/2.52 | (19) multiplication(all_20_3, all_20_5) = all_30_0
% 13.26/2.52 |
% 13.26/2.52 | DELTA: instantiating (15) with fresh symbols all_38_0, all_38_1 gives:
% 13.26/2.52 | (20) multiplication(all_20_2, all_20_5) = all_38_0 &
% 13.26/2.52 | multiplication(all_20_3, all_20_5) = all_38_1 & addition(all_38_1,
% 13.26/2.52 | all_38_0) = all_20_1 & $i(all_38_0) & $i(all_38_1) & $i(all_20_1)
% 13.26/2.52 |
% 13.26/2.52 | ALPHA: (20) implies:
% 13.26/2.52 | (21) $i(all_38_1)
% 13.26/2.52 | (22) $i(all_38_0)
% 13.26/2.52 | (23) addition(all_38_1, all_38_0) = all_20_1
% 13.26/2.52 | (24) multiplication(all_20_3, all_20_5) = all_38_1
% 13.26/2.52 | (25) multiplication(all_20_2, all_20_5) = all_38_0
% 13.26/2.52 |
% 13.26/2.52 | GROUND_INST: instantiating (5) with all_30_0, all_38_1, all_20_5, all_20_3,
% 13.26/2.52 | simplifying with (19), (24) gives:
% 13.26/2.52 | (26) all_38_1 = all_30_0
% 13.26/2.52 |
% 13.26/2.52 | GROUND_INST: instantiating (5) with all_20_1, all_38_0, all_20_5, all_20_2,
% 13.26/2.52 | simplifying with (13), (25) gives:
% 13.26/2.52 | (27) all_38_0 = all_20_1
% 13.26/2.52 |
% 13.26/2.52 | REDUCE: (23), (26), (27) imply:
% 13.26/2.52 | (28) addition(all_30_0, all_20_1) = all_20_1
% 13.26/2.52 |
% 13.26/2.52 | REDUCE: (22), (27) imply:
% 13.26/2.52 | (29) $i(all_20_1)
% 13.26/2.52 |
% 13.26/2.52 | REDUCE: (21), (26) imply:
% 13.26/2.52 | (30) $i(all_30_0)
% 13.26/2.52 |
% 13.26/2.52 | GROUND_INST: instantiating (1) with all_20_1, all_30_0, all_20_5, all_20_1,
% 13.26/2.52 | all_20_0, simplifying with (8), (11), (28), (29), (30) gives:
% 13.26/2.52 | (31) ? [v0: $i] : (addition(v0, all_20_1) = all_20_0 & addition(all_20_5,
% 13.26/2.52 | all_30_0) = v0 & $i(v0) & $i(all_20_0))
% 13.26/2.52 |
% 13.26/2.52 | GROUND_INST: instantiating (2) with all_20_1, all_30_0, all_20_5, all_30_0,
% 13.26/2.52 | all_20_1, simplifying with (8), (18), (28), (29), (30) gives:
% 13.26/2.52 | (32) ? [v0: $i] : (addition(all_30_0, all_20_1) = v0 & addition(all_20_5,
% 13.26/2.52 | v0) = all_20_1 & $i(v0))
% 13.26/2.52 |
% 13.26/2.52 | DELTA: instantiating (32) with fresh symbol all_66_0 gives:
% 13.26/2.52 | (33) addition(all_30_0, all_20_1) = all_66_0 & addition(all_20_5, all_66_0)
% 13.26/2.52 | = all_20_1 & $i(all_66_0)
% 13.26/2.52 |
% 13.26/2.52 | ALPHA: (33) implies:
% 13.26/2.52 | (34) addition(all_30_0, all_20_1) = all_66_0
% 13.26/2.52 |
% 13.26/2.52 | DELTA: instantiating (31) with fresh symbol all_116_0 gives:
% 13.26/2.52 | (35) addition(all_116_0, all_20_1) = all_20_0 & addition(all_20_5,
% 13.26/2.52 | all_30_0) = all_116_0 & $i(all_116_0) & $i(all_20_0)
% 13.26/2.52 |
% 13.26/2.52 | ALPHA: (35) implies:
% 13.26/2.52 | (36) addition(all_20_5, all_30_0) = all_116_0
% 13.26/2.52 | (37) addition(all_116_0, all_20_1) = all_20_0
% 13.26/2.52 |
% 13.26/2.52 | GROUND_INST: instantiating (4) with all_30_0, all_116_0, all_30_0, all_20_5,
% 13.26/2.52 | simplifying with (18), (36) gives:
% 13.26/2.52 | (38) all_116_0 = all_30_0
% 13.26/2.52 |
% 13.26/2.52 | GROUND_INST: instantiating (4) with all_20_1, all_66_0, all_20_1, all_30_0,
% 13.26/2.52 | simplifying with (28), (34) gives:
% 13.26/2.53 | (39) all_66_0 = all_20_1
% 13.26/2.53 |
% 13.26/2.53 | REDUCE: (37), (38) imply:
% 13.26/2.53 | (40) addition(all_30_0, all_20_1) = all_20_0
% 13.26/2.53 |
% 13.26/2.53 | GROUND_INST: instantiating (4) with all_20_1, all_20_0, all_20_1, all_30_0,
% 13.26/2.53 | simplifying with (28), (40) gives:
% 13.26/2.53 | (41) all_20_0 = all_20_1
% 13.26/2.53 |
% 13.26/2.53 | REDUCE: (7), (41) imply:
% 13.26/2.53 | (42) $false
% 13.26/2.53 |
% 13.26/2.53 | CLOSE: (42) is inconsistent.
% 13.26/2.53 |
% 13.26/2.53 End of proof
% 13.26/2.53 % SZS output end Proof for theBenchmark
% 13.26/2.53
% 13.26/2.53 1908ms
%------------------------------------------------------------------------------