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

View Problem - Process Solution

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

% Computer : n028.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 10:04:07 EDT 2023

% Result   : CounterSatisfiable 9.31s 2.12s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : NLP131+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35  % Computer : n028.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug 24 10:41:19 EDT 2023
% 0.14/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.64  Running up to 7 provers in parallel.
% 0.20/0.66  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.66  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.66  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.66  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.66  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.66  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.66  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.31/1.18  Prover 4: Preprocessing ...
% 3.31/1.18  Prover 1: Preprocessing ...
% 3.57/1.22  Prover 5: Preprocessing ...
% 3.57/1.22  Prover 6: Preprocessing ...
% 3.57/1.22  Prover 3: Preprocessing ...
% 3.57/1.22  Prover 0: Preprocessing ...
% 3.57/1.22  Prover 2: Preprocessing ...
% 4.96/1.46  Prover 5: Constructing countermodel ...
% 4.96/1.48  Prover 2: Constructing countermodel ...
% 6.20/1.58  Prover 2: proven invalid (936ms)
% 6.29/1.59  Prover 5: stopped
% 6.58/1.67  Prover 1: Constructing countermodel ...
% 6.58/1.68  Prover 6: Proving ...
% 6.58/1.69  Prover 6: stopped
% 6.58/1.69  Prover 1: stopped
% 7.21/1.71  Prover 3: Constructing countermodel ...
% 7.21/1.72  Prover 3: stopped
% 8.87/2.10  Prover 0: stopped
% 9.31/2.11  Prover 4: stopped
% 9.31/2.11  
% 9.31/2.12  % SZS status CounterSatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.31/2.12  
% 9.31/2.12  1498ms
%------------------------------------------------------------------------------