TSTP Solution File: ARI676_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI676_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 : n028.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:46 EDT 2023
% Result : Theorem 2.68s 1.15s
% Output : Proof 3.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI676_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.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 18:20:26 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.62 ________ _____
% 0.19/0.62 ___ __ \_________(_)________________________________
% 0.19/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.62
% 0.19/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.62 (2023-06-19)
% 0.19/0.62
% 0.19/0.62 (c) Philipp Rümmer, 2009-2023
% 0.19/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.62 Amanda Stjerna.
% 0.19/0.62 Free software under BSD-3-Clause.
% 0.19/0.62
% 0.19/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.62
% 0.19/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.64 Running up to 7 provers in parallel.
% 0.19/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.84/1.01 Prover 3: Preprocessing ...
% 1.84/1.01 Prover 6: Preprocessing ...
% 1.84/1.01 Prover 1: Preprocessing ...
% 1.84/1.01 Prover 2: Preprocessing ...
% 1.84/1.01 Prover 4: Preprocessing ...
% 1.84/1.01 Prover 0: Preprocessing ...
% 1.84/1.01 Prover 5: Preprocessing ...
% 2.24/1.05 Prover 2: Constructing countermodel ...
% 2.24/1.05 Prover 5: Constructing countermodel ...
% 2.24/1.05 Prover 6: Constructing countermodel ...
% 2.24/1.05 Prover 3: Constructing countermodel ...
% 2.24/1.05 Prover 0: Constructing countermodel ...
% 2.24/1.05 Prover 4: Constructing countermodel ...
% 2.24/1.05 Prover 1: Constructing countermodel ...
% 2.68/1.15 Prover 3: proved (493ms)
% 2.68/1.15 Prover 0: proved (492ms)
% 2.68/1.15 Prover 5: proved (489ms)
% 2.68/1.15
% 2.68/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.68/1.15
% 2.68/1.15 Prover 2: proved (492ms)
% 2.68/1.15
% 2.68/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.68/1.15
% 2.68/1.15 Prover 6: proved (487ms)
% 2.68/1.15
% 2.68/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.68/1.15
% 2.68/1.15
% 2.68/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.68/1.15
% 2.68/1.15
% 2.68/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.68/1.15
% 2.68/1.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.68/1.15 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.68/1.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.68/1.15 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.68/1.15 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.68/1.16 Prover 7: Preprocessing ...
% 2.68/1.16 Prover 10: Preprocessing ...
% 2.68/1.16 Prover 11: Preprocessing ...
% 2.68/1.16 Prover 8: Preprocessing ...
% 2.68/1.16 Prover 10: Constructing countermodel ...
% 2.68/1.16 Prover 7: Constructing countermodel ...
% 2.68/1.17 Prover 11: Constructing countermodel ...
% 2.68/1.17 Prover 8: Constructing countermodel ...
% 3.21/1.17 Prover 13: Preprocessing ...
% 3.21/1.17 Prover 4: Found proof (size 6)
% 3.21/1.18 Prover 1: Found proof (size 6)
% 3.21/1.18 Prover 1: proved (523ms)
% 3.21/1.18 Prover 4: proved (522ms)
% 3.21/1.18 Prover 10: Found proof (size 6)
% 3.21/1.18 Prover 10: proved (25ms)
% 3.21/1.18 Prover 7: stopped
% 3.21/1.18 Prover 13: Constructing countermodel ...
% 3.21/1.18 Prover 13: stopped
% 3.21/1.18 Prover 8: stopped
% 3.21/1.18 Prover 11: Found proof (size 6)
% 3.26/1.18 Prover 11: proved (26ms)
% 3.26/1.18
% 3.26/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/1.18
% 3.26/1.18 % SZS output start Proof for theBenchmark
% 3.26/1.18 Assumptions after simplification:
% 3.26/1.18 ---------------------------------
% 3.26/1.18
% 3.26/1.18 (conj)
% 3.26/1.19 ? [v0: int] : ($lesseq(v0, -11) & $product(a, a) = v0)
% 3.26/1.19
% 3.26/1.19 Those formulas are unsatisfiable:
% 3.26/1.19 ---------------------------------
% 3.26/1.19
% 3.26/1.19 Begin of proof
% 3.26/1.19 |
% 3.26/1.19 | DELTA: instantiating (conj) with fresh symbol all_2_0 gives:
% 3.26/1.19 | (1) $lesseq(all_2_0, -11) & $product(a, a) = all_2_0
% 3.26/1.19 |
% 3.26/1.20 | ALPHA: (1) implies:
% 3.26/1.20 | (2) $lesseq(all_2_0, -11)
% 3.26/1.20 | (3) $product(a, a) = all_2_0
% 3.26/1.20 |
% 3.26/1.20 | THEORY_AXIOM GroebnerMultiplication:
% 3.26/1.20 | (4) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, -1)) | ~ ($product(v0,
% 3.26/1.20 | v0) = v1))
% 3.26/1.20 |
% 3.26/1.20 | GROUND_INST: instantiating (4) with a, all_2_0, simplifying with (3) gives:
% 3.26/1.20 | (5) $lesseq(0, all_2_0)
% 3.26/1.20 |
% 3.26/1.20 | COMBINE_INEQS: (2), (5) imply:
% 3.26/1.20 | (6) $false
% 3.26/1.20 |
% 3.26/1.20 | CLOSE: (6) is inconsistent.
% 3.26/1.20 |
% 3.26/1.20 End of proof
% 3.26/1.20 % SZS output end Proof for theBenchmark
% 3.26/1.20
% 3.26/1.20 577ms
%------------------------------------------------------------------------------