TSTP Solution File: SWV068+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV068+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 : n019.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:47 EDT 2023
% Result : Theorem 10.03s 2.25s
% Output : Proof 14.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV068+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.34 % Computer : n019.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 03:44:58 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.61 ________ _____
% 0.19/0.61 ___ __ \_________(_)________________________________
% 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.61
% 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.61 (2023-06-19)
% 0.19/0.61
% 0.19/0.61 (c) Philipp Rümmer, 2009-2023
% 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.61 Amanda Stjerna.
% 0.19/0.61 Free software under BSD-3-Clause.
% 0.19/0.61
% 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.61
% 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.62 Running up to 7 provers in parallel.
% 0.19/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.37/1.37 Prover 4: Preprocessing ...
% 4.37/1.37 Prover 1: Preprocessing ...
% 4.83/1.41 Prover 2: Preprocessing ...
% 4.83/1.41 Prover 3: Preprocessing ...
% 4.83/1.41 Prover 5: Preprocessing ...
% 4.83/1.41 Prover 6: Preprocessing ...
% 4.83/1.42 Prover 0: Preprocessing ...
% 10.03/2.21 Prover 5: Constructing countermodel ...
% 10.03/2.24 Prover 5: proved (1600ms)
% 10.03/2.24
% 10.03/2.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.03/2.25
% 10.03/2.26 Prover 3: Constructing countermodel ...
% 10.03/2.26 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.03/2.27 Prover 3: stopped
% 10.03/2.28 Prover 6: Constructing countermodel ...
% 10.03/2.28 Prover 6: stopped
% 10.03/2.29 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 10.03/2.29 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.24/2.30 Prover 1: Warning: ignoring some quantifiers
% 11.45/2.40 Prover 1: Constructing countermodel ...
% 12.11/2.43 Prover 7: Preprocessing ...
% 12.11/2.46 Prover 8: Preprocessing ...
% 12.11/2.47 Prover 10: Preprocessing ...
% 12.11/2.47 Prover 0: Constructing countermodel ...
% 12.11/2.47 Prover 0: stopped
% 12.61/2.48 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 12.61/2.49 Prover 4: Warning: ignoring some quantifiers
% 12.61/2.54 Prover 2: Constructing countermodel ...
% 12.61/2.54 Prover 2: stopped
% 12.61/2.55 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 12.61/2.56 Prover 4: Constructing countermodel ...
% 13.32/2.58 Prover 1: Found proof (size 5)
% 13.32/2.58 Prover 1: proved (1949ms)
% 13.32/2.58 Prover 7: stopped
% 13.43/2.60 Prover 11: Preprocessing ...
% 13.43/2.60 Prover 4: stopped
% 13.67/2.64 Prover 13: Preprocessing ...
% 13.67/2.65 Prover 10: Warning: ignoring some quantifiers
% 13.67/2.69 Prover 10: Constructing countermodel ...
% 13.67/2.69 Prover 11: stopped
% 14.34/2.71 Prover 10: stopped
% 14.34/2.73 Prover 8: Warning: ignoring some quantifiers
% 14.34/2.73 Prover 13: stopped
% 14.34/2.75 Prover 8: Constructing countermodel ...
% 14.34/2.78 Prover 8: stopped
% 14.34/2.78
% 14.34/2.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.34/2.78
% 14.34/2.78 % SZS output start Proof for theBenchmark
% 14.34/2.78 Assumptions after simplification:
% 14.34/2.78 ---------------------------------
% 14.34/2.79
% 14.34/2.79 (cl5_nebula_array_0009)
% 14.34/2.81 $i(n135300) & $i(pv10) & $i(n1) & $i(n0) & ? [v0: $i] : (minus(n135300, n1) =
% 14.34/2.81 v0 & leq(pv10, v0) = 0 & leq(n0, pv10) = 0 & $i(v0) & ~ true)
% 14.34/2.81
% 14.34/2.81 (ttrue)
% 14.34/2.81 true
% 14.34/2.81
% 14.34/2.81 Further assumptions not needed in the proof:
% 14.34/2.81 --------------------------------------------
% 14.34/2.81 const_array1_select, const_array2_select, defuse, finite_domain_0,
% 14.34/2.81 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4,
% 14.34/2.81 finite_domain_5, gt_0_tptp_minus_1, gt_135300_0, gt_135300_1, gt_135300_2,
% 14.34/2.81 gt_135300_3, gt_135300_4, gt_135300_5, gt_135300_tptp_minus_1, gt_1_0,
% 14.34/2.81 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.34/2.81 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.34/2.81 gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_succ, irreflexivity_gt,
% 14.34/2.81 leq_geq, leq_gt1, leq_gt2, leq_gt_pred, leq_minus, leq_succ, leq_succ_gt,
% 14.34/2.81 leq_succ_gt_equiv, leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2,
% 14.34/2.81 matrix_symm_add, matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub,
% 14.34/2.81 matrix_symm_trans, matrix_symm_update_diagonal, pred_minus_1, pred_succ,
% 14.34/2.81 reflexivity_leq, sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1,
% 14.34/2.81 sel3_update_2, sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l,
% 14.34/2.81 succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r,
% 14.34/2.81 succ_plus_5_l, succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1,
% 14.34/2.81 successor_2, successor_3, successor_4, successor_5, sum_plus_base,
% 14.34/2.81 sum_plus_base_float, totality, transitivity_gt, transitivity_leq,
% 14.34/2.81 uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo
% 14.34/2.81
% 14.34/2.81 Those formulas are unsatisfiable:
% 14.34/2.81 ---------------------------------
% 14.34/2.81
% 14.34/2.81 Begin of proof
% 14.34/2.82 |
% 14.34/2.82 | ALPHA: (cl5_nebula_array_0009) implies:
% 14.34/2.82 | (1) ? [v0: $i] : (minus(n135300, n1) = v0 & leq(pv10, v0) = 0 & leq(n0,
% 14.34/2.82 | pv10) = 0 & $i(v0) & ~ true)
% 14.34/2.82 |
% 14.34/2.82 | DELTA: instantiating (1) with fresh symbol all_53_0 gives:
% 14.34/2.82 | (2) minus(n135300, n1) = all_53_0 & leq(pv10, all_53_0) = 0 & leq(n0, pv10)
% 14.34/2.82 | = 0 & $i(all_53_0) & ~ true
% 14.34/2.82 |
% 14.34/2.82 | ALPHA: (2) implies:
% 14.34/2.82 | (3) ~ true
% 14.34/2.82 |
% 14.34/2.82 | PRED_UNIFY: (3), (ttrue) imply:
% 14.34/2.82 | (4) $false
% 14.34/2.82 |
% 14.34/2.82 | CLOSE: (4) is inconsistent.
% 14.34/2.82 |
% 14.34/2.82 End of proof
% 14.34/2.82 % SZS output end Proof for theBenchmark
% 14.34/2.82
% 14.34/2.82 2215ms
%------------------------------------------------------------------------------