TSTP Solution File: SET583+3 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n017.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 00:20:26 EDT 2022
% Result : Theorem 1.57s 1.01s
% Output : Proof 2.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n017.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 : Sat Jul 9 15:55:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.49/0.58 ____ _
% 0.49/0.58 ___ / __ \_____(_)___ ________ __________
% 0.49/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.49/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.49/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.49/0.58
% 0.49/0.58 A Theorem Prover for First-Order Logic
% 0.49/0.58 (ePrincess v.1.0)
% 0.49/0.58
% 0.49/0.58 (c) Philipp Rümmer, 2009-2015
% 0.49/0.58 (c) Peter Backeman, 2014-2015
% 0.49/0.58 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.49/0.58 Free software under GNU Lesser General Public License (LGPL).
% 0.49/0.58 Bug reports to peter@backeman.se
% 0.49/0.58
% 0.49/0.58 For more information, visit http://user.uu.se/~petba168/breu/
% 0.49/0.58
% 0.49/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.72/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.26/0.86 Prover 0: Preprocessing ...
% 1.48/0.93 Prover 0: Warning: ignoring some quantifiers
% 1.48/0.94 Prover 0: Constructing countermodel ...
% 1.57/1.01 Prover 0: proved (379ms)
% 1.57/1.01
% 1.57/1.01 No countermodel exists, formula is valid
% 1.57/1.01 % SZS status Theorem for theBenchmark
% 1.57/1.01
% 1.57/1.01 Generating proof ... Warning: ignoring some quantifiers
% 1.94/1.12 found it (size 5)
% 1.94/1.12
% 1.94/1.12 % SZS output start Proof for theBenchmark
% 1.94/1.13 Assumed formulas after preprocessing and simplification:
% 1.94/1.13 | (0) ? [v0] : ? [v1] : ( ~ (v1 = v0) & subset(v1, v0) & subset(v0, v1) & ! [v2] : ! [v3] : ! [v4] : ( ~ member(v4, v2) | ~ subset(v2, v3) | member(v4, v3)) & ! [v2] : ! [v3] : (v3 = v2 | ~ subset(v3, v2) | ~ subset(v2, v3)) & ? [v2] : ? [v3] : (subset(v2, v3) | ? [v4] : (member(v4, v2) & ~ member(v4, v3))) & ? [v2] : subset(v2, v2))
% 2.07/1.13 | Instantiating (0) with all_0_0_0, all_0_1_1 yields:
% 2.07/1.13 | (1) ~ (all_0_0_0 = all_0_1_1) & subset(all_0_0_0, all_0_1_1) & subset(all_0_1_1, all_0_0_0) & ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v0) | ~ subset(v0, v1) | member(v2, v1)) & ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1)) & ? [v0] : ? [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1))) & ? [v0] : subset(v0, v0)
% 2.07/1.14 |
% 2.07/1.14 | Applying alpha-rule on (1) yields:
% 2.07/1.14 | (2) subset(all_0_1_1, all_0_0_0)
% 2.07/1.14 | (3) subset(all_0_0_0, all_0_1_1)
% 2.07/1.14 | (4) ? [v0] : subset(v0, v0)
% 2.07/1.14 | (5) ~ (all_0_0_0 = all_0_1_1)
% 2.07/1.14 | (6) ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1))
% 2.07/1.14 | (7) ? [v0] : ? [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1)))
% 2.07/1.14 | (8) ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v0) | ~ subset(v0, v1) | member(v2, v1))
% 2.07/1.14 |
% 2.07/1.14 | Instantiating formula (6) with all_0_1_1, all_0_0_0 and discharging atoms subset(all_0_0_0, all_0_1_1), subset(all_0_1_1, all_0_0_0), yields:
% 2.07/1.14 | (9) all_0_0_0 = all_0_1_1
% 2.07/1.14 |
% 2.07/1.14 | Equations (9) can reduce 5 to:
% 2.07/1.14 | (10) $false
% 2.07/1.14 |
% 2.07/1.14 |-The branch is then unsatisfiable
% 2.07/1.14 % SZS output end Proof for theBenchmark
% 2.07/1.14
% 2.07/1.14 552ms
%------------------------------------------------------------------------------