TSTP Solution File: SEU127+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SEU127+1 : TPTP v8.1.0. Released v3.3.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:46:46 EDT 2022
% Result : Theorem 2.84s 1.31s
% Output : Proof 3.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU127+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jun 19 10:29:29 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.18/0.52 ____ _
% 0.18/0.52 ___ / __ \_____(_)___ ________ __________
% 0.18/0.52 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.18/0.52 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.18/0.52 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.18/0.52
% 0.18/0.52 A Theorem Prover for First-Order Logic
% 0.18/0.53 (ePrincess v.1.0)
% 0.18/0.53
% 0.18/0.53 (c) Philipp Rümmer, 2009-2015
% 0.18/0.53 (c) Peter Backeman, 2014-2015
% 0.18/0.53 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.18/0.53 Free software under GNU Lesser General Public License (LGPL).
% 0.18/0.53 Bug reports to peter@backeman.se
% 0.18/0.53
% 0.18/0.53 For more information, visit http://user.uu.se/~petba168/breu/
% 0.18/0.53
% 0.18/0.53 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.65/0.57 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.15/0.83 Prover 0: Preprocessing ...
% 1.63/0.97 Prover 0: Warning: ignoring some quantifiers
% 1.63/0.99 Prover 0: Constructing countermodel ...
% 2.29/1.16 Prover 0: gave up
% 2.29/1.16 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all
% 2.29/1.18 Prover 1: Preprocessing ...
% 2.60/1.25 Prover 1: Warning: ignoring some quantifiers
% 2.60/1.25 Prover 1: Constructing countermodel ...
% 2.60/1.31 Prover 1: proved (148ms)
% 2.60/1.31
% 2.60/1.31 No countermodel exists, formula is valid
% 2.84/1.31 % SZS status Theorem for theBenchmark
% 2.84/1.31
% 2.84/1.31 Generating proof ... Warning: ignoring some quantifiers
% 3.76/1.55 found it (size 18)
% 3.76/1.55
% 3.76/1.55 % SZS output start Proof for theBenchmark
% 3.76/1.55 Assumed formulas after preprocessing and simplification:
% 3.76/1.55 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ( ~ (v5 = 0) & ~ (v3 = 0) & empty(v6) = 0 & empty(v4) = v5 & empty(empty_set) = 0 & subset(v2, v0) = v3 & set_intersection2(v0, v1) = v2 & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ! [v11] : ( ~ (set_intersection2(v7, v8) = v9) | ~ (in(v10, v7) = v11) | ? [v12] : ? [v13] : (in(v10, v9) = v12 & in(v10, v8) = v13 & ( ~ (v12 = 0) | (v13 = 0 & v11 = 0)))) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (subset(v10, v9) = v8) | ~ (subset(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (set_intersection2(v10, v9) = v8) | ~ (set_intersection2(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (in(v10, v9) = v8) | ~ (in(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ( ~ (set_intersection2(v7, v8) = v9) | ~ (in(v10, v7) = 0) | ? [v11] : ? [v12] : (in(v10, v9) = v12 & in(v10, v8) = v11 & ( ~ (v11 = 0) | v12 = 0))) & ? [v7] : ! [v8] : ! [v9] : ! [v10] : (v10 = v7 | ~ (set_intersection2(v8, v9) = v10) | ? [v11] : ? [v12] : ? [v13] : ? [v14] : (in(v11, v9) = v14 & in(v11, v8) = v13 & in(v11, v7) = v12 & ( ~ (v14 = 0) | ~ (v13 = 0) | ~ (v12 = 0)) & (v12 = 0 | (v14 = 0 & v13 = 0)))) & ! [v7] : ! [v8] : ! [v9] : (v9 = 0 | ~ (subset(v7, v8) = v9) | ? [v10] : ? [v11] : ( ~ (v11 = 0) & in(v10, v8) = v11 & in(v10, v7) = 0)) & ! [v7] : ! [v8] : ! [v9] : (v8 = v7 | ~ (empty(v9) = v8) | ~ (empty(v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ( ~ (subset(v7, v8) = 0) | ~ (in(v9, v7) = 0) | in(v9, v8) = 0) & ! [v7] : ! [v8] : ! [v9] : ( ~ (set_intersection2(v7, v8) = v9) | set_intersection2(v8, v7) = v9) & ! [v7] : ! [v8] : (v8 = v7 | ~ (empty(v8) = 0) | ~ (empty(v7) = 0)) & ! [v7] : ! [v8] : (v8 = v7 | ~ (set_intersection2(v7, v7) = v8)) & ! [v7] : ! [v8] : (v8 = empty_set | ~ (set_intersection2(v7, empty_set) = v8)) & ! [v7] : ! [v8] : (v8 = 0 | ~ (subset(v7, v7) = v8)) & ! [v7] : ! [v8] : ( ~ (in(v7, v8) = 0) | ? [v9] : ( ~ (v9 = 0) & empty(v8) = v9)) & ! [v7] : ! [v8] : ( ~ (in(v7, v8) = 0) | ? [v9] : ( ~ (v9 = 0) & in(v8, v7) = v9)) & ! [v7] : (v7 = empty_set | ~ (empty(v7) = 0)))
% 3.76/1.58 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6 yields:
% 3.76/1.58 | (1) ~ (all_0_1_1 = 0) & ~ (all_0_3_3 = 0) & empty(all_0_0_0) = 0 & empty(all_0_2_2) = all_0_1_1 & empty(empty_set) = 0 & subset(all_0_4_4, all_0_6_6) = all_0_3_3 & set_intersection2(all_0_6_6, all_0_5_5) = all_0_4_4 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v0) = v4) | ? [v5] : ? [v6] : (in(v3, v2) = v5 & in(v3, v1) = v6 & ( ~ (v5 = 0) | (v6 = 0 & v4 = 0)))) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v0) = 0) | ? [v4] : ? [v5] : (in(v3, v2) = v5 & in(v3, v1) = v4 & ( ~ (v4 = 0) | v5 = 0))) & ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (set_intersection2(v1, v2) = v3) | ? [v4] : ? [v5] : ? [v6] : ? [v7] : (in(v4, v2) = v7 & in(v4, v1) = v6 & in(v4, v0) = v5 & ( ~ (v7 = 0) | ~ (v6 = 0) | ~ (v5 = 0)) & (v5 = 0 | (v7 = 0 & v6 = 0)))) & ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ? [v3] : ? [v4] : ( ~ (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (subset(v0, v1) = 0) | ~ (in(v2, v0) = 0) | in(v2, v1) = 0) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) & ! [v0] : ! [v1] : (v1 = v0 | ~ (empty(v1) = 0) | ~ (empty(v0) = 0)) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) & ! [v0] : ! [v1] : (v1 = empty_set | ~ (set_intersection2(v0, empty_set) = v1)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1)) & ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & empty(v1) = v2)) & ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2)) & ! [v0] : (v0 = empty_set | ~ (empty(v0) = 0))
% 3.76/1.59 |
% 3.76/1.59 | Applying alpha-rule on (1) yields:
% 3.76/1.59 | (2) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2)
% 3.76/1.59 | (3) ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & in(v1, v0) = v2))
% 3.76/1.59 | (4) empty(all_0_2_2) = all_0_1_1
% 3.76/1.59 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v0) = v4) | ? [v5] : ? [v6] : (in(v3, v2) = v5 & in(v3, v1) = v6 & ( ~ (v5 = 0) | (v6 = 0 & v4 = 0))))
% 3.76/1.59 | (6) set_intersection2(all_0_6_6, all_0_5_5) = all_0_4_4
% 3.76/1.59 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ (subset(v0, v1) = 0) | ~ (in(v2, v0) = 0) | in(v2, v1) = 0)
% 3.76/1.59 | (8) ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (set_intersection2(v1, v2) = v3) | ? [v4] : ? [v5] : ? [v6] : ? [v7] : (in(v4, v2) = v7 & in(v4, v1) = v6 & in(v4, v0) = v5 & ( ~ (v7 = 0) | ~ (v6 = 0) | ~ (v5 = 0)) & (v5 = 0 | (v7 = 0 & v6 = 0))))
% 3.76/1.59 | (9) subset(all_0_4_4, all_0_6_6) = all_0_3_3
% 3.76/1.59 | (10) ! [v0] : ! [v1] : ! [v2] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ? [v3] : ? [v4] : ( ~ (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0))
% 3.76/1.59 | (11) ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1))
% 3.76/1.59 | (12) empty(all_0_0_0) = 0
% 3.76/1.59 | (13) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ (in(v3, v0) = 0) | ? [v4] : ? [v5] : (in(v3, v2) = v5 & in(v3, v1) = v4 & ( ~ (v4 = 0) | v5 = 0)))
% 3.76/1.59 | (14) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0))
% 3.76/1.59 | (15) ~ (all_0_3_3 = 0)
% 3.76/1.59 | (16) ! [v0] : (v0 = empty_set | ~ (empty(v0) = 0))
% 3.76/1.59 | (17) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0))
% 3.76/1.59 | (18) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0))
% 3.76/1.59 | (19) ! [v0] : ! [v1] : (v1 = v0 | ~ (empty(v1) = 0) | ~ (empty(v0) = 0))
% 3.76/1.59 | (20) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0))
% 3.76/1.60 | (21) ! [v0] : ! [v1] : (v1 = empty_set | ~ (set_intersection2(v0, empty_set) = v1))
% 3.76/1.60 | (22) empty(empty_set) = 0
% 3.76/1.60 | (23) ! [v0] : ! [v1] : ( ~ (in(v0, v1) = 0) | ? [v2] : ( ~ (v2 = 0) & empty(v1) = v2))
% 3.76/1.60 | (24) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1))
% 3.76/1.60 | (25) ~ (all_0_1_1 = 0)
% 3.76/1.60 |
% 3.76/1.60 | Instantiating formula (10) with all_0_3_3, all_0_6_6, all_0_4_4 and discharging atoms subset(all_0_4_4, all_0_6_6) = all_0_3_3, yields:
% 3.76/1.60 | (26) all_0_3_3 = 0 | ? [v0] : ? [v1] : ( ~ (v1 = 0) & in(v0, all_0_4_4) = 0 & in(v0, all_0_6_6) = v1)
% 3.76/1.60 |
% 3.76/1.60 +-Applying beta-rule and splitting (26), into two cases.
% 3.76/1.60 |-Branch one:
% 3.76/1.60 | (27) all_0_3_3 = 0
% 3.76/1.60 |
% 3.76/1.60 | Equations (27) can reduce 15 to:
% 3.76/1.60 | (28) $false
% 3.76/1.60 |
% 3.76/1.60 |-The branch is then unsatisfiable
% 3.76/1.60 |-Branch two:
% 3.76/1.60 | (15) ~ (all_0_3_3 = 0)
% 3.76/1.60 | (30) ? [v0] : ? [v1] : ( ~ (v1 = 0) & in(v0, all_0_4_4) = 0 & in(v0, all_0_6_6) = v1)
% 3.76/1.60 |
% 3.76/1.60 | Instantiating (30) with all_35_0_8, all_35_1_9 yields:
% 3.76/1.60 | (31) ~ (all_35_0_8 = 0) & in(all_35_1_9, all_0_4_4) = 0 & in(all_35_1_9, all_0_6_6) = all_35_0_8
% 3.76/1.60 |
% 3.76/1.60 | Applying alpha-rule on (31) yields:
% 3.76/1.60 | (32) ~ (all_35_0_8 = 0)
% 3.76/1.60 | (33) in(all_35_1_9, all_0_4_4) = 0
% 3.76/1.60 | (34) in(all_35_1_9, all_0_6_6) = all_35_0_8
% 3.76/1.60 |
% 3.76/1.60 | Instantiating formula (5) with all_35_0_8, all_35_1_9, all_0_4_4, all_0_5_5, all_0_6_6 and discharging atoms set_intersection2(all_0_6_6, all_0_5_5) = all_0_4_4, in(all_35_1_9, all_0_6_6) = all_35_0_8, yields:
% 3.76/1.60 | (35) ? [v0] : ? [v1] : (in(all_35_1_9, all_0_4_4) = v0 & in(all_35_1_9, all_0_5_5) = v1 & ( ~ (v0 = 0) | (v1 = 0 & all_35_0_8 = 0)))
% 3.76/1.60 |
% 3.76/1.60 | Instantiating (35) with all_42_0_10, all_42_1_11 yields:
% 3.76/1.60 | (36) in(all_35_1_9, all_0_4_4) = all_42_1_11 & in(all_35_1_9, all_0_5_5) = all_42_0_10 & ( ~ (all_42_1_11 = 0) | (all_42_0_10 = 0 & all_35_0_8 = 0))
% 3.76/1.60 |
% 3.76/1.60 | Applying alpha-rule on (36) yields:
% 3.76/1.60 | (37) in(all_35_1_9, all_0_4_4) = all_42_1_11
% 3.76/1.60 | (38) in(all_35_1_9, all_0_5_5) = all_42_0_10
% 3.76/1.60 | (39) ~ (all_42_1_11 = 0) | (all_42_0_10 = 0 & all_35_0_8 = 0)
% 3.76/1.60 |
% 3.76/1.60 +-Applying beta-rule and splitting (39), into two cases.
% 3.76/1.60 |-Branch one:
% 3.76/1.60 | (40) ~ (all_42_1_11 = 0)
% 3.76/1.60 |
% 3.76/1.60 | Instantiating formula (14) with all_35_1_9, all_0_4_4, all_42_1_11, 0 and discharging atoms in(all_35_1_9, all_0_4_4) = all_42_1_11, in(all_35_1_9, all_0_4_4) = 0, yields:
% 3.76/1.60 | (41) all_42_1_11 = 0
% 3.76/1.60 |
% 3.76/1.60 | Equations (41) can reduce 40 to:
% 3.76/1.60 | (28) $false
% 3.76/1.60 |
% 3.76/1.60 |-The branch is then unsatisfiable
% 3.76/1.60 |-Branch two:
% 3.76/1.60 | (41) all_42_1_11 = 0
% 3.76/1.60 | (44) all_42_0_10 = 0 & all_35_0_8 = 0
% 3.76/1.60 |
% 3.76/1.60 | Applying alpha-rule on (44) yields:
% 3.76/1.60 | (45) all_42_0_10 = 0
% 3.76/1.61 | (46) all_35_0_8 = 0
% 3.76/1.61 |
% 3.76/1.61 | Equations (46) can reduce 32 to:
% 3.76/1.61 | (28) $false
% 3.76/1.61 |
% 3.76/1.61 |-The branch is then unsatisfiable
% 3.76/1.61 % SZS output end Proof for theBenchmark
% 3.76/1.61
% 3.76/1.61 1070ms
%------------------------------------------------------------------------------