TSTP Solution File: SWV189+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV189+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 : n026.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 16.04s 3.11s
% Output : Proof 18.98s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV189+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.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 08:24:50 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.64 Running up to 7 provers in parallel.
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.62/1.52 Prover 1: Preprocessing ...
% 4.62/1.54 Prover 4: Preprocessing ...
% 5.39/1.56 Prover 3: Preprocessing ...
% 5.39/1.56 Prover 6: Preprocessing ...
% 5.39/1.56 Prover 0: Preprocessing ...
% 5.39/1.56 Prover 5: Preprocessing ...
% 5.39/1.58 Prover 2: Preprocessing ...
% 12.26/2.54 Prover 6: Proving ...
% 12.26/2.54 Prover 1: Warning: ignoring some quantifiers
% 12.26/2.56 Prover 3: Warning: ignoring some quantifiers
% 12.26/2.61 Prover 3: Constructing countermodel ...
% 12.26/2.62 Prover 1: Constructing countermodel ...
% 12.98/2.67 Prover 4: Warning: ignoring some quantifiers
% 13.53/2.74 Prover 4: Constructing countermodel ...
% 13.53/2.76 Prover 0: Proving ...
% 14.10/2.83 Prover 2: Proving ...
% 14.10/2.84 Prover 5: Proving ...
% 16.04/3.11 Prover 3: proved (2455ms)
% 16.04/3.11
% 16.04/3.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.04/3.11
% 16.04/3.11 Prover 5: stopped
% 16.04/3.11 Prover 0: stopped
% 16.04/3.11 Prover 2: stopped
% 16.04/3.12 Prover 6: stopped
% 16.04/3.12 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 16.04/3.12 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 16.04/3.12 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 16.57/3.12 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 16.57/3.13 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 17.73/3.29 Prover 7: Preprocessing ...
% 17.73/3.30 Prover 13: Preprocessing ...
% 17.73/3.31 Prover 11: Preprocessing ...
% 17.73/3.31 Prover 10: Preprocessing ...
% 17.73/3.32 Prover 8: Preprocessing ...
% 18.15/3.33 Prover 1: Found proof (size 21)
% 18.15/3.33 Prover 1: proved (2687ms)
% 18.15/3.33 Prover 4: stopped
% 18.36/3.40 Prover 7: stopped
% 18.36/3.40 Prover 11: stopped
% 18.36/3.40 Prover 10: stopped
% 18.77/3.43 Prover 13: stopped
% 18.98/3.53 Prover 8: Warning: ignoring some quantifiers
% 18.98/3.54 Prover 8: Constructing countermodel ...
% 18.98/3.57 Prover 8: stopped
% 18.98/3.57
% 18.98/3.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.98/3.57
% 18.98/3.57 % SZS output start Proof for theBenchmark
% 18.98/3.58 Assumptions after simplification:
% 18.98/3.58 ---------------------------------
% 18.98/3.58
% 18.98/3.59 (cl5_nebula_init_0121)
% 18.98/3.61 $i(q_init) & $i(init) & $i(center_init) & $i(n4) & $i(tptp_minus_1) & $i(n0) &
% 18.98/3.61 ! [v0: $i] : ! [v1: $i] : (v1 = init | ~ (a_select3(center_init, v0, n0) =
% 18.98/3.61 v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (leq(v0, n4) = v3 &
% 18.98/3.61 leq(n0, v0) = v2 & ( ~ (v3 = 0) | ~ (v2 = 0)))) & ? [v0: $i] : (leq(v0,
% 18.98/3.61 tptp_minus_1) = 0 & leq(n0, v0) = 0 & $i(v0) & ? [v1: $i] : ? [v2: $i] :
% 18.98/3.61 ( ~ (v2 = init) & a_select3(q_init, v0, v1) = v2 & leq(v1, n4) = 0 & leq(n0,
% 18.98/3.62 v1) = 0 & $i(v2) & $i(v1)))
% 18.98/3.62
% 18.98/3.62 (finite_domain_0)
% 18.98/3.62 $i(n0) & ! [v0: $i] : (v0 = n0 | ~ (leq(n0, v0) = 0) | ~ $i(v0) | ? [v1:
% 18.98/3.62 int] : ( ~ (v1 = 0) & leq(v0, n0) = v1))
% 18.98/3.62
% 18.98/3.62 (irreflexivity_gt)
% 18.98/3.62 ! [v0: $i] : ( ~ (gt(v0, v0) = 0) | ~ $i(v0))
% 18.98/3.62
% 18.98/3.62 (leq_gt1)
% 18.98/3.62 ! [v0: $i] : ! [v1: $i] : ( ~ (gt(v1, v0) = 0) | ~ $i(v1) | ~ $i(v0) |
% 18.98/3.62 leq(v0, v1) = 0)
% 18.98/3.62
% 18.98/3.62 (leq_gt_pred)
% 18.98/3.62 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 18.98/3.62 (pred(v1) = v2) | ~ (leq(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | ? [v4:
% 18.98/3.62 int] : ( ~ (v4 = 0) & gt(v1, v0) = v4)) & ! [v0: $i] : ! [v1: $i] : !
% 18.98/3.62 [v2: $i] : ( ~ (pred(v1) = v2) | ~ (leq(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0)
% 18.98/3.62 | gt(v1, v0) = 0)
% 18.98/3.62
% 18.98/3.62 (pred_succ)
% 18.98/3.62 ! [v0: $i] : ! [v1: $i] : ( ~ (succ(v0) = v1) | ~ $i(v0) | pred(v1) = v0)
% 18.98/3.62
% 18.98/3.62 (succ_tptp_minus_1)
% 18.98/3.62 succ(tptp_minus_1) = n0 & $i(tptp_minus_1) & $i(n0)
% 18.98/3.62
% 18.98/3.62 (function-axioms)
% 18.98/3.63 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 18.98/3.63 $i] : (v1 = v0 | ~ (tptp_update3(v5, v4, v3, v2) = v1) | ~
% 18.98/3.63 (tptp_update3(v5, v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2:
% 18.98/3.63 $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_update2(v4, v3, v2) =
% 18.98/3.63 v1) | ~ (tptp_update2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 18.98/3.63 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (sum(v4, v3, v2) = v1) |
% 18.98/3.63 ~ (sum(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : !
% 18.98/3.63 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_const_array2(v4, v3, v2) = v1) |
% 18.98/3.63 ~ (tptp_const_array2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 18.98/3.63 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (a_select3(v4, v3, v2) =
% 18.98/3.63 v1) | ~ (a_select3(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 18.98/3.63 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (minus(v3, v2) = v1) | ~ (minus(v3,
% 18.98/3.63 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1
% 18.98/3.63 = v0 | ~ (plus(v3, v2) = v1) | ~ (plus(v3, v2) = v0)) & ! [v0: $i] : !
% 18.98/3.63 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (tptp_mmul(v3, v2) = v1)
% 18.98/3.63 | ~ (tptp_mmul(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 18.98/3.63 ! [v3: $i] : (v1 = v0 | ~ (tptp_msub(v3, v2) = v1) | ~ (tptp_msub(v3, v2) =
% 18.98/3.63 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 |
% 18.98/3.63 ~ (tptp_madd(v3, v2) = v1) | ~ (tptp_madd(v3, v2) = v0)) & ! [v0: $i] : !
% 18.98/3.63 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (dim(v3, v2) = v1) | ~
% 18.98/3.63 (dim(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i]
% 18.98/3.63 : (v1 = v0 | ~ (tptp_const_array1(v3, v2) = v1) | ~ (tptp_const_array1(v3,
% 18.98/3.63 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1
% 18.98/3.63 = v0 | ~ (a_select2(v3, v2) = v1) | ~ (a_select2(v3, v2) = v0)) & ! [v0:
% 18.98/3.63 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 18.98/3.63 (uniform_int_rnd(v3, v2) = v1) | ~ (uniform_int_rnd(v3, v2) = v0)) & !
% 18.98/3.63 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 18.98/3.63 $i] : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0:
% 18.98/3.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 18.98/3.63 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0:
% 18.98/3.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 18.98/3.63 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0:
% 18.98/3.63 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 18.98/3.63 : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0: $i] : !
% 18.98/3.63 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (inv(v2) = v1) | ~ (inv(v2) = v0)) &
% 18.98/3.63 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (trans(v2) = v1) | ~
% 18.98/3.63 (trans(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 18.98/3.63 (succ(v2) = v1) | ~ (succ(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2:
% 18.98/3.63 $i] : (v1 = v0 | ~ (pred(v2) = v1) | ~ (pred(v2) = v0))
% 18.98/3.63
% 18.98/3.63 Further assumptions not needed in the proof:
% 18.98/3.63 --------------------------------------------
% 18.98/3.63 const_array1_select, const_array2_select, defuse, finite_domain_1,
% 18.98/3.63 finite_domain_2, finite_domain_3, finite_domain_4, finite_domain_5,
% 18.98/3.63 gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1, gt_2_tptp_minus_1,
% 18.98/3.63 gt_3_0, gt_3_1, gt_3_2, gt_3_tptp_minus_1, gt_4_0, gt_4_1, gt_4_2, gt_4_3,
% 18.98/3.63 gt_4_tptp_minus_1, gt_5_0, gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1,
% 18.98/3.63 gt_succ, leq_geq, leq_gt2, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv,
% 18.98/3.63 leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add,
% 18.98/3.63 matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans,
% 18.98/3.63 matrix_symm_update_diagonal, pred_minus_1, reflexivity_leq, sel2_update_1,
% 18.98/3.63 sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2, sel3_update_3,
% 18.98/3.63 succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, succ_plus_3_l,
% 18.98/3.63 succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, succ_plus_5_r,
% 18.98/3.63 succ_pred, successor_1, successor_2, successor_3, successor_4, successor_5,
% 18.98/3.63 sum_plus_base, sum_plus_base_float, totality, transitivity_gt, transitivity_leq,
% 18.98/3.63 ttrue, uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo
% 18.98/3.63
% 18.98/3.63 Those formulas are unsatisfiable:
% 18.98/3.63 ---------------------------------
% 18.98/3.63
% 18.98/3.63 Begin of proof
% 18.98/3.63 |
% 18.98/3.63 | ALPHA: (leq_gt_pred) implies:
% 18.98/3.63 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (pred(v1) = v2) | ~
% 18.98/3.63 | (leq(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) | gt(v1, v0) = 0)
% 18.98/3.63 |
% 18.98/3.63 | ALPHA: (succ_tptp_minus_1) implies:
% 18.98/3.63 | (2) succ(tptp_minus_1) = n0
% 18.98/3.63 |
% 18.98/3.63 | ALPHA: (finite_domain_0) implies:
% 18.98/3.64 | (3) ! [v0: $i] : (v0 = n0 | ~ (leq(n0, v0) = 0) | ~ $i(v0) | ? [v1:
% 18.98/3.64 | int] : ( ~ (v1 = 0) & leq(v0, n0) = v1))
% 18.98/3.64 |
% 18.98/3.64 | ALPHA: (cl5_nebula_init_0121) implies:
% 18.98/3.64 | (4) $i(n0)
% 18.98/3.64 | (5) $i(tptp_minus_1)
% 18.98/3.64 | (6) ? [v0: $i] : (leq(v0, tptp_minus_1) = 0 & leq(n0, v0) = 0 & $i(v0) &
% 18.98/3.64 | ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = init) & a_select3(q_init, v0,
% 18.98/3.64 | v1) = v2 & leq(v1, n4) = 0 & leq(n0, v1) = 0 & $i(v2) & $i(v1)))
% 18.98/3.64 |
% 18.98/3.64 | ALPHA: (function-axioms) implies:
% 18.98/3.64 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 18.98/3.64 | ! [v3: $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0))
% 18.98/3.64 |
% 18.98/3.64 | DELTA: instantiating (6) with fresh symbol all_58_0 gives:
% 18.98/3.64 | (8) leq(all_58_0, tptp_minus_1) = 0 & leq(n0, all_58_0) = 0 & $i(all_58_0)
% 18.98/3.64 | & ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = init) & a_select3(q_init,
% 18.98/3.64 | all_58_0, v0) = v1 & leq(v0, n4) = 0 & leq(n0, v0) = 0 & $i(v1) &
% 18.98/3.64 | $i(v0))
% 18.98/3.64 |
% 18.98/3.64 | ALPHA: (8) implies:
% 18.98/3.64 | (9) $i(all_58_0)
% 18.98/3.64 | (10) leq(n0, all_58_0) = 0
% 18.98/3.64 | (11) leq(all_58_0, tptp_minus_1) = 0
% 18.98/3.64 |
% 18.98/3.64 | GROUND_INST: instantiating (3) with all_58_0, simplifying with (9), (10)
% 18.98/3.64 | gives:
% 18.98/3.64 | (12) all_58_0 = n0 | ? [v0: int] : ( ~ (v0 = 0) & leq(all_58_0, n0) = v0)
% 18.98/3.64 |
% 18.98/3.64 | GROUND_INST: instantiating (pred_succ) with tptp_minus_1, n0, simplifying with
% 18.98/3.64 | (2), (5) gives:
% 18.98/3.64 | (13) pred(n0) = tptp_minus_1
% 18.98/3.64 |
% 18.98/3.64 | GROUND_INST: instantiating (1) with all_58_0, n0, tptp_minus_1, simplifying
% 18.98/3.64 | with (4), (9), (11), (13) gives:
% 18.98/3.64 | (14) gt(n0, all_58_0) = 0
% 18.98/3.64 |
% 18.98/3.64 | GROUND_INST: instantiating (leq_gt1) with all_58_0, n0, simplifying with (4),
% 18.98/3.64 | (9), (14) gives:
% 18.98/3.64 | (15) leq(all_58_0, n0) = 0
% 18.98/3.64 |
% 18.98/3.64 | BETA: splitting (12) gives:
% 18.98/3.64 |
% 18.98/3.64 | Case 1:
% 18.98/3.64 | |
% 18.98/3.64 | | (16) all_58_0 = n0
% 18.98/3.64 | |
% 18.98/3.64 | | REDUCE: (14), (16) imply:
% 18.98/3.64 | | (17) gt(n0, n0) = 0
% 18.98/3.64 | |
% 18.98/3.64 | | GROUND_INST: instantiating (irreflexivity_gt) with n0, simplifying with (4),
% 18.98/3.64 | | (17) gives:
% 18.98/3.64 | | (18) $false
% 18.98/3.65 | |
% 18.98/3.65 | | CLOSE: (18) is inconsistent.
% 18.98/3.65 | |
% 18.98/3.65 | Case 2:
% 18.98/3.65 | |
% 18.98/3.65 | | (19) ? [v0: int] : ( ~ (v0 = 0) & leq(all_58_0, n0) = v0)
% 18.98/3.65 | |
% 18.98/3.65 | | DELTA: instantiating (19) with fresh symbol all_119_0 gives:
% 18.98/3.65 | | (20) ~ (all_119_0 = 0) & leq(all_58_0, n0) = all_119_0
% 18.98/3.65 | |
% 18.98/3.65 | | ALPHA: (20) implies:
% 18.98/3.65 | | (21) ~ (all_119_0 = 0)
% 18.98/3.65 | | (22) leq(all_58_0, n0) = all_119_0
% 18.98/3.65 | |
% 18.98/3.65 | | GROUND_INST: instantiating (7) with 0, all_119_0, n0, all_58_0, simplifying
% 18.98/3.65 | | with (15), (22) gives:
% 18.98/3.65 | | (23) all_119_0 = 0
% 18.98/3.65 | |
% 18.98/3.65 | | REDUCE: (21), (23) imply:
% 18.98/3.65 | | (24) $false
% 18.98/3.65 | |
% 18.98/3.65 | | CLOSE: (24) is inconsistent.
% 18.98/3.65 | |
% 18.98/3.65 | End of split
% 18.98/3.65 |
% 18.98/3.65 End of proof
% 18.98/3.65 % SZS output end Proof for theBenchmark
% 18.98/3.65
% 18.98/3.65 3023ms
%------------------------------------------------------------------------------