TSTP Solution File: GRA017+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GRA017+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n009.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 00:04:31 EDT 2023
% Result : CounterSatisfiable 102.13s 13.92s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRA017+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Aug 27 03:10:35 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.50/0.60 ________ _____
% 0.50/0.60 ___ __ \_________(_)________________________________
% 0.50/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.50/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.50/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.50/0.60
% 0.50/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.50/0.60 (2023-06-19)
% 0.50/0.60
% 0.50/0.60 (c) Philipp Rümmer, 2009-2023
% 0.50/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.50/0.60 Amanda Stjerna.
% 0.50/0.60 Free software under BSD-3-Clause.
% 0.50/0.60
% 0.50/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.50/0.60
% 0.50/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.50/0.61 Running up to 7 provers in parallel.
% 0.50/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.50/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.50/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.50/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.50/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.50/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.50/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 2.15/1.01 Prover 1: Preprocessing ...
% 2.15/1.01 Prover 4: Preprocessing ...
% 2.61/1.07 Prover 5: Preprocessing ...
% 2.61/1.07 Prover 0: Preprocessing ...
% 2.61/1.07 Prover 6: Preprocessing ...
% 2.61/1.07 Prover 2: Preprocessing ...
% 2.61/1.07 Prover 3: Preprocessing ...
% 3.22/1.22 Prover 5: Constructing countermodel ...
% 3.22/1.22 Prover 2: Constructing countermodel ...
% 3.80/1.25 Prover 3: Constructing countermodel ...
% 3.80/1.25 Prover 6: Constructing countermodel ...
% 4.10/1.29 Prover 1: Constructing countermodel ...
% 4.76/1.38 Prover 4: Constructing countermodel ...
% 4.76/1.40 Prover 3: gave up
% 4.76/1.41 Prover 1: gave up
% 4.76/1.41 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.76/1.41 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.12/1.43 Prover 7: Preprocessing ...
% 5.12/1.44 Prover 6: gave up
% 5.12/1.44 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 5.12/1.44 Prover 8: Preprocessing ...
% 5.12/1.45 Prover 9: Preprocessing ...
% 5.38/1.45 Prover 7: Constructing countermodel ...
% 5.38/1.50 Prover 0: Proving ...
% 5.38/1.52 Prover 8: Warning: ignoring some quantifiers
% 5.38/1.52 Prover 8: Constructing countermodel ...
% 6.30/1.58 Prover 8: gave up
% 6.30/1.59 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.30/1.63 Prover 10: Preprocessing ...
% 6.30/1.64 Prover 10: Constructing countermodel ...
% 6.83/1.65 Prover 9: Constructing countermodel ...
% 64.04/9.05 Prover 2: stopped
% 64.04/9.07 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 64.53/9.08 Prover 11: Preprocessing ...
% 65.74/9.25 Prover 11: Constructing countermodel ...
% 102.13/13.90 Prover 10: proven invalid (12303ms)
% 102.13/13.90 Prover 9: stopped
% 102.13/13.90 Prover 7: stopped
% 102.13/13.90 Prover 0: stopped
% 102.13/13.90 Prover 4: stopped
% 102.13/13.90 Prover 5: stopped
% 102.13/13.92 Prover 11: stopped
% 102.13/13.92
% 102.13/13.92 % SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 102.13/13.92
% 102.13/13.92 13324ms
%------------------------------------------------------------------------------