TSTP Solution File: ARI455_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI455_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 : n023.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 6.27s 1.62s
% Output : Proof 11.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ARI455_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 29 18:23:24 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.68/0.65 ________ _____
% 0.68/0.65 ___ __ \_________(_)________________________________
% 0.68/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.68/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.68/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.68/0.65
% 0.68/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.68/0.65 (2023-06-19)
% 0.68/0.65
% 0.68/0.65 (c) Philipp Rümmer, 2009-2023
% 0.68/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.68/0.65 Amanda Stjerna.
% 0.68/0.65 Free software under BSD-3-Clause.
% 0.68/0.65
% 0.68/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.68/0.65
% 0.68/0.65 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.68/0.67 Running up to 7 provers in parallel.
% 0.79/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.79/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.79/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.79/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.79/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.79/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.79/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.58/0.97 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation
% 1.58/0.97 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
% 1.58/0.97 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation
% 1.58/0.97 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation
% 1.58/0.97 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
% 1.58/0.97 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation
% 1.58/0.97 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation
% 2.57/1.08 Prover 4: Preprocessing ...
% 2.57/1.08 Prover 1: Preprocessing ...
% 2.92/1.14 Prover 6: Preprocessing ...
% 2.92/1.14 Prover 0: Preprocessing ...
% 3.74/1.24 Prover 5: Preprocessing ...
% 3.74/1.24 Prover 2: Preprocessing ...
% 3.74/1.26 Prover 3: Preprocessing ...
% 6.27/1.58 Prover 0: Constructing countermodel ...
% 6.27/1.58 Prover 6: Constructing countermodel ...
% 6.27/1.62 Prover 6: proved (934ms)
% 6.27/1.62
% 6.27/1.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.27/1.62
% 6.27/1.62 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.27/1.63 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation
% 6.27/1.63 Prover 0: stopped
% 6.27/1.63 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.27/1.63 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation
% 6.27/1.64 Prover 8: Preprocessing ...
% 7.09/1.70 Prover 1: Constructing countermodel ...
% 7.09/1.71 Prover 1: Found proof (size 1)
% 7.09/1.71 Prover 1: proved (1031ms)
% 7.09/1.71 Prover 7: Preprocessing ...
% 7.72/1.78 Prover 4: Constructing countermodel ...
% 7.72/1.78 Prover 4: stopped
% 8.16/1.85 Prover 8: Warning: ignoring some quantifiers
% 8.48/1.86 Prover 8: Constructing countermodel ...
% 8.48/1.86 Prover 8: stopped
% 9.37/1.99 Prover 2: stopped
% 9.92/2.11 Prover 7: stopped
% 11.02/2.27 Prover 5: Constructing countermodel ...
% 11.02/2.27 Prover 5: stopped
% 11.43/2.34 Prover 3: Constructing countermodel ...
% 11.43/2.34 Prover 3: stopped
% 11.43/2.34
% 11.43/2.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.43/2.34
% 11.43/2.34 % SZS output start Proof for theBenchmark
% 11.43/2.35 Assumptions after simplification:
% 11.43/2.35 ---------------------------------
% 11.43/2.35
% 11.43/2.35 (real_product_problem_20)
% 11.48/2.35 $false
% 11.48/2.35
% 11.48/2.35 Those formulas are unsatisfiable:
% 11.48/2.35 ---------------------------------
% 11.48/2.35
% 11.48/2.35 Begin of proof
% 11.48/2.35 |
% 11.48/2.35 | CLOSE: (real_product_problem_20) is inconsistent.
% 11.48/2.35 |
% 11.48/2.35 End of proof
% 11.48/2.35 % SZS output end Proof for theBenchmark
% 11.48/2.35
% 11.48/2.36 1702ms
%------------------------------------------------------------------------------