TSTP Solution File: KRS168+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS168+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n013.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:51:31 EDT 2023
% Result : Theorem 3.50s 1.20s
% Output : Proof 4.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS168+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 02:20:02 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 ________ _____
% 0.20/0.56 ___ __ \_________(_)________________________________
% 0.20/0.56 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.56 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.56 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.56
% 0.20/0.56 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.56 (2023-06-19)
% 0.20/0.56
% 0.20/0.56 (c) Philipp Rümmer, 2009-2023
% 0.20/0.56 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.56 Amanda Stjerna.
% 0.20/0.56 Free software under BSD-3-Clause.
% 0.20/0.56
% 0.20/0.56 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.56
% 0.20/0.56 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.57 Running up to 7 provers in parallel.
% 0.20/0.58 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.58 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.58 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.58 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.58 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.58 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.58 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.88/0.94 Prover 4: Preprocessing ...
% 1.88/0.95 Prover 1: Preprocessing ...
% 2.21/0.99 Prover 2: Preprocessing ...
% 2.21/0.99 Prover 6: Preprocessing ...
% 2.21/0.99 Prover 3: Preprocessing ...
% 2.21/0.99 Prover 0: Preprocessing ...
% 2.21/0.99 Prover 5: Preprocessing ...
% 2.86/1.07 Prover 5: Proving ...
% 2.86/1.07 Prover 2: Proving ...
% 2.86/1.08 Prover 1: Constructing countermodel ...
% 2.86/1.09 Prover 3: Constructing countermodel ...
% 3.18/1.10 Prover 6: Constructing countermodel ...
% 3.18/1.11 Prover 4: Constructing countermodel ...
% 3.18/1.11 Prover 0: Proving ...
% 3.50/1.20 Prover 3: proved (621ms)
% 3.50/1.20
% 3.50/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.50/1.20
% 3.50/1.21 Prover 6: stopped
% 3.50/1.21 Prover 5: stopped
% 3.50/1.21 Prover 2: stopped
% 3.50/1.21 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.50/1.21 Prover 0: stopped
% 3.50/1.22 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.50/1.22 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.50/1.22 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.50/1.22 Prover 8: Preprocessing ...
% 3.50/1.22 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.50/1.23 Prover 7: Preprocessing ...
% 3.50/1.24 Prover 13: Preprocessing ...
% 4.23/1.25 Prover 11: Preprocessing ...
% 4.23/1.25 Prover 10: Preprocessing ...
% 4.23/1.25 Prover 7: Warning: ignoring some quantifiers
% 4.23/1.25 Prover 7: Constructing countermodel ...
% 4.23/1.26 Prover 8: Warning: ignoring some quantifiers
% 4.23/1.26 Prover 8: Constructing countermodel ...
% 4.23/1.27 Prover 13: Warning: ignoring some quantifiers
% 4.23/1.27 Prover 13: Constructing countermodel ...
% 4.23/1.28 Prover 10: Warning: ignoring some quantifiers
% 4.23/1.28 Prover 10: Constructing countermodel ...
% 4.23/1.28 Prover 4: Found proof (size 39)
% 4.23/1.28 Prover 4: proved (704ms)
% 4.23/1.29 Prover 8: stopped
% 4.23/1.29 Prover 10: stopped
% 4.23/1.29 Prover 1: Found proof (size 39)
% 4.23/1.29 Prover 1: proved (706ms)
% 4.23/1.29 Prover 7: stopped
% 4.23/1.29 Prover 13: stopped
% 4.59/1.30 Prover 11: Constructing countermodel ...
% 4.59/1.31 Prover 11: stopped
% 4.59/1.31
% 4.59/1.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.59/1.31
% 4.59/1.31 % SZS output start Proof for theBenchmark
% 4.59/1.32 Assumptions after simplification:
% 4.59/1.32 ---------------------------------
% 4.59/1.32
% 4.59/1.32 (axiom_0)
% 4.59/1.35 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) &
% 4.59/1.35 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0))
% 4.59/1.35
% 4.59/1.35 (axiom_1)
% 4.78/1.35 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_integer(v0) = v1) | ~ $i(v0) |
% 4.78/1.35 xsd_string(v0) = 0) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~
% 4.78/1.35 (xsd_string(v0) = v1) | ~ $i(v0) | xsd_integer(v0) = 0) & ! [v0: $i] : ( ~
% 4.78/1.35 (xsd_integer(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) &
% 4.78/1.35 xsd_string(v0) = v1)) & ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0)
% 4.78/1.35 | ? [v1: int] : ( ~ (v1 = 0) & xsd_integer(v0) = v1))
% 4.78/1.35
% 4.78/1.35 (the_axiom)
% 4.78/1.35 ? [v0: $i] : ? [v1: $i] : ? [v2: any] : ? [v3: any] : ? [v4: $i] : ?
% 4.78/1.35 [v5: any] : ? [v6: any] : ($i(v4) & $i(v1) & $i(v0) & ((xsd_integer(v1) = v3
% 4.78/1.35 & xsd_string(v1) = v2 & ((v3 = 0 & v2 = 0) | ( ~ (v3 = 0) & ~ (v2 =
% 4.78/1.35 0)))) | (cowlNothing(v4) = v6 & cowlThing(v4) = v5 & ( ~ (v5 = 0)
% 4.78/1.35 | v6 = 0))))
% 4.78/1.35
% 4.78/1.36 (function-axioms)
% 4.78/1.36 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 =
% 4.78/1.36 v0 | ~ (cB(v2) = v1) | ~ (cB(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 4.78/1.36 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cA(v2) = v1) | ~
% 4.78/1.36 (cA(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] :
% 4.78/1.36 ! [v2: $i] : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0))
% 4.78/1.36 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1
% 4.78/1.36 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0:
% 4.78/1.36 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 4.78/1.36 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0:
% 4.78/1.36 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 4.78/1.36 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0))
% 4.78/1.36
% 4.78/1.36 Those formulas are unsatisfiable:
% 4.78/1.36 ---------------------------------
% 4.78/1.36
% 4.78/1.36 Begin of proof
% 4.78/1.36 |
% 4.78/1.36 | ALPHA: (axiom_0) implies:
% 4.78/1.36 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0))
% 4.78/1.36 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~
% 4.78/1.36 | $i(v0))
% 4.78/1.36 |
% 4.78/1.36 | ALPHA: (axiom_1) implies:
% 4.78/1.37 | (3) ! [v0: $i] : ( ~ (xsd_integer(v0) = 0) | ~ $i(v0) | ? [v1: int] : (
% 4.78/1.37 | ~ (v1 = 0) & xsd_string(v0) = v1))
% 4.78/1.37 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_integer(v0) = v1) | ~
% 4.78/1.37 | $i(v0) | xsd_string(v0) = 0)
% 4.78/1.37 |
% 4.78/1.37 | ALPHA: (function-axioms) implies:
% 4.78/1.37 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 4.78/1.37 | (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0))
% 4.78/1.37 |
% 4.78/1.37 | DELTA: instantiating (the_axiom) with fresh symbols all_5_0, all_5_1, all_5_2,
% 4.78/1.37 | all_5_3, all_5_4, all_5_5, all_5_6 gives:
% 4.78/1.37 | (6) $i(all_5_2) & $i(all_5_5) & $i(all_5_6) & ((xsd_integer(all_5_5) =
% 4.78/1.37 | all_5_3 & xsd_string(all_5_5) = all_5_4 & ((all_5_3 = 0 & all_5_4 =
% 4.78/1.37 | 0) | ( ~ (all_5_3 = 0) & ~ (all_5_4 = 0)))) |
% 4.78/1.37 | (cowlNothing(all_5_2) = all_5_0 & cowlThing(all_5_2) = all_5_1 & ( ~
% 4.78/1.37 | (all_5_1 = 0) | all_5_0 = 0)))
% 4.78/1.37 |
% 4.78/1.37 | ALPHA: (6) implies:
% 4.78/1.37 | (7) $i(all_5_5)
% 4.78/1.37 | (8) $i(all_5_2)
% 4.78/1.37 | (9) (xsd_integer(all_5_5) = all_5_3 & xsd_string(all_5_5) = all_5_4 &
% 4.78/1.37 | ((all_5_3 = 0 & all_5_4 = 0) | ( ~ (all_5_3 = 0) & ~ (all_5_4 =
% 4.78/1.37 | 0)))) | (cowlNothing(all_5_2) = all_5_0 & cowlThing(all_5_2) =
% 4.78/1.37 | all_5_1 & ( ~ (all_5_1 = 0) | all_5_0 = 0))
% 4.78/1.37 |
% 4.78/1.37 | BETA: splitting (9) gives:
% 4.78/1.37 |
% 4.78/1.37 | Case 1:
% 4.78/1.37 | |
% 4.78/1.37 | | (10) xsd_integer(all_5_5) = all_5_3 & xsd_string(all_5_5) = all_5_4 &
% 4.78/1.37 | | ((all_5_3 = 0 & all_5_4 = 0) | ( ~ (all_5_3 = 0) & ~ (all_5_4 =
% 4.78/1.37 | | 0)))
% 4.78/1.37 | |
% 4.78/1.37 | | ALPHA: (10) implies:
% 4.78/1.37 | | (11) xsd_string(all_5_5) = all_5_4
% 4.78/1.37 | | (12) xsd_integer(all_5_5) = all_5_3
% 4.78/1.37 | | (13) (all_5_3 = 0 & all_5_4 = 0) | ( ~ (all_5_3 = 0) & ~ (all_5_4 = 0))
% 4.78/1.38 | |
% 4.78/1.38 | | GROUND_INST: instantiating (4) with all_5_5, all_5_3, simplifying with (7),
% 4.78/1.38 | | (12) gives:
% 4.78/1.38 | | (14) all_5_3 = 0 | xsd_string(all_5_5) = 0
% 4.78/1.38 | |
% 4.78/1.38 | | BETA: splitting (14) gives:
% 4.78/1.38 | |
% 4.78/1.38 | | Case 1:
% 4.78/1.38 | | |
% 4.78/1.38 | | | (15) xsd_string(all_5_5) = 0
% 4.78/1.38 | | |
% 4.78/1.38 | | | GROUND_INST: instantiating (5) with all_5_4, 0, all_5_5, simplifying with
% 4.78/1.38 | | | (11), (15) gives:
% 4.78/1.38 | | | (16) all_5_4 = 0
% 4.78/1.38 | | |
% 4.78/1.38 | | | BETA: splitting (13) gives:
% 4.78/1.38 | | |
% 4.78/1.38 | | | Case 1:
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | (17) all_5_3 = 0 & all_5_4 = 0
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | ALPHA: (17) implies:
% 4.78/1.38 | | | | (18) all_5_3 = 0
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | REDUCE: (12), (18) imply:
% 4.78/1.38 | | | | (19) xsd_integer(all_5_5) = 0
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | GROUND_INST: instantiating (3) with all_5_5, simplifying with (7), (19)
% 4.78/1.38 | | | | gives:
% 4.78/1.38 | | | | (20) ? [v0: int] : ( ~ (v0 = 0) & xsd_string(all_5_5) = v0)
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | DELTA: instantiating (20) with fresh symbol all_34_0 gives:
% 4.78/1.38 | | | | (21) ~ (all_34_0 = 0) & xsd_string(all_5_5) = all_34_0
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | ALPHA: (21) implies:
% 4.78/1.38 | | | | (22) ~ (all_34_0 = 0)
% 4.78/1.38 | | | | (23) xsd_string(all_5_5) = all_34_0
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | GROUND_INST: instantiating (5) with 0, all_34_0, all_5_5, simplifying
% 4.78/1.38 | | | | with (15), (23) gives:
% 4.78/1.38 | | | | (24) all_34_0 = 0
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | REDUCE: (22), (24) imply:
% 4.78/1.38 | | | | (25) $false
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | CLOSE: (25) is inconsistent.
% 4.78/1.38 | | | |
% 4.78/1.38 | | | Case 2:
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | (26) ~ (all_5_3 = 0) & ~ (all_5_4 = 0)
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | ALPHA: (26) implies:
% 4.78/1.38 | | | | (27) ~ (all_5_4 = 0)
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | REDUCE: (16), (27) imply:
% 4.78/1.38 | | | | (28) $false
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | CLOSE: (28) is inconsistent.
% 4.78/1.38 | | | |
% 4.78/1.38 | | | End of split
% 4.78/1.38 | | |
% 4.78/1.38 | | Case 2:
% 4.78/1.38 | | |
% 4.78/1.38 | | | (29) all_5_3 = 0
% 4.78/1.38 | | | (30) ~ (xsd_string(all_5_5) = 0)
% 4.78/1.38 | | |
% 4.78/1.38 | | | BETA: splitting (13) gives:
% 4.78/1.38 | | |
% 4.78/1.38 | | | Case 1:
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | (31) all_5_3 = 0 & all_5_4 = 0
% 4.78/1.38 | | | |
% 4.78/1.38 | | | | ALPHA: (31) implies:
% 4.78/1.39 | | | | (32) all_5_4 = 0
% 4.78/1.39 | | | |
% 4.78/1.39 | | | | REDUCE: (11), (32) imply:
% 4.78/1.39 | | | | (33) xsd_string(all_5_5) = 0
% 4.78/1.39 | | | |
% 4.78/1.39 | | | | PRED_UNIFY: (30), (33) imply:
% 4.78/1.39 | | | | (34) $false
% 4.78/1.39 | | | |
% 4.78/1.39 | | | | CLOSE: (34) is inconsistent.
% 4.78/1.39 | | | |
% 4.78/1.39 | | | Case 2:
% 4.78/1.39 | | | |
% 4.78/1.39 | | | | (35) ~ (all_5_3 = 0) & ~ (all_5_4 = 0)
% 4.78/1.39 | | | |
% 4.78/1.39 | | | | ALPHA: (35) implies:
% 4.78/1.39 | | | | (36) ~ (all_5_3 = 0)
% 4.78/1.39 | | | |
% 4.78/1.39 | | | | REDUCE: (29), (36) imply:
% 4.78/1.39 | | | | (37) $false
% 4.78/1.39 | | | |
% 4.78/1.39 | | | | CLOSE: (37) is inconsistent.
% 4.78/1.39 | | | |
% 4.78/1.39 | | | End of split
% 4.78/1.39 | | |
% 4.78/1.39 | | End of split
% 4.78/1.39 | |
% 4.78/1.39 | Case 2:
% 4.78/1.39 | |
% 4.78/1.39 | | (38) cowlNothing(all_5_2) = all_5_0 & cowlThing(all_5_2) = all_5_1 & ( ~
% 4.78/1.39 | | (all_5_1 = 0) | all_5_0 = 0)
% 4.78/1.39 | |
% 4.78/1.39 | | ALPHA: (38) implies:
% 4.78/1.39 | | (39) cowlThing(all_5_2) = all_5_1
% 4.78/1.39 | | (40) cowlNothing(all_5_2) = all_5_0
% 4.78/1.39 | | (41) ~ (all_5_1 = 0) | all_5_0 = 0
% 4.78/1.39 | |
% 4.78/1.39 | | GROUND_INST: instantiating (2) with all_5_2, all_5_1, simplifying with (8),
% 4.78/1.39 | | (39) gives:
% 4.78/1.39 | | (42) all_5_1 = 0
% 4.78/1.39 | |
% 4.78/1.39 | | BETA: splitting (41) gives:
% 4.78/1.39 | |
% 4.78/1.39 | | Case 1:
% 4.78/1.39 | | |
% 4.78/1.39 | | | (43) ~ (all_5_1 = 0)
% 4.78/1.39 | | |
% 4.78/1.39 | | | REDUCE: (42), (43) imply:
% 4.78/1.39 | | | (44) $false
% 4.78/1.39 | | |
% 4.78/1.39 | | | CLOSE: (44) is inconsistent.
% 4.78/1.39 | | |
% 4.78/1.39 | | Case 2:
% 4.78/1.39 | | |
% 4.78/1.39 | | | (45) all_5_0 = 0
% 4.78/1.39 | | |
% 4.78/1.39 | | | REDUCE: (40), (45) imply:
% 4.78/1.39 | | | (46) cowlNothing(all_5_2) = 0
% 4.78/1.39 | | |
% 4.78/1.39 | | | GROUND_INST: instantiating (1) with all_5_2, simplifying with (8), (46)
% 4.78/1.39 | | | gives:
% 4.78/1.39 | | | (47) $false
% 4.78/1.39 | | |
% 4.78/1.39 | | | CLOSE: (47) is inconsistent.
% 4.78/1.39 | | |
% 4.78/1.39 | | End of split
% 4.78/1.39 | |
% 4.78/1.39 | End of split
% 4.78/1.39 |
% 4.78/1.39 End of proof
% 4.78/1.39 % SZS output end Proof for theBenchmark
% 4.78/1.39
% 4.78/1.39 829ms
%------------------------------------------------------------------------------