TSTP Solution File: SWV135+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV135+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 : n031.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:03 EDT 2023
% Result : Theorem 15.44s 2.79s
% Output : Proof 20.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV135+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 03:47:40 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.61 ________ _____
% 0.21/0.61 ___ __ \_________(_)________________________________
% 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.61
% 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.61 (2023-06-19)
% 0.21/0.61
% 0.21/0.61 (c) Philipp Rümmer, 2009-2023
% 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.61 Amanda Stjerna.
% 0.21/0.61 Free software under BSD-3-Clause.
% 0.21/0.61
% 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.61
% 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.62 Running up to 7 provers in parallel.
% 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.17/1.37 Prover 4: Preprocessing ...
% 4.17/1.38 Prover 1: Preprocessing ...
% 4.94/1.42 Prover 5: Preprocessing ...
% 4.94/1.42 Prover 0: Preprocessing ...
% 4.94/1.42 Prover 3: Preprocessing ...
% 4.94/1.42 Prover 2: Preprocessing ...
% 4.94/1.43 Prover 6: Preprocessing ...
% 10.53/2.22 Prover 1: Warning: ignoring some quantifiers
% 11.25/2.26 Prover 3: Warning: ignoring some quantifiers
% 11.68/2.29 Prover 6: Proving ...
% 11.68/2.29 Prover 3: Constructing countermodel ...
% 11.68/2.30 Prover 1: Constructing countermodel ...
% 11.68/2.32 Prover 4: Warning: ignoring some quantifiers
% 12.23/2.38 Prover 5: Proving ...
% 12.57/2.42 Prover 4: Constructing countermodel ...
% 12.57/2.42 Prover 0: Proving ...
% 12.85/2.47 Prover 2: Proving ...
% 15.40/2.79 Prover 3: proved (2146ms)
% 15.40/2.79
% 15.44/2.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.44/2.79
% 15.44/2.79 Prover 6: stopped
% 15.44/2.79 Prover 2: stopped
% 15.44/2.79 Prover 5: stopped
% 15.44/2.79 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 15.44/2.79 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 15.44/2.79 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 15.44/2.80 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 15.54/2.81 Prover 0: stopped
% 15.57/2.82 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 15.57/2.86 Prover 1: Found proof (size 57)
% 15.57/2.86 Prover 1: proved (2231ms)
% 15.57/2.87 Prover 4: stopped
% 17.83/3.18 Prover 7: Preprocessing ...
% 17.83/3.18 Prover 13: Preprocessing ...
% 17.83/3.19 Prover 11: Preprocessing ...
% 17.83/3.20 Prover 10: Preprocessing ...
% 17.83/3.21 Prover 8: Preprocessing ...
% 17.83/3.26 Prover 7: stopped
% 17.83/3.27 Prover 10: stopped
% 18.67/3.29 Prover 11: stopped
% 18.67/3.32 Prover 13: stopped
% 18.67/3.37 Prover 8: Warning: ignoring some quantifiers
% 19.51/3.38 Prover 8: Constructing countermodel ...
% 19.51/3.40 Prover 8: stopped
% 19.51/3.40
% 19.51/3.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.51/3.40
% 19.51/3.41 % SZS output start Proof for theBenchmark
% 19.51/3.42 Assumptions after simplification:
% 19.51/3.42 ---------------------------------
% 19.51/3.42
% 19.51/3.42 (gauss_array_0005)
% 19.51/3.44 $i(pv1325) & $i(s_worst7) & $i(s_sworst7) & $i(s_best7) & $i(n3) & $i(n2) &
% 19.51/3.44 $i(n0) & ? [v0: int] : ( ~ (v0 = 0) & leq(pv1325, n3) = 0 & leq(s_worst7, n3)
% 19.51/3.44 = 0 & leq(s_sworst7, n3) = 0 & leq(s_best7, n3) = 0 & leq(n2, pv1325) = 0 &
% 19.51/3.44 leq(n0, pv1325) = v0 & leq(n0, s_worst7) = 0 & leq(n0, s_sworst7) = 0 &
% 19.51/3.44 leq(n0, s_best7) = 0)
% 19.51/3.44
% 19.51/3.44 (gt_2_0)
% 19.51/3.44 gt(n2, n0) = 0 & $i(n2) & $i(n0)
% 19.51/3.44
% 19.51/3.44 (leq_gt1)
% 19.51/3.44 ! [v0: $i] : ! [v1: $i] : ( ~ (gt(v1, v0) = 0) | ~ $i(v1) | ~ $i(v0) |
% 19.51/3.44 leq(v0, v1) = 0)
% 19.51/3.44
% 19.51/3.44 (leq_succ_gt)
% 19.51/3.44 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (succ(v0) = v2) | ~ (leq(v2,
% 19.51/3.44 v1) = 0) | ~ $i(v1) | ~ $i(v0) | gt(v1, v0) = 0)
% 19.51/3.44
% 19.51/3.44 (leq_succ_gt_equiv)
% 19.51/3.45 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 19.51/3.45 (succ(v1) = v2) | ~ (gt(v2, v0) = v3) | ~ $i(v1) | ~ $i(v0) | ? [v4:
% 19.51/3.45 int] : ( ~ (v4 = 0) & leq(v0, v1) = v4)) & ! [v0: $i] : ! [v1: $i] : !
% 19.51/3.45 [v2: $i] : ( ~ (succ(v1) = v2) | ~ (gt(v2, v0) = 0) | ~ $i(v1) | ~ $i(v0) |
% 19.51/3.45 leq(v0, v1) = 0)
% 19.51/3.45
% 19.51/3.45 (successor_1)
% 19.51/3.45 succ(n0) = n1 & $i(n1) & $i(n0)
% 19.51/3.45
% 19.51/3.45 (successor_2)
% 19.51/3.45 $i(n2) & $i(n0) & ? [v0: $i] : (succ(v0) = n2 & succ(n0) = v0 & $i(v0))
% 19.51/3.45
% 19.51/3.45 (successor_3)
% 19.51/3.45 $i(n3) & $i(n0) & ? [v0: $i] : ? [v1: $i] : (succ(v1) = n3 & succ(v0) = v1 &
% 19.51/3.45 succ(n0) = v0 & $i(v1) & $i(v0))
% 19.51/3.45
% 19.51/3.45 (successor_4)
% 19.51/3.45 $i(n4) & $i(n0) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (succ(v2) = n4 &
% 19.51/3.45 succ(v1) = v2 & succ(v0) = v1 & succ(n0) = v0 & $i(v2) & $i(v1) & $i(v0))
% 19.51/3.45
% 19.51/3.45 (successor_5)
% 19.51/3.45 $i(n5) & $i(n0) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] :
% 19.51/3.45 (succ(v3) = n5 & succ(v2) = v3 & succ(v1) = v2 & succ(v0) = v1 & succ(n0) = v0
% 19.51/3.45 & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 19.51/3.45
% 19.51/3.45 (transitivity_leq)
% 19.51/3.45 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (leq(v0,
% 19.51/3.45 v2) = v3) | ~ (leq(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) |
% 19.51/3.45 ? [v4: int] : ( ~ (v4 = 0) & leq(v1, v2) = v4))
% 19.51/3.45
% 19.51/3.45 (function-axioms)
% 19.51/3.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 19.51/3.46 $i] : (v1 = v0 | ~ (tptp_update3(v5, v4, v3, v2) = v1) | ~
% 19.51/3.46 (tptp_update3(v5, v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2:
% 19.51/3.46 $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_update2(v4, v3, v2) =
% 19.51/3.46 v1) | ~ (tptp_update2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 19.51/3.46 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (sum(v4, v3, v2) = v1) |
% 19.51/3.46 ~ (sum(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : !
% 19.51/3.46 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_const_array2(v4, v3, v2) = v1) |
% 19.51/3.46 ~ (tptp_const_array2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 19.51/3.46 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (a_select3(v4, v3, v2) =
% 19.51/3.46 v1) | ~ (a_select3(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 19.51/3.46 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (minus(v3, v2) = v1) | ~ (minus(v3,
% 19.51/3.46 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1
% 19.51/3.46 = v0 | ~ (plus(v3, v2) = v1) | ~ (plus(v3, v2) = v0)) & ! [v0: $i] : !
% 19.51/3.46 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (tptp_mmul(v3, v2) = v1)
% 19.51/3.46 | ~ (tptp_mmul(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 19.51/3.46 ! [v3: $i] : (v1 = v0 | ~ (tptp_msub(v3, v2) = v1) | ~ (tptp_msub(v3, v2) =
% 19.51/3.46 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 |
% 19.51/3.46 ~ (tptp_madd(v3, v2) = v1) | ~ (tptp_madd(v3, v2) = v0)) & ! [v0: $i] : !
% 19.51/3.46 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (dim(v3, v2) = v1) | ~
% 19.51/3.46 (dim(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i]
% 19.51/3.46 : (v1 = v0 | ~ (tptp_const_array1(v3, v2) = v1) | ~ (tptp_const_array1(v3,
% 19.51/3.46 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1
% 19.51/3.46 = v0 | ~ (a_select2(v3, v2) = v1) | ~ (a_select2(v3, v2) = v0)) & ! [v0:
% 19.51/3.46 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 19.51/3.46 (uniform_int_rnd(v3, v2) = v1) | ~ (uniform_int_rnd(v3, v2) = v0)) & !
% 19.51/3.46 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 19.51/3.46 $i] : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0:
% 19.51/3.46 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 19.51/3.46 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0:
% 19.51/3.46 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 19.51/3.46 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0:
% 19.51/3.46 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 19.51/3.46 : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0: $i] : !
% 19.51/3.46 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (inv(v2) = v1) | ~ (inv(v2) = v0)) &
% 19.51/3.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (trans(v2) = v1) | ~
% 19.51/3.46 (trans(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 19.51/3.46 (succ(v2) = v1) | ~ (succ(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2:
% 19.51/3.46 $i] : (v1 = v0 | ~ (pred(v2) = v1) | ~ (pred(v2) = v0))
% 19.51/3.46
% 19.51/3.46 Further assumptions not needed in the proof:
% 19.51/3.46 --------------------------------------------
% 19.51/3.46 const_array1_select, const_array2_select, defuse, finite_domain_0,
% 19.51/3.46 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4,
% 19.51/3.46 finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_1,
% 19.51/3.46 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.51/3.46 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.51/3.46 gt_5_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt2, leq_gt_pred,
% 19.51/3.46 leq_minus, leq_succ, leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2,
% 19.51/3.46 matrix_symm_add, matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub,
% 19.51/3.46 matrix_symm_trans, matrix_symm_update_diagonal, pred_minus_1, pred_succ,
% 19.51/3.46 reflexivity_leq, sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1,
% 19.51/3.46 sel3_update_2, sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l,
% 19.51/3.46 succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r,
% 19.51/3.46 succ_plus_5_l, succ_plus_5_r, succ_pred, succ_tptp_minus_1, sum_plus_base,
% 19.51/3.46 sum_plus_base_float, totality, transitivity_gt, ttrue,
% 19.51/3.46 uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo
% 19.51/3.46
% 19.51/3.46 Those formulas are unsatisfiable:
% 19.51/3.46 ---------------------------------
% 19.51/3.46
% 19.51/3.46 Begin of proof
% 19.51/3.46 |
% 19.51/3.46 | ALPHA: (leq_succ_gt_equiv) implies:
% 19.51/3.46 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (succ(v1) = v2) | ~
% 19.51/3.46 | (gt(v2, v0) = 0) | ~ $i(v1) | ~ $i(v0) | leq(v0, v1) = 0)
% 19.51/3.46 |
% 19.51/3.46 | ALPHA: (gt_2_0) implies:
% 19.51/3.46 | (2) gt(n2, n0) = 0
% 19.51/3.46 |
% 19.51/3.47 | ALPHA: (successor_4) implies:
% 19.51/3.47 | (3) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (succ(v2) = n4 & succ(v1) =
% 19.51/3.47 | v2 & succ(v0) = v1 & succ(n0) = v0 & $i(v2) & $i(v1) & $i(v0))
% 19.51/3.47 |
% 19.51/3.47 | ALPHA: (successor_5) implies:
% 19.51/3.47 | (4) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (succ(v3) = n5
% 19.51/3.47 | & succ(v2) = v3 & succ(v1) = v2 & succ(v0) = v1 & succ(n0) = v0 &
% 19.51/3.47 | $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 19.51/3.47 |
% 19.51/3.47 | ALPHA: (successor_1) implies:
% 19.51/3.47 | (5) succ(n0) = n1
% 19.51/3.47 |
% 19.51/3.47 | ALPHA: (successor_2) implies:
% 19.51/3.47 | (6) ? [v0: $i] : (succ(v0) = n2 & succ(n0) = v0 & $i(v0))
% 19.51/3.47 |
% 19.51/3.47 | ALPHA: (successor_3) implies:
% 19.51/3.47 | (7) ? [v0: $i] : ? [v1: $i] : (succ(v1) = n3 & succ(v0) = v1 & succ(n0) =
% 19.51/3.47 | v0 & $i(v1) & $i(v0))
% 19.51/3.47 |
% 19.51/3.47 | ALPHA: (gauss_array_0005) implies:
% 19.51/3.47 | (8) $i(n0)
% 19.51/3.47 | (9) $i(pv1325)
% 19.51/3.47 | (10) ? [v0: int] : ( ~ (v0 = 0) & leq(pv1325, n3) = 0 & leq(s_worst7, n3)
% 19.51/3.47 | = 0 & leq(s_sworst7, n3) = 0 & leq(s_best7, n3) = 0 & leq(n2,
% 19.51/3.47 | pv1325) = 0 & leq(n0, pv1325) = v0 & leq(n0, s_worst7) = 0 &
% 19.51/3.47 | leq(n0, s_sworst7) = 0 & leq(n0, s_best7) = 0)
% 19.51/3.47 |
% 19.98/3.47 | ALPHA: (function-axioms) implies:
% 19.98/3.47 | (11) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (succ(v2) =
% 19.98/3.47 | v1) | ~ (succ(v2) = v0))
% 19.98/3.47 | (12) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 19.98/3.47 | : ! [v3: $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) =
% 19.98/3.47 | v0))
% 19.98/3.47 |
% 19.98/3.47 | DELTA: instantiating (6) with fresh symbol all_49_0 gives:
% 19.98/3.47 | (13) succ(all_49_0) = n2 & succ(n0) = all_49_0 & $i(all_49_0)
% 19.98/3.47 |
% 19.98/3.47 | ALPHA: (13) implies:
% 19.98/3.47 | (14) $i(all_49_0)
% 19.98/3.47 | (15) succ(n0) = all_49_0
% 19.98/3.47 | (16) succ(all_49_0) = n2
% 19.98/3.47 |
% 19.98/3.47 | DELTA: instantiating (7) with fresh symbols all_51_0, all_51_1 gives:
% 19.98/3.47 | (17) succ(all_51_0) = n3 & succ(all_51_1) = all_51_0 & succ(n0) = all_51_1
% 19.98/3.47 | & $i(all_51_0) & $i(all_51_1)
% 19.98/3.47 |
% 19.98/3.47 | ALPHA: (17) implies:
% 19.98/3.47 | (18) succ(n0) = all_51_1
% 19.98/3.47 | (19) succ(all_51_1) = all_51_0
% 19.98/3.47 |
% 19.98/3.47 | DELTA: instantiating (3) with fresh symbols all_53_0, all_53_1, all_53_2
% 19.98/3.47 | gives:
% 19.98/3.47 | (20) succ(all_53_0) = n4 & succ(all_53_1) = all_53_0 & succ(all_53_2) =
% 19.98/3.47 | all_53_1 & succ(n0) = all_53_2 & $i(all_53_0) & $i(all_53_1) &
% 19.98/3.47 | $i(all_53_2)
% 19.98/3.47 |
% 19.98/3.47 | ALPHA: (20) implies:
% 19.98/3.48 | (21) succ(n0) = all_53_2
% 19.98/3.48 | (22) succ(all_53_2) = all_53_1
% 19.98/3.48 |
% 19.98/3.48 | DELTA: instantiating (4) with fresh symbols all_55_0, all_55_1, all_55_2,
% 19.98/3.48 | all_55_3 gives:
% 19.98/3.48 | (23) succ(all_55_0) = n5 & succ(all_55_1) = all_55_0 & succ(all_55_2) =
% 19.98/3.48 | all_55_1 & succ(all_55_3) = all_55_2 & succ(n0) = all_55_3 &
% 19.98/3.48 | $i(all_55_0) & $i(all_55_1) & $i(all_55_2) & $i(all_55_3)
% 19.98/3.48 |
% 19.98/3.48 | ALPHA: (23) implies:
% 19.98/3.48 | (24) succ(n0) = all_55_3
% 19.98/3.48 | (25) succ(all_55_3) = all_55_2
% 19.98/3.48 |
% 19.98/3.48 | DELTA: instantiating (10) with fresh symbol all_57_0 gives:
% 19.98/3.48 | (26) ~ (all_57_0 = 0) & leq(pv1325, n3) = 0 & leq(s_worst7, n3) = 0 &
% 19.98/3.48 | leq(s_sworst7, n3) = 0 & leq(s_best7, n3) = 0 & leq(n2, pv1325) = 0 &
% 19.98/3.48 | leq(n0, pv1325) = all_57_0 & leq(n0, s_worst7) = 0 & leq(n0,
% 19.98/3.48 | s_sworst7) = 0 & leq(n0, s_best7) = 0
% 19.98/3.48 |
% 19.98/3.48 | ALPHA: (26) implies:
% 19.98/3.48 | (27) ~ (all_57_0 = 0)
% 19.98/3.48 | (28) leq(n0, pv1325) = all_57_0
% 19.98/3.48 | (29) leq(n2, pv1325) = 0
% 19.98/3.48 |
% 19.98/3.48 | GROUND_INST: instantiating (11) with all_51_1, all_53_2, n0, simplifying with
% 19.98/3.48 | (18), (21) gives:
% 19.98/3.48 | (30) all_53_2 = all_51_1
% 19.98/3.48 |
% 19.98/3.48 | GROUND_INST: instantiating (11) with all_49_0, all_53_2, n0, simplifying with
% 19.98/3.48 | (15), (21) gives:
% 19.98/3.48 | (31) all_53_2 = all_49_0
% 19.98/3.48 |
% 19.98/3.48 | GROUND_INST: instantiating (11) with all_51_1, all_55_3, n0, simplifying with
% 19.98/3.48 | (18), (24) gives:
% 19.98/3.48 | (32) all_55_3 = all_51_1
% 19.98/3.48 |
% 19.98/3.48 | GROUND_INST: instantiating (11) with n1, all_55_3, n0, simplifying with (5),
% 19.98/3.48 | (24) gives:
% 19.98/3.48 | (33) all_55_3 = n1
% 19.98/3.48 |
% 19.98/3.48 | COMBINE_EQS: (32), (33) imply:
% 19.98/3.48 | (34) all_51_1 = n1
% 19.98/3.48 |
% 19.98/3.48 | SIMP: (34) implies:
% 19.98/3.48 | (35) all_51_1 = n1
% 19.98/3.48 |
% 19.98/3.48 | COMBINE_EQS: (30), (31) imply:
% 19.98/3.48 | (36) all_51_1 = all_49_0
% 19.98/3.48 |
% 19.98/3.48 | SIMP: (36) implies:
% 19.98/3.48 | (37) all_51_1 = all_49_0
% 19.98/3.48 |
% 19.98/3.48 | COMBINE_EQS: (35), (37) imply:
% 19.98/3.48 | (38) all_49_0 = n1
% 19.98/3.48 |
% 19.98/3.48 | COMBINE_EQS: (31), (38) imply:
% 19.98/3.48 | (39) all_53_2 = n1
% 19.98/3.48 |
% 19.98/3.48 | REDUCE: (25), (33) imply:
% 19.98/3.48 | (40) succ(n1) = all_55_2
% 19.98/3.48 |
% 19.98/3.48 | REDUCE: (22), (39) imply:
% 19.98/3.48 | (41) succ(n1) = all_53_1
% 19.98/3.48 |
% 19.98/3.48 | REDUCE: (19), (35) imply:
% 19.98/3.48 | (42) succ(n1) = all_51_0
% 19.98/3.48 |
% 19.98/3.48 | REDUCE: (16), (38) imply:
% 19.98/3.48 | (43) succ(n1) = n2
% 19.98/3.48 |
% 19.98/3.48 | REDUCE: (14), (38) imply:
% 19.98/3.48 | (44) $i(n1)
% 19.98/3.48 |
% 19.98/3.48 | GROUND_INST: instantiating (11) with all_51_0, all_53_1, n1, simplifying with
% 19.98/3.48 | (41), (42) gives:
% 19.98/3.48 | (45) all_53_1 = all_51_0
% 19.98/3.48 |
% 19.98/3.48 | GROUND_INST: instantiating (11) with all_53_1, all_55_2, n1, simplifying with
% 19.98/3.48 | (40), (41) gives:
% 19.98/3.48 | (46) all_55_2 = all_53_1
% 19.98/3.48 |
% 19.98/3.48 | GROUND_INST: instantiating (11) with n2, all_55_2, n1, simplifying with (40),
% 19.98/3.48 | (43) gives:
% 19.98/3.48 | (47) all_55_2 = n2
% 19.98/3.48 |
% 19.98/3.48 | COMBINE_EQS: (46), (47) imply:
% 19.98/3.48 | (48) all_53_1 = n2
% 19.98/3.48 |
% 19.98/3.48 | SIMP: (48) implies:
% 19.98/3.48 | (49) all_53_1 = n2
% 19.98/3.48 |
% 19.98/3.49 | COMBINE_EQS: (45), (49) imply:
% 19.98/3.49 | (50) all_51_0 = n2
% 19.98/3.49 |
% 19.98/3.49 | SIMP: (50) implies:
% 19.98/3.49 | (51) all_51_0 = n2
% 19.98/3.49 |
% 19.98/3.49 | GROUND_INST: instantiating (leq_succ_gt) with n1, pv1325, n2, simplifying with
% 19.98/3.49 | (9), (29), (43), (44) gives:
% 19.98/3.49 | (52) gt(pv1325, n1) = 0
% 19.98/3.49 |
% 19.98/3.49 | GROUND_INST: instantiating (1) with n0, n1, n2, simplifying with (2), (8),
% 19.98/3.49 | (43), (44) gives:
% 19.98/3.49 | (53) leq(n0, n1) = 0
% 19.98/3.49 |
% 19.98/3.49 | GROUND_INST: instantiating (leq_gt1) with n1, pv1325, simplifying with (9),
% 19.98/3.49 | (44), (52) gives:
% 19.98/3.49 | (54) leq(n1, pv1325) = 0
% 19.98/3.49 |
% 19.98/3.49 | GROUND_INST: instantiating (transitivity_leq) with n0, n1, pv1325, all_57_0,
% 19.98/3.49 | simplifying with (8), (9), (28), (44), (53) gives:
% 19.98/3.49 | (55) all_57_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & leq(n1, pv1325) = v0)
% 19.98/3.49 |
% 19.98/3.49 | BETA: splitting (55) gives:
% 19.98/3.49 |
% 19.98/3.49 | Case 1:
% 19.98/3.49 | |
% 19.98/3.49 | | (56) all_57_0 = 0
% 19.98/3.49 | |
% 19.98/3.49 | | REDUCE: (27), (56) imply:
% 19.98/3.49 | | (57) $false
% 19.98/3.49 | |
% 19.98/3.49 | | CLOSE: (57) is inconsistent.
% 19.98/3.49 | |
% 19.98/3.49 | Case 2:
% 19.98/3.49 | |
% 19.98/3.49 | | (58) ? [v0: int] : ( ~ (v0 = 0) & leq(n1, pv1325) = v0)
% 19.98/3.49 | |
% 19.98/3.49 | | DELTA: instantiating (58) with fresh symbol all_126_0 gives:
% 19.98/3.49 | | (59) ~ (all_126_0 = 0) & leq(n1, pv1325) = all_126_0
% 19.98/3.49 | |
% 19.98/3.49 | | ALPHA: (59) implies:
% 19.98/3.49 | | (60) ~ (all_126_0 = 0)
% 19.98/3.49 | | (61) leq(n1, pv1325) = all_126_0
% 19.98/3.49 | |
% 19.98/3.49 | | GROUND_INST: instantiating (12) with 0, all_126_0, pv1325, n1, simplifying
% 19.98/3.49 | | with (54), (61) gives:
% 19.98/3.49 | | (62) all_126_0 = 0
% 19.98/3.49 | |
% 19.98/3.49 | | REDUCE: (60), (62) imply:
% 19.98/3.49 | | (63) $false
% 19.98/3.49 | |
% 19.98/3.49 | | CLOSE: (63) is inconsistent.
% 19.98/3.49 | |
% 19.98/3.49 | End of split
% 19.98/3.49 |
% 19.98/3.49 End of proof
% 20.09/3.49 % SZS output end Proof for theBenchmark
% 20.09/3.49
% 20.09/3.49 2881ms
%------------------------------------------------------------------------------