TSTP Solution File: ARI695_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI695_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 : n027.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:50 EDT 2023
% Result : Theorem 3.53s 1.41s
% Output : Proof 4.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ARI695_1 : TPTP v8.1.2. Released v6.3.0.
% 0.11/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Aug 29 19:10:53 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.62 ________ _____
% 0.18/0.62 ___ __ \_________(_)________________________________
% 0.18/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.18/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.18/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.18/0.62
% 0.18/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.62 (2023-06-19)
% 0.18/0.62
% 0.18/0.62 (c) Philipp Rümmer, 2009-2023
% 0.18/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.62 Amanda Stjerna.
% 0.18/0.62 Free software under BSD-3-Clause.
% 0.18/0.62
% 0.18/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.62
% 0.18/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.18/0.64 Running up to 7 provers in parallel.
% 0.59/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.59/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.59/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.59/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.59/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.59/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.59/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.00/1.12 Prover 2: Preprocessing ...
% 2.00/1.12 Prover 4: Preprocessing ...
% 2.00/1.12 Prover 0: Preprocessing ...
% 2.00/1.12 Prover 1: Preprocessing ...
% 2.00/1.12 Prover 6: Preprocessing ...
% 2.00/1.12 Prover 5: Preprocessing ...
% 2.23/1.12 Prover 3: Preprocessing ...
% 2.51/1.18 Prover 5: Constructing countermodel ...
% 2.51/1.18 Prover 3: Constructing countermodel ...
% 2.51/1.18 Prover 0: Constructing countermodel ...
% 2.51/1.18 Prover 4: Constructing countermodel ...
% 2.51/1.18 Prover 6: Constructing countermodel ...
% 2.51/1.18 Prover 1: Constructing countermodel ...
% 2.51/1.18 Prover 2: Constructing countermodel ...
% 3.53/1.40 Prover 6: proved (743ms)
% 3.53/1.40 Prover 3: proved (748ms)
% 3.53/1.40 Prover 0: proved (750ms)
% 3.53/1.41
% 3.53/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.53/1.41
% 3.53/1.41 Prover 2: proved (749ms)
% 3.53/1.41 Prover 5: proved (745ms)
% 3.53/1.41
% 3.53/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.53/1.41
% 3.80/1.41
% 3.80/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.80/1.41
% 3.80/1.41
% 3.80/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.80/1.41
% 3.80/1.41
% 3.80/1.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.80/1.41
% 3.80/1.41 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.80/1.41 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.80/1.41 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.80/1.41 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.80/1.41 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.80/1.42 Prover 10: Preprocessing ...
% 3.80/1.42 Prover 13: Preprocessing ...
% 3.80/1.43 Prover 1: Found proof (size 6)
% 3.80/1.43 Prover 4: Found proof (size 6)
% 3.80/1.43 Prover 4: proved (773ms)
% 3.80/1.43 Prover 1: proved (776ms)
% 3.80/1.43 Prover 7: Preprocessing ...
% 3.80/1.43 Prover 8: Preprocessing ...
% 3.80/1.43 Prover 13: Constructing countermodel ...
% 3.80/1.43 Prover 13: stopped
% 3.80/1.44 Prover 10: Constructing countermodel ...
% 3.80/1.44 Prover 10: stopped
% 3.80/1.44 Prover 11: Preprocessing ...
% 3.80/1.44 Prover 8: Constructing countermodel ...
% 3.80/1.44 Prover 8: stopped
% 3.80/1.45 Prover 11: Constructing countermodel ...
% 3.80/1.45 Prover 7: Constructing countermodel ...
% 3.80/1.45 Prover 11: stopped
% 3.80/1.45 Prover 7: stopped
% 3.80/1.45
% 3.80/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.80/1.45
% 4.06/1.45 % SZS output start Proof for theBenchmark
% 4.06/1.46 Assumptions after simplification:
% 4.06/1.46 ---------------------------------
% 4.06/1.46
% 4.06/1.46 (conj)
% 4.06/1.47 ? [v0: int] : ? [v1: int] : ( ~ (v1 = v0) & $product($product(-1, d),
% 4.06/1.47 $sum(c, 2)) = v0 & $product(d, $difference(-2, c)) = v1)
% 4.06/1.47
% 4.06/1.47 Those formulas are unsatisfiable:
% 4.06/1.47 ---------------------------------
% 4.06/1.47
% 4.06/1.47 Begin of proof
% 4.06/1.47 |
% 4.06/1.47 | DELTA: instantiating (conj) with fresh symbols all_2_0, all_2_1 gives:
% 4.06/1.47 | (1) ~ (all_2_0 = all_2_1) & $product($product(-1, d), $sum(c, 2)) =
% 4.06/1.47 | all_2_1 & $product(d, $difference(-2, c)) = all_2_0
% 4.06/1.47 |
% 4.06/1.47 | ALPHA: (1) implies:
% 4.06/1.48 | (2) ~ (all_2_0 = all_2_1)
% 4.06/1.48 | (3) $product(d, $difference(-2, c)) = all_2_0
% 4.06/1.48 | (4) $product($product(-1, d), $sum(c, 2)) = all_2_1
% 4.06/1.48 |
% 4.06/1.48 | THEORY_AXIOM GroebnerMultiplication:
% 4.06/1.48 | (5) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : (v3 = v2 |
% 4.06/1.48 | ~ ($product($product(-1, v0), $sum(v1, 2)) = v2) | ~ ($product(v0,
% 4.06/1.48 | $difference(-2, v1)) = v3))
% 4.06/1.48 |
% 4.06/1.48 | GROUND_INST: instantiating (5) with d, c, all_2_1, all_2_0, simplifying with
% 4.06/1.48 | (3), (4) gives:
% 4.06/1.48 | (6) all_2_0 = all_2_1
% 4.06/1.48 |
% 4.06/1.48 | REDUCE: (2), (6) imply:
% 4.06/1.48 | (7) $false
% 4.06/1.48 |
% 4.06/1.48 | CLOSE: (7) is inconsistent.
% 4.06/1.48 |
% 4.06/1.48 End of proof
% 4.06/1.49 % SZS output end Proof for theBenchmark
% 4.06/1.49
% 4.06/1.49 861ms
%------------------------------------------------------------------------------