%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:55 EDT 2022
% Result : Theorem 0.42s 1.07s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Mon Jun 20 04:31:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/1.07 *** allocated 10000 integers for termspace/termends
% 0.42/1.07 *** allocated 10000 integers for clauses
% 0.42/1.07 *** allocated 10000 integers for justifications
% 0.42/1.07 Bliksem 1.12
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Automatic Strategy Selection
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Clauses:
% 0.42/1.07
% 0.42/1.07 { set_intersection2( X, Y ) = set_intersection2( Y, X ) }.
% 0.42/1.07 { ! relation( X ), ! well_ordering( X ), reflexive( X ) }.
% 0.42/1.07 { ! relation( X ), ! well_ordering( X ), alpha1( X ) }.
% 0.42/1.07 { ! relation( X ), ! reflexive( X ), ! alpha1( X ), well_ordering( X ) }.
% 0.42/1.07 { ! alpha1( X ), transitive( X ) }.
% 0.42/1.07 { ! alpha1( X ), alpha2( X ) }.
% 0.42/1.07 { ! transitive( X ), ! alpha2( X ), alpha1( X ) }.
% 0.42/1.07 { ! alpha2( X ), antisymmetric( X ) }.
% 0.42/1.07 { ! alpha2( X ), alpha3( X ) }.
% 0.42/1.07 { ! antisymmetric( X ), ! alpha3( X ), alpha2( X ) }.
% 0.42/1.07 { ! alpha3( X ), connected( X ) }.
% 0.42/1.07 { ! alpha3( X ), well_founded_relation( X ) }.
% 0.42/1.07 { ! connected( X ), ! well_founded_relation( X ), alpha3( X ) }.
% 0.42/1.07 { ! relation( X ), relation_restriction( X, Y ) = set_intersection2( X,
% 0.42/1.07 cartesian_product2( Y, Y ) ) }.
% 0.42/1.07 { ! relation( X ), relation( relation_restriction( X, Y ) ) }.
% 0.42/1.07 { && }.
% 0.42/1.07 { && }.
% 0.42/1.07 { set_intersection2( X, X ) = X }.
% 0.42/1.07 { ! relation( X ), ! reflexive( X ), reflexive( relation_restriction( X, Y
% 0.42/1.07 ) ) }.
% 0.42/1.07 { ! relation( X ), ! connected( X ), connected( relation_restriction( X, Y
% 0.42/1.07 ) ) }.
% 0.42/1.07 { ! relation( X ), ! transitive( X ), transitive( relation_restriction( X,
% 0.42/1.07 Y ) ) }.
% 0.42/1.07 { ! relation( X ), ! antisymmetric( X ), antisymmetric(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 { ! relation( X ), ! well_founded_relation( X ), well_founded_relation(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 { relation( skol1 ) }.
% 0.42/1.07 { well_ordering( skol1 ) }.
% 0.42/1.07 { ! well_ordering( relation_restriction( skol1, skol2 ) ) }.
% 0.42/1.07
% 0.42/1.07 percentage equality = 0.053571, percentage horn = 1.000000
% 0.42/1.07 This is a problem with some equality
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Options Used:
% 0.42/1.07
% 0.42/1.07 useres = 1
% 0.42/1.07 useparamod = 1
% 0.42/1.07 useeqrefl = 1
% 0.42/1.07 useeqfact = 1
% 0.42/1.07 usefactor = 1
% 0.42/1.07 usesimpsplitting = 0
% 0.42/1.07 usesimpdemod = 5
% 0.42/1.07 usesimpres = 3
% 0.42/1.07
% 0.42/1.07 resimpinuse = 1000
% 0.42/1.07 resimpclauses = 20000
% 0.42/1.07 substype = eqrewr
% 0.42/1.07 backwardsubs = 1
% 0.42/1.07 selectoldest = 5
% 0.42/1.07
% 0.42/1.07 litorderings [0] = split
% 0.42/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.42/1.07
% 0.42/1.07 termordering = kbo
% 0.42/1.07
% 0.42/1.07 litapriori = 0
% 0.42/1.07 termapriori = 1
% 0.42/1.07 litaposteriori = 0
% 0.42/1.07 termaposteriori = 0
% 0.42/1.07 demodaposteriori = 0
% 0.42/1.07 ordereqreflfact = 0
% 0.42/1.07
% 0.42/1.07 litselect = negord
% 0.42/1.07
% 0.42/1.07 maxweight = 15
% 0.42/1.07 maxdepth = 30000
% 0.42/1.07 maxlength = 115
% 0.42/1.07 maxnrvars = 195
% 0.42/1.07 excuselevel = 1
% 0.42/1.07 increasemaxweight = 1
% 0.42/1.07
% 0.42/1.07 maxselected = 10000000
% 0.42/1.07 maxnrclauses = 10000000
% 0.42/1.07
% 0.42/1.07 showgenerated = 0
% 0.42/1.07 showkept = 0
% 0.42/1.07 showselected = 0
% 0.42/1.07 showdeleted = 0
% 0.42/1.07 showresimp = 1
% 0.42/1.07 showstatus = 2000
% 0.42/1.07
% 0.42/1.07 prologoutput = 0
% 0.42/1.07 nrgoals = 5000000
% 0.42/1.07 totalproof = 1
% 0.42/1.07
% 0.42/1.07 Symbols occurring in the translation:
% 0.42/1.07
% 0.42/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.07 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.42/1.07 && [3, 0] (w:1, o:4, a:1, s:1, b:0),
% 0.42/1.07 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.42/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.07 set_intersection2 [37, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.42/1.07 relation [38, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.42/1.07 well_ordering [39, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.42/1.07 reflexive [40, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.42/1.07 transitive [41, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.07 antisymmetric [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.07 connected [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.07 well_founded_relation [44, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.07 relation_restriction [45, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.42/1.07 cartesian_product2 [46, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.42/1.07 alpha1 [47, 1] (w:1, o:22, a:1, s:1, b:1),
% 0.42/1.07 alpha2 [48, 1] (w:1, o:23, a:1, s:1, b:1),
% 0.42/1.07 alpha3 [49, 1] (w:1, o:24, a:1, s:1, b:1),
% 0.42/1.07 skol1 [50, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.42/1.07 skol2 [51, 0] (w:1, o:9, a:1, s:1, b:1).
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Starting Search:
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Bliksems!, er is een bewijs:
% 0.42/1.07 % SZS status Theorem
% 0.42/1.07 % SZS output start Refutation
% 0.42/1.07
% 0.42/1.07 (1) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering( X ),
% 0.42/1.07 reflexive( X ) }.
% 0.42/1.07 (2) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering( X ), alpha1(
% 0.42/1.07 X ) }.
% 0.42/1.07 (3) {G0,W8,D2,L4,V1,M4} I { ! relation( X ), ! reflexive( X ), ! alpha1( X
% 0.42/1.07 ), well_ordering( X ) }.
% 0.42/1.07 (4) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), transitive( X ) }.
% 0.42/1.07 (5) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha2( X ) }.
% 0.42/1.07 (6) {G0,W6,D2,L3,V1,M3} I { ! transitive( X ), ! alpha2( X ), alpha1( X )
% 0.42/1.07 }.
% 0.42/1.07 (7) {G0,W4,D2,L2,V1,M2} I { ! alpha2( X ), antisymmetric( X ) }.
% 0.42/1.07 (8) {G0,W4,D2,L2,V1,M2} I { ! alpha2( X ), alpha3( X ) }.
% 0.42/1.07 (9) {G0,W6,D2,L3,V1,M3} I { ! antisymmetric( X ), ! alpha3( X ), alpha2( X
% 0.42/1.07 ) }.
% 0.42/1.07 (10) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), connected( X ) }.
% 0.42/1.07 (11) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), well_founded_relation( X ) }.
% 0.42/1.07 (12) {G0,W6,D2,L3,V1,M3} I { ! connected( X ), ! well_founded_relation( X )
% 0.42/1.07 , alpha3( X ) }.
% 0.42/1.07 (14) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 (17) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! reflexive( X ), reflexive(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 (18) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! connected( X ), connected(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 (19) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! transitive( X ), transitive
% 0.42/1.07 ( relation_restriction( X, Y ) ) }.
% 0.42/1.07 (20) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! antisymmetric( X ),
% 0.42/1.07 antisymmetric( relation_restriction( X, Y ) ) }.
% 0.42/1.07 (21) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! well_founded_relation( X )
% 0.42/1.07 , well_founded_relation( relation_restriction( X, Y ) ) }.
% 0.42/1.07 (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 (23) {G0,W2,D2,L1,V0,M1} I { well_ordering( skol1 ) }.
% 0.42/1.07 (24) {G0,W4,D3,L1,V0,M1} I { ! well_ordering( relation_restriction( skol1,
% 0.42/1.07 skol2 ) ) }.
% 0.42/1.07 (25) {G1,W4,D2,L2,V1,M2} R(8,10) { ! alpha2( X ), connected( X ) }.
% 0.42/1.07 (26) {G1,W4,D2,L2,V1,M2} R(8,11) { ! alpha2( X ), well_founded_relation( X
% 0.42/1.07 ) }.
% 0.42/1.07 (27) {G1,W2,D2,L1,V0,M1} R(1,22);r(23) { reflexive( skol1 ) }.
% 0.42/1.07 (28) {G1,W4,D2,L2,V1,M2} R(5,7) { ! alpha1( X ), antisymmetric( X ) }.
% 0.42/1.07 (29) {G2,W4,D2,L2,V1,M2} R(5,26) { ! alpha1( X ), well_founded_relation( X
% 0.42/1.07 ) }.
% 0.42/1.07 (35) {G1,W2,D2,L1,V0,M1} R(2,22);r(23) { alpha1( skol1 ) }.
% 0.42/1.07 (36) {G3,W2,D2,L1,V0,M1} R(35,29) { well_founded_relation( skol1 ) }.
% 0.42/1.07 (37) {G2,W2,D2,L1,V0,M1} R(35,28) { antisymmetric( skol1 ) }.
% 0.42/1.07 (38) {G2,W2,D2,L1,V0,M1} R(35,5) { alpha2( skol1 ) }.
% 0.42/1.07 (39) {G3,W2,D2,L1,V0,M1} R(38,25) { connected( skol1 ) }.
% 0.42/1.07 (43) {G2,W2,D2,L1,V0,M1} R(4,35) { transitive( skol1 ) }.
% 0.42/1.07 (47) {G1,W8,D2,L4,V1,M4} R(9,6) { ! antisymmetric( X ), ! alpha3( X ), !
% 0.42/1.07 transitive( X ), alpha1( X ) }.
% 0.42/1.07 (59) {G1,W4,D3,L1,V1,M1} R(14,22) { relation( relation_restriction( skol1,
% 0.42/1.07 X ) ) }.
% 0.42/1.07 (91) {G2,W4,D3,L1,V1,M1} R(17,27);r(22) { reflexive( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 (94) {G3,W8,D3,L2,V1,M2} R(91,3);r(59) { ! alpha1( relation_restriction(
% 0.42/1.07 skol1, X ) ), well_ordering( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 (98) {G4,W4,D3,L1,V0,M1} R(94,24) { ! alpha1( relation_restriction( skol1,
% 0.42/1.07 skol2 ) ) }.
% 0.42/1.07 (108) {G4,W4,D3,L1,V1,M1} R(18,39);r(22) { connected( relation_restriction
% 0.42/1.07 ( skol1, X ) ) }.
% 0.42/1.07 (113) {G5,W8,D3,L2,V1,M2} R(108,12) { ! well_founded_relation(
% 0.42/1.07 relation_restriction( skol1, X ) ), alpha3( relation_restriction( skol1,
% 0.42/1.07 X ) ) }.
% 0.42/1.07 (122) {G3,W4,D3,L1,V1,M1} R(19,43);r(22) { transitive( relation_restriction
% 0.42/1.07 ( skol1, X ) ) }.
% 0.42/1.07 (141) {G3,W4,D3,L1,V1,M1} R(20,37);r(22) { antisymmetric(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 (145) {G4,W8,D3,L2,V1,M2} R(141,47);r(122) { ! alpha3( relation_restriction
% 0.42/1.07 ( skol1, X ) ), alpha1( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 (153) {G5,W4,D3,L1,V0,M1} R(145,98) { ! alpha3( relation_restriction( skol1
% 0.42/1.07 , skol2 ) ) }.
% 0.42/1.07 (163) {G4,W4,D3,L1,V1,M1} R(21,36);r(22) { well_founded_relation(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 (168) {G6,W4,D3,L1,V1,M1} R(163,113) { alpha3( relation_restriction( skol1
% 0.42/1.07 , X ) ) }.
% 0.42/1.07 (170) {G7,W0,D0,L0,V0,M0} R(168,153) { }.
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 % SZS output end Refutation
% 0.42/1.07 found a proof!
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Unprocessed initial clauses:
% 0.42/1.07
% 0.42/1.07 (172) {G0,W7,D3,L1,V2,M1} { set_intersection2( X, Y ) = set_intersection2
% 0.42/1.07 ( Y, X ) }.
% 0.42/1.07 (173) {G0,W6,D2,L3,V1,M3} { ! relation( X ), ! well_ordering( X ),
% 0.42/1.07 reflexive( X ) }.
% 0.42/1.07 (174) {G0,W6,D2,L3,V1,M3} { ! relation( X ), ! well_ordering( X ), alpha1
% 0.42/1.07 ( X ) }.
% 0.42/1.07 (175) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! reflexive( X ), ! alpha1( X
% 0.42/1.07 ), well_ordering( X ) }.
% 0.42/1.07 (176) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), transitive( X ) }.
% 0.42/1.07 (177) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), alpha2( X ) }.
% 0.42/1.07 (178) {G0,W6,D2,L3,V1,M3} { ! transitive( X ), ! alpha2( X ), alpha1( X )
% 0.42/1.07 }.
% 0.42/1.07 (179) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), antisymmetric( X ) }.
% 0.42/1.07 (180) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), alpha3( X ) }.
% 0.42/1.07 (181) {G0,W6,D2,L3,V1,M3} { ! antisymmetric( X ), ! alpha3( X ), alpha2( X
% 0.42/1.07 ) }.
% 0.42/1.07 (182) {G0,W4,D2,L2,V1,M2} { ! alpha3( X ), connected( X ) }.
% 0.42/1.07 (183) {G0,W4,D2,L2,V1,M2} { ! alpha3( X ), well_founded_relation( X ) }.
% 0.42/1.07 (184) {G0,W6,D2,L3,V1,M3} { ! connected( X ), ! well_founded_relation( X )
% 0.42/1.07 , alpha3( X ) }.
% 0.42/1.07 (185) {G0,W11,D4,L2,V2,M2} { ! relation( X ), relation_restriction( X, Y )
% 0.42/1.07 = set_intersection2( X, cartesian_product2( Y, Y ) ) }.
% 0.42/1.07 (186) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 (187) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.07 (188) {G0,W1,D1,L1,V0,M1} { && }.
% 0.42/1.07 (189) {G0,W5,D3,L1,V1,M1} { set_intersection2( X, X ) = X }.
% 0.42/1.07 (190) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! reflexive( X ), reflexive(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 (191) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! connected( X ), connected(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 (192) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! transitive( X ), transitive
% 0.42/1.07 ( relation_restriction( X, Y ) ) }.
% 0.42/1.07 (193) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! antisymmetric( X ),
% 0.42/1.07 antisymmetric( relation_restriction( X, Y ) ) }.
% 0.42/1.07 (194) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! well_founded_relation( X )
% 0.42/1.07 , well_founded_relation( relation_restriction( X, Y ) ) }.
% 0.42/1.07 (195) {G0,W2,D2,L1,V0,M1} { relation( skol1 ) }.
% 0.42/1.07 (196) {G0,W2,D2,L1,V0,M1} { well_ordering( skol1 ) }.
% 0.42/1.07 (197) {G0,W4,D3,L1,V0,M1} { ! well_ordering( relation_restriction( skol1,
% 0.42/1.07 skol2 ) ) }.
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Total Proof:
% 0.42/1.07
% 0.42/1.07 subsumption: (1) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering(
% 0.42/1.07 X ), reflexive( X ) }.
% 0.42/1.07 parent0: (173) {G0,W6,D2,L3,V1,M3} { ! relation( X ), ! well_ordering( X )
% 0.42/1.07 , reflexive( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (2) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering(
% 0.42/1.07 X ), alpha1( X ) }.
% 0.42/1.07 parent0: (174) {G0,W6,D2,L3,V1,M3} { ! relation( X ), ! well_ordering( X )
% 0.42/1.07 , alpha1( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (3) {G0,W8,D2,L4,V1,M4} I { ! relation( X ), ! reflexive( X )
% 0.42/1.07 , ! alpha1( X ), well_ordering( X ) }.
% 0.42/1.07 parent0: (175) {G0,W8,D2,L4,V1,M4} { ! relation( X ), ! reflexive( X ), !
% 0.42/1.07 alpha1( X ), well_ordering( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 3 ==> 3
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (4) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), transitive( X ) }.
% 0.42/1.07 parent0: (176) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), transitive( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (5) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha2( X ) }.
% 0.42/1.07 parent0: (177) {G0,W4,D2,L2,V1,M2} { ! alpha1( X ), alpha2( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (6) {G0,W6,D2,L3,V1,M3} I { ! transitive( X ), ! alpha2( X ),
% 0.42/1.07 alpha1( X ) }.
% 0.42/1.07 parent0: (178) {G0,W6,D2,L3,V1,M3} { ! transitive( X ), ! alpha2( X ),
% 0.42/1.07 alpha1( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (7) {G0,W4,D2,L2,V1,M2} I { ! alpha2( X ), antisymmetric( X )
% 0.42/1.07 }.
% 0.42/1.07 parent0: (179) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), antisymmetric( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (8) {G0,W4,D2,L2,V1,M2} I { ! alpha2( X ), alpha3( X ) }.
% 0.42/1.07 parent0: (180) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), alpha3( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (9) {G0,W6,D2,L3,V1,M3} I { ! antisymmetric( X ), ! alpha3( X
% 0.42/1.07 ), alpha2( X ) }.
% 0.42/1.07 parent0: (181) {G0,W6,D2,L3,V1,M3} { ! antisymmetric( X ), ! alpha3( X ),
% 0.42/1.07 alpha2( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (10) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), connected( X ) }.
% 0.42/1.07 parent0: (182) {G0,W4,D2,L2,V1,M2} { ! alpha3( X ), connected( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (11) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ),
% 0.42/1.07 well_founded_relation( X ) }.
% 0.42/1.07 parent0: (183) {G0,W4,D2,L2,V1,M2} { ! alpha3( X ), well_founded_relation
% 0.42/1.07 ( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (12) {G0,W6,D2,L3,V1,M3} I { ! connected( X ), !
% 0.42/1.07 well_founded_relation( X ), alpha3( X ) }.
% 0.42/1.07 parent0: (184) {G0,W6,D2,L3,V1,M3} { ! connected( X ), !
% 0.42/1.07 well_founded_relation( X ), alpha3( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (14) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent0: (186) {G0,W6,D3,L2,V2,M2} { ! relation( X ), relation(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (17) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! reflexive( X )
% 0.42/1.07 , reflexive( relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent0: (190) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! reflexive( X ),
% 0.42/1.07 reflexive( relation_restriction( X, Y ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 *** allocated 15000 integers for clauses
% 0.42/1.07 subsumption: (18) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! connected( X )
% 0.42/1.07 , connected( relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent0: (191) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! connected( X ),
% 0.42/1.07 connected( relation_restriction( X, Y ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (19) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! transitive( X
% 0.42/1.07 ), transitive( relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent0: (192) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! transitive( X ),
% 0.42/1.07 transitive( relation_restriction( X, Y ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (20) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! antisymmetric
% 0.42/1.07 ( X ), antisymmetric( relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent0: (193) {G0,W8,D3,L3,V2,M3} { ! relation( X ), ! antisymmetric( X )
% 0.42/1.07 , antisymmetric( relation_restriction( X, Y ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (21) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), !
% 0.42/1.07 well_founded_relation( X ), well_founded_relation( relation_restriction(
% 0.42/1.07 X, Y ) ) }.
% 0.42/1.07 parent0: (194) {G0,W8,D3,L3,V2,M3} { ! relation( X ), !
% 0.42/1.07 well_founded_relation( X ), well_founded_relation( relation_restriction(
% 0.42/1.07 X, Y ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 Y := Y
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 2 ==> 2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 parent0: (195) {G0,W2,D2,L1,V0,M1} { relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (23) {G0,W2,D2,L1,V0,M1} I { well_ordering( skol1 ) }.
% 0.42/1.07 parent0: (196) {G0,W2,D2,L1,V0,M1} { well_ordering( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (24) {G0,W4,D3,L1,V0,M1} I { ! well_ordering(
% 0.42/1.07 relation_restriction( skol1, skol2 ) ) }.
% 0.42/1.07 parent0: (197) {G0,W4,D3,L1,V0,M1} { ! well_ordering( relation_restriction
% 0.42/1.07 ( skol1, skol2 ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (215) {G1,W4,D2,L2,V1,M2} { connected( X ), ! alpha2( X ) }.
% 0.42/1.07 parent0[0]: (10) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ), connected( X ) }.
% 0.42/1.07 parent1[1]: (8) {G0,W4,D2,L2,V1,M2} I { ! alpha2( X ), alpha3( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (25) {G1,W4,D2,L2,V1,M2} R(8,10) { ! alpha2( X ), connected( X
% 0.42/1.07 ) }.
% 0.42/1.07 parent0: (215) {G1,W4,D2,L2,V1,M2} { connected( X ), ! alpha2( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 1
% 0.42/1.07 1 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (216) {G1,W4,D2,L2,V1,M2} { well_founded_relation( X ), !
% 0.42/1.07 alpha2( X ) }.
% 0.42/1.07 parent0[0]: (11) {G0,W4,D2,L2,V1,M2} I { ! alpha3( X ),
% 0.42/1.07 well_founded_relation( X ) }.
% 0.42/1.07 parent1[1]: (8) {G0,W4,D2,L2,V1,M2} I { ! alpha2( X ), alpha3( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (26) {G1,W4,D2,L2,V1,M2} R(8,11) { ! alpha2( X ),
% 0.42/1.07 well_founded_relation( X ) }.
% 0.42/1.07 parent0: (216) {G1,W4,D2,L2,V1,M2} { well_founded_relation( X ), ! alpha2
% 0.42/1.07 ( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 1
% 0.42/1.07 1 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (217) {G1,W4,D2,L2,V0,M2} { ! well_ordering( skol1 ),
% 0.42/1.07 reflexive( skol1 ) }.
% 0.42/1.07 parent0[0]: (1) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering( X
% 0.42/1.07 ), reflexive( X ) }.
% 0.42/1.07 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (218) {G1,W2,D2,L1,V0,M1} { reflexive( skol1 ) }.
% 0.42/1.07 parent0[0]: (217) {G1,W4,D2,L2,V0,M2} { ! well_ordering( skol1 ),
% 0.42/1.07 reflexive( skol1 ) }.
% 0.42/1.07 parent1[0]: (23) {G0,W2,D2,L1,V0,M1} I { well_ordering( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (27) {G1,W2,D2,L1,V0,M1} R(1,22);r(23) { reflexive( skol1 )
% 0.42/1.07 }.
% 0.42/1.07 parent0: (218) {G1,W2,D2,L1,V0,M1} { reflexive( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (219) {G1,W4,D2,L2,V1,M2} { antisymmetric( X ), ! alpha1( X )
% 0.42/1.07 }.
% 0.42/1.07 parent0[0]: (7) {G0,W4,D2,L2,V1,M2} I { ! alpha2( X ), antisymmetric( X )
% 0.42/1.07 }.
% 0.42/1.07 parent1[1]: (5) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha2( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (28) {G1,W4,D2,L2,V1,M2} R(5,7) { ! alpha1( X ), antisymmetric
% 0.42/1.07 ( X ) }.
% 0.42/1.07 parent0: (219) {G1,W4,D2,L2,V1,M2} { antisymmetric( X ), ! alpha1( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 1
% 0.42/1.07 1 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (220) {G1,W4,D2,L2,V1,M2} { well_founded_relation( X ), !
% 0.42/1.07 alpha1( X ) }.
% 0.42/1.07 parent0[0]: (26) {G1,W4,D2,L2,V1,M2} R(8,11) { ! alpha2( X ),
% 0.42/1.07 well_founded_relation( X ) }.
% 0.42/1.07 parent1[1]: (5) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha2( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (29) {G2,W4,D2,L2,V1,M2} R(5,26) { ! alpha1( X ),
% 0.42/1.07 well_founded_relation( X ) }.
% 0.42/1.07 parent0: (220) {G1,W4,D2,L2,V1,M2} { well_founded_relation( X ), ! alpha1
% 0.42/1.07 ( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 1
% 0.42/1.07 1 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (221) {G1,W4,D2,L2,V0,M2} { ! well_ordering( skol1 ), alpha1(
% 0.42/1.07 skol1 ) }.
% 0.42/1.07 parent0[0]: (2) {G0,W6,D2,L3,V1,M3} I { ! relation( X ), ! well_ordering( X
% 0.42/1.07 ), alpha1( X ) }.
% 0.42/1.07 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (222) {G1,W2,D2,L1,V0,M1} { alpha1( skol1 ) }.
% 0.42/1.07 parent0[0]: (221) {G1,W4,D2,L2,V0,M2} { ! well_ordering( skol1 ), alpha1(
% 0.42/1.07 skol1 ) }.
% 0.42/1.07 parent1[0]: (23) {G0,W2,D2,L1,V0,M1} I { well_ordering( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (35) {G1,W2,D2,L1,V0,M1} R(2,22);r(23) { alpha1( skol1 ) }.
% 0.42/1.07 parent0: (222) {G1,W2,D2,L1,V0,M1} { alpha1( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (223) {G2,W2,D2,L1,V0,M1} { well_founded_relation( skol1 ) }.
% 0.42/1.07 parent0[0]: (29) {G2,W4,D2,L2,V1,M2} R(5,26) { ! alpha1( X ),
% 0.42/1.07 well_founded_relation( X ) }.
% 0.42/1.07 parent1[0]: (35) {G1,W2,D2,L1,V0,M1} R(2,22);r(23) { alpha1( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (36) {G3,W2,D2,L1,V0,M1} R(35,29) { well_founded_relation(
% 0.42/1.07 skol1 ) }.
% 0.42/1.07 parent0: (223) {G2,W2,D2,L1,V0,M1} { well_founded_relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (224) {G2,W2,D2,L1,V0,M1} { antisymmetric( skol1 ) }.
% 0.42/1.07 parent0[0]: (28) {G1,W4,D2,L2,V1,M2} R(5,7) { ! alpha1( X ), antisymmetric
% 0.42/1.07 ( X ) }.
% 0.42/1.07 parent1[0]: (35) {G1,W2,D2,L1,V0,M1} R(2,22);r(23) { alpha1( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (37) {G2,W2,D2,L1,V0,M1} R(35,28) { antisymmetric( skol1 ) }.
% 0.42/1.07 parent0: (224) {G2,W2,D2,L1,V0,M1} { antisymmetric( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (225) {G1,W2,D2,L1,V0,M1} { alpha2( skol1 ) }.
% 0.42/1.07 parent0[0]: (5) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), alpha2( X ) }.
% 0.42/1.07 parent1[0]: (35) {G1,W2,D2,L1,V0,M1} R(2,22);r(23) { alpha1( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (38) {G2,W2,D2,L1,V0,M1} R(35,5) { alpha2( skol1 ) }.
% 0.42/1.07 parent0: (225) {G1,W2,D2,L1,V0,M1} { alpha2( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (226) {G2,W2,D2,L1,V0,M1} { connected( skol1 ) }.
% 0.42/1.07 parent0[0]: (25) {G1,W4,D2,L2,V1,M2} R(8,10) { ! alpha2( X ), connected( X
% 0.42/1.07 ) }.
% 0.42/1.07 parent1[0]: (38) {G2,W2,D2,L1,V0,M1} R(35,5) { alpha2( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (39) {G3,W2,D2,L1,V0,M1} R(38,25) { connected( skol1 ) }.
% 0.42/1.07 parent0: (226) {G2,W2,D2,L1,V0,M1} { connected( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (227) {G1,W2,D2,L1,V0,M1} { transitive( skol1 ) }.
% 0.42/1.07 parent0[0]: (4) {G0,W4,D2,L2,V1,M2} I { ! alpha1( X ), transitive( X ) }.
% 0.42/1.07 parent1[0]: (35) {G1,W2,D2,L1,V0,M1} R(2,22);r(23) { alpha1( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (43) {G2,W2,D2,L1,V0,M1} R(4,35) { transitive( skol1 ) }.
% 0.42/1.07 parent0: (227) {G1,W2,D2,L1,V0,M1} { transitive( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (228) {G1,W8,D2,L4,V1,M4} { ! transitive( X ), alpha1( X ), !
% 0.42/1.07 antisymmetric( X ), ! alpha3( X ) }.
% 0.42/1.07 parent0[1]: (6) {G0,W6,D2,L3,V1,M3} I { ! transitive( X ), ! alpha2( X ),
% 0.42/1.07 alpha1( X ) }.
% 0.42/1.07 parent1[2]: (9) {G0,W6,D2,L3,V1,M3} I { ! antisymmetric( X ), ! alpha3( X )
% 0.42/1.07 , alpha2( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (47) {G1,W8,D2,L4,V1,M4} R(9,6) { ! antisymmetric( X ), !
% 0.42/1.07 alpha3( X ), ! transitive( X ), alpha1( X ) }.
% 0.42/1.07 parent0: (228) {G1,W8,D2,L4,V1,M4} { ! transitive( X ), alpha1( X ), !
% 0.42/1.07 antisymmetric( X ), ! alpha3( X ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 2
% 0.42/1.07 1 ==> 3
% 0.42/1.07 2 ==> 0
% 0.42/1.07 3 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (229) {G1,W4,D3,L1,V1,M1} { relation( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 parent0[0]: (14) {G0,W6,D3,L2,V2,M2} I { ! relation( X ), relation(
% 0.42/1.07 relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (59) {G1,W4,D3,L1,V1,M1} R(14,22) { relation(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0: (229) {G1,W4,D3,L1,V1,M1} { relation( relation_restriction( skol1
% 0.42/1.07 , X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (230) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ), reflexive(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[1]: (17) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! reflexive( X )
% 0.42/1.07 , reflexive( relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent1[0]: (27) {G1,W2,D2,L1,V0,M1} R(1,22);r(23) { reflexive( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (231) {G1,W4,D3,L1,V1,M1} { reflexive( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 parent0[0]: (230) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ), reflexive(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (91) {G2,W4,D3,L1,V1,M1} R(17,27);r(22) { reflexive(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0: (231) {G1,W4,D3,L1,V1,M1} { reflexive( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (232) {G1,W12,D3,L3,V1,M3} { ! relation( relation_restriction
% 0.42/1.07 ( skol1, X ) ), ! alpha1( relation_restriction( skol1, X ) ),
% 0.42/1.07 well_ordering( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[1]: (3) {G0,W8,D2,L4,V1,M4} I { ! relation( X ), ! reflexive( X ),
% 0.42/1.07 ! alpha1( X ), well_ordering( X ) }.
% 0.42/1.07 parent1[0]: (91) {G2,W4,D3,L1,V1,M1} R(17,27);r(22) { reflexive(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := relation_restriction( skol1, X )
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (233) {G2,W8,D3,L2,V1,M2} { ! alpha1( relation_restriction(
% 0.42/1.07 skol1, X ) ), well_ordering( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[0]: (232) {G1,W12,D3,L3,V1,M3} { ! relation( relation_restriction
% 0.42/1.07 ( skol1, X ) ), ! alpha1( relation_restriction( skol1, X ) ),
% 0.42/1.07 well_ordering( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent1[0]: (59) {G1,W4,D3,L1,V1,M1} R(14,22) { relation(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (94) {G3,W8,D3,L2,V1,M2} R(91,3);r(59) { ! alpha1(
% 0.42/1.07 relation_restriction( skol1, X ) ), well_ordering( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 parent0: (233) {G2,W8,D3,L2,V1,M2} { ! alpha1( relation_restriction( skol1
% 0.42/1.07 , X ) ), well_ordering( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (234) {G1,W4,D3,L1,V0,M1} { ! alpha1( relation_restriction(
% 0.42/1.07 skol1, skol2 ) ) }.
% 0.42/1.07 parent0[0]: (24) {G0,W4,D3,L1,V0,M1} I { ! well_ordering(
% 0.42/1.07 relation_restriction( skol1, skol2 ) ) }.
% 0.42/1.07 parent1[1]: (94) {G3,W8,D3,L2,V1,M2} R(91,3);r(59) { ! alpha1(
% 0.42/1.07 relation_restriction( skol1, X ) ), well_ordering( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := skol2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (98) {G4,W4,D3,L1,V0,M1} R(94,24) { ! alpha1(
% 0.42/1.07 relation_restriction( skol1, skol2 ) ) }.
% 0.42/1.07 parent0: (234) {G1,W4,D3,L1,V0,M1} { ! alpha1( relation_restriction( skol1
% 0.42/1.07 , skol2 ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (235) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ), connected(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[1]: (18) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! connected( X )
% 0.42/1.07 , connected( relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent1[0]: (39) {G3,W2,D2,L1,V0,M1} R(38,25) { connected( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (236) {G1,W4,D3,L1,V1,M1} { connected( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 parent0[0]: (235) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ), connected(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (108) {G4,W4,D3,L1,V1,M1} R(18,39);r(22) { connected(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0: (236) {G1,W4,D3,L1,V1,M1} { connected( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (237) {G1,W8,D3,L2,V1,M2} { ! well_founded_relation(
% 0.42/1.07 relation_restriction( skol1, X ) ), alpha3( relation_restriction( skol1,
% 0.42/1.07 X ) ) }.
% 0.42/1.07 parent0[0]: (12) {G0,W6,D2,L3,V1,M3} I { ! connected( X ), !
% 0.42/1.07 well_founded_relation( X ), alpha3( X ) }.
% 0.42/1.07 parent1[0]: (108) {G4,W4,D3,L1,V1,M1} R(18,39);r(22) { connected(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := relation_restriction( skol1, X )
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (113) {G5,W8,D3,L2,V1,M2} R(108,12) { ! well_founded_relation
% 0.42/1.07 ( relation_restriction( skol1, X ) ), alpha3( relation_restriction( skol1
% 0.42/1.07 , X ) ) }.
% 0.42/1.07 parent0: (237) {G1,W8,D3,L2,V1,M2} { ! well_founded_relation(
% 0.42/1.07 relation_restriction( skol1, X ) ), alpha3( relation_restriction( skol1,
% 0.42/1.07 X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (238) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ), transitive(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[1]: (19) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! transitive( X )
% 0.42/1.07 , transitive( relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent1[0]: (43) {G2,W2,D2,L1,V0,M1} R(4,35) { transitive( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (239) {G1,W4,D3,L1,V1,M1} { transitive( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 parent0[0]: (238) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ), transitive(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (122) {G3,W4,D3,L1,V1,M1} R(19,43);r(22) { transitive(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0: (239) {G1,W4,D3,L1,V1,M1} { transitive( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (240) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ), antisymmetric
% 0.42/1.07 ( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[1]: (20) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), ! antisymmetric(
% 0.42/1.07 X ), antisymmetric( relation_restriction( X, Y ) ) }.
% 0.42/1.07 parent1[0]: (37) {G2,W2,D2,L1,V0,M1} R(35,28) { antisymmetric( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (241) {G1,W4,D3,L1,V1,M1} { antisymmetric(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[0]: (240) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ), antisymmetric
% 0.42/1.07 ( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (141) {G3,W4,D3,L1,V1,M1} R(20,37);r(22) { antisymmetric(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0: (241) {G1,W4,D3,L1,V1,M1} { antisymmetric( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (242) {G2,W12,D3,L3,V1,M3} { ! alpha3( relation_restriction(
% 0.42/1.07 skol1, X ) ), ! transitive( relation_restriction( skol1, X ) ), alpha1(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[0]: (47) {G1,W8,D2,L4,V1,M4} R(9,6) { ! antisymmetric( X ), !
% 0.42/1.07 alpha3( X ), ! transitive( X ), alpha1( X ) }.
% 0.42/1.07 parent1[0]: (141) {G3,W4,D3,L1,V1,M1} R(20,37);r(22) { antisymmetric(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := relation_restriction( skol1, X )
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (243) {G3,W8,D3,L2,V1,M2} { ! alpha3( relation_restriction(
% 0.42/1.07 skol1, X ) ), alpha1( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[1]: (242) {G2,W12,D3,L3,V1,M3} { ! alpha3( relation_restriction(
% 0.42/1.07 skol1, X ) ), ! transitive( relation_restriction( skol1, X ) ), alpha1(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent1[0]: (122) {G3,W4,D3,L1,V1,M1} R(19,43);r(22) { transitive(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (145) {G4,W8,D3,L2,V1,M2} R(141,47);r(122) { ! alpha3(
% 0.42/1.07 relation_restriction( skol1, X ) ), alpha1( relation_restriction( skol1,
% 0.42/1.07 X ) ) }.
% 0.42/1.07 parent0: (243) {G3,W8,D3,L2,V1,M2} { ! alpha3( relation_restriction( skol1
% 0.42/1.07 , X ) ), alpha1( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 1 ==> 1
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (244) {G5,W4,D3,L1,V0,M1} { ! alpha3( relation_restriction(
% 0.42/1.07 skol1, skol2 ) ) }.
% 0.42/1.07 parent0[0]: (98) {G4,W4,D3,L1,V0,M1} R(94,24) { ! alpha1(
% 0.42/1.07 relation_restriction( skol1, skol2 ) ) }.
% 0.42/1.07 parent1[1]: (145) {G4,W8,D3,L2,V1,M2} R(141,47);r(122) { ! alpha3(
% 0.42/1.07 relation_restriction( skol1, X ) ), alpha1( relation_restriction( skol1,
% 0.42/1.07 X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := skol2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (153) {G5,W4,D3,L1,V0,M1} R(145,98) { ! alpha3(
% 0.42/1.07 relation_restriction( skol1, skol2 ) ) }.
% 0.42/1.07 parent0: (244) {G5,W4,D3,L1,V0,M1} { ! alpha3( relation_restriction( skol1
% 0.42/1.07 , skol2 ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (245) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ),
% 0.42/1.07 well_founded_relation( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[1]: (21) {G0,W8,D3,L3,V2,M3} I { ! relation( X ), !
% 0.42/1.07 well_founded_relation( X ), well_founded_relation( relation_restriction(
% 0.42/1.07 X, Y ) ) }.
% 0.42/1.07 parent1[0]: (36) {G3,W2,D2,L1,V0,M1} R(35,29) { well_founded_relation(
% 0.42/1.07 skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := skol1
% 0.42/1.07 Y := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (246) {G1,W4,D3,L1,V1,M1} { well_founded_relation(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0[0]: (245) {G1,W6,D3,L2,V1,M2} { ! relation( skol1 ),
% 0.42/1.07 well_founded_relation( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent1[0]: (22) {G0,W2,D2,L1,V0,M1} I { relation( skol1 ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (163) {G4,W4,D3,L1,V1,M1} R(21,36);r(22) {
% 0.42/1.07 well_founded_relation( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0: (246) {G1,W4,D3,L1,V1,M1} { well_founded_relation(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (247) {G5,W4,D3,L1,V1,M1} { alpha3( relation_restriction(
% 0.42/1.07 skol1, X ) ) }.
% 0.42/1.07 parent0[0]: (113) {G5,W8,D3,L2,V1,M2} R(108,12) { ! well_founded_relation(
% 0.42/1.07 relation_restriction( skol1, X ) ), alpha3( relation_restriction( skol1,
% 0.42/1.07 X ) ) }.
% 0.42/1.07 parent1[0]: (163) {G4,W4,D3,L1,V1,M1} R(21,36);r(22) {
% 0.42/1.07 well_founded_relation( relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (168) {G6,W4,D3,L1,V1,M1} R(163,113) { alpha3(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 parent0: (247) {G5,W4,D3,L1,V1,M1} { alpha3( relation_restriction( skol1,
% 0.42/1.07 X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 X := X
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 0 ==> 0
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 resolution: (248) {G6,W0,D0,L0,V0,M0} { }.
% 0.42/1.07 parent0[0]: (153) {G5,W4,D3,L1,V0,M1} R(145,98) { ! alpha3(
% 0.42/1.07 relation_restriction( skol1, skol2 ) ) }.
% 0.42/1.07 parent1[0]: (168) {G6,W4,D3,L1,V1,M1} R(163,113) { alpha3(
% 0.42/1.07 relation_restriction( skol1, X ) ) }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 substitution1:
% 0.42/1.07 X := skol2
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 subsumption: (170) {G7,W0,D0,L0,V0,M0} R(168,153) { }.
% 0.42/1.07 parent0: (248) {G6,W0,D0,L0,V0,M0} { }.
% 0.42/1.07 substitution0:
% 0.42/1.07 end
% 0.42/1.07 permutation0:
% 0.42/1.07 end
% 0.42/1.07
% 0.42/1.07 Proof check complete!
% 0.42/1.07
% 0.42/1.07 Memory use:
% 0.42/1.07
% 0.42/1.07 space for terms: 2023
% 0.42/1.07 space for clauses: 9354
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 clauses generated: 386
% 0.42/1.07 clauses kept: 171
% 0.42/1.07 clauses selected: 68
% 0.42/1.07 clauses deleted: 0
% 0.42/1.07 clauses inuse deleted: 0
% 0.42/1.07
% 0.42/1.07 subsentry: 345
% 0.42/1.07 literals s-matched: 292
% 0.42/1.07 literals matched: 292
% 0.42/1.07 full subsumption: 0
% 0.42/1.07
% 0.42/1.07 checksum: 1850206350
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 Bliksem ended
%------------------------------------------------------------------------------