TSTP Solution File: SWV387+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV387+1 : TPTP v8.1.2. Released v3.3.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 22:56:07 EDT 2023
% Result : Theorem 9.24s 2.07s
% Output : Proof 11.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV387+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.17/0.34 % Computer : n014.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Aug 29 03:02:15 EDT 2023
% 0.17/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.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.07/1.17 Prover 1: Preprocessing ...
% 3.07/1.17 Prover 4: Preprocessing ...
% 3.07/1.21 Prover 5: Preprocessing ...
% 3.07/1.21 Prover 3: Preprocessing ...
% 3.07/1.21 Prover 0: Preprocessing ...
% 3.07/1.21 Prover 6: Preprocessing ...
% 3.07/1.21 Prover 2: Preprocessing ...
% 7.66/1.80 Prover 1: Warning: ignoring some quantifiers
% 8.00/1.86 Prover 3: Warning: ignoring some quantifiers
% 8.00/1.89 Prover 6: Proving ...
% 8.00/1.90 Prover 1: Constructing countermodel ...
% 8.00/1.91 Prover 3: Constructing countermodel ...
% 8.75/1.94 Prover 4: Constructing countermodel ...
% 8.75/1.94 Prover 5: Proving ...
% 8.75/1.94 Prover 2: Proving ...
% 8.75/1.95 Prover 0: Proving ...
% 9.24/2.07 Prover 3: proved (1441ms)
% 9.24/2.07
% 9.24/2.07 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.24/2.07
% 9.24/2.07 Prover 0: stopped
% 9.81/2.08 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 9.81/2.08 Prover 6: stopped
% 9.81/2.08 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 9.81/2.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 9.81/2.09 Prover 5: proved (1465ms)
% 9.81/2.09
% 9.81/2.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.81/2.09
% 9.81/2.11 Prover 2: stopped
% 9.81/2.11 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.81/2.11 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 9.81/2.13 Prover 8: Preprocessing ...
% 9.81/2.14 Prover 7: Preprocessing ...
% 9.81/2.14 Prover 10: Preprocessing ...
% 9.81/2.16 Prover 1: Found proof (size 20)
% 9.81/2.16 Prover 1: proved (1544ms)
% 9.81/2.16 Prover 4: stopped
% 9.81/2.16 Prover 13: Preprocessing ...
% 9.81/2.17 Prover 11: Preprocessing ...
% 10.55/2.19 Prover 10: stopped
% 10.71/2.20 Prover 7: stopped
% 10.87/2.22 Prover 11: stopped
% 10.87/2.23 Prover 13: stopped
% 10.87/2.29 Prover 8: Warning: ignoring some quantifiers
% 10.87/2.31 Prover 8: Constructing countermodel ...
% 10.87/2.32 Prover 8: stopped
% 11.35/2.32
% 11.35/2.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.35/2.32
% 11.35/2.33 % SZS output start Proof for theBenchmark
% 11.35/2.33 Assumptions after simplification:
% 11.35/2.33 ---------------------------------
% 11.35/2.33
% 11.35/2.33 (l23_co)
% 11.35/2.37 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ( ~ (v4
% 11.35/2.37 = 0) & triple(v0, v1, v2) = v3 & check_cpq(v3) = v4 & $i(v3) & $i(v2) &
% 11.35/2.37 $i(v1) & $i(v0) & ? [v5: $i] : ? [v6: $i] : (ok(v6) = 0 & check_cpq(v6) =
% 11.35/2.37 0 & remove_cpq(v3, v5) = v6 & $i(v6) & $i(v5)))
% 11.35/2.37
% 11.35/2.37 (l23_l027)
% 11.35/2.37 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 11.35/2.37 $i] : ( ~ (triple(v0, v1, v2) = v4) | ~ (remove_cpq(v4, v3) = v5) | ~
% 11.35/2.37 $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: any] : ? [v7: any] :
% 11.35/2.37 ? [v8: any] : (ok(v5) = v7 & check_cpq(v5) = v6 & check_cpq(v4) = v8 & ( ~
% 11.35/2.37 (v7 = 0) | ~ (v6 = 0) | v8 = 0)))
% 11.35/2.37
% 11.35/2.37 (function-axioms)
% 11.35/2.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0
% 11.35/2.39 | ~ (triple(v4, v3, v2) = v1) | ~ (triple(v4, v3, v2) = v0)) & ! [v0:
% 11.35/2.39 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 11.35/2.39 : ! [v4: $i] : (v1 = v0 | ~ (pair_in_list(v4, v3, v2) = v1) | ~
% 11.35/2.39 (pair_in_list(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 11.35/2.39 ! [v3: $i] : (v1 = v0 | ~ (remove_pqp(v3, v2) = v1) | ~ (remove_pqp(v3, v2)
% 11.35/2.39 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0
% 11.35/2.39 | ~ (insert_pqp(v3, v2) = v1) | ~ (insert_pqp(v3, v2) = v0)) & ! [v0:
% 11.35/2.39 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 11.35/2.39 : (v1 = v0 | ~ (contains_cpq(v3, v2) = v1) | ~ (contains_cpq(v3, v2) = v0))
% 11.35/2.39 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.35/2.39 (remove_cpq(v3, v2) = v1) | ~ (remove_cpq(v3, v2) = v0)) & ! [v0: $i] : !
% 11.35/2.39 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_cpq(v3, v2) = v1)
% 11.35/2.39 | ~ (insert_cpq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 11.35/2.39 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (succ_cpq(v3,
% 11.35/2.39 v2) = v1) | ~ (succ_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 11.35/2.39 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (update_slb(v3, v2) = v1) | ~
% 11.35/2.39 (update_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : !
% 11.35/2.39 [v3: $i] : (v1 = v0 | ~ (lookup_slb(v3, v2) = v1) | ~ (lookup_slb(v3, v2) =
% 11.35/2.39 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 |
% 11.35/2.39 ~ (remove_slb(v3, v2) = v1) | ~ (remove_slb(v3, v2) = v0)) & ! [v0:
% 11.35/2.39 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 11.35/2.39 : (v1 = v0 | ~ (contains_slb(v3, v2) = v1) | ~ (contains_slb(v3, v2) = v0))
% 11.35/2.39 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.35/2.39 (pair(v3, v2) = v1) | ~ (pair(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] :
% 11.35/2.39 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_slb(v3, v2) = v1) | ~
% 11.35/2.39 (insert_slb(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 11.35/2.39 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.35/2.39 (strictly_less_than(v3, v2) = v1) | ~ (strictly_less_than(v3, v2) = v0)) &
% 11.35/2.39 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 11.35/2.39 $i] : (v1 = v0 | ~ (less_than(v3, v2) = v1) | ~ (less_than(v3, v2) = v0))
% 11.35/2.39 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 11.35/2.39 (removemin_cpq_res(v2) = v1) | ~ (removemin_cpq_res(v2) = v0)) & ! [v0:
% 11.35/2.39 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_res(v2) = v1) |
% 11.35/2.39 ~ (findmin_cpq_res(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 11.35/2.39 (v1 = v0 | ~ (findmin_pqp_res(v2) = v1) | ~ (findmin_pqp_res(v2) = v0)) & !
% 11.35/2.39 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0
% 11.35/2.39 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 11.35/2.39 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (check_cpq(v2) = v1) |
% 11.35/2.39 ~ (check_cpq(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0
% 11.35/2.39 | ~ (removemin_cpq_eff(v2) = v1) | ~ (removemin_cpq_eff(v2) = v0)) & !
% 11.35/2.39 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_eff(v2) =
% 11.35/2.39 v1) | ~ (findmin_cpq_eff(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 11.35/2.39 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (isnonempty_slb(v2) =
% 11.35/2.39 v1) | ~ (isnonempty_slb(v2) = v0))
% 11.35/2.39
% 11.35/2.39 Further assumptions not needed in the proof:
% 11.35/2.39 --------------------------------------------
% 11.35/2.39 ax18, ax19, ax20, ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30,
% 11.35/2.39 ax31, ax32, ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax40, ax41, ax42, ax43,
% 11.35/2.39 ax44, ax45, ax46, ax47, ax48, ax49, ax50, ax51, ax52, ax53, bottom_smallest,
% 11.35/2.39 reflexivity, stricly_smaller_definition, totality, transitivity
% 11.35/2.39
% 11.35/2.39 Those formulas are unsatisfiable:
% 11.35/2.39 ---------------------------------
% 11.35/2.39
% 11.35/2.39 Begin of proof
% 11.35/2.39 |
% 11.35/2.39 | ALPHA: (function-axioms) implies:
% 11.35/2.39 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 11.35/2.39 | (v1 = v0 | ~ (check_cpq(v2) = v1) | ~ (check_cpq(v2) = v0))
% 11.35/2.39 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 11.35/2.39 | (v1 = v0 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0))
% 11.35/2.39 |
% 11.35/2.39 | DELTA: instantiating (l23_co) with fresh symbols all_45_0, all_45_1, all_45_2,
% 11.35/2.39 | all_45_3, all_45_4 gives:
% 11.35/2.39 | (3) ~ (all_45_0 = 0) & triple(all_45_4, all_45_3, all_45_2) = all_45_1 &
% 11.35/2.39 | check_cpq(all_45_1) = all_45_0 & $i(all_45_1) & $i(all_45_2) &
% 11.35/2.39 | $i(all_45_3) & $i(all_45_4) & ? [v0: $i] : ? [v1: $i] : (ok(v1) = 0 &
% 11.35/2.39 | check_cpq(v1) = 0 & remove_cpq(all_45_1, v0) = v1 & $i(v1) & $i(v0))
% 11.35/2.39 |
% 11.35/2.39 | ALPHA: (3) implies:
% 11.35/2.39 | (4) ~ (all_45_0 = 0)
% 11.35/2.39 | (5) $i(all_45_4)
% 11.35/2.39 | (6) $i(all_45_3)
% 11.35/2.39 | (7) $i(all_45_2)
% 11.35/2.39 | (8) check_cpq(all_45_1) = all_45_0
% 11.35/2.40 | (9) triple(all_45_4, all_45_3, all_45_2) = all_45_1
% 11.35/2.40 | (10) ? [v0: $i] : ? [v1: $i] : (ok(v1) = 0 & check_cpq(v1) = 0 &
% 11.35/2.40 | remove_cpq(all_45_1, v0) = v1 & $i(v1) & $i(v0))
% 11.35/2.40 |
% 11.35/2.40 | DELTA: instantiating (10) with fresh symbols all_53_0, all_53_1 gives:
% 11.35/2.40 | (11) ok(all_53_0) = 0 & check_cpq(all_53_0) = 0 & remove_cpq(all_45_1,
% 11.35/2.40 | all_53_1) = all_53_0 & $i(all_53_0) & $i(all_53_1)
% 11.35/2.40 |
% 11.35/2.40 | ALPHA: (11) implies:
% 11.35/2.40 | (12) $i(all_53_1)
% 11.35/2.40 | (13) remove_cpq(all_45_1, all_53_1) = all_53_0
% 11.35/2.40 | (14) check_cpq(all_53_0) = 0
% 11.35/2.40 | (15) ok(all_53_0) = 0
% 11.35/2.40 |
% 11.35/2.40 | GROUND_INST: instantiating (l23_l027) with all_45_4, all_45_3, all_45_2,
% 11.35/2.40 | all_53_1, all_45_1, all_53_0, simplifying with (5), (6), (7),
% 11.35/2.40 | (9), (12), (13) gives:
% 11.35/2.40 | (16) ? [v0: any] : ? [v1: any] : ? [v2: any] : (ok(all_53_0) = v1 &
% 11.35/2.40 | check_cpq(all_53_0) = v0 & check_cpq(all_45_1) = v2 & ( ~ (v1 = 0) |
% 11.35/2.40 | ~ (v0 = 0) | v2 = 0))
% 11.35/2.40 |
% 11.35/2.40 | DELTA: instantiating (16) with fresh symbols all_62_0, all_62_1, all_62_2
% 11.35/2.40 | gives:
% 11.35/2.40 | (17) ok(all_53_0) = all_62_1 & check_cpq(all_53_0) = all_62_2 &
% 11.35/2.40 | check_cpq(all_45_1) = all_62_0 & ( ~ (all_62_1 = 0) | ~ (all_62_2 =
% 11.35/2.40 | 0) | all_62_0 = 0)
% 11.35/2.40 |
% 11.35/2.40 | ALPHA: (17) implies:
% 11.78/2.40 | (18) check_cpq(all_45_1) = all_62_0
% 11.78/2.40 | (19) check_cpq(all_53_0) = all_62_2
% 11.78/2.40 | (20) ok(all_53_0) = all_62_1
% 11.78/2.40 | (21) ~ (all_62_1 = 0) | ~ (all_62_2 = 0) | all_62_0 = 0
% 11.78/2.40 |
% 11.78/2.40 | GROUND_INST: instantiating (1) with all_45_0, all_62_0, all_45_1, simplifying
% 11.78/2.40 | with (8), (18) gives:
% 11.78/2.40 | (22) all_62_0 = all_45_0
% 11.78/2.40 |
% 11.78/2.40 | GROUND_INST: instantiating (1) with 0, all_62_2, all_53_0, simplifying with
% 11.78/2.40 | (14), (19) gives:
% 11.78/2.40 | (23) all_62_2 = 0
% 11.78/2.40 |
% 11.78/2.40 | GROUND_INST: instantiating (2) with 0, all_62_1, all_53_0, simplifying with
% 11.78/2.40 | (15), (20) gives:
% 11.78/2.40 | (24) all_62_1 = 0
% 11.78/2.40 |
% 11.78/2.40 | BETA: splitting (21) gives:
% 11.78/2.40 |
% 11.78/2.40 | Case 1:
% 11.78/2.40 | |
% 11.78/2.40 | | (25) ~ (all_62_1 = 0)
% 11.78/2.40 | |
% 11.78/2.40 | | REDUCE: (24), (25) imply:
% 11.78/2.40 | | (26) $false
% 11.78/2.40 | |
% 11.78/2.40 | | CLOSE: (26) is inconsistent.
% 11.78/2.40 | |
% 11.78/2.40 | Case 2:
% 11.78/2.40 | |
% 11.78/2.40 | | (27) ~ (all_62_2 = 0) | all_62_0 = 0
% 11.78/2.40 | |
% 11.78/2.40 | | BETA: splitting (27) gives:
% 11.78/2.40 | |
% 11.78/2.40 | | Case 1:
% 11.78/2.40 | | |
% 11.78/2.40 | | | (28) ~ (all_62_2 = 0)
% 11.78/2.40 | | |
% 11.78/2.40 | | | REDUCE: (23), (28) imply:
% 11.78/2.40 | | | (29) $false
% 11.78/2.40 | | |
% 11.78/2.40 | | | CLOSE: (29) is inconsistent.
% 11.78/2.40 | | |
% 11.78/2.40 | | Case 2:
% 11.78/2.40 | | |
% 11.78/2.40 | | | (30) all_62_0 = 0
% 11.78/2.40 | | |
% 11.78/2.41 | | | COMBINE_EQS: (22), (30) imply:
% 11.78/2.41 | | | (31) all_45_0 = 0
% 11.78/2.41 | | |
% 11.78/2.41 | | | REDUCE: (4), (31) imply:
% 11.78/2.41 | | | (32) $false
% 11.78/2.41 | | |
% 11.78/2.41 | | | CLOSE: (32) is inconsistent.
% 11.78/2.41 | | |
% 11.78/2.41 | | End of split
% 11.78/2.41 | |
% 11.78/2.41 | End of split
% 11.78/2.41 |
% 11.78/2.41 End of proof
% 11.78/2.41 % SZS output end Proof for theBenchmark
% 11.78/2.41
% 11.78/2.41 1806ms
%------------------------------------------------------------------------------