TSTP Solution File: SYN721+1 by Princess---170717

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---170717
% Problem  : SYN721+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp
% Command  : princess-casc +printProof -timeout=%d %s

% Computer : n012.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  : 600s
% DateTime : Thu Jul 21 11:13:23 EDT 2022

% Result   : Theorem 2.47s 1.31s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN721+1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13  % Command  : princess-casc +printProof -timeout=%d %s
% 0.13/0.34  % Computer : n012.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  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 20:51:13 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.64/0.65  ________       _____
% 0.64/0.65  ___  __ \_________(_)________________________________
% 0.64/0.65  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.64/0.65  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.64/0.65  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.64/0.65  
% 0.64/0.65  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.64/0.65  (CASC 2017-07-17)
% 0.64/0.65  
% 0.64/0.65  (c) Philipp Rümmer, 2009-2017
% 0.64/0.65  (contributions by Peter Backeman, Peter Baumgartner,
% 0.64/0.65                    Angelo Brillout, Aleksandar Zeljic)
% 0.64/0.65  Free software under GNU Lesser General Public License (LGPL).
% 0.64/0.65  Bug reports to ph_r@gmx.net
% 0.64/0.65  
% 0.64/0.65  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.64/0.65  
% 0.64/0.65  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.64/0.70  Prover 0: Options:  +triggersInConjecture -genTotalityAxioms=ctors +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off
% 1.45/1.01  Prover 0: Preprocessing ...
% 1.66/1.13  Prover 0: Constructing countermodel ...
% 1.95/1.19  Prover 0: gave up
% 1.95/1.19  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off
% 1.95/1.20  Prover 1: Preprocessing ...
% 2.16/1.24  Prover 1: Constructing countermodel ...
% 2.16/1.25  Prover 1: gave up
% 2.16/1.25  Prover 2: Options:  +triggersInConjecture -genTotalityAxioms=all -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=off
% 2.16/1.27  Prover 2: Preprocessing ...
% 2.16/1.28  Prover 2: Proving ...
% 2.47/1.31  Prover 2: proved (57ms)
% 2.47/1.31  
% 2.47/1.31  VALID
% 2.47/1.31  % SZS status Theorem for theBenchmark
% 2.47/1.31  
% 2.47/1.31  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off
% 2.47/1.32  Prover 4: Preprocessing ...
% 2.47/1.36  Prover 4: Constructing countermodel ...
% 2.47/1.36  Prover 4: gave up
% 2.47/1.37  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off
% 2.47/1.37  Prover 7: Preprocessing ...
% 2.47/1.38  Prover 7: Warning: ignoring some quantifiers
% 2.73/1.38  Prover 7: Constructing countermodel ...
% 2.73/1.41  Prover 7: gave up
% 2.73/1.41  Prover 8: Options:  +triggersInConjecture -genTotalityAxioms=ctors -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off
% 2.73/1.42  Prover 8: Preprocessing ...
% 2.73/1.45  Prover 8: Constructing countermodel ...
% 2.73/1.46  Prover 8: gave up
% 2.73/1.46  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off
% 2.95/1.47  Prover 10: Preprocessing ...
% 2.95/1.47  Prover 10: Warning: ignoring some quantifiers
% 2.95/1.48  Prover 10: Constructing countermodel ...
% 2.99/1.49  Prover 10: gave up
% 2.99/1.49  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=off
% 2.99/1.50  Prover 11: Preprocessing ...
% 3.10/1.52  Prover 11: Constructing countermodel ...
% 3.10/1.53  Prover 11: gave up
% 3.14/1.53  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=off
% 3.14/1.53  Prover 13: Preprocessing ...
% 3.14/1.54  Prover 13: Warning: ignoring some quantifiers
% 3.14/1.54  Prover 13: Constructing countermodel ...
% 3.14/1.56  Prover 13: gave up
% 3.14/1.56  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms=none +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=off
% 3.14/1.56  Prover 16: Preprocessing ...
% 3.14/1.57  Prover 16: Warning: ignoring some quantifiers
% 3.14/1.57  Prover 16: Constructing countermodel ...
% 3.14/1.59  Prover 16: gave up
% 3.14/1.59  Prover 19: Options:  +triggersInConjecture -genTotalityAxioms=none -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=off
% 3.14/1.59  Prover 19: Preprocessing ...
% 3.44/1.62  Prover 19: Warning: ignoring some quantifiers
% 3.44/1.62  Prover 19: Constructing countermodel ...
% 3.44/1.65  Prover 19: gave up
% 3.44/1.65  
% 3.44/1.65  
% 3.44/1.65  988ms
%------------------------------------------------------------------------------