%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM427+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 : n016.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:41 EDT 2023 % Result : Theorem 45.83s 6.97s % Output : Proof 47.87s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : NUM427+1 : TPTP v8.1.2. Released v4.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.16/0.35 % Computer : n016.cluster.edu % 0.16/0.35 % Model : x86_64 x86_64 % 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.35 % Memory : 8042.1875MB % 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.35 % CPULimit : 300 % 0.16/0.35 % WCLimit : 300 % 0.16/0.35 % DateTime : Fri Aug 25 13:12:40 EDT 2023 % 0.16/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.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.45/1.13 Prover 4: Preprocessing ... % 2.45/1.13 Prover 1: Preprocessing ... % 2.96/1.17 Prover 0: Preprocessing ... % 2.96/1.17 Prover 2: Preprocessing ... % 2.96/1.17 Prover 5: Preprocessing ... % 2.96/1.17 Prover 6: Preprocessing ... % 2.96/1.17 Prover 3: Preprocessing ... % 6.26/1.62 Prover 1: Constructing countermodel ... % 6.26/1.63 Prover 3: Constructing countermodel ... % 6.26/1.63 Prover 6: Proving ... % 7.24/1.75 Prover 5: Constructing countermodel ... % 7.24/1.75 Prover 4: Constructing countermodel ... % 7.56/1.83 Prover 2: Proving ... % 7.56/1.84 Prover 0: Proving ... % 8.77/2.02 Prover 3: gave up % 8.77/2.03 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.70/2.09 Prover 7: Preprocessing ... % 9.70/2.23 Prover 7: Constructing countermodel ... % 10.92/2.32 Prover 1: gave up % 10.92/2.33 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.48/2.36 Prover 8: Preprocessing ... % 11.98/2.43 Prover 8: Warning: ignoring some quantifiers % 11.98/2.43 Prover 8: Constructing countermodel ... % 14.27/2.80 Prover 8: gave up % 14.27/2.80 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 14.27/2.82 Prover 9: Preprocessing ... % 16.46/3.13 Prover 9: Constructing countermodel ... % 45.83/6.97 Prover 0: proved (6305ms) % 45.83/6.97 % 45.83/6.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 45.83/6.97 % 45.83/6.97 Prover 5: stopped % 45.83/6.97 Prover 9: stopped % 45.83/6.98 Prover 2: stopped % 45.83/6.99 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 45.83/6.99 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 45.83/6.99 Prover 6: stopped % 46.45/7.00 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 46.45/7.00 Prover 11: Preprocessing ... % 46.45/7.00 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 46.45/7.00 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 46.45/7.00 Prover 10: Preprocessing ... % 46.45/7.01 Prover 13: Preprocessing ... % 46.45/7.02 Prover 19: Preprocessing ... % 46.45/7.04 Prover 16: Preprocessing ... % 46.45/7.05 Prover 10: Constructing countermodel ... % 47.09/7.09 Prover 16: Constructing countermodel ... % 47.09/7.11 Prover 19: Warning: ignoring some quantifiers % 47.09/7.11 Prover 13: Constructing countermodel ... % 47.09/7.12 Prover 11: Constructing countermodel ... % 47.09/7.14 Prover 19: Constructing countermodel ... % 47.09/7.16 Prover 10: Found proof (size 30) % 47.09/7.16 Prover 10: proved (190ms) % 47.09/7.16 Prover 16: stopped % 47.09/7.16 Prover 19: stopped % 47.09/7.16 Prover 11: stopped % 47.09/7.16 Prover 7: stopped % 47.09/7.16 Prover 4: stopped % 47.09/7.16 Prover 13: stopped % 47.09/7.16 % 47.09/7.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 47.09/7.16 % 47.09/7.16 % SZS output start Proof for theBenchmark % 47.09/7.17 Assumptions after simplification: % 47.09/7.17 --------------------------------- % 47.09/7.17 % 47.09/7.17 (mAddComm) % 47.80/7.19 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtpldt0(v0, v1) = v2) | ~ % 47.80/7.19 $i(v1) | ~ $i(v0) | ~ aInteger0(v1) | ~ aInteger0(v0) | (sdtpldt0(v1, v0) % 47.80/7.19 = v2 & $i(v2))) % 47.80/7.19 % 47.80/7.19 (mDivisor) % 47.80/7.19 $i(sz00) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = sz00 | ~ % 47.80/7.19 (sdtasdt0(v1, v2) = v0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 47.80/7.19 aInteger0(v2) | ~ aInteger0(v1) | ~ aInteger0(v0) | aDivisorOf0(v1, v0)) & % 47.80/7.19 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ aDivisorOf0(v1, v0) | % 47.80/7.19 ~ aInteger0(v0) | aInteger0(v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | % 47.80/7.19 ~ $i(v0) | ~ aDivisorOf0(v1, v0) | ~ aInteger0(v0) | ? [v2: $i] : % 47.80/7.19 (sdtasdt0(v1, v2) = v0 & $i(v2) & aInteger0(v2))) & ! [v0: $i] : ( ~ $i(v0) % 47.80/7.19 | ~ aDivisorOf0(sz00, v0) | ~ aInteger0(v0)) % 47.80/7.19 % 47.80/7.19 (mEquMod) % 47.87/7.20 $i(sz00) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] % 47.87/7.20 : (v2 = sz00 | ~ (sdtpldt0(v0, v3) = v4) | ~ (smndt0(v1) = v3) | ~ $i(v2) | % 47.87/7.20 ~ $i(v1) | ~ $i(v0) | ~ sdteqdtlpzmzozddtrp0(v0, v1, v2) | ~ % 47.87/7.20 aInteger0(v2) | ~ aInteger0(v1) | ~ aInteger0(v0) | aDivisorOf0(v2, v4)) & % 47.87/7.20 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v2 = % 47.87/7.20 sz00 | ~ (sdtpldt0(v0, v3) = v4) | ~ (smndt0(v1) = v3) | ~ $i(v2) | ~ % 47.87/7.20 $i(v1) | ~ $i(v0) | ~ aDivisorOf0(v2, v4) | ~ aInteger0(v2) | ~ % 47.87/7.20 aInteger0(v1) | ~ aInteger0(v0) | sdteqdtlpzmzozddtrp0(v0, v1, v2)) % 47.87/7.20 % 47.87/7.20 (mEquModRef) % 47.87/7.20 $i(sz00) & ! [v0: $i] : ! [v1: $i] : (v1 = sz00 | ~ $i(v1) | ~ $i(v0) | ~ % 47.87/7.20 aInteger0(v1) | ~ aInteger0(v0) | sdteqdtlpzmzozddtrp0(v0, v0, v1)) % 47.87/7.20 % 47.87/7.20 (mIntNeg) % 47.87/7.20 ! [v0: $i] : ! [v1: $i] : ( ~ (smndt0(v0) = v1) | ~ $i(v0) | ~ % 47.87/7.20 aInteger0(v0) | aInteger0(v1)) % 47.87/7.20 % 47.87/7.20 (mIntPlus) % 47.87/7.20 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (sdtpldt0(v0, v1) = v2) | ~ % 47.87/7.20 $i(v1) | ~ $i(v0) | ~ aInteger0(v1) | ~ aInteger0(v0) | aInteger0(v2)) % 47.87/7.20 % 47.87/7.20 (m__) % 47.87/7.20 $i(xq) & $i(xb) & $i(xa) & ~ sdteqdtlpzmzozddtrp0(xb, xa, xq) % 47.87/7.20 % 47.87/7.20 (m__704) % 47.87/7.20 ~ (xq = sz00) & $i(xq) & $i(xb) & $i(xa) & $i(sz00) & aInteger0(xq) & % 47.87/7.20 aInteger0(xb) & aInteger0(xa) % 47.87/7.20 % 47.87/7.20 (m__747) % 47.87/7.20 $i(xn) & $i(xq) & $i(xb) & $i(xa) & ? [v0: $i] : ? [v1: $i] : (sdtasdt0(xq, % 47.87/7.20 xn) = v0 & sdtpldt0(xa, v1) = v0 & smndt0(xb) = v1 & $i(v1) & $i(v0) & % 47.87/7.20 aInteger0(xn)) % 47.87/7.20 % 47.87/7.20 (m__767) % 47.87/7.20 $i(xn) & $i(xq) & $i(xb) & $i(xa) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : % 47.87/7.20 (sdtasdt0(xq, v0) = v1 & sdtpldt0(xb, v2) = v1 & smndt0(xn) = v0 & smndt0(xa) % 47.87/7.20 = v2 & $i(v2) & $i(v1) & $i(v0)) % 47.87/7.20 % 47.87/7.20 Further assumptions not needed in the proof: % 47.87/7.20 -------------------------------------------- % 47.87/7.20 mAddAsso, mAddNeg, mAddZero, mDistrib, mIntMult, mIntOne, mIntZero, mIntegers, % 47.87/7.20 mMulAsso, mMulComm, mMulMinOne, mMulOne, mMulZero, mZeroDiv, m__724 % 47.87/7.20 % 47.87/7.20 Those formulas are unsatisfiable: % 47.87/7.20 --------------------------------- % 47.87/7.20 % 47.87/7.20 Begin of proof % 47.87/7.20 | % 47.87/7.20 | ALPHA: (mDivisor) implies: % 47.87/7.20 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = sz00 | ~ (sdtasdt0(v1, % 47.87/7.20 | v2) = v0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aInteger0(v2) % 47.87/7.20 | | ~ aInteger0(v1) | ~ aInteger0(v0) | aDivisorOf0(v1, v0)) % 47.87/7.20 | % 47.87/7.20 | ALPHA: (mEquMod) implies: % 47.87/7.21 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 47.87/7.21 | (v2 = sz00 | ~ (sdtpldt0(v0, v3) = v4) | ~ (smndt0(v1) = v3) | ~ % 47.87/7.21 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ aDivisorOf0(v2, v4) | ~ % 47.87/7.21 | aInteger0(v2) | ~ aInteger0(v1) | ~ aInteger0(v0) | % 47.87/7.21 | sdteqdtlpzmzozddtrp0(v0, v1, v2)) % 47.87/7.21 | % 47.87/7.21 | ALPHA: (mEquModRef) implies: % 47.87/7.21 | (3) ! [v0: $i] : ! [v1: $i] : (v1 = sz00 | ~ $i(v1) | ~ $i(v0) | ~ % 47.87/7.21 | aInteger0(v1) | ~ aInteger0(v0) | sdteqdtlpzmzozddtrp0(v0, v0, v1)) % 47.87/7.21 | % 47.87/7.21 | ALPHA: (m__704) implies: % 47.87/7.21 | (4) ~ (xq = sz00) % 47.87/7.21 | (5) aInteger0(xa) % 47.87/7.21 | (6) aInteger0(xb) % 47.87/7.21 | (7) aInteger0(xq) % 47.87/7.21 | % 47.87/7.21 | ALPHA: (m__747) implies: % 47.87/7.21 | (8) ? [v0: $i] : ? [v1: $i] : (sdtasdt0(xq, xn) = v0 & sdtpldt0(xa, v1) = % 47.87/7.21 | v0 & smndt0(xb) = v1 & $i(v1) & $i(v0) & aInteger0(xn)) % 47.87/7.21 | % 47.87/7.21 | ALPHA: (m__767) implies: % 47.87/7.21 | (9) $i(xn) % 47.87/7.21 | (10) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (sdtasdt0(xq, v0) = v1 & % 47.87/7.21 | sdtpldt0(xb, v2) = v1 & smndt0(xn) = v0 & smndt0(xa) = v2 & $i(v2) & % 47.87/7.21 | $i(v1) & $i(v0)) % 47.87/7.21 | % 47.87/7.21 | ALPHA: (m__) implies: % 47.87/7.21 | (11) ~ sdteqdtlpzmzozddtrp0(xb, xa, xq) % 47.87/7.21 | (12) $i(xa) % 47.87/7.21 | (13) $i(xb) % 47.87/7.21 | (14) $i(xq) % 47.87/7.21 | % 47.87/7.21 | DELTA: instantiating (8) with fresh symbols all_20_0, all_20_1 gives: % 47.87/7.21 | (15) sdtasdt0(xq, xn) = all_20_1 & sdtpldt0(xa, all_20_0) = all_20_1 & % 47.87/7.21 | smndt0(xb) = all_20_0 & $i(all_20_0) & $i(all_20_1) & aInteger0(xn) % 47.87/7.21 | % 47.87/7.21 | ALPHA: (15) implies: % 47.87/7.21 | (16) aInteger0(xn) % 47.87/7.21 | % 47.87/7.21 | DELTA: instantiating (10) with fresh symbols all_22_0, all_22_1, all_22_2 % 47.87/7.21 | gives: % 47.87/7.21 | (17) sdtasdt0(xq, all_22_2) = all_22_1 & sdtpldt0(xb, all_22_0) = all_22_1 % 47.87/7.21 | & smndt0(xn) = all_22_2 & smndt0(xa) = all_22_0 & $i(all_22_0) & % 47.87/7.21 | $i(all_22_1) & $i(all_22_2) % 47.87/7.21 | % 47.87/7.21 | ALPHA: (17) implies: % 47.87/7.21 | (18) $i(all_22_2) % 47.87/7.21 | (19) $i(all_22_0) % 47.87/7.21 | (20) smndt0(xa) = all_22_0 % 47.87/7.21 | (21) smndt0(xn) = all_22_2 % 47.87/7.21 | (22) sdtpldt0(xb, all_22_0) = all_22_1 % 47.87/7.21 | (23) sdtasdt0(xq, all_22_2) = all_22_1 % 47.87/7.21 | % 47.87/7.21 | GROUND_INST: instantiating (3) with xq, xq, simplifying with (7), (14) gives: % 47.87/7.21 | (24) xq = sz00 | sdteqdtlpzmzozddtrp0(xq, xq, xq) % 47.87/7.21 | % 47.87/7.21 | GROUND_INST: instantiating (mIntNeg) with xa, all_22_0, simplifying with (5), % 47.87/7.21 | (12), (20) gives: % 47.87/7.21 | (25) aInteger0(all_22_0) % 47.87/7.21 | % 47.87/7.21 | GROUND_INST: instantiating (mIntNeg) with xn, all_22_2, simplifying with (9), % 47.87/7.21 | (16), (21) gives: % 47.87/7.21 | (26) aInteger0(all_22_2) % 47.87/7.21 | % 47.87/7.21 | BETA: splitting (24) gives: % 47.87/7.21 | % 47.87/7.21 | Case 1: % 47.87/7.21 | | % 47.87/7.22 | | % 47.87/7.22 | | GROUND_INST: instantiating (mIntPlus) with xb, all_22_0, all_22_1, % 47.87/7.22 | | simplifying with (6), (13), (19), (22), (25) gives: % 47.87/7.22 | | (27) aInteger0(all_22_1) % 47.87/7.22 | | % 47.87/7.22 | | GROUND_INST: instantiating (mAddComm) with xb, all_22_0, all_22_1, % 47.87/7.22 | | simplifying with (6), (13), (19), (22), (25) gives: % 47.87/7.22 | | (28) sdtpldt0(all_22_0, xb) = all_22_1 & $i(all_22_1) % 47.87/7.22 | | % 47.87/7.22 | | ALPHA: (28) implies: % 47.87/7.22 | | (29) $i(all_22_1) % 47.87/7.22 | | % 47.87/7.22 | | GROUND_INST: instantiating (1) with all_22_1, xq, all_22_2, simplifying with % 47.87/7.22 | | (7), (14), (18), (23), (26), (27), (29) gives: % 47.87/7.22 | | (30) xq = sz00 | aDivisorOf0(xq, all_22_1) % 47.87/7.22 | | % 47.87/7.22 | | BETA: splitting (30) gives: % 47.87/7.22 | | % 47.87/7.22 | | Case 1: % 47.87/7.22 | | | % 47.87/7.22 | | | (31) aDivisorOf0(xq, all_22_1) % 47.87/7.22 | | | % 47.87/7.22 | | | GROUND_INST: instantiating (2) with xb, xa, xq, all_22_0, all_22_1, % 47.87/7.22 | | | simplifying with (5), (6), (7), (11), (12), (13), (14), (20), % 47.87/7.22 | | | (22), (31) gives: % 47.87/7.22 | | | (32) xq = sz00 % 47.87/7.22 | | | % 47.87/7.22 | | | REDUCE: (4), (32) imply: % 47.87/7.22 | | | (33) $false % 47.87/7.22 | | | % 47.87/7.22 | | | CLOSE: (33) is inconsistent. % 47.87/7.22 | | | % 47.87/7.22 | | Case 2: % 47.87/7.22 | | | % 47.87/7.22 | | | (34) xq = sz00 % 47.87/7.22 | | | % 47.87/7.22 | | | REDUCE: (4), (34) imply: % 47.87/7.22 | | | (35) $false % 47.87/7.22 | | | % 47.87/7.22 | | | CLOSE: (35) is inconsistent. % 47.87/7.22 | | | % 47.87/7.22 | | End of split % 47.87/7.22 | | % 47.87/7.22 | Case 2: % 47.87/7.22 | | % 47.87/7.22 | | (36) xq = sz00 % 47.87/7.22 | | % 47.87/7.22 | | REDUCE: (4), (36) imply: % 47.87/7.22 | | (37) $false % 47.87/7.22 | | % 47.87/7.22 | | CLOSE: (37) is inconsistent. % 47.87/7.22 | | % 47.87/7.22 | End of split % 47.87/7.22 | % 47.87/7.22 End of proof % 47.87/7.22 % SZS output end Proof for theBenchmark % 47.87/7.22 % 47.87/7.22 6609ms %------------------------------------------------------------------------------