TSTP Solution File: KLE007+3 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : KLE007+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n004.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:10 EDT 2023

% Result   : Theorem 15.28s 2.74s
% Output   : Proof 16.99s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE007+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n004.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:42:52 EDT 2023
% 0.13/0.34  % 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 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 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 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 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 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 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
% 2.76/1.05  Prover 4: Preprocessing ...
% 2.76/1.05  Prover 1: Preprocessing ...
% 2.78/1.09  Prover 3: Preprocessing ...
% 2.78/1.09  Prover 0: Preprocessing ...
% 2.78/1.09  Prover 5: Preprocessing ...
% 2.78/1.09  Prover 2: Preprocessing ...
% 2.78/1.09  Prover 6: Preprocessing ...
% 4.74/1.41  Prover 6: Proving ...
% 5.39/1.41  Prover 1: Constructing countermodel ...
% 5.39/1.42  Prover 3: Constructing countermodel ...
% 5.39/1.49  Prover 5: Proving ...
% 6.02/1.51  Prover 0: Proving ...
% 6.02/1.54  Prover 4: Constructing countermodel ...
% 6.64/1.60  Prover 2: Proving ...
% 7.66/1.75  Prover 3: gave up
% 7.66/1.76  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 8.32/1.82  Prover 7: Preprocessing ...
% 8.91/1.96  Prover 7: Constructing countermodel ...
% 15.28/2.74  Prover 0: proved (2099ms)
% 15.28/2.74  
% 15.28/2.74  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.28/2.74  
% 15.28/2.75  Prover 5: stopped
% 15.28/2.75  Prover 2: stopped
% 15.28/2.76  Prover 6: stopped
% 15.28/2.76  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 15.28/2.76  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 15.28/2.76  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 15.28/2.76  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 15.64/2.78  Prover 8: Preprocessing ...
% 15.64/2.79  Prover 10: Preprocessing ...
% 15.64/2.80  Prover 11: Preprocessing ...
% 15.64/2.81  Prover 13: Preprocessing ...
% 16.37/2.87  Prover 8: Warning: ignoring some quantifiers
% 16.37/2.88  Prover 8: Constructing countermodel ...
% 16.37/2.88  Prover 13: Warning: ignoring some quantifiers
% 16.37/2.89  Prover 13: Constructing countermodel ...
% 16.37/2.89  Prover 10: Constructing countermodel ...
% 16.37/2.92  Prover 11: Constructing countermodel ...
% 16.75/2.95  Prover 10: Found proof (size 32)
% 16.75/2.95  Prover 10: proved (196ms)
% 16.75/2.95  Prover 8: stopped
% 16.75/2.95  Prover 7: stopped
% 16.75/2.95  Prover 4: stopped
% 16.75/2.95  Prover 13: stopped
% 16.75/2.95  Prover 1: stopped
% 16.75/2.95  Prover 11: stopped
% 16.99/2.95  
% 16.99/2.95  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.99/2.95  
% 16.99/2.96  % SZS output start Proof for theBenchmark
% 16.99/2.96  Assumptions after simplification:
% 16.99/2.96  ---------------------------------
% 16.99/2.96  
% 16.99/2.96    (additive_commutativity)
% 16.99/2.98     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (addition(v0, v1) = v2) |  ~
% 16.99/2.98      $i(v1) |  ~ $i(v0) | (addition(v1, v0) = v2 & $i(v2)))
% 16.99/2.98  
% 16.99/2.98    (goals)
% 16.99/2.98    $i(one) &  ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i]
% 16.99/2.98    :  ? [v5: $i] :  ? [v6: $i] :  ? [v7: $i] : ( ~ (v7 = one) & c(v1) = v5 &
% 16.99/2.98      c(v0) = v2 & multiplication(v3, v5) = v6 & multiplication(v3, v1) = v4 &
% 16.99/2.98      addition(v4, v6) = v7 & addition(v0, v2) = v3 & $i(v7) & $i(v6) & $i(v5) &
% 16.99/2.98      $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & test(v1) & test(v0))
% 16.99/2.98  
% 16.99/2.98    (multiplicative_left_identity)
% 16.99/2.99    $i(one) &  ! [v0: $i] :  ! [v1: $i] : (v1 = v0 |  ~ (multiplication(one, v0) =
% 16.99/2.99        v1) |  ~ $i(v0))
% 16.99/2.99  
% 16.99/2.99    (right_distributivity)
% 16.99/2.99     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] :  ! [v5:
% 16.99/2.99      $i] : ( ~ (multiplication(v0, v2) = v4) |  ~ (multiplication(v0, v1) = v3) |
% 16.99/2.99       ~ (addition(v3, v4) = v5) |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ? [v6: $i]
% 16.99/2.99      : (multiplication(v0, v6) = v5 & addition(v1, v2) = v6 & $i(v6) & $i(v5)))
% 16.99/2.99  
% 16.99/2.99    (test_2)
% 16.99/2.99    $i(one) & $i(zero) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v2 = one |  ~
% 16.99/2.99      (addition(v0, v1) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ complement(v1, v0)) & 
% 16.99/2.99    ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (addition(v0, v1) = v2) |  ~
% 16.99/2.99      $i(v1) |  ~ $i(v0) |  ~ complement(v1, v0) | (multiplication(v1, v0) = zero
% 16.99/2.99        & multiplication(v0, v1) = zero)) &  ! [v0: $i] :  ! [v1: $i] : ( ~
% 16.99/2.99      (addition(v0, v1) = one) |  ~ $i(v1) |  ~ $i(v0) | complement(v1, v0) |  ?
% 16.99/2.99      [v2: $i] :  ? [v3: $i] : (( ~ (v3 = zero) & multiplication(v1, v0) = v3 &
% 16.99/2.99          $i(v3)) | ( ~ (v2 = zero) & multiplication(v0, v1) = v2 & $i(v2))))
% 16.99/2.99  
% 16.99/2.99    (test_3)
% 16.99/2.99     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v2 = v1 |  ~ (c(v0) = v2) |  ~
% 16.99/2.99      $i(v1) |  ~ $i(v0) |  ~ complement(v0, v1) |  ~ test(v0)) &  ! [v0: $i] :  !
% 16.99/2.99    [v1: $i] : ( ~ (c(v0) = v1) |  ~ $i(v1) |  ~ $i(v0) |  ~ test(v0) |
% 16.99/2.99      complement(v0, v1))
% 16.99/2.99  
% 16.99/2.99    (function-axioms)
% 16.99/2.99     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 16.99/2.99      (multiplication(v3, v2) = v1) |  ~ (multiplication(v3, v2) = v0)) &  ! [v0:
% 16.99/2.99      $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (addition(v3,
% 16.99/2.99          v2) = v1) |  ~ (addition(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  !
% 16.99/3.00    [v2: $i] : (v1 = v0 |  ~ (c(v2) = v1) |  ~ (c(v2) = v0))
% 16.99/3.00  
% 16.99/3.00  Further assumptions not needed in the proof:
% 16.99/3.00  --------------------------------------------
% 16.99/3.00  additive_associativity, additive_idempotence, additive_identity,
% 16.99/3.00  left_annihilation, left_distributivity, multiplicative_associativity,
% 16.99/3.00  multiplicative_right_identity, order, right_annihilation, test_1, test_4,
% 16.99/3.00  test_deMorgan1, test_deMorgan2
% 16.99/3.00  
% 16.99/3.00  Those formulas are unsatisfiable:
% 16.99/3.00  ---------------------------------
% 16.99/3.00  
% 16.99/3.00  Begin of proof
% 16.99/3.00  | 
% 16.99/3.00  | ALPHA: (multiplicative_left_identity) implies:
% 16.99/3.00  |   (1)   ! [v0: $i] :  ! [v1: $i] : (v1 = v0 |  ~ (multiplication(one, v0) =
% 16.99/3.00  |            v1) |  ~ $i(v0))
% 16.99/3.00  | 
% 16.99/3.00  | ALPHA: (test_2) implies:
% 16.99/3.00  |   (2)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v2 = one |  ~ (addition(v0,
% 16.99/3.00  |              v1) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ complement(v1, v0))
% 16.99/3.00  | 
% 16.99/3.00  | ALPHA: (test_3) implies:
% 16.99/3.00  |   (3)   ! [v0: $i] :  ! [v1: $i] : ( ~ (c(v0) = v1) |  ~ $i(v1) |  ~ $i(v0) | 
% 16.99/3.00  |          ~ test(v0) | complement(v0, v1))
% 16.99/3.00  | 
% 16.99/3.00  | ALPHA: (goals) implies:
% 16.99/3.00  |   (4)   ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] : 
% 16.99/3.00  |        ? [v5: $i] :  ? [v6: $i] :  ? [v7: $i] : ( ~ (v7 = one) & c(v1) = v5 &
% 16.99/3.00  |          c(v0) = v2 & multiplication(v3, v5) = v6 & multiplication(v3, v1) =
% 16.99/3.00  |          v4 & addition(v4, v6) = v7 & addition(v0, v2) = v3 & $i(v7) & $i(v6)
% 16.99/3.00  |          & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & test(v1) &
% 16.99/3.00  |          test(v0))
% 16.99/3.00  | 
% 16.99/3.00  | ALPHA: (function-axioms) implies:
% 16.99/3.00  |   (5)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 16.99/3.00  |          (addition(v3, v2) = v1) |  ~ (addition(v3, v2) = v0))
% 16.99/3.00  | 
% 16.99/3.00  | DELTA: instantiating (4) with fresh symbols all_22_0, all_22_1, all_22_2,
% 16.99/3.00  |        all_22_3, all_22_4, all_22_5, all_22_6, all_22_7 gives:
% 16.99/3.00  |   (6)   ~ (all_22_0 = one) & c(all_22_6) = all_22_2 & c(all_22_7) = all_22_5 &
% 16.99/3.00  |        multiplication(all_22_4, all_22_2) = all_22_1 &
% 16.99/3.00  |        multiplication(all_22_4, all_22_6) = all_22_3 & addition(all_22_3,
% 16.99/3.00  |          all_22_1) = all_22_0 & addition(all_22_7, all_22_5) = all_22_4 &
% 16.99/3.00  |        $i(all_22_0) & $i(all_22_1) & $i(all_22_2) & $i(all_22_3) &
% 16.99/3.00  |        $i(all_22_4) & $i(all_22_5) & $i(all_22_6) & $i(all_22_7) &
% 16.99/3.00  |        test(all_22_6) & test(all_22_7)
% 16.99/3.00  | 
% 16.99/3.00  | ALPHA: (6) implies:
% 16.99/3.00  |   (7)   ~ (all_22_0 = one)
% 16.99/3.00  |   (8)  test(all_22_7)
% 16.99/3.00  |   (9)  test(all_22_6)
% 16.99/3.00  |   (10)  $i(all_22_7)
% 16.99/3.00  |   (11)  $i(all_22_6)
% 16.99/3.00  |   (12)  $i(all_22_5)
% 16.99/3.00  |   (13)  $i(all_22_3)
% 16.99/3.00  |   (14)  $i(all_22_2)
% 16.99/3.00  |   (15)  $i(all_22_1)
% 16.99/3.00  |   (16)  addition(all_22_7, all_22_5) = all_22_4
% 16.99/3.00  |   (17)  addition(all_22_3, all_22_1) = all_22_0
% 16.99/3.01  |   (18)  multiplication(all_22_4, all_22_6) = all_22_3
% 16.99/3.01  |   (19)  multiplication(all_22_4, all_22_2) = all_22_1
% 16.99/3.01  |   (20)  c(all_22_7) = all_22_5
% 16.99/3.01  |   (21)  c(all_22_6) = all_22_2
% 16.99/3.01  | 
% 16.99/3.01  | GROUND_INST: instantiating (additive_commutativity) with all_22_7, all_22_5,
% 16.99/3.01  |              all_22_4, simplifying with (10), (12), (16) gives:
% 16.99/3.01  |   (22)  addition(all_22_5, all_22_7) = all_22_4 & $i(all_22_4)
% 16.99/3.01  | 
% 16.99/3.01  | ALPHA: (22) implies:
% 16.99/3.01  |   (23)  $i(all_22_4)
% 16.99/3.01  |   (24)  addition(all_22_5, all_22_7) = all_22_4
% 16.99/3.01  | 
% 16.99/3.01  | GROUND_INST: instantiating (additive_commutativity) with all_22_3, all_22_1,
% 16.99/3.01  |              all_22_0, simplifying with (13), (15), (17) gives:
% 16.99/3.01  |   (25)  addition(all_22_1, all_22_3) = all_22_0 & $i(all_22_0)
% 16.99/3.01  | 
% 16.99/3.01  | ALPHA: (25) implies:
% 16.99/3.01  |   (26)  addition(all_22_1, all_22_3) = all_22_0
% 16.99/3.01  | 
% 16.99/3.01  | GROUND_INST: instantiating (right_distributivity) with all_22_4, all_22_6,
% 16.99/3.01  |              all_22_2, all_22_3, all_22_1, all_22_0, simplifying with (11),
% 16.99/3.01  |              (14), (17), (18), (19), (23) gives:
% 16.99/3.01  |   (27)   ? [v0: $i] : (multiplication(all_22_4, v0) = all_22_0 &
% 16.99/3.01  |           addition(all_22_6, all_22_2) = v0 & $i(v0) & $i(all_22_0))
% 16.99/3.01  | 
% 16.99/3.01  | GROUND_INST: instantiating (3) with all_22_7, all_22_5, simplifying with (8),
% 16.99/3.01  |              (10), (12), (20) gives:
% 16.99/3.01  |   (28)  complement(all_22_7, all_22_5)
% 16.99/3.01  | 
% 16.99/3.01  | GROUND_INST: instantiating (3) with all_22_6, all_22_2, simplifying with (9),
% 16.99/3.01  |              (11), (14), (21) gives:
% 16.99/3.01  |   (29)  complement(all_22_6, all_22_2)
% 16.99/3.01  | 
% 16.99/3.01  | DELTA: instantiating (27) with fresh symbol all_34_0 gives:
% 16.99/3.01  |   (30)  multiplication(all_22_4, all_34_0) = all_22_0 & addition(all_22_6,
% 16.99/3.01  |           all_22_2) = all_34_0 & $i(all_34_0) & $i(all_22_0)
% 16.99/3.01  | 
% 16.99/3.01  | ALPHA: (30) implies:
% 16.99/3.01  |   (31)  addition(all_22_6, all_22_2) = all_34_0
% 16.99/3.01  | 
% 16.99/3.01  | GROUND_INST: instantiating (additive_commutativity) with all_22_6, all_22_2,
% 16.99/3.01  |              all_34_0, simplifying with (11), (14), (31) gives:
% 16.99/3.01  |   (32)  addition(all_22_2, all_22_6) = all_34_0 & $i(all_34_0)
% 16.99/3.01  | 
% 16.99/3.01  | ALPHA: (32) implies:
% 16.99/3.01  |   (33)  addition(all_22_2, all_22_6) = all_34_0
% 16.99/3.01  | 
% 16.99/3.01  | GROUND_INST: instantiating (2) with all_22_5, all_22_7, all_22_4, simplifying
% 16.99/3.01  |              with (10), (12), (24), (28) gives:
% 16.99/3.01  |   (34)  all_22_4 = one
% 16.99/3.01  | 
% 16.99/3.01  | GROUND_INST: instantiating (right_distributivity) with all_22_4, all_22_2,
% 16.99/3.01  |              all_22_6, all_22_1, all_22_3, all_22_0, simplifying with (11),
% 16.99/3.01  |              (14), (18), (19), (23), (26) gives:
% 16.99/3.01  |   (35)   ? [v0: $i] : (multiplication(all_22_4, v0) = all_22_0 &
% 16.99/3.01  |           addition(all_22_2, all_22_6) = v0 & $i(v0) & $i(all_22_0))
% 16.99/3.01  | 
% 16.99/3.01  | DELTA: instantiating (35) with fresh symbol all_42_0 gives:
% 16.99/3.01  |   (36)  multiplication(all_22_4, all_42_0) = all_22_0 & addition(all_22_2,
% 16.99/3.01  |           all_22_6) = all_42_0 & $i(all_42_0) & $i(all_22_0)
% 16.99/3.01  | 
% 16.99/3.01  | ALPHA: (36) implies:
% 16.99/3.01  |   (37)  $i(all_42_0)
% 16.99/3.01  |   (38)  addition(all_22_2, all_22_6) = all_42_0
% 16.99/3.01  |   (39)  multiplication(all_22_4, all_42_0) = all_22_0
% 16.99/3.01  | 
% 16.99/3.01  | REDUCE: (34), (39) imply:
% 16.99/3.01  |   (40)  multiplication(one, all_42_0) = all_22_0
% 16.99/3.01  | 
% 16.99/3.01  | GROUND_INST: instantiating (5) with all_34_0, all_42_0, all_22_6, all_22_2,
% 16.99/3.01  |              simplifying with (33), (38) gives:
% 16.99/3.01  |   (41)  all_42_0 = all_34_0
% 16.99/3.01  | 
% 16.99/3.02  | REDUCE: (40), (41) imply:
% 16.99/3.02  |   (42)  multiplication(one, all_34_0) = all_22_0
% 16.99/3.02  | 
% 16.99/3.02  | REDUCE: (37), (41) imply:
% 16.99/3.02  |   (43)  $i(all_34_0)
% 16.99/3.02  | 
% 16.99/3.02  | GROUND_INST: instantiating (2) with all_22_2, all_22_6, all_34_0, simplifying
% 16.99/3.02  |              with (11), (14), (29), (33) gives:
% 16.99/3.02  |   (44)  all_34_0 = one
% 16.99/3.02  | 
% 16.99/3.02  | GROUND_INST: instantiating (1) with all_34_0, all_22_0, simplifying with (42),
% 16.99/3.02  |              (43) gives:
% 16.99/3.02  |   (45)  all_34_0 = all_22_0
% 16.99/3.02  | 
% 16.99/3.02  | COMBINE_EQS: (44), (45) imply:
% 16.99/3.02  |   (46)  all_22_0 = one
% 16.99/3.02  | 
% 16.99/3.02  | REDUCE: (7), (46) imply:
% 16.99/3.02  |   (47)  $false
% 16.99/3.02  | 
% 16.99/3.02  | CLOSE: (47) is inconsistent.
% 16.99/3.02  | 
% 16.99/3.02  End of proof
% 16.99/3.02  % SZS output end Proof for theBenchmark
% 16.99/3.02  
% 16.99/3.02  2400ms
%------------------------------------------------------------------------------