TSTP Solution File: ARI456_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI456_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 : n002.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:48:06 EDT 2023
% Result : Theorem 5.57s 1.56s
% Output : Proof 10.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI456_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 18:18:20 EDT 2023
% 0.13/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.63 Free software under BSD-3-Clause.
% 0.20/0.63
% 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.63
% 0.20/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.64 Running up to 7 provers in parallel.
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.50/0.95 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
% 1.50/0.95 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation
% 1.50/0.95 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
% 1.50/0.95 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation
% 1.50/0.95 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation
% 1.50/0.95 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation
% 1.50/0.95 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation
% 2.14/1.06 Prover 4: Preprocessing ...
% 2.14/1.07 Prover 1: Preprocessing ...
% 2.73/1.12 Prover 6: Preprocessing ...
% 2.73/1.12 Prover 0: Preprocessing ...
% 3.35/1.26 Prover 2: Preprocessing ...
% 3.35/1.27 Prover 5: Preprocessing ...
% 3.35/1.27 Prover 3: Preprocessing ...
% 5.57/1.51 Prover 6: Constructing countermodel ...
% 5.57/1.55 Prover 6: proved (901ms)
% 5.57/1.55
% 5.57/1.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.57/1.56
% 5.57/1.57 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.57/1.59 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation
% 5.57/1.63 Prover 0: Constructing countermodel ...
% 5.57/1.63 Prover 0: stopped
% 5.57/1.64 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.60/1.65 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation
% 6.60/1.66 Prover 8: Preprocessing ...
% 6.60/1.66 Prover 1: Constructing countermodel ...
% 6.60/1.67 Prover 1: Found proof (size 1)
% 6.60/1.67 Prover 1: proved (1020ms)
% 7.07/1.71 Prover 7: Preprocessing ...
% 7.30/1.76 Prover 4: Constructing countermodel ...
% 7.30/1.76 Prover 4: stopped
% 8.44/1.91 Prover 8: Warning: ignoring some quantifiers
% 8.44/1.91 Prover 8: Constructing countermodel ...
% 8.44/1.91 Prover 8: stopped
% 9.12/1.98 Prover 2: stopped
% 9.47/2.08 Prover 7: stopped
% 10.73/2.30 Prover 5: Constructing countermodel ...
% 10.73/2.30 Prover 5: stopped
% 10.73/2.31 Prover 3: Constructing countermodel ...
% 10.73/2.31 Prover 3: stopped
% 10.73/2.31
% 10.73/2.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.73/2.31
% 10.73/2.31 % SZS output start Proof for theBenchmark
% 10.73/2.32 Assumptions after simplification:
% 10.73/2.32 ---------------------------------
% 10.73/2.32
% 10.73/2.32 (real_product_problem_21)
% 10.73/2.32 $false
% 10.73/2.32
% 10.73/2.32 Those formulas are unsatisfiable:
% 10.73/2.32 ---------------------------------
% 10.73/2.32
% 10.73/2.32 Begin of proof
% 10.73/2.33 |
% 10.73/2.33 | CLOSE: (real_product_problem_21) is inconsistent.
% 10.73/2.33 |
% 10.73/2.33 End of proof
% 10.73/2.33 % SZS output end Proof for theBenchmark
% 10.73/2.33
% 10.73/2.33 1701ms
%------------------------------------------------------------------------------