TSTP Solution File: SWV047+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV047+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 : n027.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:54:42 EDT 2023
% Result : Theorem 10.24s 2.18s
% Output : Proof 14.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV047+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.32 % Computer : n027.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue Aug 29 08:48:38 EDT 2023
% 0.14/0.32 % CPUTime :
% 0.17/0.58 ________ _____
% 0.17/0.58 ___ __ \_________(_)________________________________
% 0.17/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.17/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.17/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.17/0.58
% 0.17/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.17/0.58 (2023-06-19)
% 0.17/0.58
% 0.17/0.58 (c) Philipp Rümmer, 2009-2023
% 0.17/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.17/0.58 Amanda Stjerna.
% 0.17/0.58 Free software under BSD-3-Clause.
% 0.17/0.58
% 0.17/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.17/0.58
% 0.17/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.17/0.59 Running up to 7 provers in parallel.
% 0.17/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.17/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.17/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.17/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.17/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.17/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.17/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.69/1.37 Prover 4: Preprocessing ...
% 4.69/1.38 Prover 1: Preprocessing ...
% 4.69/1.41 Prover 2: Preprocessing ...
% 4.69/1.41 Prover 5: Preprocessing ...
% 4.69/1.41 Prover 0: Preprocessing ...
% 4.69/1.41 Prover 3: Preprocessing ...
% 4.69/1.41 Prover 6: Preprocessing ...
% 10.24/2.10 Prover 5: Constructing countermodel ...
% 10.24/2.18 Prover 5: proved (1562ms)
% 10.24/2.18
% 10.24/2.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.24/2.18
% 10.24/2.19 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.24/2.20 Prover 3: Constructing countermodel ...
% 10.24/2.20 Prover 3: stopped
% 10.24/2.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 10.24/2.23 Prover 1: Warning: ignoring some quantifiers
% 10.24/2.26 Prover 6: Constructing countermodel ...
% 10.24/2.26 Prover 6: stopped
% 10.24/2.27 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.80/2.31 Prover 4: Warning: ignoring some quantifiers
% 11.80/2.32 Prover 1: Constructing countermodel ...
% 12.01/2.37 Prover 2: Constructing countermodel ...
% 12.01/2.37 Prover 2: stopped
% 12.01/2.38 Prover 0: Constructing countermodel ...
% 12.01/2.38 Prover 0: stopped
% 12.01/2.40 Prover 7: Preprocessing ...
% 12.01/2.40 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 12.01/2.40 Prover 8: Preprocessing ...
% 12.01/2.41 Prover 10: Preprocessing ...
% 12.01/2.42 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 12.71/2.44 Prover 4: Constructing countermodel ...
% 12.71/2.46 Prover 1: Found proof (size 5)
% 12.71/2.46 Prover 1: proved (1862ms)
% 12.71/2.48 Prover 4: stopped
% 12.71/2.49 Prover 10: stopped
% 13.24/2.49 Prover 7: stopped
% 13.24/2.49 Prover 11: Preprocessing ...
% 13.24/2.53 Prover 13: Preprocessing ...
% 13.24/2.55 Prover 11: stopped
% 13.76/2.60 Prover 13: stopped
% 13.94/2.62 Prover 8: Warning: ignoring some quantifiers
% 14.07/2.65 Prover 8: Constructing countermodel ...
% 14.07/2.67 Prover 8: stopped
% 14.07/2.67
% 14.07/2.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.07/2.67
% 14.07/2.67 % SZS output start Proof for theBenchmark
% 14.07/2.68 Assumptions after simplification:
% 14.07/2.68 ---------------------------------
% 14.07/2.68
% 14.07/2.68 (cl5_nebula_norm_0013)
% 14.07/2.71 $i(pv82) & $i(mu) & $i(pv83) & $i(x) & $i(pv78) & $i(pv35) & $i(pv79) & $i(q)
% 14.07/2.71 & $i(n135300) & $i(n5) & $i(n1) & $i(n0) & ? [v0: $i] : ? [v1: $i] : ? [v2:
% 14.07/2.71 $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] :
% 14.07/2.71 ? [v8: $i] : (times(v4, v6) = v7 & times(v4, v5) = v6 & minus(v2, v3) = v4 &
% 14.07/2.71 minus(n135300, n1) = v0 & minus(n5, n1) = v8 & sum(n0, v0, v7) = pv82 &
% 14.07/2.71 sum(n0, v0, v1) = pv78 & a_select3(q, pv83, pv35) = v5 & a_select3(q, pv79,
% 14.07/2.71 pv35) = v1 & a_select2(mu, pv35) = v3 & a_select2(x, pv83) = v2 &
% 14.07/2.71 leq(pv35, v8) = 0 & leq(n0, pv35) = 0 & $i(v8) & $i(v7) & $i(v6) & $i(v5) &
% 14.07/2.71 $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ~ true)
% 14.07/2.71
% 14.07/2.71 (ttrue)
% 14.07/2.71 true
% 14.07/2.71
% 14.07/2.71 Further assumptions not needed in the proof:
% 14.07/2.71 --------------------------------------------
% 14.07/2.71 const_array1_select, const_array2_select, defuse, finite_domain_0,
% 14.07/2.71 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4,
% 14.07/2.71 finite_domain_5, gt_0_tptp_minus_1, gt_135300_0, gt_135300_1, gt_135300_2,
% 14.07/2.71 gt_135300_3, gt_135300_4, gt_135300_5, gt_135300_tptp_minus_1, gt_1_0,
% 14.07/2.71 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,
% 14.07/2.71 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,
% 14.07/2.71 gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_succ, irreflexivity_gt,
% 14.07/2.71 leq_geq, leq_gt1, leq_gt2, leq_gt_pred, leq_minus, leq_succ, leq_succ_gt,
% 14.07/2.71 leq_succ_gt_equiv, leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2,
% 14.07/2.71 matrix_symm_add, matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub,
% 14.07/2.71 matrix_symm_trans, matrix_symm_update_diagonal, pred_minus_1, pred_succ,
% 14.07/2.71 reflexivity_leq, sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1,
% 14.07/2.71 sel3_update_2, sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l,
% 14.07/2.71 succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r,
% 14.07/2.71 succ_plus_5_l, succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1,
% 14.07/2.72 successor_2, successor_3, successor_4, successor_5, sum_plus_base,
% 14.07/2.72 sum_plus_base_float, totality, transitivity_gt, transitivity_leq,
% 14.07/2.72 uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo
% 14.07/2.72
% 14.07/2.72 Those formulas are unsatisfiable:
% 14.07/2.72 ---------------------------------
% 14.07/2.72
% 14.07/2.72 Begin of proof
% 14.07/2.72 |
% 14.07/2.72 | ALPHA: (cl5_nebula_norm_0013) implies:
% 14.07/2.72 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] :
% 14.07/2.72 | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : (times(v4, v6) =
% 14.07/2.72 | v7 & times(v4, v5) = v6 & minus(v2, v3) = v4 & minus(n135300, n1) =
% 14.07/2.72 | v0 & minus(n5, n1) = v8 & sum(n0, v0, v7) = pv82 & sum(n0, v0, v1) =
% 14.07/2.72 | pv78 & a_select3(q, pv83, pv35) = v5 & a_select3(q, pv79, pv35) = v1
% 14.07/2.72 | & a_select2(mu, pv35) = v3 & a_select2(x, pv83) = v2 & leq(pv35, v8)
% 14.07/2.72 | = 0 & leq(n0, pv35) = 0 & $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4)
% 14.07/2.72 | & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ~ true)
% 14.07/2.72 |
% 14.54/2.72 | DELTA: instantiating (1) with fresh symbols all_61_0, all_61_1, all_61_2,
% 14.54/2.72 | all_61_3, all_61_4, all_61_5, all_61_6, all_61_7, all_61_8 gives:
% 14.54/2.73 | (2) times(all_61_4, all_61_2) = all_61_1 & times(all_61_4, all_61_3) =
% 14.54/2.73 | all_61_2 & minus(all_61_6, all_61_5) = all_61_4 & minus(n135300, n1) =
% 14.54/2.73 | all_61_8 & minus(n5, n1) = all_61_0 & sum(n0, all_61_8, all_61_1) =
% 14.54/2.73 | pv82 & sum(n0, all_61_8, all_61_7) = pv78 & a_select3(q, pv83, pv35) =
% 14.54/2.73 | all_61_3 & a_select3(q, pv79, pv35) = all_61_7 & a_select2(mu, pv35) =
% 14.54/2.73 | all_61_5 & a_select2(x, pv83) = all_61_6 & leq(pv35, all_61_0) = 0 &
% 14.54/2.73 | leq(n0, pv35) = 0 & $i(all_61_0) & $i(all_61_1) & $i(all_61_2) &
% 14.54/2.73 | $i(all_61_3) & $i(all_61_4) & $i(all_61_5) & $i(all_61_6) &
% 14.54/2.73 | $i(all_61_7) & $i(all_61_8) & ~ true
% 14.54/2.73 |
% 14.54/2.73 | ALPHA: (2) implies:
% 14.54/2.73 | (3) ~ true
% 14.54/2.73 |
% 14.54/2.73 | PRED_UNIFY: (3), (ttrue) imply:
% 14.54/2.73 | (4) $false
% 14.54/2.73 |
% 14.54/2.73 | CLOSE: (4) is inconsistent.
% 14.54/2.73 |
% 14.54/2.73 End of proof
% 14.54/2.73 % SZS output end Proof for theBenchmark
% 14.54/2.73
% 14.54/2.73 2147ms
%------------------------------------------------------------------------------