%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM839+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 : n010.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:50:18 EDT 2023 % Result : Theorem 8.15s 1.91s % Output : Proof 9.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.14 % Problem : NUM839+1 : TPTP v8.1.2. Released v4.1.0. % 0.00/0.15 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.37 % Computer : n010.cluster.edu % 0.14/0.37 % Model : x86_64 x86_64 % 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.37 % Memory : 8042.1875MB % 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.37 % CPULimit : 300 % 0.14/0.37 % WCLimit : 300 % 0.14/0.37 % DateTime : Fri Aug 25 11:52:35 EDT 2023 % 0.14/0.37 % CPUTime : % 0.22/0.65 ________ _____ % 0.22/0.65 ___ __ \_________(_)________________________________ % 0.22/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.65 % 0.22/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.65 (2023-06-19) % 0.22/0.65 % 0.22/0.65 (c) Philipp Rümmer, 2009-2023 % 0.22/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.65 Amanda Stjerna. % 0.22/0.65 Free software under BSD-3-Clause. % 0.22/0.65 % 0.22/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.65 % 0.22/0.65 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.22/0.66 Running up to 7 provers in parallel. % 0.22/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.22/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.22/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 2.47/1.18 Prover 1: Preprocessing ... % 2.47/1.18 Prover 4: Preprocessing ... % 3.34/1.22 Prover 0: Preprocessing ... % 3.34/1.22 Prover 6: Preprocessing ... % 3.34/1.22 Prover 3: Preprocessing ... % 3.34/1.22 Prover 5: Preprocessing ... % 3.34/1.22 Prover 2: Preprocessing ... % 6.39/1.67 Prover 1: Warning: ignoring some quantifiers % 6.39/1.68 Prover 5: Proving ... % 6.39/1.69 Prover 1: Constructing countermodel ... % 6.39/1.69 Prover 3: Warning: ignoring some quantifiers % 6.39/1.69 Prover 6: Proving ... % 6.39/1.70 Prover 3: Constructing countermodel ... % 6.94/1.73 Prover 2: Proving ... % 6.94/1.73 Prover 4: Warning: ignoring some quantifiers % 7.33/1.79 Prover 4: Constructing countermodel ... % 7.33/1.81 Prover 0: Proving ... % 8.15/1.90 Prover 3: proved (1231ms) % 8.15/1.90 % 8.15/1.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.15/1.91 % 8.15/1.92 Prover 0: stopped % 8.15/1.92 Prover 2: stopped % 8.15/1.92 Prover 5: stopped % 8.45/1.93 Prover 6: stopped % 8.45/1.93 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.45/1.93 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.45/1.93 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.45/1.93 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.45/1.93 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.55/2.01 Prover 11: Preprocessing ... % 9.05/2.01 Prover 10: Preprocessing ... % 9.05/2.01 Prover 7: Preprocessing ... % 9.05/2.03 Prover 1: Found proof (size 42) % 9.05/2.03 Prover 1: proved (1358ms) % 9.05/2.03 Prover 4: stopped % 9.05/2.03 Prover 13: Preprocessing ... % 9.05/2.05 Prover 8: Preprocessing ... % 9.05/2.05 Prover 10: stopped % 9.05/2.05 Prover 7: stopped % 9.43/2.07 Prover 11: stopped % 9.43/2.08 Prover 13: stopped % 9.43/2.14 Prover 8: Warning: ignoring some quantifiers % 9.43/2.15 Prover 8: Constructing countermodel ... % 9.43/2.16 Prover 8: stopped % 9.43/2.16 % 9.43/2.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.43/2.16 % 9.43/2.17 % SZS output start Proof for theBenchmark % 9.43/2.17 Assumptions after simplification: % 9.43/2.17 --------------------------------- % 9.43/2.17 % 9.43/2.17 (ass(cond(140, 0), 0)) % 9.43/2.20 ! [v0: $i] : ! [v1: $i] : ( ~ (greater(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) % 9.43/2.20 | less(v1, v0) = 0) % 9.43/2.20 % 9.43/2.20 (ass(cond(147, 0), 0)) % 9.43/2.20 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (greater(v1, v0) = v2) % 9.43/2.20 | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & less(v0, v1) = v3)) % 9.43/2.20 % 9.43/2.20 (ass(cond(61, 0), 0)) % 9.43/2.20 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (vplus(v0, v1) = v2) | ~ $i(v1) % 9.43/2.20 | ~ $i(v0) | (vplus(v1, v0) = v2 & $i(v2))) % 9.43/2.20 % 9.43/2.20 (ass(cond(goal(130), 0), 0)) % 9.43/2.20 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | v1 = v0 | ~ (greater(v0, % 9.43/2.20 v1) = v2) | ~ $i(v1) | ~ $i(v0) | less(v0, v1) = 0) % 9.43/2.20 % 9.43/2.20 (ass(cond(goal(130), 0), 2)) % 9.43/2.21 ! [v0: $i] : ! [v1: $i] : ( ~ (greater(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) % 9.43/2.21 | ? [v2: int] : ( ~ (v2 = 0) & less(v0, v1) = v2)) % 9.43/2.21 % 9.43/2.21 (ass(cond(goal(193), 0), 0)) % 9.43/2.21 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 9.43/2.21 int] : (v5 = 0 | ~ (less(v3, v4) = v5) | ~ (vplus(v1, v2) = v4) | ~ % 9.43/2.21 (vplus(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: int] : ( % 9.43/2.21 ~ (v6 = 0) & less(v0, v1) = v6)) % 9.43/2.21 % 9.43/2.21 (holds(antec(204), 331, 0)) % 9.43/2.21 $i(vd330) & $i(vd329) & $i(vd328) & ? [v0: $i] : ? [v1: $i] : (vplus(vd329, % 9.43/2.21 vd330) = v1 & vplus(vd328, vd330) = v0 & greater(v0, v1) = 0 & $i(v1) & % 9.43/2.21 $i(v0)) % 9.43/2.21 % 9.43/2.21 (holds(conseq(204), 332, 0)) % 9.43/2.21 $i(vd329) & $i(vd328) & ? [v0: int] : ( ~ (v0 = 0) & greater(vd328, vd329) = % 9.43/2.21 v0) % 9.43/2.21 % 9.43/2.21 (function-axioms) % 9.43/2.22 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 9.43/2.22 [v3: $i] : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0: % 9.43/2.22 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 9.43/2.22 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 9.43/2.22 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 9.43/2.22 : (v1 = v0 | ~ (less(v3, v2) = v1) | ~ (less(v3, v2) = v0)) & ! [v0: $i] : % 9.43/2.22 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (vplus(v3, v2) = v1) | % 9.43/2.22 ~ (vplus(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 9.43/2.22 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (greater(v3, % 9.43/2.22 v2) = v1) | ~ (greater(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 9.43/2.22 [v2: $i] : (v1 = v0 | ~ (vskolem2(v2) = v1) | ~ (vskolem2(v2) = v0)) & ! % 9.43/2.22 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (vsucc(v2) = v1) | ~ % 9.43/2.22 (vsucc(v2) = v0)) % 9.43/2.22 % 9.43/2.22 Further assumptions not needed in the proof: % 9.43/2.22 -------------------------------------------- % 9.43/2.22 ass(cond(12, 0), 0), ass(cond(158, 0), 0), ass(cond(163, 0), 0), ass(cond(168, % 9.43/2.22 0), 0), ass(cond(184, 0), 0), ass(cond(189, 0), 0), ass(cond(20, 0), 0), % 9.43/2.22 ass(cond(33, 0), 0), ass(cond(43, 0), 0), ass(cond(52, 0), 0), ass(cond(6, 0), % 9.43/2.22 0), ass(cond(73, 0), 0), ass(cond(81, 0), 0), ass(cond(goal(130), 0), 1), % 9.43/2.22 ass(cond(goal(130), 0), 3), ass(cond(goal(177), 0), 0), ass(cond(goal(193), 0), % 9.43/2.22 1), ass(cond(goal(193), 0), 2), ass(cond(goal(88), 0), 0), ass(cond(goal(88), % 9.43/2.22 0), 1), ass(cond(goal(88), 0), 2), ass(cond(goal(88), 0), 3), % 9.43/2.22 def(cond(conseq(axiom(3)), 11), 1), def(cond(conseq(axiom(3)), 12), 1), % 9.43/2.22 def(cond(conseq(axiom(3)), 16), 1), def(cond(conseq(axiom(3)), 17), 1), % 9.43/2.22 qu(antec(axiom(3)), imp(antec(axiom(3)))), qu(cond(conseq(axiom(3)), 3), % 9.43/2.22 and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0))), % 9.43/2.22 qu(restrictor(axiom(1)), holds(scope(axiom(1)), 2, 0)) % 9.43/2.22 % 9.43/2.22 Those formulas are unsatisfiable: % 9.43/2.22 --------------------------------- % 9.43/2.22 % 9.43/2.22 Begin of proof % 9.43/2.22 | % 9.43/2.22 | ALPHA: (holds(antec(204), 331, 0)) implies: % 9.43/2.22 | (1) $i(vd330) % 9.43/2.22 | (2) ? [v0: $i] : ? [v1: $i] : (vplus(vd329, vd330) = v1 & vplus(vd328, % 9.43/2.22 | vd330) = v0 & greater(v0, v1) = 0 & $i(v1) & $i(v0)) % 9.43/2.22 | % 9.43/2.22 | ALPHA: (holds(conseq(204), 332, 0)) implies: % 9.43/2.22 | (3) $i(vd328) % 9.43/2.22 | (4) $i(vd329) % 9.43/2.23 | (5) ? [v0: int] : ( ~ (v0 = 0) & greater(vd328, vd329) = v0) % 9.43/2.23 | % 9.43/2.23 | ALPHA: (function-axioms) implies: % 9.43/2.23 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 9.43/2.23 | (vplus(v3, v2) = v1) | ~ (vplus(v3, v2) = v0)) % 9.43/2.23 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 9.43/2.23 | ! [v3: $i] : (v1 = v0 | ~ (less(v3, v2) = v1) | ~ (less(v3, v2) = % 9.43/2.23 | v0)) % 9.43/2.23 | % 9.43/2.23 | DELTA: instantiating (5) with fresh symbol all_33_0 gives: % 9.43/2.23 | (8) ~ (all_33_0 = 0) & greater(vd328, vd329) = all_33_0 % 9.43/2.23 | % 9.43/2.23 | ALPHA: (8) implies: % 9.43/2.23 | (9) ~ (all_33_0 = 0) % 9.43/2.23 | (10) greater(vd328, vd329) = all_33_0 % 9.43/2.23 | % 9.43/2.23 | DELTA: instantiating (2) with fresh symbols all_39_0, all_39_1 gives: % 9.43/2.23 | (11) vplus(vd329, vd330) = all_39_0 & vplus(vd328, vd330) = all_39_1 & % 9.43/2.23 | greater(all_39_1, all_39_0) = 0 & $i(all_39_0) & $i(all_39_1) % 9.43/2.23 | % 9.43/2.23 | ALPHA: (11) implies: % 9.43/2.23 | (12) $i(all_39_1) % 9.43/2.23 | (13) $i(all_39_0) % 9.43/2.23 | (14) greater(all_39_1, all_39_0) = 0 % 9.43/2.23 | (15) vplus(vd328, vd330) = all_39_1 % 9.43/2.23 | (16) vplus(vd329, vd330) = all_39_0 % 9.43/2.23 | % 9.43/2.23 | GROUND_INST: instantiating (ass(cond(goal(130), 0), 0)) with vd328, vd329, % 9.43/2.23 | all_33_0, simplifying with (3), (4), (10) gives: % 9.43/2.24 | (17) all_33_0 = 0 | vd329 = vd328 | less(vd328, vd329) = 0 % 9.43/2.24 | % 9.43/2.24 | GROUND_INST: instantiating (ass(cond(147, 0), 0)) with vd329, vd328, all_33_0, % 9.43/2.24 | simplifying with (3), (4), (10) gives: % 9.43/2.24 | (18) all_33_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & less(vd329, vd328) = v0) % 9.43/2.24 | % 9.43/2.24 | GROUND_INST: instantiating (ass(cond(140, 0), 0)) with all_39_1, all_39_0, % 9.43/2.24 | simplifying with (12), (13), (14) gives: % 9.43/2.24 | (19) less(all_39_0, all_39_1) = 0 % 9.43/2.24 | % 9.43/2.24 | GROUND_INST: instantiating (ass(cond(goal(130), 0), 2)) with all_39_1, % 9.43/2.24 | all_39_0, simplifying with (12), (13), (14) gives: % 9.43/2.24 | (20) ? [v0: int] : ( ~ (v0 = 0) & less(all_39_1, all_39_0) = v0) % 9.43/2.24 | % 9.43/2.24 | GROUND_INST: instantiating (ass(cond(61, 0), 0)) with vd328, vd330, all_39_1, % 9.43/2.24 | simplifying with (1), (3), (15) gives: % 9.43/2.24 | (21) vplus(vd330, vd328) = all_39_1 & $i(all_39_1) % 9.43/2.24 | % 9.43/2.24 | ALPHA: (21) implies: % 9.43/2.24 | (22) vplus(vd330, vd328) = all_39_1 % 9.43/2.24 | % 9.43/2.24 | GROUND_INST: instantiating (ass(cond(61, 0), 0)) with vd329, vd330, all_39_0, % 9.43/2.24 | simplifying with (1), (4), (16) gives: % 9.43/2.24 | (23) vplus(vd330, vd329) = all_39_0 & $i(all_39_0) % 9.43/2.24 | % 9.43/2.24 | ALPHA: (23) implies: % 9.43/2.24 | (24) vplus(vd330, vd329) = all_39_0 % 9.43/2.24 | % 9.43/2.24 | DELTA: instantiating (20) with fresh symbol all_52_0 gives: % 9.43/2.24 | (25) ~ (all_52_0 = 0) & less(all_39_1, all_39_0) = all_52_0 % 9.43/2.24 | % 9.43/2.24 | ALPHA: (25) implies: % 9.43/2.24 | (26) ~ (all_52_0 = 0) % 9.43/2.24 | (27) less(all_39_1, all_39_0) = all_52_0 % 9.43/2.24 | % 9.43/2.24 | BETA: splitting (18) gives: % 9.43/2.24 | % 9.43/2.24 | Case 1: % 9.43/2.24 | | % 9.43/2.24 | | (28) all_33_0 = 0 % 9.43/2.24 | | % 9.43/2.24 | | REDUCE: (9), (28) imply: % 9.43/2.24 | | (29) $false % 9.43/2.24 | | % 9.43/2.24 | | CLOSE: (29) is inconsistent. % 9.43/2.24 | | % 9.43/2.24 | Case 2: % 9.43/2.24 | | % 9.43/2.24 | | % 9.43/2.24 | | GROUND_INST: instantiating (ass(cond(goal(193), 0), 0)) with vd328, vd329, % 9.43/2.25 | | vd330, all_39_1, all_39_0, all_52_0, simplifying with (1), (3), % 9.43/2.25 | | (4), (15), (16), (27) gives: % 9.43/2.25 | | (30) all_52_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & less(vd328, vd329) = % 9.43/2.25 | | v0) % 9.43/2.25 | | % 9.43/2.25 | | BETA: splitting (30) gives: % 9.43/2.25 | | % 9.43/2.25 | | Case 1: % 9.43/2.25 | | | % 9.43/2.25 | | | (31) all_52_0 = 0 % 9.43/2.25 | | | % 9.43/2.25 | | | REDUCE: (26), (31) imply: % 9.43/2.25 | | | (32) $false % 9.43/2.25 | | | % 9.43/2.25 | | | CLOSE: (32) is inconsistent. % 9.43/2.25 | | | % 9.43/2.25 | | Case 2: % 9.43/2.25 | | | % 9.43/2.25 | | | (33) ? [v0: int] : ( ~ (v0 = 0) & less(vd328, vd329) = v0) % 9.43/2.25 | | | % 9.43/2.25 | | | DELTA: instantiating (33) with fresh symbol all_88_0 gives: % 9.43/2.25 | | | (34) ~ (all_88_0 = 0) & less(vd328, vd329) = all_88_0 % 9.43/2.25 | | | % 9.43/2.25 | | | ALPHA: (34) implies: % 9.43/2.25 | | | (35) ~ (all_88_0 = 0) % 9.43/2.25 | | | (36) less(vd328, vd329) = all_88_0 % 9.43/2.25 | | | % 9.43/2.25 | | | BETA: splitting (17) gives: % 9.43/2.25 | | | % 9.43/2.25 | | | Case 1: % 9.43/2.25 | | | | % 9.43/2.25 | | | | (37) less(vd328, vd329) = 0 % 9.43/2.25 | | | | % 9.43/2.25 | | | | GROUND_INST: instantiating (7) with 0, all_88_0, vd329, vd328, % 9.43/2.25 | | | | simplifying with (36), (37) gives: % 9.43/2.25 | | | | (38) all_88_0 = 0 % 9.43/2.25 | | | | % 9.43/2.25 | | | | REDUCE: (35), (38) imply: % 9.43/2.25 | | | | (39) $false % 9.43/2.25 | | | | % 9.43/2.25 | | | | CLOSE: (39) is inconsistent. % 9.43/2.25 | | | | % 9.43/2.25 | | | Case 2: % 9.43/2.25 | | | | % 9.43/2.25 | | | | (40) all_33_0 = 0 | vd329 = vd328 % 9.43/2.25 | | | | % 9.43/2.25 | | | | BETA: splitting (40) gives: % 9.43/2.25 | | | | % 9.43/2.25 | | | | Case 1: % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | (41) all_33_0 = 0 % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | REDUCE: (9), (41) imply: % 9.43/2.25 | | | | | (42) $false % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | CLOSE: (42) is inconsistent. % 9.43/2.25 | | | | | % 9.43/2.25 | | | | Case 2: % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | (43) vd329 = vd328 % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | REDUCE: (24), (43) imply: % 9.43/2.25 | | | | | (44) vplus(vd330, vd328) = all_39_0 % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | GROUND_INST: instantiating (6) with all_39_1, all_39_0, vd328, vd330, % 9.43/2.25 | | | | | simplifying with (22), (44) gives: % 9.43/2.25 | | | | | (45) all_39_0 = all_39_1 % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | REDUCE: (19), (45) imply: % 9.43/2.25 | | | | | (46) less(all_39_1, all_39_1) = 0 % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | REDUCE: (27), (45) imply: % 9.43/2.25 | | | | | (47) less(all_39_1, all_39_1) = all_52_0 % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | GROUND_INST: instantiating (7) with 0, all_52_0, all_39_1, all_39_1, % 9.43/2.25 | | | | | simplifying with (46), (47) gives: % 9.43/2.25 | | | | | (48) all_52_0 = 0 % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | REDUCE: (26), (48) imply: % 9.43/2.25 | | | | | (49) $false % 9.43/2.25 | | | | | % 9.43/2.25 | | | | | CLOSE: (49) is inconsistent. % 9.43/2.25 | | | | | % 9.43/2.25 | | | | End of split % 9.43/2.25 | | | | % 9.43/2.25 | | | End of split % 9.43/2.25 | | | % 9.43/2.25 | | End of split % 9.43/2.25 | | % 9.43/2.25 | End of split % 9.43/2.25 | % 9.43/2.25 End of proof % 9.43/2.25 % SZS output end Proof for theBenchmark % 9.43/2.25 % 9.43/2.25 1604ms %------------------------------------------------------------------------------