TSTP Solution File: ARI621_2 by Princess---230619

View Problem - Process Solution

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

% Computer : n004.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 17:48:36 EDT 2023

% Result   : Timeout 300.73s 40.55s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : ARI621_2 : TPTP v8.1.2. Released v5.1.0.
% 0.13/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35  % Computer : n004.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 17:50:37 EDT 2023
% 0.13/0.35  % 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/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63  Running up to 7 provers in parallel.
% 0.20/0.65  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.55/0.93  Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.55/0.93  Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.55/0.93  Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.55/0.93  Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.55/0.93  Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.55/0.93  Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.55/0.93  Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 2.74/1.09  Prover 4: Preprocessing ...
% 2.74/1.09  Prover 1: Preprocessing ...
% 3.06/1.14  Prover 0: Preprocessing ...
% 3.06/1.14  Prover 6: Preprocessing ...
% 3.06/1.21  Prover 3: Preprocessing ...
% 3.68/1.21  Prover 5: Preprocessing ...
% 3.68/1.22  Prover 2: Preprocessing ...
% 7.76/1.76  Prover 6: Proving ...
% 7.76/1.76  Prover 1: Constructing countermodel ...
% 7.87/1.78  Prover 4: Constructing countermodel ...
% 8.43/1.89  Prover 0: Proving ...
% 11.52/2.30  Prover 2: Proving ...
% 11.52/2.32  Prover 3: Constructing countermodel ...
% 12.09/2.34  Prover 1: gave up
% 12.09/2.35  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 12.09/2.36  Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation
% 12.43/2.42  Prover 7: Preprocessing ...
% 13.66/2.59  Prover 5: Proving ...
% 17.20/3.03  Prover 7: Warning: ignoring some quantifiers
% 17.55/3.04  Prover 7: Constructing countermodel ...
% 69.48/9.72  Prover 2: stopped
% 69.48/9.75  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 69.48/9.75  Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation
% 70.06/9.77  Prover 8: Preprocessing ...
% 70.42/9.83  Prover 8: Warning: ignoring some quantifiers
% 70.42/9.83  Prover 8: Constructing countermodel ...
% 71.32/9.93  Prover 8: gave up
% 71.32/9.94  Prover 9: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 71.32/9.94  Prover 9: Warning: Problem contains rationals, using incomplete axiomatisation
% 71.83/9.99  Prover 9: Preprocessing ...
% 75.09/10.43  Prover 9: Constructing countermodel ...
% 102.75/13.99  Prover 5: stopped
% 102.75/14.01  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 102.75/14.01  Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation
% 102.95/14.08  Prover 10: Preprocessing ...
% 105.99/14.40  Prover 10: Warning: ignoring some quantifiers
% 105.99/14.41  Prover 10: Constructing countermodel ...
% 132.84/17.89  Prover 6: stopped
% 133.00/17.91  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 133.00/17.92  Prover 11: Warning: Problem contains rationals, using incomplete axiomatisation
% 133.00/17.94  Prover 11: Preprocessing ...
% 136.01/18.25  Prover 11: Constructing countermodel ...
% 188.90/25.58  Prover 7: stopped
% 188.90/25.58  Prover 12: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=2024365391
% 188.90/25.58  Prover 12: Warning: Problem contains rationals, using incomplete axiomatisation
% 188.90/25.61  Prover 12: Preprocessing ...
% 189.99/25.68  Prover 12: Proving ...
% 198.08/26.76  Prover 12: stopped
% 198.08/26.78  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 198.08/26.78  Prover 13: Warning: Problem contains rationals, using incomplete axiomatisation
% 198.59/26.79  Prover 13: Preprocessing ...
% 199.15/26.86  Prover 13: Warning: ignoring some quantifiers
% 199.15/26.86  Prover 13: Constructing countermodel ...
% 199.51/26.96  Prover 13: gave up
% 199.51/26.97  Prover 14: Options:  -triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=414236379
% 199.51/26.97  Prover 14: Warning: Problem contains rationals, using incomplete axiomatisation
% 199.51/26.99  Prover 14: Preprocessing ...
% 199.80/27.06  Prover 14: Proving ...
%------------------------------------------------------------------------------