TSTP Solution File: SWV084+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV084+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 : n020.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:50 EDT 2023
% Result : Theorem 10.23s 2.04s
% Output : Proof 13.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV084+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n020.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 08:23:58 EDT 2023
% 0.13/0.34 % 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.63 Running up to 7 provers in parallel.
% 0.61/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.61/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.61/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.61/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.61/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.61/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.61/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.68/1.37 Prover 4: Preprocessing ...
% 4.68/1.37 Prover 1: Preprocessing ...
% 5.26/1.41 Prover 2: Preprocessing ...
% 5.26/1.41 Prover 6: Preprocessing ...
% 5.26/1.41 Prover 5: Preprocessing ...
% 5.26/1.41 Prover 3: Preprocessing ...
% 5.26/1.41 Prover 0: Preprocessing ...
% 9.76/2.00 Prover 3: Constructing countermodel ...
% 10.23/2.04 Prover 3: proved (1404ms)
% 10.23/2.04
% 10.23/2.04 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.23/2.04
% 10.23/2.05 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.23/2.07 Prover 1: Warning: ignoring some quantifiers
% 10.23/2.11 Prover 6: Constructing countermodel ...
% 10.23/2.11 Prover 6: stopped
% 10.23/2.11 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 10.80/2.13 Prover 1: Constructing countermodel ...
% 10.80/2.13 Prover 1: Found proof (size 1)
% 10.80/2.13 Prover 1: proved (1493ms)
% 10.80/2.16 Prover 4: Warning: ignoring some quantifiers
% 11.21/2.20 Prover 7: Preprocessing ...
% 11.21/2.23 Prover 0: Constructing countermodel ...
% 11.21/2.23 Prover 0: stopped
% 11.83/2.26 Prover 2: Constructing countermodel ...
% 11.83/2.26 Prover 2: stopped
% 11.83/2.27 Prover 4: Constructing countermodel ...
% 11.83/2.27 Prover 4: stopped
% 11.83/2.27 Prover 8: Preprocessing ...
% 12.01/2.28 Prover 7: stopped
% 12.28/2.40 Prover 5: Proving ...
% 12.28/2.40 Prover 5: stopped
% 12.63/2.48 Prover 8: Warning: ignoring some quantifiers
% 13.11/2.50 Prover 8: Constructing countermodel ...
% 13.11/2.50 Prover 8: stopped
% 13.11/2.50
% 13.11/2.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.11/2.50
% 13.11/2.50 % SZS output start Proof for theBenchmark
% 13.11/2.52 Assumptions after simplification:
% 13.11/2.52 ---------------------------------
% 13.11/2.52
% 13.11/2.52 (cl5_nebula_array_0025)
% 13.11/2.52 $false
% 13.11/2.52
% 13.11/2.52 Further assumptions not needed in the proof:
% 13.11/2.52 --------------------------------------------
% 13.11/2.52 const_array1_select, const_array2_select, defuse, finite_domain_0,
% 13.11/2.52 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4,
% 13.11/2.52 finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1,
% 13.11/2.52 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,
% 13.11/2.52 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,
% 13.11/2.52 gt_5_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2,
% 13.11/2.52 leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ,
% 13.11/2.52 lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv,
% 13.11/2.52 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans,
% 13.11/2.52 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq,
% 13.11/2.52 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2,
% 13.11/2.52 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r,
% 13.11/2.52 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l,
% 13.11/2.52 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2,
% 13.11/2.52 successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float,
% 13.11/2.52 totality, transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi,
% 13.11/2.52 uniform_int_rand_ranges_lo
% 13.11/2.52
% 13.11/2.52 Those formulas are unsatisfiable:
% 13.11/2.52 ---------------------------------
% 13.11/2.52
% 13.11/2.52 Begin of proof
% 13.11/2.53 |
% 13.11/2.53 | CLOSE: (cl5_nebula_array_0025) is inconsistent.
% 13.11/2.53 |
% 13.11/2.53 End of proof
% 13.11/2.53 % SZS output end Proof for theBenchmark
% 13.11/2.53
% 13.11/2.53 1909ms
%------------------------------------------------------------------------------