TSTP Solution File: MGT017+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : MGT017+1 : TPTP v8.1.0. Released v2.0.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 : Sun Jul 17 21:57:38 EDT 2022
% Result : Theorem 0.69s 1.10s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT017+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Thu Jun 9 08:09:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10
% 0.69/1.10 { ! organization( X, Y ), inertia( X, skol1( X, Y ), Y ) }.
% 0.69/1.10 { ! organization( Z, T ), ! organization( U, W ), ! class( Z, V0, T ), !
% 0.69/1.10 class( U, V0, W ), ! size( Z, V1, T ), ! size( U, V2, W ), ! inertia( Z,
% 0.69/1.10 X, T ), ! inertia( U, Y, W ), ! greater( V2, V1 ), greater( Y, X ) }.
% 0.69/1.10 { ! organization( Z, T ), ! organization( U, T ), ! organization( U, Y ), !
% 0.69/1.10 class( Z, W, T ), ! class( U, W, T ), ! reorganization( Z, T, X ), !
% 0.69/1.10 reorganization( U, T, Y ), ! reorganization_type( Z, V0, T ), !
% 0.69/1.10 reorganization_type( U, V0, T ), ! inertia( Z, V1, T ), ! inertia( U, V2
% 0.69/1.10 , T ), ! greater( V2, V1 ), greater( Y, X ) }.
% 0.69/1.10 { organization( skol4, skol5 ) }.
% 0.69/1.10 { organization( skol6, skol5 ) }.
% 0.69/1.10 { organization( skol6, skol3 ) }.
% 0.69/1.10 { class( skol4, skol7, skol5 ) }.
% 0.69/1.10 { class( skol6, skol7, skol5 ) }.
% 0.69/1.10 { reorganization( skol4, skol5, skol2 ) }.
% 0.69/1.10 { reorganization( skol6, skol5, skol3 ) }.
% 0.69/1.10 { reorganization_type( skol4, skol8, skol5 ) }.
% 0.69/1.10 { reorganization_type( skol6, skol8, skol5 ) }.
% 0.69/1.10 { size( skol4, skol9, skol5 ) }.
% 0.69/1.10 { size( skol6, skol10, skol5 ) }.
% 0.69/1.10 { greater( skol10, skol9 ) }.
% 0.69/1.10 { ! greater( skol3, skol2 ) }.
% 0.69/1.10
% 0.69/1.10 percentage equality = 0.000000, percentage horn = 1.000000
% 0.69/1.10 This is a near-Horn, non-equality problem
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Options Used:
% 0.69/1.10
% 0.69/1.10 useres = 1
% 0.69/1.10 useparamod = 0
% 0.69/1.10 useeqrefl = 0
% 0.69/1.10 useeqfact = 0
% 0.69/1.10 usefactor = 1
% 0.69/1.10 usesimpsplitting = 0
% 0.69/1.10 usesimpdemod = 0
% 0.69/1.10 usesimpres = 4
% 0.69/1.10
% 0.69/1.10 resimpinuse = 1000
% 0.69/1.10 resimpclauses = 20000
% 0.69/1.10 substype = standard
% 0.69/1.10 backwardsubs = 1
% 0.69/1.10 selectoldest = 5
% 0.69/1.10
% 0.69/1.10 litorderings [0] = split
% 0.69/1.10 litorderings [1] = liftord
% 0.69/1.10
% 0.69/1.10 termordering = none
% 0.69/1.10
% 0.69/1.10 litapriori = 1
% 0.69/1.10 termapriori = 0
% 0.69/1.10 litaposteriori = 0
% 0.69/1.10 termaposteriori = 0
% 0.69/1.10 demodaposteriori = 0
% 0.69/1.10 ordereqreflfact = 0
% 0.69/1.10
% 0.69/1.10 litselect = negative
% 0.69/1.10
% 0.69/1.10 maxweight = 30000
% 0.69/1.10 maxdepth = 30000
% 0.69/1.10 maxlength = 115
% 0.69/1.10 maxnrvars = 195
% 0.69/1.10 excuselevel = 0
% 0.69/1.10 increasemaxweight = 0
% 0.69/1.10
% 0.69/1.10 maxselected = 10000000
% 0.69/1.10 maxnrclauses = 10000000
% 0.69/1.10
% 0.69/1.10 showgenerated = 0
% 0.69/1.10 showkept = 0
% 0.69/1.10 showselected = 0
% 0.69/1.10 showdeleted = 0
% 0.69/1.10 showresimp = 1
% 0.69/1.10 showstatus = 2000
% 0.69/1.10
% 0.69/1.10 prologoutput = 0
% 0.69/1.10 nrgoals = 5000000
% 0.69/1.10 totalproof = 1
% 0.69/1.10
% 0.69/1.10 Symbols occurring in the translation:
% 0.69/1.10
% 0.69/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.10 . [1, 2] (w:1, o:35, a:1, s:1, b:0),
% 0.69/1.10 ! [4, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.69/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 organization [37, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.69/1.10 inertia [39, 3] (w:1, o:62, a:1, s:1, b:0),
% 0.69/1.10 class [48, 3] (w:1, o:63, a:1, s:1, b:0),
% 0.69/1.10 size [49, 3] (w:1, o:66, a:1, s:1, b:0),
% 0.69/1.10 greater [50, 2] (w:1, o:60, a:1, s:1, b:0),
% 0.69/1.10 reorganization [55, 3] (w:1, o:64, a:1, s:1, b:0),
% 0.69/1.10 reorganization_type [56, 3] (w:1, o:65, a:1, s:1, b:0),
% 0.69/1.10 skol1 [57, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.69/1.10 skol2 [58, 0] (w:1, o:22, a:1, s:1, b:0),
% 0.69/1.10 skol3 [59, 0] (w:1, o:23, a:1, s:1, b:0),
% 0.69/1.10 skol4 [60, 0] (w:1, o:24, a:1, s:1, b:0),
% 0.69/1.10 skol5 [61, 0] (w:1, o:25, a:1, s:1, b:0),
% 0.69/1.10 skol6 [62, 0] (w:1, o:26, a:1, s:1, b:0),
% 0.69/1.10 skol7 [63, 0] (w:1, o:27, a:1, s:1, b:0),
% 0.69/1.10 skol8 [64, 0] (w:1, o:28, a:1, s:1, b:0),
% 0.69/1.10 skol9 [65, 0] (w:1, o:29, a:1, s:1, b:0),
% 0.69/1.10 skol10 [66, 0] (w:1, o:21, a:1, s:1, b:0).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Starting Search:
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksems!, er is een bewijs:
% 0.69/1.10 % SZS status Theorem
% 0.69/1.10 % SZS output start Refutation
% 0.69/1.10
% 0.69/1.10 (0) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), ! organization
% 0.69/1.10 ( X, Y ) }.
% 0.69/1.10 (1) {G0,W45,D2,L10,V9,M1} I { ! organization( Z, T ), ! size( Z, V1, T ), !
% 0.69/1.10 class( Z, V0, T ), ! class( U, V0, W ), ! inertia( Z, X, T ), ! inertia
% 0.69/1.10 ( U, Y, W ), ! greater( V2, V1 ), greater( Y, X ), ! size( U, V2, W ), !
% 0.69/1.10 organization( U, W ) }.
% 0.69/1.10 (2) {G0,W59,D2,L13,V9,M1} I { ! organization( Z, T ), ! reorganization_type
% 0.69/1.10 ( Z, V0, T ), ! organization( U, Y ), ! class( Z, W, T ), ! class( U, W,
% 0.69/1.10 T ), ! reorganization( Z, T, X ), ! reorganization( U, T, Y ), ! inertia
% 0.69/1.10 ( Z, V1, T ), ! inertia( U, V2, T ), ! greater( V2, V1 ), greater( Y, X )
% 0.69/1.10 , ! reorganization_type( U, V0, T ), ! organization( U, T ) }.
% 0.69/1.10 (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.69/1.10 (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol5 ) }.
% 0.69/1.10 (5) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol3 ) }.
% 0.69/1.10 (6) {G0,W4,D2,L1,V0,M1} I { class( skol4, skol7, skol5 ) }.
% 0.69/1.10 (7) {G0,W4,D2,L1,V0,M1} I { class( skol6, skol7, skol5 ) }.
% 0.69/1.10 (8) {G0,W4,D2,L1,V0,M1} I { reorganization( skol4, skol5, skol2 ) }.
% 0.69/1.10 (9) {G0,W4,D2,L1,V0,M1} I { reorganization( skol6, skol5, skol3 ) }.
% 0.69/1.10 (10) {G0,W4,D2,L1,V0,M1} I { reorganization_type( skol4, skol8, skol5 ) }.
% 0.69/1.10 (11) {G0,W4,D2,L1,V0,M1} I { reorganization_type( skol6, skol8, skol5 ) }.
% 0.69/1.10 (12) {G0,W4,D2,L1,V0,M1} I { size( skol4, skol9, skol5 ) }.
% 0.69/1.10 (13) {G0,W4,D2,L1,V0,M1} I { size( skol6, skol10, skol5 ) }.
% 0.69/1.10 (14) {G0,W3,D2,L1,V0,M1} I { greater( skol10, skol9 ) }.
% 0.69/1.10 (15) {G0,W4,D2,L1,V0,M1} I { ! greater( skol3, skol2 ) }.
% 0.69/1.10 (29) {G1,W6,D3,L1,V0,M1} R(0,3) { inertia( skol4, skol1( skol4, skol5 ),
% 0.69/1.10 skol5 ) }.
% 0.69/1.10 (30) {G1,W6,D3,L1,V0,M1} R(0,4) { inertia( skol6, skol1( skol6, skol5 ),
% 0.69/1.10 skol5 ) }.
% 0.69/1.10 (33) {G1,W41,D2,L9,V7,M1} R(1,4) { ! size( X, Z, Y ), ! class( X, T, Y ), !
% 0.69/1.10 class( skol6, T, skol5 ), ! inertia( X, U, Y ), ! inertia( skol6, W,
% 0.69/1.10 skol5 ), ! greater( V0, Z ), greater( W, U ), ! size( skol6, V0, skol5 )
% 0.69/1.10 , ! organization( X, Y ) }.
% 0.69/1.10 (48) {G1,W55,D2,L12,V7,M1} R(2,4) { ! reorganization_type( X, Y, skol5 ), !
% 0.69/1.10 organization( skol6, Z ), ! class( X, T, skol5 ), ! class( skol6, T,
% 0.69/1.10 skol5 ), ! reorganization( X, skol5, U ), ! reorganization( skol6, skol5
% 0.69/1.10 , Z ), ! inertia( X, W, skol5 ), ! inertia( skol6, V0, skol5 ), ! greater
% 0.69/1.10 ( V0, W ), greater( Z, U ), ! reorganization_type( skol6, Y, skol5 ), !
% 0.69/1.10 organization( X, skol5 ) }.
% 0.69/1.10 (119) {G2,W37,D2,L8,V5,M1} R(33,3) { ! class( skol4, Y, skol5 ), ! class(
% 0.69/1.10 skol6, Y, skol5 ), ! size( skol4, X, skol5 ), ! inertia( skol6, T, skol5
% 0.69/1.10 ), ! greater( U, X ), greater( T, Z ), ! size( skol6, U, skol5 ), !
% 0.69/1.10 inertia( skol4, Z, skol5 ) }.
% 0.69/1.10 (131) {G2,W51,D2,L11,V6,M1} R(48,3) { ! reorganization_type( skol6, X,
% 0.69/1.10 skol5 ), ! class( skol4, Z, skol5 ), ! class( skol6, Z, skol5 ), !
% 0.69/1.10 reorganization( skol4, skol5, T ), ! reorganization( skol6, skol5, Y ), !
% 0.69/1.10 inertia( skol4, U, skol5 ), ! inertia( skol6, W, skol5 ), ! greater( W,
% 0.69/1.10 U ), greater( Y, T ), ! reorganization_type( skol4, X, skol5 ), !
% 0.69/1.10 organization( skol6, Y ) }.
% 0.69/1.10 (156) {G3,W34,D3,L7,V4,M1} R(119,29) { ! class( skol4, X, skol5 ), ! class
% 0.69/1.10 ( skol6, X, skol5 ), ! size( skol4, Y, skol5 ), ! greater( T, Y ),
% 0.69/1.10 greater( Z, skol1( skol4, skol5 ) ), ! size( skol6, T, skol5 ), ! inertia
% 0.69/1.10 ( skol6, Z, skol5 ) }.
% 0.69/1.10 (157) {G4,W31,D3,L6,V3,M1} R(156,30) { ! size( skol4, Y, skol5 ), ! class(
% 0.69/1.10 skol6, X, skol5 ), ! greater( Z, Y ), greater( skol1( skol6, skol5 ),
% 0.69/1.10 skol1( skol4, skol5 ) ), ! size( skol6, Z, skol5 ), ! class( skol4, X,
% 0.69/1.10 skol5 ) }.
% 0.69/1.10 (158) {G5,W21,D3,L4,V2,M1} R(157,6);r(7) { ! greater( Y, X ), greater(
% 0.69/1.10 skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, Y, skol5 )
% 0.69/1.10 , ! size( skol4, X, skol5 ) }.
% 0.69/1.10 (159) {G6,W16,D3,L3,V1,M1} R(158,12) { ! greater( X, skol9 ), greater(
% 0.69/1.10 skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, X, skol5 )
% 0.69/1.10 }.
% 0.69/1.10 (160) {G7,W7,D3,L1,V0,M1} R(159,13);r(14) { greater( skol1( skol6, skol5 )
% 0.69/1.10 , skol1( skol4, skol5 ) ) }.
% 0.69/1.10 (180) {G3,W42,D2,L9,V5,M1} R(131,5);r(9) { ! class( skol4, Y, skol5 ), !
% 0.69/1.10 class( skol6, Y, skol5 ), ! reorganization( skol4, skol5, Z ), !
% 0.69/1.10 reorganization_type( skol6, X, skol5 ), ! inertia( skol6, U, skol5 ), !
% 0.69/1.10 greater( U, T ), greater( skol3, Z ), ! reorganization_type( skol4, X,
% 0.69/1.10 skol5 ), ! inertia( skol4, T, skol5 ) }.
% 0.69/1.10 (181) {G4,W39,D3,L8,V4,M1} R(180,29) { ! class( skol4, X, skol5 ), ! class
% 0.69/1.10 ( skol6, X, skol5 ), ! reorganization( skol4, skol5, Y ), !
% 0.69/1.10 reorganization_type( skol6, Z, skol5 ), ! greater( T, skol1( skol4, skol5
% 0.69/1.10 ) ), greater( skol3, Y ), ! reorganization_type( skol4, Z, skol5 ), !
% 0.69/1.10 inertia( skol6, T, skol5 ) }.
% 0.69/1.10 (182) {G8,W28,D2,L6,V3,M1} R(181,30);r(160) { ! reorganization_type( skol6
% 0.69/1.10 , Z, skol5 ), ! class( skol6, X, skol5 ), ! reorganization( skol4, skol5
% 0.69/1.10 , Y ), greater( skol3, Y ), ! reorganization_type( skol4, Z, skol5 ), !
% 0.69/1.10 class( skol4, X, skol5 ) }.
% 0.69/1.10 (183) {G9,W18,D2,L4,V2,M1} R(182,6);r(7) { ! reorganization_type( skol6, X
% 0.69/1.10 , skol5 ), greater( skol3, Y ), ! reorganization_type( skol4, X, skol5 )
% 0.69/1.10 , ! reorganization( skol4, skol5, Y ) }.
% 0.69/1.10 (184) {G10,W10,D2,L2,V1,M1} R(183,8);r(15) { ! reorganization_type( skol6,
% 0.69/1.10 X, skol5 ), ! reorganization_type( skol4, X, skol5 ) }.
% 0.69/1.10 (185) {G11,W0,D0,L0,V0,M0} R(184,10);r(11) { }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 % SZS output end Refutation
% 0.69/1.10 found a proof!
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Unprocessed initial clauses:
% 0.69/1.10
% 0.69/1.10 (187) {G0,W10,D3,L2,V2,M2} { ! organization( X, Y ), inertia( X, skol1( X
% 0.69/1.10 , Y ), Y ) }.
% 0.69/1.10 (188) {G0,W45,D2,L10,V9,M10} { ! organization( Z, T ), ! organization( U,
% 0.69/1.10 W ), ! class( Z, V0, T ), ! class( U, V0, W ), ! size( Z, V1, T ), ! size
% 0.69/1.10 ( U, V2, W ), ! inertia( Z, X, T ), ! inertia( U, Y, W ), ! greater( V2,
% 0.69/1.10 V1 ), greater( Y, X ) }.
% 0.69/1.10 (189) {G0,W59,D2,L13,V9,M13} { ! organization( Z, T ), ! organization( U,
% 0.69/1.10 T ), ! organization( U, Y ), ! class( Z, W, T ), ! class( U, W, T ), !
% 0.69/1.10 reorganization( Z, T, X ), ! reorganization( U, T, Y ), !
% 0.69/1.10 reorganization_type( Z, V0, T ), ! reorganization_type( U, V0, T ), !
% 0.69/1.10 inertia( Z, V1, T ), ! inertia( U, V2, T ), ! greater( V2, V1 ), greater
% 0.69/1.10 ( Y, X ) }.
% 0.69/1.10 (190) {G0,W3,D2,L1,V0,M1} { organization( skol4, skol5 ) }.
% 0.69/1.10 (191) {G0,W3,D2,L1,V0,M1} { organization( skol6, skol5 ) }.
% 0.69/1.10 (192) {G0,W3,D2,L1,V0,M1} { organization( skol6, skol3 ) }.
% 0.69/1.10 (193) {G0,W4,D2,L1,V0,M1} { class( skol4, skol7, skol5 ) }.
% 0.69/1.10 (194) {G0,W4,D2,L1,V0,M1} { class( skol6, skol7, skol5 ) }.
% 0.69/1.10 (195) {G0,W4,D2,L1,V0,M1} { reorganization( skol4, skol5, skol2 ) }.
% 0.69/1.10 (196) {G0,W4,D2,L1,V0,M1} { reorganization( skol6, skol5, skol3 ) }.
% 0.69/1.10 (197) {G0,W4,D2,L1,V0,M1} { reorganization_type( skol4, skol8, skol5 ) }.
% 0.69/1.10 (198) {G0,W4,D2,L1,V0,M1} { reorganization_type( skol6, skol8, skol5 ) }.
% 0.69/1.10 (199) {G0,W4,D2,L1,V0,M1} { size( skol4, skol9, skol5 ) }.
% 0.69/1.10 (200) {G0,W4,D2,L1,V0,M1} { size( skol6, skol10, skol5 ) }.
% 0.69/1.10 (201) {G0,W3,D2,L1,V0,M1} { greater( skol10, skol9 ) }.
% 0.69/1.10 (202) {G0,W4,D2,L1,V0,M1} { ! greater( skol3, skol2 ) }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Total Proof:
% 0.69/1.10
% 0.69/1.10 subsumption: (0) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), !
% 0.69/1.10 organization( X, Y ) }.
% 0.69/1.10 parent0: (187) {G0,W10,D3,L2,V2,M2} { ! organization( X, Y ), inertia( X,
% 0.69/1.10 skol1( X, Y ), Y ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 1
% 0.69/1.10 1 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (1) {G0,W45,D2,L10,V9,M1} I { ! organization( Z, T ), ! size(
% 0.69/1.10 Z, V1, T ), ! class( Z, V0, T ), ! class( U, V0, W ), ! inertia( Z, X, T
% 0.69/1.10 ), ! inertia( U, Y, W ), ! greater( V2, V1 ), greater( Y, X ), ! size( U
% 0.69/1.10 , V2, W ), ! organization( U, W ) }.
% 0.69/1.10 parent0: (188) {G0,W45,D2,L10,V9,M10} { ! organization( Z, T ), !
% 0.69/1.10 organization( U, W ), ! class( Z, V0, T ), ! class( U, V0, W ), ! size( Z
% 0.69/1.10 , V1, T ), ! size( U, V2, W ), ! inertia( Z, X, T ), ! inertia( U, Y, W )
% 0.69/1.10 , ! greater( V2, V1 ), greater( Y, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 Z := Z
% 0.69/1.10 T := T
% 0.69/1.10 U := U
% 0.69/1.10 W := W
% 0.69/1.10 V0 := V0
% 0.69/1.10 V1 := V1
% 0.69/1.10 V2 := V2
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 9
% 0.69/1.10 2 ==> 2
% 0.69/1.10 3 ==> 3
% 0.69/1.10 4 ==> 1
% 0.69/1.10 5 ==> 8
% 0.69/1.10 6 ==> 4
% 0.69/1.10 7 ==> 5
% 0.69/1.10 8 ==> 6
% 0.69/1.10 9 ==> 7
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (2) {G0,W59,D2,L13,V9,M1} I { ! organization( Z, T ), !
% 0.69/1.10 reorganization_type( Z, V0, T ), ! organization( U, Y ), ! class( Z, W, T
% 0.69/1.10 ), ! class( U, W, T ), ! reorganization( Z, T, X ), ! reorganization( U
% 0.69/1.10 , T, Y ), ! inertia( Z, V1, T ), ! inertia( U, V2, T ), ! greater( V2, V1
% 0.69/1.10 ), greater( Y, X ), ! reorganization_type( U, V0, T ), ! organization( U
% 0.69/1.10 , T ) }.
% 0.69/1.10 parent0: (189) {G0,W59,D2,L13,V9,M13} { ! organization( Z, T ), !
% 0.69/1.10 organization( U, T ), ! organization( U, Y ), ! class( Z, W, T ), ! class
% 0.69/1.10 ( U, W, T ), ! reorganization( Z, T, X ), ! reorganization( U, T, Y ), !
% 0.69/1.10 reorganization_type( Z, V0, T ), ! reorganization_type( U, V0, T ), !
% 0.69/1.10 inertia( Z, V1, T ), ! inertia( U, V2, T ), ! greater( V2, V1 ), greater
% 0.69/1.10 ( Y, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := T
% 0.69/1.11 U := U
% 0.69/1.11 W := W
% 0.69/1.11 V0 := V0
% 0.69/1.11 V1 := V1
% 0.69/1.11 V2 := V2
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 12
% 0.69/1.11 2 ==> 2
% 0.69/1.11 3 ==> 3
% 0.69/1.11 4 ==> 4
% 0.69/1.11 5 ==> 5
% 0.69/1.11 6 ==> 6
% 0.69/1.11 7 ==> 1
% 0.69/1.11 8 ==> 11
% 0.69/1.11 9 ==> 7
% 0.69/1.11 10 ==> 8
% 0.69/1.11 11 ==> 9
% 0.69/1.11 12 ==> 10
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.69/1.11 parent0: (190) {G0,W3,D2,L1,V0,M1} { organization( skol4, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 *** allocated 15000 integers for clauses
% 0.69/1.11 subsumption: (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol5 ) }.
% 0.69/1.11 parent0: (191) {G0,W3,D2,L1,V0,M1} { organization( skol6, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 *** allocated 15000 integers for termspace/termends
% 0.69/1.11 subsumption: (5) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol3 ) }.
% 0.69/1.11 parent0: (192) {G0,W3,D2,L1,V0,M1} { organization( skol6, skol3 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (6) {G0,W4,D2,L1,V0,M1} I { class( skol4, skol7, skol5 ) }.
% 0.69/1.11 parent0: (193) {G0,W4,D2,L1,V0,M1} { class( skol4, skol7, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (7) {G0,W4,D2,L1,V0,M1} I { class( skol6, skol7, skol5 ) }.
% 0.69/1.11 parent0: (194) {G0,W4,D2,L1,V0,M1} { class( skol6, skol7, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (8) {G0,W4,D2,L1,V0,M1} I { reorganization( skol4, skol5,
% 0.69/1.11 skol2 ) }.
% 0.69/1.11 parent0: (195) {G0,W4,D2,L1,V0,M1} { reorganization( skol4, skol5, skol2 )
% 0.69/1.11 }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (9) {G0,W4,D2,L1,V0,M1} I { reorganization( skol6, skol5,
% 0.69/1.11 skol3 ) }.
% 0.69/1.11 parent0: (196) {G0,W4,D2,L1,V0,M1} { reorganization( skol6, skol5, skol3 )
% 0.69/1.11 }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 *** allocated 22500 integers for termspace/termends
% 0.69/1.11 subsumption: (10) {G0,W4,D2,L1,V0,M1} I { reorganization_type( skol4, skol8
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 parent0: (197) {G0,W4,D2,L1,V0,M1} { reorganization_type( skol4, skol8,
% 0.69/1.11 skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 *** allocated 22500 integers for clauses
% 0.69/1.11 subsumption: (11) {G0,W4,D2,L1,V0,M1} I { reorganization_type( skol6, skol8
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 parent0: (198) {G0,W4,D2,L1,V0,M1} { reorganization_type( skol6, skol8,
% 0.69/1.11 skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (12) {G0,W4,D2,L1,V0,M1} I { size( skol4, skol9, skol5 ) }.
% 0.69/1.11 parent0: (199) {G0,W4,D2,L1,V0,M1} { size( skol4, skol9, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (13) {G0,W4,D2,L1,V0,M1} I { size( skol6, skol10, skol5 ) }.
% 0.69/1.11 parent0: (200) {G0,W4,D2,L1,V0,M1} { size( skol6, skol10, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (14) {G0,W3,D2,L1,V0,M1} I { greater( skol10, skol9 ) }.
% 0.69/1.11 parent0: (201) {G0,W3,D2,L1,V0,M1} { greater( skol10, skol9 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (15) {G0,W4,D2,L1,V0,M1} I { ! greater( skol3, skol2 ) }.
% 0.69/1.11 parent0: (202) {G0,W4,D2,L1,V0,M1} { ! greater( skol3, skol2 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (576) {G1,W6,D3,L1,V0,M1} { inertia( skol4, skol1( skol4,
% 0.69/1.11 skol5 ), skol5 ) }.
% 0.69/1.11 parent0[1]: (0) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), !
% 0.69/1.11 organization( X, Y ) }.
% 0.69/1.11 parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := skol4
% 0.69/1.11 Y := skol5
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (29) {G1,W6,D3,L1,V0,M1} R(0,3) { inertia( skol4, skol1( skol4
% 0.69/1.11 , skol5 ), skol5 ) }.
% 0.69/1.11 parent0: (576) {G1,W6,D3,L1,V0,M1} { inertia( skol4, skol1( skol4, skol5 )
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (577) {G1,W6,D3,L1,V0,M1} { inertia( skol6, skol1( skol6,
% 0.69/1.11 skol5 ), skol5 ) }.
% 0.69/1.11 parent0[1]: (0) {G0,W10,D3,L2,V2,M1} I { inertia( X, skol1( X, Y ), Y ), !
% 0.69/1.11 organization( X, Y ) }.
% 0.69/1.11 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := skol6
% 0.69/1.11 Y := skol5
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (30) {G1,W6,D3,L1,V0,M1} R(0,4) { inertia( skol6, skol1( skol6
% 0.69/1.11 , skol5 ), skol5 ) }.
% 0.69/1.11 parent0: (577) {G1,W6,D3,L1,V0,M1} { inertia( skol6, skol1( skol6, skol5 )
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (579) {G1,W41,D2,L9,V7,M9} { ! organization( X, Y ), ! size( X
% 0.69/1.11 , Z, Y ), ! class( X, T, Y ), ! class( skol6, T, skol5 ), ! inertia( X, U
% 0.69/1.11 , Y ), ! inertia( skol6, W, skol5 ), ! greater( V0, Z ), greater( W, U )
% 0.69/1.11 , ! size( skol6, V0, skol5 ) }.
% 0.69/1.11 parent0[9]: (1) {G0,W45,D2,L10,V9,M1} I { ! organization( Z, T ), ! size( Z
% 0.69/1.11 , V1, T ), ! class( Z, V0, T ), ! class( U, V0, W ), ! inertia( Z, X, T )
% 0.69/1.11 , ! inertia( U, Y, W ), ! greater( V2, V1 ), greater( Y, X ), ! size( U,
% 0.69/1.11 V2, W ), ! organization( U, W ) }.
% 0.69/1.11 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := U
% 0.69/1.11 Y := W
% 0.69/1.11 Z := X
% 0.69/1.11 T := Y
% 0.69/1.11 U := skol6
% 0.69/1.11 W := skol5
% 0.69/1.11 V0 := T
% 0.69/1.11 V1 := Z
% 0.69/1.11 V2 := V0
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (33) {G1,W41,D2,L9,V7,M1} R(1,4) { ! size( X, Z, Y ), ! class
% 0.69/1.11 ( X, T, Y ), ! class( skol6, T, skol5 ), ! inertia( X, U, Y ), ! inertia
% 0.69/1.11 ( skol6, W, skol5 ), ! greater( V0, Z ), greater( W, U ), ! size( skol6,
% 0.69/1.11 V0, skol5 ), ! organization( X, Y ) }.
% 0.69/1.11 parent0: (579) {G1,W41,D2,L9,V7,M9} { ! organization( X, Y ), ! size( X, Z
% 0.69/1.11 , Y ), ! class( X, T, Y ), ! class( skol6, T, skol5 ), ! inertia( X, U, Y
% 0.69/1.11 ), ! inertia( skol6, W, skol5 ), ! greater( V0, Z ), greater( W, U ), !
% 0.69/1.11 size( skol6, V0, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := T
% 0.69/1.11 U := U
% 0.69/1.11 W := W
% 0.69/1.11 V0 := V0
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 8
% 0.69/1.11 1 ==> 0
% 0.69/1.11 2 ==> 1
% 0.69/1.11 3 ==> 2
% 0.69/1.11 4 ==> 3
% 0.69/1.11 5 ==> 4
% 0.69/1.11 6 ==> 5
% 0.69/1.11 7 ==> 6
% 0.69/1.11 8 ==> 7
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (587) {G1,W55,D2,L12,V7,M12} { ! organization( X, skol5 ), !
% 0.69/1.11 reorganization_type( X, Y, skol5 ), ! organization( skol6, Z ), ! class(
% 0.69/1.11 X, T, skol5 ), ! class( skol6, T, skol5 ), ! reorganization( X, skol5, U
% 0.69/1.11 ), ! reorganization( skol6, skol5, Z ), ! inertia( X, W, skol5 ), !
% 0.69/1.11 inertia( skol6, V0, skol5 ), ! greater( V0, W ), greater( Z, U ), !
% 0.69/1.11 reorganization_type( skol6, Y, skol5 ) }.
% 0.69/1.11 parent0[12]: (2) {G0,W59,D2,L13,V9,M1} I { ! organization( Z, T ), !
% 0.69/1.11 reorganization_type( Z, V0, T ), ! organization( U, Y ), ! class( Z, W, T
% 0.69/1.11 ), ! class( U, W, T ), ! reorganization( Z, T, X ), ! reorganization( U
% 0.69/1.11 , T, Y ), ! inertia( Z, V1, T ), ! inertia( U, V2, T ), ! greater( V2, V1
% 0.69/1.11 ), greater( Y, X ), ! reorganization_type( U, V0, T ), ! organization( U
% 0.69/1.11 , T ) }.
% 0.69/1.11 parent1[0]: (4) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := U
% 0.69/1.11 Y := Z
% 0.69/1.11 Z := X
% 0.69/1.11 T := skol5
% 0.69/1.11 U := skol6
% 0.69/1.11 W := T
% 0.69/1.11 V0 := Y
% 0.69/1.11 V1 := W
% 0.69/1.11 V2 := V0
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (48) {G1,W55,D2,L12,V7,M1} R(2,4) { ! reorganization_type( X,
% 0.69/1.11 Y, skol5 ), ! organization( skol6, Z ), ! class( X, T, skol5 ), ! class(
% 0.69/1.11 skol6, T, skol5 ), ! reorganization( X, skol5, U ), ! reorganization(
% 0.69/1.11 skol6, skol5, Z ), ! inertia( X, W, skol5 ), ! inertia( skol6, V0, skol5
% 0.69/1.11 ), ! greater( V0, W ), greater( Z, U ), ! reorganization_type( skol6, Y
% 0.69/1.11 , skol5 ), ! organization( X, skol5 ) }.
% 0.69/1.11 parent0: (587) {G1,W55,D2,L12,V7,M12} { ! organization( X, skol5 ), !
% 0.69/1.11 reorganization_type( X, Y, skol5 ), ! organization( skol6, Z ), ! class(
% 0.69/1.11 X, T, skol5 ), ! class( skol6, T, skol5 ), ! reorganization( X, skol5, U
% 0.69/1.11 ), ! reorganization( skol6, skol5, Z ), ! inertia( X, W, skol5 ), !
% 0.69/1.11 inertia( skol6, V0, skol5 ), ! greater( V0, W ), greater( Z, U ), !
% 0.69/1.11 reorganization_type( skol6, Y, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := T
% 0.69/1.11 U := U
% 0.69/1.11 W := W
% 0.69/1.11 V0 := V0
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 11
% 0.69/1.11 1 ==> 0
% 0.69/1.11 2 ==> 1
% 0.69/1.11 3 ==> 2
% 0.69/1.11 4 ==> 3
% 0.69/1.11 5 ==> 4
% 0.69/1.11 6 ==> 5
% 0.69/1.11 7 ==> 6
% 0.69/1.11 8 ==> 7
% 0.69/1.11 9 ==> 8
% 0.69/1.11 10 ==> 9
% 0.69/1.11 11 ==> 10
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (610) {G1,W37,D2,L8,V5,M8} { ! size( skol4, X, skol5 ), !
% 0.69/1.11 class( skol4, Y, skol5 ), ! class( skol6, Y, skol5 ), ! inertia( skol4, Z
% 0.69/1.11 , skol5 ), ! inertia( skol6, T, skol5 ), ! greater( U, X ), greater( T, Z
% 0.69/1.11 ), ! size( skol6, U, skol5 ) }.
% 0.69/1.11 parent0[8]: (33) {G1,W41,D2,L9,V7,M1} R(1,4) { ! size( X, Z, Y ), ! class(
% 0.69/1.11 X, T, Y ), ! class( skol6, T, skol5 ), ! inertia( X, U, Y ), ! inertia(
% 0.69/1.11 skol6, W, skol5 ), ! greater( V0, Z ), greater( W, U ), ! size( skol6, V0
% 0.69/1.11 , skol5 ), ! organization( X, Y ) }.
% 0.69/1.11 parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := skol4
% 0.69/1.11 Y := skol5
% 0.69/1.11 Z := X
% 0.69/1.11 T := Y
% 0.69/1.11 U := Z
% 0.69/1.11 W := T
% 0.69/1.11 V0 := U
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (119) {G2,W37,D2,L8,V5,M1} R(33,3) { ! class( skol4, Y, skol5
% 0.69/1.11 ), ! class( skol6, Y, skol5 ), ! size( skol4, X, skol5 ), ! inertia(
% 0.69/1.11 skol6, T, skol5 ), ! greater( U, X ), greater( T, Z ), ! size( skol6, U,
% 0.69/1.11 skol5 ), ! inertia( skol4, Z, skol5 ) }.
% 0.69/1.11 parent0: (610) {G1,W37,D2,L8,V5,M8} { ! size( skol4, X, skol5 ), ! class(
% 0.69/1.11 skol4, Y, skol5 ), ! class( skol6, Y, skol5 ), ! inertia( skol4, Z, skol5
% 0.69/1.11 ), ! inertia( skol6, T, skol5 ), ! greater( U, X ), greater( T, Z ), !
% 0.69/1.11 size( skol6, U, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := T
% 0.69/1.11 U := U
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 2
% 0.69/1.11 1 ==> 0
% 0.69/1.11 2 ==> 1
% 0.69/1.11 3 ==> 7
% 0.69/1.11 4 ==> 3
% 0.69/1.11 5 ==> 4
% 0.69/1.11 6 ==> 5
% 0.69/1.11 7 ==> 6
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (611) {G1,W51,D2,L11,V6,M11} { ! reorganization_type( skol4, X
% 0.69/1.11 , skol5 ), ! organization( skol6, Y ), ! class( skol4, Z, skol5 ), !
% 0.69/1.11 class( skol6, Z, skol5 ), ! reorganization( skol4, skol5, T ), !
% 0.69/1.11 reorganization( skol6, skol5, Y ), ! inertia( skol4, U, skol5 ), !
% 0.69/1.11 inertia( skol6, W, skol5 ), ! greater( W, U ), greater( Y, T ), !
% 0.69/1.11 reorganization_type( skol6, X, skol5 ) }.
% 0.69/1.11 parent0[11]: (48) {G1,W55,D2,L12,V7,M1} R(2,4) { ! reorganization_type( X,
% 0.69/1.11 Y, skol5 ), ! organization( skol6, Z ), ! class( X, T, skol5 ), ! class(
% 0.69/1.11 skol6, T, skol5 ), ! reorganization( X, skol5, U ), ! reorganization(
% 0.69/1.11 skol6, skol5, Z ), ! inertia( X, W, skol5 ), ! inertia( skol6, V0, skol5
% 0.69/1.11 ), ! greater( V0, W ), greater( Z, U ), ! reorganization_type( skol6, Y
% 0.69/1.11 , skol5 ), ! organization( X, skol5 ) }.
% 0.69/1.11 parent1[0]: (3) {G0,W3,D2,L1,V0,M1} I { organization( skol4, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := skol4
% 0.69/1.11 Y := X
% 0.69/1.11 Z := Y
% 0.69/1.11 T := Z
% 0.69/1.11 U := T
% 0.69/1.11 W := U
% 0.69/1.11 V0 := W
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (131) {G2,W51,D2,L11,V6,M1} R(48,3) { ! reorganization_type(
% 0.69/1.11 skol6, X, skol5 ), ! class( skol4, Z, skol5 ), ! class( skol6, Z, skol5 )
% 0.69/1.11 , ! reorganization( skol4, skol5, T ), ! reorganization( skol6, skol5, Y
% 0.69/1.11 ), ! inertia( skol4, U, skol5 ), ! inertia( skol6, W, skol5 ), ! greater
% 0.69/1.11 ( W, U ), greater( Y, T ), ! reorganization_type( skol4, X, skol5 ), !
% 0.69/1.11 organization( skol6, Y ) }.
% 0.69/1.11 parent0: (611) {G1,W51,D2,L11,V6,M11} { ! reorganization_type( skol4, X,
% 0.69/1.11 skol5 ), ! organization( skol6, Y ), ! class( skol4, Z, skol5 ), ! class
% 0.69/1.11 ( skol6, Z, skol5 ), ! reorganization( skol4, skol5, T ), !
% 0.69/1.11 reorganization( skol6, skol5, Y ), ! inertia( skol4, U, skol5 ), !
% 0.69/1.11 inertia( skol6, W, skol5 ), ! greater( W, U ), greater( Y, T ), !
% 0.69/1.11 reorganization_type( skol6, X, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := T
% 0.69/1.11 U := U
% 0.69/1.11 W := W
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 9
% 0.69/1.11 1 ==> 10
% 0.69/1.11 2 ==> 1
% 0.69/1.11 3 ==> 2
% 0.69/1.11 4 ==> 3
% 0.69/1.11 5 ==> 4
% 0.69/1.11 6 ==> 5
% 0.69/1.11 7 ==> 6
% 0.69/1.11 8 ==> 7
% 0.69/1.11 9 ==> 8
% 0.69/1.11 10 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (612) {G2,W34,D3,L7,V4,M7} { ! class( skol4, X, skol5 ), !
% 0.69/1.11 class( skol6, X, skol5 ), ! size( skol4, Y, skol5 ), ! inertia( skol6, Z
% 0.69/1.11 , skol5 ), ! greater( T, Y ), greater( Z, skol1( skol4, skol5 ) ), ! size
% 0.69/1.11 ( skol6, T, skol5 ) }.
% 0.69/1.11 parent0[7]: (119) {G2,W37,D2,L8,V5,M1} R(33,3) { ! class( skol4, Y, skol5 )
% 0.69/1.11 , ! class( skol6, Y, skol5 ), ! size( skol4, X, skol5 ), ! inertia( skol6
% 0.69/1.11 , T, skol5 ), ! greater( U, X ), greater( T, Z ), ! size( skol6, U, skol5
% 0.69/1.11 ), ! inertia( skol4, Z, skol5 ) }.
% 0.69/1.11 parent1[0]: (29) {G1,W6,D3,L1,V0,M1} R(0,3) { inertia( skol4, skol1( skol4
% 0.69/1.11 , skol5 ), skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := Y
% 0.69/1.11 Y := X
% 0.69/1.11 Z := skol1( skol4, skol5 )
% 0.69/1.11 T := Z
% 0.69/1.11 U := T
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (156) {G3,W34,D3,L7,V4,M1} R(119,29) { ! class( skol4, X,
% 0.69/1.11 skol5 ), ! class( skol6, X, skol5 ), ! size( skol4, Y, skol5 ), ! greater
% 0.69/1.11 ( T, Y ), greater( Z, skol1( skol4, skol5 ) ), ! size( skol6, T, skol5 )
% 0.69/1.11 , ! inertia( skol6, Z, skol5 ) }.
% 0.69/1.11 parent0: (612) {G2,W34,D3,L7,V4,M7} { ! class( skol4, X, skol5 ), ! class
% 0.69/1.11 ( skol6, X, skol5 ), ! size( skol4, Y, skol5 ), ! inertia( skol6, Z,
% 0.69/1.11 skol5 ), ! greater( T, Y ), greater( Z, skol1( skol4, skol5 ) ), ! size(
% 0.69/1.11 skol6, T, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := T
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 1
% 0.69/1.11 2 ==> 2
% 0.69/1.11 3 ==> 6
% 0.69/1.11 4 ==> 3
% 0.69/1.11 5 ==> 4
% 0.69/1.11 6 ==> 5
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (613) {G2,W31,D3,L6,V3,M6} { ! class( skol4, X, skol5 ), !
% 0.69/1.11 class( skol6, X, skol5 ), ! size( skol4, Y, skol5 ), ! greater( Z, Y ),
% 0.69/1.11 greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, Z
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 parent0[6]: (156) {G3,W34,D3,L7,V4,M1} R(119,29) { ! class( skol4, X, skol5
% 0.69/1.11 ), ! class( skol6, X, skol5 ), ! size( skol4, Y, skol5 ), ! greater( T,
% 0.69/1.11 Y ), greater( Z, skol1( skol4, skol5 ) ), ! size( skol6, T, skol5 ), !
% 0.69/1.11 inertia( skol6, Z, skol5 ) }.
% 0.69/1.11 parent1[0]: (30) {G1,W6,D3,L1,V0,M1} R(0,4) { inertia( skol6, skol1( skol6
% 0.69/1.11 , skol5 ), skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := skol1( skol6, skol5 )
% 0.69/1.11 T := Z
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (157) {G4,W31,D3,L6,V3,M1} R(156,30) { ! size( skol4, Y, skol5
% 0.69/1.11 ), ! class( skol6, X, skol5 ), ! greater( Z, Y ), greater( skol1( skol6
% 0.69/1.11 , skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, Z, skol5 ), ! class(
% 0.69/1.11 skol4, X, skol5 ) }.
% 0.69/1.11 parent0: (613) {G2,W31,D3,L6,V3,M6} { ! class( skol4, X, skol5 ), ! class
% 0.69/1.11 ( skol6, X, skol5 ), ! size( skol4, Y, skol5 ), ! greater( Z, Y ),
% 0.69/1.11 greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, Z
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 5
% 0.69/1.11 1 ==> 1
% 0.69/1.11 2 ==> 0
% 0.69/1.11 3 ==> 2
% 0.69/1.11 4 ==> 3
% 0.69/1.11 5 ==> 4
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (614) {G1,W26,D3,L5,V2,M5} { ! size( skol4, X, skol5 ), !
% 0.69/1.11 class( skol6, skol7, skol5 ), ! greater( Y, X ), greater( skol1( skol6,
% 0.69/1.11 skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, Y, skol5 ) }.
% 0.69/1.11 parent0[5]: (157) {G4,W31,D3,L6,V3,M1} R(156,30) { ! size( skol4, Y, skol5
% 0.69/1.11 ), ! class( skol6, X, skol5 ), ! greater( Z, Y ), greater( skol1( skol6
% 0.69/1.11 , skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, Z, skol5 ), ! class(
% 0.69/1.11 skol4, X, skol5 ) }.
% 0.69/1.11 parent1[0]: (6) {G0,W4,D2,L1,V0,M1} I { class( skol4, skol7, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := skol7
% 0.69/1.11 Y := X
% 0.69/1.11 Z := Y
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (615) {G1,W21,D3,L4,V2,M4} { ! size( skol4, X, skol5 ), !
% 0.69/1.11 greater( Y, X ), greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) )
% 0.69/1.11 , ! size( skol6, Y, skol5 ) }.
% 0.69/1.11 parent0[1]: (614) {G1,W26,D3,L5,V2,M5} { ! size( skol4, X, skol5 ), !
% 0.69/1.11 class( skol6, skol7, skol5 ), ! greater( Y, X ), greater( skol1( skol6,
% 0.69/1.11 skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, Y, skol5 ) }.
% 0.69/1.11 parent1[0]: (7) {G0,W4,D2,L1,V0,M1} I { class( skol6, skol7, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (158) {G5,W21,D3,L4,V2,M1} R(157,6);r(7) { ! greater( Y, X ),
% 0.69/1.11 greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, Y
% 0.69/1.11 , skol5 ), ! size( skol4, X, skol5 ) }.
% 0.69/1.11 parent0: (615) {G1,W21,D3,L4,V2,M4} { ! size( skol4, X, skol5 ), ! greater
% 0.69/1.11 ( Y, X ), greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size
% 0.69/1.11 ( skol6, Y, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 3
% 0.69/1.11 1 ==> 0
% 0.69/1.11 2 ==> 1
% 0.69/1.11 3 ==> 2
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 *** allocated 33750 integers for termspace/termends
% 0.69/1.11 resolution: (616) {G1,W16,D3,L3,V1,M3} { ! greater( X, skol9 ), greater(
% 0.69/1.11 skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, X, skol5 )
% 0.69/1.11 }.
% 0.69/1.11 parent0[3]: (158) {G5,W21,D3,L4,V2,M1} R(157,6);r(7) { ! greater( Y, X ),
% 0.69/1.11 greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, Y
% 0.69/1.11 , skol5 ), ! size( skol4, X, skol5 ) }.
% 0.69/1.11 parent1[0]: (12) {G0,W4,D2,L1,V0,M1} I { size( skol4, skol9, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := skol9
% 0.69/1.11 Y := X
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (159) {G6,W16,D3,L3,V1,M1} R(158,12) { ! greater( X, skol9 ),
% 0.69/1.11 greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, X
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 parent0: (616) {G1,W16,D3,L3,V1,M3} { ! greater( X, skol9 ), greater(
% 0.69/1.11 skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, X, skol5 )
% 0.69/1.11 }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 1
% 0.69/1.11 2 ==> 2
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (617) {G1,W11,D3,L2,V0,M2} { ! greater( skol10, skol9 ),
% 0.69/1.11 greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) ) }.
% 0.69/1.11 parent0[2]: (159) {G6,W16,D3,L3,V1,M1} R(158,12) { ! greater( X, skol9 ),
% 0.69/1.11 greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) ), ! size( skol6, X
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 parent1[0]: (13) {G0,W4,D2,L1,V0,M1} I { size( skol6, skol10, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := skol10
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (618) {G1,W7,D3,L1,V0,M1} { greater( skol1( skol6, skol5 ),
% 0.69/1.11 skol1( skol4, skol5 ) ) }.
% 0.69/1.11 parent0[0]: (617) {G1,W11,D3,L2,V0,M2} { ! greater( skol10, skol9 ),
% 0.69/1.11 greater( skol1( skol6, skol5 ), skol1( skol4, skol5 ) ) }.
% 0.69/1.11 parent1[0]: (14) {G0,W3,D2,L1,V0,M1} I { greater( skol10, skol9 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (160) {G7,W7,D3,L1,V0,M1} R(159,13);r(14) { greater( skol1(
% 0.69/1.11 skol6, skol5 ), skol1( skol4, skol5 ) ) }.
% 0.69/1.11 parent0: (618) {G1,W7,D3,L1,V0,M1} { greater( skol1( skol6, skol5 ), skol1
% 0.69/1.11 ( skol4, skol5 ) ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (619) {G1,W47,D2,L10,V5,M10} { ! reorganization_type( skol6, X
% 0.69/1.11 , skol5 ), ! class( skol4, Y, skol5 ), ! class( skol6, Y, skol5 ), !
% 0.69/1.11 reorganization( skol4, skol5, Z ), ! reorganization( skol6, skol5, skol3
% 0.69/1.11 ), ! inertia( skol4, T, skol5 ), ! inertia( skol6, U, skol5 ), ! greater
% 0.69/1.11 ( U, T ), greater( skol3, Z ), ! reorganization_type( skol4, X, skol5 )
% 0.69/1.11 }.
% 0.69/1.11 parent0[10]: (131) {G2,W51,D2,L11,V6,M1} R(48,3) { ! reorganization_type(
% 0.69/1.11 skol6, X, skol5 ), ! class( skol4, Z, skol5 ), ! class( skol6, Z, skol5 )
% 0.69/1.11 , ! reorganization( skol4, skol5, T ), ! reorganization( skol6, skol5, Y
% 0.69/1.11 ), ! inertia( skol4, U, skol5 ), ! inertia( skol6, W, skol5 ), ! greater
% 0.69/1.11 ( W, U ), greater( Y, T ), ! reorganization_type( skol4, X, skol5 ), !
% 0.69/1.11 organization( skol6, Y ) }.
% 0.69/1.11 parent1[0]: (5) {G0,W3,D2,L1,V0,M1} I { organization( skol6, skol3 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := skol3
% 0.69/1.11 Z := Y
% 0.69/1.11 T := Z
% 0.69/1.11 U := T
% 0.69/1.11 W := U
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (620) {G1,W42,D2,L9,V5,M9} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), ! class( skol4, Y, skol5 ), ! class( skol6, Y, skol5 ), !
% 0.69/1.11 reorganization( skol4, skol5, Z ), ! inertia( skol4, T, skol5 ), !
% 0.69/1.11 inertia( skol6, U, skol5 ), ! greater( U, T ), greater( skol3, Z ), !
% 0.69/1.11 reorganization_type( skol4, X, skol5 ) }.
% 0.69/1.11 parent0[4]: (619) {G1,W47,D2,L10,V5,M10} { ! reorganization_type( skol6, X
% 0.69/1.11 , skol5 ), ! class( skol4, Y, skol5 ), ! class( skol6, Y, skol5 ), !
% 0.69/1.11 reorganization( skol4, skol5, Z ), ! reorganization( skol6, skol5, skol3
% 0.69/1.11 ), ! inertia( skol4, T, skol5 ), ! inertia( skol6, U, skol5 ), ! greater
% 0.69/1.11 ( U, T ), greater( skol3, Z ), ! reorganization_type( skol4, X, skol5 )
% 0.69/1.11 }.
% 0.69/1.11 parent1[0]: (9) {G0,W4,D2,L1,V0,M1} I { reorganization( skol6, skol5, skol3
% 0.69/1.11 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := T
% 0.69/1.11 U := U
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (180) {G3,W42,D2,L9,V5,M1} R(131,5);r(9) { ! class( skol4, Y,
% 0.69/1.11 skol5 ), ! class( skol6, Y, skol5 ), ! reorganization( skol4, skol5, Z )
% 0.69/1.11 , ! reorganization_type( skol6, X, skol5 ), ! inertia( skol6, U, skol5 )
% 0.69/1.11 , ! greater( U, T ), greater( skol3, Z ), ! reorganization_type( skol4, X
% 0.69/1.11 , skol5 ), ! inertia( skol4, T, skol5 ) }.
% 0.69/1.11 parent0: (620) {G1,W42,D2,L9,V5,M9} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), ! class( skol4, Y, skol5 ), ! class( skol6, Y, skol5 ), !
% 0.69/1.11 reorganization( skol4, skol5, Z ), ! inertia( skol4, T, skol5 ), !
% 0.69/1.11 inertia( skol6, U, skol5 ), ! greater( U, T ), greater( skol3, Z ), !
% 0.69/1.11 reorganization_type( skol4, X, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := T
% 0.69/1.11 U := U
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 3
% 0.69/1.11 1 ==> 0
% 0.69/1.11 2 ==> 1
% 0.69/1.11 3 ==> 2
% 0.69/1.11 4 ==> 8
% 0.69/1.11 5 ==> 4
% 0.69/1.11 6 ==> 5
% 0.69/1.11 7 ==> 6
% 0.69/1.11 8 ==> 7
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (621) {G2,W39,D3,L8,V4,M8} { ! class( skol4, X, skol5 ), !
% 0.69/1.11 class( skol6, X, skol5 ), ! reorganization( skol4, skol5, Y ), !
% 0.69/1.11 reorganization_type( skol6, Z, skol5 ), ! inertia( skol6, T, skol5 ), !
% 0.69/1.11 greater( T, skol1( skol4, skol5 ) ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, Z, skol5 ) }.
% 0.69/1.11 parent0[8]: (180) {G3,W42,D2,L9,V5,M1} R(131,5);r(9) { ! class( skol4, Y,
% 0.69/1.11 skol5 ), ! class( skol6, Y, skol5 ), ! reorganization( skol4, skol5, Z )
% 0.69/1.11 , ! reorganization_type( skol6, X, skol5 ), ! inertia( skol6, U, skol5 )
% 0.69/1.11 , ! greater( U, T ), greater( skol3, Z ), ! reorganization_type( skol4, X
% 0.69/1.11 , skol5 ), ! inertia( skol4, T, skol5 ) }.
% 0.69/1.11 parent1[0]: (29) {G1,W6,D3,L1,V0,M1} R(0,3) { inertia( skol4, skol1( skol4
% 0.69/1.11 , skol5 ), skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := Z
% 0.69/1.11 Y := X
% 0.69/1.11 Z := Y
% 0.69/1.11 T := skol1( skol4, skol5 )
% 0.69/1.11 U := T
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (181) {G4,W39,D3,L8,V4,M1} R(180,29) { ! class( skol4, X,
% 0.69/1.11 skol5 ), ! class( skol6, X, skol5 ), ! reorganization( skol4, skol5, Y )
% 0.69/1.11 , ! reorganization_type( skol6, Z, skol5 ), ! greater( T, skol1( skol4,
% 0.69/1.11 skol5 ) ), greater( skol3, Y ), ! reorganization_type( skol4, Z, skol5 )
% 0.69/1.11 , ! inertia( skol6, T, skol5 ) }.
% 0.69/1.11 parent0: (621) {G2,W39,D3,L8,V4,M8} { ! class( skol4, X, skol5 ), ! class
% 0.69/1.11 ( skol6, X, skol5 ), ! reorganization( skol4, skol5, Y ), !
% 0.69/1.11 reorganization_type( skol6, Z, skol5 ), ! inertia( skol6, T, skol5 ), !
% 0.69/1.11 greater( T, skol1( skol4, skol5 ) ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, Z, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := T
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 1
% 0.69/1.11 2 ==> 2
% 0.69/1.11 3 ==> 3
% 0.69/1.11 4 ==> 7
% 0.69/1.11 5 ==> 4
% 0.69/1.11 6 ==> 5
% 0.69/1.11 7 ==> 6
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (622) {G2,W36,D3,L7,V3,M7} { ! class( skol4, X, skol5 ), !
% 0.69/1.11 class( skol6, X, skol5 ), ! reorganization( skol4, skol5, Y ), !
% 0.69/1.11 reorganization_type( skol6, Z, skol5 ), ! greater( skol1( skol6, skol5 )
% 0.69/1.11 , skol1( skol4, skol5 ) ), greater( skol3, Y ), ! reorganization_type(
% 0.69/1.11 skol4, Z, skol5 ) }.
% 0.69/1.11 parent0[7]: (181) {G4,W39,D3,L8,V4,M1} R(180,29) { ! class( skol4, X, skol5
% 0.69/1.11 ), ! class( skol6, X, skol5 ), ! reorganization( skol4, skol5, Y ), !
% 0.69/1.11 reorganization_type( skol6, Z, skol5 ), ! greater( T, skol1( skol4, skol5
% 0.69/1.11 ) ), greater( skol3, Y ), ! reorganization_type( skol4, Z, skol5 ), !
% 0.69/1.11 inertia( skol6, T, skol5 ) }.
% 0.69/1.11 parent1[0]: (30) {G1,W6,D3,L1,V0,M1} R(0,4) { inertia( skol6, skol1( skol6
% 0.69/1.11 , skol5 ), skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 T := skol1( skol6, skol5 )
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (623) {G3,W28,D2,L6,V3,M6} { ! class( skol4, X, skol5 ), !
% 0.69/1.11 class( skol6, X, skol5 ), ! reorganization( skol4, skol5, Y ), !
% 0.69/1.11 reorganization_type( skol6, Z, skol5 ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, Z, skol5 ) }.
% 0.69/1.11 parent0[4]: (622) {G2,W36,D3,L7,V3,M7} { ! class( skol4, X, skol5 ), !
% 0.69/1.11 class( skol6, X, skol5 ), ! reorganization( skol4, skol5, Y ), !
% 0.69/1.11 reorganization_type( skol6, Z, skol5 ), ! greater( skol1( skol6, skol5 )
% 0.69/1.11 , skol1( skol4, skol5 ) ), greater( skol3, Y ), ! reorganization_type(
% 0.69/1.11 skol4, Z, skol5 ) }.
% 0.69/1.11 parent1[0]: (160) {G7,W7,D3,L1,V0,M1} R(159,13);r(14) { greater( skol1(
% 0.69/1.11 skol6, skol5 ), skol1( skol4, skol5 ) ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (182) {G8,W28,D2,L6,V3,M1} R(181,30);r(160) { !
% 0.69/1.11 reorganization_type( skol6, Z, skol5 ), ! class( skol6, X, skol5 ), !
% 0.69/1.11 reorganization( skol4, skol5, Y ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, Z, skol5 ), ! class( skol4, X, skol5 ) }.
% 0.69/1.11 parent0: (623) {G3,W28,D2,L6,V3,M6} { ! class( skol4, X, skol5 ), ! class
% 0.69/1.11 ( skol6, X, skol5 ), ! reorganization( skol4, skol5, Y ), !
% 0.69/1.11 reorganization_type( skol6, Z, skol5 ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, Z, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := Z
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 5
% 0.69/1.11 1 ==> 1
% 0.69/1.11 2 ==> 2
% 0.69/1.11 3 ==> 0
% 0.69/1.11 4 ==> 3
% 0.69/1.11 5 ==> 4
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (624) {G1,W23,D2,L5,V2,M5} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), ! class( skol6, skol7, skol5 ), ! reorganization( skol4, skol5,
% 0.69/1.11 Y ), greater( skol3, Y ), ! reorganization_type( skol4, X, skol5 ) }.
% 0.69/1.11 parent0[5]: (182) {G8,W28,D2,L6,V3,M1} R(181,30);r(160) { !
% 0.69/1.11 reorganization_type( skol6, Z, skol5 ), ! class( skol6, X, skol5 ), !
% 0.69/1.11 reorganization( skol4, skol5, Y ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, Z, skol5 ), ! class( skol4, X, skol5 ) }.
% 0.69/1.11 parent1[0]: (6) {G0,W4,D2,L1,V0,M1} I { class( skol4, skol7, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := skol7
% 0.69/1.11 Y := Y
% 0.69/1.11 Z := X
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (625) {G1,W18,D2,L4,V2,M4} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), ! reorganization( skol4, skol5, Y ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, X, skol5 ) }.
% 0.69/1.11 parent0[1]: (624) {G1,W23,D2,L5,V2,M5} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), ! class( skol6, skol7, skol5 ), ! reorganization( skol4, skol5,
% 0.69/1.11 Y ), greater( skol3, Y ), ! reorganization_type( skol4, X, skol5 ) }.
% 0.69/1.11 parent1[0]: (7) {G0,W4,D2,L1,V0,M1} I { class( skol6, skol7, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (183) {G9,W18,D2,L4,V2,M1} R(182,6);r(7) { !
% 0.69/1.11 reorganization_type( skol6, X, skol5 ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, X, skol5 ), ! reorganization( skol4, skol5, Y
% 0.69/1.11 ) }.
% 0.69/1.11 parent0: (625) {G1,W18,D2,L4,V2,M4} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), ! reorganization( skol4, skol5, Y ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, X, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := Y
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 3
% 0.69/1.11 2 ==> 1
% 0.69/1.11 3 ==> 2
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (626) {G1,W13,D2,L3,V1,M3} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), greater( skol3, skol2 ), ! reorganization_type( skol4, X, skol5
% 0.69/1.11 ) }.
% 0.69/1.11 parent0[3]: (183) {G9,W18,D2,L4,V2,M1} R(182,6);r(7) { !
% 0.69/1.11 reorganization_type( skol6, X, skol5 ), greater( skol3, Y ), !
% 0.69/1.11 reorganization_type( skol4, X, skol5 ), ! reorganization( skol4, skol5, Y
% 0.69/1.11 ) }.
% 0.69/1.11 parent1[0]: (8) {G0,W4,D2,L1,V0,M1} I { reorganization( skol4, skol5, skol2
% 0.69/1.11 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 Y := skol2
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (627) {G1,W10,D2,L2,V1,M2} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), ! reorganization_type( skol4, X, skol5 ) }.
% 0.69/1.11 parent0[0]: (15) {G0,W4,D2,L1,V0,M1} I { ! greater( skol3, skol2 ) }.
% 0.69/1.11 parent1[1]: (626) {G1,W13,D2,L3,V1,M3} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), greater( skol3, skol2 ), ! reorganization_type( skol4, X, skol5
% 0.69/1.11 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (184) {G10,W10,D2,L2,V1,M1} R(183,8);r(15) { !
% 0.69/1.11 reorganization_type( skol6, X, skol5 ), ! reorganization_type( skol4, X,
% 0.69/1.11 skol5 ) }.
% 0.69/1.11 parent0: (627) {G1,W10,D2,L2,V1,M2} { ! reorganization_type( skol6, X,
% 0.69/1.11 skol5 ), ! reorganization_type( skol4, X, skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := X
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 0 ==> 0
% 0.69/1.11 1 ==> 1
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (628) {G1,W5,D2,L1,V0,M1} { ! reorganization_type( skol6,
% 0.69/1.11 skol8, skol5 ) }.
% 0.69/1.11 parent0[1]: (184) {G10,W10,D2,L2,V1,M1} R(183,8);r(15) { !
% 0.69/1.11 reorganization_type( skol6, X, skol5 ), ! reorganization_type( skol4, X,
% 0.69/1.11 skol5 ) }.
% 0.69/1.11 parent1[0]: (10) {G0,W4,D2,L1,V0,M1} I { reorganization_type( skol4, skol8
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 X := skol8
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 resolution: (629) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.11 parent0[0]: (628) {G1,W5,D2,L1,V0,M1} { ! reorganization_type( skol6,
% 0.69/1.11 skol8, skol5 ) }.
% 0.69/1.11 parent1[0]: (11) {G0,W4,D2,L1,V0,M1} I { reorganization_type( skol6, skol8
% 0.69/1.11 , skol5 ) }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 substitution1:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 subsumption: (185) {G11,W0,D0,L0,V0,M0} R(184,10);r(11) { }.
% 0.69/1.11 parent0: (629) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.11 substitution0:
% 0.69/1.11 end
% 0.69/1.11 permutation0:
% 0.69/1.11 end
% 0.69/1.11
% 0.69/1.11 Proof check complete!
% 0.69/1.11
% 0.69/1.11 Memory use:
% 0.69/1.11
% 0.69/1.11 space for terms: 5823
% 0.69/1.11 space for clauses: 7636
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 clauses generated: 362
% 0.69/1.11 clauses kept: 186
% 0.69/1.11 clauses selected: 185
% 0.69/1.11 clauses deleted: 0
% 0.69/1.11 clauses inuse deleted: 0
% 0.69/1.11
% 0.69/1.11 subsentry: 3625
% 0.69/1.11 literals s-matched: 2006
% 0.69/1.11 literals matched: 1119
% 0.69/1.11 full subsumption: 832
% 0.69/1.11
% 0.69/1.11 checksum: 1018912266
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksem ended
%------------------------------------------------------------------------------