TSTP Solution File: SWV123+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV123+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 : n015.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:01 EDT 2023
% Result : Theorem 9.83s 2.18s
% Output : Proof 15.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV123+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 : n015.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 05:37:25 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.48/1.39 Prover 1: Preprocessing ...
% 4.48/1.39 Prover 4: Preprocessing ...
% 4.48/1.42 Prover 3: Preprocessing ...
% 4.48/1.42 Prover 2: Preprocessing ...
% 4.48/1.42 Prover 5: Preprocessing ...
% 4.48/1.42 Prover 0: Preprocessing ...
% 4.48/1.42 Prover 6: Preprocessing ...
% 8.77/2.14 Prover 5: Constructing countermodel ...
% 9.83/2.18 Prover 5: proved (1544ms)
% 9.83/2.18
% 9.83/2.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.83/2.18
% 9.83/2.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.83/2.30 Prover 3: Constructing countermodel ...
% 10.83/2.30 Prover 3: stopped
% 10.83/2.30 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 11.40/2.32 Prover 6: Constructing countermodel ...
% 11.40/2.32 Prover 6: stopped
% 11.40/2.34 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.40/2.37 Prover 7: Preprocessing ...
% 11.93/2.42 Prover 1: Warning: ignoring some quantifiers
% 12.57/2.48 Prover 10: Preprocessing ...
% 12.57/2.49 Prover 8: Preprocessing ...
% 12.74/2.49 Prover 0: Constructing countermodel ...
% 12.74/2.49 Prover 0: stopped
% 12.74/2.50 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 13.05/2.53 Prover 2: Constructing countermodel ...
% 13.05/2.53 Prover 2: stopped
% 13.05/2.55 Prover 1: Constructing countermodel ...
% 13.05/2.55 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 13.05/2.56 Prover 4: Warning: ignoring some quantifiers
% 13.05/2.60 Prover 11: Preprocessing ...
% 13.63/2.63 Prover 13: Preprocessing ...
% 13.63/2.67 Prover 4: Constructing countermodel ...
% 14.17/2.70 Prover 1: Found proof (size 5)
% 14.17/2.70 Prover 1: proved (2072ms)
% 14.17/2.70 Prover 11: stopped
% 14.17/2.71 Prover 10: Warning: ignoring some quantifiers
% 14.17/2.72 Prover 7: Warning: ignoring some quantifiers
% 14.17/2.73 Prover 4: stopped
% 14.17/2.75 Prover 10: Constructing countermodel ...
% 14.17/2.75 Prover 13: stopped
% 14.79/2.77 Prover 7: Constructing countermodel ...
% 14.79/2.78 Prover 10: stopped
% 14.79/2.80 Prover 8: Warning: ignoring some quantifiers
% 14.79/2.80 Prover 7: stopped
% 14.79/2.82 Prover 8: Constructing countermodel ...
% 14.79/2.84 Prover 8: stopped
% 14.79/2.84
% 14.79/2.84 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.79/2.84
% 14.79/2.85 % SZS output start Proof for theBenchmark
% 14.79/2.85 Assumptions after simplification:
% 14.79/2.85 ---------------------------------
% 14.79/2.85
% 14.79/2.85 (quaternion_ds1_symm_0016)
% 14.79/2.88 $i(n999) & $i(n6) & $i(n3) & $i(n2) & $i(n1) & $i(n0) & ? [v0: $i] : ? [v1:
% 14.79/2.88 $i] : ? [v2: $i] : (minus(n999, n1) = v2 & minus(n6, n1) = v1 & minus(n3,
% 14.79/2.88 n1) = v0 & geq(v2, n0) = 0 & geq(v1, n0) = 0 & geq(v0, n0) = 0 & geq(n2,
% 14.79/2.88 n0) = 0 & $i(v2) & $i(v1) & $i(v0) & ~ true)
% 14.79/2.88
% 14.79/2.88 (ttrue)
% 14.79/2.88 true
% 14.79/2.88
% 14.79/2.88 Further assumptions not needed in the proof:
% 14.79/2.88 --------------------------------------------
% 14.79/2.88 const_array1_select, const_array2_select, defuse, finite_domain_0,
% 14.79/2.88 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4,
% 14.79/2.88 finite_domain_5, finite_domain_6, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1,
% 14.79/2.88 gt_2_0, gt_2_1, gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2, gt_3_tptp_minus_1,
% 14.79/2.88 gt_4_0, gt_4_1, gt_4_2, gt_4_3, gt_4_tptp_minus_1, gt_5_0, gt_5_1, gt_5_2,
% 14.79/2.88 gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_6_0, gt_6_1, gt_6_2, gt_6_3, gt_6_4,
% 14.79/2.88 gt_6_5, gt_6_tptp_minus_1, gt_999_0, gt_999_1, gt_999_2, gt_999_3, gt_999_4,
% 14.79/2.88 gt_999_5, gt_999_6, gt_999_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq,
% 14.79/2.88 leq_gt1, leq_gt2, leq_gt_pred, leq_minus, leq_succ, leq_succ_gt,
% 14.79/2.88 leq_succ_gt_equiv, leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2,
% 14.79/2.88 matrix_symm_add, matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub,
% 14.79/2.88 matrix_symm_trans, matrix_symm_update_diagonal, pred_minus_1, pred_succ,
% 14.79/2.88 reflexivity_leq, sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1,
% 14.79/2.88 sel3_update_2, sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l,
% 14.79/2.88 succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r,
% 14.79/2.88 succ_plus_5_l, succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1,
% 14.79/2.88 successor_2, successor_3, successor_4, successor_5, successor_6, sum_plus_base,
% 14.79/2.88 sum_plus_base_float, totality, transitivity_gt, transitivity_leq,
% 14.79/2.88 uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo
% 14.79/2.88
% 14.79/2.88 Those formulas are unsatisfiable:
% 14.79/2.88 ---------------------------------
% 14.79/2.88
% 14.79/2.88 Begin of proof
% 14.79/2.88 |
% 14.79/2.88 | ALPHA: (quaternion_ds1_symm_0016) implies:
% 15.20/2.89 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (minus(n999, n1) = v2 &
% 15.20/2.89 | minus(n6, n1) = v1 & minus(n3, n1) = v0 & geq(v2, n0) = 0 & geq(v1,
% 15.20/2.89 | n0) = 0 & geq(v0, n0) = 0 & geq(n2, n0) = 0 & $i(v2) & $i(v1) &
% 15.20/2.89 | $i(v0) & ~ true)
% 15.20/2.89 |
% 15.20/2.89 | DELTA: instantiating (1) with fresh symbols all_60_0, all_60_1, all_60_2
% 15.20/2.89 | gives:
% 15.20/2.89 | (2) minus(n999, n1) = all_60_0 & minus(n6, n1) = all_60_1 & minus(n3, n1) =
% 15.20/2.89 | all_60_2 & geq(all_60_0, n0) = 0 & geq(all_60_1, n0) = 0 &
% 15.20/2.89 | geq(all_60_2, n0) = 0 & geq(n2, n0) = 0 & $i(all_60_0) & $i(all_60_1) &
% 15.20/2.89 | $i(all_60_2) & ~ true
% 15.20/2.89 |
% 15.20/2.89 | ALPHA: (2) implies:
% 15.20/2.89 | (3) ~ true
% 15.20/2.89 |
% 15.20/2.89 | PRED_UNIFY: (3), (ttrue) imply:
% 15.20/2.89 | (4) $false
% 15.20/2.89 |
% 15.20/2.89 | CLOSE: (4) is inconsistent.
% 15.20/2.89 |
% 15.20/2.89 End of proof
% 15.20/2.89 % SZS output end Proof for theBenchmark
% 15.20/2.89
% 15.20/2.89 2287ms
%------------------------------------------------------------------------------