%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV206+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 : n025.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:20 EDT 2023 % Result : Theorem 14.78s 2.79s % Output : Proof 19.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWV206+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n025.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 : Tue Aug 29 03:11:24 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.59 ________ _____ % 0.19/0.59 ___ __ \_________(_)________________________________ % 0.19/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.59 % 0.19/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.59 (2023-06-19) % 0.19/0.59 % 0.19/0.59 (c) Philipp Rümmer, 2009-2023 % 0.19/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.59 Amanda Stjerna. % 0.19/0.59 Free software under BSD-3-Clause. % 0.19/0.59 % 0.19/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.59 % 0.19/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.60 Running up to 7 provers in parallel. % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.27/1.35 Prover 4: Preprocessing ... % 4.27/1.36 Prover 1: Preprocessing ... % 4.65/1.40 Prover 6: Preprocessing ... % 4.65/1.40 Prover 5: Preprocessing ... % 4.65/1.40 Prover 3: Preprocessing ... % 4.65/1.40 Prover 0: Preprocessing ... % 4.65/1.40 Prover 2: Preprocessing ... % 11.14/2.29 Prover 1: Warning: ignoring some quantifiers % 11.62/2.36 Prover 3: Warning: ignoring some quantifiers % 11.93/2.38 Prover 6: Proving ... % 11.93/2.41 Prover 4: Warning: ignoring some quantifiers % 11.93/2.42 Prover 3: Constructing countermodel ... % 11.93/2.42 Prover 1: Constructing countermodel ... % 13.15/2.54 Prover 4: Constructing countermodel ... % 13.32/2.58 Prover 0: Proving ... % 13.32/2.58 Prover 5: Proving ... % 14.17/2.68 Prover 2: Proving ... % 14.78/2.78 Prover 3: proved (2161ms) % 14.78/2.79 % 14.78/2.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.78/2.79 % 14.78/2.80 Prover 0: stopped % 14.78/2.80 Prover 6: stopped % 14.78/2.81 Prover 5: stopped % 14.78/2.83 Prover 2: stopped % 14.78/2.84 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 14.78/2.84 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 14.78/2.84 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.78/2.84 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.78/2.84 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 16.72/3.02 Prover 1: Found proof (size 25) % 16.72/3.02 Prover 1: proved (2411ms) % 16.72/3.02 Prover 4: stopped % 17.64/3.15 Prover 11: Preprocessing ... % 17.64/3.16 Prover 10: Preprocessing ... % 17.64/3.16 Prover 13: Preprocessing ... % 17.88/3.19 Prover 7: Preprocessing ... % 17.88/3.19 Prover 8: Preprocessing ... % 18.37/3.30 Prover 10: stopped % 18.37/3.31 Prover 7: stopped % 18.37/3.31 Prover 11: stopped % 18.90/3.33 Prover 13: stopped % 19.15/3.41 Prover 8: Warning: ignoring some quantifiers % 19.15/3.43 Prover 8: Constructing countermodel ... % 19.15/3.45 Prover 8: stopped % 19.15/3.45 % 19.15/3.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 19.15/3.45 % 19.15/3.45 % SZS output start Proof for theBenchmark % 19.15/3.46 Assumptions after simplification: % 19.15/3.46 --------------------------------- % 19.15/3.46 % 19.15/3.46 (quaternion_ds1_inuse_0017) % 19.15/3.50 a_select3(u_defuse, n2, n0) = use & a_select3(u_defuse, n1, n0) = use & % 19.15/3.50 a_select3(u_defuse, n0, n0) = use & a_select2(xinit_noise_defuse, n5) = use & % 19.15/3.50 a_select2(xinit_noise_defuse, n4) = use & a_select2(xinit_noise_defuse, n3) = % 19.15/3.50 use & a_select2(xinit_noise_defuse, n2) = use & a_select2(xinit_noise_defuse, % 19.15/3.50 n1) = use & a_select2(xinit_noise_defuse, n0) = use & % 19.15/3.50 a_select2(xinit_mean_defuse, n5) = use & a_select2(xinit_mean_defuse, n4) = % 19.15/3.50 use & a_select2(xinit_mean_defuse, n3) = use & a_select2(xinit_mean_defuse, % 19.15/3.50 n2) = use & a_select2(xinit_mean_defuse, n1) = use & % 19.15/3.50 a_select2(xinit_mean_defuse, n0) = use & a_select2(xinit_defuse, n5) = use & % 19.15/3.50 a_select2(xinit_defuse, n4) = use & a_select2(xinit_defuse, n3) = use & % 19.15/3.50 a_select2(sigma_defuse, n5) = use & a_select2(sigma_defuse, n4) = use & % 19.15/3.50 a_select2(sigma_defuse, n3) = use & a_select2(sigma_defuse, n2) = use & % 19.15/3.50 a_select2(sigma_defuse, n1) = use & a_select2(sigma_defuse, n0) = use & % 19.15/3.50 a_select2(rho_defuse, n2) = use & a_select2(rho_defuse, n1) = use & % 19.15/3.50 a_select2(rho_defuse, n0) = use & $i(z_defuse) & $i(n998) & % 19.15/3.50 $i(xinit_noise_defuse) & $i(xinit_mean_defuse) & $i(xinit_defuse) & % 19.15/3.50 $i(u_defuse) & $i(sigma_defuse) & $i(rho_defuse) & $i(use) & $i(n5) & $i(n4) & % 19.15/3.50 $i(n3) & $i(n2) & $i(n1) & $i(n0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 19.15/3.50 (v2 = use | ~ (a_select3(z_defuse, v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? % 19.15/3.50 [v3: any] : ? [v4: any] : ? [v5: any] : ? [v6: any] : (leq(v1, n998) = v6 % 19.15/3.50 & leq(v0, n2) = v5 & leq(n0, v1) = v4 & leq(n0, v0) = v3 & ( ~ (v6 = 0) | % 19.15/3.50 ~ (v5 = 0) | ~ (v4 = 0) | ~ (v3 = 0)))) & ! [v0: $i] : ! [v1: $i] : % 19.15/3.50 ! [v2: $i] : (v2 = use | ~ (a_select3(u_defuse, v0, v1) = v2) | ~ $i(v1) | % 19.15/3.50 ~ $i(v0) | ? [v3: any] : ? [v4: any] : ? [v5: any] : ? [v6: any] : % 19.15/3.50 (leq(v1, n998) = v6 & leq(v0, n2) = v5 & leq(n0, v1) = v4 & leq(n0, v0) = v3 % 19.15/3.50 & ( ~ (v6 = 0) | ~ (v5 = 0) | ~ (v4 = 0) | ~ (v3 = 0)))) & ? [v0: $i] % 19.15/3.50 : ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = use) & a_select3(u_defuse, v0, v1) = % 19.15/3.50 v2 & leq(v1, n998) = 0 & leq(v0, n2) = 0 & leq(n0, v1) = 0 & leq(n0, v0) = 0 % 19.15/3.50 & $i(v2) & $i(v1) & $i(v0)) % 19.15/3.50 % 19.15/3.50 (function-axioms) % 19.15/3.51 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 19.15/3.51 $i] : (v1 = v0 | ~ (tptp_update3(v5, v4, v3, v2) = v1) | ~ % 19.15/3.51 (tptp_update3(v5, v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 19.15/3.51 $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_update2(v4, v3, v2) = % 19.15/3.51 v1) | ~ (tptp_update2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 19.15/3.51 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (sum(v4, v3, v2) = v1) | % 19.15/3.51 ~ (sum(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 19.15/3.51 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_const_array2(v4, v3, v2) = v1) | % 19.15/3.51 ~ (tptp_const_array2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 19.15/3.51 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (a_select3(v4, v3, v2) = % 19.15/3.51 v1) | ~ (a_select3(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 19.15/3.51 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (minus(v3, v2) = v1) | ~ (minus(v3, % 19.15/3.51 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 19.15/3.51 = v0 | ~ (plus(v3, v2) = v1) | ~ (plus(v3, v2) = v0)) & ! [v0: $i] : ! % 19.15/3.51 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (tptp_mmul(v3, v2) = v1) % 19.15/3.51 | ~ (tptp_mmul(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 19.15/3.51 ! [v3: $i] : (v1 = v0 | ~ (tptp_msub(v3, v2) = v1) | ~ (tptp_msub(v3, v2) = % 19.15/3.51 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 19.15/3.51 ~ (tptp_madd(v3, v2) = v1) | ~ (tptp_madd(v3, v2) = v0)) & ! [v0: $i] : ! % 19.15/3.51 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (dim(v3, v2) = v1) | ~ % 19.15/3.51 (dim(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 19.15/3.51 : (v1 = v0 | ~ (tptp_const_array1(v3, v2) = v1) | ~ (tptp_const_array1(v3, % 19.15/3.51 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 19.15/3.51 = v0 | ~ (a_select2(v3, v2) = v1) | ~ (a_select2(v3, v2) = v0)) & ! [v0: % 19.15/3.51 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 19.15/3.51 (uniform_int_rnd(v3, v2) = v1) | ~ (uniform_int_rnd(v3, v2) = v0)) & ! % 19.15/3.51 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 19.15/3.51 $i] : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0: % 19.15/3.51 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 19.15/3.51 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0: % 19.15/3.51 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 19.15/3.51 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 19.15/3.51 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 19.15/3.51 : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0: $i] : ! % 19.15/3.51 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (inv(v2) = v1) | ~ (inv(v2) = v0)) & % 19.15/3.51 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (trans(v2) = v1) | ~ % 19.15/3.51 (trans(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 19.15/3.51 (succ(v2) = v1) | ~ (succ(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 19.15/3.51 $i] : (v1 = v0 | ~ (pred(v2) = v1) | ~ (pred(v2) = v0)) % 19.15/3.51 % 19.15/3.51 Further assumptions not needed in the proof: % 19.15/3.51 -------------------------------------------- % 19.15/3.51 const_array1_select, const_array2_select, defuse, finite_domain_0, % 19.15/3.51 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 19.15/3.51 finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1, % 19.15/3.51 gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2, gt_3_tptp_minus_1, gt_4_0, gt_4_1, % 19.15/3.51 gt_4_2, gt_4_3, gt_4_tptp_minus_1, gt_5_0, gt_5_1, gt_5_2, gt_5_3, gt_5_4, % 19.15/3.51 gt_5_tptp_minus_1, gt_998_0, gt_998_1, gt_998_2, gt_998_3, gt_998_4, gt_998_5, % 19.15/3.51 gt_998_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2, % 19.15/3.51 leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ, % 19.15/3.51 lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv, % 19.15/3.51 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 19.15/3.51 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq, % 19.15/3.51 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2, % 19.15/3.51 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, % 19.15/3.51 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, % 19.15/3.51 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2, % 19.15/3.51 successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float, % 19.15/3.51 totality, transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi, % 19.15/3.51 uniform_int_rand_ranges_lo % 19.15/3.51 % 19.15/3.51 Those formulas are unsatisfiable: % 19.15/3.51 --------------------------------- % 19.15/3.51 % 19.15/3.51 Begin of proof % 19.15/3.51 | % 19.15/3.51 | ALPHA: (quaternion_ds1_inuse_0017) implies: % 19.15/3.51 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = use | ~ % 19.15/3.51 | (a_select3(u_defuse, v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: % 19.15/3.51 | any] : ? [v4: any] : ? [v5: any] : ? [v6: any] : (leq(v1, n998) % 19.15/3.51 | = v6 & leq(v0, n2) = v5 & leq(n0, v1) = v4 & leq(n0, v0) = v3 & ( ~ % 19.15/3.51 | (v6 = 0) | ~ (v5 = 0) | ~ (v4 = 0) | ~ (v3 = 0)))) % 19.15/3.51 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = use) & % 19.15/3.51 | a_select3(u_defuse, v0, v1) = v2 & leq(v1, n998) = 0 & leq(v0, n2) = % 19.15/3.51 | 0 & leq(n0, v1) = 0 & leq(n0, v0) = 0 & $i(v2) & $i(v1) & $i(v0)) % 19.15/3.51 | % 19.15/3.51 | ALPHA: (function-axioms) implies: % 19.15/3.51 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 19.15/3.51 | ! [v3: $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) % 19.15/3.51 | % 19.15/3.51 | DELTA: instantiating (2) with fresh symbols all_58_0, all_58_1, all_58_2 % 19.15/3.51 | gives: % 19.15/3.51 | (4) ~ (all_58_0 = use) & a_select3(u_defuse, all_58_2, all_58_1) = % 19.15/3.51 | all_58_0 & leq(all_58_1, n998) = 0 & leq(all_58_2, n2) = 0 & leq(n0, % 19.15/3.51 | all_58_1) = 0 & leq(n0, all_58_2) = 0 & $i(all_58_0) & $i(all_58_1) & % 19.15/3.51 | $i(all_58_2) % 19.15/3.51 | % 19.15/3.51 | ALPHA: (4) implies: % 19.15/3.51 | (5) ~ (all_58_0 = use) % 19.15/3.52 | (6) $i(all_58_2) % 19.15/3.52 | (7) $i(all_58_1) % 19.15/3.52 | (8) leq(n0, all_58_2) = 0 % 19.15/3.52 | (9) leq(n0, all_58_1) = 0 % 19.15/3.52 | (10) leq(all_58_2, n2) = 0 % 19.15/3.52 | (11) leq(all_58_1, n998) = 0 % 19.15/3.52 | (12) a_select3(u_defuse, all_58_2, all_58_1) = all_58_0 % 19.15/3.52 | % 19.15/3.52 | GROUND_INST: instantiating (1) with all_58_2, all_58_1, all_58_0, simplifying % 19.15/3.52 | with (6), (7), (12) gives: % 19.15/3.52 | (13) all_58_0 = use | ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: % 19.15/3.52 | any] : (leq(all_58_1, n998) = v3 & leq(all_58_2, n2) = v2 & leq(n0, % 19.15/3.52 | all_58_1) = v1 & leq(n0, all_58_2) = v0 & ( ~ (v3 = 0) | ~ (v2 = % 19.15/3.52 | 0) | ~ (v1 = 0) | ~ (v0 = 0))) % 19.15/3.52 | % 19.15/3.52 | BETA: splitting (13) gives: % 19.15/3.52 | % 19.15/3.52 | Case 1: % 19.15/3.52 | | % 19.15/3.52 | | (14) all_58_0 = use % 19.15/3.52 | | % 19.15/3.52 | | REDUCE: (5), (14) imply: % 19.15/3.52 | | (15) $false % 19.15/3.52 | | % 19.15/3.52 | | CLOSE: (15) is inconsistent. % 19.15/3.52 | | % 19.15/3.52 | Case 2: % 19.15/3.52 | | % 19.15/3.52 | | (16) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] : % 19.15/3.52 | | (leq(all_58_1, n998) = v3 & leq(all_58_2, n2) = v2 & leq(n0, % 19.15/3.52 | | all_58_1) = v1 & leq(n0, all_58_2) = v0 & ( ~ (v3 = 0) | ~ (v2 % 19.15/3.52 | | = 0) | ~ (v1 = 0) | ~ (v0 = 0))) % 19.15/3.52 | | % 19.15/3.52 | | DELTA: instantiating (16) with fresh symbols all_105_0, all_105_1, % 19.15/3.52 | | all_105_2, all_105_3 gives: % 19.15/3.52 | | (17) leq(all_58_1, n998) = all_105_0 & leq(all_58_2, n2) = all_105_1 & % 19.15/3.52 | | leq(n0, all_58_1) = all_105_2 & leq(n0, all_58_2) = all_105_3 & ( ~ % 19.15/3.52 | | (all_105_0 = 0) | ~ (all_105_1 = 0) | ~ (all_105_2 = 0) | ~ % 19.15/3.52 | | (all_105_3 = 0)) % 19.15/3.52 | | % 19.15/3.52 | | ALPHA: (17) implies: % 19.15/3.52 | | (18) leq(n0, all_58_2) = all_105_3 % 19.15/3.52 | | (19) leq(n0, all_58_1) = all_105_2 % 19.15/3.52 | | (20) leq(all_58_2, n2) = all_105_1 % 19.15/3.52 | | (21) leq(all_58_1, n998) = all_105_0 % 19.15/3.52 | | (22) ~ (all_105_0 = 0) | ~ (all_105_1 = 0) | ~ (all_105_2 = 0) | ~ % 19.15/3.52 | | (all_105_3 = 0) % 19.15/3.52 | | % 19.15/3.52 | | GROUND_INST: instantiating (3) with 0, all_105_3, all_58_2, n0, simplifying % 19.15/3.52 | | with (8), (18) gives: % 19.15/3.52 | | (23) all_105_3 = 0 % 19.15/3.52 | | % 19.15/3.52 | | GROUND_INST: instantiating (3) with 0, all_105_2, all_58_1, n0, simplifying % 19.15/3.52 | | with (9), (19) gives: % 19.15/3.52 | | (24) all_105_2 = 0 % 19.15/3.52 | | % 19.15/3.52 | | GROUND_INST: instantiating (3) with 0, all_105_1, n2, all_58_2, simplifying % 19.15/3.52 | | with (10), (20) gives: % 19.15/3.52 | | (25) all_105_1 = 0 % 19.15/3.52 | | % 19.15/3.52 | | GROUND_INST: instantiating (3) with 0, all_105_0, n998, all_58_1, % 19.15/3.52 | | simplifying with (11), (21) gives: % 19.15/3.52 | | (26) all_105_0 = 0 % 19.15/3.52 | | % 19.15/3.52 | | BETA: splitting (22) gives: % 19.15/3.52 | | % 19.15/3.52 | | Case 1: % 19.15/3.52 | | | % 19.15/3.53 | | | (27) ~ (all_105_0 = 0) % 19.15/3.53 | | | % 19.15/3.53 | | | REDUCE: (26), (27) imply: % 19.15/3.53 | | | (28) $false % 19.15/3.53 | | | % 19.15/3.53 | | | CLOSE: (28) is inconsistent. % 19.15/3.53 | | | % 19.15/3.53 | | Case 2: % 19.15/3.53 | | | % 19.15/3.53 | | | (29) ~ (all_105_1 = 0) | ~ (all_105_2 = 0) | ~ (all_105_3 = 0) % 19.15/3.53 | | | % 19.15/3.53 | | | BETA: splitting (29) gives: % 19.15/3.53 | | | % 19.15/3.53 | | | Case 1: % 19.15/3.53 | | | | % 19.15/3.53 | | | | (30) ~ (all_105_1 = 0) % 19.15/3.53 | | | | % 19.15/3.53 | | | | REDUCE: (25), (30) imply: % 19.15/3.53 | | | | (31) $false % 19.15/3.53 | | | | % 19.15/3.53 | | | | CLOSE: (31) is inconsistent. % 19.15/3.53 | | | | % 19.15/3.53 | | | Case 2: % 19.15/3.53 | | | | % 19.15/3.53 | | | | (32) ~ (all_105_2 = 0) | ~ (all_105_3 = 0) % 19.15/3.53 | | | | % 19.15/3.53 | | | | BETA: splitting (32) gives: % 19.15/3.53 | | | | % 19.15/3.53 | | | | Case 1: % 19.15/3.53 | | | | | % 19.15/3.53 | | | | | (33) ~ (all_105_2 = 0) % 19.15/3.53 | | | | | % 19.15/3.53 | | | | | REDUCE: (24), (33) imply: % 19.15/3.53 | | | | | (34) $false % 19.15/3.53 | | | | | % 19.15/3.53 | | | | | CLOSE: (34) is inconsistent. % 19.15/3.53 | | | | | % 19.15/3.53 | | | | Case 2: % 19.15/3.53 | | | | | % 19.15/3.53 | | | | | (35) ~ (all_105_3 = 0) % 19.15/3.53 | | | | | % 19.15/3.53 | | | | | REDUCE: (23), (35) imply: % 19.15/3.53 | | | | | (36) $false % 19.15/3.53 | | | | | % 19.15/3.53 | | | | | CLOSE: (36) is inconsistent. % 19.15/3.53 | | | | | % 19.15/3.53 | | | | End of split % 19.15/3.53 | | | | % 19.15/3.53 | | | End of split % 19.15/3.53 | | | % 19.15/3.53 | | End of split % 19.15/3.53 | | % 19.15/3.53 | End of split % 19.15/3.53 | % 19.15/3.53 End of proof % 19.15/3.53 % SZS output end Proof for theBenchmark % 19.15/3.53 % 19.15/3.53 2935ms %------------------------------------------------------------------------------