TSTP Solution File: SET625+3 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n027.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:57 EDT 2022
% Result : Theorem 1.84s 1.08s
% Output : Proof 2.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n027.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 Jul 10 11:28:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.54/0.58 ____ _
% 0.54/0.58 ___ / __ \_____(_)___ ________ __________
% 0.54/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.54/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.54/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.54/0.58
% 0.54/0.58 A Theorem Prover for First-Order Logic
% 0.54/0.58 (ePrincess v.1.0)
% 0.54/0.58
% 0.54/0.58 (c) Philipp Rümmer, 2009-2015
% 0.54/0.58 (c) Peter Backeman, 2014-2015
% 0.54/0.58 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.54/0.58 Free software under GNU Lesser General Public License (LGPL).
% 0.54/0.58 Bug reports to peter@backeman.se
% 0.54/0.58
% 0.54/0.58 For more information, visit http://user.uu.se/~petba168/breu/
% 0.54/0.58
% 0.54/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.54/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.27/0.89 Prover 0: Preprocessing ...
% 1.44/0.95 Prover 0: Warning: ignoring some quantifiers
% 1.50/0.97 Prover 0: Constructing countermodel ...
% 1.84/1.08 Prover 0: proved (447ms)
% 1.84/1.08
% 1.84/1.08 No countermodel exists, formula is valid
% 1.84/1.08 % SZS status Theorem for theBenchmark
% 1.84/1.08
% 1.84/1.08 Generating proof ... Warning: ignoring some quantifiers
% 2.23/1.23 found it (size 8)
% 2.23/1.23
% 2.23/1.23 % SZS output start Proof for theBenchmark
% 2.23/1.23 Assumed formulas after preprocessing and simplification:
% 2.23/1.23 | (0) ? [v0] : ? [v1] : ? [v2] : (subset(v1, v2) & intersect(v0, v1) & ~ intersect(v0, v2) & ! [v3] : ! [v4] : ! [v5] : ( ~ subset(v3, v4) | ~ member(v5, v3) | member(v5, v4)) & ! [v3] : ! [v4] : ! [v5] : ( ~ member(v5, v4) | ~ member(v5, v3) | intersect(v3, v4)) & ! [v3] : ! [v4] : ( ~ intersect(v3, v4) | intersect(v4, v3)) & ! [v3] : ! [v4] : ( ~ intersect(v3, v4) | ? [v5] : (member(v5, v4) & member(v5, v3))) & ? [v3] : ? [v4] : (subset(v3, v4) | ? [v5] : (member(v5, v3) & ~ member(v5, v4))) & ? [v3] : subset(v3, v3))
% 2.35/1.24 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields:
% 2.35/1.24 | (1) subset(all_0_1_1, all_0_0_0) & intersect(all_0_2_2, all_0_1_1) & ~ intersect(all_0_2_2, all_0_0_0) & ! [v0] : ! [v1] : ! [v2] : ( ~ subset(v0, v1) | ~ member(v2, v0) | member(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v1) | ~ member(v2, v0) | intersect(v0, v1)) & ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0)) & ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | ? [v2] : (member(v2, v1) & member(v2, v0))) & ? [v0] : ? [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1))) & ? [v0] : subset(v0, v0)
% 2.35/1.24 |
% 2.35/1.24 | Applying alpha-rule on (1) yields:
% 2.35/1.24 | (2) ! [v0] : ! [v1] : ! [v2] : ( ~ subset(v0, v1) | ~ member(v2, v0) | member(v2, v1))
% 2.35/1.25 | (3) ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v1) | ~ member(v2, v0) | intersect(v0, v1))
% 2.35/1.25 | (4) ? [v0] : subset(v0, v0)
% 2.35/1.25 | (5) ~ intersect(all_0_2_2, all_0_0_0)
% 2.35/1.25 | (6) ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | ? [v2] : (member(v2, v1) & member(v2, v0)))
% 2.35/1.25 | (7) ? [v0] : ? [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1)))
% 2.35/1.25 | (8) intersect(all_0_2_2, all_0_1_1)
% 2.35/1.25 | (9) subset(all_0_1_1, all_0_0_0)
% 2.35/1.25 | (10) ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0))
% 2.35/1.25 |
% 2.35/1.25 | Instantiating formula (6) with all_0_1_1, all_0_2_2 and discharging atoms intersect(all_0_2_2, all_0_1_1), yields:
% 2.35/1.25 | (11) ? [v0] : (member(v0, all_0_1_1) & member(v0, all_0_2_2))
% 2.39/1.25 |
% 2.39/1.25 | Instantiating (11) with all_12_0_6 yields:
% 2.39/1.25 | (12) member(all_12_0_6, all_0_1_1) & member(all_12_0_6, all_0_2_2)
% 2.39/1.25 |
% 2.39/1.25 | Applying alpha-rule on (12) yields:
% 2.39/1.25 | (13) member(all_12_0_6, all_0_1_1)
% 2.39/1.25 | (14) member(all_12_0_6, all_0_2_2)
% 2.39/1.25 |
% 2.39/1.25 | Instantiating formula (2) with all_12_0_6, all_0_0_0, all_0_1_1 and discharging atoms subset(all_0_1_1, all_0_0_0), member(all_12_0_6, all_0_1_1), yields:
% 2.39/1.25 | (15) member(all_12_0_6, all_0_0_0)
% 2.39/1.25 |
% 2.39/1.25 | Instantiating formula (3) with all_12_0_6, all_0_0_0, all_0_2_2 and discharging atoms member(all_12_0_6, all_0_0_0), member(all_12_0_6, all_0_2_2), ~ intersect(all_0_2_2, all_0_0_0), yields:
% 2.39/1.25 | (16) $false
% 2.39/1.25 |
% 2.39/1.25 |-The branch is then unsatisfiable
% 2.39/1.25 % SZS output end Proof for theBenchmark
% 2.39/1.25
% 2.39/1.25 661ms
%------------------------------------------------------------------------------