TSTP Solution File: SEU163+3 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SEU163+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n029.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 : Tue Jul 19 08:47:11 EDT 2022
% Result : Theorem 1.78s 1.09s
% Output : Proof 2.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU163+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 22:08:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.63/0.64 ____ _
% 0.63/0.64 ___ / __ \_____(_)___ ________ __________
% 0.63/0.64 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.63/0.64 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.63/0.64 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.63/0.64
% 0.63/0.64 A Theorem Prover for First-Order Logic
% 0.63/0.64 (ePrincess v.1.0)
% 0.63/0.64
% 0.63/0.64 (c) Philipp Rümmer, 2009-2015
% 0.63/0.64 (c) Peter Backeman, 2014-2015
% 0.63/0.64 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.63/0.64 Free software under GNU Lesser General Public License (LGPL).
% 0.63/0.64 Bug reports to peter@backeman.se
% 0.63/0.64
% 0.63/0.64 For more information, visit http://user.uu.se/~petba168/breu/
% 0.63/0.64
% 0.63/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.84/0.69 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.20/0.91 Prover 0: Preprocessing ...
% 1.52/0.99 Prover 0: Warning: ignoring some quantifiers
% 1.52/1.01 Prover 0: Constructing countermodel ...
% 1.78/1.08 Prover 0: proved (392ms)
% 1.78/1.08
% 1.78/1.08 No countermodel exists, formula is valid
% 1.78/1.09 % SZS status Theorem for theBenchmark
% 1.78/1.09
% 1.78/1.09 Generating proof ... Warning: ignoring some quantifiers
% 2.01/1.19 found it (size 4)
% 2.01/1.19
% 2.01/1.19 % SZS output start Proof for theBenchmark
% 2.01/1.19 Assumed formulas after preprocessing and simplification:
% 2.01/1.19 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : (union(v1) = v2 & empty(v4) & in(v0, v1) & ~ empty(v3) & ~ subset(v0, v2) & ! [v5] : ! [v6] : ! [v7] : (v6 = v5 | ~ (union(v7) = v6) | ~ (union(v7) = v5)) & ! [v5] : ! [v6] : ! [v7] : ( ~ (union(v6) = v7) | ~ in(v5, v6) | subset(v5, v7)) & ! [v5] : ! [v6] : ( ~ in(v6, v5) | ~ in(v5, v6)) & ? [v5] : subset(v5, v5))
% 2.23/1.23 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4 yields:
% 2.23/1.23 | (1) union(all_0_3_3) = all_0_2_2 & empty(all_0_0_0) & in(all_0_4_4, all_0_3_3) & ~ empty(all_0_1_1) & ~ subset(all_0_4_4, all_0_2_2) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (union(v2) = v1) | ~ (union(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (union(v1) = v2) | ~ in(v0, v1) | subset(v0, v2)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) & ? [v0] : subset(v0, v0)
% 2.23/1.24 |
% 2.23/1.24 | Applying alpha-rule on (1) yields:
% 2.23/1.24 | (2) empty(all_0_0_0)
% 2.23/1.24 | (3) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (union(v2) = v1) | ~ (union(v2) = v0))
% 2.23/1.24 | (4) ! [v0] : ! [v1] : ! [v2] : ( ~ (union(v1) = v2) | ~ in(v0, v1) | subset(v0, v2))
% 2.23/1.24 | (5) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1))
% 2.23/1.24 | (6) union(all_0_3_3) = all_0_2_2
% 2.23/1.24 | (7) ~ empty(all_0_1_1)
% 2.23/1.24 | (8) ? [v0] : subset(v0, v0)
% 2.23/1.24 | (9) ~ subset(all_0_4_4, all_0_2_2)
% 2.23/1.24 | (10) in(all_0_4_4, all_0_3_3)
% 2.23/1.24 |
% 2.23/1.24 | Instantiating formula (4) with all_0_2_2, all_0_3_3, all_0_4_4 and discharging atoms union(all_0_3_3) = all_0_2_2, in(all_0_4_4, all_0_3_3), ~ subset(all_0_4_4, all_0_2_2), yields:
% 2.23/1.24 | (11) $false
% 2.23/1.24 |
% 2.23/1.24 |-The branch is then unsatisfiable
% 2.23/1.24 % SZS output end Proof for theBenchmark
% 2.23/1.24
% 2.23/1.24 592ms
%------------------------------------------------------------------------------