%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : NUM906_1 : TPTP v8.1.2. Released v5.0.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 11:50:39 EDT 2023 % Result : Theorem 6.66s 1.62s % Output : Proof 8.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : NUM906_1 : TPTP v8.1.2. Released v5.0.0. % 0.10/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n011.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Fri Aug 25 11:03:38 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.67/0.92 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.67/0.92 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.67/0.92 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.67/0.92 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.67/0.92 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.67/0.92 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.67/0.92 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 2.12/1.01 Prover 4: Preprocessing ... % 2.12/1.01 Prover 1: Preprocessing ... % 2.12/1.05 Prover 6: Preprocessing ... % 2.12/1.05 Prover 5: Preprocessing ... % 2.12/1.05 Prover 2: Preprocessing ... % 2.12/1.05 Prover 3: Preprocessing ... % 2.12/1.06 Prover 0: Preprocessing ... % 4.38/1.41 Prover 5: Proving ... % 4.38/1.43 Prover 1: Constructing countermodel ... % 5.38/1.45 Prover 6: Constructing countermodel ... % 5.50/1.47 Prover 3: Constructing countermodel ... % 5.50/1.47 Prover 2: Proving ... % 5.71/1.49 Prover 4: Constructing countermodel ... % 6.00/1.52 Prover 0: Proving ... % 6.66/1.62 Prover 3: proved (995ms) % 6.66/1.62 % 6.66/1.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.66/1.62 % 6.66/1.62 Prover 6: stopped % 6.66/1.62 Prover 0: stopped % 6.66/1.62 Prover 2: stopped % 6.66/1.63 Prover 5: stopped % 6.66/1.63 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.66/1.63 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.66/1.63 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 6.66/1.63 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.66/1.63 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.66/1.63 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 6.66/1.63 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.66/1.63 Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation % 6.66/1.64 Prover 13: Warning: Problem contains rationals, using incomplete axiomatisation % 6.66/1.64 Prover 10: Preprocessing ... % 6.66/1.64 Prover 8: Preprocessing ... % 6.66/1.64 Prover 13: Preprocessing ... % 6.66/1.64 Prover 7: Preprocessing ... % 6.66/1.65 Prover 11: Warning: Problem contains rationals, using incomplete axiomatisation % 6.66/1.66 Prover 11: Preprocessing ... % 7.06/1.73 Prover 13: Warning: ignoring some quantifiers % 7.06/1.73 Prover 1: Found proof (size 30) % 7.06/1.73 Prover 1: proved (1111ms) % 7.06/1.73 Prover 4: stopped % 7.06/1.73 Prover 13: Constructing countermodel ... % 7.06/1.73 Prover 10: Warning: ignoring some quantifiers % 7.06/1.74 Prover 10: Constructing countermodel ... % 7.06/1.74 Prover 13: stopped % 7.06/1.74 Prover 10: stopped % 7.06/1.75 Prover 7: Warning: ignoring some quantifiers % 7.06/1.75 Prover 7: Constructing countermodel ... % 7.68/1.76 Prover 7: stopped % 7.68/1.77 Prover 8: Warning: ignoring some quantifiers % 7.84/1.78 Prover 8: Constructing countermodel ... % 7.84/1.79 Prover 8: stopped % 7.84/1.79 Prover 11: Constructing countermodel ... % 7.84/1.80 Prover 11: stopped % 7.84/1.80 % 7.84/1.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.84/1.80 % 7.84/1.81 % SZS output start Proof for theBenchmark % 7.84/1.81 Assumptions after simplification: % 7.84/1.81 --------------------------------- % 7.84/1.81 % 7.84/1.81 (rat_combined_problem_1) % 8.06/1.84 ? [v0: $rat] : ? [v1: $rat] : ? [v2: any] : ? [v3: any] : (rat_$lesseq(v0, % 8.06/1.84 v1) = v2 & rat_$less(v0, v1) = v3 & ((v2 = 0 & ~ (v3 = 0) & ~ (v1 = v0)) % 8.06/1.84 | ( ~ (v2 = 0) & (v3 = 0 | v1 = v0)))) % 8.06/1.84 % 8.06/1.84 (input) % 8.14/1.86 ~ (rat_very_large = rat_very_small) & ~ (rat_very_large = rat_0) & ~ % 8.14/1.86 (rat_very_small = rat_0) & rat_$is_int(rat_0) = 0 & rat_$is_rat(rat_0) = 0 & % 8.14/1.86 rat_$floor(rat_0) = rat_0 & rat_$ceiling(rat_0) = rat_0 & rat_$truncate(rat_0) % 8.14/1.86 = rat_0 & rat_$round(rat_0) = rat_0 & rat_$to_int(rat_0) = 0 & % 8.14/1.86 rat_$to_rat(rat_0) = rat_0 & rat_$to_real(rat_0) = real_0 & int_$to_rat(0) = % 8.14/1.86 rat_0 & rat_$product(rat_0, rat_0) = rat_0 & rat_$difference(rat_0, rat_0) = % 8.14/1.86 rat_0 & rat_$uminus(rat_0) = rat_0 & rat_$sum(rat_0, rat_0) = rat_0 & % 8.14/1.86 rat_$greatereq(rat_very_small, rat_very_large) = 1 & rat_$greatereq(rat_0, % 8.14/1.86 rat_0) = 0 & rat_$greater(rat_very_large, rat_0) = 0 & % 8.14/1.86 rat_$greater(rat_very_small, rat_very_large) = 1 & rat_$greater(rat_0, % 8.14/1.86 rat_very_small) = 0 & rat_$greater(rat_0, rat_0) = 1 & % 8.14/1.86 rat_$lesseq(rat_very_small, rat_very_large) = 0 & rat_$lesseq(rat_0, rat_0) = % 8.14/1.86 0 & rat_$less(rat_very_small, rat_very_large) = 0 & rat_$less(rat_very_small, % 8.14/1.86 rat_0) = 0 & rat_$less(rat_0, rat_very_large) = 0 & rat_$less(rat_0, rat_0) % 8.14/1.86 = 1 & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : ! [v4: % 8.14/1.86 $rat] : ( ~ (rat_$sum(v3, v0) = v4) | ~ (rat_$sum(v2, v1) = v3) | ? [v5: % 8.14/1.86 $rat] : (rat_$sum(v2, v5) = v4 & rat_$sum(v1, v0) = v5)) & ! [v0: $rat] : % 8.14/1.86 ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v3 = v1 | v0 = rat_0 | ~ % 8.14/1.86 (rat_$quotient(v2, v0) = v3) | ~ (rat_$product(v1, v0) = v2)) & ! [v0: % 8.14/1.86 $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~ % 8.14/1.86 (rat_$lesseq(v2, v0) = v3) | ~ (rat_$lesseq(v1, v0) = 0) | ? [v4: int] : ( % 8.14/1.86 ~ (v4 = 0) & rat_$lesseq(v2, v1) = v4)) & ! [v0: $rat] : ! [v1: $rat] : % 8.14/1.86 ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~ (rat_$lesseq(v1, v0) = 0) | ~ % 8.14/1.86 (rat_$less(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) & rat_$less(v2, v1) = % 8.14/1.86 v4)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : ( ~ % 8.14/1.86 (rat_$uminus(v0) = v2) | ~ (rat_$sum(v1, v2) = v3) | rat_$difference(v1, % 8.14/1.86 v0) = v3) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : (v2 = rat_0 | % 8.14/1.86 ~ (rat_$uminus(v0) = v1) | ~ (rat_$sum(v0, v1) = v2)) & ! [v0: $rat] : ! % 8.14/1.86 [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ (rat_$greatereq(v0, v1) = v2) | ? % 8.14/1.86 [v3: int] : ( ~ (v3 = 0) & rat_$lesseq(v1, v0) = v3)) & ! [v0: $rat] : ! % 8.14/1.86 [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ (rat_$greater(v0, v1) = v2) | ? [v3: % 8.14/1.86 int] : ( ~ (v3 = 0) & rat_$less(v1, v0) = v3)) & ! [v0: $rat] : ! [v1: % 8.14/1.86 $rat] : ! [v2: int] : (v2 = 0 | ~ (rat_$lesseq(v1, v0) = v2) | ( ~ (v1 = % 8.14/1.86 v0) & ? [v3: int] : ( ~ (v3 = 0) & rat_$less(v1, v0) = v3))) & ! [v0: % 8.14/1.86 $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~ (rat_$product(v0, v1) = v2) | % 8.14/1.86 rat_$product(v1, v0) = v2) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : % 8.14/1.86 ( ~ (rat_$sum(v0, v1) = v2) | rat_$sum(v1, v0) = v2) & ! [v0: $rat] : ! [v1: % 8.14/1.86 $rat] : ! [v2: $rat] : ( ~ (rat_$lesseq(v2, v1) = 0) | ~ (rat_$less(v1, % 8.14/1.86 v0) = 0) | rat_$less(v2, v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : (v1 % 8.14/1.86 = v0 | ~ (rat_$sum(v0, rat_0) = v1)) & ! [v0: $rat] : ! [v1: $rat] : (v1 % 8.14/1.86 = v0 | ~ (rat_$lesseq(v1, v0) = 0) | rat_$less(v1, v0) = 0) & ! [v0: $rat] % 8.14/1.86 : ! [v1: $rat] : ( ~ (rat_$uminus(v0) = v1) | rat_$uminus(v1) = v0) & ! [v0: % 8.14/1.86 $rat] : ! [v1: $rat] : ( ~ (rat_$greatereq(v0, v1) = 0) | rat_$lesseq(v1, % 8.14/1.86 v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : ( ~ (rat_$greater(v0, v1) = 0) % 8.14/1.86 | rat_$less(v1, v0) = 0) & ! [v0: $rat] : (v0 = rat_0 | ~ (rat_$uminus(v0) % 8.14/1.86 = v0)) % 8.14/1.86 % 8.14/1.86 (function-axioms) % 8.14/1.87 ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~ % 8.14/1.87 (rat_$quotient(v3, v2) = v1) | ~ (rat_$quotient(v3, v2) = v0)) & ! [v0: % 8.14/1.87 $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~ % 8.14/1.87 (rat_$product(v3, v2) = v1) | ~ (rat_$product(v3, v2) = v0)) & ! [v0: % 8.14/1.87 $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~ % 8.14/1.87 (rat_$difference(v3, v2) = v1) | ~ (rat_$difference(v3, v2) = v0)) & ! % 8.14/1.87 [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~ % 8.14/1.87 (rat_$sum(v3, v2) = v1) | ~ (rat_$sum(v3, v2) = v0)) & ! [v0: % 8.14/1.87 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $rat] : ! [v3: % 8.14/1.87 $rat] : (v1 = v0 | ~ (rat_$greatereq(v3, v2) = v1) | ~ (rat_$greatereq(v3, % 8.14/1.87 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 8.14/1.87 ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~ (rat_$greater(v3, v2) = v1) | ~ % 8.14/1.87 (rat_$greater(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.14/1.87 MultipleValueBool] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~ % 8.14/1.87 (rat_$lesseq(v3, v2) = v1) | ~ (rat_$lesseq(v3, v2) = v0)) & ! [v0: % 8.14/1.87 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $rat] : ! [v3: % 8.14/1.87 $rat] : (v1 = v0 | ~ (rat_$less(v3, v2) = v1) | ~ (rat_$less(v3, v2) = % 8.14/1.87 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 8.14/1.87 $rat] : (v1 = v0 | ~ (rat_$is_int(v2) = v1) | ~ (rat_$is_int(v2) = v0)) & % 8.14/1.87 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $rat] : (v1 = % 8.14/1.87 v0 | ~ (rat_$is_rat(v2) = v1) | ~ (rat_$is_rat(v2) = v0)) & ! [v0: $rat] % 8.14/1.87 : ! [v1: $rat] : ! [v2: $rat] : (v1 = v0 | ~ (rat_$floor(v2) = v1) | ~ % 8.14/1.87 (rat_$floor(v2) = v0)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : (v1 % 8.14/1.87 = v0 | ~ (rat_$ceiling(v2) = v1) | ~ (rat_$ceiling(v2) = v0)) & ! [v0: % 8.14/1.87 $rat] : ! [v1: $rat] : ! [v2: $rat] : (v1 = v0 | ~ (rat_$truncate(v2) = % 8.14/1.87 v1) | ~ (rat_$truncate(v2) = v0)) & ! [v0: $rat] : ! [v1: $rat] : ! % 8.14/1.87 [v2: $rat] : (v1 = v0 | ~ (rat_$round(v2) = v1) | ~ (rat_$round(v2) = v0)) & % 8.14/1.87 ! [v0: int] : ! [v1: int] : ! [v2: $rat] : (v1 = v0 | ~ (rat_$to_int(v2) = % 8.14/1.87 v1) | ~ (rat_$to_int(v2) = v0)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: % 8.14/1.87 $rat] : (v1 = v0 | ~ (rat_$to_rat(v2) = v1) | ~ (rat_$to_rat(v2) = v0)) & % 8.14/1.87 ! [v0: $real] : ! [v1: $real] : ! [v2: $rat] : (v1 = v0 | ~ % 8.14/1.87 (rat_$to_real(v2) = v1) | ~ (rat_$to_real(v2) = v0)) & ! [v0: $rat] : ! % 8.14/1.87 [v1: $rat] : ! [v2: int] : (v1 = v0 | ~ (int_$to_rat(v2) = v1) | ~ % 8.14/1.87 (int_$to_rat(v2) = v0)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : % 8.14/1.87 (v1 = v0 | ~ (rat_$uminus(v2) = v1) | ~ (rat_$uminus(v2) = v0)) % 8.14/1.87 % 8.14/1.87 Those formulas are unsatisfiable: % 8.14/1.87 --------------------------------- % 8.14/1.87 % 8.14/1.87 Begin of proof % 8.14/1.87 | % 8.14/1.87 | ALPHA: (function-axioms) implies: % 8.14/1.87 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $rat] % 8.14/1.87 | : ! [v3: $rat] : (v1 = v0 | ~ (rat_$less(v3, v2) = v1) | ~ % 8.14/1.87 | (rat_$less(v3, v2) = v0)) % 8.14/1.87 | % 8.14/1.87 | ALPHA: (input) implies: % 8.14/1.87 | (2) ! [v0: $rat] : ! [v1: $rat] : (v1 = v0 | ~ (rat_$lesseq(v1, v0) = 0) % 8.14/1.87 | | rat_$less(v1, v0) = 0) % 8.14/1.87 | (3) ! [v0: $rat] : ! [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ % 8.14/1.87 | (rat_$lesseq(v1, v0) = v2) | ( ~ (v1 = v0) & ? [v3: int] : ( ~ (v3 = % 8.14/1.87 | 0) & rat_$less(v1, v0) = v3))) % 8.14/1.87 | % 8.14/1.87 | DELTA: instantiating (rat_combined_problem_1) with fresh symbols all_5_0, % 8.14/1.87 | all_5_1, all_5_2, all_5_3 gives: % 8.14/1.88 | (4) rat_$lesseq(all_5_3, all_5_2) = all_5_1 & rat_$less(all_5_3, all_5_2) = % 8.14/1.88 | all_5_0 & ((all_5_1 = 0 & ~ (all_5_0 = 0) & ~ (all_5_2 = all_5_3)) | % 8.14/1.88 | ( ~ (all_5_1 = 0) & (all_5_0 = 0 | all_5_2 = all_5_3))) % 8.14/1.88 | % 8.14/1.88 | ALPHA: (4) implies: % 8.14/1.88 | (5) rat_$less(all_5_3, all_5_2) = all_5_0 % 8.14/1.88 | (6) rat_$lesseq(all_5_3, all_5_2) = all_5_1 % 8.14/1.88 | (7) (all_5_1 = 0 & ~ (all_5_0 = 0) & ~ (all_5_2 = all_5_3)) | ( ~ % 8.14/1.88 | (all_5_1 = 0) & (all_5_0 = 0 | all_5_2 = all_5_3)) % 8.14/1.88 | % 8.14/1.88 | GROUND_INST: instantiating (3) with all_5_2, all_5_3, all_5_1, simplifying % 8.14/1.88 | with (6) gives: % 8.14/1.88 | (8) all_5_1 = 0 | ( ~ (all_5_2 = all_5_3) & ? [v0: int] : ( ~ (v0 = 0) & % 8.14/1.88 | rat_$less(all_5_3, all_5_2) = v0)) % 8.14/1.88 | % 8.14/1.88 | BETA: splitting (7) gives: % 8.14/1.88 | % 8.14/1.88 | Case 1: % 8.14/1.88 | | % 8.14/1.88 | | (9) all_5_1 = 0 & ~ (all_5_0 = 0) & ~ (all_5_2 = all_5_3) % 8.14/1.88 | | % 8.14/1.88 | | ALPHA: (9) implies: % 8.14/1.88 | | (10) all_5_1 = 0 % 8.14/1.88 | | (11) ~ (all_5_2 = all_5_3) % 8.14/1.88 | | (12) ~ (all_5_0 = 0) % 8.14/1.88 | | % 8.14/1.88 | | REDUCE: (6), (10) imply: % 8.14/1.88 | | (13) rat_$lesseq(all_5_3, all_5_2) = 0 % 8.14/1.88 | | % 8.14/1.88 | | GROUND_INST: instantiating (2) with all_5_2, all_5_3, simplifying with (13) % 8.14/1.88 | | gives: % 8.14/1.88 | | (14) all_5_2 = all_5_3 | rat_$less(all_5_3, all_5_2) = 0 % 8.14/1.88 | | % 8.14/1.88 | | BETA: splitting (14) gives: % 8.14/1.88 | | % 8.14/1.88 | | Case 1: % 8.14/1.88 | | | % 8.14/1.88 | | | (15) rat_$less(all_5_3, all_5_2) = 0 % 8.14/1.88 | | | % 8.14/1.88 | | | GROUND_INST: instantiating (1) with all_5_0, 0, all_5_2, all_5_3, % 8.14/1.88 | | | simplifying with (5), (15) gives: % 8.14/1.88 | | | (16) all_5_0 = 0 % 8.14/1.88 | | | % 8.14/1.88 | | | REDUCE: (12), (16) imply: % 8.14/1.88 | | | (17) $false % 8.14/1.88 | | | % 8.14/1.88 | | | CLOSE: (17) is inconsistent. % 8.14/1.88 | | | % 8.14/1.88 | | Case 2: % 8.14/1.88 | | | % 8.14/1.88 | | | (18) all_5_2 = all_5_3 % 8.14/1.88 | | | % 8.14/1.88 | | | REDUCE: (11), (18) imply: % 8.14/1.88 | | | (19) $false % 8.14/1.88 | | | % 8.14/1.88 | | | CLOSE: (19) is inconsistent. % 8.14/1.88 | | | % 8.14/1.88 | | End of split % 8.14/1.88 | | % 8.14/1.88 | Case 2: % 8.14/1.88 | | % 8.14/1.88 | | (20) ~ (all_5_1 = 0) & (all_5_0 = 0 | all_5_2 = all_5_3) % 8.14/1.88 | | % 8.14/1.88 | | ALPHA: (20) implies: % 8.14/1.88 | | (21) ~ (all_5_1 = 0) % 8.14/1.88 | | (22) all_5_0 = 0 | all_5_2 = all_5_3 % 8.14/1.88 | | % 8.14/1.88 | | BETA: splitting (8) gives: % 8.14/1.88 | | % 8.14/1.88 | | Case 1: % 8.14/1.88 | | | % 8.14/1.88 | | | (23) all_5_1 = 0 % 8.14/1.88 | | | % 8.14/1.88 | | | REDUCE: (21), (23) imply: % 8.14/1.88 | | | (24) $false % 8.14/1.88 | | | % 8.14/1.88 | | | CLOSE: (24) is inconsistent. % 8.14/1.88 | | | % 8.14/1.88 | | Case 2: % 8.14/1.88 | | | % 8.14/1.89 | | | (25) ~ (all_5_2 = all_5_3) & ? [v0: int] : ( ~ (v0 = 0) & % 8.14/1.89 | | | rat_$less(all_5_3, all_5_2) = v0) % 8.14/1.89 | | | % 8.14/1.89 | | | ALPHA: (25) implies: % 8.14/1.89 | | | (26) ~ (all_5_2 = all_5_3) % 8.14/1.89 | | | (27) ? [v0: int] : ( ~ (v0 = 0) & rat_$less(all_5_3, all_5_2) = v0) % 8.14/1.89 | | | % 8.14/1.89 | | | DELTA: instantiating (27) with fresh symbol all_27_0 gives: % 8.14/1.89 | | | (28) ~ (all_27_0 = 0) & rat_$less(all_5_3, all_5_2) = all_27_0 % 8.14/1.89 | | | % 8.14/1.89 | | | ALPHA: (28) implies: % 8.14/1.89 | | | (29) ~ (all_27_0 = 0) % 8.14/1.89 | | | (30) rat_$less(all_5_3, all_5_2) = all_27_0 % 8.14/1.89 | | | % 8.14/1.89 | | | BETA: splitting (22) gives: % 8.14/1.89 | | | % 8.14/1.89 | | | Case 1: % 8.14/1.89 | | | | % 8.14/1.89 | | | | (31) all_5_0 = 0 % 8.14/1.89 | | | | % 8.14/1.89 | | | | REDUCE: (5), (31) imply: % 8.14/1.89 | | | | (32) rat_$less(all_5_3, all_5_2) = 0 % 8.14/1.89 | | | | % 8.14/1.89 | | | | GROUND_INST: instantiating (1) with 0, all_27_0, all_5_2, all_5_3, % 8.14/1.89 | | | | simplifying with (30), (32) gives: % 8.14/1.89 | | | | (33) all_27_0 = 0 % 8.14/1.89 | | | | % 8.14/1.89 | | | | REDUCE: (29), (33) imply: % 8.14/1.89 | | | | (34) $false % 8.14/1.89 | | | | % 8.14/1.89 | | | | CLOSE: (34) is inconsistent. % 8.14/1.89 | | | | % 8.14/1.89 | | | Case 2: % 8.14/1.89 | | | | % 8.14/1.89 | | | | (35) all_5_2 = all_5_3 % 8.14/1.89 | | | | % 8.14/1.89 | | | | REDUCE: (26), (35) imply: % 8.14/1.89 | | | | (36) $false % 8.14/1.89 | | | | % 8.14/1.89 | | | | CLOSE: (36) is inconsistent. % 8.14/1.89 | | | | % 8.14/1.89 | | | End of split % 8.14/1.89 | | | % 8.14/1.89 | | End of split % 8.14/1.89 | | % 8.14/1.89 | End of split % 8.14/1.89 | % 8.14/1.89 End of proof % 8.14/1.89 % SZS output end Proof for theBenchmark % 8.14/1.89 % 8.14/1.89 1288ms %------------------------------------------------------------------------------