TSTP Solution File: SYN923+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SYN923+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n003.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 : 600s
% DateTime : Thu Jul 21 05:05:53 EDT 2022
% Result : Theorem 1.87s 1.09s
% Output : Proof 2.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN923+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.34 % Computer : n003.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 : 600
% 0.12/0.34 % DateTime : Tue Jul 12 06:16:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.54/0.60 ____ _
% 0.54/0.60 ___ / __ \_____(_)___ ________ __________
% 0.54/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.54/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.54/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.54/0.60
% 0.54/0.60 A Theorem Prover for First-Order Logic
% 0.54/0.60 (ePrincess v.1.0)
% 0.54/0.60
% 0.54/0.60 (c) Philipp Rümmer, 2009-2015
% 0.54/0.60 (c) Peter Backeman, 2014-2015
% 0.54/0.60 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.54/0.60 Free software under GNU Lesser General Public License (LGPL).
% 0.54/0.60 Bug reports to peter@backeman.se
% 0.54/0.60
% 0.54/0.60 For more information, visit http://user.uu.se/~petba168/breu/
% 0.54/0.60
% 0.54/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.70/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.23/0.88 Prover 0: Preprocessing ...
% 1.23/0.91 Prover 0: Warning: ignoring some quantifiers
% 1.23/0.93 Prover 0: Constructing countermodel ...
% 1.40/1.01 Prover 0: gave up
% 1.40/1.01 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.40/1.02 Prover 1: Preprocessing ...
% 1.63/1.06 Prover 1: Constructing countermodel ...
% 1.87/1.09 Prover 1: proved (87ms)
% 1.87/1.09
% 1.87/1.09 No countermodel exists, formula is valid
% 1.87/1.09 % SZS status Theorem for theBenchmark
% 1.87/1.09
% 1.87/1.09 Generating proof ... found it (size 9)
% 2.19/1.21
% 2.19/1.21 % SZS output start Proof for theBenchmark
% 2.19/1.21 Assumed formulas after preprocessing and simplification:
% 2.19/1.21 | (0) ? [v0] : ? [v1] : ? [v2] : ( ~ (v2 = 0) & ~ (v1 = 0) & q(v0) = v2 & p(v0) = v1 & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (q(v5) = v4) | ~ (q(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (p(v5) = v4) | ~ (p(v5) = v3)) & ( ! [v3] : ! [v4] : (v4 = 0 | ~ (q(v3) = v4)) | ! [v3] : ! [v4] : (v4 = 0 | ~ (p(v3) = v4))))
% 2.29/1.25 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields:
% 2.29/1.25 | (1) ~ (all_0_0_0 = 0) & ~ (all_0_1_1 = 0) & q(all_0_2_2) = all_0_0_0 & p(all_0_2_2) = all_0_1_1 & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (q(v2) = v1) | ~ (q(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) & ( ! [v0] : ! [v1] : (v1 = 0 | ~ (q(v0) = v1)) | ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1)))
% 2.29/1.25 |
% 2.29/1.25 | Applying alpha-rule on (1) yields:
% 2.29/1.25 | (2) q(all_0_2_2) = all_0_0_0
% 2.29/1.25 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (q(v2) = v1) | ~ (q(v2) = v0))
% 2.29/1.26 | (4) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0))
% 2.29/1.26 | (5) ~ (all_0_1_1 = 0)
% 2.29/1.26 | (6) ~ (all_0_0_0 = 0)
% 2.29/1.26 | (7) p(all_0_2_2) = all_0_1_1
% 2.29/1.26 | (8) ! [v0] : ! [v1] : (v1 = 0 | ~ (q(v0) = v1)) | ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1))
% 2.29/1.26 |
% 2.29/1.26 +-Applying beta-rule and splitting (8), into two cases.
% 2.29/1.26 |-Branch one:
% 2.29/1.26 | (9) ! [v0] : ! [v1] : (v1 = 0 | ~ (q(v0) = v1))
% 2.29/1.26 |
% 2.29/1.26 | Instantiating formula (9) with all_0_0_0, all_0_2_2 and discharging atoms q(all_0_2_2) = all_0_0_0, yields:
% 2.29/1.26 | (10) all_0_0_0 = 0
% 2.29/1.26 |
% 2.29/1.26 | Equations (10) can reduce 6 to:
% 2.29/1.26 | (11) $false
% 2.29/1.26 |
% 2.29/1.26 |-The branch is then unsatisfiable
% 2.29/1.26 |-Branch two:
% 2.29/1.26 | (12) ! [v0] : ! [v1] : (v1 = 0 | ~ (p(v0) = v1))
% 2.29/1.26 |
% 2.29/1.26 | Instantiating formula (12) with all_0_1_1, all_0_2_2 and discharging atoms p(all_0_2_2) = all_0_1_1, yields:
% 2.29/1.26 | (13) all_0_1_1 = 0
% 2.29/1.26 |
% 2.29/1.26 | Equations (13) can reduce 5 to:
% 2.29/1.26 | (11) $false
% 2.29/1.26 |
% 2.29/1.26 |-The branch is then unsatisfiable
% 2.29/1.26 % SZS output end Proof for theBenchmark
% 2.29/1.26
% 2.29/1.26 652ms
%------------------------------------------------------------------------------