TSTP Solution File: CSR147+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : CSR147+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n018.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 21:38:21 EDT 2023
% Result : Theorem 4.67s 1.40s
% Output : Proof 6.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR147+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n018.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 08:51:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.61 ________ _____
% 0.19/0.61 ___ __ \_________(_)________________________________
% 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.61
% 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.61 (2023-06-19)
% 0.19/0.61
% 0.19/0.61 (c) Philipp Rümmer, 2009-2023
% 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.61 Amanda Stjerna.
% 0.19/0.61 Free software under BSD-3-Clause.
% 0.19/0.61
% 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.61
% 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.62 Running up to 7 provers in parallel.
% 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.23/1.02 Prover 4: Preprocessing ...
% 2.23/1.02 Prover 1: Preprocessing ...
% 2.23/1.06 Prover 3: Preprocessing ...
% 2.23/1.06 Prover 2: Preprocessing ...
% 2.23/1.06 Prover 6: Preprocessing ...
% 2.23/1.06 Prover 5: Preprocessing ...
% 2.23/1.06 Prover 0: Preprocessing ...
% 3.70/1.28 Prover 5: Constructing countermodel ...
% 3.70/1.28 Prover 6: Constructing countermodel ...
% 3.70/1.29 Prover 2: Proving ...
% 3.70/1.30 Prover 1: Constructing countermodel ...
% 3.70/1.30 Prover 3: Constructing countermodel ...
% 4.20/1.34 Prover 4: Constructing countermodel ...
% 4.67/1.40 Prover 6: proved (755ms)
% 4.67/1.40
% 4.67/1.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.67/1.40
% 4.67/1.40 Prover 5: stopped
% 4.67/1.41 Prover 2: stopped
% 4.67/1.41 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.67/1.41 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.67/1.41 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.67/1.42 Prover 3: stopped
% 4.67/1.42 Prover 0: Proving ...
% 4.67/1.42 Prover 0: stopped
% 4.67/1.42 Prover 10: Preprocessing ...
% 4.67/1.42 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.67/1.43 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.67/1.43 Prover 8: Preprocessing ...
% 4.67/1.43 Prover 7: Preprocessing ...
% 4.67/1.44 Prover 13: Preprocessing ...
% 4.67/1.45 Prover 11: Preprocessing ...
% 4.67/1.48 Prover 10: Constructing countermodel ...
% 4.67/1.49 Prover 7: Constructing countermodel ...
% 4.67/1.50 Prover 1: Found proof (size 34)
% 4.67/1.50 Prover 1: proved (870ms)
% 4.67/1.50 Prover 10: stopped
% 4.67/1.50 Prover 4: stopped
% 4.67/1.50 Prover 7: stopped
% 4.67/1.51 Prover 11: stopped
% 4.67/1.51 Prover 13: Constructing countermodel ...
% 4.67/1.51 Prover 13: stopped
% 4.67/1.53 Prover 8: Warning: ignoring some quantifiers
% 4.67/1.53 Prover 8: Constructing countermodel ...
% 4.67/1.54 Prover 8: stopped
% 4.67/1.54
% 4.67/1.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.67/1.54
% 4.67/1.55 % SZS output start Proof for theBenchmark
% 4.67/1.55 Assumptions after simplification:
% 4.67/1.55 ---------------------------------
% 4.67/1.55
% 4.67/1.55 (experience)
% 4.67/1.58 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0
% 4.67/1.58 | ~ (greater(v1, v2) = 0) | ~ (s__more_experienced(v0, v3) = v4) | ~
% 4.67/1.58 (s__siblingFn(v0) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] :
% 4.67/1.58 ? [v6: any] : ? [v7: any] : ? [v8: any] : (s__age(v3, v2) = v7 &
% 4.67/1.58 s__age(v0, v1) = v6 & s__has_seen_more(v3, v0) = v8 & s__Human(v0) = v5 &
% 4.67/1.58 ( ~ (v7 = 0) | ~ (v6 = 0) | ~ (v5 = 0) | v8 = 0)))
% 4.67/1.58
% 4.67/1.58 (geoff_48)
% 5.89/1.59 s__age(geoff, n48) = 0 & $i(n48) & $i(geoff)
% 5.89/1.59
% 5.89/1.59 (geoff_and_jim)
% 5.89/1.59 s__siblingFn(jim) = geoff & $i(jim) & $i(geoff)
% 5.89/1.59
% 5.89/1.59 (greater_54_48)
% 5.89/1.59 greater(n54, n48) = 0 & $i(n54) & $i(n48)
% 5.89/1.59
% 5.89/1.59 (jim_54)
% 5.89/1.59 s__age(jim, n54) = 0 & $i(n54) & $i(jim)
% 5.89/1.59
% 5.89/1.59 (jim_has_seen_more)
% 5.89/1.59 $i(jim) & $i(geoff) & ? [v0: int] : ( ~ (v0 = 0) & s__has_seen_more(geoff,
% 5.89/1.59 jim) = v0)
% 5.89/1.59
% 5.89/1.59 (jim_human)
% 5.89/1.59 s__Human(jim) = 0 & $i(jim)
% 5.89/1.59
% 5.89/1.59 (jim_is_experienced)
% 5.89/1.59 $i(jim) & $i(geoff) & ? [v0: int] : ( ~ (v0 = 0) & s__more_experienced(jim,
% 5.89/1.59 geoff) = v0)
% 5.89/1.59
% 5.89/1.59 (function-axioms)
% 5.89/1.60 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 5.89/1.60 [v3: $i] : (v1 = v0 | ~ (greater(v3, v2) = v1) | ~ (greater(v3, v2) = v0)) &
% 5.89/1.60 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 5.89/1.60 [v3: $i] : (v1 = v0 | ~ (s__more_experienced(v3, v2) = v1) | ~
% 5.89/1.60 (s__more_experienced(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 5.89/1.60 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (s__age(v3,
% 5.89/1.60 v2) = v1) | ~ (s__age(v3, v2) = v0)) & ! [v0: MultipleValueBool] : !
% 5.89/1.60 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 5.89/1.60 (s__has_seen_more(v3, v2) = v1) | ~ (s__has_seen_more(v3, v2) = v0)) & !
% 5.89/1.60 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (s__siblingFn(v2) = v1) |
% 5.89/1.60 ~ (s__siblingFn(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 5.89/1.60 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (s__LivingThing(v2) = v1) |
% 5.89/1.60 ~ (s__LivingThing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 5.89/1.60 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (s__Human(v2) = v1) | ~
% 5.89/1.60 (s__Human(v2) = v0))
% 5.89/1.60
% 5.89/1.60 Further assumptions not needed in the proof:
% 5.89/1.60 --------------------------------------------
% 5.89/1.60 geoff_human, human_type, humans_are_living, living_type, sibling_symmetry,
% 5.89/1.60 sibling_type
% 5.89/1.60
% 5.89/1.60 Those formulas are unsatisfiable:
% 5.89/1.60 ---------------------------------
% 5.89/1.60
% 5.89/1.60 Begin of proof
% 5.89/1.60 |
% 5.89/1.60 | ALPHA: (jim_human) implies:
% 5.89/1.60 | (1) s__Human(jim) = 0
% 5.89/1.60 |
% 5.89/1.60 | ALPHA: (geoff_48) implies:
% 5.89/1.60 | (2) s__age(geoff, n48) = 0
% 5.89/1.60 |
% 5.89/1.60 | ALPHA: (jim_54) implies:
% 5.89/1.60 | (3) s__age(jim, n54) = 0
% 5.89/1.60 |
% 5.89/1.60 | ALPHA: (greater_54_48) implies:
% 5.89/1.60 | (4) $i(n48)
% 5.89/1.60 | (5) $i(n54)
% 5.89/1.60 | (6) greater(n54, n48) = 0
% 5.89/1.60 |
% 5.89/1.60 | ALPHA: (geoff_and_jim) implies:
% 5.89/1.60 | (7) s__siblingFn(jim) = geoff
% 5.89/1.60 |
% 5.89/1.60 | ALPHA: (jim_has_seen_more) implies:
% 5.89/1.60 | (8) ? [v0: int] : ( ~ (v0 = 0) & s__has_seen_more(geoff, jim) = v0)
% 5.89/1.60 |
% 5.89/1.60 | ALPHA: (jim_is_experienced) implies:
% 5.89/1.60 | (9) $i(jim)
% 5.89/1.61 | (10) ? [v0: int] : ( ~ (v0 = 0) & s__more_experienced(jim, geoff) = v0)
% 5.89/1.61 |
% 5.89/1.61 | ALPHA: (function-axioms) implies:
% 5.89/1.61 | (11) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 5.89/1.61 | : (v1 = v0 | ~ (s__Human(v2) = v1) | ~ (s__Human(v2) = v0))
% 5.89/1.61 | (12) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 5.89/1.61 | : ! [v3: $i] : (v1 = v0 | ~ (s__has_seen_more(v3, v2) = v1) | ~
% 5.89/1.61 | (s__has_seen_more(v3, v2) = v0))
% 6.12/1.61 | (13) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 6.12/1.61 | : ! [v3: $i] : (v1 = v0 | ~ (s__age(v3, v2) = v1) | ~ (s__age(v3,
% 6.12/1.61 | v2) = v0))
% 6.12/1.61 |
% 6.12/1.61 | DELTA: instantiating (10) with fresh symbol all_8_0 gives:
% 6.12/1.61 | (14) ~ (all_8_0 = 0) & s__more_experienced(jim, geoff) = all_8_0
% 6.12/1.61 |
% 6.12/1.61 | ALPHA: (14) implies:
% 6.12/1.61 | (15) ~ (all_8_0 = 0)
% 6.12/1.61 | (16) s__more_experienced(jim, geoff) = all_8_0
% 6.12/1.61 |
% 6.12/1.61 | DELTA: instantiating (8) with fresh symbol all_14_0 gives:
% 6.12/1.61 | (17) ~ (all_14_0 = 0) & s__has_seen_more(geoff, jim) = all_14_0
% 6.12/1.61 |
% 6.12/1.61 | ALPHA: (17) implies:
% 6.12/1.61 | (18) ~ (all_14_0 = 0)
% 6.12/1.61 | (19) s__has_seen_more(geoff, jim) = all_14_0
% 6.12/1.61 |
% 6.12/1.61 | GROUND_INST: instantiating (experience) with jim, n54, n48, geoff, all_8_0,
% 6.12/1.61 | simplifying with (4), (5), (6), (7), (9), (16) gives:
% 6.12/1.62 | (20) all_8_0 = 0 | ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3:
% 6.12/1.62 | any] : (s__age(jim, n54) = v1 & s__age(geoff, n48) = v2 &
% 6.12/1.62 | s__has_seen_more(geoff, jim) = v3 & s__Human(jim) = v0 & ( ~ (v2 =
% 6.12/1.62 | 0) | ~ (v1 = 0) | ~ (v0 = 0) | v3 = 0))
% 6.12/1.62 |
% 6.12/1.62 | BETA: splitting (20) gives:
% 6.12/1.62 |
% 6.12/1.62 | Case 1:
% 6.12/1.62 | |
% 6.12/1.62 | | (21) all_8_0 = 0
% 6.12/1.62 | |
% 6.12/1.62 | | REDUCE: (15), (21) imply:
% 6.12/1.62 | | (22) $false
% 6.12/1.62 | |
% 6.12/1.62 | | CLOSE: (22) is inconsistent.
% 6.12/1.62 | |
% 6.12/1.62 | Case 2:
% 6.12/1.62 | |
% 6.12/1.62 | | (23) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] :
% 6.12/1.62 | | (s__age(jim, n54) = v1 & s__age(geoff, n48) = v2 &
% 6.12/1.62 | | s__has_seen_more(geoff, jim) = v3 & s__Human(jim) = v0 & ( ~ (v2 =
% 6.12/1.62 | | 0) | ~ (v1 = 0) | ~ (v0 = 0) | v3 = 0))
% 6.12/1.62 | |
% 6.12/1.62 | | DELTA: instantiating (23) with fresh symbols all_23_0, all_23_1, all_23_2,
% 6.12/1.62 | | all_23_3 gives:
% 6.12/1.62 | | (24) s__age(jim, n54) = all_23_2 & s__age(geoff, n48) = all_23_1 &
% 6.12/1.62 | | s__has_seen_more(geoff, jim) = all_23_0 & s__Human(jim) = all_23_3 &
% 6.12/1.62 | | ( ~ (all_23_1 = 0) | ~ (all_23_2 = 0) | ~ (all_23_3 = 0) |
% 6.12/1.62 | | all_23_0 = 0)
% 6.12/1.62 | |
% 6.12/1.62 | | ALPHA: (24) implies:
% 6.12/1.62 | | (25) s__Human(jim) = all_23_3
% 6.12/1.62 | | (26) s__has_seen_more(geoff, jim) = all_23_0
% 6.12/1.62 | | (27) s__age(geoff, n48) = all_23_1
% 6.12/1.62 | | (28) s__age(jim, n54) = all_23_2
% 6.12/1.62 | | (29) ~ (all_23_1 = 0) | ~ (all_23_2 = 0) | ~ (all_23_3 = 0) | all_23_0
% 6.12/1.62 | | = 0
% 6.12/1.62 | |
% 6.12/1.62 | | GROUND_INST: instantiating (11) with 0, all_23_3, jim, simplifying with (1),
% 6.12/1.62 | | (25) gives:
% 6.12/1.62 | | (30) all_23_3 = 0
% 6.12/1.62 | |
% 6.12/1.62 | | GROUND_INST: instantiating (12) with all_14_0, all_23_0, jim, geoff,
% 6.12/1.62 | | simplifying with (19), (26) gives:
% 6.12/1.62 | | (31) all_23_0 = all_14_0
% 6.12/1.62 | |
% 6.12/1.62 | | GROUND_INST: instantiating (13) with 0, all_23_1, n48, geoff, simplifying
% 6.12/1.62 | | with (2), (27) gives:
% 6.12/1.62 | | (32) all_23_1 = 0
% 6.12/1.62 | |
% 6.12/1.62 | | GROUND_INST: instantiating (13) with 0, all_23_2, n54, jim, simplifying with
% 6.12/1.62 | | (3), (28) gives:
% 6.12/1.62 | | (33) all_23_2 = 0
% 6.12/1.62 | |
% 6.12/1.62 | | BETA: splitting (29) gives:
% 6.12/1.62 | |
% 6.12/1.62 | | Case 1:
% 6.12/1.62 | | |
% 6.12/1.62 | | | (34) ~ (all_23_1 = 0)
% 6.12/1.62 | | |
% 6.12/1.62 | | | REDUCE: (32), (34) imply:
% 6.12/1.62 | | | (35) $false
% 6.12/1.62 | | |
% 6.12/1.62 | | | CLOSE: (35) is inconsistent.
% 6.12/1.63 | | |
% 6.12/1.63 | | Case 2:
% 6.12/1.63 | | |
% 6.12/1.63 | | | (36) ~ (all_23_2 = 0) | ~ (all_23_3 = 0) | all_23_0 = 0
% 6.12/1.63 | | |
% 6.12/1.63 | | | BETA: splitting (36) gives:
% 6.12/1.63 | | |
% 6.12/1.63 | | | Case 1:
% 6.12/1.63 | | | |
% 6.12/1.63 | | | | (37) ~ (all_23_2 = 0)
% 6.12/1.63 | | | |
% 6.12/1.63 | | | | REDUCE: (33), (37) imply:
% 6.12/1.63 | | | | (38) $false
% 6.12/1.63 | | | |
% 6.12/1.63 | | | | CLOSE: (38) is inconsistent.
% 6.12/1.63 | | | |
% 6.12/1.63 | | | Case 2:
% 6.12/1.63 | | | |
% 6.12/1.63 | | | | (39) ~ (all_23_3 = 0) | all_23_0 = 0
% 6.12/1.63 | | | |
% 6.12/1.63 | | | | BETA: splitting (39) gives:
% 6.12/1.63 | | | |
% 6.12/1.63 | | | | Case 1:
% 6.12/1.63 | | | | |
% 6.12/1.63 | | | | | (40) ~ (all_23_3 = 0)
% 6.12/1.63 | | | | |
% 6.12/1.63 | | | | | REDUCE: (30), (40) imply:
% 6.12/1.63 | | | | | (41) $false
% 6.12/1.63 | | | | |
% 6.12/1.63 | | | | | CLOSE: (41) is inconsistent.
% 6.12/1.63 | | | | |
% 6.12/1.63 | | | | Case 2:
% 6.12/1.63 | | | | |
% 6.12/1.63 | | | | | (42) all_23_0 = 0
% 6.12/1.63 | | | | |
% 6.12/1.63 | | | | | COMBINE_EQS: (31), (42) imply:
% 6.12/1.63 | | | | | (43) all_14_0 = 0
% 6.12/1.63 | | | | |
% 6.12/1.63 | | | | | REDUCE: (18), (43) imply:
% 6.12/1.63 | | | | | (44) $false
% 6.12/1.63 | | | | |
% 6.12/1.63 | | | | | CLOSE: (44) is inconsistent.
% 6.12/1.63 | | | | |
% 6.12/1.63 | | | | End of split
% 6.12/1.63 | | | |
% 6.12/1.63 | | | End of split
% 6.12/1.63 | | |
% 6.12/1.63 | | End of split
% 6.12/1.63 | |
% 6.12/1.63 | End of split
% 6.12/1.63 |
% 6.12/1.63 End of proof
% 6.12/1.63 % SZS output end Proof for theBenchmark
% 6.12/1.63
% 6.12/1.63 1017ms
%------------------------------------------------------------------------------