TSTP Solution File: SYN923+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN923+1 : TPTP v8.1.2. Released v3.1.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 : Fri Sep 1 03:29:14 EDT 2023
% Result : Theorem 2.88s 1.12s
% Output : Proof 3.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN923+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.32 % Computer : n011.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Sat Aug 26 21:16:39 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.18/0.63 ________ _____
% 0.18/0.63 ___ __ \_________(_)________________________________
% 0.18/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.18/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.18/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.18/0.63
% 0.18/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.63 (2023-06-19)
% 0.18/0.63
% 0.18/0.63 (c) Philipp Rümmer, 2009-2023
% 0.18/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.63 Amanda Stjerna.
% 0.18/0.63 Free software under BSD-3-Clause.
% 0.18/0.63
% 0.18/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.63
% 0.18/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.18/0.64 Running up to 7 provers in parallel.
% 0.18/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.69/0.95 Prover 4: Preprocessing ...
% 1.69/0.95 Prover 1: Preprocessing ...
% 2.08/0.99 Prover 2: Preprocessing ...
% 2.08/0.99 Prover 0: Preprocessing ...
% 2.08/0.99 Prover 5: Preprocessing ...
% 2.08/0.99 Prover 3: Preprocessing ...
% 2.08/0.99 Prover 6: Preprocessing ...
% 2.08/1.03 Prover 3: Constructing countermodel ...
% 2.08/1.03 Prover 4: Constructing countermodel ...
% 2.08/1.03 Prover 1: Constructing countermodel ...
% 2.08/1.04 Prover 2: Proving ...
% 2.08/1.04 Prover 5: Proving ...
% 2.08/1.04 Prover 6: Proving ...
% 2.08/1.05 Prover 0: Proving ...
% 2.88/1.11 Prover 3: proved (467ms)
% 2.88/1.12
% 2.88/1.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.88/1.12
% 2.88/1.12 Prover 2: proved (474ms)
% 2.88/1.12 Prover 0: proved (474ms)
% 2.88/1.12
% 2.88/1.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.88/1.12
% 2.88/1.13
% 2.88/1.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.88/1.13
% 2.88/1.13 Prover 5: stopped
% 2.88/1.13 Prover 6: stopped
% 3.20/1.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.20/1.14 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.20/1.14 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.20/1.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.20/1.14 Prover 7: Preprocessing ...
% 3.20/1.14 Prover 1: Found proof (size 10)
% 3.20/1.14 Prover 1: proved (492ms)
% 3.20/1.14 Prover 4: Found proof (size 9)
% 3.20/1.14 Prover 4: proved (491ms)
% 3.20/1.14 Prover 10: Preprocessing ...
% 3.20/1.14 Prover 8: Preprocessing ...
% 3.20/1.14 Prover 11: Preprocessing ...
% 3.20/1.14 Prover 7: Warning: ignoring some quantifiers
% 3.20/1.15 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.20/1.15 Prover 7: Constructing countermodel ...
% 3.20/1.15 Prover 7: stopped
% 3.20/1.15 Prover 10: Warning: ignoring some quantifiers
% 3.20/1.15 Prover 10: Constructing countermodel ...
% 3.20/1.15 Prover 10: stopped
% 3.20/1.15 Prover 13: Preprocessing ...
% 3.20/1.16 Prover 11: Constructing countermodel ...
% 3.20/1.16 Prover 13: Warning: ignoring some quantifiers
% 3.20/1.16 Prover 13: Constructing countermodel ...
% 3.20/1.16 Prover 13: stopped
% 3.20/1.16 Prover 11: stopped
% 3.20/1.16 Prover 8: Warning: ignoring some quantifiers
% 3.20/1.16 Prover 8: Constructing countermodel ...
% 3.20/1.17 Prover 8: stopped
% 3.20/1.17
% 3.20/1.17 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.20/1.17
% 3.20/1.17 % SZS output start Proof for theBenchmark
% 3.20/1.17 Assumptions after simplification:
% 3.20/1.17 ---------------------------------
% 3.20/1.17
% 3.20/1.17 (prove_this)
% 3.49/1.21 ? [v0: $i] : ? [v1: int] : ? [v2: int] : ( ~ (v2 = 0) & ~ (v1 = 0) & q(v0)
% 3.49/1.21 = v2 & p(v0) = v1 & $i(v0)) & ( ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~
% 3.49/1.21 (q(v0) = v1) | ~ $i(v0)) | ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~
% 3.49/1.21 (p(v0) = v1) | ~ $i(v0)))
% 3.49/1.21
% 3.49/1.21 Those formulas are unsatisfiable:
% 3.49/1.21 ---------------------------------
% 3.49/1.21
% 3.49/1.21 Begin of proof
% 3.49/1.21 |
% 3.49/1.21 | ALPHA: (prove_this) implies:
% 3.49/1.22 | (1) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (q(v0) = v1) | ~ $i(v0)) |
% 3.49/1.22 | ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0))
% 3.49/1.22 | (2) ? [v0: $i] : ? [v1: int] : ? [v2: int] : ( ~ (v2 = 0) & ~ (v1 = 0)
% 3.49/1.22 | & q(v0) = v2 & p(v0) = v1 & $i(v0))
% 3.49/1.22 |
% 3.49/1.22 | DELTA: instantiating (2) with fresh symbols all_3_0, all_3_1, all_3_2 gives:
% 3.49/1.22 | (3) ~ (all_3_0 = 0) & ~ (all_3_1 = 0) & q(all_3_2) = all_3_0 & p(all_3_2)
% 3.49/1.22 | = all_3_1 & $i(all_3_2)
% 3.49/1.22 |
% 3.49/1.22 | ALPHA: (3) implies:
% 3.49/1.22 | (4) ~ (all_3_1 = 0)
% 3.49/1.22 | (5) ~ (all_3_0 = 0)
% 3.49/1.22 | (6) $i(all_3_2)
% 3.49/1.22 | (7) p(all_3_2) = all_3_1
% 3.49/1.22 | (8) q(all_3_2) = all_3_0
% 3.49/1.22 |
% 3.49/1.22 | BETA: splitting (1) gives:
% 3.49/1.22 |
% 3.49/1.22 | Case 1:
% 3.49/1.22 | |
% 3.49/1.22 | | (9) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (q(v0) = v1) | ~ $i(v0))
% 3.49/1.22 | |
% 3.49/1.22 | | GROUND_INST: instantiating (9) with all_3_2, all_3_0, simplifying with (6),
% 3.49/1.22 | | (8) gives:
% 3.49/1.22 | | (10) all_3_0 = 0
% 3.49/1.22 | |
% 3.49/1.22 | | REDUCE: (5), (10) imply:
% 3.49/1.22 | | (11) $false
% 3.49/1.23 | |
% 3.49/1.23 | | CLOSE: (11) is inconsistent.
% 3.49/1.23 | |
% 3.49/1.23 | Case 2:
% 3.49/1.23 | |
% 3.49/1.23 | | (12) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0))
% 3.49/1.23 | |
% 3.49/1.23 | | GROUND_INST: instantiating (12) with all_3_2, all_3_1, simplifying with (6),
% 3.49/1.23 | | (7) gives:
% 3.49/1.23 | | (13) all_3_1 = 0
% 3.49/1.23 | |
% 3.49/1.23 | | REDUCE: (4), (13) imply:
% 3.49/1.23 | | (14) $false
% 3.49/1.23 | |
% 3.49/1.23 | | CLOSE: (14) is inconsistent.
% 3.49/1.23 | |
% 3.49/1.23 | End of split
% 3.49/1.23 |
% 3.49/1.23 End of proof
% 3.49/1.23 % SZS output end Proof for theBenchmark
% 3.49/1.23
% 3.49/1.23 599ms
%------------------------------------------------------------------------------