TSTP Solution File: SYN979+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SYN979+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n010.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:06:14 EDT 2022
% Result : Theorem 2.31s 1.26s
% Output : Proof 2.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN979+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.14 % Command : ePrincess-casc -timeout=%d %s
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jul 12 01:33:32 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.48/0.63 ____ _
% 0.48/0.63 ___ / __ \_____(_)___ ________ __________
% 0.48/0.63 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.48/0.63 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.48/0.63 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.48/0.63
% 0.48/0.63 A Theorem Prover for First-Order Logic
% 0.48/0.63 (ePrincess v.1.0)
% 0.48/0.63
% 0.48/0.63 (c) Philipp Rümmer, 2009-2015
% 0.48/0.63 (c) Peter Backeman, 2014-2015
% 0.48/0.63 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.48/0.63 Free software under GNU Lesser General Public License (LGPL).
% 0.48/0.63 Bug reports to peter@backeman.se
% 0.48/0.63
% 0.48/0.63 For more information, visit http://user.uu.se/~petba168/breu/
% 0.48/0.63
% 0.48/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.76/0.68 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.37/0.95 Prover 0: Preprocessing ...
% 1.44/1.00 Prover 0: Warning: ignoring some quantifiers
% 1.44/1.02 Prover 0: Constructing countermodel ...
% 1.68/1.14 Prover 0: gave up
% 1.68/1.14 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.95/1.16 Prover 1: Preprocessing ...
% 2.11/1.23 Prover 1: Constructing countermodel ...
% 2.31/1.26 Prover 1: proved (115ms)
% 2.31/1.26
% 2.31/1.26 No countermodel exists, formula is valid
% 2.31/1.26 % SZS status Theorem for theBenchmark
% 2.31/1.26
% 2.31/1.26 Generating proof ... found it (size 5)
% 2.63/1.40
% 2.63/1.40 % SZS output start Proof for theBenchmark
% 2.63/1.40 Assumed formulas after preprocessing and simplification:
% 2.63/1.40 | (0) ? [v0] : ? [v1] : ? [v2] : ( ~ (v2 = 0) & s(v0) = 0 & r(v1) = 0 & r(v0) = 0 & q(v1) = 0 & q(v0) = 0 & p(v0, v1) = v2 & ! [v3] : ! [v4] : ! [v5] : ! [v6] : (v4 = v3 | ~ (p(v6, v5) = v4) | ~ (p(v6, v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v5 = 0 | ~ (p(v3, v4) = v5)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (s(v5) = v4) | ~ (s(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (r(v5) = v4) | ~ (r(v5) = v3)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (q(v5) = v4) | ~ (q(v5) = v3)) & ! [v3] : ( ~ (r(v3) = 0) | p(v1, v3) = 0) & ! [v3] : ( ~ (q(v3) = 0) | p(v3, v0) = 0))
% 2.63/1.44 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields:
% 2.63/1.44 | (1) ~ (all_0_0_0 = 0) & s(all_0_2_2) = 0 & r(all_0_1_1) = 0 & r(all_0_2_2) = 0 & q(all_0_1_1) = 0 & q(all_0_2_2) = 0 & p(all_0_2_2, all_0_1_1) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (p(v3, v2) = v1) | ~ (p(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (p(v0, v1) = v2)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (s(v2) = v1) | ~ (s(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (r(v2) = v1) | ~ (r(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (q(v2) = v1) | ~ (q(v2) = v0)) & ! [v0] : ( ~ (r(v0) = 0) | p(all_0_1_1, v0) = 0) & ! [v0] : ( ~ (q(v0) = 0) | p(v0, all_0_2_2) = 0)
% 2.63/1.44 |
% 2.63/1.44 | Applying alpha-rule on (1) yields:
% 2.63/1.44 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (q(v2) = v1) | ~ (q(v2) = v0))
% 2.63/1.44 | (3) p(all_0_2_2, all_0_1_1) = all_0_0_0
% 2.63/1.44 | (4) q(all_0_1_1) = 0
% 2.63/1.44 | (5) ! [v0] : ( ~ (r(v0) = 0) | p(all_0_1_1, v0) = 0)
% 2.63/1.44 | (6) ! [v0] : ( ~ (q(v0) = 0) | p(v0, all_0_2_2) = 0)
% 2.63/1.44 | (7) q(all_0_2_2) = 0
% 2.63/1.44 | (8) r(all_0_1_1) = 0
% 2.63/1.44 | (9) r(all_0_2_2) = 0
% 2.63/1.45 | (10) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (s(v2) = v1) | ~ (s(v2) = v0))
% 2.81/1.45 | (11) ~ (all_0_0_0 = 0)
% 2.81/1.45 | (12) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (p(v0, v1) = v2))
% 2.81/1.45 | (13) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (r(v2) = v1) | ~ (r(v2) = v0))
% 2.81/1.45 | (14) s(all_0_2_2) = 0
% 2.81/1.45 | (15) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (p(v3, v2) = v1) | ~ (p(v3, v2) = v0))
% 2.81/1.45 |
% 2.81/1.45 | Instantiating formula (12) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms p(all_0_2_2, all_0_1_1) = all_0_0_0, yields:
% 2.81/1.45 | (16) all_0_0_0 = 0
% 2.81/1.45 |
% 2.81/1.45 | Equations (16) can reduce 11 to:
% 2.81/1.45 | (17) $false
% 2.81/1.45 |
% 2.81/1.45 |-The branch is then unsatisfiable
% 2.81/1.45 % SZS output end Proof for theBenchmark
% 2.81/1.45
% 2.81/1.45 811ms
%------------------------------------------------------------------------------