TSTP Solution File: NUM393+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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 : 0s
% DateTime : Mon Jul 18 06:21:54 EDT 2022
% Result : Theorem 0.69s 1.08s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Wed Jul 6 00:26:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.69/1.08 *** allocated 10000 integers for termspace/termends
% 0.69/1.08 *** allocated 10000 integers for clauses
% 0.69/1.08 *** allocated 10000 integers for justifications
% 0.69/1.08 Bliksem 1.12
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08 Automatic Strategy Selection
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08 Clauses:
% 0.69/1.08
% 0.69/1.08 { ! in( X, Y ), ! in( Y, X ) }.
% 0.69/1.08 { ! empty( X ), function( X ) }.
% 0.69/1.08 { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.69/1.08 { ! ordinal( X ), epsilon_connected( X ) }.
% 0.69/1.08 { ! empty( X ), relation( X ) }.
% 0.69/1.08 { ! relation( X ), ! empty( X ), ! function( X ), relation( X ) }.
% 0.69/1.08 { ! relation( X ), ! empty( X ), ! function( X ), function( X ) }.
% 0.69/1.08 { ! relation( X ), ! empty( X ), ! function( X ), one_to_one( X ) }.
% 0.69/1.08 { ! epsilon_transitive( X ), ! epsilon_connected( X ), ordinal( X ) }.
% 0.69/1.08 { ! ordinal( X ), ! ordinal( Y ), ordinal_subset( X, Y ), ordinal_subset( Y
% 0.69/1.08 , X ) }.
% 0.69/1.08 { ! inclusion_comparable( X, Y ), subset( X, Y ), subset( Y, X ) }.
% 0.69/1.08 { ! subset( X, Y ), inclusion_comparable( X, Y ) }.
% 0.69/1.08 { ! subset( Y, X ), inclusion_comparable( X, Y ) }.
% 0.69/1.08 { element( skol1( X ), X ) }.
% 0.69/1.08 { empty( empty_set ) }.
% 0.69/1.08 { relation( empty_set ) }.
% 0.69/1.08 { relation_empty_yielding( empty_set ) }.
% 0.69/1.08 { empty( empty_set ) }.
% 0.69/1.08 { empty( empty_set ) }.
% 0.69/1.08 { relation( empty_set ) }.
% 0.69/1.08 { relation( skol2 ) }.
% 0.69/1.08 { function( skol2 ) }.
% 0.69/1.08 { epsilon_transitive( skol3 ) }.
% 0.69/1.08 { epsilon_connected( skol3 ) }.
% 0.69/1.08 { ordinal( skol3 ) }.
% 0.69/1.08 { empty( skol4 ) }.
% 0.69/1.08 { relation( skol4 ) }.
% 0.69/1.08 { empty( skol5 ) }.
% 0.69/1.08 { relation( skol6 ) }.
% 0.69/1.08 { empty( skol6 ) }.
% 0.69/1.08 { function( skol6 ) }.
% 0.69/1.08 { ! empty( skol7 ) }.
% 0.69/1.08 { relation( skol7 ) }.
% 0.69/1.08 { ! empty( skol8 ) }.
% 0.69/1.08 { relation( skol9 ) }.
% 0.69/1.08 { function( skol9 ) }.
% 0.69/1.08 { one_to_one( skol9 ) }.
% 0.69/1.08 { relation( skol10 ) }.
% 0.69/1.08 { relation_empty_yielding( skol10 ) }.
% 0.69/1.08 { relation( skol11 ) }.
% 0.69/1.08 { relation_empty_yielding( skol11 ) }.
% 0.69/1.08 { function( skol11 ) }.
% 0.69/1.08 { relation( skol12 ) }.
% 0.69/1.08 { relation_non_empty( skol12 ) }.
% 0.69/1.08 { function( skol12 ) }.
% 0.69/1.08 { ! ordinal( X ), ! ordinal( Y ), ! ordinal_subset( X, Y ), subset( X, Y )
% 0.69/1.08 }.
% 0.69/1.08 { ! ordinal( X ), ! ordinal( Y ), ! subset( X, Y ), ordinal_subset( X, Y )
% 0.69/1.08 }.
% 0.69/1.08 { ! ordinal( X ), ! ordinal( Y ), ordinal_subset( X, X ) }.
% 0.69/1.08 { subset( X, X ) }.
% 0.69/1.08 { inclusion_comparable( X, X ) }.
% 0.69/1.08 { ! inclusion_comparable( X, Y ), inclusion_comparable( Y, X ) }.
% 0.69/1.08 { ! in( X, Y ), element( X, Y ) }.
% 0.69/1.08 { ordinal( skol13 ) }.
% 0.69/1.08 { ordinal( skol14 ) }.
% 0.69/1.08 { ! inclusion_comparable( skol13, skol14 ) }.
% 0.69/1.08 { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.69/1.08 { ! element( X, powerset( Y ) ), subset( X, Y ) }.
% 0.69/1.08 { ! subset( X, Y ), element( X, powerset( Y ) ) }.
% 0.69/1.08 { ! in( X, Z ), ! element( Z, powerset( Y ) ), element( X, Y ) }.
% 0.69/1.08 { ! in( X, Y ), ! element( Y, powerset( Z ) ), ! empty( Z ) }.
% 0.69/1.08 { ! empty( X ), X = empty_set }.
% 0.69/1.08 { ! in( X, Y ), ! empty( Y ) }.
% 0.69/1.08 { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.69/1.08
% 0.69/1.08 percentage equality = 0.020619, percentage horn = 0.948276
% 0.69/1.08 This is a problem with some equality
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08 Options Used:
% 0.69/1.08
% 0.69/1.08 useres = 1
% 0.69/1.08 useparamod = 1
% 0.69/1.08 useeqrefl = 1
% 0.69/1.08 useeqfact = 1
% 0.69/1.08 usefactor = 1
% 0.69/1.08 usesimpsplitting = 0
% 0.69/1.08 usesimpdemod = 5
% 0.69/1.08 usesimpres = 3
% 0.69/1.08
% 0.69/1.08 resimpinuse = 1000
% 0.69/1.08 resimpclauses = 20000
% 0.69/1.08 substype = eqrewr
% 0.69/1.08 backwardsubs = 1
% 0.69/1.08 selectoldest = 5
% 0.69/1.08
% 0.69/1.08 litorderings [0] = split
% 0.69/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.08
% 0.69/1.08 termordering = kbo
% 0.69/1.08
% 0.69/1.08 litapriori = 0
% 0.69/1.08 termapriori = 1
% 0.69/1.08 litaposteriori = 0
% 0.69/1.08 termaposteriori = 0
% 0.69/1.08 demodaposteriori = 0
% 0.69/1.08 ordereqreflfact = 0
% 0.69/1.08
% 0.69/1.08 litselect = negord
% 0.69/1.08
% 0.69/1.08 maxweight = 15
% 0.69/1.08 maxdepth = 30000
% 0.69/1.08 maxlength = 115
% 0.69/1.08 maxnrvars = 195
% 0.69/1.08 excuselevel = 1
% 0.69/1.08 increasemaxweight = 1
% 0.69/1.08
% 0.69/1.08 maxselected = 10000000
% 0.69/1.08 maxnrclauses = 10000000
% 0.69/1.08
% 0.69/1.08 showgenerated = 0
% 0.69/1.08 showkept = 0
% 0.69/1.08 showselected = 0
% 0.69/1.08 showdeleted = 0
% 0.69/1.08 showresimp = 1
% 0.69/1.08 showstatus = 2000
% 0.69/1.08
% 0.69/1.08 prologoutput = 0
% 0.69/1.08 nrgoals = 5000000
% 0.69/1.08 totalproof = 1
% 0.69/1.08
% 0.69/1.08 Symbols occurring in the translation:
% 0.69/1.08
% 0.69/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.08 . [1, 2] (w:1, o:39, a:1, s:1, b:0),
% 0.69/1.08 ! [4, 1] (w:0, o:23, a:1, s:1, b:0),
% 0.69/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.08 in [37, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.69/1.08 empty [38, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.69/1.08 function [39, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.69/1.08 ordinal [40, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.69/1.08 epsilon_transitive [41, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.69/1.08 epsilon_connected [42, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.69/1.08 relation [43, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.69/1.08 one_to_one [44, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.69/1.08 ordinal_subset [45, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.69/1.08 inclusion_comparable [46, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.69/1.08 subset [47, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.69/1.08 element [48, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.69/1.08 empty_set [49, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.69/1.08 relation_empty_yielding [50, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.69/1.08 relation_non_empty [51, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.69/1.08 powerset [52, 1] (w:1, o:37, a:1, s:1, b:0),
% 0.69/1.08 skol1 [54, 1] (w:1, o:38, a:1, s:1, b:1),
% 0.69/1.08 skol2 [55, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.69/1.08 skol3 [56, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.69/1.08 skol4 [57, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.69/1.08 skol5 [58, 0] (w:1, o:18, a:1, s:1, b:1),
% 0.69/1.08 skol6 [59, 0] (w:1, o:19, a:1, s:1, b:1),
% 0.69/1.08 skol7 [60, 0] (w:1, o:20, a:1, s:1, b:1),
% 0.69/1.08 skol8 [61, 0] (w:1, o:21, a:1, s:1, b:1),
% 0.69/1.08 skol9 [62, 0] (w:1, o:22, a:1, s:1, b:1),
% 0.69/1.08 skol10 [63, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.69/1.08 skol11 [64, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.69/1.08 skol12 [65, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.69/1.08 skol13 [66, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.69/1.08 skol14 [67, 0] (w:1, o:14, a:1, s:1, b:1).
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08 Starting Search:
% 0.69/1.08
% 0.69/1.08 *** allocated 15000 integers for clauses
% 0.69/1.08 *** allocated 22500 integers for clauses
% 0.69/1.08
% 0.69/1.08 Bliksems!, er is een bewijs:
% 0.69/1.08 % SZS status Theorem
% 0.69/1.08 % SZS output start Refutation
% 0.69/1.08
% 0.69/1.08 (7) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ), ordinal_subset
% 0.69/1.08 ( X, Y ), ordinal_subset( Y, X ) }.
% 0.69/1.08 (9) {G0,W6,D2,L2,V2,M2} I { ! subset( X, Y ), inclusion_comparable( X, Y )
% 0.69/1.08 }.
% 0.69/1.08 (10) {G0,W6,D2,L2,V2,M2} I { ! subset( Y, X ), inclusion_comparable( X, Y )
% 0.69/1.08 }.
% 0.69/1.08 (40) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ), !
% 0.69/1.08 ordinal_subset( X, Y ), subset( X, Y ) }.
% 0.69/1.08 (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol13 ) }.
% 0.69/1.08 (48) {G0,W2,D2,L1,V0,M1} I { ordinal( skol14 ) }.
% 0.69/1.08 (49) {G0,W3,D2,L1,V0,M1} I { ! inclusion_comparable( skol13, skol14 ) }.
% 0.69/1.08 (71) {G1,W8,D2,L3,V1,M3} R(7,48) { ! ordinal( X ), ordinal_subset( skol14,
% 0.69/1.08 X ), ordinal_subset( X, skol14 ) }.
% 0.69/1.08 (77) {G1,W3,D2,L1,V0,M1} R(49,9) { ! subset( skol13, skol14 ) }.
% 0.69/1.08 (78) {G1,W3,D2,L1,V0,M1} R(10,49) { ! subset( skol14, skol13 ) }.
% 0.69/1.08 (84) {G2,W5,D2,L2,V0,M2} R(40,77);r(47) { ! ordinal( skol14 ), !
% 0.69/1.08 ordinal_subset( skol13, skol14 ) }.
% 0.69/1.08 (400) {G3,W3,D2,L1,V0,M1} S(84);r(48) { ! ordinal_subset( skol13, skol14 )
% 0.69/1.08 }.
% 0.69/1.08 (401) {G4,W3,D2,L1,V0,M1} R(400,71);r(47) { ordinal_subset( skol14, skol13
% 0.69/1.08 ) }.
% 0.69/1.08 (406) {G5,W5,D2,L2,V0,M2} R(401,40);r(48) { ! ordinal( skol13 ), subset(
% 0.69/1.08 skol14, skol13 ) }.
% 0.69/1.08 (411) {G6,W0,D0,L0,V0,M0} S(406);r(47);r(78) { }.
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08 % SZS output end Refutation
% 0.69/1.08 found a proof!
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08 Unprocessed initial clauses:
% 0.69/1.08
% 0.69/1.08 (413) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), ! in( Y, X ) }.
% 0.69/1.08 (414) {G0,W4,D2,L2,V1,M2} { ! empty( X ), function( X ) }.
% 0.69/1.08 (415) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_transitive( X ) }.
% 0.69/1.08 (416) {G0,W4,D2,L2,V1,M2} { ! ordinal( X ), epsilon_connected( X ) }.
% 0.69/1.08 (417) {G0,W4,D2,L2,V1,M2} { ! empty( X ), relation( X ) }.
% 0.69/1.08 (418) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.69/1.08 , relation( X ) }.
% 0.69/1.08 (419) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.69/1.08 , function( X ) }.
% 0.69/1.08 (420) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! empty( X ), ! function( X )
% 0.69/1.08 , one_to_one( X ) }.
% 0.69/1.08 (421) {G0,W6,D2,L3,V1,M3} { ! epsilon_transitive( X ), ! epsilon_connected
% 0.69/1.08 ( X ), ordinal( X ) }.
% 0.69/1.08 (422) {G0,W10,D2,L4,V2,M4} { ! ordinal( X ), ! ordinal( Y ),
% 0.69/1.08 ordinal_subset( X, Y ), ordinal_subset( Y, X ) }.
% 0.69/1.08 (423) {G0,W9,D2,L3,V2,M3} { ! inclusion_comparable( X, Y ), subset( X, Y )
% 0.69/1.08 , subset( Y, X ) }.
% 0.69/1.08 (424) {G0,W6,D2,L2,V2,M2} { ! subset( X, Y ), inclusion_comparable( X, Y )
% 0.69/1.08 }.
% 0.69/1.08 (425) {G0,W6,D2,L2,V2,M2} { ! subset( Y, X ), inclusion_comparable( X, Y )
% 0.69/1.08 }.
% 0.69/1.08 (426) {G0,W4,D3,L1,V1,M1} { element( skol1( X ), X ) }.
% 0.69/1.08 (427) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.69/1.08 (428) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.69/1.08 (429) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( empty_set ) }.
% 0.69/1.08 (430) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.69/1.08 (431) {G0,W2,D2,L1,V0,M1} { empty( empty_set ) }.
% 0.69/1.08 (432) {G0,W2,D2,L1,V0,M1} { relation( empty_set ) }.
% 0.69/1.08 (433) {G0,W2,D2,L1,V0,M1} { relation( skol2 ) }.
% 0.69/1.08 (434) {G0,W2,D2,L1,V0,M1} { function( skol2 ) }.
% 0.69/1.08 (435) {G0,W2,D2,L1,V0,M1} { epsilon_transitive( skol3 ) }.
% 0.69/1.08 (436) {G0,W2,D2,L1,V0,M1} { epsilon_connected( skol3 ) }.
% 0.69/1.08 (437) {G0,W2,D2,L1,V0,M1} { ordinal( skol3 ) }.
% 0.69/1.08 (438) {G0,W2,D2,L1,V0,M1} { empty( skol4 ) }.
% 0.69/1.08 (439) {G0,W2,D2,L1,V0,M1} { relation( skol4 ) }.
% 0.69/1.08 (440) {G0,W2,D2,L1,V0,M1} { empty( skol5 ) }.
% 0.69/1.08 (441) {G0,W2,D2,L1,V0,M1} { relation( skol6 ) }.
% 0.69/1.08 (442) {G0,W2,D2,L1,V0,M1} { empty( skol6 ) }.
% 0.69/1.08 (443) {G0,W2,D2,L1,V0,M1} { function( skol6 ) }.
% 0.69/1.08 (444) {G0,W2,D2,L1,V0,M1} { ! empty( skol7 ) }.
% 0.69/1.08 (445) {G0,W2,D2,L1,V0,M1} { relation( skol7 ) }.
% 0.69/1.08 (446) {G0,W2,D2,L1,V0,M1} { ! empty( skol8 ) }.
% 0.69/1.08 (447) {G0,W2,D2,L1,V0,M1} { relation( skol9 ) }.
% 0.69/1.08 (448) {G0,W2,D2,L1,V0,M1} { function( skol9 ) }.
% 0.69/1.08 (449) {G0,W2,D2,L1,V0,M1} { one_to_one( skol9 ) }.
% 0.69/1.08 (450) {G0,W2,D2,L1,V0,M1} { relation( skol10 ) }.
% 0.69/1.08 (451) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol10 ) }.
% 0.69/1.08 (452) {G0,W2,D2,L1,V0,M1} { relation( skol11 ) }.
% 0.69/1.08 (453) {G0,W2,D2,L1,V0,M1} { relation_empty_yielding( skol11 ) }.
% 0.69/1.08 (454) {G0,W2,D2,L1,V0,M1} { function( skol11 ) }.
% 0.69/1.08 (455) {G0,W2,D2,L1,V0,M1} { relation( skol12 ) }.
% 0.69/1.08 (456) {G0,W2,D2,L1,V0,M1} { relation_non_empty( skol12 ) }.
% 0.69/1.08 (457) {G0,W2,D2,L1,V0,M1} { function( skol12 ) }.
% 0.69/1.08 (458) {G0,W10,D2,L4,V2,M4} { ! ordinal( X ), ! ordinal( Y ), !
% 0.69/1.08 ordinal_subset( X, Y ), subset( X, Y ) }.
% 0.69/1.08 (459) {G0,W10,D2,L4,V2,M4} { ! ordinal( X ), ! ordinal( Y ), ! subset( X,
% 0.69/1.08 Y ), ordinal_subset( X, Y ) }.
% 0.69/1.08 (460) {G0,W7,D2,L3,V2,M3} { ! ordinal( X ), ! ordinal( Y ), ordinal_subset
% 0.69/1.08 ( X, X ) }.
% 0.69/1.08 (461) {G0,W3,D2,L1,V1,M1} { subset( X, X ) }.
% 0.69/1.08 (462) {G0,W3,D2,L1,V1,M1} { inclusion_comparable( X, X ) }.
% 0.69/1.08 (463) {G0,W6,D2,L2,V2,M2} { ! inclusion_comparable( X, Y ),
% 0.69/1.08 inclusion_comparable( Y, X ) }.
% 0.69/1.08 (464) {G0,W6,D2,L2,V2,M2} { ! in( X, Y ), element( X, Y ) }.
% 0.69/1.08 (465) {G0,W2,D2,L1,V0,M1} { ordinal( skol13 ) }.
% 0.69/1.08 (466) {G0,W2,D2,L1,V0,M1} { ordinal( skol14 ) }.
% 0.69/1.08 (467) {G0,W3,D2,L1,V0,M1} { ! inclusion_comparable( skol13, skol14 ) }.
% 0.69/1.08 (468) {G0,W8,D2,L3,V2,M3} { ! element( X, Y ), empty( Y ), in( X, Y ) }.
% 0.69/1.08 (469) {G0,W7,D3,L2,V2,M2} { ! element( X, powerset( Y ) ), subset( X, Y )
% 0.69/1.08 }.
% 0.69/1.08 (470) {G0,W7,D3,L2,V2,M2} { ! subset( X, Y ), element( X, powerset( Y ) )
% 0.69/1.08 }.
% 0.69/1.08 (471) {G0,W10,D3,L3,V3,M3} { ! in( X, Z ), ! element( Z, powerset( Y ) ),
% 0.69/1.08 element( X, Y ) }.
% 0.69/1.08 (472) {G0,W9,D3,L3,V3,M3} { ! in( X, Y ), ! element( Y, powerset( Z ) ), !
% 0.69/1.08 empty( Z ) }.
% 0.69/1.08 (473) {G0,W5,D2,L2,V1,M2} { ! empty( X ), X = empty_set }.
% 0.69/1.08 (474) {G0,W5,D2,L2,V2,M2} { ! in( X, Y ), ! empty( Y ) }.
% 0.69/1.08 (475) {G0,W7,D2,L3,V2,M3} { ! empty( X ), X = Y, ! empty( Y ) }.
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08 Total Proof:
% 0.69/1.08
% 0.69/1.08 subsumption: (7) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ),
% 0.69/1.08 ordinal_subset( X, Y ), ordinal_subset( Y, X ) }.
% 0.69/1.08 parent0: (422) {G0,W10,D2,L4,V2,M4} { ! ordinal( X ), ! ordinal( Y ),
% 0.69/1.08 ordinal_subset( X, Y ), ordinal_subset( Y, X ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 X := X
% 0.69/1.08 Y := Y
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 1 ==> 1
% 0.69/1.08 2 ==> 2
% 0.69/1.08 3 ==> 3
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 subsumption: (9) {G0,W6,D2,L2,V2,M2} I { ! subset( X, Y ),
% 0.69/1.08 inclusion_comparable( X, Y ) }.
% 0.69/1.08 parent0: (424) {G0,W6,D2,L2,V2,M2} { ! subset( X, Y ),
% 0.69/1.08 inclusion_comparable( X, Y ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 X := X
% 0.69/1.08 Y := Y
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 1 ==> 1
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 subsumption: (10) {G0,W6,D2,L2,V2,M2} I { ! subset( Y, X ),
% 0.69/1.08 inclusion_comparable( X, Y ) }.
% 0.69/1.08 parent0: (425) {G0,W6,D2,L2,V2,M2} { ! subset( Y, X ),
% 0.69/1.08 inclusion_comparable( X, Y ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 X := X
% 0.69/1.08 Y := Y
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 1 ==> 1
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 subsumption: (40) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ),
% 0.69/1.08 ! ordinal_subset( X, Y ), subset( X, Y ) }.
% 0.69/1.08 parent0: (458) {G0,W10,D2,L4,V2,M4} { ! ordinal( X ), ! ordinal( Y ), !
% 0.69/1.08 ordinal_subset( X, Y ), subset( X, Y ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 X := X
% 0.69/1.08 Y := Y
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 1 ==> 1
% 0.69/1.08 2 ==> 2
% 0.69/1.08 3 ==> 3
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 subsumption: (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol13 ) }.
% 0.69/1.08 parent0: (465) {G0,W2,D2,L1,V0,M1} { ordinal( skol13 ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 subsumption: (48) {G0,W2,D2,L1,V0,M1} I { ordinal( skol14 ) }.
% 0.69/1.08 parent0: (466) {G0,W2,D2,L1,V0,M1} { ordinal( skol14 ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 subsumption: (49) {G0,W3,D2,L1,V0,M1} I { ! inclusion_comparable( skol13,
% 0.69/1.08 skol14 ) }.
% 0.69/1.08 parent0: (467) {G0,W3,D2,L1,V0,M1} { ! inclusion_comparable( skol13,
% 0.69/1.08 skol14 ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 resolution: (520) {G1,W8,D2,L3,V1,M3} { ! ordinal( X ), ordinal_subset(
% 0.69/1.08 skol14, X ), ordinal_subset( X, skol14 ) }.
% 0.69/1.08 parent0[0]: (7) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ),
% 0.69/1.08 ordinal_subset( X, Y ), ordinal_subset( Y, X ) }.
% 0.69/1.08 parent1[0]: (48) {G0,W2,D2,L1,V0,M1} I { ordinal( skol14 ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 X := skol14
% 0.69/1.08 Y := X
% 0.69/1.08 end
% 0.69/1.08 substitution1:
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 subsumption: (71) {G1,W8,D2,L3,V1,M3} R(7,48) { ! ordinal( X ),
% 0.69/1.08 ordinal_subset( skol14, X ), ordinal_subset( X, skol14 ) }.
% 0.69/1.08 parent0: (520) {G1,W8,D2,L3,V1,M3} { ! ordinal( X ), ordinal_subset(
% 0.69/1.08 skol14, X ), ordinal_subset( X, skol14 ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 X := X
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 1 ==> 1
% 0.69/1.08 2 ==> 2
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 resolution: (522) {G1,W3,D2,L1,V0,M1} { ! subset( skol13, skol14 ) }.
% 0.69/1.08 parent0[0]: (49) {G0,W3,D2,L1,V0,M1} I { ! inclusion_comparable( skol13,
% 0.69/1.08 skol14 ) }.
% 0.69/1.08 parent1[1]: (9) {G0,W6,D2,L2,V2,M2} I { ! subset( X, Y ),
% 0.69/1.08 inclusion_comparable( X, Y ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 end
% 0.69/1.08 substitution1:
% 0.69/1.08 X := skol13
% 0.69/1.08 Y := skol14
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 subsumption: (77) {G1,W3,D2,L1,V0,M1} R(49,9) { ! subset( skol13, skol14 )
% 0.69/1.08 }.
% 0.69/1.08 parent0: (522) {G1,W3,D2,L1,V0,M1} { ! subset( skol13, skol14 ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 resolution: (523) {G1,W3,D2,L1,V0,M1} { ! subset( skol14, skol13 ) }.
% 0.69/1.08 parent0[0]: (49) {G0,W3,D2,L1,V0,M1} I { ! inclusion_comparable( skol13,
% 0.69/1.08 skol14 ) }.
% 0.69/1.08 parent1[1]: (10) {G0,W6,D2,L2,V2,M2} I { ! subset( Y, X ),
% 0.69/1.08 inclusion_comparable( X, Y ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 end
% 0.69/1.08 substitution1:
% 0.69/1.08 X := skol13
% 0.69/1.08 Y := skol14
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 subsumption: (78) {G1,W3,D2,L1,V0,M1} R(10,49) { ! subset( skol14, skol13 )
% 0.69/1.08 }.
% 0.69/1.08 parent0: (523) {G1,W3,D2,L1,V0,M1} { ! subset( skol14, skol13 ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 end
% 0.69/1.08 permutation0:
% 0.69/1.08 0 ==> 0
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 resolution: (524) {G1,W7,D2,L3,V0,M3} { ! ordinal( skol13 ), ! ordinal(
% 0.69/1.08 skol14 ), ! ordinal_subset( skol13, skol14 ) }.
% 0.69/1.08 parent0[0]: (77) {G1,W3,D2,L1,V0,M1} R(49,9) { ! subset( skol13, skol14 )
% 0.69/1.08 }.
% 0.69/1.08 parent1[3]: (40) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ), !
% 0.69/1.08 ordinal_subset( X, Y ), subset( X, Y ) }.
% 0.69/1.08 substitution0:
% 0.69/1.08 end
% 0.69/1.08 substitution1:
% 0.69/1.08 X := skol13
% 0.69/1.08 Y := skol14
% 0.69/1.08 end
% 0.69/1.08
% 0.69/1.08 resolution: (525) {G1,W5,D2,L2,V0,M2} { ! ordinal( skol14 ), !
% 0.69/1.08 ordinal_subset( skol13, skol14 ) }.
% 0.69/1.08 parent0[0]: (524) {G1,W7,D2,L3,V0,M3} { ! ordinal( skol13 ), ! ordinal(
% 0.69/1.08 skol14 ), ! ordinal_subset( skol13, skol14 ) }.
% 0.69/1.08 parent1[0]: (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol13 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (84) {G2,W5,D2,L2,V0,M2} R(40,77);r(47) { ! ordinal( skol14 )
% 0.69/1.09 , ! ordinal_subset( skol13, skol14 ) }.
% 0.69/1.09 parent0: (525) {G1,W5,D2,L2,V0,M2} { ! ordinal( skol14 ), ! ordinal_subset
% 0.69/1.09 ( skol13, skol14 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 1 ==> 1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (526) {G1,W3,D2,L1,V0,M1} { ! ordinal_subset( skol13, skol14 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (84) {G2,W5,D2,L2,V0,M2} R(40,77);r(47) { ! ordinal( skol14 ),
% 0.69/1.09 ! ordinal_subset( skol13, skol14 ) }.
% 0.69/1.09 parent1[0]: (48) {G0,W2,D2,L1,V0,M1} I { ordinal( skol14 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (400) {G3,W3,D2,L1,V0,M1} S(84);r(48) { ! ordinal_subset(
% 0.69/1.09 skol13, skol14 ) }.
% 0.69/1.09 parent0: (526) {G1,W3,D2,L1,V0,M1} { ! ordinal_subset( skol13, skol14 )
% 0.69/1.09 }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (527) {G2,W5,D2,L2,V0,M2} { ! ordinal( skol13 ),
% 0.69/1.09 ordinal_subset( skol14, skol13 ) }.
% 0.69/1.09 parent0[0]: (400) {G3,W3,D2,L1,V0,M1} S(84);r(48) { ! ordinal_subset(
% 0.69/1.09 skol13, skol14 ) }.
% 0.69/1.09 parent1[2]: (71) {G1,W8,D2,L3,V1,M3} R(7,48) { ! ordinal( X ),
% 0.69/1.09 ordinal_subset( skol14, X ), ordinal_subset( X, skol14 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 X := skol13
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (528) {G1,W3,D2,L1,V0,M1} { ordinal_subset( skol14, skol13 )
% 0.69/1.09 }.
% 0.69/1.09 parent0[0]: (527) {G2,W5,D2,L2,V0,M2} { ! ordinal( skol13 ),
% 0.69/1.09 ordinal_subset( skol14, skol13 ) }.
% 0.69/1.09 parent1[0]: (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol13 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (401) {G4,W3,D2,L1,V0,M1} R(400,71);r(47) { ordinal_subset(
% 0.69/1.09 skol14, skol13 ) }.
% 0.69/1.09 parent0: (528) {G1,W3,D2,L1,V0,M1} { ordinal_subset( skol14, skol13 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (529) {G1,W7,D2,L3,V0,M3} { ! ordinal( skol14 ), ! ordinal(
% 0.69/1.09 skol13 ), subset( skol14, skol13 ) }.
% 0.69/1.09 parent0[2]: (40) {G0,W10,D2,L4,V2,M4} I { ! ordinal( X ), ! ordinal( Y ), !
% 0.69/1.09 ordinal_subset( X, Y ), subset( X, Y ) }.
% 0.69/1.09 parent1[0]: (401) {G4,W3,D2,L1,V0,M1} R(400,71);r(47) { ordinal_subset(
% 0.69/1.09 skol14, skol13 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 X := skol14
% 0.69/1.09 Y := skol13
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (530) {G1,W5,D2,L2,V0,M2} { ! ordinal( skol13 ), subset(
% 0.69/1.09 skol14, skol13 ) }.
% 0.69/1.09 parent0[0]: (529) {G1,W7,D2,L3,V0,M3} { ! ordinal( skol14 ), ! ordinal(
% 0.69/1.09 skol13 ), subset( skol14, skol13 ) }.
% 0.69/1.09 parent1[0]: (48) {G0,W2,D2,L1,V0,M1} I { ordinal( skol14 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (406) {G5,W5,D2,L2,V0,M2} R(401,40);r(48) { ! ordinal( skol13
% 0.69/1.09 ), subset( skol14, skol13 ) }.
% 0.69/1.09 parent0: (530) {G1,W5,D2,L2,V0,M2} { ! ordinal( skol13 ), subset( skol14,
% 0.69/1.09 skol13 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 0 ==> 0
% 0.69/1.09 1 ==> 1
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (531) {G1,W3,D2,L1,V0,M1} { subset( skol14, skol13 ) }.
% 0.69/1.09 parent0[0]: (406) {G5,W5,D2,L2,V0,M2} R(401,40);r(48) { ! ordinal( skol13 )
% 0.69/1.09 , subset( skol14, skol13 ) }.
% 0.69/1.09 parent1[0]: (47) {G0,W2,D2,L1,V0,M1} I { ordinal( skol13 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 resolution: (532) {G2,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 parent0[0]: (78) {G1,W3,D2,L1,V0,M1} R(10,49) { ! subset( skol14, skol13 )
% 0.69/1.09 }.
% 0.69/1.09 parent1[0]: (531) {G1,W3,D2,L1,V0,M1} { subset( skol14, skol13 ) }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 substitution1:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 subsumption: (411) {G6,W0,D0,L0,V0,M0} S(406);r(47);r(78) { }.
% 0.69/1.09 parent0: (532) {G2,W0,D0,L0,V0,M0} { }.
% 0.69/1.09 substitution0:
% 0.69/1.09 end
% 0.69/1.09 permutation0:
% 0.69/1.09 end
% 0.69/1.09
% 0.69/1.09 Proof check complete!
% 0.69/1.09
% 0.69/1.09 Memory use:
% 0.69/1.09
% 0.69/1.09 space for terms: 4403
% 0.69/1.09 space for clauses: 18378
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 clauses generated: 1261
% 0.69/1.09 clauses kept: 412
% 0.69/1.09 clauses selected: 138
% 0.69/1.09 clauses deleted: 4
% 0.69/1.09 clauses inuse deleted: 0
% 0.69/1.09
% 0.69/1.09 subsentry: 1640
% 0.69/1.09 literals s-matched: 1250
% 0.69/1.09 literals matched: 1098
% 0.69/1.09 full subsumption: 238
% 0.69/1.09
% 0.69/1.09 checksum: -1942645313
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksem ended
%------------------------------------------------------------------------------