TSTP Solution File: SYN411+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SYN411+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%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 : 600s
% DateTime : Thu Jul 21 05:02:13 EDT 2022
% Result : Theorem 1.74s 1.02s
% Output : Proof 2.03s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN411+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.32 % Computer : n011.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jul 11 22:18:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.57 ____ _
% 0.19/0.57 ___ / __ \_____(_)___ ________ __________
% 0.19/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.19/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.19/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.19/0.57
% 0.19/0.57 A Theorem Prover for First-Order Logic
% 0.19/0.57 (ePrincess v.1.0)
% 0.19/0.57
% 0.19/0.57 (c) Philipp Rümmer, 2009-2015
% 0.19/0.57 (c) Peter Backeman, 2014-2015
% 0.19/0.57 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.19/0.57 Free software under GNU Lesser General Public License (LGPL).
% 0.19/0.57 Bug reports to peter@backeman.se
% 0.19/0.57
% 0.19/0.57 For more information, visit http://user.uu.se/~petba168/breu/
% 0.19/0.58
% 0.19/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.67/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.13/0.82 Prover 0: Preprocessing ...
% 1.13/0.86 Prover 0: Warning: ignoring some quantifiers
% 1.32/0.87 Prover 0: Constructing countermodel ...
% 1.45/0.96 Prover 0: gave up
% 1.45/0.96 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 1.45/0.97 Prover 1: Preprocessing ...
% 1.74/1.00 Prover 1: Constructing countermodel ...
% 1.74/1.02 Prover 1: proved (67ms)
% 1.74/1.02
% 1.74/1.02 No countermodel exists, formula is valid
% 1.74/1.02 % SZS status Theorem for theBenchmark
% 1.74/1.02
% 1.74/1.02 Generating proof ... found it (size 5)
% 2.03/1.08
% 2.03/1.08 % SZS output start Proof for theBenchmark
% 2.03/1.08 Assumed formulas after preprocessing and simplification:
% 2.03/1.08 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = 0) & f(v0, v1, v2) = v3 & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ! [v8] : (v5 = v4 | ~ (f(v8, v7, v6) = v5) | ~ (f(v8, v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v7 = 0 | ~ (f(v4, v5, v6) = v7)))
% 2.03/1.11 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields:
% 2.03/1.11 | (1) ~ (all_0_0_0 = 0) & f(all_0_3_3, all_0_2_2, all_0_1_1) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v1 = v0 | ~ (f(v4, v3, v2) = v1) | ~ (f(v4, v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = 0 | ~ (f(v0, v1, v2) = v3))
% 2.03/1.12 |
% 2.03/1.12 | Applying alpha-rule on (1) yields:
% 2.03/1.12 | (2) ~ (all_0_0_0 = 0)
% 2.03/1.12 | (3) f(all_0_3_3, all_0_2_2, all_0_1_1) = all_0_0_0
% 2.03/1.12 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v1 = v0 | ~ (f(v4, v3, v2) = v1) | ~ (f(v4, v3, v2) = v0))
% 2.03/1.12 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = 0 | ~ (f(v0, v1, v2) = v3))
% 2.03/1.12 |
% 2.03/1.12 | Instantiating formula (5) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 and discharging atoms f(all_0_3_3, all_0_2_2, all_0_1_1) = all_0_0_0, yields:
% 2.03/1.12 | (6) all_0_0_0 = 0
% 2.03/1.12 |
% 2.03/1.12 | Equations (6) can reduce 2 to:
% 2.03/1.12 | (7) $false
% 2.03/1.12 |
% 2.03/1.12 |-The branch is then unsatisfiable
% 2.03/1.12 % SZS output end Proof for theBenchmark
% 2.03/1.12
% 2.03/1.12 537ms
%------------------------------------------------------------------------------