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