TSTP Solution File: SET956+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SET956+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n011.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 15:27:11 EDT 2023
% Result : Theorem 5.14s 1.45s
% Output : Proof 6.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET956+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35 % Computer : n011.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 : Sat Aug 26 14:50:09 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.62 ________ _____
% 0.21/0.62 ___ __ \_________(_)________________________________
% 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.62
% 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.62 (2023-06-19)
% 0.21/0.62
% 0.21/0.62 (c) Philipp Rümmer, 2009-2023
% 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.62 Amanda Stjerna.
% 0.21/0.62 Free software under BSD-3-Clause.
% 0.21/0.62
% 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.62
% 0.21/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.63 Running up to 7 provers in parallel.
% 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.92/1.00 Prover 1: Preprocessing ...
% 1.92/1.00 Prover 4: Preprocessing ...
% 2.56/1.04 Prover 0: Preprocessing ...
% 2.56/1.04 Prover 3: Preprocessing ...
% 2.56/1.04 Prover 5: Preprocessing ...
% 2.56/1.04 Prover 2: Preprocessing ...
% 2.56/1.04 Prover 6: Preprocessing ...
% 4.11/1.28 Prover 1: Warning: ignoring some quantifiers
% 4.11/1.28 Prover 3: Warning: ignoring some quantifiers
% 4.11/1.29 Prover 6: Proving ...
% 4.11/1.29 Prover 2: Proving ...
% 4.11/1.30 Prover 1: Constructing countermodel ...
% 4.11/1.30 Prover 5: Proving ...
% 4.11/1.30 Prover 3: Constructing countermodel ...
% 4.11/1.31 Prover 0: Proving ...
% 4.47/1.31 Prover 4: Constructing countermodel ...
% 5.14/1.45 Prover 3: proved (797ms)
% 5.14/1.45
% 5.14/1.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.14/1.45
% 5.14/1.45 Prover 0: stopped
% 5.14/1.45 Prover 2: stopped
% 5.14/1.46 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.14/1.46 Prover 5: stopped
% 5.14/1.46 Prover 6: stopped
% 5.14/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.14/1.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.14/1.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.14/1.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.79/1.49 Prover 7: Preprocessing ...
% 5.79/1.49 Prover 11: Preprocessing ...
% 5.79/1.49 Prover 10: Preprocessing ...
% 5.79/1.50 Prover 8: Preprocessing ...
% 5.79/1.50 Prover 13: Preprocessing ...
% 5.79/1.52 Prover 7: Warning: ignoring some quantifiers
% 5.79/1.53 Prover 7: Constructing countermodel ...
% 5.79/1.54 Prover 1: Found proof (size 17)
% 5.79/1.54 Prover 4: Found proof (size 24)
% 5.79/1.54 Prover 4: proved (893ms)
% 5.79/1.54 Prover 1: proved (898ms)
% 5.79/1.54 Prover 7: stopped
% 5.79/1.55 Prover 10: Warning: ignoring some quantifiers
% 5.79/1.55 Prover 13: Warning: ignoring some quantifiers
% 5.79/1.55 Prover 10: Constructing countermodel ...
% 5.79/1.55 Prover 13: Constructing countermodel ...
% 5.79/1.56 Prover 13: stopped
% 5.79/1.56 Prover 10: stopped
% 5.79/1.56 Prover 8: Warning: ignoring some quantifiers
% 5.79/1.56 Prover 11: Constructing countermodel ...
% 5.79/1.57 Prover 8: Constructing countermodel ...
% 5.79/1.57 Prover 11: stopped
% 5.79/1.57 Prover 8: stopped
% 5.79/1.57
% 5.79/1.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.79/1.57
% 5.79/1.58 % SZS output start Proof for theBenchmark
% 5.79/1.58 Assumptions after simplification:
% 5.79/1.58 ---------------------------------
% 5.79/1.58
% 5.79/1.58 (d3_tarski)
% 6.60/1.61 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 6.60/1.61 (subset(v0, v1) = 0) | ~ (in(v2, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~
% 6.60/1.61 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & in(v2, v0) = v4)) & ! [v0: $i] : !
% 6.60/1.61 [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ~ $i(v1) | ~
% 6.60/1.61 $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & in(v3, v1) = v4 &
% 6.60/1.61 in(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~
% 6.60/1.61 (subset(v0, v1) = 0) | ~ (in(v2, v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~
% 6.60/1.61 $i(v0) | in(v2, v1) = 0)
% 6.60/1.61
% 6.60/1.61 (t103_zfmisc_1)
% 6.60/1.62 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 6.60/1.62 (cartesian_product2(v1, v2) = v4) | ~ (subset(v0, v4) = 0) | ~ (in(v3, v0)
% 6.60/1.62 = 0) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: $i] : ?
% 6.60/1.62 [v6: $i] : (ordered_pair(v5, v6) = v3 & in(v6, v2) = 0 & in(v5, v1) = 0 &
% 6.60/1.62 $i(v6) & $i(v5)))
% 6.60/1.62
% 6.60/1.62 (t109_zfmisc_1)
% 6.60/1.62 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 6.60/1.62 int] : ( ~ (v5 = 0) & cartesian_product2(v1, v2) = v4 & subset(v0, v4) = 0 &
% 6.60/1.62 subset(v0, v3) = v5 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ! [v6:
% 6.60/1.62 $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (ordered_pair(v6, v7) = v8) | ~
% 6.60/1.62 $i(v7) | ~ $i(v6) | ? [v9: any] : ? [v10: any] : (in(v8, v3) = v10 &
% 6.60/1.62 in(v8, v0) = v9 & ( ~ (v9 = 0) | v10 = 0))))
% 6.60/1.62
% 6.60/1.62 (function-axioms)
% 6.60/1.63 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 6.60/1.63 (cartesian_product2(v3, v2) = v1) | ~ (cartesian_product2(v3, v2) = v0)) &
% 6.60/1.63 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 6.60/1.63 (ordered_pair(v3, v2) = v1) | ~ (ordered_pair(v3, v2) = v0)) & ! [v0:
% 6.60/1.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 6.60/1.63 : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0:
% 6.60/1.63 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 6.60/1.63 (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0:
% 6.60/1.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 6.60/1.63 : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0:
% 6.60/1.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 6.60/1.63 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 6.60/1.63 [v2: $i] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0))
% 6.60/1.63
% 6.60/1.63 Further assumptions not needed in the proof:
% 6.60/1.63 --------------------------------------------
% 6.60/1.63 antisymmetry_r2_hidden, commutativity_k2_tarski, d5_tarski, fc1_zfmisc_1,
% 6.60/1.63 rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski
% 6.60/1.63
% 6.60/1.63 Those formulas are unsatisfiable:
% 6.60/1.63 ---------------------------------
% 6.60/1.63
% 6.60/1.63 Begin of proof
% 6.60/1.63 |
% 6.60/1.63 | ALPHA: (d3_tarski) implies:
% 6.60/1.63 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1)
% 6.60/1.63 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~
% 6.60/1.63 | (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0 & $i(v3)))
% 6.60/1.63 |
% 6.60/1.64 | ALPHA: (function-axioms) implies:
% 6.60/1.64 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 6.60/1.64 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0))
% 6.60/1.64 |
% 6.60/1.64 | DELTA: instantiating (t109_zfmisc_1) with fresh symbols all_14_0, all_14_1,
% 6.60/1.64 | all_14_2, all_14_3, all_14_4, all_14_5 gives:
% 6.60/1.64 | (3) ~ (all_14_0 = 0) & cartesian_product2(all_14_4, all_14_3) = all_14_1 &
% 6.60/1.64 | subset(all_14_5, all_14_1) = 0 & subset(all_14_5, all_14_2) = all_14_0
% 6.60/1.64 | & $i(all_14_1) & $i(all_14_2) & $i(all_14_3) & $i(all_14_4) &
% 6.60/1.64 | $i(all_14_5) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~
% 6.60/1.64 | (ordered_pair(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] :
% 6.60/1.64 | ? [v4: any] : (in(v2, all_14_2) = v4 & in(v2, all_14_5) = v3 & ( ~
% 6.60/1.64 | (v3 = 0) | v4 = 0)))
% 6.60/1.64 |
% 6.60/1.64 | ALPHA: (3) implies:
% 6.60/1.64 | (4) ~ (all_14_0 = 0)
% 6.60/1.64 | (5) $i(all_14_5)
% 6.60/1.64 | (6) $i(all_14_4)
% 6.60/1.64 | (7) $i(all_14_3)
% 6.60/1.64 | (8) $i(all_14_2)
% 6.60/1.64 | (9) subset(all_14_5, all_14_2) = all_14_0
% 6.60/1.64 | (10) subset(all_14_5, all_14_1) = 0
% 6.60/1.64 | (11) cartesian_product2(all_14_4, all_14_3) = all_14_1
% 6.60/1.64 | (12) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (ordered_pair(v0, v1) =
% 6.60/1.64 | v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] :
% 6.60/1.64 | (in(v2, all_14_2) = v4 & in(v2, all_14_5) = v3 & ( ~ (v3 = 0) | v4 =
% 6.60/1.64 | 0)))
% 6.60/1.64 |
% 6.60/1.65 | GROUND_INST: instantiating (1) with all_14_5, all_14_2, all_14_0, simplifying
% 6.60/1.65 | with (5), (8), (9) gives:
% 6.60/1.65 | (13) all_14_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0,
% 6.60/1.65 | all_14_2) = v1 & in(v0, all_14_5) = 0 & $i(v0))
% 6.60/1.65 |
% 6.60/1.65 | BETA: splitting (13) gives:
% 6.60/1.65 |
% 6.60/1.65 | Case 1:
% 6.60/1.65 | |
% 6.60/1.65 | | (14) all_14_0 = 0
% 6.60/1.65 | |
% 6.60/1.65 | | REDUCE: (4), (14) imply:
% 6.60/1.65 | | (15) $false
% 6.60/1.65 | |
% 6.60/1.65 | | CLOSE: (15) is inconsistent.
% 6.60/1.65 | |
% 6.60/1.65 | Case 2:
% 6.60/1.65 | |
% 6.60/1.65 | | (16) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0, all_14_2) = v1 &
% 6.60/1.65 | | in(v0, all_14_5) = 0 & $i(v0))
% 6.60/1.65 | |
% 6.60/1.65 | | DELTA: instantiating (16) with fresh symbols all_24_0, all_24_1 gives:
% 6.60/1.65 | | (17) ~ (all_24_0 = 0) & in(all_24_1, all_14_2) = all_24_0 & in(all_24_1,
% 6.60/1.65 | | all_14_5) = 0 & $i(all_24_1)
% 6.60/1.65 | |
% 6.60/1.65 | | ALPHA: (17) implies:
% 6.60/1.65 | | (18) ~ (all_24_0 = 0)
% 6.60/1.65 | | (19) $i(all_24_1)
% 6.60/1.65 | | (20) in(all_24_1, all_14_5) = 0
% 6.60/1.65 | | (21) in(all_24_1, all_14_2) = all_24_0
% 6.60/1.65 | |
% 6.60/1.65 | | GROUND_INST: instantiating (t103_zfmisc_1) with all_14_5, all_14_4,
% 6.60/1.65 | | all_14_3, all_24_1, all_14_1, simplifying with (5), (6), (7),
% 6.60/1.65 | | (10), (11), (19), (20) gives:
% 6.60/1.65 | | (22) ? [v0: $i] : ? [v1: $i] : (ordered_pair(v0, v1) = all_24_1 &
% 6.60/1.65 | | in(v1, all_14_3) = 0 & in(v0, all_14_4) = 0 & $i(v1) & $i(v0))
% 6.60/1.65 | |
% 6.60/1.65 | | DELTA: instantiating (22) with fresh symbols all_34_0, all_34_1 gives:
% 6.60/1.65 | | (23) ordered_pair(all_34_1, all_34_0) = all_24_1 & in(all_34_0, all_14_3)
% 6.60/1.65 | | = 0 & in(all_34_1, all_14_4) = 0 & $i(all_34_0) & $i(all_34_1)
% 6.60/1.65 | |
% 6.60/1.65 | | ALPHA: (23) implies:
% 6.60/1.65 | | (24) $i(all_34_1)
% 6.60/1.65 | | (25) $i(all_34_0)
% 6.60/1.65 | | (26) ordered_pair(all_34_1, all_34_0) = all_24_1
% 6.60/1.65 | |
% 6.60/1.65 | | GROUND_INST: instantiating (12) with all_34_1, all_34_0, all_24_1,
% 6.60/1.65 | | simplifying with (24), (25), (26) gives:
% 6.60/1.66 | | (27) ? [v0: any] : ? [v1: any] : (in(all_24_1, all_14_2) = v1 &
% 6.60/1.66 | | in(all_24_1, all_14_5) = v0 & ( ~ (v0 = 0) | v1 = 0))
% 6.60/1.66 | |
% 6.60/1.66 | | DELTA: instantiating (27) with fresh symbols all_49_0, all_49_1 gives:
% 6.60/1.66 | | (28) in(all_24_1, all_14_2) = all_49_0 & in(all_24_1, all_14_5) =
% 6.60/1.66 | | all_49_1 & ( ~ (all_49_1 = 0) | all_49_0 = 0)
% 6.60/1.66 | |
% 6.60/1.66 | | ALPHA: (28) implies:
% 6.60/1.66 | | (29) in(all_24_1, all_14_5) = all_49_1
% 6.60/1.66 | | (30) in(all_24_1, all_14_2) = all_49_0
% 6.60/1.66 | | (31) ~ (all_49_1 = 0) | all_49_0 = 0
% 6.60/1.66 | |
% 6.60/1.66 | | GROUND_INST: instantiating (2) with 0, all_49_1, all_14_5, all_24_1,
% 6.60/1.66 | | simplifying with (20), (29) gives:
% 6.60/1.66 | | (32) all_49_1 = 0
% 6.60/1.66 | |
% 6.60/1.66 | | GROUND_INST: instantiating (2) with all_24_0, all_49_0, all_14_2, all_24_1,
% 6.60/1.66 | | simplifying with (21), (30) gives:
% 6.60/1.66 | | (33) all_49_0 = all_24_0
% 6.60/1.66 | |
% 6.60/1.66 | | BETA: splitting (31) gives:
% 6.60/1.66 | |
% 6.60/1.66 | | Case 1:
% 6.60/1.66 | | |
% 6.60/1.66 | | | (34) ~ (all_49_1 = 0)
% 6.60/1.66 | | |
% 6.60/1.66 | | | REDUCE: (32), (34) imply:
% 6.60/1.66 | | | (35) $false
% 6.60/1.66 | | |
% 6.60/1.66 | | | CLOSE: (35) is inconsistent.
% 6.60/1.66 | | |
% 6.60/1.66 | | Case 2:
% 6.60/1.66 | | |
% 6.60/1.66 | | | (36) all_49_0 = 0
% 6.60/1.66 | | |
% 6.60/1.66 | | | COMBINE_EQS: (33), (36) imply:
% 6.60/1.66 | | | (37) all_24_0 = 0
% 6.60/1.66 | | |
% 6.60/1.66 | | | REDUCE: (18), (37) imply:
% 6.60/1.66 | | | (38) $false
% 6.60/1.66 | | |
% 6.60/1.66 | | | CLOSE: (38) is inconsistent.
% 6.60/1.66 | | |
% 6.60/1.66 | | End of split
% 6.60/1.66 | |
% 6.60/1.66 | End of split
% 6.60/1.66 |
% 6.60/1.66 End of proof
% 6.60/1.66 % SZS output end Proof for theBenchmark
% 6.60/1.66
% 6.60/1.66 1038ms
%------------------------------------------------------------------------------