TSTP Solution File: ALG201+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ALG201+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n008.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 : Wed Aug 30 16:39:52 EDT 2023
% Result : Theorem 5.87s 1.58s
% Output : Proof 7.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG201+1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n008.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 : Mon Aug 28 04:03:02 EDT 2023
% 0.13/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/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.20/1.03 Prover 1: Preprocessing ...
% 2.20/1.03 Prover 4: Preprocessing ...
% 2.20/1.07 Prover 5: Preprocessing ...
% 2.20/1.07 Prover 3: Preprocessing ...
% 2.20/1.07 Prover 6: Preprocessing ...
% 2.20/1.07 Prover 0: Preprocessing ...
% 2.20/1.07 Prover 2: Preprocessing ...
% 3.43/1.37 Prover 3: Constructing countermodel ...
% 3.43/1.38 Prover 1: Constructing countermodel ...
% 4.13/1.38 Prover 6: Proving ...
% 4.13/1.40 Prover 5: Constructing countermodel ...
% 4.13/1.40 Prover 2: Proving ...
% 4.13/1.45 Prover 4: Constructing countermodel ...
% 4.13/1.46 Prover 0: Proving ...
% 5.17/1.48 Prover 3: gave up
% 5.17/1.49 Prover 1: gave up
% 5.17/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.17/1.51 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.17/1.52 Prover 7: Preprocessing ...
% 5.17/1.53 Prover 8: Preprocessing ...
% 5.87/1.58 Prover 5: proved (902ms)
% 5.87/1.58
% 5.87/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.87/1.58
% 5.87/1.58 Prover 6: stopped
% 5.87/1.58 Prover 2: stopped
% 5.87/1.58 Prover 0: stopped
% 5.87/1.58 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.87/1.58 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 5.87/1.58 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.87/1.58 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.87/1.59 Prover 7: Constructing countermodel ...
% 5.87/1.60 Prover 13: Preprocessing ...
% 5.87/1.60 Prover 10: Preprocessing ...
% 5.87/1.60 Prover 8: Warning: ignoring some quantifiers
% 5.87/1.60 Prover 16: Preprocessing ...
% 5.87/1.60 Prover 8: Constructing countermodel ...
% 5.87/1.60 Prover 11: Preprocessing ...
% 5.87/1.61 Prover 7: gave up
% 5.87/1.61 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085
% 6.20/1.62 Prover 19: Preprocessing ...
% 6.40/1.65 Prover 10: Constructing countermodel ...
% 6.40/1.66 Prover 16: Constructing countermodel ...
% 6.40/1.67 Prover 10: gave up
% 6.40/1.67 Prover 13: Constructing countermodel ...
% 6.40/1.69 Prover 19: Warning: ignoring some quantifiers
% 6.40/1.70 Prover 8: gave up
% 6.40/1.70 Prover 19: Constructing countermodel ...
% 7.00/1.76 Prover 11: Constructing countermodel ...
% 7.00/1.77 Prover 13: Found proof (size 33)
% 7.00/1.77 Prover 13: proved (187ms)
% 7.00/1.77 Prover 19: stopped
% 7.00/1.77 Prover 4: stopped
% 7.00/1.77 Prover 16: stopped
% 7.00/1.77 Prover 11: stopped
% 7.00/1.77
% 7.00/1.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.00/1.77
% 7.38/1.78 % SZS output start Proof for theBenchmark
% 7.38/1.78 Assumptions after simplification:
% 7.38/1.78 ---------------------------------
% 7.38/1.78
% 7.38/1.78 (ax3)
% 7.38/1.81 ! [v0: $i] : ( ~ (op1(v0, v0) = v0) | ~ $i(v0) | ~ sorti1(v0)) & ! [v0:
% 7.38/1.81 $i] : ( ~ $i(v0) | ~ sorti1(v0) | ? [v1: $i] : ( ~ (v1 = v0) & op1(v0, v0)
% 7.38/1.81 = v1 & $i(v1)))
% 7.38/1.81
% 7.38/1.81 (ax4)
% 7.38/1.81 ? [v0: $i] : (op2(v0, v0) = v0 & $i(v0) & sorti2(v0))
% 7.38/1.81
% 7.38/1.81 (co1)
% 7.38/1.83 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 7.38/1.83 (j(v2) = v3) | ~ (j(v0) = v1) | ~ (op1(v1, v3) = v4) | ~ $i(v2) | ~
% 7.38/1.83 $i(v0) | ~ sorti2(v2) | ~ sorti2(v0) | ? [v5: $i] : (j(v5) = v4 & op2(v0,
% 7.38/1.83 v2) = v5 & $i(v5) & $i(v4))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 7.38/1.83 ! [v3: $i] : ! [v4: $i] : ( ~ (h(v2) = v3) | ~ (h(v0) = v1) | ~ (op2(v1,
% 7.38/1.83 v3) = v4) | ~ $i(v2) | ~ $i(v0) | ~ sorti1(v2) | ~ sorti1(v0) | ?
% 7.38/1.83 [v5: $i] : (h(v5) = v4 & op1(v0, v2) = v5 & $i(v5) & $i(v4))) & ! [v0: $i]
% 7.38/1.83 : ! [v1: $i] : ( ~ (j(v0) = v1) | ~ $i(v0) | ~ sorti2(v0) | h(v1) = v0) &
% 7.38/1.83 ! [v0: $i] : ! [v1: $i] : ( ~ (j(v0) = v1) | ~ $i(v0) | ~ sorti2(v0) |
% 7.38/1.83 sorti1(v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ (h(v0) = v1) | ~ $i(v0) | ~
% 7.38/1.83 sorti1(v0) | j(v1) = v0) & ! [v0: $i] : ! [v1: $i] : ( ~ (h(v0) = v1) | ~
% 7.38/1.83 $i(v0) | ~ sorti1(v0) | sorti2(v1)) & ! [v0: $i] : ( ~ $i(v0) | ~
% 7.38/1.83 sorti2(v0) | ? [v1: $i] : (j(v0) = v1 & h(v1) = v0 & $i(v1))) & ! [v0: $i]
% 7.38/1.83 : ( ~ $i(v0) | ~ sorti2(v0) | ? [v1: $i] : (j(v0) = v1 & $i(v1) &
% 7.38/1.83 sorti1(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ sorti2(v0) | ? [v1: $i] :
% 7.38/1.83 (j(v0) = v1 & $i(v1) & ! [v2: $i] : ( ~ $i(v2) | ~ sorti2(v2) | ? [v3:
% 7.38/1.83 $i] : ? [v4: $i] : ? [v5: $i] : (j(v3) = v4 & j(v2) = v5 & op2(v0,
% 7.38/1.83 v2) = v3 & op1(v1, v5) = v4 & $i(v5) & $i(v4) & $i(v3))))) & ! [v0:
% 7.38/1.83 $i] : ( ~ $i(v0) | ~ sorti1(v0) | ? [v1: $i] : (j(v1) = v0 & h(v0) = v1 &
% 7.38/1.83 $i(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ sorti1(v0) | ? [v1: $i] : (h(v0)
% 7.38/1.83 = v1 & $i(v1) & sorti2(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ sorti1(v0) |
% 7.38/1.83 ? [v1: $i] : (h(v0) = v1 & $i(v1) & ! [v2: $i] : ( ~ $i(v2) | ~ sorti1(v2)
% 7.38/1.83 | ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : (h(v3) = v4 & h(v2) = v5 &
% 7.38/1.83 op2(v1, v5) = v4 & op1(v0, v2) = v3 & $i(v5) & $i(v4) & $i(v3)))))
% 7.38/1.83
% 7.38/1.83 (function-axioms)
% 7.38/1.84 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (op2(v3,
% 7.38/1.84 v2) = v1) | ~ (op2(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2:
% 7.38/1.84 $i] : ! [v3: $i] : (v1 = v0 | ~ (op1(v3, v2) = v1) | ~ (op1(v3, v2) =
% 7.38/1.84 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (j(v2) =
% 7.38/1.84 v1) | ~ (j(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 =
% 7.38/1.84 v0 | ~ (h(v2) = v1) | ~ (h(v2) = v0))
% 7.38/1.84
% 7.38/1.84 Further assumptions not needed in the proof:
% 7.38/1.84 --------------------------------------------
% 7.38/1.84 ax1, ax2
% 7.38/1.84
% 7.38/1.84 Those formulas are unsatisfiable:
% 7.38/1.84 ---------------------------------
% 7.38/1.84
% 7.38/1.84 Begin of proof
% 7.38/1.84 |
% 7.38/1.84 | ALPHA: (ax3) implies:
% 7.38/1.84 | (1) ! [v0: $i] : ( ~ (op1(v0, v0) = v0) | ~ $i(v0) | ~ sorti1(v0))
% 7.38/1.84 |
% 7.38/1.84 | ALPHA: (co1) implies:
% 7.38/1.84 | (2) ! [v0: $i] : ( ~ $i(v0) | ~ sorti2(v0) | ? [v1: $i] : (j(v0) = v1 &
% 7.38/1.84 | $i(v1) & ! [v2: $i] : ( ~ $i(v2) | ~ sorti2(v2) | ? [v3: $i] :
% 7.38/1.84 | ? [v4: $i] : ? [v5: $i] : (j(v3) = v4 & j(v2) = v5 & op2(v0, v2)
% 7.38/1.84 | = v3 & op1(v1, v5) = v4 & $i(v5) & $i(v4) & $i(v3)))))
% 7.38/1.84 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ sorti2(v0) | ? [v1: $i] : (j(v0) = v1 &
% 7.38/1.84 | $i(v1) & sorti1(v1)))
% 7.38/1.84 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ sorti2(v0) | ? [v1: $i] : (j(v0) = v1 &
% 7.38/1.84 | h(v1) = v0 & $i(v1)))
% 7.38/1.84 |
% 7.38/1.84 | ALPHA: (function-axioms) implies:
% 7.38/1.84 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (j(v2) = v1) |
% 7.38/1.84 | ~ (j(v2) = v0))
% 7.38/1.84 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 7.38/1.84 | (op2(v3, v2) = v1) | ~ (op2(v3, v2) = v0))
% 7.38/1.84 |
% 7.38/1.85 | DELTA: instantiating (ax4) with fresh symbol all_7_0 gives:
% 7.38/1.85 | (7) op2(all_7_0, all_7_0) = all_7_0 & $i(all_7_0) & sorti2(all_7_0)
% 7.38/1.85 |
% 7.38/1.85 | ALPHA: (7) implies:
% 7.38/1.85 | (8) sorti2(all_7_0)
% 7.38/1.85 | (9) $i(all_7_0)
% 7.38/1.85 | (10) op2(all_7_0, all_7_0) = all_7_0
% 7.38/1.85 |
% 7.38/1.85 | GROUND_INST: instantiating (4) with all_7_0, simplifying with (8), (9) gives:
% 7.38/1.85 | (11) ? [v0: $i] : (j(all_7_0) = v0 & h(v0) = all_7_0 & $i(v0))
% 7.38/1.85 |
% 7.38/1.85 | GROUND_INST: instantiating (3) with all_7_0, simplifying with (8), (9) gives:
% 7.75/1.85 | (12) ? [v0: $i] : (j(all_7_0) = v0 & $i(v0) & sorti1(v0))
% 7.75/1.85 |
% 7.75/1.85 | GROUND_INST: instantiating (2) with all_7_0, simplifying with (8), (9) gives:
% 7.75/1.85 | (13) ? [v0: $i] : (j(all_7_0) = v0 & $i(v0) & ! [v1: $i] : ( ~ $i(v1) |
% 7.75/1.85 | ~ sorti2(v1) | ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : (j(v2) =
% 7.75/1.85 | v3 & j(v1) = v4 & op2(all_7_0, v1) = v2 & op1(v0, v4) = v3 &
% 7.75/1.85 | $i(v4) & $i(v3) & $i(v2))))
% 7.75/1.85 |
% 7.75/1.85 | DELTA: instantiating (12) with fresh symbol all_14_0 gives:
% 7.75/1.85 | (14) j(all_7_0) = all_14_0 & $i(all_14_0) & sorti1(all_14_0)
% 7.75/1.85 |
% 7.75/1.85 | ALPHA: (14) implies:
% 7.75/1.85 | (15) sorti1(all_14_0)
% 7.75/1.85 | (16) j(all_7_0) = all_14_0
% 7.75/1.85 |
% 7.75/1.85 | DELTA: instantiating (11) with fresh symbol all_16_0 gives:
% 7.75/1.85 | (17) j(all_7_0) = all_16_0 & h(all_16_0) = all_7_0 & $i(all_16_0)
% 7.75/1.85 |
% 7.75/1.85 | ALPHA: (17) implies:
% 7.75/1.85 | (18) j(all_7_0) = all_16_0
% 7.75/1.85 |
% 7.75/1.85 | DELTA: instantiating (13) with fresh symbol all_18_0 gives:
% 7.75/1.85 | (19) j(all_7_0) = all_18_0 & $i(all_18_0) & ! [v0: $i] : ( ~ $i(v0) | ~
% 7.75/1.85 | sorti2(v0) | ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (j(v1) = v2 &
% 7.75/1.85 | j(v0) = v3 & op2(all_7_0, v0) = v1 & op1(all_18_0, v3) = v2 &
% 7.75/1.85 | $i(v3) & $i(v2) & $i(v1)))
% 7.75/1.85 |
% 7.75/1.85 | ALPHA: (19) implies:
% 7.75/1.85 | (20) j(all_7_0) = all_18_0
% 7.75/1.86 | (21) ! [v0: $i] : ( ~ $i(v0) | ~ sorti2(v0) | ? [v1: $i] : ? [v2: $i] :
% 7.75/1.86 | ? [v3: $i] : (j(v1) = v2 & j(v0) = v3 & op2(all_7_0, v0) = v1 &
% 7.75/1.86 | op1(all_18_0, v3) = v2 & $i(v3) & $i(v2) & $i(v1)))
% 7.75/1.86 |
% 7.75/1.86 | GROUND_INST: instantiating (21) with all_7_0, simplifying with (8), (9) gives:
% 7.75/1.86 | (22) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (j(v0) = v1 & j(all_7_0) =
% 7.75/1.86 | v2 & op2(all_7_0, all_7_0) = v0 & op1(all_18_0, v2) = v1 & $i(v2) &
% 7.75/1.86 | $i(v1) & $i(v0))
% 7.75/1.86 |
% 7.75/1.86 | DELTA: instantiating (22) with fresh symbols all_21_0, all_21_1, all_21_2
% 7.75/1.86 | gives:
% 7.75/1.86 | (23) j(all_21_2) = all_21_1 & j(all_7_0) = all_21_0 & op2(all_7_0, all_7_0)
% 7.75/1.86 | = all_21_2 & op1(all_18_0, all_21_0) = all_21_1 & $i(all_21_0) &
% 7.75/1.86 | $i(all_21_1) & $i(all_21_2)
% 7.75/1.86 |
% 7.75/1.86 | ALPHA: (23) implies:
% 7.75/1.86 | (24) $i(all_21_1)
% 7.75/1.86 | (25) op1(all_18_0, all_21_0) = all_21_1
% 7.75/1.86 | (26) op2(all_7_0, all_7_0) = all_21_2
% 7.75/1.86 | (27) j(all_7_0) = all_21_0
% 7.75/1.86 | (28) j(all_21_2) = all_21_1
% 7.75/1.86 |
% 7.75/1.86 | GROUND_INST: instantiating (6) with all_7_0, all_21_2, all_7_0, all_7_0,
% 7.75/1.86 | simplifying with (10), (26) gives:
% 7.75/1.86 | (29) all_21_2 = all_7_0
% 7.75/1.86 |
% 7.75/1.86 | GROUND_INST: instantiating (5) with all_16_0, all_18_0, all_7_0, simplifying
% 7.75/1.86 | with (18), (20) gives:
% 7.75/1.86 | (30) all_18_0 = all_16_0
% 7.75/1.86 |
% 7.75/1.86 | GROUND_INST: instantiating (5) with all_18_0, all_21_0, all_7_0, simplifying
% 7.75/1.86 | with (20), (27) gives:
% 7.75/1.86 | (31) all_21_0 = all_18_0
% 7.75/1.86 |
% 7.75/1.86 | GROUND_INST: instantiating (5) with all_14_0, all_21_0, all_7_0, simplifying
% 7.75/1.86 | with (16), (27) gives:
% 7.75/1.86 | (32) all_21_0 = all_14_0
% 7.75/1.86 |
% 7.75/1.86 | COMBINE_EQS: (31), (32) imply:
% 7.75/1.86 | (33) all_18_0 = all_14_0
% 7.75/1.86 |
% 7.75/1.86 | SIMP: (33) implies:
% 7.75/1.86 | (34) all_18_0 = all_14_0
% 7.75/1.86 |
% 7.75/1.86 | COMBINE_EQS: (30), (34) imply:
% 7.75/1.86 | (35) all_16_0 = all_14_0
% 7.75/1.86 |
% 7.75/1.86 | SIMP: (35) implies:
% 7.75/1.86 | (36) all_16_0 = all_14_0
% 7.75/1.86 |
% 7.75/1.86 | REDUCE: (28), (29) imply:
% 7.75/1.86 | (37) j(all_7_0) = all_21_1
% 7.75/1.86 |
% 7.75/1.86 | REDUCE: (25), (32), (34) imply:
% 7.75/1.86 | (38) op1(all_14_0, all_14_0) = all_21_1
% 7.75/1.86 |
% 7.75/1.86 | GROUND_INST: instantiating (5) with all_14_0, all_21_1, all_7_0, simplifying
% 7.75/1.86 | with (16), (37) gives:
% 7.75/1.86 | (39) all_21_1 = all_14_0
% 7.75/1.86 |
% 7.75/1.86 | REDUCE: (38), (39) imply:
% 7.75/1.87 | (40) op1(all_14_0, all_14_0) = all_14_0
% 7.75/1.87 |
% 7.75/1.87 | REDUCE: (24), (39) imply:
% 7.75/1.87 | (41) $i(all_14_0)
% 7.75/1.87 |
% 7.75/1.87 | GROUND_INST: instantiating (1) with all_14_0, simplifying with (15), (40),
% 7.75/1.87 | (41) gives:
% 7.75/1.87 | (42) $false
% 7.75/1.87 |
% 7.75/1.87 | CLOSE: (42) is inconsistent.
% 7.75/1.87 |
% 7.75/1.87 End of proof
% 7.75/1.87 % SZS output end Proof for theBenchmark
% 7.75/1.87
% 7.75/1.87 1246ms
%------------------------------------------------------------------------------