TSTP Solution File: SEU139+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n028.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:46:53 EDT 2022
% Result : Theorem 1.55s 1.05s
% Output : Proof 2.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n028.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 : Sun Jun 19 13:47:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.50/0.57 ____ _
% 0.50/0.57 ___ / __ \_____(_)___ ________ __________
% 0.50/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.50/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.50/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.50/0.57
% 0.50/0.57 A Theorem Prover for First-Order Logic
% 0.50/0.57 (ePrincess v.1.0)
% 0.50/0.57
% 0.50/0.57 (c) Philipp Rümmer, 2009-2015
% 0.50/0.57 (c) Peter Backeman, 2014-2015
% 0.50/0.57 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.50/0.57 Free software under GNU Lesser General Public License (LGPL).
% 0.50/0.57 Bug reports to peter@backeman.se
% 0.50/0.57
% 0.50/0.57 For more information, visit http://user.uu.se/~petba168/breu/
% 0.50/0.57
% 0.50/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.50/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.22/0.87 Prover 0: Preprocessing ...
% 1.43/0.95 Prover 0: Warning: ignoring some quantifiers
% 1.43/0.97 Prover 0: Constructing countermodel ...
% 1.55/1.05 Prover 0: proved (432ms)
% 1.55/1.05
% 1.55/1.05 No countermodel exists, formula is valid
% 1.55/1.05 % SZS status Theorem for theBenchmark
% 1.55/1.05
% 1.55/1.05 Generating proof ... Warning: ignoring some quantifiers
% 2.10/1.20 found it (size 7)
% 2.10/1.20
% 2.10/1.20 % SZS output start Proof for theBenchmark
% 2.10/1.20 Assumed formulas after preprocessing and simplification:
% 2.10/1.20 | (0) ? [v0] : ? [v1] : (subset(v0, v1) & proper_subset(v1, v0) & ! [v2] : ! [v3] : (v3 = v2 | ~ subset(v3, v2) | ~ subset(v2, v3)) & ! [v2] : ! [v3] : (v3 = v2 | ~ subset(v2, v3) | proper_subset(v2, v3)) & ! [v2] : ! [v3] : ( ~ proper_subset(v3, v2) | ~ proper_subset(v2, v3)) & ! [v2] : ! [v3] : ( ~ proper_subset(v2, v3) | subset(v2, v3)) & ! [v2] : ~ proper_subset(v2, v2) & ? [v2] : subset(v2, v2))
% 2.10/1.20 | Instantiating (0) with all_0_0_0, all_0_1_1 yields:
% 2.10/1.20 | (1) subset(all_0_1_1, all_0_0_0) & proper_subset(all_0_0_0, all_0_1_1) & ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1)) & ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v0, v1) | proper_subset(v0, v1)) & ! [v0] : ! [v1] : ( ~ proper_subset(v1, v0) | ~ proper_subset(v0, v1)) & ! [v0] : ! [v1] : ( ~ proper_subset(v0, v1) | subset(v0, v1)) & ! [v0] : ~ proper_subset(v0, v0) & ? [v0] : subset(v0, v0)
% 2.10/1.21 |
% 2.10/1.21 | Applying alpha-rule on (1) yields:
% 2.10/1.21 | (2) ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v0, v1) | proper_subset(v0, v1))
% 2.10/1.21 | (3) ? [v0] : subset(v0, v0)
% 2.10/1.21 | (4) ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1))
% 2.10/1.21 | (5) ! [v0] : ! [v1] : ( ~ proper_subset(v1, v0) | ~ proper_subset(v0, v1))
% 2.10/1.21 | (6) subset(all_0_1_1, all_0_0_0)
% 2.10/1.21 | (7) ! [v0] : ! [v1] : ( ~ proper_subset(v0, v1) | subset(v0, v1))
% 2.10/1.21 | (8) ! [v0] : ~ proper_subset(v0, v0)
% 2.10/1.21 | (9) proper_subset(all_0_0_0, all_0_1_1)
% 2.10/1.21 |
% 2.10/1.21 | Instantiating formula (7) with all_0_1_1, all_0_0_0 and discharging atoms proper_subset(all_0_0_0, all_0_1_1), yields:
% 2.10/1.21 | (10) subset(all_0_0_0, all_0_1_1)
% 2.10/1.21 |
% 2.10/1.21 | Instantiating formula (4) with all_0_0_0, all_0_1_1 and discharging atoms subset(all_0_0_0, all_0_1_1), subset(all_0_1_1, all_0_0_0), yields:
% 2.10/1.21 | (11) all_0_0_0 = all_0_1_1
% 2.10/1.21 |
% 2.10/1.21 | From (11) and (9) follows:
% 2.10/1.21 | (12) proper_subset(all_0_1_1, all_0_1_1)
% 2.10/1.22 |
% 2.10/1.22 | Instantiating formula (5) with all_0_1_1, all_0_1_1 and discharging atoms proper_subset(all_0_1_1, all_0_1_1), yields:
% 2.10/1.22 | (13) $false
% 2.10/1.22 |
% 2.10/1.22 |-The branch is then unsatisfiable
% 2.10/1.22 % SZS output end Proof for theBenchmark
% 2.10/1.22
% 2.10/1.22 636ms
%------------------------------------------------------------------------------