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