TSTP Solution File: SYN405+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SYN405+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n007.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:02:10 EDT 2022
% Result : Theorem 1.86s 1.09s
% Output : Proof 2.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN405+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 08:37:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.56/0.58 ____ _
% 0.56/0.58 ___ / __ \_____(_)___ ________ __________
% 0.56/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.56/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.56/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.56/0.58
% 0.56/0.58 A Theorem Prover for First-Order Logic
% 0.56/0.58 (ePrincess v.1.0)
% 0.56/0.58
% 0.56/0.58 (c) Philipp Rümmer, 2009-2015
% 0.56/0.58 (c) Peter Backeman, 2014-2015
% 0.56/0.58 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.56/0.58 Free software under GNU Lesser General Public License (LGPL).
% 0.56/0.58 Bug reports to peter@backeman.se
% 0.56/0.58
% 0.56/0.58 For more information, visit http://user.uu.se/~petba168/breu/
% 0.56/0.58
% 0.56/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.56/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.18/0.86 Prover 0: Preprocessing ...
% 1.25/0.90 Prover 0: Warning: ignoring some quantifiers
% 1.25/0.92 Prover 0: Constructing countermodel ...
% 1.44/1.00 Prover 0: gave up
% 1.44/1.00 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.44/1.02 Prover 1: Preprocessing ...
% 1.70/1.06 Prover 1: Constructing countermodel ...
% 1.86/1.09 Prover 1: proved (85ms)
% 1.86/1.09
% 1.86/1.09 No countermodel exists, formula is valid
% 1.86/1.09 % SZS status Theorem for theBenchmark
% 1.86/1.09
% 1.86/1.09 Generating proof ... found it (size 8)
% 2.15/1.19
% 2.15/1.19 % SZS output start Proof for theBenchmark
% 2.15/1.19 Assumed formulas after preprocessing and simplification:
% 2.15/1.19 | (0) ? [v0] : (g(v0) = 0 & ! [v1] : ! [v2] : ! [v3] : (v2 = v1 | ~ (g(v3) = v2) | ~ (g(v3) = v1)) & ! [v1] : ! [v2] : ! [v3] : (v2 = v1 | ~ (f(v3) = v2) | ~ (f(v3) = v1)) & ! [v1] : ! [v2] : (v2 = 0 | ~ (f(v1) = v2)) & ! [v1] : ( ~ (g(v1) = 0) | ? [v2] : ( ~ (v2 = 0) & f(v1) = v2)))
% 2.15/1.23 | Instantiating (0) with all_0_0_0 yields:
% 2.15/1.23 | (1) g(all_0_0_0) = 0 & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (g(v2) = v1) | ~ (g(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f(v2) = v1) | ~ (f(v2) = v0)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (f(v0) = v1)) & ! [v0] : ( ~ (g(v0) = 0) | ? [v1] : ( ~ (v1 = 0) & f(v0) = v1))
% 2.15/1.23 |
% 2.15/1.23 | Applying alpha-rule on (1) yields:
% 2.15/1.23 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (g(v2) = v1) | ~ (g(v2) = v0))
% 2.15/1.23 | (3) g(all_0_0_0) = 0
% 2.15/1.23 | (4) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (f(v2) = v1) | ~ (f(v2) = v0))
% 2.15/1.23 | (5) ! [v0] : ! [v1] : (v1 = 0 | ~ (f(v0) = v1))
% 2.15/1.23 | (6) ! [v0] : ( ~ (g(v0) = 0) | ? [v1] : ( ~ (v1 = 0) & f(v0) = v1))
% 2.29/1.23 |
% 2.29/1.23 | Instantiating formula (6) with all_0_0_0 and discharging atoms g(all_0_0_0) = 0, yields:
% 2.29/1.23 | (7) ? [v0] : ( ~ (v0 = 0) & f(all_0_0_0) = v0)
% 2.29/1.23 |
% 2.29/1.23 | Instantiating (7) with all_8_0_1 yields:
% 2.29/1.23 | (8) ~ (all_8_0_1 = 0) & f(all_0_0_0) = all_8_0_1
% 2.29/1.24 |
% 2.29/1.24 | Applying alpha-rule on (8) yields:
% 2.29/1.24 | (9) ~ (all_8_0_1 = 0)
% 2.29/1.24 | (10) f(all_0_0_0) = all_8_0_1
% 2.29/1.24 |
% 2.29/1.24 | Instantiating formula (5) with all_8_0_1, all_0_0_0 and discharging atoms f(all_0_0_0) = all_8_0_1, yields:
% 2.29/1.24 | (11) all_8_0_1 = 0
% 2.29/1.24 |
% 2.29/1.24 | Equations (11) can reduce 9 to:
% 2.29/1.24 | (12) $false
% 2.29/1.24 |
% 2.29/1.24 |-The branch is then unsatisfiable
% 2.29/1.24 % SZS output end Proof for theBenchmark
% 2.29/1.24
% 2.29/1.24 650ms
%------------------------------------------------------------------------------