TSTP Solution File: SET912+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SET912+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 : n005.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:00 EDT 2023
% Result : Theorem 4.92s 1.41s
% Output : Proof 6.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 10:45:08 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.64 ________ _____
% 0.20/0.64 ___ __ \_________(_)________________________________
% 0.20/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.64
% 0.20/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.64 (2023-06-19)
% 0.20/0.64
% 0.20/0.64 (c) Philipp Rümmer, 2009-2023
% 0.20/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.64 Amanda Stjerna.
% 0.20/0.64 Free software under BSD-3-Clause.
% 0.20/0.64
% 0.20/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.64
% 0.20/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.65 Running up to 7 provers in parallel.
% 0.20/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 2.24/1.02 Prover 4: Preprocessing ...
% 2.24/1.02 Prover 1: Preprocessing ...
% 2.37/1.06 Prover 5: Preprocessing ...
% 2.37/1.06 Prover 2: Preprocessing ...
% 2.37/1.06 Prover 6: Preprocessing ...
% 2.37/1.06 Prover 3: Preprocessing ...
% 2.37/1.06 Prover 0: Preprocessing ...
% 3.51/1.23 Prover 1: Warning: ignoring some quantifiers
% 3.51/1.23 Prover 3: Warning: ignoring some quantifiers
% 3.51/1.24 Prover 3: Constructing countermodel ...
% 3.51/1.24 Prover 5: Proving ...
% 3.51/1.24 Prover 1: Constructing countermodel ...
% 3.51/1.24 Prover 6: Proving ...
% 3.51/1.25 Prover 4: Constructing countermodel ...
% 3.51/1.27 Prover 2: Proving ...
% 4.10/1.28 Prover 0: Proving ...
% 4.92/1.40 Prover 3: gave up
% 4.92/1.41 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.92/1.41 Prover 5: proved (747ms)
% 4.92/1.41
% 4.92/1.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.92/1.41
% 5.10/1.41 Prover 1: gave up
% 5.10/1.41 Prover 6: stopped
% 5.10/1.42 Prover 0: stopped
% 5.15/1.43 Prover 2: stopped
% 5.15/1.43 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.15/1.43 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.15/1.43 Prover 7: Preprocessing ...
% 5.15/1.43 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.15/1.43 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.15/1.43 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 5.15/1.43 Prover 8: Preprocessing ...
% 5.15/1.44 Prover 10: Preprocessing ...
% 5.15/1.45 Prover 13: Preprocessing ...
% 5.15/1.46 Prover 16: Preprocessing ...
% 5.15/1.47 Prover 11: Preprocessing ...
% 5.15/1.49 Prover 10: Warning: ignoring some quantifiers
% 5.15/1.49 Prover 7: Warning: ignoring some quantifiers
% 5.15/1.50 Prover 10: Constructing countermodel ...
% 5.73/1.51 Prover 7: Constructing countermodel ...
% 5.73/1.52 Prover 8: Warning: ignoring some quantifiers
% 5.73/1.52 Prover 16: Warning: ignoring some quantifiers
% 5.73/1.53 Prover 4: Found proof (size 28)
% 5.73/1.53 Prover 4: proved (859ms)
% 5.73/1.53 Prover 7: stopped
% 5.73/1.53 Prover 8: Constructing countermodel ...
% 5.73/1.53 Prover 16: Constructing countermodel ...
% 5.73/1.53 Prover 10: stopped
% 5.73/1.53 Prover 16: stopped
% 5.73/1.53 Prover 8: stopped
% 5.73/1.54 Prover 13: Warning: ignoring some quantifiers
% 5.73/1.54 Prover 11: Constructing countermodel ...
% 5.73/1.54 Prover 13: Constructing countermodel ...
% 5.73/1.55 Prover 11: stopped
% 5.73/1.55 Prover 13: stopped
% 5.73/1.55
% 5.73/1.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.73/1.55
% 5.73/1.55 % SZS output start Proof for theBenchmark
% 5.73/1.56 Assumptions after simplification:
% 5.73/1.56 ---------------------------------
% 5.73/1.56
% 5.73/1.56 (commutativity_k2_tarski)
% 6.14/1.59 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v1, v0) = v2) |
% 6.14/1.59 ~ $i(v1) | ~ $i(v0) | (unordered_pair(v0, v1) = v2 & $i(v2))) & ! [v0: $i]
% 6.14/1.59 : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v0, v1) = v2) | ~ $i(v1) |
% 6.14/1.59 ~ $i(v0) | (unordered_pair(v1, v0) = v2 & $i(v2)))
% 6.14/1.59
% 6.14/1.59 (t28_xboole_1)
% 6.14/1.59 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (set_intersection2(v0,
% 6.14/1.59 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) &
% 6.14/1.59 subset(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~ (subset(v0, v1) =
% 6.14/1.59 0) | ~ $i(v1) | ~ $i(v0) | set_intersection2(v0, v1) = v0)
% 6.14/1.59
% 6.14/1.59 (t38_zfmisc_1)
% 6.14/1.60 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0
% 6.14/1.60 | ~ (subset(v3, v2) = v4) | ~ (unordered_pair(v0, v1) = v3) | ~ $i(v2) |
% 6.14/1.60 ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : (in(v1, v2) = v6 &
% 6.14/1.60 in(v0, v2) = v5 & ( ~ (v6 = 0) | ~ (v5 = 0)))) & ! [v0: $i] : ! [v1:
% 6.14/1.60 $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (subset(v3, v2) = 0) | ~
% 6.14/1.60 (unordered_pair(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (in(v1,
% 6.14/1.60 v2) = 0 & in(v0, v2) = 0))
% 6.14/1.60
% 6.14/1.60 (t53_zfmisc_1)
% 6.14/1.60 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ( ~ (v4
% 6.14/1.60 = v3) & set_intersection2(v3, v1) = v4 & unordered_pair(v0, v2) = v3 &
% 6.14/1.60 in(v2, v1) = 0 & in(v0, v1) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) &
% 6.14/1.60 $i(v0))
% 6.14/1.60
% 6.14/1.60 (function-axioms)
% 6.14/1.61 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 6.14/1.61 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) &
% 6.14/1.61 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 6.14/1.61 (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & !
% 6.14/1.61 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 6.14/1.61 (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0:
% 6.14/1.61 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 6.14/1.61 : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0:
% 6.14/1.61 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 6.14/1.61 ~ (empty(v2) = v1) | ~ (empty(v2) = v0))
% 6.14/1.61
% 6.14/1.61 Further assumptions not needed in the proof:
% 6.14/1.61 --------------------------------------------
% 6.14/1.61 antisymmetry_r2_hidden, commutativity_k3_xboole_0, idempotence_k3_xboole_0,
% 6.14/1.61 rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski
% 6.14/1.61
% 6.14/1.61 Those formulas are unsatisfiable:
% 6.14/1.61 ---------------------------------
% 6.14/1.61
% 6.14/1.61 Begin of proof
% 6.14/1.61 |
% 6.14/1.61 | ALPHA: (commutativity_k2_tarski) implies:
% 6.14/1.61 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v1, v0) =
% 6.14/1.61 | v2) | ~ $i(v1) | ~ $i(v0) | (unordered_pair(v0, v1) = v2 &
% 6.14/1.61 | $i(v2)))
% 6.14/1.61 |
% 6.14/1.61 | ALPHA: (t28_xboole_1) implies:
% 6.14/1.62 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~
% 6.14/1.62 | (set_intersection2(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3:
% 6.14/1.62 | int] : ( ~ (v3 = 0) & subset(v0, v1) = v3))
% 6.14/1.62 |
% 6.14/1.62 | ALPHA: (t38_zfmisc_1) implies:
% 6.14/1.62 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] :
% 6.14/1.62 | (v4 = 0 | ~ (subset(v3, v2) = v4) | ~ (unordered_pair(v0, v1) = v3) |
% 6.14/1.62 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] :
% 6.14/1.62 | (in(v1, v2) = v6 & in(v0, v2) = v5 & ( ~ (v6 = 0) | ~ (v5 = 0))))
% 6.14/1.62 |
% 6.14/1.62 | ALPHA: (function-axioms) implies:
% 6.14/1.62 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 6.14/1.62 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0))
% 6.14/1.62 |
% 6.14/1.62 | DELTA: instantiating (t53_zfmisc_1) with fresh symbols all_14_0, all_14_1,
% 6.14/1.62 | all_14_2, all_14_3, all_14_4 gives:
% 6.14/1.62 | (5) ~ (all_14_0 = all_14_1) & set_intersection2(all_14_1, all_14_3) =
% 6.14/1.62 | all_14_0 & unordered_pair(all_14_4, all_14_2) = all_14_1 & in(all_14_2,
% 6.14/1.62 | all_14_3) = 0 & in(all_14_4, all_14_3) = 0 & $i(all_14_0) &
% 6.14/1.62 | $i(all_14_1) & $i(all_14_2) & $i(all_14_3) & $i(all_14_4)
% 6.14/1.62 |
% 6.14/1.62 | ALPHA: (5) implies:
% 6.14/1.62 | (6) ~ (all_14_0 = all_14_1)
% 6.14/1.62 | (7) $i(all_14_4)
% 6.14/1.62 | (8) $i(all_14_3)
% 6.14/1.62 | (9) $i(all_14_2)
% 6.14/1.62 | (10) in(all_14_4, all_14_3) = 0
% 6.14/1.63 | (11) in(all_14_2, all_14_3) = 0
% 6.14/1.63 | (12) unordered_pair(all_14_4, all_14_2) = all_14_1
% 6.14/1.63 | (13) set_intersection2(all_14_1, all_14_3) = all_14_0
% 6.14/1.63 |
% 6.14/1.63 | GROUND_INST: instantiating (1) with all_14_2, all_14_4, all_14_1, simplifying
% 6.14/1.63 | with (7), (9), (12) gives:
% 6.14/1.63 | (14) unordered_pair(all_14_2, all_14_4) = all_14_1 & $i(all_14_1)
% 6.14/1.63 |
% 6.14/1.63 | ALPHA: (14) implies:
% 6.14/1.63 | (15) $i(all_14_1)
% 6.14/1.63 | (16) unordered_pair(all_14_2, all_14_4) = all_14_1
% 6.14/1.63 |
% 6.14/1.63 | GROUND_INST: instantiating (2) with all_14_1, all_14_3, all_14_0, simplifying
% 6.14/1.63 | with (8), (13), (15) gives:
% 6.14/1.63 | (17) all_14_0 = all_14_1 | ? [v0: int] : ( ~ (v0 = 0) & subset(all_14_1,
% 6.14/1.63 | all_14_3) = v0)
% 6.14/1.63 |
% 6.14/1.63 | BETA: splitting (17) gives:
% 6.14/1.63 |
% 6.14/1.63 | Case 1:
% 6.14/1.63 | |
% 6.14/1.63 | | (18) all_14_0 = all_14_1
% 6.14/1.63 | |
% 6.14/1.63 | | REDUCE: (6), (18) imply:
% 6.14/1.63 | | (19) $false
% 6.14/1.63 | |
% 6.14/1.63 | | CLOSE: (19) is inconsistent.
% 6.14/1.63 | |
% 6.14/1.63 | Case 2:
% 6.14/1.63 | |
% 6.14/1.63 | | (20) ? [v0: int] : ( ~ (v0 = 0) & subset(all_14_1, all_14_3) = v0)
% 6.14/1.63 | |
% 6.14/1.63 | | DELTA: instantiating (20) with fresh symbol all_30_0 gives:
% 6.14/1.63 | | (21) ~ (all_30_0 = 0) & subset(all_14_1, all_14_3) = all_30_0
% 6.14/1.63 | |
% 6.14/1.63 | | ALPHA: (21) implies:
% 6.14/1.63 | | (22) ~ (all_30_0 = 0)
% 6.14/1.63 | | (23) subset(all_14_1, all_14_3) = all_30_0
% 6.14/1.63 | |
% 6.14/1.63 | | GROUND_INST: instantiating (3) with all_14_2, all_14_4, all_14_3, all_14_1,
% 6.14/1.63 | | all_30_0, simplifying with (7), (8), (9), (16), (23) gives:
% 6.14/1.63 | | (24) all_30_0 = 0 | ? [v0: any] : ? [v1: any] : (in(all_14_2, all_14_3)
% 6.14/1.63 | | = v0 & in(all_14_4, all_14_3) = v1 & ( ~ (v1 = 0) | ~ (v0 = 0)))
% 6.14/1.63 | |
% 6.14/1.63 | | BETA: splitting (24) gives:
% 6.14/1.63 | |
% 6.14/1.63 | | Case 1:
% 6.14/1.63 | | |
% 6.14/1.64 | | | (25) all_30_0 = 0
% 6.14/1.64 | | |
% 6.14/1.64 | | | REDUCE: (22), (25) imply:
% 6.14/1.64 | | | (26) $false
% 6.14/1.64 | | |
% 6.14/1.64 | | | CLOSE: (26) is inconsistent.
% 6.14/1.64 | | |
% 6.14/1.64 | | Case 2:
% 6.14/1.64 | | |
% 6.14/1.64 | | | (27) ? [v0: any] : ? [v1: any] : (in(all_14_2, all_14_3) = v0 &
% 6.14/1.64 | | | in(all_14_4, all_14_3) = v1 & ( ~ (v1 = 0) | ~ (v0 = 0)))
% 6.14/1.64 | | |
% 6.14/1.64 | | | DELTA: instantiating (27) with fresh symbols all_39_0, all_39_1 gives:
% 6.14/1.64 | | | (28) in(all_14_2, all_14_3) = all_39_1 & in(all_14_4, all_14_3) =
% 6.14/1.64 | | | all_39_0 & ( ~ (all_39_0 = 0) | ~ (all_39_1 = 0))
% 6.14/1.64 | | |
% 6.14/1.64 | | | ALPHA: (28) implies:
% 6.14/1.64 | | | (29) in(all_14_4, all_14_3) = all_39_0
% 6.14/1.64 | | | (30) in(all_14_2, all_14_3) = all_39_1
% 6.14/1.64 | | | (31) ~ (all_39_0 = 0) | ~ (all_39_1 = 0)
% 6.14/1.64 | | |
% 6.14/1.64 | | | GROUND_INST: instantiating (4) with 0, all_39_0, all_14_3, all_14_4,
% 6.14/1.64 | | | simplifying with (10), (29) gives:
% 6.14/1.64 | | | (32) all_39_0 = 0
% 6.14/1.64 | | |
% 6.14/1.64 | | | GROUND_INST: instantiating (4) with 0, all_39_1, all_14_3, all_14_2,
% 6.14/1.64 | | | simplifying with (11), (30) gives:
% 6.14/1.64 | | | (33) all_39_1 = 0
% 6.14/1.64 | | |
% 6.14/1.64 | | | BETA: splitting (31) gives:
% 6.14/1.64 | | |
% 6.14/1.64 | | | Case 1:
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | (34) ~ (all_39_0 = 0)
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | REDUCE: (32), (34) imply:
% 6.14/1.64 | | | | (35) $false
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | CLOSE: (35) is inconsistent.
% 6.14/1.64 | | | |
% 6.14/1.64 | | | Case 2:
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | (36) ~ (all_39_1 = 0)
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | REDUCE: (33), (36) imply:
% 6.14/1.64 | | | | (37) $false
% 6.14/1.64 | | | |
% 6.14/1.64 | | | | CLOSE: (37) is inconsistent.
% 6.14/1.64 | | | |
% 6.14/1.64 | | | End of split
% 6.14/1.64 | | |
% 6.14/1.64 | | End of split
% 6.14/1.64 | |
% 6.14/1.64 | End of split
% 6.14/1.64 |
% 6.14/1.64 End of proof
% 6.14/1.64 % SZS output end Proof for theBenchmark
% 6.14/1.64
% 6.14/1.64 1004ms
%------------------------------------------------------------------------------