TSTP Solution File: ARI705_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI705_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 : n024.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:53 EDT 2023
% Result : Theorem 2.80s 1.18s
% Output : Proof 4.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI705_1 : TPTP v8.1.2. Released v6.3.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 18:01:23 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.63 ________ _____
% 0.21/0.63 ___ __ \_________(_)________________________________
% 0.21/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.63
% 0.21/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.63 (2023-06-19)
% 0.21/0.63
% 0.21/0.63 (c) Philipp Rümmer, 2009-2023
% 0.21/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.63 Amanda Stjerna.
% 0.21/0.63 Free software under BSD-3-Clause.
% 0.21/0.63
% 0.21/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.63
% 0.21/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.65 Running up to 7 provers in parallel.
% 0.21/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.23/1.05 Prover 1: Preprocessing ...
% 2.23/1.05 Prover 2: Preprocessing ...
% 2.23/1.05 Prover 0: Preprocessing ...
% 2.23/1.05 Prover 6: Preprocessing ...
% 2.23/1.05 Prover 5: Preprocessing ...
% 2.23/1.05 Prover 3: Preprocessing ...
% 2.23/1.05 Prover 4: Preprocessing ...
% 2.23/1.12 Prover 5: Constructing countermodel ...
% 2.23/1.12 Prover 6: Constructing countermodel ...
% 2.23/1.12 Prover 3: Constructing countermodel ...
% 2.23/1.12 Prover 0: Constructing countermodel ...
% 2.23/1.12 Prover 1: Constructing countermodel ...
% 2.23/1.12 Prover 2: Constructing countermodel ...
% 2.23/1.12 Prover 4: Constructing countermodel ...
% 2.80/1.18 Prover 2: proved (523ms)
% 2.80/1.18 Prover 6: proved (520ms)
% 2.80/1.18 Prover 5: proved (521ms)
% 2.80/1.18
% 2.80/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.18
% 2.80/1.18 Prover 0: proved (523ms)
% 2.80/1.18 Prover 3: proved (523ms)
% 2.80/1.18
% 2.80/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.18
% 2.80/1.18
% 2.80/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.18
% 2.80/1.18
% 2.80/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.18
% 2.80/1.18
% 2.80/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.18
% 2.80/1.18 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.80/1.18 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.80/1.18 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.80/1.19 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.80/1.19 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.10/1.20 Prover 7: Preprocessing ...
% 3.10/1.20 Prover 8: Preprocessing ...
% 3.10/1.20 Prover 10: Preprocessing ...
% 3.10/1.20 Prover 11: Preprocessing ...
% 3.10/1.20 Prover 13: Preprocessing ...
% 3.10/1.20 Prover 8: Constructing countermodel ...
% 3.10/1.20 Prover 7: Constructing countermodel ...
% 3.10/1.21 Prover 10: Constructing countermodel ...
% 3.10/1.21 Prover 11: Constructing countermodel ...
% 3.10/1.21 Prover 13: Constructing countermodel ...
% 3.78/1.33 Prover 7: Found proof (size 9)
% 3.78/1.33 Prover 13: Found proof (size 9)
% 3.78/1.33 Prover 11: Found proof (size 9)
% 3.78/1.33 Prover 1: Found proof (size 9)
% 3.78/1.33 Prover 10: Found proof (size 9)
% 3.78/1.33 Prover 8: Found proof (size 9)
% 3.78/1.33 Prover 13: proved (140ms)
% 3.78/1.33 Prover 1: proved (672ms)
% 3.78/1.33 Prover 10: proved (143ms)
% 3.78/1.33 Prover 7: proved (144ms)
% 3.78/1.33 Prover 8: proved (145ms)
% 3.78/1.33 Prover 11: proved (142ms)
% 3.78/1.33 Prover 4: Found proof (size 9)
% 3.78/1.33 Prover 4: proved (672ms)
% 3.78/1.33
% 3.78/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.78/1.33
% 3.78/1.33 % SZS output start Proof for theBenchmark
% 3.78/1.33 Assumptions after simplification:
% 3.78/1.33 ---------------------------------
% 3.78/1.33
% 3.78/1.33 (conj)
% 3.78/1.34 ? [v0: int] : ? [v1: int] : ? [v2: int] : ( ~ (v2 = 0) & $product(v1, b) =
% 3.78/1.34 v2 & $product(v0, a) = v1 & $product(d, c) = v0)
% 3.78/1.34
% 3.78/1.34 (eq)
% 3.78/1.34 ? [v0: int] : (a = 0 & $product(d, d) = v0)
% 3.78/1.34
% 3.78/1.34 Those formulas are unsatisfiable:
% 3.78/1.34 ---------------------------------
% 3.78/1.34
% 3.78/1.34 Begin of proof
% 3.78/1.34 |
% 3.78/1.34 | DELTA: instantiating (eq) with fresh symbol all_2_0 gives:
% 3.78/1.34 | (1) a = 0 & $product(d, d) = all_2_0
% 3.78/1.34 |
% 3.78/1.34 | ALPHA: (1) implies:
% 4.04/1.34 | (2) a = 0
% 4.04/1.35 |
% 4.04/1.35 | DELTA: instantiating (conj) with fresh symbols all_4_0, all_4_1, all_4_2
% 4.04/1.35 | gives:
% 4.04/1.35 | (3) ~ (all_4_0 = 0) & $product(all_4_1, b) = all_4_0 & $product(all_4_2,
% 4.04/1.35 | a) = all_4_1 & $product(d, c) = all_4_2
% 4.04/1.35 |
% 4.04/1.35 | ALPHA: (3) implies:
% 4.04/1.35 | (4) ~ (all_4_0 = 0)
% 4.04/1.35 | (5) $product(all_4_2, a) = all_4_1
% 4.04/1.35 | (6) $product(all_4_1, b) = all_4_0
% 4.04/1.35 |
% 4.04/1.35 | REDUCE: (2), (5) imply:
% 4.04/1.35 | (7) $product(all_4_2, 0) = all_4_1
% 4.04/1.35 |
% 4.04/1.35 | THEORY_AXIOM GroebnerMultiplication:
% 4.04/1.35 | (8) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : (v3 = 0 |
% 4.04/1.35 | ~ ($product(v2, v0) = v3) | ~ ($product(v1, 0) = v2))
% 4.04/1.35 |
% 4.04/1.35 | GROUND_INST: instantiating (8) with b, all_4_2, all_4_1, all_4_0, simplifying
% 4.04/1.35 | with (6), (7) gives:
% 4.04/1.35 | (9) all_4_0 = 0
% 4.04/1.35 |
% 4.04/1.35 | REDUCE: (4), (9) imply:
% 4.04/1.35 | (10) $false
% 4.04/1.35 |
% 4.04/1.35 | CLOSE: (10) is inconsistent.
% 4.04/1.35 |
% 4.04/1.35 End of proof
% 4.04/1.35 % SZS output end Proof for theBenchmark
% 4.04/1.35
% 4.04/1.35 718ms
%------------------------------------------------------------------------------