%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU244+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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 : Tue Jul 19 07:11:50 EDT 2022
% Result : Theorem 0.46s 1.15s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU244+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : bliksem %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Mon Jun 20 10:15:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.15 *** allocated 10000 integers for termspace/termends
% 0.46/1.15 *** allocated 10000 integers for clauses
% 0.46/1.15 *** allocated 10000 integers for justifications
% 0.46/1.15 Bliksem 1.12
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 Automatic Strategy Selection
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 Clauses:
% 0.46/1.15
% 0.46/1.15 { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.46/1.15 { ! relation( X ), ! antisymmetric( X ), is_antisymmetric_in( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 { ! relation( X ), ! is_antisymmetric_in( X, relation_field( X ) ),
% 0.46/1.15 antisymmetric( X ) }.
% 0.46/1.15 { ! relation( X ), ! connected( X ), is_connected_in( X, relation_field( X
% 0.46/1.15 ) ) }.
% 0.46/1.15 { ! relation( X ), ! is_connected_in( X, relation_field( X ) ), connected(
% 0.46/1.15 X ) }.
% 0.46/1.15 { ! relation( X ), ! transitive( X ), is_transitive_in( X, relation_field(
% 0.46/1.15 X ) ) }.
% 0.46/1.15 { ! relation( X ), ! is_transitive_in( X, relation_field( X ) ), transitive
% 0.46/1.15 ( X ) }.
% 0.46/1.15 { ! relation( X ), ! well_ordering( X ), reflexive( X ) }.
% 0.46/1.15 { ! relation( X ), ! well_ordering( X ), alpha1( X ) }.
% 0.46/1.15 { ! relation( X ), ! reflexive( X ), ! alpha1( X ), well_ordering( X ) }.
% 0.46/1.15 { ! alpha1( X ), transitive( X ) }.
% 0.46/1.15 { ! alpha1( X ), alpha3( X ) }.
% 0.46/1.15 { ! transitive( X ), ! alpha3( X ), alpha1( X ) }.
% 0.46/1.15 { ! alpha3( X ), antisymmetric( X ) }.
% 0.46/1.15 { ! alpha3( X ), alpha5( X ) }.
% 0.46/1.15 { ! antisymmetric( X ), ! alpha5( X ), alpha3( X ) }.
% 0.46/1.15 { ! alpha5( X ), connected( X ) }.
% 0.46/1.15 { ! alpha5( X ), well_founded_relation( X ) }.
% 0.46/1.15 { ! connected( X ), ! well_founded_relation( X ), alpha5( X ) }.
% 0.46/1.15 { ! relation( X ), ! well_orders( X, Y ), is_reflexive_in( X, Y ) }.
% 0.46/1.15 { ! relation( X ), ! well_orders( X, Y ), alpha2( X, Y ) }.
% 0.46/1.15 { ! relation( X ), ! is_reflexive_in( X, Y ), ! alpha2( X, Y ), well_orders
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 { ! alpha2( X, Y ), is_transitive_in( X, Y ) }.
% 0.46/1.15 { ! alpha2( X, Y ), alpha4( X, Y ) }.
% 0.46/1.15 { ! is_transitive_in( X, Y ), ! alpha4( X, Y ), alpha2( X, Y ) }.
% 0.46/1.15 { ! alpha4( X, Y ), is_antisymmetric_in( X, Y ) }.
% 0.46/1.15 { ! alpha4( X, Y ), alpha6( X, Y ) }.
% 0.46/1.15 { ! is_antisymmetric_in( X, Y ), ! alpha6( X, Y ), alpha4( X, Y ) }.
% 0.46/1.15 { ! alpha6( X, Y ), is_connected_in( X, Y ) }.
% 0.46/1.15 { ! alpha6( X, Y ), is_well_founded_in( X, Y ) }.
% 0.46/1.15 { ! is_connected_in( X, Y ), ! is_well_founded_in( X, Y ), alpha6( X, Y ) }
% 0.46/1.15 .
% 0.46/1.15 { ! relation( X ), relation_field( X ) = set_union2( relation_dom( X ),
% 0.46/1.15 relation_rng( X ) ) }.
% 0.46/1.15 { ! relation( X ), ! reflexive( X ), is_reflexive_in( X, relation_field( X
% 0.46/1.15 ) ) }.
% 0.46/1.15 { ! relation( X ), ! is_reflexive_in( X, relation_field( X ) ), reflexive(
% 0.46/1.15 X ) }.
% 0.46/1.15 { && }.
% 0.46/1.15 { && }.
% 0.46/1.15 { && }.
% 0.46/1.15 { && }.
% 0.46/1.15 { set_union2( X, X ) = X }.
% 0.46/1.15 { ! relation( X ), ! well_founded_relation( X ), is_well_founded_in( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 { ! relation( X ), ! is_well_founded_in( X, relation_field( X ) ),
% 0.46/1.15 well_founded_relation( X ) }.
% 0.46/1.15 { relation( skol1 ) }.
% 0.46/1.15 { alpha7( skol1 ), well_ordering( skol1 ) }.
% 0.46/1.15 { alpha7( skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 { ! alpha7( X ), well_orders( X, relation_field( X ) ) }.
% 0.46/1.15 { ! alpha7( X ), ! well_ordering( X ) }.
% 0.46/1.15 { ! well_orders( X, relation_field( X ) ), well_ordering( X ), alpha7( X )
% 0.46/1.15 }.
% 0.46/1.15
% 0.46/1.15 percentage equality = 0.027523, percentage horn = 0.954545
% 0.46/1.15 This is a problem with some equality
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 Options Used:
% 0.46/1.15
% 0.46/1.15 useres = 1
% 0.46/1.15 useparamod = 1
% 0.46/1.15 useeqrefl = 1
% 0.46/1.15 useeqfact = 1
% 0.46/1.15 usefactor = 1
% 0.46/1.15 usesimpsplitting = 0
% 0.46/1.15 usesimpdemod = 5
% 0.46/1.15 usesimpres = 3
% 0.46/1.15
% 0.46/1.15 resimpinuse = 1000
% 0.46/1.15 resimpclauses = 20000
% 0.46/1.15 substype = eqrewr
% 0.46/1.15 backwardsubs = 1
% 0.46/1.15 selectoldest = 5
% 0.46/1.15
% 0.46/1.15 litorderings [0] = split
% 0.46/1.15 litorderings [1] = extend the termordering, first sorting on arguments
% 0.46/1.15
% 0.46/1.15 termordering = kbo
% 0.46/1.15
% 0.46/1.15 litapriori = 0
% 0.46/1.15 termapriori = 1
% 0.46/1.15 litaposteriori = 0
% 0.46/1.15 termaposteriori = 0
% 0.46/1.15 demodaposteriori = 0
% 0.46/1.15 ordereqreflfact = 0
% 0.46/1.15
% 0.46/1.15 litselect = negord
% 0.46/1.15
% 0.46/1.15 maxweight = 15
% 0.46/1.15 maxdepth = 30000
% 0.46/1.15 maxlength = 115
% 0.46/1.15 maxnrvars = 195
% 0.46/1.15 excuselevel = 1
% 0.46/1.15 increasemaxweight = 1
% 0.46/1.15
% 0.46/1.15 maxselected = 10000000
% 0.46/1.15 maxnrclauses = 10000000
% 0.46/1.15
% 0.46/1.15 showgenerated = 0
% 0.46/1.15 showkept = 0
% 0.46/1.15 showselected = 0
% 0.46/1.15 showdeleted = 0
% 0.46/1.15 showresimp = 1
% 0.46/1.15 showstatus = 2000
% 0.46/1.15
% 0.46/1.15 prologoutput = 0
% 0.46/1.15 nrgoals = 5000000
% 0.46/1.15 totalproof = 1
% 0.46/1.15
% 0.46/1.15 Symbols occurring in the translation:
% 0.46/1.15
% 0.46/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.15 . [1, 2] (w:1, o:28, a:1, s:1, b:0),
% 0.46/1.15 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.46/1.15 ! [4, 1] (w:0, o:9, a:1, s:1, b:0),
% 0.46/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.15 set_union2 [37, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.46/1.15 relation [38, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.46/1.15 antisymmetric [39, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.46/1.15 relation_field [40, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.46/1.15 is_antisymmetric_in [41, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.46/1.15 connected [42, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.46/1.15 is_connected_in [43, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.46/1.15 transitive [44, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.46/1.15 is_transitive_in [45, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.46/1.15 well_ordering [46, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.46/1.15 reflexive [47, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.46/1.15 well_founded_relation [48, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.46/1.15 well_orders [49, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.46/1.15 is_reflexive_in [50, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.46/1.15 is_well_founded_in [51, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.46/1.15 relation_dom [52, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.46/1.15 relation_rng [53, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.46/1.15 alpha1 [54, 1] (w:1, o:24, a:1, s:1, b:1),
% 0.46/1.15 alpha2 [55, 2] (w:1, o:59, a:1, s:1, b:1),
% 0.46/1.15 alpha3 [56, 1] (w:1, o:25, a:1, s:1, b:1),
% 0.46/1.15 alpha4 [57, 2] (w:1, o:60, a:1, s:1, b:1),
% 0.46/1.15 alpha5 [58, 1] (w:1, o:26, a:1, s:1, b:1),
% 0.46/1.15 alpha6 [59, 2] (w:1, o:61, a:1, s:1, b:1),
% 0.46/1.15 alpha7 [60, 1] (w:1, o:27, a:1, s:1, b:1),
% 0.46/1.15 skol1 [61, 0] (w:1, o:8, a:1, s:1, b:1).
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 Starting Search:
% 0.46/1.15
% 0.46/1.15 *** allocated 15000 integers for clauses
% 0.46/1.15 *** allocated 22500 integers for clauses
% 0.46/1.15
% 0.46/1.15 Bliksems!, er is een bewijs:
% 0.46/1.15 % SZS status Theorem
% 0.46/1.15 % SZS output start Refutation
% 0.46/1.15
% 0.46/1.15 (1) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! antisymmetric( X ),
% 0.46/1.15 is_antisymmetric_in( X, relation_field( X ) ) }.
% 0.46/1.15 (2) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! is_antisymmetric_in( X,
% 0.46/1.15 relation_field( X ) ), antisymmetric( X ) }.
% 0.46/1.15 (3) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! connected( X ),
% 0.46/1.15 is_connected_in( X, relation_field( X ) ) }.
% 0.46/1.15 (4) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! is_connected_in( X,
% 0.46/1.15 relation_field( X ) ), connected( X ) }.
% 0.46/1.15 (5) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! transitive( X ),
% 0.46/1.15 is_transitive_in( X, relation_field( X ) ) }.
% 0.46/1.15 (6) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! is_transitive_in( X,
% 0.46/1.15 relation_field( X ) ), transitive( X ) }.
% 0.46/1.15 (7) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering( X ),
% 0.46/1.15 reflexive( X ) }.
% 0.46/1.15 (8) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering( X ), alpha1(
% 0.46/1.15 X ) }.
% 0.46/1.15 (9) {G0,W8,D2,L4,V1,M4} I { ! relation( X ), ! reflexive( X ), ! alpha1( X
% 0.46/1.15 ), well_ordering( X ) }.
% 0.46/1.15 (10) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), transitive( X ) }.
% 0.46/1.15 (11) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha3( X ) }.
% 0.46/1.15 (12) {G0,W6,D2,L3,V1,M3} I { ! transitive( X ), ! alpha3( X ), alpha1( X )
% 0.46/1.15 }.
% 0.46/1.15 (13) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), antisymmetric( X ) }.
% 0.46/1.15 (14) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), alpha5( X ) }.
% 0.46/1.15 (15) {G0,W6,D2,L3,V1,M3} I { ! antisymmetric( X ), ! alpha5( X ), alpha3( X
% 0.46/1.15 ) }.
% 0.46/1.15 (16) {G0,W4,D2,L2,V1,M2} I { ! alpha5( X ), connected( X ) }.
% 0.46/1.15 (17) {G0,W4,D2,L2,V1,M2} I { ! alpha5( X ), well_founded_relation( X ) }.
% 0.46/1.15 (18) {G0,W6,D2,L3,V1,M3} I { ! connected( X ), ! well_founded_relation( X )
% 0.46/1.15 , alpha5( X ) }.
% 0.46/1.15 (19) {G0,W8,D2,L3,V2,M3} I { ! relation( X ), ! well_orders( X, Y ),
% 0.46/1.15 is_reflexive_in( X, Y ) }.
% 0.46/1.15 (20) {G0,W8,D2,L3,V2,M3} I { ! relation( X ), ! well_orders( X, Y ), alpha2
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 (21) {G0,W11,D2,L4,V2,M4} I { ! relation( X ), ! is_reflexive_in( X, Y ), !
% 0.46/1.15 alpha2( X, Y ), well_orders( X, Y ) }.
% 0.46/1.15 (22) {G0,W6,D2,L2,V2,M2} I { ! alpha2( X, Y ), is_transitive_in( X, Y ) }.
% 0.46/1.15 (23) {G0,W6,D2,L2,V2,M2} I { ! alpha2( X, Y ), alpha4( X, Y ) }.
% 0.46/1.15 (24) {G0,W9,D2,L3,V2,M3} I { ! is_transitive_in( X, Y ), ! alpha4( X, Y ),
% 0.46/1.15 alpha2( X, Y ) }.
% 0.46/1.15 (25) {G0,W6,D2,L2,V2,M2} I { ! alpha4( X, Y ), is_antisymmetric_in( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 (26) {G0,W6,D2,L2,V2,M2} I { ! alpha4( X, Y ), alpha6( X, Y ) }.
% 0.46/1.15 (27) {G0,W9,D2,L3,V2,M3} I { ! is_antisymmetric_in( X, Y ), ! alpha6( X, Y
% 0.46/1.15 ), alpha4( X, Y ) }.
% 0.46/1.15 (28) {G0,W6,D2,L2,V2,M2} I { ! alpha6( X, Y ), is_connected_in( X, Y ) }.
% 0.46/1.15 (29) {G0,W6,D2,L2,V2,M2} I { ! alpha6( X, Y ), is_well_founded_in( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 (30) {G0,W9,D2,L3,V2,M3} I { ! is_connected_in( X, Y ), !
% 0.46/1.15 is_well_founded_in( X, Y ), alpha6( X, Y ) }.
% 0.46/1.15 (32) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! reflexive( X ),
% 0.46/1.15 is_reflexive_in( X, relation_field( X ) ) }.
% 0.46/1.15 (33) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! is_reflexive_in( X,
% 0.46/1.15 relation_field( X ) ), reflexive( X ) }.
% 0.46/1.15 (36) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! well_founded_relation( X )
% 0.46/1.15 , is_well_founded_in( X, relation_field( X ) ) }.
% 0.46/1.15 (37) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! is_well_founded_in( X,
% 0.46/1.15 relation_field( X ) ), well_founded_relation( X ) }.
% 0.46/1.15 (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 (39) {G0,W4,D2,L2,V0,M2} I { alpha7( skol1 ), well_ordering( skol1 ) }.
% 0.46/1.15 (40) {G0,W6,D3,L2,V0,M2} I { alpha7( skol1 ), ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 (41) {G0,W6,D3,L2,V1,M2} I { ! alpha7( X ), well_orders( X, relation_field
% 0.46/1.15 ( X ) ) }.
% 0.46/1.15 (42) {G0,W4,D2,L2,V1,M2} I { ! alpha7( X ), ! well_ordering( X ) }.
% 0.46/1.15 (44) {G1,W4,D2,L2,V1,M2} R(14,16) { ! alpha3( X ), connected( X ) }.
% 0.46/1.15 (45) {G1,W4,D2,L2,V1,M2} R(14,17) { ! alpha3( X ), well_founded_relation( X
% 0.46/1.15 ) }.
% 0.46/1.15 (48) {G1,W4,D2,L2,V1,M2} R(11,13) { ! alpha1( X ), antisymmetric( X ) }.
% 0.46/1.15 (49) {G2,W4,D2,L2,V1,M2} R(11,45) { ! alpha1( X ), well_founded_relation( X
% 0.46/1.15 ) }.
% 0.46/1.15 (50) {G2,W4,D2,L2,V1,M2} R(11,44) { ! alpha1( X ), connected( X ) }.
% 0.46/1.15 (58) {G1,W6,D2,L2,V2,M2} R(26,28) { ! alpha4( X, Y ), is_connected_in( X, Y
% 0.46/1.15 ) }.
% 0.46/1.15 (59) {G1,W6,D2,L2,V2,M2} R(26,29) { ! alpha4( X, Y ), is_well_founded_in( X
% 0.46/1.15 , Y ) }.
% 0.46/1.15 (64) {G1,W6,D2,L2,V2,M2} R(23,25) { ! alpha2( X, Y ), is_antisymmetric_in(
% 0.46/1.15 X, Y ) }.
% 0.46/1.15 (65) {G2,W6,D2,L2,V2,M2} R(23,59) { ! alpha2( X, Y ), is_well_founded_in( X
% 0.46/1.15 , Y ) }.
% 0.46/1.15 (66) {G2,W6,D2,L2,V2,M2} R(23,58) { ! alpha2( X, Y ), is_connected_in( X, Y
% 0.46/1.15 ) }.
% 0.46/1.15 (79) {G1,W4,D2,L2,V0,M2} R(8,39);r(38) { alpha1( skol1 ), alpha7( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 (87) {G1,W4,D2,L2,V0,M2} R(7,39);r(38) { reflexive( skol1 ), alpha7( skol1
% 0.46/1.15 ) }.
% 0.46/1.15 (89) {G2,W4,D2,L2,V0,M2} R(79,10) { alpha7( skol1 ), transitive( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 (91) {G3,W4,D2,L2,V0,M2} R(79,50) { alpha7( skol1 ), connected( skol1 ) }.
% 0.46/1.15 (92) {G3,W4,D2,L2,V0,M2} R(79,49) { alpha7( skol1 ), well_founded_relation
% 0.46/1.15 ( skol1 ) }.
% 0.46/1.15 (93) {G2,W4,D2,L2,V0,M2} R(79,48) { alpha7( skol1 ), antisymmetric( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 (95) {G3,W6,D3,L2,V0,M2} R(89,5);r(38) { alpha7( skol1 ), is_transitive_in
% 0.46/1.15 ( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 (99) {G1,W6,D2,L3,V0,M3} R(9,38) { ! reflexive( skol1 ), ! alpha1( skol1 )
% 0.46/1.15 , well_ordering( skol1 ) }.
% 0.46/1.15 (106) {G1,W6,D2,L2,V1,M2} R(19,38) { ! well_orders( skol1, X ),
% 0.46/1.15 is_reflexive_in( skol1, X ) }.
% 0.46/1.15 (107) {G4,W6,D3,L2,V0,M2} R(91,3);r(38) { alpha7( skol1 ), is_connected_in
% 0.46/1.15 ( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 (108) {G3,W6,D3,L2,V0,M2} R(93,1);r(38) { alpha7( skol1 ),
% 0.46/1.15 is_antisymmetric_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 (116) {G1,W6,D2,L2,V1,M2} R(20,38) { ! well_orders( skol1, X ), alpha2(
% 0.46/1.15 skol1, X ) }.
% 0.46/1.15 (120) {G2,W6,D2,L2,V1,M2} R(116,22) { ! well_orders( skol1, X ),
% 0.46/1.15 is_transitive_in( skol1, X ) }.
% 0.46/1.15 (122) {G3,W6,D2,L2,V1,M2} R(116,66) { ! well_orders( skol1, X ),
% 0.46/1.15 is_connected_in( skol1, X ) }.
% 0.46/1.15 (123) {G3,W6,D2,L2,V1,M2} R(116,65) { ! well_orders( skol1, X ),
% 0.46/1.15 is_well_founded_in( skol1, X ) }.
% 0.46/1.15 (124) {G2,W6,D2,L2,V1,M2} R(116,64) { ! well_orders( skol1, X ),
% 0.46/1.15 is_antisymmetric_in( skol1, X ) }.
% 0.46/1.15 (126) {G3,W6,D3,L2,V0,M2} R(120,6);r(38) { ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ), transitive( skol1 ) }.
% 0.46/1.15 (127) {G4,W6,D3,L2,V0,M2} R(122,4);r(38) { ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ), connected( skol1 ) }.
% 0.46/1.15 (130) {G3,W6,D3,L2,V0,M2} R(124,2);r(38) { ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ), antisymmetric( skol1 ) }.
% 0.46/1.15 (139) {G2,W6,D2,L3,V0,M3} R(99,42) { ! reflexive( skol1 ), ! alpha1( skol1
% 0.46/1.15 ), ! alpha7( skol1 ) }.
% 0.46/1.15 (145) {G4,W4,D3,L1,V0,M1} R(41,124);r(108) { is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 (147) {G5,W4,D3,L1,V0,M1} R(41,122);r(107) { is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 (149) {G4,W4,D3,L1,V0,M1} R(41,120);r(95) { is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 (153) {G4,W2,D2,L1,V0,M1} R(41,93);r(130) { antisymmetric( skol1 ) }.
% 0.46/1.15 (155) {G5,W2,D2,L1,V0,M1} R(41,91);r(127) { connected( skol1 ) }.
% 0.46/1.15 (158) {G4,W2,D2,L1,V0,M1} R(41,89);r(126) { transitive( skol1 ) }.
% 0.46/1.15 (169) {G5,W4,D2,L2,V0,M2} R(158,12) { ! alpha3( skol1 ), alpha1( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 (170) {G6,W6,D2,L3,V0,M3} R(169,139) { ! alpha3( skol1 ), ! reflexive(
% 0.46/1.15 skol1 ), ! alpha7( skol1 ) }.
% 0.46/1.15 (172) {G6,W4,D2,L2,V0,M2} R(169,15);r(153) { alpha1( skol1 ), ! alpha5(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 (175) {G7,W4,D2,L2,V0,M2} R(172,18);r(155) { alpha1( skol1 ), !
% 0.46/1.15 well_founded_relation( skol1 ) }.
% 0.46/1.15 (178) {G8,W4,D2,L2,V0,M2} R(175,11) { ! well_founded_relation( skol1 ),
% 0.46/1.15 alpha3( skol1 ) }.
% 0.46/1.15 (181) {G2,W6,D3,L2,V0,M2} R(33,106);r(38) { reflexive( skol1 ), !
% 0.46/1.15 well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 (203) {G4,W6,D3,L2,V0,M2} R(37,123);r(38) { well_founded_relation( skol1 )
% 0.46/1.15 , ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 (213) {G7,W6,D3,L2,V0,M2} R(40,170);r(181) { ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! alpha3( skol1 ) }.
% 0.46/1.15 (219) {G9,W4,D3,L1,V0,M1} R(213,178);r(203) { ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 (249) {G10,W2,D2,L1,V0,M1} R(219,41) { ! alpha7( skol1 ) }.
% 0.46/1.15 (253) {G11,W2,D2,L1,V0,M1} R(249,92) { well_founded_relation( skol1 ) }.
% 0.46/1.15 (256) {G11,W2,D2,L1,V0,M1} R(249,87) { reflexive( skol1 ) }.
% 0.46/1.15 (258) {G12,W4,D3,L1,V0,M1} R(253,36);r(38) { is_well_founded_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 (259) {G12,W4,D3,L1,V0,M1} R(256,32);r(38) { is_reflexive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 (261) {G13,W4,D3,L1,V0,M1} R(258,30);r(147) { alpha6( skol1, relation_field
% 0.46/1.15 ( skol1 ) ) }.
% 0.46/1.15 (262) {G14,W4,D3,L1,V0,M1} R(261,27);r(145) { alpha4( skol1, relation_field
% 0.46/1.15 ( skol1 ) ) }.
% 0.46/1.15 (264) {G15,W4,D3,L1,V0,M1} R(262,24);r(149) { alpha2( skol1, relation_field
% 0.46/1.15 ( skol1 ) ) }.
% 0.46/1.15 (265) {G16,W8,D3,L2,V0,M2} R(264,21);r(38) { ! is_reflexive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), well_orders( skol1, relation_field( skol1 ) )
% 0.46/1.15 }.
% 0.46/1.15 (325) {G17,W0,D0,L0,V0,M0} S(265);r(259);r(219) { }.
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 % SZS output end Refutation
% 0.46/1.15 found a proof!
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 Unprocessed initial clauses:
% 0.46/1.15
% 0.46/1.15 (327) {G0,W7,D3,L1,V2,M1} { set_union2( X, Y ) = set_union2( Y, X ) }.
% 0.46/1.15 (328) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! antisymmetric( X ),
% 0.46/1.15 is_antisymmetric_in( X, relation_field( X ) ) }.
% 0.46/1.15 (329) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! is_antisymmetric_in( X,
% 0.46/1.15 relation_field( X ) ), antisymmetric( X ) }.
% 0.46/1.15 (330) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! connected( X ),
% 0.46/1.15 is_connected_in( X, relation_field( X ) ) }.
% 0.46/1.15 (331) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! is_connected_in( X,
% 0.46/1.15 relation_field( X ) ), connected( X ) }.
% 0.46/1.15 (332) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! transitive( X ),
% 0.46/1.15 is_transitive_in( X, relation_field( X ) ) }.
% 0.46/1.15 (333) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! is_transitive_in( X,
% 0.46/1.15 relation_field( X ) ), transitive( X ) }.
% 0.46/1.15 (334) {G0,W6,D2,L3,V1,M3} { ! relation( X ), ! well_ordering( X ),
% 0.46/1.15 reflexive( X ) }.
% 0.46/1.15 (335) {G0,W6,D2,L3,V1,M3} { ! relation( X ), ! well_ordering( X ), alpha1
% 0.46/1.15 ( X ) }.
% 0.46/1.15 (336) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! reflexive( X ), ! alpha1( X
% 0.46/1.15 ), well_ordering( X ) }.
% 0.46/1.15 (337) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), transitive( X ) }.
% 0.46/1.15 (338) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), alpha3( X ) }.
% 0.46/1.15 (339) {G0,W6,D2,L3,V1,M3} { ! transitive( X ), ! alpha3( X ), alpha1( X )
% 0.46/1.15 }.
% 0.46/1.15 (340) {G0,W4,D2,L2,V1,M2} { ! alpha3( X ), antisymmetric( X ) }.
% 0.46/1.15 (341) {G0,W4,D2,L2,V1,M2} { ! alpha3( X ), alpha5( X ) }.
% 0.46/1.15 (342) {G0,W6,D2,L3,V1,M3} { ! antisymmetric( X ), ! alpha5( X ), alpha3( X
% 0.46/1.15 ) }.
% 0.46/1.15 (343) {G0,W4,D2,L2,V1,M2} { ! alpha5( X ), connected( X ) }.
% 0.46/1.15 (344) {G0,W4,D2,L2,V1,M2} { ! alpha5( X ), well_founded_relation( X ) }.
% 0.46/1.15 (345) {G0,W6,D2,L3,V1,M3} { ! connected( X ), ! well_founded_relation( X )
% 0.46/1.15 , alpha5( X ) }.
% 0.46/1.15 (346) {G0,W8,D2,L3,V2,M3} { ! relation( X ), ! well_orders( X, Y ),
% 0.46/1.15 is_reflexive_in( X, Y ) }.
% 0.46/1.15 (347) {G0,W8,D2,L3,V2,M3} { ! relation( X ), ! well_orders( X, Y ), alpha2
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 (348) {G0,W11,D2,L4,V2,M4} { ! relation( X ), ! is_reflexive_in( X, Y ), !
% 0.46/1.15 alpha2( X, Y ), well_orders( X, Y ) }.
% 0.46/1.15 (349) {G0,W6,D2,L2,V2,M2} { ! alpha2( X, Y ), is_transitive_in( X, Y ) }.
% 0.46/1.15 (350) {G0,W6,D2,L2,V2,M2} { ! alpha2( X, Y ), alpha4( X, Y ) }.
% 0.46/1.15 (351) {G0,W9,D2,L3,V2,M3} { ! is_transitive_in( X, Y ), ! alpha4( X, Y ),
% 0.46/1.15 alpha2( X, Y ) }.
% 0.46/1.15 (352) {G0,W6,D2,L2,V2,M2} { ! alpha4( X, Y ), is_antisymmetric_in( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 (353) {G0,W6,D2,L2,V2,M2} { ! alpha4( X, Y ), alpha6( X, Y ) }.
% 0.46/1.15 (354) {G0,W9,D2,L3,V2,M3} { ! is_antisymmetric_in( X, Y ), ! alpha6( X, Y
% 0.46/1.15 ), alpha4( X, Y ) }.
% 0.46/1.15 (355) {G0,W6,D2,L2,V2,M2} { ! alpha6( X, Y ), is_connected_in( X, Y ) }.
% 0.46/1.15 (356) {G0,W6,D2,L2,V2,M2} { ! alpha6( X, Y ), is_well_founded_in( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 (357) {G0,W9,D2,L3,V2,M3} { ! is_connected_in( X, Y ), !
% 0.46/1.15 is_well_founded_in( X, Y ), alpha6( X, Y ) }.
% 0.46/1.15 (358) {G0,W10,D4,L2,V1,M2} { ! relation( X ), relation_field( X ) =
% 0.46/1.15 set_union2( relation_dom( X ), relation_rng( X ) ) }.
% 0.46/1.15 (359) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! reflexive( X ),
% 0.46/1.15 is_reflexive_in( X, relation_field( X ) ) }.
% 0.46/1.15 (360) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! is_reflexive_in( X,
% 0.46/1.15 relation_field( X ) ), reflexive( X ) }.
% 0.46/1.15 (361) {G0,W1,D1,L1,V0,M1} { && }.
% 0.46/1.15 (362) {G0,W1,D1,L1,V0,M1} { && }.
% 0.46/1.15 (363) {G0,W1,D1,L1,V0,M1} { && }.
% 0.46/1.15 (364) {G0,W1,D1,L1,V0,M1} { && }.
% 0.46/1.15 (365) {G0,W5,D3,L1,V1,M1} { set_union2( X, X ) = X }.
% 0.46/1.15 (366) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! well_founded_relation( X )
% 0.46/1.15 , is_well_founded_in( X, relation_field( X ) ) }.
% 0.46/1.15 (367) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! is_well_founded_in( X,
% 0.46/1.15 relation_field( X ) ), well_founded_relation( X ) }.
% 0.46/1.15 (368) {G0,W2,D2,L1,V0,M1} { relation( skol1 ) }.
% 0.46/1.15 (369) {G0,W4,D2,L2,V0,M2} { alpha7( skol1 ), well_ordering( skol1 ) }.
% 0.46/1.15 (370) {G0,W6,D3,L2,V0,M2} { alpha7( skol1 ), ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 (371) {G0,W6,D3,L2,V1,M2} { ! alpha7( X ), well_orders( X, relation_field
% 0.46/1.15 ( X ) ) }.
% 0.46/1.15 (372) {G0,W4,D2,L2,V1,M2} { ! alpha7( X ), ! well_ordering( X ) }.
% 0.46/1.15 (373) {G0,W8,D3,L3,V1,M3} { ! well_orders( X, relation_field( X ) ),
% 0.46/1.15 well_ordering( X ), alpha7( X ) }.
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 Total Proof:
% 0.46/1.15
% 0.46/1.15 subsumption: (1) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! antisymmetric(
% 0.46/1.15 X ), is_antisymmetric_in( X, relation_field( X ) ) }.
% 0.46/1.15 parent0: (328) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! antisymmetric( X )
% 0.46/1.15 , is_antisymmetric_in( X, relation_field( X ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (2) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), !
% 0.46/1.15 is_antisymmetric_in( X, relation_field( X ) ), antisymmetric( X ) }.
% 0.46/1.15 parent0: (329) {G0,W8,D3,L3,V1,M3} { ! relation( X ), !
% 0.46/1.15 is_antisymmetric_in( X, relation_field( X ) ), antisymmetric( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (3) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! connected( X )
% 0.46/1.15 , is_connected_in( X, relation_field( X ) ) }.
% 0.46/1.15 parent0: (330) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! connected( X ),
% 0.46/1.15 is_connected_in( X, relation_field( X ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (4) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! is_connected_in
% 0.46/1.15 ( X, relation_field( X ) ), connected( X ) }.
% 0.46/1.15 parent0: (331) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! is_connected_in( X
% 0.46/1.15 , relation_field( X ) ), connected( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (5) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! transitive( X )
% 0.46/1.15 , is_transitive_in( X, relation_field( X ) ) }.
% 0.46/1.15 parent0: (332) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! transitive( X ),
% 0.46/1.15 is_transitive_in( X, relation_field( X ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (6) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), !
% 0.46/1.15 is_transitive_in( X, relation_field( X ) ), transitive( X ) }.
% 0.46/1.15 parent0: (333) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! is_transitive_in(
% 0.46/1.15 X, relation_field( X ) ), transitive( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (7) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering(
% 0.46/1.15 X ), reflexive( X ) }.
% 0.46/1.15 parent0: (334) {G0,W6,D2,L3,V1,M3} { ! relation( X ), ! well_ordering( X )
% 0.46/1.15 , reflexive( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (8) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering(
% 0.46/1.15 X ), alpha1( X ) }.
% 0.46/1.15 parent0: (335) {G0,W6,D2,L3,V1,M3} { ! relation( X ), ! well_ordering( X )
% 0.46/1.15 , alpha1( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (9) {G0,W8,D2,L4,V1,M4} I { ! relation( X ), ! reflexive( X )
% 0.46/1.15 , ! alpha1( X ), well_ordering( X ) }.
% 0.46/1.15 parent0: (336) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! reflexive( X ), !
% 0.46/1.15 alpha1( X ), well_ordering( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 3 ==> 3
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (10) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), transitive( X )
% 0.46/1.15 }.
% 0.46/1.15 parent0: (337) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), transitive( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (11) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha3( X ) }.
% 0.46/1.15 parent0: (338) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), alpha3( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (12) {G0,W6,D2,L3,V1,M3} I { ! transitive( X ), ! alpha3( X )
% 0.46/1.15 , alpha1( X ) }.
% 0.46/1.15 parent0: (339) {G0,W6,D2,L3,V1,M3} { ! transitive( X ), ! alpha3( X ),
% 0.46/1.15 alpha1( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (13) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), antisymmetric( X )
% 0.46/1.15 }.
% 0.46/1.15 parent0: (340) {G0,W4,D2,L2,V1,M2} { ! alpha3( X ), antisymmetric( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (14) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), alpha5( X ) }.
% 0.46/1.15 parent0: (341) {G0,W4,D2,L2,V1,M2} { ! alpha3( X ), alpha5( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (15) {G0,W6,D2,L3,V1,M3} I { ! antisymmetric( X ), ! alpha5( X
% 0.46/1.15 ), alpha3( X ) }.
% 0.46/1.15 parent0: (342) {G0,W6,D2,L3,V1,M3} { ! antisymmetric( X ), ! alpha5( X ),
% 0.46/1.15 alpha3( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (16) {G0,W4,D2,L2,V1,M2} I { ! alpha5( X ), connected( X ) }.
% 0.46/1.15 parent0: (343) {G0,W4,D2,L2,V1,M2} { ! alpha5( X ), connected( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (17) {G0,W4,D2,L2,V1,M2} I { ! alpha5( X ),
% 0.46/1.15 well_founded_relation( X ) }.
% 0.46/1.15 parent0: (344) {G0,W4,D2,L2,V1,M2} { ! alpha5( X ), well_founded_relation
% 0.46/1.15 ( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (18) {G0,W6,D2,L3,V1,M3} I { ! connected( X ), !
% 0.46/1.15 well_founded_relation( X ), alpha5( X ) }.
% 0.46/1.15 parent0: (345) {G0,W6,D2,L3,V1,M3} { ! connected( X ), !
% 0.46/1.15 well_founded_relation( X ), alpha5( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (19) {G0,W8,D2,L3,V2,M3} I { ! relation( X ), ! well_orders( X
% 0.46/1.15 , Y ), is_reflexive_in( X, Y ) }.
% 0.46/1.15 parent0: (346) {G0,W8,D2,L3,V2,M3} { ! relation( X ), ! well_orders( X, Y
% 0.46/1.15 ), is_reflexive_in( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (20) {G0,W8,D2,L3,V2,M3} I { ! relation( X ), ! well_orders( X
% 0.46/1.15 , Y ), alpha2( X, Y ) }.
% 0.46/1.15 parent0: (347) {G0,W8,D2,L3,V2,M3} { ! relation( X ), ! well_orders( X, Y
% 0.46/1.15 ), alpha2( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (21) {G0,W11,D2,L4,V2,M4} I { ! relation( X ), !
% 0.46/1.15 is_reflexive_in( X, Y ), ! alpha2( X, Y ), well_orders( X, Y ) }.
% 0.46/1.15 parent0: (348) {G0,W11,D2,L4,V2,M4} { ! relation( X ), ! is_reflexive_in(
% 0.46/1.15 X, Y ), ! alpha2( X, Y ), well_orders( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 3 ==> 3
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (22) {G0,W6,D2,L2,V2,M2} I { ! alpha2( X, Y ),
% 0.46/1.15 is_transitive_in( X, Y ) }.
% 0.46/1.15 parent0: (349) {G0,W6,D2,L2,V2,M2} { ! alpha2( X, Y ), is_transitive_in( X
% 0.46/1.15 , Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (23) {G0,W6,D2,L2,V2,M2} I { ! alpha2( X, Y ), alpha4( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 parent0: (350) {G0,W6,D2,L2,V2,M2} { ! alpha2( X, Y ), alpha4( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (24) {G0,W9,D2,L3,V2,M3} I { ! is_transitive_in( X, Y ), !
% 0.46/1.15 alpha4( X, Y ), alpha2( X, Y ) }.
% 0.46/1.15 parent0: (351) {G0,W9,D2,L3,V2,M3} { ! is_transitive_in( X, Y ), ! alpha4
% 0.46/1.15 ( X, Y ), alpha2( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (25) {G0,W6,D2,L2,V2,M2} I { ! alpha4( X, Y ),
% 0.46/1.15 is_antisymmetric_in( X, Y ) }.
% 0.46/1.15 parent0: (352) {G0,W6,D2,L2,V2,M2} { ! alpha4( X, Y ), is_antisymmetric_in
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (26) {G0,W6,D2,L2,V2,M2} I { ! alpha4( X, Y ), alpha6( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 parent0: (353) {G0,W6,D2,L2,V2,M2} { ! alpha4( X, Y ), alpha6( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (27) {G0,W9,D2,L3,V2,M3} I { ! is_antisymmetric_in( X, Y ), !
% 0.46/1.15 alpha6( X, Y ), alpha4( X, Y ) }.
% 0.46/1.15 parent0: (354) {G0,W9,D2,L3,V2,M3} { ! is_antisymmetric_in( X, Y ), !
% 0.46/1.15 alpha6( X, Y ), alpha4( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (28) {G0,W6,D2,L2,V2,M2} I { ! alpha6( X, Y ), is_connected_in
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 parent0: (355) {G0,W6,D2,L2,V2,M2} { ! alpha6( X, Y ), is_connected_in( X
% 0.46/1.15 , Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (29) {G0,W6,D2,L2,V2,M2} I { ! alpha6( X, Y ),
% 0.46/1.15 is_well_founded_in( X, Y ) }.
% 0.46/1.15 parent0: (356) {G0,W6,D2,L2,V2,M2} { ! alpha6( X, Y ), is_well_founded_in
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (30) {G0,W9,D2,L3,V2,M3} I { ! is_connected_in( X, Y ), !
% 0.46/1.15 is_well_founded_in( X, Y ), alpha6( X, Y ) }.
% 0.46/1.15 parent0: (357) {G0,W9,D2,L3,V2,M3} { ! is_connected_in( X, Y ), !
% 0.46/1.15 is_well_founded_in( X, Y ), alpha6( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (32) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! reflexive( X )
% 0.46/1.15 , is_reflexive_in( X, relation_field( X ) ) }.
% 0.46/1.15 parent0: (359) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! reflexive( X ),
% 0.46/1.15 is_reflexive_in( X, relation_field( X ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (33) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), !
% 0.46/1.15 is_reflexive_in( X, relation_field( X ) ), reflexive( X ) }.
% 0.46/1.15 parent0: (360) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! is_reflexive_in( X
% 0.46/1.15 , relation_field( X ) ), reflexive( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (36) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), !
% 0.46/1.15 well_founded_relation( X ), is_well_founded_in( X, relation_field( X ) )
% 0.46/1.15 }.
% 0.46/1.15 parent0: (366) {G0,W8,D3,L3,V1,M3} { ! relation( X ), !
% 0.46/1.15 well_founded_relation( X ), is_well_founded_in( X, relation_field( X ) )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (37) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), !
% 0.46/1.15 is_well_founded_in( X, relation_field( X ) ), well_founded_relation( X )
% 0.46/1.15 }.
% 0.46/1.15 parent0: (367) {G0,W8,D3,L3,V1,M3} { ! relation( X ), ! is_well_founded_in
% 0.46/1.15 ( X, relation_field( X ) ), well_founded_relation( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 parent0: (368) {G0,W2,D2,L1,V0,M1} { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (39) {G0,W4,D2,L2,V0,M2} I { alpha7( skol1 ), well_ordering(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 parent0: (369) {G0,W4,D2,L2,V0,M2} { alpha7( skol1 ), well_ordering( skol1
% 0.46/1.15 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (40) {G0,W6,D3,L2,V0,M2} I { alpha7( skol1 ), ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (370) {G0,W6,D3,L2,V0,M2} { alpha7( skol1 ), ! well_orders( skol1
% 0.46/1.15 , relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (41) {G0,W6,D3,L2,V1,M2} I { ! alpha7( X ), well_orders( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 parent0: (371) {G0,W6,D3,L2,V1,M2} { ! alpha7( X ), well_orders( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (42) {G0,W4,D2,L2,V1,M2} I { ! alpha7( X ), ! well_ordering( X
% 0.46/1.15 ) }.
% 0.46/1.15 parent0: (372) {G0,W4,D2,L2,V1,M2} { ! alpha7( X ), ! well_ordering( X )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (390) {G1,W4,D2,L2,V1,M2} { connected( X ), ! alpha3( X ) }.
% 0.46/1.15 parent0[0]: (16) {G0,W4,D2,L2,V1,M2} I { ! alpha5( X ), connected( X ) }.
% 0.46/1.15 parent1[1]: (14) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), alpha5( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (44) {G1,W4,D2,L2,V1,M2} R(14,16) { ! alpha3( X ), connected(
% 0.46/1.15 X ) }.
% 0.46/1.15 parent0: (390) {G1,W4,D2,L2,V1,M2} { connected( X ), ! alpha3( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (391) {G1,W4,D2,L2,V1,M2} { well_founded_relation( X ), !
% 0.46/1.15 alpha3( X ) }.
% 0.46/1.15 parent0[0]: (17) {G0,W4,D2,L2,V1,M2} I { ! alpha5( X ),
% 0.46/1.15 well_founded_relation( X ) }.
% 0.46/1.15 parent1[1]: (14) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), alpha5( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (45) {G1,W4,D2,L2,V1,M2} R(14,17) { ! alpha3( X ),
% 0.46/1.15 well_founded_relation( X ) }.
% 0.46/1.15 parent0: (391) {G1,W4,D2,L2,V1,M2} { well_founded_relation( X ), ! alpha3
% 0.46/1.15 ( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (392) {G1,W4,D2,L2,V1,M2} { antisymmetric( X ), ! alpha1( X )
% 0.46/1.15 }.
% 0.46/1.15 parent0[0]: (13) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), antisymmetric( X )
% 0.46/1.15 }.
% 0.46/1.15 parent1[1]: (11) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha3( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (48) {G1,W4,D2,L2,V1,M2} R(11,13) { ! alpha1( X ),
% 0.46/1.15 antisymmetric( X ) }.
% 0.46/1.15 parent0: (392) {G1,W4,D2,L2,V1,M2} { antisymmetric( X ), ! alpha1( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (393) {G1,W4,D2,L2,V1,M2} { well_founded_relation( X ), !
% 0.46/1.15 alpha1( X ) }.
% 0.46/1.15 parent0[0]: (45) {G1,W4,D2,L2,V1,M2} R(14,17) { ! alpha3( X ),
% 0.46/1.15 well_founded_relation( X ) }.
% 0.46/1.15 parent1[1]: (11) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha3( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (49) {G2,W4,D2,L2,V1,M2} R(11,45) { ! alpha1( X ),
% 0.46/1.15 well_founded_relation( X ) }.
% 0.46/1.15 parent0: (393) {G1,W4,D2,L2,V1,M2} { well_founded_relation( X ), ! alpha1
% 0.46/1.15 ( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (394) {G1,W4,D2,L2,V1,M2} { connected( X ), ! alpha1( X ) }.
% 0.46/1.15 parent0[0]: (44) {G1,W4,D2,L2,V1,M2} R(14,16) { ! alpha3( X ), connected( X
% 0.46/1.15 ) }.
% 0.46/1.15 parent1[1]: (11) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha3( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (50) {G2,W4,D2,L2,V1,M2} R(11,44) { ! alpha1( X ), connected(
% 0.46/1.15 X ) }.
% 0.46/1.15 parent0: (394) {G1,W4,D2,L2,V1,M2} { connected( X ), ! alpha1( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (395) {G1,W6,D2,L2,V2,M2} { is_connected_in( X, Y ), ! alpha4
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 parent0[0]: (28) {G0,W6,D2,L2,V2,M2} I { ! alpha6( X, Y ), is_connected_in
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 parent1[1]: (26) {G0,W6,D2,L2,V2,M2} I { ! alpha4( X, Y ), alpha6( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (58) {G1,W6,D2,L2,V2,M2} R(26,28) { ! alpha4( X, Y ),
% 0.46/1.15 is_connected_in( X, Y ) }.
% 0.46/1.15 parent0: (395) {G1,W6,D2,L2,V2,M2} { is_connected_in( X, Y ), ! alpha4( X
% 0.46/1.15 , Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (396) {G1,W6,D2,L2,V2,M2} { is_well_founded_in( X, Y ), !
% 0.46/1.15 alpha4( X, Y ) }.
% 0.46/1.15 parent0[0]: (29) {G0,W6,D2,L2,V2,M2} I { ! alpha6( X, Y ),
% 0.46/1.15 is_well_founded_in( X, Y ) }.
% 0.46/1.15 parent1[1]: (26) {G0,W6,D2,L2,V2,M2} I { ! alpha4( X, Y ), alpha6( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (59) {G1,W6,D2,L2,V2,M2} R(26,29) { ! alpha4( X, Y ),
% 0.46/1.15 is_well_founded_in( X, Y ) }.
% 0.46/1.15 parent0: (396) {G1,W6,D2,L2,V2,M2} { is_well_founded_in( X, Y ), ! alpha4
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (397) {G1,W6,D2,L2,V2,M2} { is_antisymmetric_in( X, Y ), !
% 0.46/1.15 alpha2( X, Y ) }.
% 0.46/1.15 parent0[0]: (25) {G0,W6,D2,L2,V2,M2} I { ! alpha4( X, Y ),
% 0.46/1.15 is_antisymmetric_in( X, Y ) }.
% 0.46/1.15 parent1[1]: (23) {G0,W6,D2,L2,V2,M2} I { ! alpha2( X, Y ), alpha4( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (64) {G1,W6,D2,L2,V2,M2} R(23,25) { ! alpha2( X, Y ),
% 0.46/1.15 is_antisymmetric_in( X, Y ) }.
% 0.46/1.15 parent0: (397) {G1,W6,D2,L2,V2,M2} { is_antisymmetric_in( X, Y ), ! alpha2
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (398) {G1,W6,D2,L2,V2,M2} { is_well_founded_in( X, Y ), !
% 0.46/1.15 alpha2( X, Y ) }.
% 0.46/1.15 parent0[0]: (59) {G1,W6,D2,L2,V2,M2} R(26,29) { ! alpha4( X, Y ),
% 0.46/1.15 is_well_founded_in( X, Y ) }.
% 0.46/1.15 parent1[1]: (23) {G0,W6,D2,L2,V2,M2} I { ! alpha2( X, Y ), alpha4( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (65) {G2,W6,D2,L2,V2,M2} R(23,59) { ! alpha2( X, Y ),
% 0.46/1.15 is_well_founded_in( X, Y ) }.
% 0.46/1.15 parent0: (398) {G1,W6,D2,L2,V2,M2} { is_well_founded_in( X, Y ), ! alpha2
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (399) {G1,W6,D2,L2,V2,M2} { is_connected_in( X, Y ), ! alpha2
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 parent0[0]: (58) {G1,W6,D2,L2,V2,M2} R(26,28) { ! alpha4( X, Y ),
% 0.46/1.15 is_connected_in( X, Y ) }.
% 0.46/1.15 parent1[1]: (23) {G0,W6,D2,L2,V2,M2} I { ! alpha2( X, Y ), alpha4( X, Y )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (66) {G2,W6,D2,L2,V2,M2} R(23,58) { ! alpha2( X, Y ),
% 0.46/1.15 is_connected_in( X, Y ) }.
% 0.46/1.15 parent0: (399) {G1,W6,D2,L2,V2,M2} { is_connected_in( X, Y ), ! alpha2( X
% 0.46/1.15 , Y ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 Y := Y
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (400) {G1,W6,D2,L3,V0,M3} { ! relation( skol1 ), alpha1( skol1
% 0.46/1.15 ), alpha7( skol1 ) }.
% 0.46/1.15 parent0[1]: (8) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering( X
% 0.46/1.15 ), alpha1( X ) }.
% 0.46/1.15 parent1[1]: (39) {G0,W4,D2,L2,V0,M2} I { alpha7( skol1 ), well_ordering(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (401) {G1,W4,D2,L2,V0,M2} { alpha1( skol1 ), alpha7( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 parent0[0]: (400) {G1,W6,D2,L3,V0,M3} { ! relation( skol1 ), alpha1( skol1
% 0.46/1.15 ), alpha7( skol1 ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (79) {G1,W4,D2,L2,V0,M2} R(8,39);r(38) { alpha1( skol1 ),
% 0.46/1.15 alpha7( skol1 ) }.
% 0.46/1.15 parent0: (401) {G1,W4,D2,L2,V0,M2} { alpha1( skol1 ), alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (402) {G1,W6,D2,L3,V0,M3} { ! relation( skol1 ), reflexive(
% 0.46/1.15 skol1 ), alpha7( skol1 ) }.
% 0.46/1.15 parent0[1]: (7) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering( X
% 0.46/1.15 ), reflexive( X ) }.
% 0.46/1.15 parent1[1]: (39) {G0,W4,D2,L2,V0,M2} I { alpha7( skol1 ), well_ordering(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (403) {G1,W4,D2,L2,V0,M2} { reflexive( skol1 ), alpha7( skol1
% 0.46/1.15 ) }.
% 0.46/1.15 parent0[0]: (402) {G1,W6,D2,L3,V0,M3} { ! relation( skol1 ), reflexive(
% 0.46/1.15 skol1 ), alpha7( skol1 ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (87) {G1,W4,D2,L2,V0,M2} R(7,39);r(38) { reflexive( skol1 ),
% 0.46/1.15 alpha7( skol1 ) }.
% 0.46/1.15 parent0: (403) {G1,W4,D2,L2,V0,M2} { reflexive( skol1 ), alpha7( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (404) {G1,W4,D2,L2,V0,M2} { transitive( skol1 ), alpha7( skol1
% 0.46/1.15 ) }.
% 0.46/1.15 parent0[0]: (10) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), transitive( X ) }.
% 0.46/1.15 parent1[0]: (79) {G1,W4,D2,L2,V0,M2} R(8,39);r(38) { alpha1( skol1 ),
% 0.46/1.15 alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (89) {G2,W4,D2,L2,V0,M2} R(79,10) { alpha7( skol1 ),
% 0.46/1.15 transitive( skol1 ) }.
% 0.46/1.15 parent0: (404) {G1,W4,D2,L2,V0,M2} { transitive( skol1 ), alpha7( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (405) {G2,W4,D2,L2,V0,M2} { connected( skol1 ), alpha7( skol1
% 0.46/1.15 ) }.
% 0.46/1.15 parent0[0]: (50) {G2,W4,D2,L2,V1,M2} R(11,44) { ! alpha1( X ), connected( X
% 0.46/1.15 ) }.
% 0.46/1.15 parent1[0]: (79) {G1,W4,D2,L2,V0,M2} R(8,39);r(38) { alpha1( skol1 ),
% 0.46/1.15 alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (91) {G3,W4,D2,L2,V0,M2} R(79,50) { alpha7( skol1 ), connected
% 0.46/1.15 ( skol1 ) }.
% 0.46/1.15 parent0: (405) {G2,W4,D2,L2,V0,M2} { connected( skol1 ), alpha7( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (406) {G2,W4,D2,L2,V0,M2} { well_founded_relation( skol1 ),
% 0.46/1.15 alpha7( skol1 ) }.
% 0.46/1.15 parent0[0]: (49) {G2,W4,D2,L2,V1,M2} R(11,45) { ! alpha1( X ),
% 0.46/1.15 well_founded_relation( X ) }.
% 0.46/1.15 parent1[0]: (79) {G1,W4,D2,L2,V0,M2} R(8,39);r(38) { alpha1( skol1 ),
% 0.46/1.15 alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (92) {G3,W4,D2,L2,V0,M2} R(79,49) { alpha7( skol1 ),
% 0.46/1.15 well_founded_relation( skol1 ) }.
% 0.46/1.15 parent0: (406) {G2,W4,D2,L2,V0,M2} { well_founded_relation( skol1 ),
% 0.46/1.15 alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (407) {G2,W4,D2,L2,V0,M2} { antisymmetric( skol1 ), alpha7(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 parent0[0]: (48) {G1,W4,D2,L2,V1,M2} R(11,13) { ! alpha1( X ),
% 0.46/1.15 antisymmetric( X ) }.
% 0.46/1.15 parent1[0]: (79) {G1,W4,D2,L2,V0,M2} R(8,39);r(38) { alpha1( skol1 ),
% 0.46/1.15 alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (93) {G2,W4,D2,L2,V0,M2} R(79,48) { alpha7( skol1 ),
% 0.46/1.15 antisymmetric( skol1 ) }.
% 0.46/1.15 parent0: (407) {G2,W4,D2,L2,V0,M2} { antisymmetric( skol1 ), alpha7( skol1
% 0.46/1.15 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (408) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ),
% 0.46/1.15 is_transitive_in( skol1, relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 parent0[1]: (5) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! transitive( X )
% 0.46/1.15 , is_transitive_in( X, relation_field( X ) ) }.
% 0.46/1.15 parent1[1]: (89) {G2,W4,D2,L2,V0,M2} R(79,10) { alpha7( skol1 ), transitive
% 0.46/1.15 ( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (409) {G1,W6,D3,L2,V0,M2} { is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 parent0[0]: (408) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ),
% 0.46/1.15 is_transitive_in( skol1, relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (95) {G3,W6,D3,L2,V0,M2} R(89,5);r(38) { alpha7( skol1 ),
% 0.46/1.15 is_transitive_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (409) {G1,W6,D3,L2,V0,M2} { is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (410) {G1,W6,D2,L3,V0,M3} { ! reflexive( skol1 ), ! alpha1(
% 0.46/1.15 skol1 ), well_ordering( skol1 ) }.
% 0.46/1.15 parent0[0]: (9) {G0,W8,D2,L4,V1,M4} I { ! relation( X ), ! reflexive( X ),
% 0.46/1.15 ! alpha1( X ), well_ordering( X ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (99) {G1,W6,D2,L3,V0,M3} R(9,38) { ! reflexive( skol1 ), !
% 0.46/1.15 alpha1( skol1 ), well_ordering( skol1 ) }.
% 0.46/1.15 parent0: (410) {G1,W6,D2,L3,V0,M3} { ! reflexive( skol1 ), ! alpha1( skol1
% 0.46/1.15 ), well_ordering( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 2 ==> 2
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (411) {G1,W6,D2,L2,V1,M2} { ! well_orders( skol1, X ),
% 0.46/1.15 is_reflexive_in( skol1, X ) }.
% 0.46/1.15 parent0[0]: (19) {G0,W8,D2,L3,V2,M3} I { ! relation( X ), ! well_orders( X
% 0.46/1.15 , Y ), is_reflexive_in( X, Y ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (106) {G1,W6,D2,L2,V1,M2} R(19,38) { ! well_orders( skol1, X )
% 0.46/1.15 , is_reflexive_in( skol1, X ) }.
% 0.46/1.15 parent0: (411) {G1,W6,D2,L2,V1,M2} { ! well_orders( skol1, X ),
% 0.46/1.15 is_reflexive_in( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (412) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ),
% 0.46/1.15 is_connected_in( skol1, relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 parent0[1]: (3) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! connected( X ),
% 0.46/1.15 is_connected_in( X, relation_field( X ) ) }.
% 0.46/1.15 parent1[1]: (91) {G3,W4,D2,L2,V0,M2} R(79,50) { alpha7( skol1 ), connected
% 0.46/1.15 ( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (413) {G1,W6,D3,L2,V0,M2} { is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 parent0[0]: (412) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ),
% 0.46/1.15 is_connected_in( skol1, relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (107) {G4,W6,D3,L2,V0,M2} R(91,3);r(38) { alpha7( skol1 ),
% 0.46/1.15 is_connected_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (413) {G1,W6,D3,L2,V0,M2} { is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (414) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ),
% 0.46/1.15 is_antisymmetric_in( skol1, relation_field( skol1 ) ), alpha7( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 parent0[1]: (1) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! antisymmetric( X
% 0.46/1.15 ), is_antisymmetric_in( X, relation_field( X ) ) }.
% 0.46/1.15 parent1[1]: (93) {G2,W4,D2,L2,V0,M2} R(79,48) { alpha7( skol1 ),
% 0.46/1.15 antisymmetric( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (415) {G1,W6,D3,L2,V0,M2} { is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 parent0[0]: (414) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ),
% 0.46/1.15 is_antisymmetric_in( skol1, relation_field( skol1 ) ), alpha7( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (108) {G3,W6,D3,L2,V0,M2} R(93,1);r(38) { alpha7( skol1 ),
% 0.46/1.15 is_antisymmetric_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (415) {G1,W6,D3,L2,V0,M2} { is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (416) {G1,W6,D2,L2,V1,M2} { ! well_orders( skol1, X ), alpha2
% 0.46/1.15 ( skol1, X ) }.
% 0.46/1.15 parent0[0]: (20) {G0,W8,D2,L3,V2,M3} I { ! relation( X ), ! well_orders( X
% 0.46/1.15 , Y ), alpha2( X, Y ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (116) {G1,W6,D2,L2,V1,M2} R(20,38) { ! well_orders( skol1, X )
% 0.46/1.15 , alpha2( skol1, X ) }.
% 0.46/1.15 parent0: (416) {G1,W6,D2,L2,V1,M2} { ! well_orders( skol1, X ), alpha2(
% 0.46/1.15 skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (417) {G1,W6,D2,L2,V1,M2} { is_transitive_in( skol1, X ), !
% 0.46/1.15 well_orders( skol1, X ) }.
% 0.46/1.15 parent0[0]: (22) {G0,W6,D2,L2,V2,M2} I { ! alpha2( X, Y ), is_transitive_in
% 0.46/1.15 ( X, Y ) }.
% 0.46/1.15 parent1[1]: (116) {G1,W6,D2,L2,V1,M2} R(20,38) { ! well_orders( skol1, X )
% 0.46/1.15 , alpha2( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (120) {G2,W6,D2,L2,V1,M2} R(116,22) { ! well_orders( skol1, X
% 0.46/1.15 ), is_transitive_in( skol1, X ) }.
% 0.46/1.15 parent0: (417) {G1,W6,D2,L2,V1,M2} { is_transitive_in( skol1, X ), !
% 0.46/1.15 well_orders( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (418) {G2,W6,D2,L2,V1,M2} { is_connected_in( skol1, X ), !
% 0.46/1.15 well_orders( skol1, X ) }.
% 0.46/1.15 parent0[0]: (66) {G2,W6,D2,L2,V2,M2} R(23,58) { ! alpha2( X, Y ),
% 0.46/1.15 is_connected_in( X, Y ) }.
% 0.46/1.15 parent1[1]: (116) {G1,W6,D2,L2,V1,M2} R(20,38) { ! well_orders( skol1, X )
% 0.46/1.15 , alpha2( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (122) {G3,W6,D2,L2,V1,M2} R(116,66) { ! well_orders( skol1, X
% 0.46/1.15 ), is_connected_in( skol1, X ) }.
% 0.46/1.15 parent0: (418) {G2,W6,D2,L2,V1,M2} { is_connected_in( skol1, X ), !
% 0.46/1.15 well_orders( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (419) {G2,W6,D2,L2,V1,M2} { is_well_founded_in( skol1, X ), !
% 0.46/1.15 well_orders( skol1, X ) }.
% 0.46/1.15 parent0[0]: (65) {G2,W6,D2,L2,V2,M2} R(23,59) { ! alpha2( X, Y ),
% 0.46/1.15 is_well_founded_in( X, Y ) }.
% 0.46/1.15 parent1[1]: (116) {G1,W6,D2,L2,V1,M2} R(20,38) { ! well_orders( skol1, X )
% 0.46/1.15 , alpha2( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (123) {G3,W6,D2,L2,V1,M2} R(116,65) { ! well_orders( skol1, X
% 0.46/1.15 ), is_well_founded_in( skol1, X ) }.
% 0.46/1.15 parent0: (419) {G2,W6,D2,L2,V1,M2} { is_well_founded_in( skol1, X ), !
% 0.46/1.15 well_orders( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (420) {G2,W6,D2,L2,V1,M2} { is_antisymmetric_in( skol1, X ), !
% 0.46/1.15 well_orders( skol1, X ) }.
% 0.46/1.15 parent0[0]: (64) {G1,W6,D2,L2,V2,M2} R(23,25) { ! alpha2( X, Y ),
% 0.46/1.15 is_antisymmetric_in( X, Y ) }.
% 0.46/1.15 parent1[1]: (116) {G1,W6,D2,L2,V1,M2} R(20,38) { ! well_orders( skol1, X )
% 0.46/1.15 , alpha2( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := X
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (124) {G2,W6,D2,L2,V1,M2} R(116,64) { ! well_orders( skol1, X
% 0.46/1.15 ), is_antisymmetric_in( skol1, X ) }.
% 0.46/1.15 parent0: (420) {G2,W6,D2,L2,V1,M2} { is_antisymmetric_in( skol1, X ), !
% 0.46/1.15 well_orders( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := X
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (421) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ), transitive(
% 0.46/1.15 skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (6) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! is_transitive_in
% 0.46/1.15 ( X, relation_field( X ) ), transitive( X ) }.
% 0.46/1.15 parent1[1]: (120) {G2,W6,D2,L2,V1,M2} R(116,22) { ! well_orders( skol1, X )
% 0.46/1.15 , is_transitive_in( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (422) {G1,W6,D3,L2,V0,M2} { transitive( skol1 ), ! well_orders
% 0.46/1.15 ( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0]: (421) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ), transitive(
% 0.46/1.15 skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (126) {G3,W6,D3,L2,V0,M2} R(120,6);r(38) { ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ), transitive( skol1 ) }.
% 0.46/1.15 parent0: (422) {G1,W6,D3,L2,V0,M2} { transitive( skol1 ), ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (423) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ), connected(
% 0.46/1.15 skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (4) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! is_connected_in
% 0.46/1.15 ( X, relation_field( X ) ), connected( X ) }.
% 0.46/1.15 parent1[1]: (122) {G3,W6,D2,L2,V1,M2} R(116,66) { ! well_orders( skol1, X )
% 0.46/1.15 , is_connected_in( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (424) {G1,W6,D3,L2,V0,M2} { connected( skol1 ), ! well_orders
% 0.46/1.15 ( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0]: (423) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ), connected(
% 0.46/1.15 skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (127) {G4,W6,D3,L2,V0,M2} R(122,4);r(38) { ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ), connected( skol1 ) }.
% 0.46/1.15 parent0: (424) {G1,W6,D3,L2,V0,M2} { connected( skol1 ), ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (425) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ), antisymmetric
% 0.46/1.15 ( skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (2) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), !
% 0.46/1.15 is_antisymmetric_in( X, relation_field( X ) ), antisymmetric( X ) }.
% 0.46/1.15 parent1[1]: (124) {G2,W6,D2,L2,V1,M2} R(116,64) { ! well_orders( skol1, X )
% 0.46/1.15 , is_antisymmetric_in( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (426) {G1,W6,D3,L2,V0,M2} { antisymmetric( skol1 ), !
% 0.46/1.15 well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0]: (425) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ), antisymmetric
% 0.46/1.15 ( skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (130) {G3,W6,D3,L2,V0,M2} R(124,2);r(38) { ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ), antisymmetric( skol1 ) }.
% 0.46/1.15 parent0: (426) {G1,W6,D3,L2,V0,M2} { antisymmetric( skol1 ), ! well_orders
% 0.46/1.15 ( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (427) {G1,W6,D2,L3,V0,M3} { ! alpha7( skol1 ), ! reflexive(
% 0.46/1.15 skol1 ), ! alpha1( skol1 ) }.
% 0.46/1.15 parent0[1]: (42) {G0,W4,D2,L2,V1,M2} I { ! alpha7( X ), ! well_ordering( X
% 0.46/1.15 ) }.
% 0.46/1.15 parent1[2]: (99) {G1,W6,D2,L3,V0,M3} R(9,38) { ! reflexive( skol1 ), !
% 0.46/1.15 alpha1( skol1 ), well_ordering( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (139) {G2,W6,D2,L3,V0,M3} R(99,42) { ! reflexive( skol1 ), !
% 0.46/1.15 alpha1( skol1 ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent0: (427) {G1,W6,D2,L3,V0,M3} { ! alpha7( skol1 ), ! reflexive( skol1
% 0.46/1.15 ), ! alpha1( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 2
% 0.46/1.15 1 ==> 0
% 0.46/1.15 2 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (428) {G1,W6,D3,L2,V0,M2} { is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent0[0]: (124) {G2,W6,D2,L2,V1,M2} R(116,64) { ! well_orders( skol1, X )
% 0.46/1.15 , is_antisymmetric_in( skol1, X ) }.
% 0.46/1.15 parent1[1]: (41) {G0,W6,D3,L2,V1,M2} I { ! alpha7( X ), well_orders( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (429) {G2,W8,D3,L2,V0,M2} { is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), is_antisymmetric_in( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent0[1]: (428) {G1,W6,D3,L2,V0,M2} { is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent1[0]: (108) {G3,W6,D3,L2,V0,M2} R(93,1);r(38) { alpha7( skol1 ),
% 0.46/1.15 is_antisymmetric_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 factor: (430) {G2,W4,D3,L1,V0,M1} { is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0, 1]: (429) {G2,W8,D3,L2,V0,M2} { is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), is_antisymmetric_in( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (145) {G4,W4,D3,L1,V0,M1} R(41,124);r(108) {
% 0.46/1.15 is_antisymmetric_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (430) {G2,W4,D3,L1,V0,M1} { is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (431) {G1,W6,D3,L2,V0,M2} { is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent0[0]: (122) {G3,W6,D2,L2,V1,M2} R(116,66) { ! well_orders( skol1, X )
% 0.46/1.15 , is_connected_in( skol1, X ) }.
% 0.46/1.15 parent1[1]: (41) {G0,W6,D3,L2,V1,M2} I { ! alpha7( X ), well_orders( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (432) {G2,W8,D3,L2,V0,M2} { is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), is_connected_in( skol1, relation_field( skol1
% 0.46/1.15 ) ) }.
% 0.46/1.15 parent0[1]: (431) {G1,W6,D3,L2,V0,M2} { is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent1[0]: (107) {G4,W6,D3,L2,V0,M2} R(91,3);r(38) { alpha7( skol1 ),
% 0.46/1.15 is_connected_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 factor: (433) {G2,W4,D3,L1,V0,M1} { is_connected_in( skol1, relation_field
% 0.46/1.15 ( skol1 ) ) }.
% 0.46/1.15 parent0[0, 1]: (432) {G2,W8,D3,L2,V0,M2} { is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), is_connected_in( skol1, relation_field( skol1
% 0.46/1.15 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (147) {G5,W4,D3,L1,V0,M1} R(41,122);r(107) { is_connected_in(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (433) {G2,W4,D3,L1,V0,M1} { is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (434) {G1,W6,D3,L2,V0,M2} { is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent0[0]: (120) {G2,W6,D2,L2,V1,M2} R(116,22) { ! well_orders( skol1, X )
% 0.46/1.15 , is_transitive_in( skol1, X ) }.
% 0.46/1.15 parent1[1]: (41) {G0,W6,D3,L2,V1,M2} I { ! alpha7( X ), well_orders( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (435) {G2,W8,D3,L2,V0,M2} { is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), is_transitive_in( skol1, relation_field( skol1
% 0.46/1.15 ) ) }.
% 0.46/1.15 parent0[1]: (434) {G1,W6,D3,L2,V0,M2} { is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent1[0]: (95) {G3,W6,D3,L2,V0,M2} R(89,5);r(38) { alpha7( skol1 ),
% 0.46/1.15 is_transitive_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 factor: (436) {G2,W4,D3,L1,V0,M1} { is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0, 1]: (435) {G2,W8,D3,L2,V0,M2} { is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), is_transitive_in( skol1, relation_field( skol1
% 0.46/1.15 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (149) {G4,W4,D3,L1,V0,M1} R(41,120);r(95) { is_transitive_in(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (436) {G2,W4,D3,L1,V0,M1} { is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (437) {G1,W6,D3,L2,V0,M2} { well_orders( skol1, relation_field
% 0.46/1.15 ( skol1 ) ), antisymmetric( skol1 ) }.
% 0.46/1.15 parent0[0]: (41) {G0,W6,D3,L2,V1,M2} I { ! alpha7( X ), well_orders( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 parent1[0]: (93) {G2,W4,D2,L2,V0,M2} R(79,48) { alpha7( skol1 ),
% 0.46/1.15 antisymmetric( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (438) {G2,W4,D2,L2,V0,M2} { antisymmetric( skol1 ),
% 0.46/1.15 antisymmetric( skol1 ) }.
% 0.46/1.15 parent0[0]: (130) {G3,W6,D3,L2,V0,M2} R(124,2);r(38) { ! well_orders( skol1
% 0.46/1.15 , relation_field( skol1 ) ), antisymmetric( skol1 ) }.
% 0.46/1.15 parent1[0]: (437) {G1,W6,D3,L2,V0,M2} { well_orders( skol1, relation_field
% 0.46/1.15 ( skol1 ) ), antisymmetric( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 factor: (439) {G2,W2,D2,L1,V0,M1} { antisymmetric( skol1 ) }.
% 0.46/1.15 parent0[0, 1]: (438) {G2,W4,D2,L2,V0,M2} { antisymmetric( skol1 ),
% 0.46/1.15 antisymmetric( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (153) {G4,W2,D2,L1,V0,M1} R(41,93);r(130) { antisymmetric(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 parent0: (439) {G2,W2,D2,L1,V0,M1} { antisymmetric( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (440) {G1,W6,D3,L2,V0,M2} { well_orders( skol1, relation_field
% 0.46/1.15 ( skol1 ) ), connected( skol1 ) }.
% 0.46/1.15 parent0[0]: (41) {G0,W6,D3,L2,V1,M2} I { ! alpha7( X ), well_orders( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 parent1[0]: (91) {G3,W4,D2,L2,V0,M2} R(79,50) { alpha7( skol1 ), connected
% 0.46/1.15 ( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (441) {G2,W4,D2,L2,V0,M2} { connected( skol1 ), connected(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 parent0[0]: (127) {G4,W6,D3,L2,V0,M2} R(122,4);r(38) { ! well_orders( skol1
% 0.46/1.15 , relation_field( skol1 ) ), connected( skol1 ) }.
% 0.46/1.15 parent1[0]: (440) {G1,W6,D3,L2,V0,M2} { well_orders( skol1, relation_field
% 0.46/1.15 ( skol1 ) ), connected( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 factor: (442) {G2,W2,D2,L1,V0,M1} { connected( skol1 ) }.
% 0.46/1.15 parent0[0, 1]: (441) {G2,W4,D2,L2,V0,M2} { connected( skol1 ), connected(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (155) {G5,W2,D2,L1,V0,M1} R(41,91);r(127) { connected( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 parent0: (442) {G2,W2,D2,L1,V0,M1} { connected( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (443) {G1,W6,D3,L2,V0,M2} { well_orders( skol1, relation_field
% 0.46/1.15 ( skol1 ) ), transitive( skol1 ) }.
% 0.46/1.15 parent0[0]: (41) {G0,W6,D3,L2,V1,M2} I { ! alpha7( X ), well_orders( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 parent1[0]: (89) {G2,W4,D2,L2,V0,M2} R(79,10) { alpha7( skol1 ), transitive
% 0.46/1.15 ( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (444) {G2,W4,D2,L2,V0,M2} { transitive( skol1 ), transitive(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 parent0[0]: (126) {G3,W6,D3,L2,V0,M2} R(120,6);r(38) { ! well_orders( skol1
% 0.46/1.15 , relation_field( skol1 ) ), transitive( skol1 ) }.
% 0.46/1.15 parent1[0]: (443) {G1,W6,D3,L2,V0,M2} { well_orders( skol1, relation_field
% 0.46/1.15 ( skol1 ) ), transitive( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 factor: (445) {G2,W2,D2,L1,V0,M1} { transitive( skol1 ) }.
% 0.46/1.15 parent0[0, 1]: (444) {G2,W4,D2,L2,V0,M2} { transitive( skol1 ), transitive
% 0.46/1.15 ( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (158) {G4,W2,D2,L1,V0,M1} R(41,89);r(126) { transitive( skol1
% 0.46/1.15 ) }.
% 0.46/1.15 parent0: (445) {G2,W2,D2,L1,V0,M1} { transitive( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (446) {G1,W4,D2,L2,V0,M2} { ! alpha3( skol1 ), alpha1( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 parent0[0]: (12) {G0,W6,D2,L3,V1,M3} I { ! transitive( X ), ! alpha3( X ),
% 0.46/1.15 alpha1( X ) }.
% 0.46/1.15 parent1[0]: (158) {G4,W2,D2,L1,V0,M1} R(41,89);r(126) { transitive( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (169) {G5,W4,D2,L2,V0,M2} R(158,12) { ! alpha3( skol1 ),
% 0.46/1.15 alpha1( skol1 ) }.
% 0.46/1.15 parent0: (446) {G1,W4,D2,L2,V0,M2} { ! alpha3( skol1 ), alpha1( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (447) {G3,W6,D2,L3,V0,M3} { ! reflexive( skol1 ), ! alpha7(
% 0.46/1.15 skol1 ), ! alpha3( skol1 ) }.
% 0.46/1.15 parent0[1]: (139) {G2,W6,D2,L3,V0,M3} R(99,42) { ! reflexive( skol1 ), !
% 0.46/1.15 alpha1( skol1 ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent1[1]: (169) {G5,W4,D2,L2,V0,M2} R(158,12) { ! alpha3( skol1 ), alpha1
% 0.46/1.15 ( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (170) {G6,W6,D2,L3,V0,M3} R(169,139) { ! alpha3( skol1 ), !
% 0.46/1.15 reflexive( skol1 ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent0: (447) {G3,W6,D2,L3,V0,M3} { ! reflexive( skol1 ), ! alpha7( skol1
% 0.46/1.15 ), ! alpha3( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 2
% 0.46/1.15 2 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (448) {G1,W6,D2,L3,V0,M3} { alpha1( skol1 ), ! antisymmetric(
% 0.46/1.15 skol1 ), ! alpha5( skol1 ) }.
% 0.46/1.15 parent0[0]: (169) {G5,W4,D2,L2,V0,M2} R(158,12) { ! alpha3( skol1 ), alpha1
% 0.46/1.15 ( skol1 ) }.
% 0.46/1.15 parent1[2]: (15) {G0,W6,D2,L3,V1,M3} I { ! antisymmetric( X ), ! alpha5( X
% 0.46/1.15 ), alpha3( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (449) {G2,W4,D2,L2,V0,M2} { alpha1( skol1 ), ! alpha5( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 parent0[1]: (448) {G1,W6,D2,L3,V0,M3} { alpha1( skol1 ), ! antisymmetric(
% 0.46/1.15 skol1 ), ! alpha5( skol1 ) }.
% 0.46/1.15 parent1[0]: (153) {G4,W2,D2,L1,V0,M1} R(41,93);r(130) { antisymmetric(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (172) {G6,W4,D2,L2,V0,M2} R(169,15);r(153) { alpha1( skol1 ),
% 0.46/1.15 ! alpha5( skol1 ) }.
% 0.46/1.15 parent0: (449) {G2,W4,D2,L2,V0,M2} { alpha1( skol1 ), ! alpha5( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (450) {G1,W6,D2,L3,V0,M3} { alpha1( skol1 ), ! connected(
% 0.46/1.15 skol1 ), ! well_founded_relation( skol1 ) }.
% 0.46/1.15 parent0[1]: (172) {G6,W4,D2,L2,V0,M2} R(169,15);r(153) { alpha1( skol1 ), !
% 0.46/1.15 alpha5( skol1 ) }.
% 0.46/1.15 parent1[2]: (18) {G0,W6,D2,L3,V1,M3} I { ! connected( X ), !
% 0.46/1.15 well_founded_relation( X ), alpha5( X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (451) {G2,W4,D2,L2,V0,M2} { alpha1( skol1 ), !
% 0.46/1.15 well_founded_relation( skol1 ) }.
% 0.46/1.15 parent0[1]: (450) {G1,W6,D2,L3,V0,M3} { alpha1( skol1 ), ! connected(
% 0.46/1.15 skol1 ), ! well_founded_relation( skol1 ) }.
% 0.46/1.15 parent1[0]: (155) {G5,W2,D2,L1,V0,M1} R(41,91);r(127) { connected( skol1 )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (175) {G7,W4,D2,L2,V0,M2} R(172,18);r(155) { alpha1( skol1 ),
% 0.46/1.15 ! well_founded_relation( skol1 ) }.
% 0.46/1.15 parent0: (451) {G2,W4,D2,L2,V0,M2} { alpha1( skol1 ), !
% 0.46/1.15 well_founded_relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (452) {G1,W4,D2,L2,V0,M2} { alpha3( skol1 ), !
% 0.46/1.15 well_founded_relation( skol1 ) }.
% 0.46/1.15 parent0[0]: (11) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha3( X ) }.
% 0.46/1.15 parent1[0]: (175) {G7,W4,D2,L2,V0,M2} R(172,18);r(155) { alpha1( skol1 ), !
% 0.46/1.15 well_founded_relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (178) {G8,W4,D2,L2,V0,M2} R(175,11) { ! well_founded_relation
% 0.46/1.15 ( skol1 ), alpha3( skol1 ) }.
% 0.46/1.15 parent0: (452) {G1,W4,D2,L2,V0,M2} { alpha3( skol1 ), !
% 0.46/1.15 well_founded_relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (453) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ), reflexive(
% 0.46/1.15 skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (33) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! is_reflexive_in
% 0.46/1.15 ( X, relation_field( X ) ), reflexive( X ) }.
% 0.46/1.15 parent1[1]: (106) {G1,W6,D2,L2,V1,M2} R(19,38) { ! well_orders( skol1, X )
% 0.46/1.15 , is_reflexive_in( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (454) {G1,W6,D3,L2,V0,M2} { reflexive( skol1 ), ! well_orders
% 0.46/1.15 ( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0]: (453) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ), reflexive(
% 0.46/1.15 skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (181) {G2,W6,D3,L2,V0,M2} R(33,106);r(38) { reflexive( skol1 )
% 0.46/1.15 , ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (454) {G1,W6,D3,L2,V0,M2} { reflexive( skol1 ), ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (455) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ),
% 0.46/1.15 well_founded_relation( skol1 ), ! well_orders( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent0[1]: (37) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), !
% 0.46/1.15 is_well_founded_in( X, relation_field( X ) ), well_founded_relation( X )
% 0.46/1.15 }.
% 0.46/1.15 parent1[1]: (123) {G3,W6,D2,L2,V1,M2} R(116,65) { ! well_orders( skol1, X )
% 0.46/1.15 , is_well_founded_in( skol1, X ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (456) {G1,W6,D3,L2,V0,M2} { well_founded_relation( skol1 ), !
% 0.46/1.15 well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0]: (455) {G1,W8,D3,L3,V0,M3} { ! relation( skol1 ),
% 0.46/1.15 well_founded_relation( skol1 ), ! well_orders( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (203) {G4,W6,D3,L2,V0,M2} R(37,123);r(38) {
% 0.46/1.15 well_founded_relation( skol1 ), ! well_orders( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent0: (456) {G1,W6,D3,L2,V0,M2} { well_founded_relation( skol1 ), !
% 0.46/1.15 well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (457) {G1,W8,D3,L3,V0,M3} { ! alpha3( skol1 ), ! reflexive(
% 0.46/1.15 skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[2]: (170) {G6,W6,D2,L3,V0,M3} R(169,139) { ! alpha3( skol1 ), !
% 0.46/1.15 reflexive( skol1 ), ! alpha7( skol1 ) }.
% 0.46/1.15 parent1[0]: (40) {G0,W6,D3,L2,V0,M2} I { alpha7( skol1 ), ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (458) {G2,W10,D3,L3,V0,M3} { ! alpha3( skol1 ), ! well_orders
% 0.46/1.15 ( skol1, relation_field( skol1 ) ), ! well_orders( skol1, relation_field
% 0.46/1.15 ( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (457) {G1,W8,D3,L3,V0,M3} { ! alpha3( skol1 ), ! reflexive(
% 0.46/1.15 skol1 ), ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (181) {G2,W6,D3,L2,V0,M2} R(33,106);r(38) { reflexive( skol1 )
% 0.46/1.15 , ! well_orders( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 factor: (459) {G2,W6,D3,L2,V0,M2} { ! alpha3( skol1 ), ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1, 2]: (458) {G2,W10,D3,L3,V0,M3} { ! alpha3( skol1 ), !
% 0.46/1.15 well_orders( skol1, relation_field( skol1 ) ), ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (213) {G7,W6,D3,L2,V0,M2} R(40,170);r(181) { ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ), ! alpha3( skol1 ) }.
% 0.46/1.15 parent0: (459) {G2,W6,D3,L2,V0,M2} { ! alpha3( skol1 ), ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 1
% 0.46/1.15 1 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (460) {G8,W6,D3,L2,V0,M2} { ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! well_founded_relation( skol1 ) }.
% 0.46/1.15 parent0[1]: (213) {G7,W6,D3,L2,V0,M2} R(40,170);r(181) { ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ), ! alpha3( skol1 ) }.
% 0.46/1.15 parent1[1]: (178) {G8,W4,D2,L2,V0,M2} R(175,11) { ! well_founded_relation(
% 0.46/1.15 skol1 ), alpha3( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (461) {G5,W8,D3,L2,V0,M2} { ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! well_orders( skol1, relation_field( skol1 )
% 0.46/1.15 ) }.
% 0.46/1.15 parent0[1]: (460) {G8,W6,D3,L2,V0,M2} { ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! well_founded_relation( skol1 ) }.
% 0.46/1.15 parent1[0]: (203) {G4,W6,D3,L2,V0,M2} R(37,123);r(38) {
% 0.46/1.15 well_founded_relation( skol1 ), ! well_orders( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 factor: (462) {G5,W4,D3,L1,V0,M1} { ! well_orders( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent0[0, 1]: (461) {G5,W8,D3,L2,V0,M2} { ! well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ), ! well_orders( skol1, relation_field( skol1 )
% 0.46/1.15 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (219) {G9,W4,D3,L1,V0,M1} R(213,178);r(203) { ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (462) {G5,W4,D3,L1,V0,M1} { ! well_orders( skol1, relation_field
% 0.46/1.15 ( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (463) {G1,W2,D2,L1,V0,M1} { ! alpha7( skol1 ) }.
% 0.46/1.15 parent0[0]: (219) {G9,W4,D3,L1,V0,M1} R(213,178);r(203) { ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[1]: (41) {G0,W6,D3,L2,V1,M2} I { ! alpha7( X ), well_orders( X,
% 0.46/1.15 relation_field( X ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (249) {G10,W2,D2,L1,V0,M1} R(219,41) { ! alpha7( skol1 ) }.
% 0.46/1.15 parent0: (463) {G1,W2,D2,L1,V0,M1} { ! alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (464) {G4,W2,D2,L1,V0,M1} { well_founded_relation( skol1 ) }.
% 0.46/1.15 parent0[0]: (249) {G10,W2,D2,L1,V0,M1} R(219,41) { ! alpha7( skol1 ) }.
% 0.46/1.15 parent1[0]: (92) {G3,W4,D2,L2,V0,M2} R(79,49) { alpha7( skol1 ),
% 0.46/1.15 well_founded_relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (253) {G11,W2,D2,L1,V0,M1} R(249,92) { well_founded_relation(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 parent0: (464) {G4,W2,D2,L1,V0,M1} { well_founded_relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (465) {G2,W2,D2,L1,V0,M1} { reflexive( skol1 ) }.
% 0.46/1.15 parent0[0]: (249) {G10,W2,D2,L1,V0,M1} R(219,41) { ! alpha7( skol1 ) }.
% 0.46/1.15 parent1[1]: (87) {G1,W4,D2,L2,V0,M2} R(7,39);r(38) { reflexive( skol1 ),
% 0.46/1.15 alpha7( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (256) {G11,W2,D2,L1,V0,M1} R(249,87) { reflexive( skol1 ) }.
% 0.46/1.15 parent0: (465) {G2,W2,D2,L1,V0,M1} { reflexive( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (466) {G1,W6,D3,L2,V0,M2} { ! relation( skol1 ),
% 0.46/1.15 is_well_founded_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (36) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), !
% 0.46/1.15 well_founded_relation( X ), is_well_founded_in( X, relation_field( X ) )
% 0.46/1.15 }.
% 0.46/1.15 parent1[0]: (253) {G11,W2,D2,L1,V0,M1} R(249,92) { well_founded_relation(
% 0.46/1.15 skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (467) {G1,W4,D3,L1,V0,M1} { is_well_founded_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0]: (466) {G1,W6,D3,L2,V0,M2} { ! relation( skol1 ),
% 0.46/1.15 is_well_founded_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (258) {G12,W4,D3,L1,V0,M1} R(253,36);r(38) {
% 0.46/1.15 is_well_founded_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (467) {G1,W4,D3,L1,V0,M1} { is_well_founded_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (468) {G1,W6,D3,L2,V0,M2} { ! relation( skol1 ),
% 0.46/1.15 is_reflexive_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (32) {G0,W8,D3,L3,V1,M3} I { ! relation( X ), ! reflexive( X )
% 0.46/1.15 , is_reflexive_in( X, relation_field( X ) ) }.
% 0.46/1.15 parent1[0]: (256) {G11,W2,D2,L1,V0,M1} R(249,87) { reflexive( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (469) {G1,W4,D3,L1,V0,M1} { is_reflexive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0]: (468) {G1,W6,D3,L2,V0,M2} { ! relation( skol1 ),
% 0.46/1.15 is_reflexive_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (259) {G12,W4,D3,L1,V0,M1} R(256,32);r(38) { is_reflexive_in(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (469) {G1,W4,D3,L1,V0,M1} { is_reflexive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (470) {G1,W8,D3,L2,V0,M2} { ! is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha6( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (30) {G0,W9,D2,L3,V2,M3} I { ! is_connected_in( X, Y ), !
% 0.46/1.15 is_well_founded_in( X, Y ), alpha6( X, Y ) }.
% 0.46/1.15 parent1[0]: (258) {G12,W4,D3,L1,V0,M1} R(253,36);r(38) { is_well_founded_in
% 0.46/1.15 ( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (471) {G2,W4,D3,L1,V0,M1} { alpha6( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent0[0]: (470) {G1,W8,D3,L2,V0,M2} { ! is_connected_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha6( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (147) {G5,W4,D3,L1,V0,M1} R(41,122);r(107) { is_connected_in(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (261) {G13,W4,D3,L1,V0,M1} R(258,30);r(147) { alpha6( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (471) {G2,W4,D3,L1,V0,M1} { alpha6( skol1, relation_field( skol1
% 0.46/1.15 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (472) {G1,W8,D3,L2,V0,M2} { ! is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha4( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (27) {G0,W9,D2,L3,V2,M3} I { ! is_antisymmetric_in( X, Y ), !
% 0.46/1.15 alpha6( X, Y ), alpha4( X, Y ) }.
% 0.46/1.15 parent1[0]: (261) {G13,W4,D3,L1,V0,M1} R(258,30);r(147) { alpha6( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (473) {G2,W4,D3,L1,V0,M1} { alpha4( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent0[0]: (472) {G1,W8,D3,L2,V0,M2} { ! is_antisymmetric_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha4( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (145) {G4,W4,D3,L1,V0,M1} R(41,124);r(108) {
% 0.46/1.15 is_antisymmetric_in( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (262) {G14,W4,D3,L1,V0,M1} R(261,27);r(145) { alpha4( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (473) {G2,W4,D3,L1,V0,M1} { alpha4( skol1, relation_field( skol1
% 0.46/1.15 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (474) {G1,W8,D3,L2,V0,M2} { ! is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha2( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[1]: (24) {G0,W9,D2,L3,V2,M3} I { ! is_transitive_in( X, Y ), !
% 0.46/1.15 alpha4( X, Y ), alpha2( X, Y ) }.
% 0.46/1.15 parent1[0]: (262) {G14,W4,D3,L1,V0,M1} R(261,27);r(145) { alpha4( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (475) {G2,W4,D3,L1,V0,M1} { alpha2( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent0[0]: (474) {G1,W8,D3,L2,V0,M2} { ! is_transitive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), alpha2( skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (149) {G4,W4,D3,L1,V0,M1} R(41,120);r(95) { is_transitive_in(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (264) {G15,W4,D3,L1,V0,M1} R(262,24);r(149) { alpha2( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent0: (475) {G2,W4,D3,L1,V0,M1} { alpha2( skol1, relation_field( skol1
% 0.46/1.15 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (476) {G1,W10,D3,L3,V0,M3} { ! relation( skol1 ), !
% 0.46/1.15 is_reflexive_in( skol1, relation_field( skol1 ) ), well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[2]: (21) {G0,W11,D2,L4,V2,M4} I { ! relation( X ), !
% 0.46/1.15 is_reflexive_in( X, Y ), ! alpha2( X, Y ), well_orders( X, Y ) }.
% 0.46/1.15 parent1[0]: (264) {G15,W4,D3,L1,V0,M1} R(262,24);r(149) { alpha2( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 X := skol1
% 0.46/1.15 Y := relation_field( skol1 )
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (477) {G1,W8,D3,L2,V0,M2} { ! is_reflexive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), well_orders( skol1, relation_field( skol1 ) )
% 0.46/1.15 }.
% 0.46/1.15 parent0[0]: (476) {G1,W10,D3,L3,V0,M3} { ! relation( skol1 ), !
% 0.46/1.15 is_reflexive_in( skol1, relation_field( skol1 ) ), well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (38) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (265) {G16,W8,D3,L2,V0,M2} R(264,21);r(38) { ! is_reflexive_in
% 0.46/1.15 ( skol1, relation_field( skol1 ) ), well_orders( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent0: (477) {G1,W8,D3,L2,V0,M2} { ! is_reflexive_in( skol1,
% 0.46/1.15 relation_field( skol1 ) ), well_orders( skol1, relation_field( skol1 ) )
% 0.46/1.15 }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 0 ==> 0
% 0.46/1.15 1 ==> 1
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (478) {G13,W4,D3,L1,V0,M1} { well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 parent0[0]: (265) {G16,W8,D3,L2,V0,M2} R(264,21);r(38) { ! is_reflexive_in
% 0.46/1.15 ( skol1, relation_field( skol1 ) ), well_orders( skol1, relation_field(
% 0.46/1.15 skol1 ) ) }.
% 0.46/1.15 parent1[0]: (259) {G12,W4,D3,L1,V0,M1} R(256,32);r(38) { is_reflexive_in(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 resolution: (479) {G10,W0,D0,L0,V0,M0} { }.
% 0.46/1.15 parent0[0]: (219) {G9,W4,D3,L1,V0,M1} R(213,178);r(203) { ! well_orders(
% 0.46/1.15 skol1, relation_field( skol1 ) ) }.
% 0.46/1.15 parent1[0]: (478) {G13,W4,D3,L1,V0,M1} { well_orders( skol1,
% 0.46/1.15 relation_field( skol1 ) ) }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 substitution1:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 subsumption: (325) {G17,W0,D0,L0,V0,M0} S(265);r(259);r(219) { }.
% 0.46/1.15 parent0: (479) {G10,W0,D0,L0,V0,M0} { }.
% 0.46/1.15 substitution0:
% 0.46/1.15 end
% 0.46/1.15 permutation0:
% 0.46/1.15 end
% 0.46/1.15
% 0.46/1.15 Proof check complete!
% 0.46/1.15
% 0.46/1.15 Memory use:
% 0.46/1.15
% 0.46/1.15 space for terms: 3521
% 0.46/1.15 space for clauses: 15365
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 clauses generated: 1550
% 0.46/1.15 clauses kept: 326
% 0.46/1.15 clauses selected: 163
% 0.46/1.15 clauses deleted: 55
% 0.46/1.15 clauses inuse deleted: 0
% 0.46/1.15
% 0.46/1.15 subsentry: 1305
% 0.46/1.15 literals s-matched: 1199
% 0.46/1.15 literals matched: 1199
% 0.46/1.15 full subsumption: 0
% 0.46/1.15
% 0.46/1.15 checksum: -438082498
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 Bliksem ended
%------------------------------------------------------------------------------