TSTP Solution File: ARI276_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI276_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 : 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 : 300s
% DateTime : Wed Aug 30 17:47:32 EDT 2023
% Result : Theorem 4.25s 1.27s
% Output : Proof 8.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : ARI276_1 : TPTP v8.1.2. Released v5.0.0.
% 0.04/0.07 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.06/0.25 % Computer : n012.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue Aug 29 18:35:38 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.10/0.52 ________ _____
% 0.10/0.53 ___ __ \_________(_)________________________________
% 0.10/0.53 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.10/0.53 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.10/0.53 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.10/0.53
% 0.10/0.53 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.10/0.53 (2023-06-19)
% 0.10/0.53
% 0.10/0.53 (c) Philipp Rümmer, 2009-2023
% 0.10/0.53 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.10/0.53 Amanda Stjerna.
% 0.10/0.53 Free software under BSD-3-Clause.
% 0.10/0.53
% 0.10/0.53 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.10/0.53
% 0.10/0.53 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.10/0.54 Running up to 7 provers in parallel.
% 0.10/0.55 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.10/0.55 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.10/0.55 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.10/0.55 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.10/0.55 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.10/0.55 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.10/0.55 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.67/0.83 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.83 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.83 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.83 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.83 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.83 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.67/0.83 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 2.39/0.92 Prover 4: Preprocessing ...
% 2.39/0.92 Prover 1: Preprocessing ...
% 2.86/0.99 Prover 6: Preprocessing ...
% 2.86/0.99 Prover 0: Preprocessing ...
% 3.86/1.13 Prover 5: Preprocessing ...
% 3.86/1.13 Prover 2: Preprocessing ...
% 3.86/1.15 Prover 3: Preprocessing ...
% 4.25/1.23 Prover 6: Constructing countermodel ...
% 4.25/1.27 Prover 6: proved (718ms)
% 4.25/1.27
% 4.25/1.27 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.25/1.27
% 4.25/1.28 Prover 0: Constructing countermodel ...
% 4.25/1.28 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.25/1.28 Prover 0: stopped
% 4.25/1.28 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.25/1.28 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.18/1.30 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.18/1.31 Prover 8: Preprocessing ...
% 5.70/1.38 Prover 7: Preprocessing ...
% 6.33/1.49 Prover 1: Constructing countermodel ...
% 6.33/1.51 Prover 1: Found proof (size 1)
% 6.33/1.51 Prover 1: proved (964ms)
% 7.05/1.56 Prover 4: Constructing countermodel ...
% 7.05/1.56 Prover 4: stopped
% 7.05/1.56 Prover 8: Warning: ignoring some quantifiers
% 7.05/1.57 Prover 8: Constructing countermodel ...
% 7.05/1.57 Prover 8: stopped
% 7.46/1.60 Prover 2: stopped
% 7.46/1.62 Prover 7: stopped
% 7.85/1.68 Prover 3: Constructing countermodel ...
% 7.85/1.68 Prover 3: stopped
% 8.09/1.71 Prover 5: Constructing countermodel ...
% 8.09/1.71 Prover 5: stopped
% 8.09/1.71
% 8.09/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.09/1.71
% 8.09/1.71 % SZS output start Proof for theBenchmark
% 8.09/1.72 Assumptions after simplification:
% 8.09/1.72 ---------------------------------
% 8.09/1.72
% 8.09/1.72 (rat_difference_problem_4)
% 8.09/1.72 $false
% 8.09/1.72
% 8.09/1.72 Those formulas are unsatisfiable:
% 8.09/1.72 ---------------------------------
% 8.09/1.72
% 8.09/1.72 Begin of proof
% 8.09/1.72 |
% 8.09/1.72 | CLOSE: (rat_difference_problem_4) is inconsistent.
% 8.09/1.72 |
% 8.09/1.72 End of proof
% 8.09/1.72 % SZS output end Proof for theBenchmark
% 8.09/1.72
% 8.09/1.72 1196ms
%------------------------------------------------------------------------------