TSTP Solution File: ARI691_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI691_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 : n011.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.41s 1.30s
% Output : Proof 4.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI691_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 : n011.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 18:40:42 EDT 2023
% 0.13/0.35 % 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.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.64 Running up to 7 provers in parallel.
% 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.21/1.08 Prover 1: Preprocessing ...
% 2.21/1.08 Prover 5: Preprocessing ...
% 2.21/1.08 Prover 6: Preprocessing ...
% 2.21/1.08 Prover 0: Preprocessing ...
% 2.21/1.08 Prover 4: Preprocessing ...
% 2.21/1.08 Prover 3: Preprocessing ...
% 2.21/1.09 Prover 2: Preprocessing ...
% 2.57/1.15 Prover 0: Constructing countermodel ...
% 2.57/1.15 Prover 4: Constructing countermodel ...
% 2.57/1.15 Prover 5: Constructing countermodel ...
% 2.57/1.15 Prover 3: Constructing countermodel ...
% 2.57/1.15 Prover 1: Constructing countermodel ...
% 2.57/1.15 Prover 6: Constructing countermodel ...
% 2.57/1.15 Prover 2: Constructing countermodel ...
% 3.41/1.30 Prover 3: proved (651ms)
% 3.41/1.30 Prover 6: proved (648ms)
% 3.41/1.30
% 3.41/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.30
% 3.41/1.30
% 3.41/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.30
% 3.41/1.30 Prover 0: proved (655ms)
% 3.41/1.30
% 3.41/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.30
% 3.41/1.30 Prover 5: proved (649ms)
% 3.41/1.30
% 3.41/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.30
% 3.41/1.30 Prover 2: proved (654ms)
% 3.41/1.30
% 3.41/1.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.30
% 3.41/1.31 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.41/1.31 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.41/1.31 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.41/1.31 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.41/1.31 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.41/1.31 Prover 7: Preprocessing ...
% 3.41/1.31 Prover 8: Preprocessing ...
% 3.41/1.32 Prover 13: Preprocessing ...
% 3.41/1.32 Prover 10: Preprocessing ...
% 3.41/1.32 Prover 11: Preprocessing ...
% 3.41/1.33 Prover 7: Constructing countermodel ...
% 3.41/1.33 Prover 13: Constructing countermodel ...
% 3.41/1.33 Prover 11: Constructing countermodel ...
% 3.41/1.34 Prover 10: Constructing countermodel ...
% 3.41/1.34 Prover 8: Constructing countermodel ...
% 4.39/1.41 Prover 11: Found proof (size 17)
% 4.39/1.41 Prover 4: Found proof (size 17)
% 4.39/1.41 Prover 1: Found proof (size 17)
% 4.40/1.41 Prover 4: proved (762ms)
% 4.40/1.41 Prover 11: proved (102ms)
% 4.40/1.41 Prover 1: proved (766ms)
% 4.40/1.41 Prover 10: Found proof (size 17)
% 4.40/1.41 Prover 10: proved (107ms)
% 4.40/1.41 Prover 13: Found proof (size 17)
% 4.40/1.41 Prover 13: proved (106ms)
% 4.40/1.41 Prover 7: stopped
% 4.40/1.42 Prover 8: Found proof (size 17)
% 4.40/1.42 Prover 8: proved (112ms)
% 4.40/1.42
% 4.40/1.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.40/1.42
% 4.40/1.42 % SZS output start Proof for theBenchmark
% 4.40/1.42 Assumptions after simplification:
% 4.40/1.42 ---------------------------------
% 4.40/1.43
% 4.40/1.43 (conj)
% 4.40/1.47 ? [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : ( ~ (v3 = v2) &
% 4.40/1.47 f(v1) = v2 & f(v0) = v1 & $product(b, a) = v3 & $product(a, b) = v0)
% 4.40/1.47
% 4.40/1.47 (eq)
% 4.40/1.47 ? [v0: int] : (f(v0) = v0 & $product(a, b) = v0)
% 4.40/1.47
% 4.40/1.47 (function-axioms)
% 4.40/1.47 ! [v0: int] : ! [v1: int] : ! [v2: int] : (v1 = v0 | ~ (f(v2) = v1) | ~
% 4.40/1.47 (f(v2) = v0))
% 4.40/1.47
% 4.40/1.47 Those formulas are unsatisfiable:
% 4.40/1.47 ---------------------------------
% 4.40/1.47
% 4.40/1.47 Begin of proof
% 4.40/1.47 |
% 4.40/1.47 | DELTA: instantiating (eq) with fresh symbol all_3_0 gives:
% 4.40/1.47 | (1) f(all_3_0) = all_3_0 & $product(a, b) = all_3_0
% 4.40/1.47 |
% 4.40/1.48 | ALPHA: (1) implies:
% 4.40/1.48 | (2) $product(a, b) = all_3_0
% 4.40/1.48 | (3) f(all_3_0) = all_3_0
% 4.40/1.48 |
% 4.40/1.48 | DELTA: instantiating (conj) with fresh symbols all_5_0, all_5_1, all_5_2,
% 4.40/1.48 | all_5_3 gives:
% 4.40/1.48 | (4) ~ (all_5_0 = all_5_1) & f(all_5_2) = all_5_1 & f(all_5_3) = all_5_2 &
% 4.40/1.48 | $product(b, a) = all_5_0 & $product(a, b) = all_5_3
% 4.40/1.48 |
% 4.40/1.48 | ALPHA: (4) implies:
% 4.40/1.48 | (5) ~ (all_5_0 = all_5_1)
% 4.40/1.48 | (6) $product(a, b) = all_5_3
% 4.40/1.48 | (7) $product(b, a) = all_5_0
% 4.40/1.48 | (8) f(all_5_3) = all_5_2
% 4.40/1.48 | (9) f(all_5_2) = all_5_1
% 4.40/1.48 |
% 4.40/1.48 | THEORY_AXIOM GroebnerMultiplication:
% 4.40/1.48 | (10) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : (v3 = v2 |
% 4.40/1.48 | ~ ($product(v1, v0) = v3) | ~ ($product(v0, v1) = v2))
% 4.40/1.48 |
% 4.40/1.48 | GROUND_INST: instantiating (10) with a, b, all_3_0, all_5_0, simplifying with
% 4.40/1.48 | (2), (7) gives:
% 4.40/1.48 | (11) all_5_0 = all_3_0
% 4.40/1.48 |
% 4.40/1.48 | THEORY_AXIOM GroebnerMultiplication:
% 4.40/1.48 | (12) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: int] : (v3 = v2 |
% 4.40/1.48 | ~ ($product(v0, v1) = v3) | ~ ($product(v0, v1) = v2))
% 4.40/1.48 |
% 4.40/1.48 | GROUND_INST: instantiating (12) with a, b, all_3_0, all_5_3, simplifying with
% 4.40/1.48 | (2), (6) gives:
% 4.40/1.48 | (13) all_5_3 = all_3_0
% 4.40/1.48 |
% 4.40/1.48 | REDUCE: (5), (11) imply:
% 4.40/1.48 | (14) ~ (all_5_1 = all_3_0)
% 4.40/1.48 |
% 4.40/1.48 | SIMP: (14) implies:
% 4.40/1.49 | (15) ~ (all_5_1 = all_3_0)
% 4.40/1.49 |
% 4.40/1.49 | REDUCE: (8), (13) imply:
% 4.40/1.49 | (16) f(all_3_0) = all_5_2
% 4.40/1.49 |
% 4.40/1.49 | GROUND_INST: instantiating (function-axioms) with all_3_0, all_5_2, all_3_0,
% 4.40/1.49 | simplifying with (3), (16) gives:
% 4.40/1.49 | (17) all_5_2 = all_3_0
% 4.40/1.49 |
% 4.40/1.49 | REDUCE: (9), (17) imply:
% 4.40/1.49 | (18) f(all_3_0) = all_5_1
% 4.40/1.49 |
% 4.40/1.49 | GROUND_INST: instantiating (function-axioms) with all_3_0, all_5_1, all_3_0,
% 4.40/1.49 | simplifying with (3), (18) gives:
% 4.40/1.49 | (19) all_5_1 = all_3_0
% 4.40/1.49 |
% 4.40/1.49 | REDUCE: (15), (19) imply:
% 4.40/1.49 | (20) $false
% 4.40/1.49 |
% 4.40/1.49 | CLOSE: (20) is inconsistent.
% 4.40/1.49 |
% 4.40/1.49 End of proof
% 4.40/1.49 % SZS output end Proof for theBenchmark
% 4.40/1.49
% 4.40/1.49 862ms
%------------------------------------------------------------------------------