TSTP Solution File: SWV389+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV389+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 : n025.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:08 EDT 2023
% Result : Theorem 9.09s 2.02s
% Output : Proof 11.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV389+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.13/0.32 % Computer : n025.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % 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 07:31:25 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.57 ________ _____
% 0.19/0.57 ___ __ \_________(_)________________________________
% 0.19/0.57 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.57 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.57 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.57
% 0.19/0.57 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.57 (2023-06-19)
% 0.19/0.57
% 0.19/0.57 (c) Philipp Rümmer, 2009-2023
% 0.19/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.57 Amanda Stjerna.
% 0.19/0.57 Free software under BSD-3-Clause.
% 0.19/0.57
% 0.19/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.57
% 0.19/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.59 Running up to 7 provers in parallel.
% 0.19/0.60 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.60 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.60 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.60 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.60 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.60 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.60 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.55/1.16 Prover 1: Preprocessing ...
% 3.55/1.18 Prover 4: Preprocessing ...
% 4.00/1.22 Prover 5: Preprocessing ...
% 4.00/1.22 Prover 3: Preprocessing ...
% 4.00/1.22 Prover 6: Preprocessing ...
% 4.00/1.22 Prover 0: Preprocessing ...
% 4.00/1.23 Prover 2: Preprocessing ...
% 7.94/1.77 Prover 1: Warning: ignoring some quantifiers
% 8.70/1.87 Prover 3: Warning: ignoring some quantifiers
% 8.70/1.87 Prover 1: Constructing countermodel ...
% 8.70/1.87 Prover 6: Proving ...
% 8.70/1.87 Prover 5: Proving ...
% 8.70/1.89 Prover 3: Constructing countermodel ...
% 9.09/1.91 Prover 4: Constructing countermodel ...
% 9.09/1.97 Prover 0: Proving ...
% 9.09/1.99 Prover 2: Proving ...
% 9.09/2.02 Prover 3: proved (1426ms)
% 9.09/2.02
% 9.09/2.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.09/2.02
% 9.09/2.02 Prover 5: stopped
% 9.09/2.02 Prover 0: stopped
% 9.09/2.03 Prover 6: stopped
% 9.09/2.03 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 9.09/2.03 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 9.09/2.03 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 9.09/2.03 Prover 2: stopped
% 9.09/2.04 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.09/2.04 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 9.79/2.07 Prover 8: Preprocessing ...
% 9.79/2.08 Prover 10: Preprocessing ...
% 9.79/2.09 Prover 7: Preprocessing ...
% 9.79/2.09 Prover 11: Preprocessing ...
% 9.79/2.10 Prover 1: Found proof (size 21)
% 9.79/2.10 Prover 1: proved (1509ms)
% 9.79/2.11 Prover 4: stopped
% 9.79/2.11 Prover 13: Preprocessing ...
% 9.79/2.15 Prover 10: stopped
% 9.79/2.16 Prover 7: stopped
% 10.81/2.17 Prover 11: stopped
% 10.81/2.19 Prover 13: stopped
% 11.10/2.23 Prover 8: Warning: ignoring some quantifiers
% 11.32/2.25 Prover 8: Constructing countermodel ...
% 11.32/2.26 Prover 8: stopped
% 11.32/2.26
% 11.32/2.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.32/2.26
% 11.32/2.26 % SZS output start Proof for theBenchmark
% 11.32/2.27 Assumptions after simplification:
% 11.32/2.27 ---------------------------------
% 11.32/2.27
% 11.32/2.27 (l25_co)
% 11.32/2.29 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ? [v5:
% 11.32/2.29 $i] : ( ~ (v4 = 0) & ok(v5) = 0 & triple(v0, v1, v2) = v3 & check_cpq(v5) =
% 11.32/2.29 0 & check_cpq(v3) = v4 & removemin_cpq_eff(v3) = v5 & $i(v5) & $i(v3) &
% 11.32/2.29 $i(v2) & $i(v1) & $i(v0))
% 11.32/2.29
% 11.32/2.29 (l25_l40)
% 11.32/2.29 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (triple(v0, v1,
% 11.32/2.29 v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: $i] : ? [v5:
% 11.32/2.29 any] : ? [v6: any] : ? [v7: any] : (ok(v4) = v6 & check_cpq(v4) = v5 &
% 11.32/2.29 check_cpq(v3) = v7 & removemin_cpq_eff(v3) = v4 & $i(v4) & ( ~ (v6 = 0) |
% 11.32/2.29 ~ (v5 = 0) | v7 = 0)))
% 11.32/2.29
% 11.32/2.29 (function-axioms)
% 11.32/2.30 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0
% 11.32/2.30 | ~ (triple(v4, v3, v2) = v1) | ~ (triple(v4, v3, v2) = v0)) & ! [v0:
% 11.32/2.30 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 11.32/2.30 : ! [v4: $i] : (v1 = v0 | ~ (pair_in_list(v4, v3, v2) = v1) | ~
% 11.32/2.30 (pair_in_list(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 11.32/2.30 ! [v3: $i] : (v1 = v0 | ~ (remove_pqp(v3, v2) = v1) | ~ (remove_pqp(v3, v2)
% 11.32/2.30 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0
% 11.32/2.30 | ~ (insert_pqp(v3, v2) = v1) | ~ (insert_pqp(v3, v2) = v0)) & ! [v0:
% 11.32/2.30 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 11.32/2.30 : (v1 = v0 | ~ (contains_cpq(v3, v2) = v1) | ~ (contains_cpq(v3, v2) = v0))
% 11.32/2.30 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.32/2.30 (remove_cpq(v3, v2) = v1) | ~ (remove_cpq(v3, v2) = v0)) & ! [v0: $i] : !
% 11.32/2.30 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_cpq(v3, v2) = v1)
% 11.32/2.31 | ~ (insert_cpq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 11.32/2.31 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (succ_cpq(v3,
% 11.32/2.31 v2) = v1) | ~ (succ_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 11.32/2.31 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (update_slb(v3, v2) = v1) | ~
% 11.32/2.31 (update_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : !
% 11.32/2.31 [v3: $i] : (v1 = v0 | ~ (lookup_slb(v3, v2) = v1) | ~ (lookup_slb(v3, v2) =
% 11.32/2.31 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 |
% 11.32/2.31 ~ (remove_slb(v3, v2) = v1) | ~ (remove_slb(v3, v2) = v0)) & ! [v0:
% 11.32/2.31 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 11.32/2.31 : (v1 = v0 | ~ (contains_slb(v3, v2) = v1) | ~ (contains_slb(v3, v2) = v0))
% 11.32/2.31 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.32/2.31 (pair(v3, v2) = v1) | ~ (pair(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] :
% 11.32/2.31 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_slb(v3, v2) = v1) | ~
% 11.32/2.31 (insert_slb(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 11.32/2.31 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 11.32/2.31 (strictly_less_than(v3, v2) = v1) | ~ (strictly_less_than(v3, v2) = v0)) &
% 11.32/2.31 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 11.32/2.31 $i] : (v1 = v0 | ~ (less_than(v3, v2) = v1) | ~ (less_than(v3, v2) = v0))
% 11.32/2.31 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 11.32/2.31 (removemin_cpq_res(v2) = v1) | ~ (removemin_cpq_res(v2) = v0)) & ! [v0:
% 11.32/2.31 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_res(v2) = v1) |
% 11.32/2.31 ~ (findmin_cpq_res(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 11.32/2.31 (v1 = v0 | ~ (findmin_pqp_res(v2) = v1) | ~ (findmin_pqp_res(v2) = v0)) & !
% 11.32/2.31 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0
% 11.32/2.31 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 11.32/2.31 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (check_cpq(v2) = v1) |
% 11.32/2.31 ~ (check_cpq(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0
% 11.32/2.31 | ~ (removemin_cpq_eff(v2) = v1) | ~ (removemin_cpq_eff(v2) = v0)) & !
% 11.32/2.31 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_eff(v2) =
% 11.32/2.31 v1) | ~ (findmin_cpq_eff(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 11.32/2.31 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (isnonempty_slb(v2) =
% 11.32/2.31 v1) | ~ (isnonempty_slb(v2) = v0))
% 11.32/2.31
% 11.32/2.31 Further assumptions not needed in the proof:
% 11.32/2.31 --------------------------------------------
% 11.32/2.31 ax18, ax19, ax20, ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30,
% 11.32/2.31 ax31, ax32, ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax40, ax41, ax42, ax43,
% 11.32/2.31 ax44, ax45, ax46, ax47, ax48, ax49, ax50, ax51, ax52, ax53, bottom_smallest,
% 11.32/2.31 reflexivity, stricly_smaller_definition, totality, transitivity
% 11.32/2.31
% 11.32/2.31 Those formulas are unsatisfiable:
% 11.32/2.31 ---------------------------------
% 11.32/2.31
% 11.32/2.31 Begin of proof
% 11.32/2.31 |
% 11.32/2.31 | ALPHA: (function-axioms) implies:
% 11.32/2.31 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 11.32/2.31 | (removemin_cpq_eff(v2) = v1) | ~ (removemin_cpq_eff(v2) = v0))
% 11.32/2.31 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 11.32/2.31 | (v1 = v0 | ~ (check_cpq(v2) = v1) | ~ (check_cpq(v2) = v0))
% 11.32/2.31 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 11.32/2.31 | (v1 = v0 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0))
% 11.32/2.31 |
% 11.32/2.31 | DELTA: instantiating (l25_co) with fresh symbols all_45_0, all_45_1, all_45_2,
% 11.32/2.31 | all_45_3, all_45_4, all_45_5 gives:
% 11.32/2.31 | (4) ~ (all_45_1 = 0) & ok(all_45_0) = 0 & triple(all_45_5, all_45_4,
% 11.32/2.31 | all_45_3) = all_45_2 & check_cpq(all_45_0) = 0 & check_cpq(all_45_2)
% 11.32/2.31 | = all_45_1 & removemin_cpq_eff(all_45_2) = all_45_0 & $i(all_45_0) &
% 11.32/2.31 | $i(all_45_2) & $i(all_45_3) & $i(all_45_4) & $i(all_45_5)
% 11.32/2.31 |
% 11.32/2.31 | ALPHA: (4) implies:
% 11.32/2.31 | (5) ~ (all_45_1 = 0)
% 11.32/2.31 | (6) $i(all_45_5)
% 11.32/2.31 | (7) $i(all_45_4)
% 11.32/2.31 | (8) $i(all_45_3)
% 11.32/2.31 | (9) removemin_cpq_eff(all_45_2) = all_45_0
% 11.32/2.31 | (10) check_cpq(all_45_2) = all_45_1
% 11.32/2.31 | (11) check_cpq(all_45_0) = 0
% 11.32/2.31 | (12) triple(all_45_5, all_45_4, all_45_3) = all_45_2
% 11.32/2.31 | (13) ok(all_45_0) = 0
% 11.32/2.31 |
% 11.32/2.31 | GROUND_INST: instantiating (l25_l40) with all_45_5, all_45_4, all_45_3,
% 11.32/2.31 | all_45_2, simplifying with (6), (7), (8), (12) gives:
% 11.32/2.32 | (14) ? [v0: $i] : ? [v1: any] : ? [v2: any] : ? [v3: any] : (ok(v0) =
% 11.32/2.32 | v2 & check_cpq(v0) = v1 & check_cpq(all_45_2) = v3 &
% 11.32/2.32 | removemin_cpq_eff(all_45_2) = v0 & $i(v0) & ( ~ (v2 = 0) | ~ (v1 =
% 11.32/2.32 | 0) | v3 = 0))
% 11.32/2.32 |
% 11.32/2.32 | DELTA: instantiating (14) with fresh symbols all_58_0, all_58_1, all_58_2,
% 11.32/2.32 | all_58_3 gives:
% 11.32/2.32 | (15) ok(all_58_3) = all_58_1 & check_cpq(all_58_3) = all_58_2 &
% 11.32/2.32 | check_cpq(all_45_2) = all_58_0 & removemin_cpq_eff(all_45_2) =
% 11.32/2.32 | all_58_3 & $i(all_58_3) & ( ~ (all_58_1 = 0) | ~ (all_58_2 = 0) |
% 11.32/2.32 | all_58_0 = 0)
% 11.32/2.32 |
% 11.32/2.32 | ALPHA: (15) implies:
% 11.32/2.32 | (16) removemin_cpq_eff(all_45_2) = all_58_3
% 11.32/2.32 | (17) check_cpq(all_45_2) = all_58_0
% 11.32/2.32 | (18) check_cpq(all_58_3) = all_58_2
% 11.32/2.32 | (19) ok(all_58_3) = all_58_1
% 11.32/2.32 | (20) ~ (all_58_1 = 0) | ~ (all_58_2 = 0) | all_58_0 = 0
% 11.32/2.32 |
% 11.32/2.32 | GROUND_INST: instantiating (1) with all_45_0, all_58_3, all_45_2, simplifying
% 11.32/2.32 | with (9), (16) gives:
% 11.32/2.32 | (21) all_58_3 = all_45_0
% 11.32/2.32 |
% 11.32/2.32 | GROUND_INST: instantiating (2) with all_45_1, all_58_0, all_45_2, simplifying
% 11.32/2.32 | with (10), (17) gives:
% 11.32/2.32 | (22) all_58_0 = all_45_1
% 11.32/2.32 |
% 11.32/2.32 | REDUCE: (19), (21) imply:
% 11.32/2.32 | (23) ok(all_45_0) = all_58_1
% 11.32/2.32 |
% 11.32/2.32 | REDUCE: (18), (21) imply:
% 11.32/2.32 | (24) check_cpq(all_45_0) = all_58_2
% 11.32/2.32 |
% 11.32/2.32 | GROUND_INST: instantiating (2) with 0, all_58_2, all_45_0, simplifying with
% 11.32/2.32 | (11), (24) gives:
% 11.32/2.32 | (25) all_58_2 = 0
% 11.32/2.32 |
% 11.32/2.32 | GROUND_INST: instantiating (3) with 0, all_58_1, all_45_0, simplifying with
% 11.32/2.32 | (13), (23) gives:
% 11.32/2.32 | (26) all_58_1 = 0
% 11.32/2.32 |
% 11.32/2.32 | BETA: splitting (20) gives:
% 11.32/2.32 |
% 11.32/2.32 | Case 1:
% 11.32/2.32 | |
% 11.32/2.32 | | (27) ~ (all_58_1 = 0)
% 11.32/2.32 | |
% 11.32/2.32 | | REDUCE: (26), (27) imply:
% 11.32/2.32 | | (28) $false
% 11.32/2.32 | |
% 11.32/2.32 | | CLOSE: (28) is inconsistent.
% 11.32/2.32 | |
% 11.32/2.32 | Case 2:
% 11.32/2.32 | |
% 11.32/2.32 | | (29) ~ (all_58_2 = 0) | all_58_0 = 0
% 11.32/2.32 | |
% 11.32/2.32 | | BETA: splitting (29) gives:
% 11.32/2.32 | |
% 11.32/2.32 | | Case 1:
% 11.32/2.32 | | |
% 11.32/2.32 | | | (30) ~ (all_58_2 = 0)
% 11.32/2.32 | | |
% 11.32/2.32 | | | REDUCE: (25), (30) imply:
% 11.32/2.32 | | | (31) $false
% 11.32/2.32 | | |
% 11.32/2.32 | | | CLOSE: (31) is inconsistent.
% 11.32/2.32 | | |
% 11.32/2.32 | | Case 2:
% 11.32/2.32 | | |
% 11.32/2.32 | | | (32) all_58_0 = 0
% 11.32/2.32 | | |
% 11.32/2.32 | | | COMBINE_EQS: (22), (32) imply:
% 11.32/2.32 | | | (33) all_45_1 = 0
% 11.32/2.32 | | |
% 11.32/2.32 | | | REDUCE: (5), (33) imply:
% 11.32/2.32 | | | (34) $false
% 11.32/2.32 | | |
% 11.32/2.32 | | | CLOSE: (34) is inconsistent.
% 11.32/2.32 | | |
% 11.32/2.32 | | End of split
% 11.32/2.32 | |
% 11.32/2.32 | End of split
% 11.32/2.32 |
% 11.32/2.32 End of proof
% 11.32/2.32 % SZS output end Proof for theBenchmark
% 11.32/2.32
% 11.32/2.32 1748ms
%------------------------------------------------------------------------------