%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV156+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 : n005.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:08 EDT 2023 % Result : Theorem 15.84s 2.89s % Output : Proof 19.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWV156+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n005.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Tue Aug 29 06:03:23 EDT 2023 % 0.14/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.49/1.35 Prover 1: Preprocessing ... % 4.49/1.35 Prover 4: Preprocessing ... % 4.88/1.39 Prover 2: Preprocessing ... % 4.88/1.39 Prover 0: Preprocessing ... % 4.88/1.40 Prover 6: Preprocessing ... % 4.88/1.40 Prover 5: Preprocessing ... % 4.88/1.40 Prover 3: Preprocessing ... % 10.67/2.22 Prover 1: Warning: ignoring some quantifiers % 11.68/2.30 Prover 3: Warning: ignoring some quantifiers % 11.68/2.33 Prover 1: Constructing countermodel ... % 11.68/2.33 Prover 3: Constructing countermodel ... % 11.68/2.34 Prover 6: Proving ... % 12.15/2.35 Prover 4: Warning: ignoring some quantifiers % 12.67/2.45 Prover 4: Constructing countermodel ... % 12.97/2.49 Prover 0: Proving ... % 12.97/2.50 Prover 2: Proving ... % 12.97/2.51 Prover 5: Proving ... % 15.84/2.88 Prover 3: proved (2249ms) % 15.84/2.88 % 15.84/2.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.84/2.89 % 15.84/2.89 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 15.84/2.89 Prover 0: stopped % 15.84/2.89 Prover 6: stopped % 15.84/2.89 Prover 2: stopped % 15.84/2.89 Prover 5: stopped % 15.84/2.89 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 15.84/2.89 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 15.84/2.89 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 15.84/2.90 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 17.43/3.05 Prover 10: Preprocessing ... % 17.48/3.07 Prover 11: Preprocessing ... % 17.48/3.07 Prover 1: Found proof (size 10) % 17.48/3.07 Prover 1: proved (2450ms) % 17.48/3.08 Prover 4: stopped % 17.48/3.08 Prover 7: Preprocessing ... % 17.48/3.09 Prover 8: Preprocessing ... % 17.48/3.09 Prover 13: Preprocessing ... % 17.84/3.18 Prover 10: stopped % 17.84/3.21 Prover 7: stopped % 18.55/3.22 Prover 11: stopped % 18.55/3.24 Prover 13: stopped % 19.10/3.32 Prover 8: Warning: ignoring some quantifiers % 19.10/3.34 Prover 8: Constructing countermodel ... % 19.10/3.34 Prover 8: stopped % 19.10/3.34 % 19.10/3.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 19.10/3.34 % 19.10/3.35 % SZS output start Proof for theBenchmark % 19.10/3.35 Assumptions after simplification: % 19.10/3.35 --------------------------------- % 19.10/3.35 % 19.10/3.35 (cl5_nebula_norm_0006) % 19.37/3.39 $i(q) & $i(n135299) & $i(pv12) & $i(pv70) & $i(pv10) & $i(x) & % 19.37/3.39 $i(tptp_sum_index) & $i(center) & $i(n4) & $i(n1) & $i(n0) & ? [v0: $i] : ? % 19.37/3.39 [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] % 19.37/3.39 : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ? [v10: $i] : ? [v11: $i] : ? % 19.37/3.39 [v12: $i] : (tptp_term_equals(pv12, tptp_sum_index) = v7 & times(v9, v9) = v10 % 19.37/3.39 & times(v2, v2) = v3 & sqrt(v10) = v11 & sqrt(v3) = v4 & divide(v11, pv70) = % 19.37/3.39 v12 & minus(v8, v1) = v9 & minus(v0, v1) = v2 & sum(n0, n4, v4) = pv70 & % 19.37/3.39 a_select3(center, pv12, n0) = v8 & a_select3(center, tptp_sum_index, n0) = % 19.37/3.39 v0 & a_select2(x, pv10) = v1 & pred(pv12) = v5 & pred(pv10) = v6 & leq(pv12, % 19.37/3.39 n4) = 0 & leq(pv10, n135299) = 0 & leq(n0, pv12) = 0 & leq(n0, pv10) = 0 & % 19.37/3.39 $i(v12) & $i(v11) & $i(v10) & $i(v9) & $i(v8) & $i(v7) & $i(v6) & $i(v5) & % 19.37/3.39 $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ! [v13: $i] : ! [v14: $i] : % 19.37/3.39 ! [v15: $i] : ! [v16: $i] : ( ~ (times(v15, v15) = v16) | ~ (minus(v14, % 19.37/3.39 v1) = v15) | ~ (a_select3(center, v13, n0) = v14) | ~ $i(v13) | ? % 19.37/3.39 [v17: any] : ? [v18: any] : ? [v19: $i] : ? [v20: $i] : ? [v21: $i] : % 19.37/3.39 (sqrt(v16) = v20 & divide(v20, pv70) = v21 & a_select3(q, pv10, v13) = v19 % 19.37/3.39 & leq(v13, v5) = v18 & leq(n0, v13) = v17 & $i(v21) & $i(v20) & $i(v19) % 19.37/3.39 & ( ~ (v18 = 0) | ~ (v17 = 0) | v21 = v19))) & ! [v13: $i] : ! [v14: % 19.37/3.39 $i] : ( ~ (a_select3(q, v13, tptp_sum_index) = v14) | ~ $i(v13) | ? % 19.37/3.39 [v15: any] : ? [v16: any] : ? [v17: $i] : (sum(n0, n4, v14) = v17 & % 19.37/3.39 leq(v13, v6) = v16 & leq(n0, v13) = v15 & $i(v17) & ( ~ (v16 = 0) | ~ % 19.37/3.39 (v15 = 0) | v17 = n1))) & ? [v13: $i] : ? [v14: $i] : ? [v15: $i] : % 19.37/3.39 ( ~ (v15 = n1) & cond(v7, v12, v13) = v14 & sum(n0, n4, v14) = v15 & % 19.37/3.39 a_select3(q, pv10, tptp_sum_index) = v13 & leq(pv10, v6) = 0 & $i(v15) & % 19.37/3.39 $i(v14) & $i(v13))) % 19.37/3.39 % 19.37/3.39 (irreflexivity_gt) % 19.37/3.39 ! [v0: $i] : ( ~ (gt(v0, v0) = 0) | ~ $i(v0)) % 19.37/3.39 % 19.37/3.39 (leq_gt_pred) % 19.37/3.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 19.37/3.39 (pred(v1) = v2) | ~ (leq(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 19.37/3.39 int] : ( ~ (v4 = 0) & gt(v1, v0) = v4)) & ! [v0: $i] : ! [v1: $i] : ! % 19.37/3.39 [v2: $i] : ( ~ (pred(v1) = v2) | ~ (leq(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) % 19.37/3.39 | gt(v1, v0) = 0) % 19.37/3.39 % 19.37/3.39 Further assumptions not needed in the proof: % 19.37/3.39 -------------------------------------------- % 19.37/3.39 const_array1_select, const_array2_select, defuse, finite_domain_0, % 19.37/3.39 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 19.37/3.39 finite_domain_5, gt_0_tptp_minus_1, gt_135299_0, gt_135299_1, gt_135299_2, % 19.37/3.39 gt_135299_3, gt_135299_4, gt_135299_5, gt_135299_tptp_minus_1, gt_1_0, % 19.37/3.39 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, % 19.37/3.39 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, % 19.37/3.39 gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_succ, leq_geq, leq_gt1, % 19.37/3.39 leq_gt2, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ, % 19.37/3.39 lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv, % 19.37/3.39 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 19.37/3.39 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq, % 19.37/3.39 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2, % 19.37/3.39 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, % 19.37/3.39 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, % 19.37/3.39 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2, % 19.37/3.39 successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float, % 19.37/3.39 totality, transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi, % 19.37/3.39 uniform_int_rand_ranges_lo % 19.37/3.39 % 19.37/3.39 Those formulas are unsatisfiable: % 19.37/3.39 --------------------------------- % 19.37/3.39 % 19.37/3.39 Begin of proof % 19.37/3.39 | % 19.37/3.40 | ALPHA: (leq_gt_pred) implies: % 19.37/3.40 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (pred(v1) = v2) | ~ % 19.37/3.40 | (leq(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) | gt(v1, v0) = 0) % 19.37/3.40 | % 19.37/3.40 | ALPHA: (cl5_nebula_norm_0006) implies: % 19.37/3.40 | (2) $i(pv10) % 19.37/3.40 | (3) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 19.37/3.40 | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ? % 19.37/3.40 | [v10: $i] : ? [v11: $i] : ? [v12: $i] : (tptp_term_equals(pv12, % 19.37/3.40 | tptp_sum_index) = v7 & times(v9, v9) = v10 & times(v2, v2) = v3 & % 19.37/3.40 | sqrt(v10) = v11 & sqrt(v3) = v4 & divide(v11, pv70) = v12 & minus(v8, % 19.37/3.40 | v1) = v9 & minus(v0, v1) = v2 & sum(n0, n4, v4) = pv70 & % 19.37/3.40 | a_select3(center, pv12, n0) = v8 & a_select3(center, tptp_sum_index, % 19.37/3.40 | n0) = v0 & a_select2(x, pv10) = v1 & pred(pv12) = v5 & pred(pv10) = % 19.37/3.40 | v6 & leq(pv12, n4) = 0 & leq(pv10, n135299) = 0 & leq(n0, pv12) = 0 & % 19.37/3.40 | leq(n0, pv10) = 0 & $i(v12) & $i(v11) & $i(v10) & $i(v9) & $i(v8) & % 19.37/3.40 | $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) % 19.37/3.40 | & ! [v13: $i] : ! [v14: $i] : ! [v15: $i] : ! [v16: $i] : ( ~ % 19.37/3.40 | (times(v15, v15) = v16) | ~ (minus(v14, v1) = v15) | ~ % 19.37/3.40 | (a_select3(center, v13, n0) = v14) | ~ $i(v13) | ? [v17: any] : % 19.37/3.40 | ? [v18: any] : ? [v19: $i] : ? [v20: $i] : ? [v21: $i] : % 19.37/3.40 | (sqrt(v16) = v20 & divide(v20, pv70) = v21 & a_select3(q, pv10, % 19.37/3.40 | v13) = v19 & leq(v13, v5) = v18 & leq(n0, v13) = v17 & $i(v21) % 19.37/3.40 | & $i(v20) & $i(v19) & ( ~ (v18 = 0) | ~ (v17 = 0) | v21 = v19))) % 19.37/3.40 | & ! [v13: $i] : ! [v14: $i] : ( ~ (a_select3(q, v13, % 19.37/3.40 | tptp_sum_index) = v14) | ~ $i(v13) | ? [v15: any] : ? [v16: % 19.37/3.40 | any] : ? [v17: $i] : (sum(n0, n4, v14) = v17 & leq(v13, v6) = % 19.37/3.40 | v16 & leq(n0, v13) = v15 & $i(v17) & ( ~ (v16 = 0) | ~ (v15 = 0) % 19.37/3.40 | | v17 = n1))) & ? [v13: $i] : ? [v14: $i] : ? [v15: $i] : ( % 19.37/3.40 | ~ (v15 = n1) & cond(v7, v12, v13) = v14 & sum(n0, n4, v14) = v15 & % 19.37/3.40 | a_select3(q, pv10, tptp_sum_index) = v13 & leq(pv10, v6) = 0 & % 19.37/3.40 | $i(v15) & $i(v14) & $i(v13))) % 19.37/3.40 | % 19.37/3.40 | DELTA: instantiating (3) with fresh symbols all_74_0, all_74_1, all_74_2, % 19.37/3.40 | all_74_3, all_74_4, all_74_5, all_74_6, all_74_7, all_74_8, all_74_9, % 19.37/3.40 | all_74_10, all_74_11, all_74_12 gives: % 19.37/3.41 | (4) tptp_term_equals(pv12, tptp_sum_index) = all_74_5 & times(all_74_3, % 19.37/3.41 | all_74_3) = all_74_2 & times(all_74_10, all_74_10) = all_74_9 & % 19.37/3.41 | sqrt(all_74_2) = all_74_1 & sqrt(all_74_9) = all_74_8 & % 19.37/3.41 | divide(all_74_1, pv70) = all_74_0 & minus(all_74_4, all_74_11) = % 19.37/3.41 | all_74_3 & minus(all_74_12, all_74_11) = all_74_10 & sum(n0, n4, % 19.37/3.41 | all_74_8) = pv70 & a_select3(center, pv12, n0) = all_74_4 & % 19.37/3.41 | a_select3(center, tptp_sum_index, n0) = all_74_12 & a_select2(x, pv10) % 19.37/3.41 | = all_74_11 & pred(pv12) = all_74_7 & pred(pv10) = all_74_6 & leq(pv12, % 19.37/3.41 | n4) = 0 & leq(pv10, n135299) = 0 & leq(n0, pv12) = 0 & leq(n0, pv10) % 19.37/3.41 | = 0 & $i(all_74_0) & $i(all_74_1) & $i(all_74_2) & $i(all_74_3) & % 19.37/3.41 | $i(all_74_4) & $i(all_74_5) & $i(all_74_6) & $i(all_74_7) & % 19.37/3.41 | $i(all_74_8) & $i(all_74_9) & $i(all_74_10) & $i(all_74_11) & % 19.37/3.41 | $i(all_74_12) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : % 19.37/3.41 | ( ~ (times(v2, v2) = v3) | ~ (minus(v1, all_74_11) = v2) | ~ % 19.37/3.41 | (a_select3(center, v0, n0) = v1) | ~ $i(v0) | ? [v4: any] : ? [v5: % 19.37/3.41 | any] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : (sqrt(v3) = v7 & % 19.37/3.41 | divide(v7, pv70) = v8 & a_select3(q, pv10, v0) = v6 & leq(v0, % 19.37/3.41 | all_74_7) = v5 & leq(n0, v0) = v4 & $i(v8) & $i(v7) & $i(v6) & ( % 19.37/3.41 | ~ (v5 = 0) | ~ (v4 = 0) | v8 = v6))) & ! [v0: $i] : ! [v1: $i] % 19.37/3.41 | : ( ~ (a_select3(q, v0, tptp_sum_index) = v1) | ~ $i(v0) | ? [v2: % 19.37/3.41 | any] : ? [v3: any] : ? [v4: $i] : (sum(n0, n4, v1) = v4 & leq(v0, % 19.37/3.41 | all_74_6) = v3 & leq(n0, v0) = v2 & $i(v4) & ( ~ (v3 = 0) | ~ % 19.37/3.41 | (v2 = 0) | v4 = n1))) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : % 19.37/3.41 | ( ~ (v2 = n1) & cond(all_74_5, all_74_0, v0) = v1 & sum(n0, n4, v1) = % 19.37/3.41 | v2 & a_select3(q, pv10, tptp_sum_index) = v0 & leq(pv10, all_74_6) = % 19.37/3.41 | 0 & $i(v2) & $i(v1) & $i(v0)) % 19.37/3.41 | % 19.37/3.41 | ALPHA: (4) implies: % 19.37/3.41 | (5) pred(pv10) = all_74_6 % 19.37/3.41 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = n1) & % 19.37/3.41 | cond(all_74_5, all_74_0, v0) = v1 & sum(n0, n4, v1) = v2 & % 19.37/3.41 | a_select3(q, pv10, tptp_sum_index) = v0 & leq(pv10, all_74_6) = 0 & % 19.37/3.41 | $i(v2) & $i(v1) & $i(v0)) % 19.37/3.41 | % 19.37/3.41 | DELTA: instantiating (6) with fresh symbols all_79_0, all_79_1, all_79_2 % 19.37/3.41 | gives: % 19.37/3.41 | (7) ~ (all_79_0 = n1) & cond(all_74_5, all_74_0, all_79_2) = all_79_1 & % 19.37/3.41 | sum(n0, n4, all_79_1) = all_79_0 & a_select3(q, pv10, tptp_sum_index) = % 19.37/3.41 | all_79_2 & leq(pv10, all_74_6) = 0 & $i(all_79_0) & $i(all_79_1) & % 19.37/3.41 | $i(all_79_2) % 19.37/3.41 | % 19.37/3.41 | ALPHA: (7) implies: % 19.37/3.41 | (8) leq(pv10, all_74_6) = 0 % 19.37/3.41 | % 19.37/3.41 | GROUND_INST: instantiating (1) with pv10, pv10, all_74_6, simplifying with % 19.37/3.41 | (2), (5), (8) gives: % 19.37/3.41 | (9) gt(pv10, pv10) = 0 % 19.37/3.41 | % 19.37/3.41 | GROUND_INST: instantiating (irreflexivity_gt) with pv10, simplifying with (2), % 19.37/3.41 | (9) gives: % 19.37/3.41 | (10) $false % 19.37/3.41 | % 19.37/3.41 | CLOSE: (10) is inconsistent. % 19.37/3.41 | % 19.37/3.41 End of proof % 19.37/3.41 % SZS output end Proof for theBenchmark % 19.37/3.41 % 19.37/3.41 2808ms %------------------------------------------------------------------------------