%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV161+1 : TPTP v8.1.2. Bugfixed v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n020.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 22:55:09 EDT 2023 % Result : Theorem 15.00s 2.69s % Output : Proof 18.68s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SWV161+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.06/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n020.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Tue Aug 29 10:38:58 EDT 2023 % 0.12/0.33 % CPUTime : % 0.54/0.63 ________ _____ % 0.54/0.63 ___ __ \_________(_)________________________________ % 0.54/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.54/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.54/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.54/0.63 % 0.54/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.54/0.63 (2023-06-19) % 0.54/0.64 % 0.54/0.64 (c) Philipp Rümmer, 2009-2023 % 0.54/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.54/0.64 Amanda Stjerna. % 0.54/0.64 Free software under BSD-3-Clause. % 0.54/0.64 % 0.54/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.54/0.64 % 0.54/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.54/0.65 Running up to 7 provers in parallel. % 0.54/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.54/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.54/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.54/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.54/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.54/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.54/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.45/1.32 Prover 1: Preprocessing ... % 4.45/1.32 Prover 4: Preprocessing ... % 4.82/1.35 Prover 0: Preprocessing ... % 4.82/1.35 Prover 5: Preprocessing ... % 4.82/1.35 Prover 2: Preprocessing ... % 4.82/1.36 Prover 6: Preprocessing ... % 4.82/1.36 Prover 3: Preprocessing ... % 10.37/2.09 Prover 1: Warning: ignoring some quantifiers % 10.83/2.15 Prover 3: Warning: ignoring some quantifiers % 10.99/2.17 Prover 6: Proving ... % 10.99/2.17 Prover 1: Constructing countermodel ... % 10.99/2.17 Prover 3: Constructing countermodel ... % 11.45/2.23 Prover 4: Warning: ignoring some quantifiers % 11.76/2.30 Prover 0: Proving ... % 11.76/2.31 Prover 4: Constructing countermodel ... % 12.38/2.37 Prover 2: Proving ... % 12.38/2.37 Prover 5: Proving ... % 15.00/2.68 Prover 3: proved (2028ms) % 15.00/2.69 % 15.00/2.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 15.00/2.69 % 15.00/2.69 Prover 0: stopped % 15.00/2.69 Prover 2: stopped % 15.00/2.70 Prover 6: stopped % 15.00/2.71 Prover 5: stopped % 15.00/2.71 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 15.00/2.71 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 15.00/2.71 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 15.00/2.71 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 15.00/2.71 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 16.02/2.84 Prover 1: Found proof (size 52) % 16.02/2.84 Prover 1: proved (2186ms) % 16.02/2.84 Prover 4: stopped % 16.49/2.95 Prover 8: Preprocessing ... % 16.49/2.95 Prover 7: Preprocessing ... % 16.49/2.95 Prover 11: Preprocessing ... % 16.49/2.95 Prover 13: Preprocessing ... % 17.11/2.97 Prover 10: Preprocessing ... % 17.30/3.04 Prover 7: stopped % 17.30/3.05 Prover 11: stopped % 17.30/3.05 Prover 10: stopped % 17.30/3.07 Prover 13: stopped % 18.06/3.12 Prover 8: Warning: ignoring some quantifiers % 18.06/3.14 Prover 8: Constructing countermodel ... % 18.06/3.15 Prover 8: stopped % 18.06/3.15 % 18.06/3.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 18.06/3.15 % 18.06/3.16 % SZS output start Proof for theBenchmark % 18.06/3.16 Assumptions after simplification: % 18.06/3.16 --------------------------------- % 18.06/3.16 % 18.06/3.16 (cl5_nebula_norm_0011) % 18.44/3.19 $i(n135299) & $i(tptp_sum_index) & $i(pv10) & $i(q) & $i(n4) & $i(n1) & $i(n0) % 18.44/3.19 & ? [v0: $i] : ? [v1: $i] : (sum(n0, n4, v0) = n1 & a_select3(q, pv10, % 18.44/3.19 tptp_sum_index) = v0 & pred(pv10) = v1 & leq(pv10, n135299) = 0 & leq(n0, % 18.44/3.19 pv10) = 0 & $i(v1) & $i(v0) & ! [v2: $i] : ! [v3: $i] : ( ~ % 18.44/3.19 (a_select3(q, v2, tptp_sum_index) = v3) | ~ $i(v2) | ? [v4: any] : ? % 18.44/3.19 [v5: any] : ? [v6: $i] : (sum(n0, n4, v3) = v6 & leq(v2, v1) = v5 & % 18.44/3.19 leq(n0, v2) = v4 & $i(v6) & ( ~ (v5 = 0) | ~ (v4 = 0) | v6 = n1))) & ? % 18.44/3.19 [v2: $i] : ? [v3: $i] : ? [v4: $i] : ( ~ (v4 = n1) & sum(n0, n4, v3) = v4 % 18.44/3.19 & a_select3(q, v2, tptp_sum_index) = v3 & leq(v2, pv10) = 0 & leq(n0, v2) % 18.44/3.19 = 0 & $i(v4) & $i(v3) & $i(v2))) % 18.44/3.19 % 18.44/3.19 (leq_gt2) % 18.44/3.19 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | v1 = v0 | ~ (gt(v1, v0) % 18.44/3.19 = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & leq(v0, v1) % 18.44/3.19 = v3)) % 18.44/3.19 % 18.44/3.19 (leq_gt_pred) % 18.44/3.19 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 18.44/3.19 (pred(v1) = v2) | ~ (leq(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 18.44/3.19 int] : ( ~ (v4 = 0) & gt(v1, v0) = v4)) & ! [v0: $i] : ! [v1: $i] : ! % 18.44/3.19 [v2: $i] : ( ~ (pred(v1) = v2) | ~ (leq(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) % 18.44/3.19 | gt(v1, v0) = 0) % 18.44/3.19 % 18.44/3.19 (function-axioms) % 18.56/3.20 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 18.56/3.20 $i] : (v1 = v0 | ~ (tptp_update3(v5, v4, v3, v2) = v1) | ~ % 18.56/3.20 (tptp_update3(v5, v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 18.56/3.20 $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_update2(v4, v3, v2) = % 18.56/3.20 v1) | ~ (tptp_update2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 18.56/3.20 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (sum(v4, v3, v2) = v1) | % 18.56/3.20 ~ (sum(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 18.56/3.20 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_const_array2(v4, v3, v2) = v1) | % 18.56/3.20 ~ (tptp_const_array2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 18.56/3.20 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (a_select3(v4, v3, v2) = % 18.56/3.20 v1) | ~ (a_select3(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 18.56/3.20 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (minus(v3, v2) = v1) | ~ (minus(v3, % 18.56/3.20 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 18.56/3.20 = v0 | ~ (plus(v3, v2) = v1) | ~ (plus(v3, v2) = v0)) & ! [v0: $i] : ! % 18.56/3.20 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (tptp_mmul(v3, v2) = v1) % 18.56/3.20 | ~ (tptp_mmul(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 18.56/3.20 ! [v3: $i] : (v1 = v0 | ~ (tptp_msub(v3, v2) = v1) | ~ (tptp_msub(v3, v2) = % 18.56/3.20 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 18.56/3.20 ~ (tptp_madd(v3, v2) = v1) | ~ (tptp_madd(v3, v2) = v0)) & ! [v0: $i] : ! % 18.56/3.20 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (dim(v3, v2) = v1) | ~ % 18.56/3.20 (dim(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 18.56/3.20 : (v1 = v0 | ~ (tptp_const_array1(v3, v2) = v1) | ~ (tptp_const_array1(v3, % 18.56/3.20 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 18.56/3.20 = v0 | ~ (a_select2(v3, v2) = v1) | ~ (a_select2(v3, v2) = v0)) & ! [v0: % 18.56/3.20 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 18.56/3.20 (uniform_int_rnd(v3, v2) = v1) | ~ (uniform_int_rnd(v3, v2) = v0)) & ! % 18.56/3.20 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 18.56/3.20 $i] : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0: % 18.56/3.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 18.56/3.20 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0: % 18.56/3.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 18.56/3.20 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 18.56/3.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 18.56/3.20 : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0: $i] : ! % 18.56/3.20 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (inv(v2) = v1) | ~ (inv(v2) = v0)) & % 18.56/3.20 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (trans(v2) = v1) | ~ % 18.56/3.20 (trans(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 18.56/3.20 (succ(v2) = v1) | ~ (succ(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 18.56/3.20 $i] : (v1 = v0 | ~ (pred(v2) = v1) | ~ (pred(v2) = v0)) % 18.56/3.20 % 18.56/3.20 Further assumptions not needed in the proof: % 18.56/3.20 -------------------------------------------- % 18.56/3.20 const_array1_select, const_array2_select, defuse, finite_domain_0, % 18.56/3.20 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 18.56/3.20 finite_domain_5, gt_0_tptp_minus_1, gt_135299_0, gt_135299_1, gt_135299_2, % 18.56/3.20 gt_135299_3, gt_135299_4, gt_135299_5, gt_135299_tptp_minus_1, gt_1_0, % 18.56/3.20 gt_1_tptp_minus_1, gt_2_0, gt_2_1, gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2, % 18.56/3.20 gt_3_tptp_minus_1, gt_4_0, gt_4_1, gt_4_2, gt_4_3, gt_4_tptp_minus_1, gt_5_0, % 18.56/3.20 gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_succ, irreflexivity_gt, % 18.56/3.20 leq_geq, leq_gt1, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, % 18.56/3.20 leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, % 18.56/3.20 matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 18.56/3.20 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq, % 18.56/3.20 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2, % 18.56/3.20 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, % 18.56/3.20 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, % 18.56/3.20 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2, % 18.56/3.20 successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float, % 18.56/3.20 totality, transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi, % 18.56/3.20 uniform_int_rand_ranges_lo % 18.56/3.20 % 18.56/3.20 Those formulas are unsatisfiable: % 18.56/3.20 --------------------------------- % 18.56/3.20 % 18.56/3.20 Begin of proof % 18.56/3.20 | % 18.56/3.20 | ALPHA: (leq_gt_pred) implies: % 18.56/3.20 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 18.56/3.20 | (pred(v1) = v2) | ~ (leq(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | ? % 18.56/3.20 | [v4: int] : ( ~ (v4 = 0) & gt(v1, v0) = v4)) % 18.56/3.20 | % 18.56/3.20 | ALPHA: (cl5_nebula_norm_0011) implies: % 18.56/3.21 | (2) $i(pv10) % 18.56/3.21 | (3) ? [v0: $i] : ? [v1: $i] : (sum(n0, n4, v0) = n1 & a_select3(q, pv10, % 18.56/3.21 | tptp_sum_index) = v0 & pred(pv10) = v1 & leq(pv10, n135299) = 0 & % 18.56/3.21 | leq(n0, pv10) = 0 & $i(v1) & $i(v0) & ! [v2: $i] : ! [v3: $i] : ( ~ % 18.56/3.21 | (a_select3(q, v2, tptp_sum_index) = v3) | ~ $i(v2) | ? [v4: any] % 18.56/3.21 | : ? [v5: any] : ? [v6: $i] : (sum(n0, n4, v3) = v6 & leq(v2, v1) % 18.56/3.21 | = v5 & leq(n0, v2) = v4 & $i(v6) & ( ~ (v5 = 0) | ~ (v4 = 0) | % 18.56/3.21 | v6 = n1))) & ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ( ~ (v4 % 18.56/3.21 | = n1) & sum(n0, n4, v3) = v4 & a_select3(q, v2, tptp_sum_index) = % 18.56/3.21 | v3 & leq(v2, pv10) = 0 & leq(n0, v2) = 0 & $i(v4) & $i(v3) & % 18.56/3.21 | $i(v2))) % 18.56/3.21 | % 18.56/3.21 | ALPHA: (function-axioms) implies: % 18.56/3.21 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 18.56/3.21 | ! [v3: $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) % 18.56/3.21 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 18.56/3.21 | (v1 = v0 | ~ (a_select3(v4, v3, v2) = v1) | ~ (a_select3(v4, v3, v2) % 18.56/3.21 | = v0)) % 18.56/3.21 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 18.56/3.21 | (v1 = v0 | ~ (sum(v4, v3, v2) = v1) | ~ (sum(v4, v3, v2) = v0)) % 18.56/3.21 | % 18.56/3.21 | DELTA: instantiating (3) with fresh symbols all_61_0, all_61_1 gives: % 18.56/3.21 | (7) sum(n0, n4, all_61_1) = n1 & a_select3(q, pv10, tptp_sum_index) = % 18.56/3.21 | all_61_1 & pred(pv10) = all_61_0 & leq(pv10, n135299) = 0 & leq(n0, % 18.56/3.21 | pv10) = 0 & $i(all_61_0) & $i(all_61_1) & ! [v0: $i] : ! [v1: $i] : % 18.56/3.21 | ( ~ (a_select3(q, v0, tptp_sum_index) = v1) | ~ $i(v0) | ? [v2: any] % 18.56/3.21 | : ? [v3: any] : ? [v4: $i] : (sum(n0, n4, v1) = v4 & leq(v0, % 18.56/3.21 | all_61_0) = v3 & leq(n0, v0) = v2 & $i(v4) & ( ~ (v3 = 0) | ~ % 18.56/3.21 | (v2 = 0) | v4 = n1))) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : % 18.56/3.21 | ( ~ (v2 = n1) & sum(n0, n4, v1) = v2 & a_select3(q, v0, tptp_sum_index) % 18.56/3.21 | = v1 & leq(v0, pv10) = 0 & leq(n0, v0) = 0 & $i(v2) & $i(v1) & % 18.56/3.21 | $i(v0)) % 18.56/3.21 | % 18.56/3.21 | ALPHA: (7) implies: % 18.56/3.21 | (8) pred(pv10) = all_61_0 % 18.56/3.21 | (9) a_select3(q, pv10, tptp_sum_index) = all_61_1 % 18.56/3.21 | (10) sum(n0, n4, all_61_1) = n1 % 18.56/3.21 | (11) ! [v0: $i] : ! [v1: $i] : ( ~ (a_select3(q, v0, tptp_sum_index) = % 18.56/3.21 | v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : ? [v4: $i] : % 18.56/3.21 | (sum(n0, n4, v1) = v4 & leq(v0, all_61_0) = v3 & leq(n0, v0) = v2 & % 18.56/3.21 | $i(v4) & ( ~ (v3 = 0) | ~ (v2 = 0) | v4 = n1))) % 18.56/3.21 | (12) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = n1) & sum(n0, n4, % 18.56/3.21 | v1) = v2 & a_select3(q, v0, tptp_sum_index) = v1 & leq(v0, pv10) = % 18.56/3.21 | 0 & leq(n0, v0) = 0 & $i(v2) & $i(v1) & $i(v0)) % 18.56/3.21 | % 18.56/3.21 | DELTA: instantiating (12) with fresh symbols all_79_0, all_79_1, all_79_2 % 18.56/3.21 | gives: % 18.56/3.21 | (13) ~ (all_79_0 = n1) & sum(n0, n4, all_79_1) = all_79_0 & a_select3(q, % 18.56/3.21 | all_79_2, tptp_sum_index) = all_79_1 & leq(all_79_2, pv10) = 0 & % 18.56/3.21 | leq(n0, all_79_2) = 0 & $i(all_79_0) & $i(all_79_1) & $i(all_79_2) % 18.56/3.21 | % 18.56/3.21 | ALPHA: (13) implies: % 18.56/3.22 | (14) ~ (all_79_0 = n1) % 18.56/3.22 | (15) $i(all_79_2) % 18.56/3.22 | (16) leq(n0, all_79_2) = 0 % 18.56/3.22 | (17) leq(all_79_2, pv10) = 0 % 18.56/3.22 | (18) a_select3(q, all_79_2, tptp_sum_index) = all_79_1 % 18.56/3.22 | (19) sum(n0, n4, all_79_1) = all_79_0 % 18.56/3.22 | % 18.56/3.22 | GROUND_INST: instantiating (11) with pv10, all_61_1, simplifying with (2), (9) % 18.56/3.22 | gives: % 18.56/3.22 | (20) ? [v0: any] : ? [v1: any] : ? [v2: $i] : (sum(n0, n4, all_61_1) = % 18.56/3.22 | v2 & leq(pv10, all_61_0) = v1 & leq(n0, pv10) = v0 & $i(v2) & ( ~ % 18.56/3.22 | (v1 = 0) | ~ (v0 = 0) | v2 = n1)) % 18.56/3.22 | % 18.56/3.22 | GROUND_INST: instantiating (11) with all_79_2, all_79_1, simplifying with % 18.56/3.22 | (15), (18) gives: % 18.56/3.22 | (21) ? [v0: any] : ? [v1: any] : ? [v2: $i] : (sum(n0, n4, all_79_1) = % 18.56/3.22 | v2 & leq(all_79_2, all_61_0) = v1 & leq(n0, all_79_2) = v0 & $i(v2) % 18.56/3.22 | & ( ~ (v1 = 0) | ~ (v0 = 0) | v2 = n1)) % 18.56/3.22 | % 18.56/3.22 | DELTA: instantiating (21) with fresh symbols all_103_0, all_103_1, all_103_2 % 18.56/3.22 | gives: % 18.56/3.22 | (22) sum(n0, n4, all_79_1) = all_103_0 & leq(all_79_2, all_61_0) = % 18.56/3.22 | all_103_1 & leq(n0, all_79_2) = all_103_2 & $i(all_103_0) & ( ~ % 18.56/3.22 | (all_103_1 = 0) | ~ (all_103_2 = 0) | all_103_0 = n1) % 18.56/3.22 | % 18.56/3.22 | ALPHA: (22) implies: % 18.56/3.22 | (23) leq(n0, all_79_2) = all_103_2 % 18.56/3.22 | (24) leq(all_79_2, all_61_0) = all_103_1 % 18.56/3.22 | (25) sum(n0, n4, all_79_1) = all_103_0 % 18.56/3.22 | (26) ~ (all_103_1 = 0) | ~ (all_103_2 = 0) | all_103_0 = n1 % 18.56/3.22 | % 18.56/3.22 | DELTA: instantiating (20) with fresh symbols all_105_0, all_105_1, all_105_2 % 18.56/3.22 | gives: % 18.56/3.22 | (27) sum(n0, n4, all_61_1) = all_105_0 & leq(pv10, all_61_0) = all_105_1 & % 18.56/3.22 | leq(n0, pv10) = all_105_2 & $i(all_105_0) & ( ~ (all_105_1 = 0) | ~ % 18.56/3.22 | (all_105_2 = 0) | all_105_0 = n1) % 18.56/3.22 | % 18.56/3.22 | ALPHA: (27) implies: % 18.56/3.22 | (28) sum(n0, n4, all_61_1) = all_105_0 % 18.56/3.22 | % 18.56/3.22 | GROUND_INST: instantiating (4) with 0, all_103_2, all_79_2, n0, simplifying % 18.56/3.22 | with (16), (23) gives: % 18.56/3.22 | (29) all_103_2 = 0 % 18.56/3.22 | % 18.56/3.22 | GROUND_INST: instantiating (6) with n1, all_105_0, all_61_1, n4, n0, % 18.56/3.22 | simplifying with (10), (28) gives: % 18.56/3.22 | (30) all_105_0 = n1 % 18.56/3.22 | % 18.56/3.22 | GROUND_INST: instantiating (6) with all_79_0, all_103_0, all_79_1, n4, n0, % 18.56/3.22 | simplifying with (19), (25) gives: % 18.56/3.22 | (31) all_103_0 = all_79_0 % 18.56/3.22 | % 18.56/3.22 | BETA: splitting (26) gives: % 18.56/3.22 | % 18.56/3.22 | Case 1: % 18.56/3.22 | | % 18.56/3.22 | | (32) ~ (all_103_1 = 0) % 18.56/3.22 | | % 18.56/3.22 | | GROUND_INST: instantiating (1) with all_79_2, pv10, all_61_0, all_103_1, % 18.56/3.22 | | simplifying with (2), (8), (15), (24) gives: % 18.68/3.22 | | (33) all_103_1 = 0 | ? [v0: int] : ( ~ (v0 = 0) & gt(pv10, all_79_2) = % 18.68/3.22 | | v0) % 18.68/3.22 | | % 18.68/3.22 | | BETA: splitting (33) gives: % 18.68/3.22 | | % 18.68/3.22 | | Case 1: % 18.68/3.22 | | | % 18.68/3.22 | | | (34) all_103_1 = 0 % 18.68/3.22 | | | % 18.68/3.22 | | | REDUCE: (32), (34) imply: % 18.68/3.22 | | | (35) $false % 18.68/3.22 | | | % 18.68/3.22 | | | CLOSE: (35) is inconsistent. % 18.68/3.22 | | | % 18.68/3.22 | | Case 2: % 18.68/3.22 | | | % 18.68/3.22 | | | (36) ? [v0: int] : ( ~ (v0 = 0) & gt(pv10, all_79_2) = v0) % 18.68/3.23 | | | % 18.68/3.23 | | | DELTA: instantiating (36) with fresh symbol all_125_0 gives: % 18.68/3.23 | | | (37) ~ (all_125_0 = 0) & gt(pv10, all_79_2) = all_125_0 % 18.68/3.23 | | | % 18.68/3.23 | | | ALPHA: (37) implies: % 18.68/3.23 | | | (38) ~ (all_125_0 = 0) % 18.68/3.23 | | | (39) gt(pv10, all_79_2) = all_125_0 % 18.68/3.23 | | | % 18.68/3.23 | | | GROUND_INST: instantiating (leq_gt2) with all_79_2, pv10, all_125_0, % 18.68/3.23 | | | simplifying with (2), (15), (39) gives: % 18.68/3.23 | | | (40) all_125_0 = 0 | all_79_2 = pv10 | ? [v0: int] : ( ~ (v0 = 0) & % 18.68/3.23 | | | leq(all_79_2, pv10) = v0) % 18.68/3.23 | | | % 18.68/3.23 | | | BETA: splitting (40) gives: % 18.68/3.23 | | | % 18.68/3.23 | | | Case 1: % 18.68/3.23 | | | | % 18.68/3.23 | | | | (41) all_125_0 = 0 % 18.68/3.23 | | | | % 18.68/3.23 | | | | REDUCE: (38), (41) imply: % 18.68/3.23 | | | | (42) $false % 18.68/3.23 | | | | % 18.68/3.23 | | | | CLOSE: (42) is inconsistent. % 18.68/3.23 | | | | % 18.68/3.23 | | | Case 2: % 18.68/3.23 | | | | % 18.68/3.23 | | | | (43) all_79_2 = pv10 | ? [v0: int] : ( ~ (v0 = 0) & leq(all_79_2, % 18.68/3.23 | | | | pv10) = v0) % 18.68/3.23 | | | | % 18.68/3.23 | | | | BETA: splitting (43) gives: % 18.68/3.23 | | | | % 18.68/3.23 | | | | Case 1: % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | (44) all_79_2 = pv10 % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | REDUCE: (18), (44) imply: % 18.68/3.23 | | | | | (45) a_select3(q, pv10, tptp_sum_index) = all_79_1 % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | GROUND_INST: instantiating (5) with all_61_1, all_79_1, % 18.68/3.23 | | | | | tptp_sum_index, pv10, q, simplifying with (9), (45) % 18.68/3.23 | | | | | gives: % 18.68/3.23 | | | | | (46) all_79_1 = all_61_1 % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | REDUCE: (19), (46) imply: % 18.68/3.23 | | | | | (47) sum(n0, n4, all_61_1) = all_79_0 % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | GROUND_INST: instantiating (6) with n1, all_79_0, all_61_1, n4, n0, % 18.68/3.23 | | | | | simplifying with (10), (47) gives: % 18.68/3.23 | | | | | (48) all_79_0 = n1 % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | REDUCE: (14), (48) imply: % 18.68/3.23 | | | | | (49) $false % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | CLOSE: (49) is inconsistent. % 18.68/3.23 | | | | | % 18.68/3.23 | | | | Case 2: % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | (50) ? [v0: int] : ( ~ (v0 = 0) & leq(all_79_2, pv10) = v0) % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | DELTA: instantiating (50) with fresh symbol all_151_0 gives: % 18.68/3.23 | | | | | (51) ~ (all_151_0 = 0) & leq(all_79_2, pv10) = all_151_0 % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | ALPHA: (51) implies: % 18.68/3.23 | | | | | (52) ~ (all_151_0 = 0) % 18.68/3.23 | | | | | (53) leq(all_79_2, pv10) = all_151_0 % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | GROUND_INST: instantiating (4) with 0, all_151_0, pv10, all_79_2, % 18.68/3.23 | | | | | simplifying with (17), (53) gives: % 18.68/3.23 | | | | | (54) all_151_0 = 0 % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | REDUCE: (52), (54) imply: % 18.68/3.23 | | | | | (55) $false % 18.68/3.23 | | | | | % 18.68/3.23 | | | | | CLOSE: (55) is inconsistent. % 18.68/3.23 | | | | | % 18.68/3.23 | | | | End of split % 18.68/3.23 | | | | % 18.68/3.23 | | | End of split % 18.68/3.23 | | | % 18.68/3.23 | | End of split % 18.68/3.23 | | % 18.68/3.23 | Case 2: % 18.68/3.23 | | % 18.68/3.23 | | (56) ~ (all_103_2 = 0) | all_103_0 = n1 % 18.68/3.23 | | % 18.68/3.23 | | BETA: splitting (56) gives: % 18.68/3.23 | | % 18.68/3.23 | | Case 1: % 18.68/3.23 | | | % 18.68/3.23 | | | (57) ~ (all_103_2 = 0) % 18.68/3.23 | | | % 18.68/3.23 | | | REDUCE: (29), (57) imply: % 18.68/3.23 | | | (58) $false % 18.68/3.23 | | | % 18.68/3.23 | | | CLOSE: (58) is inconsistent. % 18.68/3.23 | | | % 18.68/3.23 | | Case 2: % 18.68/3.23 | | | % 18.68/3.23 | | | (59) all_103_0 = n1 % 18.68/3.23 | | | % 18.68/3.23 | | | COMBINE_EQS: (31), (59) imply: % 18.68/3.23 | | | (60) all_79_0 = n1 % 18.68/3.23 | | | % 18.68/3.23 | | | SIMP: (60) implies: % 18.68/3.23 | | | (61) all_79_0 = n1 % 18.68/3.23 | | | % 18.68/3.23 | | | REDUCE: (14), (61) imply: % 18.68/3.23 | | | (62) $false % 18.68/3.23 | | | % 18.68/3.23 | | | CLOSE: (62) is inconsistent. % 18.68/3.23 | | | % 18.68/3.23 | | End of split % 18.68/3.23 | | % 18.68/3.23 | End of split % 18.68/3.23 | % 18.68/3.23 End of proof % 18.68/3.23 % SZS output end Proof for theBenchmark % 18.68/3.23 % 18.68/3.23 2597ms %------------------------------------------------------------------------------