TSTP Solution File: SET626+3 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SET626+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n007.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 2.09s 1.15s
% Output : Proof 2.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET626+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 08:35:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.58 ____ _
% 0.19/0.58 ___ / __ \_____(_)___ ________ __________
% 0.19/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.19/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.19/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.19/0.58
% 0.19/0.58 A Theorem Prover for First-Order Logic
% 0.19/0.59 (ePrincess v.1.0)
% 0.19/0.59
% 0.19/0.59 (c) Philipp Rümmer, 2009-2015
% 0.19/0.59 (c) Peter Backeman, 2014-2015
% 0.19/0.59 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.19/0.59 Free software under GNU Lesser General Public License (LGPL).
% 0.19/0.59 Bug reports to peter@backeman.se
% 0.19/0.59
% 0.19/0.59 For more information, visit http://user.uu.se/~petba168/breu/
% 0.19/0.59
% 0.19/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.29/0.88 Prover 0: Preprocessing ...
% 1.66/1.01 Prover 0: Warning: ignoring some quantifiers
% 1.66/1.03 Prover 0: Constructing countermodel ...
% 2.09/1.15 Prover 0: proved (514ms)
% 2.09/1.15
% 2.09/1.15 No countermodel exists, formula is valid
% 2.09/1.15 % SZS status Theorem for theBenchmark
% 2.09/1.15
% 2.09/1.15 Generating proof ... Warning: ignoring some quantifiers
% 2.65/1.33 found it (size 9)
% 2.65/1.33
% 2.65/1.33 % SZS output start Proof for theBenchmark
% 2.65/1.33 Assumed formulas after preprocessing and simplification:
% 2.65/1.33 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : (intersection(v1, v2) = v3 & intersect(v0, v3) & ~ intersect(v0, v1) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (intersection(v7, v6) = v5) | ~ (intersection(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ( ~ (intersection(v4, v5) = v7) | ~ member(v6, v7) | member(v6, v5)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ( ~ (intersection(v4, v5) = v7) | ~ member(v6, v7) | member(v6, v4)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : ( ~ (intersection(v4, v5) = v7) | ~ member(v6, v5) | ~ member(v6, v4) | member(v6, v7)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (intersection(v5, v4) = v6) | intersection(v4, v5) = v6) & ! [v4] : ! [v5] : ! [v6] : ( ~ (intersection(v4, v5) = v6) | intersection(v5, v4) = v6) & ! [v4] : ! [v5] : ! [v6] : ( ~ member(v6, v5) | ~ member(v6, v4) | intersect(v4, v5)) & ! [v4] : ! [v5] : ( ~ intersect(v4, v5) | intersect(v5, v4)) & ! [v4] : ! [v5] : ( ~ intersect(v4, v5) | ? [v6] : (member(v6, v5) & member(v6, v4))) & ? [v4] : ? [v5] : (v5 = v4 | ? [v6] : (( ~ member(v6, v5) | ~ member(v6, v4)) & (member(v6, v5) | member(v6, v4)))))
% 2.65/1.36 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields:
% 2.65/1.36 | (1) intersection(all_0_2_2, all_0_1_1) = all_0_0_0 & intersect(all_0_3_3, all_0_0_0) & ~ intersect(all_0_3_3, all_0_2_2) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v1) | ~ member(v2, v0) | member(v2, v3)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v1, v0) = v2) | intersection(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | intersection(v1, v0) = v2) & ! [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] : (v1 = v0 | ? [v2] : (( ~ member(v2, v1) | ~ member(v2, v0)) & (member(v2, v1) | member(v2, v0))))
% 2.65/1.37 |
% 2.65/1.37 | Applying alpha-rule on (1) yields:
% 2.65/1.37 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v0))
% 2.65/1.37 | (3) ? [v0] : ? [v1] : (v1 = v0 | ? [v2] : (( ~ member(v2, v1) | ~ member(v2, v0)) & (member(v2, v1) | member(v2, v0))))
% 2.65/1.37 | (4) ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | intersection(v1, v0) = v2)
% 2.65/1.37 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v1, v0) = v2) | intersection(v0, v1) = v2)
% 2.65/1.37 | (6) ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | intersect(v1, v0))
% 2.65/1.38 | (7) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v1) | ~ member(v2, v0) | member(v2, v3))
% 2.65/1.38 | (8) intersection(all_0_2_2, all_0_1_1) = all_0_0_0
% 2.65/1.38 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = v0))
% 2.65/1.38 | (10) intersect(all_0_3_3, all_0_0_0)
% 2.65/1.38 | (11) ! [v0] : ! [v1] : ( ~ intersect(v0, v1) | ? [v2] : (member(v2, v1) & member(v2, v0)))
% 2.65/1.38 | (12) ~ intersect(all_0_3_3, all_0_2_2)
% 2.65/1.38 | (13) ! [v0] : ! [v1] : ! [v2] : ( ~ member(v2, v1) | ~ member(v2, v0) | intersect(v0, v1))
% 2.65/1.38 | (14) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | member(v2, v1))
% 2.65/1.38 |
% 2.65/1.38 | Instantiating formula (5) with all_0_0_0, all_0_2_2, all_0_1_1 and discharging atoms intersection(all_0_2_2, all_0_1_1) = all_0_0_0, yields:
% 2.65/1.38 | (15) intersection(all_0_1_1, all_0_2_2) = all_0_0_0
% 2.65/1.38 |
% 2.65/1.38 | Instantiating formula (11) with all_0_0_0, all_0_3_3 and discharging atoms intersect(all_0_3_3, all_0_0_0), yields:
% 2.65/1.38 | (16) ? [v0] : (member(v0, all_0_0_0) & member(v0, all_0_3_3))
% 2.65/1.38 |
% 2.65/1.38 | Instantiating (16) with all_10_0_6 yields:
% 2.65/1.38 | (17) member(all_10_0_6, all_0_0_0) & member(all_10_0_6, all_0_3_3)
% 2.65/1.38 |
% 2.65/1.38 | Applying alpha-rule on (17) yields:
% 2.65/1.38 | (18) member(all_10_0_6, all_0_0_0)
% 2.65/1.38 | (19) member(all_10_0_6, all_0_3_3)
% 2.65/1.38 |
% 2.65/1.38 | Instantiating formula (14) with all_0_0_0, all_10_0_6, all_0_2_2, all_0_1_1 and discharging atoms intersection(all_0_1_1, all_0_2_2) = all_0_0_0, member(all_10_0_6, all_0_0_0), yields:
% 2.65/1.38 | (20) member(all_10_0_6, all_0_2_2)
% 2.65/1.38 |
% 2.65/1.38 | Instantiating formula (13) with all_10_0_6, all_0_2_2, all_0_3_3 and discharging atoms member(all_10_0_6, all_0_2_2), member(all_10_0_6, all_0_3_3), ~ intersect(all_0_3_3, all_0_2_2), yields:
% 2.65/1.38 | (21) $false
% 2.65/1.38 |
% 2.65/1.38 |-The branch is then unsatisfiable
% 2.65/1.38 % SZS output end Proof for theBenchmark
% 2.65/1.38
% 2.65/1.38 787ms
%------------------------------------------------------------------------------