TSTP Solution File: SWV070+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWV070+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 9.02s 2.22s
% Output   : Proof 13.31s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWV070+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 : n019.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 07:57:42 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.61  ________       _____
% 0.21/0.61  ___  __ \_________(_)________________________________
% 0.21/0.61  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.21/0.61  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.21/0.61  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.21/0.61  
% 0.21/0.61  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.61  (2023-06-19)
% 0.21/0.61  
% 0.21/0.61  (c) Philipp Rümmer, 2009-2023
% 0.21/0.61  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.62                Amanda Stjerna.
% 0.21/0.62  Free software under BSD-3-Clause.
% 0.21/0.62  
% 0.21/0.62  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.62  
% 0.21/0.62  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.63  Running up to 7 provers in parallel.
% 0.21/0.64  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.64  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.64  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.64  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.64  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.65  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.21/0.65  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 4.63/1.43  Prover 4: Preprocessing ...
% 4.63/1.44  Prover 1: Preprocessing ...
% 4.63/1.48  Prover 5: Preprocessing ...
% 4.63/1.48  Prover 2: Preprocessing ...
% 4.63/1.48  Prover 3: Preprocessing ...
% 4.63/1.48  Prover 6: Preprocessing ...
% 5.12/1.50  Prover 0: Preprocessing ...
% 9.02/2.18  Prover 3: Constructing countermodel ...
% 9.02/2.19  Prover 6: Constructing countermodel ...
% 9.02/2.21  Prover 6: proved (1567ms)
% 9.02/2.21  
% 9.02/2.22  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.02/2.22  
% 9.02/2.22  Prover 3: stopped
% 9.02/2.22  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 9.02/2.23  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 11.11/2.27  Prover 1: Warning: ignoring some quantifiers
% 11.46/2.31  Prover 0: Constructing countermodel ...
% 11.46/2.31  Prover 0: stopped
% 11.46/2.31  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.79/2.35  Prover 4: Warning: ignoring some quantifiers
% 11.79/2.36  Prover 1: Constructing countermodel ...
% 11.79/2.36  Prover 1: Found proof (size 1)
% 11.79/2.36  Prover 1: proved (1727ms)
% 11.79/2.41  Prover 2: Constructing countermodel ...
% 11.79/2.41  Prover 2: stopped
% 11.79/2.41  Prover 8: Preprocessing ...
% 11.79/2.42  Prover 7: Preprocessing ...
% 11.79/2.42  Prover 4: Constructing countermodel ...
% 11.79/2.42  Prover 4: stopped
% 11.79/2.43  Prover 5: Proving ...
% 11.79/2.43  Prover 5: stopped
% 11.79/2.44  Prover 10: Preprocessing ...
% 12.45/2.46  Prover 7: stopped
% 12.45/2.48  Prover 10: stopped
% 13.07/2.59  Prover 8: Warning: ignoring some quantifiers
% 13.31/2.61  Prover 8: Constructing countermodel ...
% 13.31/2.61  Prover 8: stopped
% 13.31/2.61  
% 13.31/2.61  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.31/2.61  
% 13.31/2.61  % SZS output start Proof for theBenchmark
% 13.31/2.62  Assumptions after simplification:
% 13.31/2.62  ---------------------------------
% 13.31/2.62  
% 13.31/2.62    (cl5_nebula_array_0011)
% 13.31/2.62    $false
% 13.31/2.62  
% 13.31/2.62  Further assumptions not needed in the proof:
% 13.31/2.62  --------------------------------------------
% 13.31/2.62  const_array1_select, const_array2_select, defuse, finite_domain_0,
% 13.31/2.62  finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4,
% 13.31/2.62  finite_domain_5, gt_0_tptp_minus_1, gt_135300_0, gt_135300_1, gt_135300_2,
% 13.31/2.62  gt_135300_3, gt_135300_4, gt_135300_5, gt_135300_tptp_minus_1, gt_1_0,
% 13.31/2.62  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,
% 13.31/2.62  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,
% 13.31/2.62  gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_succ, irreflexivity_gt,
% 13.31/2.62  leq_geq, leq_gt1, leq_gt2, leq_gt_pred, leq_minus, leq_succ, leq_succ_gt,
% 13.31/2.62  leq_succ_gt_equiv, leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2,
% 13.31/2.62  matrix_symm_add, matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub,
% 13.31/2.62  matrix_symm_trans, matrix_symm_update_diagonal, pred_minus_1, pred_succ,
% 13.31/2.62  reflexivity_leq, sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1,
% 13.31/2.62  sel3_update_2, sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l,
% 13.31/2.62  succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r,
% 13.31/2.62  succ_plus_5_l, succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1,
% 13.31/2.62  successor_2, successor_3, successor_4, successor_5, sum_plus_base,
% 13.31/2.62  sum_plus_base_float, totality, transitivity_gt, transitivity_leq, ttrue,
% 13.31/2.62  uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo
% 13.31/2.62  
% 13.31/2.62  Those formulas are unsatisfiable:
% 13.31/2.62  ---------------------------------
% 13.31/2.62  
% 13.31/2.62  Begin of proof
% 13.31/2.63  | 
% 13.31/2.63  | CLOSE: (cl5_nebula_array_0011) is inconsistent.
% 13.31/2.63  | 
% 13.31/2.63  End of proof
% 13.31/2.63  % SZS output end Proof for theBenchmark
% 13.31/2.63  
% 13.31/2.63  2010ms
%------------------------------------------------------------------------------