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

View Problem - Process Solution

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

% Computer : n013.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:01 EDT 2023

% Result   : Theorem 235.60s 32.56s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR115+76 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33  % Computer : n013.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Mon Aug 28 09:55:32 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/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.62  Running up to 7 provers in parallel.
% 0.20/0.64  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 85.95/12.82  Prover 0: Preprocessing ...
% 88.89/13.19  Prover 1: Preprocessing ...
% 88.89/13.20  Prover 6: Preprocessing ...
% 89.65/13.32  Prover 3: Preprocessing ...
% 89.65/13.34  Prover 5: Preprocessing ...
% 92.05/13.57  Prover 4: Preprocessing ...
% 93.76/13.82  Prover 2: Preprocessing ...
% 121.37/17.38  Prover 3: Constructing countermodel ...
% 130.49/18.57  Prover 2: Proving ...
% 132.82/18.98  Prover 5: Proving ...
% 139.98/19.87  Prover 1: Constructing countermodel ...
% 141.68/20.02  Prover 6: Proving ...
% 149.57/21.12  Prover 4: Constructing countermodel ...
% 169.81/23.75  Prover 0: Proving ...
% 171.49/24.01  Prover 5: stopped
% 171.49/24.03  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 178.77/24.91  Prover 2: stopped
% 178.77/24.91  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 235.60/32.56  Prover 3: proved (31931ms)
% 235.60/32.56  
% 235.60/32.56  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 235.60/32.56  
% 235.60/32.56  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 235.60/32.57  Prover 0: stopped
% 235.60/32.57  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 236.28/32.66  Prover 6: stopped
% 236.28/32.66  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 278.77/38.70  Prover 7: Preprocessing ...
% 297.57/41.35  Prover 8: Preprocessing ...
%------------------------------------------------------------------------------