TSTP Solution File: NUM430+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : NUM430+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n024.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 11:47:42 EDT 2023
% Result : Theorem 63.48s 9.39s
% Output : Proof 65.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM430+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 16:35:24 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.64 Running up to 7 provers in parallel.
% 0.20/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.59/1.08 Prover 1: Preprocessing ...
% 2.59/1.08 Prover 4: Preprocessing ...
% 3.18/1.13 Prover 0: Preprocessing ...
% 3.18/1.13 Prover 6: Preprocessing ...
% 3.18/1.13 Prover 3: Preprocessing ...
% 3.18/1.13 Prover 2: Preprocessing ...
% 3.18/1.13 Prover 5: Preprocessing ...
% 7.70/1.77 Prover 1: Constructing countermodel ...
% 7.70/1.79 Prover 6: Proving ...
% 7.70/1.79 Prover 3: Constructing countermodel ...
% 8.56/1.89 Prover 5: Constructing countermodel ...
% 8.56/1.97 Prover 4: Constructing countermodel ...
% 8.56/2.02 Prover 2: Proving ...
% 8.56/2.03 Prover 0: Proving ...
% 11.97/2.35 Prover 3: gave up
% 11.97/2.36 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 12.56/2.46 Prover 7: Preprocessing ...
% 12.99/2.66 Prover 7: Constructing countermodel ...
% 13.80/2.67 Prover 1: gave up
% 13.80/2.67 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 13.80/2.73 Prover 8: Preprocessing ...
% 15.49/2.88 Prover 8: Warning: ignoring some quantifiers
% 15.49/2.88 Prover 8: Constructing countermodel ...
% 21.21/3.67 Prover 8: gave up
% 21.21/3.67 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 22.10/3.77 Prover 9: Preprocessing ...
% 25.00/4.17 Prover 9: Constructing countermodel ...
% 59.25/8.79 Prover 2: stopped
% 60.34/8.81 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 60.61/8.89 Prover 10: Preprocessing ...
% 61.64/9.02 Prover 10: Constructing countermodel ...
% 63.48/9.38 Prover 10: Found proof (size 32)
% 63.48/9.38 Prover 10: proved (562ms)
% 63.48/9.38 Prover 0: stopped
% 63.48/9.38 Prover 5: stopped
% 63.48/9.38 Prover 9: stopped
% 63.48/9.38 Prover 7: stopped
% 63.48/9.38 Prover 6: stopped
% 63.48/9.38 Prover 4: stopped
% 63.48/9.39
% 63.48/9.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 63.48/9.39
% 63.48/9.39 % SZS output start Proof for theBenchmark
% 63.48/9.39 Assumptions after simplification:
% 63.48/9.39 ---------------------------------
% 63.48/9.39
% 63.48/9.39 (mAddComm)
% 64.47/9.44 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtpldt0(v0, v1) = v2) | ~
% 64.47/9.44 $i(v1) | ~ $i(v0) | ~ aInteger0(v1) | ~ aInteger0(v0) | (sdtpldt0(v1, v0)
% 64.47/9.44 = v2 & $i(v2)))
% 64.47/9.44
% 64.47/9.44 (mDivisor)
% 64.47/9.44 $i(sz00) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = sz00 | ~
% 64.47/9.44 (sdtasdt0(v1, v2) = v0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~
% 64.47/9.45 aInteger0(v2) | ~ aInteger0(v1) | ~ aInteger0(v0) | aDivisorOf0(v1, v0)) &
% 64.47/9.45 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ aDivisorOf0(v1, v0) |
% 64.47/9.45 ~ aInteger0(v0) | aInteger0(v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) |
% 64.47/9.45 ~ $i(v0) | ~ aDivisorOf0(v1, v0) | ~ aInteger0(v0) | ? [v2: $i] :
% 64.47/9.45 (sdtasdt0(v1, v2) = v0 & $i(v2) & aInteger0(v2))) & ! [v0: $i] : ( ~ $i(v0)
% 64.47/9.45 | ~ aDivisorOf0(sz00, v0) | ~ aInteger0(v0))
% 64.47/9.45
% 64.47/9.45 (mEquMod)
% 64.47/9.45 $i(sz00) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i]
% 64.47/9.45 : (v2 = sz00 | ~ (sdtpldt0(v0, v3) = v4) | ~ (smndt0(v1) = v3) | ~ $i(v2) |
% 64.47/9.45 ~ $i(v1) | ~ $i(v0) | ~ sdteqdtlpzmzozddtrp0(v0, v1, v2) | ~
% 64.47/9.45 aInteger0(v2) | ~ aInteger0(v1) | ~ aInteger0(v0) | aDivisorOf0(v2, v4)) &
% 64.47/9.45 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v2 =
% 64.47/9.45 sz00 | ~ (sdtpldt0(v0, v3) = v4) | ~ (smndt0(v1) = v3) | ~ $i(v2) | ~
% 64.47/9.45 $i(v1) | ~ $i(v0) | ~ aDivisorOf0(v2, v4) | ~ aInteger0(v2) | ~
% 64.47/9.45 aInteger0(v1) | ~ aInteger0(v0) | sdteqdtlpzmzozddtrp0(v0, v1, v2))
% 64.47/9.45
% 64.47/9.45 (mEquModRef)
% 64.47/9.46 $i(sz00) & ! [v0: $i] : ! [v1: $i] : (v1 = sz00 | ~ $i(v1) | ~ $i(v0) | ~
% 64.47/9.46 aInteger0(v1) | ~ aInteger0(v0) | sdteqdtlpzmzozddtrp0(v0, v0, v1))
% 64.47/9.46
% 64.47/9.46 (mIntNeg)
% 64.47/9.46 ! [v0: $i] : ! [v1: $i] : ( ~ (smndt0(v0) = v1) | ~ $i(v0) | ~
% 64.47/9.46 aInteger0(v0) | aInteger0(v1))
% 64.47/9.46
% 64.47/9.46 (mIntPlus)
% 64.47/9.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtpldt0(v0, v1) = v2) | ~
% 64.47/9.46 $i(v1) | ~ $i(v0) | ~ aInteger0(v1) | ~ aInteger0(v0) | aInteger0(v2))
% 64.47/9.46
% 64.47/9.46 (m__)
% 64.47/9.46 $i(xc) & $i(xq) & $i(xb) & ? [v0: $i] : ? [v1: $i] : (sdtpldt0(xb, v0) = v1
% 64.47/9.46 & smndt0(xc) = v0 & $i(v1) & $i(v0) & ! [v2: $i] : ( ~ (sdtasdt0(xq, v2) =
% 64.47/9.46 v1) | ~ $i(v2) | ~ aInteger0(v2)))
% 64.47/9.46
% 64.47/9.46 (m__818)
% 64.47/9.46 ~ (xq = sz00) & $i(xc) & $i(xq) & $i(xb) & $i(xa) & $i(sz00) & aInteger0(xc)
% 64.47/9.46 & aInteger0(xq) & aInteger0(xb) & aInteger0(xa)
% 64.47/9.46
% 64.47/9.46 (m__853)
% 64.47/9.47 $i(xc) & $i(xq) & $i(xb) & $i(xa) & sdteqdtlpzmzozddtrp0(xb, xc, xq) &
% 64.47/9.47 sdteqdtlpzmzozddtrp0(xa, xb, xq)
% 64.47/9.47
% 64.47/9.47 (m__876)
% 64.47/9.47 $i(xn) & $i(xq) & $i(xb) & $i(xa) & ? [v0: $i] : ? [v1: $i] : (sdtasdt0(xq,
% 64.47/9.47 xn) = v0 & sdtpldt0(xa, v1) = v0 & smndt0(xb) = v1 & $i(v1) & $i(v0) &
% 64.47/9.47 aInteger0(xn))
% 64.47/9.47
% 64.47/9.47 Further assumptions not needed in the proof:
% 64.47/9.47 --------------------------------------------
% 64.47/9.47 mAddAsso, mAddNeg, mAddZero, mDistrib, mEquModSym, mIntMult, mIntOne, mIntZero,
% 64.47/9.47 mIntegers, mMulAsso, mMulComm, mMulMinOne, mMulOne, mMulZero, mZeroDiv
% 64.47/9.47
% 64.47/9.47 Those formulas are unsatisfiable:
% 64.47/9.47 ---------------------------------
% 64.47/9.47
% 64.47/9.47 Begin of proof
% 64.47/9.47 |
% 64.47/9.47 | ALPHA: (mDivisor) implies:
% 64.47/9.47 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ aDivisorOf0(v1,
% 64.47/9.47 | v0) | ~ aInteger0(v0) | ? [v2: $i] : (sdtasdt0(v1, v2) = v0 &
% 64.47/9.47 | $i(v2) & aInteger0(v2)))
% 64.47/9.47 |
% 64.47/9.47 | ALPHA: (mEquMod) implies:
% 64.47/9.48 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] :
% 64.47/9.48 | (v2 = sz00 | ~ (sdtpldt0(v0, v3) = v4) | ~ (smndt0(v1) = v3) | ~
% 64.47/9.48 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ sdteqdtlpzmzozddtrp0(v0, v1, v2)
% 64.47/9.48 | | ~ aInteger0(v2) | ~ aInteger0(v1) | ~ aInteger0(v0) |
% 64.47/9.48 | aDivisorOf0(v2, v4))
% 64.47/9.48 |
% 64.47/9.48 | ALPHA: (mEquModRef) implies:
% 64.47/9.48 | (3) ! [v0: $i] : ! [v1: $i] : (v1 = sz00 | ~ $i(v1) | ~ $i(v0) | ~
% 64.47/9.48 | aInteger0(v1) | ~ aInteger0(v0) | sdteqdtlpzmzozddtrp0(v0, v0, v1))
% 64.47/9.48 |
% 64.47/9.48 | ALPHA: (m__818) implies:
% 64.47/9.48 | (4) ~ (xq = sz00)
% 64.47/9.48 | (5) aInteger0(xb)
% 64.47/9.48 | (6) aInteger0(xq)
% 64.47/9.48 | (7) aInteger0(xc)
% 64.47/9.48 |
% 64.47/9.48 | ALPHA: (m__853) implies:
% 64.47/9.48 | (8) sdteqdtlpzmzozddtrp0(xb, xc, xq)
% 64.47/9.48 |
% 64.47/9.48 | ALPHA: (m__876) implies:
% 64.47/9.48 | (9) ? [v0: $i] : ? [v1: $i] : (sdtasdt0(xq, xn) = v0 & sdtpldt0(xa, v1) =
% 64.47/9.48 | v0 & smndt0(xb) = v1 & $i(v1) & $i(v0) & aInteger0(xn))
% 64.47/9.48 |
% 64.47/9.48 | ALPHA: (m__) implies:
% 64.47/9.48 | (10) $i(xb)
% 64.47/9.48 | (11) $i(xq)
% 64.47/9.48 | (12) $i(xc)
% 64.47/9.49 | (13) ? [v0: $i] : ? [v1: $i] : (sdtpldt0(xb, v0) = v1 & smndt0(xc) = v0 &
% 64.47/9.49 | $i(v1) & $i(v0) & ! [v2: $i] : ( ~ (sdtasdt0(xq, v2) = v1) | ~
% 64.47/9.49 | $i(v2) | ~ aInteger0(v2)))
% 64.47/9.49 |
% 64.47/9.49 | DELTA: instantiating (9) with fresh symbols all_21_0, all_21_1 gives:
% 64.47/9.49 | (14) sdtasdt0(xq, xn) = all_21_1 & sdtpldt0(xa, all_21_0) = all_21_1 &
% 64.47/9.49 | smndt0(xb) = all_21_0 & $i(all_21_0) & $i(all_21_1) & aInteger0(xn)
% 64.47/9.49 |
% 64.47/9.49 | ALPHA: (14) implies:
% 64.47/9.49 | (15) $i(all_21_0)
% 64.47/9.49 | (16) smndt0(xb) = all_21_0
% 64.47/9.49 |
% 64.47/9.49 | DELTA: instantiating (13) with fresh symbols all_23_0, all_23_1 gives:
% 64.47/9.49 | (17) sdtpldt0(xb, all_23_1) = all_23_0 & smndt0(xc) = all_23_1 &
% 64.47/9.49 | $i(all_23_0) & $i(all_23_1) & ! [v0: $i] : ( ~ (sdtasdt0(xq, v0) =
% 64.47/9.49 | all_23_0) | ~ $i(v0) | ~ aInteger0(v0))
% 64.47/9.49 |
% 64.47/9.49 | ALPHA: (17) implies:
% 64.47/9.49 | (18) $i(all_23_1)
% 64.47/9.49 | (19) smndt0(xc) = all_23_1
% 64.47/9.49 | (20) sdtpldt0(xb, all_23_1) = all_23_0
% 64.47/9.49 | (21) ! [v0: $i] : ( ~ (sdtasdt0(xq, v0) = all_23_0) | ~ $i(v0) | ~
% 64.47/9.49 | aInteger0(v0))
% 64.47/9.49 |
% 64.47/9.49 | GROUND_INST: instantiating (mIntNeg) with xb, all_21_0, simplifying with (5),
% 64.47/9.49 | (10), (16) gives:
% 64.47/9.49 | (22) aInteger0(all_21_0)
% 64.47/9.49 |
% 64.47/9.49 | GROUND_INST: instantiating (mIntNeg) with xc, all_23_1, simplifying with (7),
% 64.47/9.49 | (12), (19) gives:
% 64.47/9.49 | (23) aInteger0(all_23_1)
% 64.47/9.49 |
% 64.47/9.50 | GROUND_INST: instantiating (2) with xb, xc, xq, all_23_1, all_23_0,
% 64.47/9.50 | simplifying with (5), (6), (7), (8), (10), (11), (12), (19), (20)
% 64.47/9.50 | gives:
% 64.47/9.50 | (24) xq = sz00 | aDivisorOf0(xq, all_23_0)
% 64.47/9.50 |
% 64.47/9.50 | BETA: splitting (24) gives:
% 64.47/9.50 |
% 64.47/9.50 | Case 1:
% 64.47/9.50 | |
% 64.47/9.50 | | (25) aDivisorOf0(xq, all_23_0)
% 64.47/9.50 | |
% 64.47/9.50 | | GROUND_INST: instantiating (3) with all_21_0, xq, simplifying with (6),
% 64.47/9.50 | | (11), (15), (22) gives:
% 65.33/9.50 | | (26) xq = sz00 | sdteqdtlpzmzozddtrp0(all_21_0, all_21_0, xq)
% 65.33/9.50 | |
% 65.33/9.50 | | GROUND_INST: instantiating (mIntPlus) with xb, all_23_1, all_23_0,
% 65.33/9.50 | | simplifying with (5), (10), (18), (20), (23) gives:
% 65.33/9.50 | | (27) aInteger0(all_23_0)
% 65.33/9.50 | |
% 65.33/9.50 | | GROUND_INST: instantiating (mAddComm) with xb, all_23_1, all_23_0,
% 65.33/9.50 | | simplifying with (5), (10), (18), (20), (23) gives:
% 65.33/9.50 | | (28) sdtpldt0(all_23_1, xb) = all_23_0 & $i(all_23_0)
% 65.33/9.50 | |
% 65.33/9.50 | | ALPHA: (28) implies:
% 65.33/9.50 | | (29) $i(all_23_0)
% 65.33/9.50 | |
% 65.33/9.50 | | BETA: splitting (26) gives:
% 65.33/9.50 | |
% 65.33/9.50 | | Case 1:
% 65.33/9.50 | | |
% 65.33/9.50 | | |
% 65.33/9.50 | | | GROUND_INST: instantiating (1) with all_23_0, xq, simplifying with (11),
% 65.33/9.50 | | | (25), (27), (29) gives:
% 65.33/9.50 | | | (30) ? [v0: $i] : (sdtasdt0(xq, v0) = all_23_0 & $i(v0) &
% 65.33/9.50 | | | aInteger0(v0))
% 65.33/9.50 | | |
% 65.33/9.50 | | | DELTA: instantiating (30) with fresh symbol all_109_0 gives:
% 65.33/9.50 | | | (31) sdtasdt0(xq, all_109_0) = all_23_0 & $i(all_109_0) &
% 65.33/9.50 | | | aInteger0(all_109_0)
% 65.33/9.50 | | |
% 65.33/9.50 | | | ALPHA: (31) implies:
% 65.33/9.50 | | | (32) aInteger0(all_109_0)
% 65.33/9.50 | | | (33) $i(all_109_0)
% 65.33/9.51 | | | (34) sdtasdt0(xq, all_109_0) = all_23_0
% 65.33/9.51 | | |
% 65.33/9.51 | | | GROUND_INST: instantiating (21) with all_109_0, simplifying with (32),
% 65.33/9.51 | | | (33), (34) gives:
% 65.33/9.51 | | | (35) $false
% 65.33/9.51 | | |
% 65.33/9.51 | | | CLOSE: (35) is inconsistent.
% 65.33/9.51 | | |
% 65.33/9.51 | | Case 2:
% 65.33/9.51 | | |
% 65.33/9.51 | | | (36) xq = sz00
% 65.33/9.51 | | |
% 65.33/9.51 | | | REDUCE: (4), (36) imply:
% 65.33/9.51 | | | (37) $false
% 65.33/9.51 | | |
% 65.33/9.51 | | | CLOSE: (37) is inconsistent.
% 65.33/9.51 | | |
% 65.33/9.51 | | End of split
% 65.33/9.51 | |
% 65.33/9.51 | Case 2:
% 65.33/9.51 | |
% 65.33/9.51 | | (38) xq = sz00
% 65.33/9.51 | |
% 65.33/9.51 | | REDUCE: (4), (38) imply:
% 65.33/9.51 | | (39) $false
% 65.33/9.51 | |
% 65.33/9.51 | | CLOSE: (39) is inconsistent.
% 65.33/9.51 | |
% 65.33/9.51 | End of split
% 65.33/9.51 |
% 65.33/9.51 End of proof
% 65.33/9.51 % SZS output end Proof for theBenchmark
% 65.33/9.51
% 65.33/9.51 8884ms
%------------------------------------------------------------------------------