TSTP Solution File: CSR115+85 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : CSR115+85 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n005.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 : Wed Aug 30 21:38:03 EDT 2023

% Result   : Timeout 299.05s 41.67s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : CSR115+85 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n005.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 : Mon Aug 28 12:47:23 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.60  ________       _____
% 0.20/0.60  ___  __ \_________(_)________________________________
% 0.20/0.60  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.20/0.60  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.20/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.20/0.60  
% 0.20/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.60  (2023-06-19)
% 0.20/0.60  
% 0.20/0.60  (c) Philipp Rümmer, 2009-2023
% 0.20/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.60                Amanda Stjerna.
% 0.20/0.60  Free software under BSD-3-Clause.
% 0.20/0.60  
% 0.20/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.60  
% 0.20/0.60  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.62  Running up to 7 provers in parallel.
% 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 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 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 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 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 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
% 139.46/20.72  Prover 0: Preprocessing ...
% 141.77/20.96  Prover 3: Preprocessing ...
% 142.28/21.06  Prover 1: Preprocessing ...
% 144.63/21.37  Prover 4: Preprocessing ...
% 144.63/21.41  Prover 6: Preprocessing ...
% 145.88/21.54  Prover 2: Preprocessing ...
% 146.92/21.68  Prover 5: Preprocessing ...
% 176.54/25.51  Prover 3: Constructing countermodel ...
% 197.50/28.23  Prover 4: Constructing countermodel ...
% 197.83/28.28  Prover 1: Constructing countermodel ...
% 208.15/29.66  Prover 5: Proving ...
% 209.33/29.80  Prover 2: Proving ...
% 233.69/33.04  Prover 6: Proving ...
% 299.05/41.67  Prover 2: stopped
% 299.05/41.67  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
%------------------------------------------------------------------------------