TSTP Solution File: ARI688_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI688_1 : TPTP v8.1.2. Released v6.3.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n022.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:49 EDT 2023
% Result : Theorem 2.52s 1.09s
% Output : Proof 2.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI688_1 : TPTP v8.1.2. Released v6.3.0.
% 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n022.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 17:46:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.66/0.63 ________ _____
% 0.66/0.63 ___ __ \_________(_)________________________________
% 0.66/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.66/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.66/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.66/0.63
% 0.66/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.66/0.63 (2023-06-19)
% 0.66/0.63
% 0.66/0.63 (c) Philipp Rümmer, 2009-2023
% 0.66/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.66/0.63 Amanda Stjerna.
% 0.66/0.63 Free software under BSD-3-Clause.
% 0.66/0.63
% 0.66/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.66/0.63
% 0.66/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.66/0.65 Running up to 7 provers in parallel.
% 0.66/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.66/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.66/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.66/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.66/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.66/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.66/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.08/1.02 Prover 3: Preprocessing ...
% 2.08/1.02 Prover 0: Preprocessing ...
% 2.08/1.02 Prover 2: Preprocessing ...
% 2.08/1.02 Prover 6: Preprocessing ...
% 2.08/1.02 Prover 1: Preprocessing ...
% 2.08/1.02 Prover 4: Preprocessing ...
% 2.08/1.03 Prover 5: Preprocessing ...
% 2.08/1.06 Prover 1: Constructing countermodel ...
% 2.08/1.06 Prover 4: Constructing countermodel ...
% 2.08/1.06 Prover 5: Constructing countermodel ...
% 2.08/1.06 Prover 3: Constructing countermodel ...
% 2.08/1.06 Prover 2: Constructing countermodel ...
% 2.08/1.06 Prover 0: Constructing countermodel ...
% 2.08/1.06 Prover 6: Constructing countermodel ...
% 2.52/1.09 Prover 0: proved (422ms)
% 2.52/1.09 Prover 2: proved (421ms)
% 2.52/1.09 Prover 6: proved (417ms)
% 2.52/1.09 Prover 3: proved (420ms)
% 2.52/1.09 Prover 5: proved (417ms)
% 2.52/1.09
% 2.52/1.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.52/1.09
% 2.52/1.09
% 2.52/1.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.52/1.09
% 2.52/1.09
% 2.52/1.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.52/1.09
% 2.52/1.09
% 2.52/1.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.52/1.09
% 2.52/1.09
% 2.52/1.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.52/1.09
% 2.52/1.09 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.52/1.09 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.52/1.09 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.52/1.10 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.52/1.10 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.52/1.10 Prover 7: Preprocessing ...
% 2.52/1.10 Prover 10: Preprocessing ...
% 2.52/1.10 Prover 8: Preprocessing ...
% 2.52/1.11 Prover 13: Preprocessing ...
% 2.52/1.11 Prover 7: Constructing countermodel ...
% 2.52/1.11 Prover 11: Preprocessing ...
% 2.52/1.11 Prover 10: Constructing countermodel ...
% 2.52/1.11 Prover 8: Constructing countermodel ...
% 2.52/1.11 Prover 13: Constructing countermodel ...
% 2.52/1.12 Prover 11: Constructing countermodel ...
% 2.52/1.12 Prover 7: Found proof (size 2)
% 2.52/1.12 Prover 8: Found proof (size 2)
% 2.52/1.12 Prover 13: Found proof (size 2)
% 2.52/1.12 Prover 13: proved (22ms)
% 2.52/1.12 Prover 7: proved (28ms)
% 2.52/1.12 Prover 8: proved (28ms)
% 2.52/1.12 Prover 11: stopped
% 2.52/1.12 Prover 10: stopped
% 2.52/1.12 Prover 1: Found proof (size 2)
% 2.52/1.12 Prover 1: proved (457ms)
% 2.52/1.12 Prover 4: Found proof (size 2)
% 2.52/1.12 Prover 4: proved (454ms)
% 2.52/1.12
% 2.52/1.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.52/1.12
% 2.52/1.12 % SZS output start Proof for theBenchmark
% 2.52/1.13 Assumptions after simplification:
% 2.52/1.13 ---------------------------------
% 2.52/1.13
% 2.52/1.13 (conj)
% 2.52/1.13 ~ ($difference($product(4353078, b), $product(287, a)) = $product(8, x))
% 2.52/1.13
% 2.52/1.13 (eq1)
% 2.52/1.13 a = $product(98164184, x)
% 2.52/1.13
% 2.52/1.13 (eq2)
% 2.52/1.13 b = $product(6472, x)
% 2.52/1.13
% 2.52/1.13 Those formulas are unsatisfiable:
% 2.52/1.13 ---------------------------------
% 2.52/1.13
% 2.52/1.13 Begin of proof
% 2.52/1.13 |
% 2.52/1.13 | REDUCE: (conj), (eq1), (eq2) imply:
% 2.52/1.13 | (1) $false
% 2.52/1.14 |
% 2.52/1.14 | CLOSE: (1) is inconsistent.
% 2.52/1.14 |
% 2.52/1.14 End of proof
% 2.52/1.14 % SZS output end Proof for theBenchmark
% 2.52/1.14
% 2.52/1.14 501ms
%------------------------------------------------------------------------------