TSTP Solution File: SET918+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SET918+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n019.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:23:09 EDT 2022
% Result : Theorem 2.40s 1.24s
% Output : Proof 3.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET918+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n019.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 23:05:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.58/0.57 ____ _
% 0.58/0.57 ___ / __ \_____(_)___ ________ __________
% 0.58/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.58/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.58/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.58/0.57
% 0.58/0.57 A Theorem Prover for First-Order Logic
% 0.58/0.57 (ePrincess v.1.0)
% 0.58/0.57
% 0.58/0.57 (c) Philipp Rümmer, 2009-2015
% 0.58/0.57 (c) Peter Backeman, 2014-2015
% 0.58/0.57 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.58/0.57 Free software under GNU Lesser General Public License (LGPL).
% 0.58/0.58 Bug reports to peter@backeman.se
% 0.58/0.58
% 0.58/0.58 For more information, visit http://user.uu.se/~petba168/breu/
% 0.58/0.58
% 0.58/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.58/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.39/0.89 Prover 0: Preprocessing ...
% 1.89/1.10 Prover 0: Warning: ignoring some quantifiers
% 1.89/1.11 Prover 0: Constructing countermodel ...
% 2.40/1.24 Prover 0: proved (616ms)
% 2.40/1.24
% 2.40/1.24 No countermodel exists, formula is valid
% 2.40/1.24 % SZS status Theorem for theBenchmark
% 2.40/1.24
% 2.40/1.24 Generating proof ... Warning: ignoring some quantifiers
% 2.83/1.45 found it (size 8)
% 2.83/1.45
% 2.83/1.45 % SZS output start Proof for theBenchmark
% 2.83/1.45 Assumed formulas after preprocessing and simplification:
% 2.83/1.45 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ( ~ (v1 = v0) & singleton(v0) = v4 & set_intersection2(v3, v2) = v4 & unordered_pair(v0, v1) = v3 & empty(v6) & in(v1, v2) & ~ empty(v5) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v10 = v8 | v10 = v7 | ~ (unordered_pair(v7, v8) = v9) | ~ in(v10, v9)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (set_intersection2(v10, v9) = v8) | ~ (set_intersection2(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (unordered_pair(v10, v9) = v8) | ~ (unordered_pair(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ( ~ (set_intersection2(v7, v8) = v9) | ~ in(v10, v9) | in(v10, v8)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ( ~ (set_intersection2(v7, v8) = v9) | ~ in(v10, v9) | in(v10, v7)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ( ~ (set_intersection2(v7, v8) = v9) | ~ in(v10, v8) | ~ in(v10, v7) | in(v10, v9)) & ? [v7] : ! [v8] : ! [v9] : ! [v10] : (v10 = v7 | ~ (set_intersection2(v8, v9) = v10) | ? [v11] : (( ~ in(v11, v9) | ~ in(v11, v8) | ~ in(v11, v7)) & (in(v11, v7) | (in(v11, v9) & in(v11, v8))))) & ? [v7] : ! [v8] : ! [v9] : ! [v10] : (v10 = v7 | ~ (unordered_pair(v8, v9) = v10) | ? [v11] : ((v11 = v9 | v11 = v8 | in(v11, v7)) & ( ~ in(v11, v7) | ( ~ (v11 = v9) & ~ (v11 = v8))))) & ! [v7] : ! [v8] : ! [v9] : (v9 = v7 | ~ (singleton(v7) = v8) | ~ in(v9, v8)) & ! [v7] : ! [v8] : ! [v9] : (v8 = v7 | ~ (singleton(v9) = v8) | ~ (singleton(v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : ( ~ (set_intersection2(v8, v7) = v9) | set_intersection2(v7, v8) = v9) & ! [v7] : ! [v8] : ! [v9] : ( ~ (set_intersection2(v7, v8) = v9) | set_intersection2(v8, v7) = v9) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v8, v7) = v9) | unordered_pair(v7, v8) = v9) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v7, v8) = v9) | unordered_pair(v8, v7) = v9) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v7, v8) = v9) | in(v8, v9)) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v7, v8) = v9) | in(v7, v9)) & ? [v7] : ! [v8] : ! [v9] : (v9 = v7 | ~ (singleton(v8) = v9) | ? [v10] : (( ~ (v10 = v8) | ~ in(v8, v7)) & (v10 = v8 | in(v10, v7)))) & ! [v7] : ! [v8] : (v8 = v7 | ~ (set_intersection2(v7, v7) = v8)) & ! [v7] : ! [v8] : ( ~ (singleton(v7) = v8) | in(v7, v8)) & ! [v7] : ! [v8] : ( ~ in(v8, v7) | ~ in(v7, v8)))
% 3.19/1.49 | 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.19/1.49 | (1) ~ (all_0_5_5 = all_0_6_6) & singleton(all_0_6_6) = all_0_2_2 & set_intersection2(all_0_3_3, all_0_4_4) = all_0_2_2 & unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3 & empty(all_0_0_0) & in(all_0_5_5, all_0_4_4) & ~ empty(all_0_1_1) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v2) | in(v3, v1)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v2) | in(v3, v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v1) | ~ in(v3, v0) | in(v3, v2)) & ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (set_intersection2(v1, v2) = v3) | ? [v4] : (( ~ in(v4, v2) | ~ in(v4, v1) | ~ in(v4, v0)) & (in(v4, v0) | (in(v4, v2) & in(v4, v1))))) & ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (unordered_pair(v1, v2) = v3) | ? [v4] : ((v4 = v2 | v4 = v1 | in(v4, v0)) & ( ~ in(v4, v0) | ( ~ (v4 = v2) & ~ (v4 = v1))))) & ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v0) = v1) | ~ in(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v1, v0) = v2) | set_intersection2(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2)) & ? [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : (( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | in(v3, v0)))) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) & ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | in(v0, v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1))
% 3.30/1.49 |
% 3.30/1.49 | Applying alpha-rule on (1) yields:
% 3.30/1.49 | (2) singleton(all_0_6_6) = all_0_2_2
% 3.30/1.49 | (3) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1))
% 3.30/1.50 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0))
% 3.30/1.50 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2)
% 3.30/1.50 | (6) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v1, v0) = v2) | set_intersection2(v0, v1) = v2)
% 3.30/1.50 | (7) ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (set_intersection2(v1, v2) = v3) | ? [v4] : (( ~ in(v4, v2) | ~ in(v4, v1) | ~ in(v4, v0)) & (in(v4, v0) | (in(v4, v2) & in(v4, v1)))))
% 3.30/1.50 | (8) ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | in(v0, v1))
% 3.30/1.50 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2))
% 3.30/1.50 | (10) in(all_0_5_5, all_0_4_4)
% 3.30/1.50 | (11) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2))
% 3.30/1.50 | (12) unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3
% 3.30/1.50 | (13) ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v0) = v1) | ~ in(v2, v1))
% 3.30/1.50 | (14) set_intersection2(all_0_3_3, all_0_4_4) = all_0_2_2
% 3.30/1.50 | (15) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1))
% 3.30/1.50 | (16) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2))
% 3.30/1.50 | (17) empty(all_0_0_0)
% 3.30/1.50 | (18) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0))
% 3.30/1.50 | (19) ~ empty(all_0_1_1)
% 3.30/1.50 | (20) ~ (all_0_5_5 = all_0_6_6)
% 3.30/1.50 | (21) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v2) | in(v3, v1))
% 3.30/1.50 | (22) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v1) | ~ in(v3, v0) | in(v3, v2))
% 3.30/1.50 | (23) ? [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : (( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | in(v3, v0))))
% 3.30/1.50 | (24) ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (unordered_pair(v1, v2) = v3) | ? [v4] : ((v4 = v2 | v4 = v1 | in(v4, v0)) & ( ~ in(v4, v0) | ( ~ (v4 = v2) & ~ (v4 = v1)))))
% 3.30/1.50 | (25) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (set_intersection2(v0, v1) = v2) | ~ in(v3, v2) | in(v3, v0))
% 3.30/1.50 | (26) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2)
% 3.30/1.50 | (27) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2)
% 3.30/1.50 | (28) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0))
% 3.30/1.50 |
% 3.30/1.50 | Instantiating formula (6) with all_0_2_2, all_0_3_3, all_0_4_4 and discharging atoms set_intersection2(all_0_3_3, all_0_4_4) = all_0_2_2, yields:
% 3.30/1.50 | (29) set_intersection2(all_0_4_4, all_0_3_3) = all_0_2_2
% 3.30/1.50 |
% 3.30/1.50 | Instantiating formula (11) with all_0_3_3, all_0_5_5, all_0_6_6 and discharging atoms unordered_pair(all_0_6_6, all_0_5_5) = all_0_3_3, yields:
% 3.30/1.50 | (30) in(all_0_5_5, all_0_3_3)
% 3.30/1.51 |
% 3.30/1.51 | Instantiating formula (22) with all_0_5_5, all_0_2_2, all_0_3_3, all_0_4_4 and discharging atoms set_intersection2(all_0_4_4, all_0_3_3) = all_0_2_2, in(all_0_5_5, all_0_3_3), in(all_0_5_5, all_0_4_4), yields:
% 3.30/1.51 | (31) in(all_0_5_5, all_0_2_2)
% 3.30/1.51 |
% 3.30/1.51 | Instantiating formula (13) with all_0_5_5, all_0_2_2, all_0_6_6 and discharging atoms singleton(all_0_6_6) = all_0_2_2, in(all_0_5_5, all_0_2_2), yields:
% 3.30/1.51 | (32) all_0_5_5 = all_0_6_6
% 3.30/1.51 |
% 3.30/1.51 | Equations (32) can reduce 20 to:
% 3.30/1.51 | (33) $false
% 3.30/1.51 |
% 3.30/1.51 |-The branch is then unsatisfiable
% 3.30/1.51 % SZS output end Proof for theBenchmark
% 3.30/1.51
% 3.30/1.51 923ms
%------------------------------------------------------------------------------