TSTP Solution File: SWV192+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV192+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 : n018.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:17 EDT 2023
% Result : Theorem 15.46s 2.86s
% Output : Proof 19.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV192+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 08:47:02 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.65 ________ _____
% 0.20/0.65 ___ __ \_________(_)________________________________
% 0.20/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.65
% 0.20/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.65 (2023-06-19)
% 0.20/0.65
% 0.20/0.65 (c) Philipp Rümmer, 2009-2023
% 0.20/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.65 Amanda Stjerna.
% 0.20/0.65 Free software under BSD-3-Clause.
% 0.20/0.65
% 0.20/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.65
% 0.20/0.65 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.67 Running up to 7 provers in parallel.
% 0.20/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 5.47/1.56 Prover 1: Preprocessing ...
% 5.76/1.56 Prover 4: Preprocessing ...
% 5.76/1.58 Prover 6: Preprocessing ...
% 5.76/1.58 Prover 3: Preprocessing ...
% 5.76/1.58 Prover 2: Preprocessing ...
% 5.76/1.58 Prover 0: Preprocessing ...
% 5.76/1.58 Prover 5: Preprocessing ...
% 11.87/2.40 Prover 1: Warning: ignoring some quantifiers
% 12.51/2.44 Prover 3: Warning: ignoring some quantifiers
% 12.51/2.46 Prover 6: Proving ...
% 12.51/2.47 Prover 3: Constructing countermodel ...
% 12.80/2.48 Prover 4: Warning: ignoring some quantifiers
% 12.80/2.48 Prover 1: Constructing countermodel ...
% 12.80/2.59 Prover 4: Constructing countermodel ...
% 13.80/2.67 Prover 0: Proving ...
% 13.80/2.67 Prover 5: Proving ...
% 14.27/2.69 Prover 2: Proving ...
% 15.46/2.85 Prover 3: proved (2179ms)
% 15.46/2.85
% 15.46/2.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.46/2.86
% 15.46/2.86 Prover 2: stopped
% 15.46/2.86 Prover 6: stopped
% 15.46/2.86 Prover 0: stopped
% 15.46/2.89 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 15.46/2.89 Prover 5: stopped
% 15.46/2.89 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 15.46/2.89 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 15.46/2.89 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 15.46/2.89 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 17.17/3.07 Prover 13: Preprocessing ...
% 17.17/3.07 Prover 11: Preprocessing ...
% 17.30/3.08 Prover 10: Preprocessing ...
% 17.30/3.08 Prover 8: Preprocessing ...
% 17.30/3.09 Prover 7: Preprocessing ...
% 17.30/3.12 Prover 1: Found proof (size 31)
% 17.30/3.12 Prover 1: proved (2446ms)
% 17.30/3.12 Prover 4: stopped
% 17.30/3.18 Prover 7: stopped
% 17.30/3.18 Prover 10: stopped
% 18.03/3.21 Prover 13: stopped
% 18.29/3.22 Prover 11: stopped
% 18.69/3.32 Prover 8: Warning: ignoring some quantifiers
% 18.69/3.34 Prover 8: Constructing countermodel ...
% 18.69/3.36 Prover 8: stopped
% 18.69/3.36
% 18.69/3.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.69/3.36
% 18.69/3.36 % SZS output start Proof for theBenchmark
% 18.69/3.37 Assumptions after simplification:
% 18.69/3.37 ---------------------------------
% 18.69/3.37
% 18.69/3.37 (quaternion_ds1_inuse_0003)
% 19.09/3.40 $i(z_defuse) & $i(n998) & $i(pv5) & $i(xinit_noise_defuse) &
% 19.09/3.40 $i(xinit_mean_defuse) & $i(xinit_defuse) & $i(u_defuse) & $i(sigma_defuse) &
% 19.09/3.40 $i(rho_defuse) & $i(use) & $i(n5) & $i(n4) & $i(n3) & $i(n2) & $i(n1) & $i(n0)
% 19.09/3.40 & ? [v0: $i] : (a_select3(u_defuse, n2, n0) = use & a_select3(u_defuse, n1,
% 19.09/3.40 n0) = use & a_select3(u_defuse, n0, n0) = use &
% 19.09/3.40 a_select2(xinit_noise_defuse, n5) = use & a_select2(xinit_noise_defuse, n4)
% 19.09/3.40 = use & a_select2(xinit_noise_defuse, n3) = use &
% 19.09/3.40 a_select2(xinit_noise_defuse, n2) = use & a_select2(xinit_noise_defuse, n1)
% 19.09/3.40 = use & a_select2(xinit_noise_defuse, n0) = use &
% 19.09/3.40 a_select2(xinit_mean_defuse, n5) = use & a_select2(xinit_mean_defuse, n4) =
% 19.09/3.40 use & a_select2(xinit_mean_defuse, n3) = use & a_select2(xinit_mean_defuse,
% 19.09/3.40 n2) = use & a_select2(xinit_mean_defuse, n1) = use &
% 19.09/3.40 a_select2(xinit_mean_defuse, n0) = use & a_select2(xinit_defuse, n5) = use &
% 19.09/3.40 a_select2(xinit_defuse, n4) = use & a_select2(xinit_defuse, n3) = use &
% 19.09/3.40 a_select2(sigma_defuse, n5) = use & a_select2(sigma_defuse, n4) = use &
% 19.09/3.40 a_select2(sigma_defuse, n3) = use & a_select2(sigma_defuse, n2) = use &
% 19.09/3.40 a_select2(sigma_defuse, n1) = use & a_select2(sigma_defuse, n0) = use &
% 19.09/3.40 a_select2(rho_defuse, n2) = use & a_select2(rho_defuse, n1) = use &
% 19.09/3.40 a_select2(rho_defuse, n0) = use & pred(pv5) = v0 & leq(pv5, n998) = 0 &
% 19.09/3.40 leq(pv5, n0) = 0 & leq(n0, pv5) = 0 & gt(pv5, n0) = 0 & $i(v0) & ! [v1: $i]
% 19.09/3.40 : ! [v2: $i] : ( ~ (leq(v2, v0) = 0) | ~ (leq(v1, n2) = 0) | ~ $i(v2) |
% 19.09/3.40 ~ $i(v1) | ? [v3: any] : ? [v4: any] : ? [v5: $i] :
% 19.09/3.40 (a_select3(z_defuse, v1, v2) = v5 & leq(n0, v2) = v4 & leq(n0, v1) = v3 &
% 19.09/3.40 $i(v5) & ( ~ (v4 = 0) | ~ (v3 = 0) | v5 = use))) & ! [v1: $i] : !
% 19.09/3.40 [v2: $i] : ( ~ (leq(v2, v0) = 0) | ~ (leq(v1, n2) = 0) | ~ $i(v2) | ~
% 19.09/3.40 $i(v1) | ? [v3: any] : ? [v4: any] : ? [v5: $i] : (a_select3(u_defuse,
% 19.09/3.40 v1, v2) = v5 & leq(n0, v2) = v4 & leq(n0, v1) = v3 & $i(v5) & ( ~ (v4
% 19.09/3.40 = 0) | ~ (v3 = 0) | v5 = use))) & ? [v1: $i] : ? [v2: $i] : ?
% 19.09/3.40 [v3: $i] : ( ~ (v3 = use) & a_select3(u_defuse, v1, v2) = v3 & leq(v2, v0) =
% 19.09/3.40 0 & leq(v1, n2) = 0 & leq(n0, v2) = 0 & leq(n0, v1) = 0 & $i(v3) & $i(v2)
% 19.09/3.40 & $i(v1) & ( ~ (v2 = pv5) | ~ (v1 = n2)) & ( ~ (v2 = pv5) | ~ (v1 = n1))
% 19.09/3.40 & ( ~ (v2 = pv5) | ~ (v1 = n0))))
% 19.09/3.40
% 19.09/3.41 (function-axioms)
% 19.09/3.41 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 19.09/3.41 $i] : (v1 = v0 | ~ (tptp_update3(v5, v4, v3, v2) = v1) | ~
% 19.09/3.41 (tptp_update3(v5, v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2:
% 19.09/3.41 $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_update2(v4, v3, v2) =
% 19.09/3.41 v1) | ~ (tptp_update2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 19.09/3.41 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (sum(v4, v3, v2) = v1) |
% 19.09/3.41 ~ (sum(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : !
% 19.09/3.41 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_const_array2(v4, v3, v2) = v1) |
% 19.09/3.41 ~ (tptp_const_array2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 19.09/3.41 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (a_select3(v4, v3, v2) =
% 19.09/3.41 v1) | ~ (a_select3(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 19.09/3.41 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (minus(v3, v2) = v1) | ~ (minus(v3,
% 19.09/3.41 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1
% 19.09/3.41 = v0 | ~ (plus(v3, v2) = v1) | ~ (plus(v3, v2) = v0)) & ! [v0: $i] : !
% 19.09/3.41 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (tptp_mmul(v3, v2) = v1)
% 19.09/3.41 | ~ (tptp_mmul(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 19.09/3.41 ! [v3: $i] : (v1 = v0 | ~ (tptp_msub(v3, v2) = v1) | ~ (tptp_msub(v3, v2) =
% 19.09/3.41 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 |
% 19.09/3.41 ~ (tptp_madd(v3, v2) = v1) | ~ (tptp_madd(v3, v2) = v0)) & ! [v0: $i] : !
% 19.09/3.41 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (dim(v3, v2) = v1) | ~
% 19.09/3.41 (dim(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i]
% 19.09/3.41 : (v1 = v0 | ~ (tptp_const_array1(v3, v2) = v1) | ~ (tptp_const_array1(v3,
% 19.09/3.41 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1
% 19.09/3.41 = v0 | ~ (a_select2(v3, v2) = v1) | ~ (a_select2(v3, v2) = v0)) & ! [v0:
% 19.09/3.41 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 19.09/3.41 (uniform_int_rnd(v3, v2) = v1) | ~ (uniform_int_rnd(v3, v2) = v0)) & !
% 19.09/3.41 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 19.09/3.41 $i] : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0:
% 19.09/3.41 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 19.09/3.41 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0:
% 19.09/3.41 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 19.09/3.41 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0:
% 19.09/3.41 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 19.09/3.41 : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0: $i] : !
% 19.09/3.41 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (inv(v2) = v1) | ~ (inv(v2) = v0)) &
% 19.09/3.41 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (trans(v2) = v1) | ~
% 19.09/3.41 (trans(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 19.09/3.41 (succ(v2) = v1) | ~ (succ(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2:
% 19.09/3.41 $i] : (v1 = v0 | ~ (pred(v2) = v1) | ~ (pred(v2) = v0))
% 19.09/3.41
% 19.09/3.41 Further assumptions not needed in the proof:
% 19.09/3.41 --------------------------------------------
% 19.09/3.41 const_array1_select, const_array2_select, defuse, finite_domain_0,
% 19.09/3.41 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4,
% 19.09/3.41 finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1,
% 19.09/3.41 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.09/3.41 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.09/3.41 gt_5_tptp_minus_1, gt_998_0, gt_998_1, gt_998_2, gt_998_3, gt_998_4, gt_998_5,
% 19.09/3.41 gt_998_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2,
% 19.09/3.41 leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ,
% 19.09/3.41 lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv,
% 19.09/3.41 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans,
% 19.09/3.41 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq,
% 19.09/3.41 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2,
% 19.09/3.41 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r,
% 19.09/3.41 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l,
% 19.09/3.41 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2,
% 19.09/3.41 successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float,
% 19.09/3.41 totality, transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi,
% 19.09/3.41 uniform_int_rand_ranges_lo
% 19.09/3.41
% 19.09/3.41 Those formulas are unsatisfiable:
% 19.09/3.41 ---------------------------------
% 19.09/3.41
% 19.09/3.41 Begin of proof
% 19.09/3.41 |
% 19.09/3.41 | ALPHA: (quaternion_ds1_inuse_0003) implies:
% 19.09/3.42 | (1) ? [v0: $i] : (a_select3(u_defuse, n2, n0) = use & a_select3(u_defuse,
% 19.09/3.42 | n1, n0) = use & a_select3(u_defuse, n0, n0) = use &
% 19.09/3.42 | a_select2(xinit_noise_defuse, n5) = use &
% 19.09/3.42 | a_select2(xinit_noise_defuse, n4) = use &
% 19.09/3.42 | a_select2(xinit_noise_defuse, n3) = use &
% 19.09/3.42 | a_select2(xinit_noise_defuse, n2) = use &
% 19.09/3.42 | a_select2(xinit_noise_defuse, n1) = use &
% 19.09/3.42 | a_select2(xinit_noise_defuse, n0) = use &
% 19.09/3.42 | a_select2(xinit_mean_defuse, n5) = use & a_select2(xinit_mean_defuse,
% 19.09/3.42 | n4) = use & a_select2(xinit_mean_defuse, n3) = use &
% 19.09/3.42 | a_select2(xinit_mean_defuse, n2) = use & a_select2(xinit_mean_defuse,
% 19.09/3.42 | n1) = use & a_select2(xinit_mean_defuse, n0) = use &
% 19.09/3.42 | a_select2(xinit_defuse, n5) = use & a_select2(xinit_defuse, n4) = use
% 19.09/3.42 | & a_select2(xinit_defuse, n3) = use & a_select2(sigma_defuse, n5) =
% 19.09/3.42 | use & a_select2(sigma_defuse, n4) = use & a_select2(sigma_defuse, n3)
% 19.09/3.42 | = use & a_select2(sigma_defuse, n2) = use & a_select2(sigma_defuse,
% 19.09/3.42 | n1) = use & a_select2(sigma_defuse, n0) = use &
% 19.09/3.42 | a_select2(rho_defuse, n2) = use & a_select2(rho_defuse, n1) = use &
% 19.09/3.42 | a_select2(rho_defuse, n0) = use & pred(pv5) = v0 & leq(pv5, n998) = 0
% 19.09/3.42 | & leq(pv5, n0) = 0 & leq(n0, pv5) = 0 & gt(pv5, n0) = 0 & $i(v0) & !
% 19.09/3.42 | [v1: $i] : ! [v2: $i] : ( ~ (leq(v2, v0) = 0) | ~ (leq(v1, n2) = 0)
% 19.09/3.42 | | ~ $i(v2) | ~ $i(v1) | ? [v3: any] : ? [v4: any] : ? [v5: $i]
% 19.09/3.42 | : (a_select3(z_defuse, v1, v2) = v5 & leq(n0, v2) = v4 & leq(n0,
% 19.09/3.42 | v1) = v3 & $i(v5) & ( ~ (v4 = 0) | ~ (v3 = 0) | v5 = use))) &
% 19.09/3.42 | ! [v1: $i] : ! [v2: $i] : ( ~ (leq(v2, v0) = 0) | ~ (leq(v1, n2) =
% 19.09/3.42 | 0) | ~ $i(v2) | ~ $i(v1) | ? [v3: any] : ? [v4: any] : ?
% 19.09/3.42 | [v5: $i] : (a_select3(u_defuse, v1, v2) = v5 & leq(n0, v2) = v4 &
% 19.09/3.42 | leq(n0, v1) = v3 & $i(v5) & ( ~ (v4 = 0) | ~ (v3 = 0) | v5 =
% 19.09/3.42 | use))) & ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v3 =
% 19.09/3.42 | use) & a_select3(u_defuse, v1, v2) = v3 & leq(v2, v0) = 0 &
% 19.09/3.42 | leq(v1, n2) = 0 & leq(n0, v2) = 0 & leq(n0, v1) = 0 & $i(v3) &
% 19.09/3.42 | $i(v2) & $i(v1) & ( ~ (v2 = pv5) | ~ (v1 = n2)) & ( ~ (v2 = pv5) |
% 19.09/3.42 | ~ (v1 = n1)) & ( ~ (v2 = pv5) | ~ (v1 = n0))))
% 19.09/3.42 |
% 19.09/3.42 | ALPHA: (function-axioms) implies:
% 19.09/3.42 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 19.09/3.42 | ! [v3: $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0))
% 19.09/3.42 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] :
% 19.09/3.42 | (v1 = v0 | ~ (a_select3(v4, v3, v2) = v1) | ~ (a_select3(v4, v3, v2)
% 19.09/3.42 | = v0))
% 19.09/3.42 |
% 19.09/3.42 | DELTA: instantiating (1) with fresh symbol all_76_0 gives:
% 19.09/3.43 | (4) a_select3(u_defuse, n2, n0) = use & a_select3(u_defuse, n1, n0) = use &
% 19.09/3.43 | a_select3(u_defuse, n0, n0) = use & a_select2(xinit_noise_defuse, n5) =
% 19.09/3.43 | use & a_select2(xinit_noise_defuse, n4) = use &
% 19.09/3.43 | a_select2(xinit_noise_defuse, n3) = use & a_select2(xinit_noise_defuse,
% 19.09/3.43 | n2) = use & a_select2(xinit_noise_defuse, n1) = use &
% 19.09/3.43 | a_select2(xinit_noise_defuse, n0) = use & a_select2(xinit_mean_defuse,
% 19.09/3.43 | n5) = use & a_select2(xinit_mean_defuse, n4) = use &
% 19.09/3.43 | a_select2(xinit_mean_defuse, n3) = use & a_select2(xinit_mean_defuse,
% 19.09/3.43 | n2) = use & a_select2(xinit_mean_defuse, n1) = use &
% 19.09/3.43 | a_select2(xinit_mean_defuse, n0) = use & a_select2(xinit_defuse, n5) =
% 19.09/3.43 | use & a_select2(xinit_defuse, n4) = use & a_select2(xinit_defuse, n3) =
% 19.09/3.43 | use & a_select2(sigma_defuse, n5) = use & a_select2(sigma_defuse, n4) =
% 19.09/3.43 | use & a_select2(sigma_defuse, n3) = use & a_select2(sigma_defuse, n2) =
% 19.09/3.43 | use & a_select2(sigma_defuse, n1) = use & a_select2(sigma_defuse, n0) =
% 19.09/3.43 | use & a_select2(rho_defuse, n2) = use & a_select2(rho_defuse, n1) = use
% 19.09/3.43 | & a_select2(rho_defuse, n0) = use & pred(pv5) = all_76_0 & leq(pv5,
% 19.09/3.43 | n998) = 0 & leq(pv5, n0) = 0 & leq(n0, pv5) = 0 & gt(pv5, n0) = 0 &
% 19.09/3.43 | $i(all_76_0) & ! [v0: $i] : ! [v1: $i] : ( ~ (leq(v1, all_76_0) = 0)
% 19.09/3.43 | | ~ (leq(v0, n2) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: any] : ?
% 19.09/3.43 | [v3: any] : ? [v4: $i] : (a_select3(z_defuse, v0, v1) = v4 & leq(n0,
% 19.09/3.43 | v1) = v3 & leq(n0, v0) = v2 & $i(v4) & ( ~ (v3 = 0) | ~ (v2 = 0)
% 19.09/3.43 | | v4 = use))) & ! [v0: $i] : ! [v1: $i] : ( ~ (leq(v1,
% 19.09/3.43 | all_76_0) = 0) | ~ (leq(v0, n2) = 0) | ~ $i(v1) | ~ $i(v0) |
% 19.09/3.43 | ? [v2: any] : ? [v3: any] : ? [v4: $i] : (a_select3(u_defuse, v0,
% 19.09/3.43 | v1) = v4 & leq(n0, v1) = v3 & leq(n0, v0) = v2 & $i(v4) & ( ~ (v3
% 19.09/3.43 | = 0) | ~ (v2 = 0) | v4 = use))) & ? [v0: $i] : ? [v1: $i] :
% 19.09/3.43 | ? [v2: $i] : ( ~ (v2 = use) & a_select3(u_defuse, v0, v1) = v2 &
% 19.09/3.43 | leq(v1, all_76_0) = 0 & leq(v0, n2) = 0 & leq(n0, v1) = 0 & leq(n0,
% 19.09/3.43 | v0) = 0 & $i(v2) & $i(v1) & $i(v0) & ( ~ (v1 = pv5) | ~ (v0 = n2))
% 19.09/3.43 | & ( ~ (v1 = pv5) | ~ (v0 = n1)) & ( ~ (v1 = pv5) | ~ (v0 = n0)))
% 19.09/3.43 |
% 19.09/3.43 | ALPHA: (4) implies:
% 19.09/3.43 | (5) ! [v0: $i] : ! [v1: $i] : ( ~ (leq(v1, all_76_0) = 0) | ~ (leq(v0,
% 19.09/3.43 | n2) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] :
% 19.09/3.43 | ? [v4: $i] : (a_select3(u_defuse, v0, v1) = v4 & leq(n0, v1) = v3 &
% 19.09/3.43 | leq(n0, v0) = v2 & $i(v4) & ( ~ (v3 = 0) | ~ (v2 = 0) | v4 =
% 19.09/3.43 | use)))
% 19.09/3.43 | (6) ! [v0: $i] : ! [v1: $i] : ( ~ (leq(v1, all_76_0) = 0) | ~ (leq(v0,
% 19.09/3.43 | n2) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] :
% 19.09/3.43 | ? [v4: $i] : (a_select3(z_defuse, v0, v1) = v4 & leq(n0, v1) = v3 &
% 19.09/3.43 | leq(n0, v0) = v2 & $i(v4) & ( ~ (v3 = 0) | ~ (v2 = 0) | v4 =
% 19.09/3.43 | use)))
% 19.09/3.43 | (7) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = use) &
% 19.09/3.43 | a_select3(u_defuse, v0, v1) = v2 & leq(v1, all_76_0) = 0 & leq(v0,
% 19.09/3.43 | n2) = 0 & leq(n0, v1) = 0 & leq(n0, v0) = 0 & $i(v2) & $i(v1) &
% 19.09/3.43 | $i(v0) & ( ~ (v1 = pv5) | ~ (v0 = n2)) & ( ~ (v1 = pv5) | ~ (v0 =
% 19.09/3.43 | n1)) & ( ~ (v1 = pv5) | ~ (v0 = n0)))
% 19.09/3.43 |
% 19.09/3.43 | DELTA: instantiating (7) with fresh symbols all_79_0, all_79_1, all_79_2
% 19.09/3.43 | gives:
% 19.09/3.43 | (8) ~ (all_79_0 = use) & a_select3(u_defuse, all_79_2, all_79_1) =
% 19.09/3.43 | all_79_0 & leq(all_79_1, all_76_0) = 0 & leq(all_79_2, n2) = 0 &
% 19.09/3.43 | leq(n0, all_79_1) = 0 & leq(n0, all_79_2) = 0 & $i(all_79_0) &
% 19.09/3.43 | $i(all_79_1) & $i(all_79_2) & ( ~ (all_79_1 = pv5) | ~ (all_79_2 =
% 19.09/3.43 | n2)) & ( ~ (all_79_1 = pv5) | ~ (all_79_2 = n1)) & ( ~ (all_79_1 =
% 19.09/3.43 | pv5) | ~ (all_79_2 = n0))
% 19.09/3.43 |
% 19.09/3.43 | ALPHA: (8) implies:
% 19.09/3.43 | (9) ~ (all_79_0 = use)
% 19.09/3.43 | (10) $i(all_79_2)
% 19.09/3.43 | (11) $i(all_79_1)
% 19.09/3.43 | (12) leq(n0, all_79_2) = 0
% 19.09/3.43 | (13) leq(n0, all_79_1) = 0
% 19.09/3.43 | (14) leq(all_79_2, n2) = 0
% 19.09/3.43 | (15) leq(all_79_1, all_76_0) = 0
% 19.09/3.43 | (16) a_select3(u_defuse, all_79_2, all_79_1) = all_79_0
% 19.09/3.43 |
% 19.09/3.43 | GROUND_INST: instantiating (6) with all_79_2, all_79_1, simplifying with (10),
% 19.09/3.43 | (11), (14), (15) gives:
% 19.09/3.43 | (17) ? [v0: any] : ? [v1: any] : ? [v2: $i] : (a_select3(z_defuse,
% 19.09/3.43 | all_79_2, all_79_1) = v2 & leq(n0, all_79_1) = v1 & leq(n0,
% 19.09/3.43 | all_79_2) = v0 & $i(v2) & ( ~ (v1 = 0) | ~ (v0 = 0) | v2 = use))
% 19.09/3.43 |
% 19.09/3.43 | GROUND_INST: instantiating (5) with all_79_2, all_79_1, simplifying with (10),
% 19.09/3.43 | (11), (14), (15) gives:
% 19.09/3.44 | (18) ? [v0: any] : ? [v1: any] : ? [v2: $i] : (a_select3(u_defuse,
% 19.09/3.44 | all_79_2, all_79_1) = v2 & leq(n0, all_79_1) = v1 & leq(n0,
% 19.09/3.44 | all_79_2) = v0 & $i(v2) & ( ~ (v1 = 0) | ~ (v0 = 0) | v2 = use))
% 19.09/3.44 |
% 19.09/3.44 | DELTA: instantiating (18) with fresh symbols all_103_0, all_103_1, all_103_2
% 19.09/3.44 | gives:
% 19.09/3.44 | (19) a_select3(u_defuse, all_79_2, all_79_1) = all_103_0 & leq(n0,
% 19.09/3.44 | all_79_1) = all_103_1 & leq(n0, all_79_2) = all_103_2 &
% 19.09/3.44 | $i(all_103_0) & ( ~ (all_103_1 = 0) | ~ (all_103_2 = 0) | all_103_0 =
% 19.09/3.44 | use)
% 19.09/3.44 |
% 19.09/3.44 | ALPHA: (19) implies:
% 19.09/3.44 | (20) leq(n0, all_79_2) = all_103_2
% 19.09/3.44 | (21) leq(n0, all_79_1) = all_103_1
% 19.09/3.44 | (22) a_select3(u_defuse, all_79_2, all_79_1) = all_103_0
% 19.09/3.44 | (23) ~ (all_103_1 = 0) | ~ (all_103_2 = 0) | all_103_0 = use
% 19.09/3.44 |
% 19.09/3.44 | DELTA: instantiating (17) with fresh symbols all_105_0, all_105_1, all_105_2
% 19.09/3.44 | gives:
% 19.09/3.44 | (24) a_select3(z_defuse, all_79_2, all_79_1) = all_105_0 & leq(n0,
% 19.09/3.44 | all_79_1) = all_105_1 & leq(n0, all_79_2) = all_105_2 &
% 19.09/3.44 | $i(all_105_0) & ( ~ (all_105_1 = 0) | ~ (all_105_2 = 0) | all_105_0 =
% 19.09/3.44 | use)
% 19.09/3.44 |
% 19.09/3.44 | ALPHA: (24) implies:
% 19.09/3.44 | (25) leq(n0, all_79_2) = all_105_2
% 19.09/3.44 | (26) leq(n0, all_79_1) = all_105_1
% 19.09/3.44 |
% 19.09/3.44 | GROUND_INST: instantiating (2) with 0, all_105_2, all_79_2, n0, simplifying
% 19.09/3.44 | with (12), (25) gives:
% 19.09/3.44 | (27) all_105_2 = 0
% 19.09/3.44 |
% 19.09/3.44 | GROUND_INST: instantiating (2) with all_103_2, all_105_2, all_79_2, n0,
% 19.09/3.44 | simplifying with (20), (25) gives:
% 19.09/3.44 | (28) all_105_2 = all_103_2
% 19.09/3.44 |
% 19.09/3.44 | GROUND_INST: instantiating (2) with 0, all_105_1, all_79_1, n0, simplifying
% 19.09/3.44 | with (13), (26) gives:
% 19.09/3.44 | (29) all_105_1 = 0
% 19.09/3.44 |
% 19.09/3.44 | GROUND_INST: instantiating (2) with all_103_1, all_105_1, all_79_1, n0,
% 19.09/3.44 | simplifying with (21), (26) gives:
% 19.09/3.44 | (30) all_105_1 = all_103_1
% 19.09/3.44 |
% 19.09/3.44 | GROUND_INST: instantiating (3) with all_79_0, all_103_0, all_79_1, all_79_2,
% 19.09/3.44 | u_defuse, simplifying with (16), (22) gives:
% 19.09/3.44 | (31) all_103_0 = all_79_0
% 19.09/3.44 |
% 19.09/3.44 | COMBINE_EQS: (29), (30) imply:
% 19.09/3.44 | (32) all_103_1 = 0
% 19.09/3.44 |
% 19.09/3.44 | COMBINE_EQS: (27), (28) imply:
% 19.09/3.44 | (33) all_103_2 = 0
% 19.09/3.44 |
% 19.09/3.44 | SIMP: (33) implies:
% 19.09/3.44 | (34) all_103_2 = 0
% 19.09/3.44 |
% 19.09/3.44 | BETA: splitting (23) gives:
% 19.09/3.44 |
% 19.09/3.44 | Case 1:
% 19.09/3.44 | |
% 19.09/3.44 | | (35) ~ (all_103_1 = 0)
% 19.09/3.44 | |
% 19.09/3.44 | | REDUCE: (32), (35) imply:
% 19.09/3.44 | | (36) $false
% 19.09/3.44 | |
% 19.09/3.44 | | CLOSE: (36) is inconsistent.
% 19.09/3.44 | |
% 19.09/3.44 | Case 2:
% 19.09/3.44 | |
% 19.09/3.44 | | (37) ~ (all_103_2 = 0) | all_103_0 = use
% 19.09/3.44 | |
% 19.09/3.44 | | BETA: splitting (37) gives:
% 19.09/3.44 | |
% 19.09/3.44 | | Case 1:
% 19.09/3.44 | | |
% 19.09/3.44 | | | (38) ~ (all_103_2 = 0)
% 19.09/3.44 | | |
% 19.09/3.44 | | | REDUCE: (34), (38) imply:
% 19.09/3.44 | | | (39) $false
% 19.09/3.44 | | |
% 19.09/3.44 | | | CLOSE: (39) is inconsistent.
% 19.09/3.44 | | |
% 19.09/3.44 | | Case 2:
% 19.09/3.44 | | |
% 19.09/3.44 | | | (40) all_103_0 = use
% 19.09/3.44 | | |
% 19.09/3.44 | | | COMBINE_EQS: (31), (40) imply:
% 19.09/3.44 | | | (41) all_79_0 = use
% 19.09/3.44 | | |
% 19.09/3.44 | | | SIMP: (41) implies:
% 19.09/3.44 | | | (42) all_79_0 = use
% 19.09/3.44 | | |
% 19.09/3.44 | | | REDUCE: (9), (42) imply:
% 19.09/3.45 | | | (43) $false
% 19.09/3.45 | | |
% 19.09/3.45 | | | CLOSE: (43) is inconsistent.
% 19.09/3.45 | | |
% 19.09/3.45 | | End of split
% 19.09/3.45 | |
% 19.09/3.45 | End of split
% 19.09/3.45 |
% 19.09/3.45 End of proof
% 19.09/3.45 % SZS output end Proof for theBenchmark
% 19.09/3.45
% 19.09/3.45 2792ms
%------------------------------------------------------------------------------