TSTP Solution File: ARI311_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI311_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n021.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:47:40 EDT 2023
% Result : Theorem 4.46s 1.34s
% Output : Proof 7.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.13 % Problem : ARI311_1 : TPTP v8.1.2. Released v5.0.0.
% 0.14/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35 % Computer : n021.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 : Tue Aug 29 17:59:59 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.62/0.65 ________ _____
% 0.62/0.65 ___ __ \_________(_)________________________________
% 0.62/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.62/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.62/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.62/0.65
% 0.62/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.62/0.65 (2023-06-19)
% 0.62/0.65
% 0.62/0.65 (c) Philipp Rümmer, 2009-2023
% 0.62/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.62/0.65 Amanda Stjerna.
% 0.62/0.65 Free software under BSD-3-Clause.
% 0.62/0.65
% 0.62/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.62/0.65
% 0.62/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.62/0.67 Running up to 7 provers in parallel.
% 0.62/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.62/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.62/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.62/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.62/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.62/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.62/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.80/0.95 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.80/0.95 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.80/0.95 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.80/0.95 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.80/0.95 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.80/0.95 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.80/0.95 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 2.30/1.02 Prover 4: Preprocessing ...
% 2.30/1.02 Prover 1: Preprocessing ...
% 2.51/1.07 Prover 3: Preprocessing ...
% 2.51/1.07 Prover 6: Preprocessing ...
% 2.51/1.07 Prover 0: Preprocessing ...
% 2.51/1.07 Prover 5: Preprocessing ...
% 2.51/1.08 Prover 2: Preprocessing ...
% 4.19/1.31 Prover 6: Constructing countermodel ...
% 4.46/1.33 Prover 6: proved (648ms)
% 4.46/1.33
% 4.46/1.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.46/1.34
% 4.46/1.34 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.46/1.34 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation
% 4.84/1.39 Prover 0: Constructing countermodel ...
% 4.84/1.39 Prover 0: stopped
% 4.84/1.39 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.84/1.39 Prover 2: stopped
% 4.84/1.39 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation
% 4.84/1.39 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.84/1.40 Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation
% 4.84/1.40 Prover 7: Preprocessing ...
% 4.84/1.41 Prover 8: Preprocessing ...
% 4.84/1.42 Prover 10: Preprocessing ...
% 5.42/1.45 Prover 3: Constructing countermodel ...
% 5.42/1.45 Prover 3: stopped
% 5.42/1.47 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.42/1.47 Prover 11: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.60/1.49 Prover 5: Constructing countermodel ...
% 5.60/1.49 Prover 5: stopped
% 5.60/1.49 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.60/1.50 Prover 13: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.60/1.50 Prover 11: Preprocessing ...
% 5.60/1.50 Prover 13: Preprocessing ...
% 6.05/1.58 Prover 1: Constructing countermodel ...
% 6.05/1.59 Prover 1: Found proof (size 1)
% 6.05/1.59 Prover 1: proved (912ms)
% 6.05/1.61 Prover 10: stopped
% 6.05/1.61 Prover 4: Constructing countermodel ...
% 6.05/1.61 Prover 4: stopped
% 6.62/1.63 Prover 8: Warning: ignoring some quantifiers
% 6.62/1.64 Prover 8: Constructing countermodel ...
% 6.62/1.64 Prover 8: stopped
% 6.62/1.65 Prover 13: Warning: ignoring some quantifiers
% 6.62/1.65 Prover 13: Constructing countermodel ...
% 6.62/1.65 Prover 13: stopped
% 6.62/1.66 Prover 11: stopped
% 6.96/1.74 Prover 7: Warning: ignoring some quantifiers
% 6.96/1.74 Prover 7: Constructing countermodel ...
% 6.96/1.74 Prover 7: stopped
% 6.96/1.75
% 6.96/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.96/1.75
% 6.96/1.75 % SZS output start Proof for theBenchmark
% 7.34/1.75 Assumptions after simplification:
% 7.34/1.75 ---------------------------------
% 7.34/1.75
% 7.34/1.75 (rat_uminus_problem_4)
% 7.34/1.75 $false
% 7.34/1.75
% 7.34/1.75 Those formulas are unsatisfiable:
% 7.34/1.75 ---------------------------------
% 7.34/1.75
% 7.34/1.75 Begin of proof
% 7.34/1.75 |
% 7.34/1.75 | CLOSE: (rat_uminus_problem_4) is inconsistent.
% 7.34/1.75 |
% 7.34/1.75 End of proof
% 7.34/1.75 % SZS output end Proof for theBenchmark
% 7.34/1.75
% 7.34/1.75 1103ms
%------------------------------------------------------------------------------