TSTP Solution File: MGT014+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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:36 EDT 2022
% Result : Theorem 2.75s 3.16s
% Output : Refutation 2.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Thu Jun 9 11:24:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.75/3.16 *** allocated 10000 integers for termspace/termends
% 2.75/3.16 *** allocated 10000 integers for clauses
% 2.75/3.16 *** allocated 10000 integers for justifications
% 2.75/3.16 Bliksem 1.12
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16 Automatic Strategy Selection
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16 Clauses:
% 2.75/3.16
% 2.75/3.16 { ! greater( X, Y ), ! X = Y }.
% 2.75/3.16 { ! greater( X, Y ), ! greater( Y, X ) }.
% 2.75/3.16 { ! organization( Y, X ), time( X ) }.
% 2.75/3.16 { ! time( X ), ! time( Y ), greater( X, Y ), X = Y, greater( Y, X ) }.
% 2.75/3.16 { ! reorganization_free( X, Y, Z ), reorganization_free( X, Z, Y ) }.
% 2.75/3.16 { ! organization( Z, T ), ! organization( Z, U ), ! size( Z, X, T ), ! size
% 2.75/3.16 ( Z, Y, U ), ! T = U, X = Y }.
% 2.75/3.16 { ! organization( Z, T ), ! organization( Z, U ), ! reorganization_free( Z
% 2.75/3.16 , T, U ), ! size( Z, X, T ), ! size( Z, Y, U ), ! greater( U, T ), !
% 2.75/3.16 greater( X, Y ) }.
% 2.75/3.16 { ! organization( Z, T ), ! organization( Z, U ), ! reorganization_free( Z
% 2.75/3.16 , T, U ), ! complexity( Z, X, T ), ! complexity( Z, Y, U ), ! greater( U
% 2.75/3.16 , T ), ! greater( X, Y ) }.
% 2.75/3.16 { organization( skol3, skol4 ) }.
% 2.75/3.16 { organization( skol3, skol5 ) }.
% 2.75/3.16 { reorganization_free( skol3, skol4, skol5 ) }.
% 2.75/3.16 { complexity( skol3, skol1, skol4 ) }.
% 2.75/3.16 { complexity( skol3, skol2, skol5 ) }.
% 2.75/3.16 { size( skol3, skol6, skol4 ) }.
% 2.75/3.16 { size( skol3, skol7, skol5 ) }.
% 2.75/3.16 { greater( skol7, skol6 ) }.
% 2.75/3.16 { greater( skol1, skol2 ) }.
% 2.75/3.16
% 2.75/3.16 percentage equality = 0.095238, percentage horn = 0.941176
% 2.75/3.16 This is a problem with some equality
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16 Options Used:
% 2.75/3.16
% 2.75/3.16 useres = 1
% 2.75/3.16 useparamod = 1
% 2.75/3.16 useeqrefl = 1
% 2.75/3.16 useeqfact = 1
% 2.75/3.16 usefactor = 1
% 2.75/3.16 usesimpsplitting = 0
% 2.75/3.16 usesimpdemod = 5
% 2.75/3.16 usesimpres = 3
% 2.75/3.16
% 2.75/3.16 resimpinuse = 1000
% 2.75/3.16 resimpclauses = 20000
% 2.75/3.16 substype = eqrewr
% 2.75/3.16 backwardsubs = 1
% 2.75/3.16 selectoldest = 5
% 2.75/3.16
% 2.75/3.16 litorderings [0] = split
% 2.75/3.16 litorderings [1] = extend the termordering, first sorting on arguments
% 2.75/3.16
% 2.75/3.16 termordering = kbo
% 2.75/3.16
% 2.75/3.16 litapriori = 0
% 2.75/3.16 termapriori = 1
% 2.75/3.16 litaposteriori = 0
% 2.75/3.16 termaposteriori = 0
% 2.75/3.16 demodaposteriori = 0
% 2.75/3.16 ordereqreflfact = 0
% 2.75/3.16
% 2.75/3.16 litselect = negord
% 2.75/3.16
% 2.75/3.16 maxweight = 15
% 2.75/3.16 maxdepth = 30000
% 2.75/3.16 maxlength = 115
% 2.75/3.16 maxnrvars = 195
% 2.75/3.16 excuselevel = 1
% 2.75/3.16 increasemaxweight = 1
% 2.75/3.16
% 2.75/3.16 maxselected = 10000000
% 2.75/3.16 maxnrclauses = 10000000
% 2.75/3.16
% 2.75/3.16 showgenerated = 0
% 2.75/3.16 showkept = 0
% 2.75/3.16 showselected = 0
% 2.75/3.16 showdeleted = 0
% 2.75/3.16 showresimp = 1
% 2.75/3.16 showstatus = 2000
% 2.75/3.16
% 2.75/3.16 prologoutput = 0
% 2.75/3.16 nrgoals = 5000000
% 2.75/3.16 totalproof = 1
% 2.75/3.16
% 2.75/3.16 Symbols occurring in the translation:
% 2.75/3.16
% 2.75/3.16 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 2.75/3.16 . [1, 2] (w:1, o:28, a:1, s:1, b:0),
% 2.75/3.16 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 2.75/3.16 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.75/3.16 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.75/3.16 greater [37, 2] (w:1, o:52, a:1, s:1, b:0),
% 2.75/3.16 organization [39, 2] (w:1, o:53, a:1, s:1, b:0),
% 2.75/3.16 time [40, 1] (w:1, o:27, a:1, s:1, b:0),
% 2.75/3.16 reorganization_free [43, 3] (w:1, o:54, a:1, s:1, b:0),
% 2.75/3.16 size [46, 3] (w:1, o:55, a:1, s:1, b:0),
% 2.75/3.16 complexity [49, 3] (w:1, o:56, a:1, s:1, b:0),
% 2.75/3.16 skol1 [50, 0] (w:1, o:15, a:1, s:1, b:1),
% 2.75/3.16 skol2 [51, 0] (w:1, o:16, a:1, s:1, b:1),
% 2.75/3.16 skol3 [52, 0] (w:1, o:17, a:1, s:1, b:1),
% 2.75/3.16 skol4 [53, 0] (w:1, o:18, a:1, s:1, b:1),
% 2.75/3.16 skol5 [54, 0] (w:1, o:19, a:1, s:1, b:1),
% 2.75/3.16 skol6 [55, 0] (w:1, o:20, a:1, s:1, b:1),
% 2.75/3.16 skol7 [56, 0] (w:1, o:21, a:1, s:1, b:1).
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16 Starting Search:
% 2.75/3.16
% 2.75/3.16 *** allocated 15000 integers for clauses
% 2.75/3.16 *** allocated 22500 integers for clauses
% 2.75/3.16 *** allocated 33750 integers for clauses
% 2.75/3.16 *** allocated 15000 integers for termspace/termends
% 2.75/3.16 *** allocated 50625 integers for clauses
% 2.75/3.16 *** allocated 22500 integers for termspace/termends
% 2.75/3.16 Resimplifying inuse:
% 2.75/3.16 Done
% 2.75/3.16
% 2.75/3.16 *** allocated 75937 integers for clauses
% 2.75/3.16 *** allocated 33750 integers for termspace/termends
% 2.75/3.16
% 2.75/3.16 Intermediate Status:
% 2.75/3.16 Generated: 15943
% 2.75/3.16 Kept: 2002
% 2.75/3.16 Inuse: 179
% 2.75/3.16 Deleted: 7
% 2.75/3.16 Deletedinuse: 1
% 2.75/3.16
% 2.75/3.16 Resimplifying inuse:
% 2.75/3.16 Done
% 2.75/3.16
% 2.75/3.16 *** allocated 113905 integers for clauses
% 2.75/3.16 *** allocated 50625 integers for termspace/termends
% 2.75/3.16 Resimplifying inuse:
% 2.75/3.16 Done
% 2.75/3.16
% 2.75/3.16 *** allocated 75937 integers for termspace/termends
% 2.75/3.16 *** allocated 170857 integers for clauses
% 2.75/3.16
% 2.75/3.16 Intermediate Status:
% 2.75/3.16 Generated: 38088
% 2.75/3.16 Kept: 4002
% 2.75/3.16 Inuse: 333
% 2.75/3.16 Deleted: 9
% 2.75/3.16 Deletedinuse: 1
% 2.75/3.16
% 2.75/3.16 Resimplifying inuse:
% 2.75/3.16 Done
% 2.75/3.16
% 2.75/3.16 *** allocated 113905 integers for termspace/termends
% 2.75/3.16 *** allocated 256285 integers for clauses
% 2.75/3.16 Resimplifying inuse:
% 2.75/3.16 Done
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16 Intermediate Status:
% 2.75/3.16 Generated: 117897
% 2.75/3.16 Kept: 6014
% 2.75/3.16 Inuse: 509
% 2.75/3.16 Deleted: 16
% 2.75/3.16 Deletedinuse: 1
% 2.75/3.16
% 2.75/3.16 Resimplifying inuse:
% 2.75/3.16 Done
% 2.75/3.16
% 2.75/3.16 *** allocated 170857 integers for termspace/termends
% 2.75/3.16 Resimplifying inuse:
% 2.75/3.16 Done
% 2.75/3.16
% 2.75/3.16 *** allocated 384427 integers for clauses
% 2.75/3.16
% 2.75/3.16 Intermediate Status:
% 2.75/3.16 Generated: 290310
% 2.75/3.16 Kept: 8046
% 2.75/3.16 Inuse: 741
% 2.75/3.16 Deleted: 23
% 2.75/3.16 Deletedinuse: 1
% 2.75/3.16
% 2.75/3.16 Resimplifying inuse:
% 2.75/3.16 Done
% 2.75/3.16
% 2.75/3.16 Resimplifying inuse:
% 2.75/3.16 Done
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16 Bliksems!, er is een bewijs:
% 2.75/3.16 % SZS status Theorem
% 2.75/3.16 % SZS output start Refutation
% 2.75/3.16
% 2.75/3.16 (0) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), ! X = Y }.
% 2.75/3.16 (2) {G0,W5,D2,L2,V2,M2} I { ! organization( Y, X ), time( X ) }.
% 2.75/3.16 (3) {G0,W13,D2,L5,V2,M5} I { ! time( X ), ! time( Y ), greater( X, Y ), X =
% 2.75/3.16 Y, greater( Y, X ) }.
% 2.75/3.16 (4) {G0,W8,D2,L2,V3,M2} I { ! reorganization_free( X, Y, Z ),
% 2.75/3.16 reorganization_free( X, Z, Y ) }.
% 2.75/3.16 (5) {G0,W20,D2,L6,V5,M6} I { ! organization( Z, T ), ! organization( Z, U )
% 2.75/3.16 , ! size( Z, X, T ), ! size( Z, Y, U ), ! T = U, X = Y }.
% 2.75/3.16 (6) {G0,W24,D2,L7,V5,M7} I { ! organization( Z, T ), ! organization( Z, U )
% 2.75/3.16 , ! reorganization_free( Z, T, U ), ! size( Z, X, T ), ! size( Z, Y, U )
% 2.75/3.16 , ! greater( U, T ), ! greater( X, Y ) }.
% 2.75/3.16 (7) {G0,W24,D2,L7,V5,M7} I { ! organization( Z, T ), ! organization( Z, U )
% 2.75/3.16 , ! reorganization_free( Z, T, U ), ! complexity( Z, X, T ), ! complexity
% 2.75/3.16 ( Z, Y, U ), ! greater( U, T ), ! greater( X, Y ) }.
% 2.75/3.16 (8) {G0,W3,D2,L1,V0,M1} I { organization( skol3, skol4 ) }.
% 2.75/3.16 (9) {G0,W3,D2,L1,V0,M1} I { organization( skol3, skol5 ) }.
% 2.75/3.16 (10) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol3, skol4, skol5 ) }.
% 2.75/3.16 (11) {G0,W4,D2,L1,V0,M1} I { complexity( skol3, skol1, skol4 ) }.
% 2.75/3.16 (12) {G0,W4,D2,L1,V0,M1} I { complexity( skol3, skol2, skol5 ) }.
% 2.75/3.16 (13) {G0,W4,D2,L1,V0,M1} I { size( skol3, skol6, skol4 ) }.
% 2.75/3.16 (14) {G0,W4,D2,L1,V0,M1} I { size( skol3, skol7, skol5 ) }.
% 2.75/3.16 (15) {G0,W3,D2,L1,V0,M1} I { greater( skol7, skol6 ) }.
% 2.75/3.16 (16) {G0,W3,D2,L1,V0,M1} I { greater( skol1, skol2 ) }.
% 2.75/3.16 (25) {G1,W2,D2,L1,V0,M1} R(2,8) { time( skol4 ) }.
% 2.75/3.16 (26) {G1,W2,D2,L1,V0,M1} R(2,9) { time( skol5 ) }.
% 2.75/3.16 (27) {G1,W4,D2,L1,V0,M1} R(4,10) { reorganization_free( skol3, skol5, skol4
% 2.75/3.16 ) }.
% 2.75/3.16 (31) {G1,W10,D2,L4,V2,M4} R(3,0);r(0) { ! time( X ), ! time( Y ), X = Y, !
% 2.75/3.16 Y = X }.
% 2.75/3.16 (64) {G2,W8,D2,L3,V1,M3} R(31,26) { ! time( X ), skol5 = X, ! X = skol5 }.
% 2.75/3.16 (85) {G2,W9,D2,L3,V1,M3} P(31,13);r(25) { size( skol3, skol6, X ), ! time(
% 2.75/3.16 X ), ! X = skol4 }.
% 2.75/3.16 (92) {G2,W8,D2,L3,V1,M3} P(31,8);r(25) { organization( skol3, X ), ! time(
% 2.75/3.16 X ), ! X = skol4 }.
% 2.75/3.16 (99) {G3,W6,D2,L2,V0,M2} R(64,25) { skol5 ==> skol4, ! skol5 ==> skol4 }.
% 2.75/3.16 (128) {G1,W13,D2,L4,V2,M4} R(5,13);r(8) { ! organization( skol3, X ), !
% 2.75/3.16 size( skol3, Y, X ), ! skol4 = X, skol6 = Y }.
% 2.75/3.16 (129) {G1,W13,D2,L4,V2,M4} R(5,14);r(9) { ! organization( skol3, X ), !
% 2.75/3.16 size( skol3, Y, X ), ! skol5 = X, skol7 = Y }.
% 2.75/3.16 (182) {G2,W7,D2,L2,V1,M2} Q(129);r(9) { ! size( skol3, X, skol5 ), skol7 =
% 2.75/3.16 X }.
% 2.75/3.16 (183) {G2,W7,D2,L2,V1,M2} Q(128);r(8) { ! size( skol3, X, skol4 ), skol6 =
% 2.75/3.16 X }.
% 2.75/3.16 (184) {G3,W7,D2,L2,V1,M2} R(183,0) { ! size( skol3, X, skol4 ), ! greater(
% 2.75/3.16 skol6, X ) }.
% 2.75/3.16 (222) {G3,W7,D2,L2,V1,M2} P(183,15) { greater( skol7, X ), ! size( skol3, X
% 2.75/3.16 , skol4 ) }.
% 2.75/3.16 (258) {G1,W17,D2,L5,V2,M5} R(6,14);r(9) { ! organization( skol3, X ), !
% 2.75/3.16 reorganization_free( skol3, skol5, X ), ! size( skol3, Y, X ), ! greater
% 2.75/3.16 ( X, skol5 ), ! greater( skol7, Y ) }.
% 2.75/3.16 (313) {G1,W17,D2,L5,V2,M5} R(7,10);r(8) { ! organization( skol3, skol5 ), !
% 2.75/3.16 complexity( skol3, X, skol4 ), ! complexity( skol3, Y, skol5 ), !
% 2.75/3.16 greater( skol5, skol4 ), ! greater( X, Y ) }.
% 2.75/3.16 (346) {G4,W8,D2,L2,V1,M2} P(182,184);r(222) { ! size( skol3, X, skol4 ), !
% 2.75/3.16 size( skol3, skol6, skol5 ) }.
% 2.75/3.16 (383) {G5,W4,D2,L1,V0,M1} P(182,13);r(346) { ! size( skol3, skol6, skol5 )
% 2.75/3.16 }.
% 2.75/3.16 (400) {G6,W3,D2,L1,V0,M1} P(99,383);r(13) { ! skol5 ==> skol4 }.
% 2.75/3.16 (409) {G7,W11,D2,L4,V1,M4} P(3,400);r(26) { ! X = skol4, ! time( X ),
% 2.75/3.16 greater( skol5, X ), greater( X, skol5 ) }.
% 2.75/3.16 (410) {G8,W6,D2,L2,V0,M2} Q(409);r(25) { greater( skol5, skol4 ), greater(
% 2.75/3.16 skol4, skol5 ) }.
% 2.75/3.16 (8107) {G3,W15,D2,L5,V1,M5} R(258,85);r(92) { ! reorganization_free( skol3
% 2.75/3.16 , skol5, X ), ! greater( X, skol5 ), ! greater( skol7, skol6 ), ! time( X
% 2.75/3.16 ), ! X = skol4 }.
% 2.75/3.16 (8119) {G4,W8,D2,L3,V0,M3} Q(8107);r(27) { ! greater( skol4, skol5 ), !
% 2.75/3.16 greater( skol7, skol6 ), ! time( skol4 ) }.
% 2.75/3.16 (8233) {G5,W3,D2,L1,V0,M1} S(8119);r(15);r(25) { ! greater( skol4, skol5 )
% 2.75/3.16 }.
% 2.75/3.16 (8246) {G9,W3,D2,L1,V0,M1} R(8233,410) { greater( skol5, skol4 ) }.
% 2.75/3.16 (9198) {G10,W11,D2,L3,V2,M3} S(313);r(9);r(8246) { ! complexity( skol3, X,
% 2.75/3.16 skol4 ), ! complexity( skol3, Y, skol5 ), ! greater( X, Y ) }.
% 2.75/3.16 (9299) {G11,W4,D2,L1,V0,M1} R(9198,16);r(11) { ! complexity( skol3, skol2,
% 2.75/3.16 skol5 ) }.
% 2.75/3.16 (9613) {G12,W0,D0,L0,V0,M0} S(9299);r(12) { }.
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16 % SZS output end Refutation
% 2.75/3.16 found a proof!
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16 Unprocessed initial clauses:
% 2.75/3.16
% 2.75/3.16 (9615) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! X = Y }.
% 2.75/3.16 (9616) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! greater( Y, X ) }.
% 2.75/3.16 (9617) {G0,W5,D2,L2,V2,M2} { ! organization( Y, X ), time( X ) }.
% 2.75/3.16 (9618) {G0,W13,D2,L5,V2,M5} { ! time( X ), ! time( Y ), greater( X, Y ), X
% 2.75/3.16 = Y, greater( Y, X ) }.
% 2.75/3.16 (9619) {G0,W8,D2,L2,V3,M2} { ! reorganization_free( X, Y, Z ),
% 2.75/3.16 reorganization_free( X, Z, Y ) }.
% 2.75/3.16 (9620) {G0,W20,D2,L6,V5,M6} { ! organization( Z, T ), ! organization( Z, U
% 2.75/3.16 ), ! size( Z, X, T ), ! size( Z, Y, U ), ! T = U, X = Y }.
% 2.75/3.16 (9621) {G0,W24,D2,L7,V5,M7} { ! organization( Z, T ), ! organization( Z, U
% 2.75/3.16 ), ! reorganization_free( Z, T, U ), ! size( Z, X, T ), ! size( Z, Y, U
% 2.75/3.16 ), ! greater( U, T ), ! greater( X, Y ) }.
% 2.75/3.16 (9622) {G0,W24,D2,L7,V5,M7} { ! organization( Z, T ), ! organization( Z, U
% 2.75/3.16 ), ! reorganization_free( Z, T, U ), ! complexity( Z, X, T ), !
% 2.75/3.16 complexity( Z, Y, U ), ! greater( U, T ), ! greater( X, Y ) }.
% 2.75/3.16 (9623) {G0,W3,D2,L1,V0,M1} { organization( skol3, skol4 ) }.
% 2.75/3.16 (9624) {G0,W3,D2,L1,V0,M1} { organization( skol3, skol5 ) }.
% 2.75/3.16 (9625) {G0,W4,D2,L1,V0,M1} { reorganization_free( skol3, skol4, skol5 )
% 2.75/3.16 }.
% 2.75/3.16 (9626) {G0,W4,D2,L1,V0,M1} { complexity( skol3, skol1, skol4 ) }.
% 2.75/3.16 (9627) {G0,W4,D2,L1,V0,M1} { complexity( skol3, skol2, skol5 ) }.
% 2.75/3.16 (9628) {G0,W4,D2,L1,V0,M1} { size( skol3, skol6, skol4 ) }.
% 2.75/3.16 (9629) {G0,W4,D2,L1,V0,M1} { size( skol3, skol7, skol5 ) }.
% 2.75/3.16 (9630) {G0,W3,D2,L1,V0,M1} { greater( skol7, skol6 ) }.
% 2.75/3.16 (9631) {G0,W3,D2,L1,V0,M1} { greater( skol1, skol2 ) }.
% 2.75/3.16
% 2.75/3.16
% 2.75/3.16 Total Proof:
% 2.75/3.16
% 2.75/3.16 subsumption: (0) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), ! X = Y }.
% 2.75/3.16 parent0: (9615) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! X = Y }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := X
% 2.75/3.16 Y := Y
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 1 ==> 1
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (2) {G0,W5,D2,L2,V2,M2} I { ! organization( Y, X ), time( X )
% 2.75/3.16 }.
% 2.75/3.16 parent0: (9617) {G0,W5,D2,L2,V2,M2} { ! organization( Y, X ), time( X )
% 2.75/3.16 }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := X
% 2.75/3.16 Y := Y
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 1 ==> 1
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (3) {G0,W13,D2,L5,V2,M5} I { ! time( X ), ! time( Y ), greater
% 2.75/3.16 ( X, Y ), X = Y, greater( Y, X ) }.
% 2.75/3.16 parent0: (9618) {G0,W13,D2,L5,V2,M5} { ! time( X ), ! time( Y ), greater(
% 2.75/3.16 X, Y ), X = Y, greater( Y, X ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := X
% 2.75/3.16 Y := Y
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 1 ==> 1
% 2.75/3.16 2 ==> 2
% 2.75/3.16 3 ==> 3
% 2.75/3.16 4 ==> 4
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (4) {G0,W8,D2,L2,V3,M2} I { ! reorganization_free( X, Y, Z ),
% 2.75/3.16 reorganization_free( X, Z, Y ) }.
% 2.75/3.16 parent0: (9619) {G0,W8,D2,L2,V3,M2} { ! reorganization_free( X, Y, Z ),
% 2.75/3.16 reorganization_free( X, Z, Y ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := X
% 2.75/3.16 Y := Y
% 2.75/3.16 Z := Z
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 1 ==> 1
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (5) {G0,W20,D2,L6,V5,M6} I { ! organization( Z, T ), !
% 2.75/3.16 organization( Z, U ), ! size( Z, X, T ), ! size( Z, Y, U ), ! T = U, X =
% 2.75/3.16 Y }.
% 2.75/3.16 parent0: (9620) {G0,W20,D2,L6,V5,M6} { ! organization( Z, T ), !
% 2.75/3.16 organization( Z, U ), ! size( Z, X, T ), ! size( Z, Y, U ), ! T = U, X =
% 2.75/3.16 Y }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := X
% 2.75/3.16 Y := Y
% 2.75/3.16 Z := Z
% 2.75/3.16 T := T
% 2.75/3.16 U := U
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 1 ==> 1
% 2.75/3.16 2 ==> 2
% 2.75/3.16 3 ==> 3
% 2.75/3.16 4 ==> 4
% 2.75/3.16 5 ==> 5
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (6) {G0,W24,D2,L7,V5,M7} I { ! organization( Z, T ), !
% 2.75/3.16 organization( Z, U ), ! reorganization_free( Z, T, U ), ! size( Z, X, T )
% 2.75/3.16 , ! size( Z, Y, U ), ! greater( U, T ), ! greater( X, Y ) }.
% 2.75/3.16 parent0: (9621) {G0,W24,D2,L7,V5,M7} { ! organization( Z, T ), !
% 2.75/3.16 organization( Z, U ), ! reorganization_free( Z, T, U ), ! size( Z, X, T )
% 2.75/3.16 , ! size( Z, Y, U ), ! greater( U, T ), ! greater( X, Y ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := X
% 2.75/3.16 Y := Y
% 2.75/3.16 Z := Z
% 2.75/3.16 T := T
% 2.75/3.16 U := U
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 1 ==> 1
% 2.75/3.16 2 ==> 2
% 2.75/3.16 3 ==> 3
% 2.75/3.16 4 ==> 4
% 2.75/3.16 5 ==> 5
% 2.75/3.16 6 ==> 6
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (7) {G0,W24,D2,L7,V5,M7} I { ! organization( Z, T ), !
% 2.75/3.16 organization( Z, U ), ! reorganization_free( Z, T, U ), ! complexity( Z,
% 2.75/3.16 X, T ), ! complexity( Z, Y, U ), ! greater( U, T ), ! greater( X, Y ) }.
% 2.75/3.16 parent0: (9622) {G0,W24,D2,L7,V5,M7} { ! organization( Z, T ), !
% 2.75/3.16 organization( Z, U ), ! reorganization_free( Z, T, U ), ! complexity( Z,
% 2.75/3.16 X, T ), ! complexity( Z, Y, U ), ! greater( U, T ), ! greater( X, Y ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := X
% 2.75/3.16 Y := Y
% 2.75/3.16 Z := Z
% 2.75/3.16 T := T
% 2.75/3.16 U := U
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 1 ==> 1
% 2.75/3.16 2 ==> 2
% 2.75/3.16 3 ==> 3
% 2.75/3.16 4 ==> 4
% 2.75/3.16 5 ==> 5
% 2.75/3.16 6 ==> 6
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (8) {G0,W3,D2,L1,V0,M1} I { organization( skol3, skol4 ) }.
% 2.75/3.16 parent0: (9623) {G0,W3,D2,L1,V0,M1} { organization( skol3, skol4 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (9) {G0,W3,D2,L1,V0,M1} I { organization( skol3, skol5 ) }.
% 2.75/3.16 parent0: (9624) {G0,W3,D2,L1,V0,M1} { organization( skol3, skol5 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (10) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol3, skol4
% 2.75/3.16 , skol5 ) }.
% 2.75/3.16 parent0: (9625) {G0,W4,D2,L1,V0,M1} { reorganization_free( skol3, skol4,
% 2.75/3.16 skol5 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (11) {G0,W4,D2,L1,V0,M1} I { complexity( skol3, skol1, skol4 )
% 2.75/3.16 }.
% 2.75/3.16 parent0: (9626) {G0,W4,D2,L1,V0,M1} { complexity( skol3, skol1, skol4 )
% 2.75/3.16 }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (12) {G0,W4,D2,L1,V0,M1} I { complexity( skol3, skol2, skol5 )
% 2.75/3.16 }.
% 2.75/3.16 parent0: (9627) {G0,W4,D2,L1,V0,M1} { complexity( skol3, skol2, skol5 )
% 2.75/3.16 }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (13) {G0,W4,D2,L1,V0,M1} I { size( skol3, skol6, skol4 ) }.
% 2.75/3.16 parent0: (9628) {G0,W4,D2,L1,V0,M1} { size( skol3, skol6, skol4 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (14) {G0,W4,D2,L1,V0,M1} I { size( skol3, skol7, skol5 ) }.
% 2.75/3.16 parent0: (9629) {G0,W4,D2,L1,V0,M1} { size( skol3, skol7, skol5 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (15) {G0,W3,D2,L1,V0,M1} I { greater( skol7, skol6 ) }.
% 2.75/3.16 parent0: (9630) {G0,W3,D2,L1,V0,M1} { greater( skol7, skol6 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (16) {G0,W3,D2,L1,V0,M1} I { greater( skol1, skol2 ) }.
% 2.75/3.16 parent0: (9631) {G0,W3,D2,L1,V0,M1} { greater( skol1, skol2 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 resolution: (9900) {G1,W2,D2,L1,V0,M1} { time( skol4 ) }.
% 2.75/3.16 parent0[0]: (2) {G0,W5,D2,L2,V2,M2} I { ! organization( Y, X ), time( X )
% 2.75/3.16 }.
% 2.75/3.16 parent1[0]: (8) {G0,W3,D2,L1,V0,M1} I { organization( skol3, skol4 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := skol4
% 2.75/3.16 Y := skol3
% 2.75/3.16 end
% 2.75/3.16 substitution1:
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (25) {G1,W2,D2,L1,V0,M1} R(2,8) { time( skol4 ) }.
% 2.75/3.16 parent0: (9900) {G1,W2,D2,L1,V0,M1} { time( skol4 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 resolution: (9901) {G1,W2,D2,L1,V0,M1} { time( skol5 ) }.
% 2.75/3.16 parent0[0]: (2) {G0,W5,D2,L2,V2,M2} I { ! organization( Y, X ), time( X )
% 2.75/3.16 }.
% 2.75/3.16 parent1[0]: (9) {G0,W3,D2,L1,V0,M1} I { organization( skol3, skol5 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := skol5
% 2.75/3.16 Y := skol3
% 2.75/3.16 end
% 2.75/3.16 substitution1:
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 subsumption: (26) {G1,W2,D2,L1,V0,M1} R(2,9) { time( skol5 ) }.
% 2.75/3.16 parent0: (9901) {G1,W2,D2,L1,V0,M1} { time( skol5 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 end
% 2.75/3.16 permutation0:
% 2.75/3.16 0 ==> 0
% 2.75/3.16 end
% 2.75/3.16
% 2.75/3.16 resolution: (9902) {G1,W4,D2,L1,V0,M1} { reorganization_free( skol3, skol5
% 2.75/3.16 , skol4 ) }.
% 2.75/3.16 parent0[0]: (4) {G0,W8,D2,L2,V3,M2} I { ! reorganization_free( X, Y, Z ),
% 2.75/3.16 reorganization_free( X, Z, Y ) }.
% 2.75/3.16 parent1[0]: (10) {G0,W4,D2,L1,V0,M1} I { reorganization_free( skol3, skol4
% 2.75/3.16 , skol5 ) }.
% 2.75/3.16 substitution0:
% 2.75/3.16 X := skol3
% 2.75/3.16 Y := skol4
% 2.75/3.16 Z := skol5
% 2.75/3.16 end
% 2.75/3.16 substitution1:
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 subsumption: (27) {G1,W4,D2,L1,V0,M1} R(4,10) { reorganization_free( skol3
% 219.18/219.63 , skol5, skol4 ) }.
% 219.18/219.63 parent0: (9902) {G1,W4,D2,L1,V0,M1} { reorganization_free( skol3, skol5,
% 219.18/219.63 skol4 ) }.
% 219.18/219.63 substitution0:
% 219.18/219.63 end
% 219.18/219.63 permutation0:
% 219.18/219.63 0 ==> 0
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 eqswap: (9903) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! greater( X, Y ) }.
% 219.18/219.63 parent0[1]: (0) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), ! X = Y }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := X
% 219.18/219.63 Y := Y
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 eqswap: (9904) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! greater( X, Y ) }.
% 219.18/219.63 parent0[1]: (0) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), ! X = Y }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := X
% 219.18/219.63 Y := Y
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 resolution: (9906) {G1,W13,D2,L5,V2,M5} { ! X = Y, ! time( Y ), ! time( X
% 219.18/219.63 ), Y = X, greater( X, Y ) }.
% 219.18/219.63 parent0[1]: (9903) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! greater( X, Y ) }.
% 219.18/219.63 parent1[2]: (3) {G0,W13,D2,L5,V2,M5} I { ! time( X ), ! time( Y ), greater
% 219.18/219.63 ( X, Y ), X = Y, greater( Y, X ) }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := Y
% 219.18/219.63 Y := X
% 219.18/219.63 end
% 219.18/219.63 substitution1:
% 219.18/219.63 X := Y
% 219.18/219.63 Y := X
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 resolution: (9931) {G1,W13,D2,L5,V2,M5} { ! X = Y, ! Y = X, ! time( X ), !
% 219.18/219.63 time( Y ), X = Y }.
% 219.18/219.63 parent0[1]: (9904) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! greater( X, Y ) }.
% 219.18/219.63 parent1[4]: (9906) {G1,W13,D2,L5,V2,M5} { ! X = Y, ! time( Y ), ! time( X
% 219.18/219.63 ), Y = X, greater( X, Y ) }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := Y
% 219.18/219.63 Y := X
% 219.18/219.63 end
% 219.18/219.63 substitution1:
% 219.18/219.63 X := Y
% 219.18/219.63 Y := X
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 eqswap: (9932) {G1,W13,D2,L5,V2,M5} { ! Y = X, ! Y = X, ! time( X ), !
% 219.18/219.63 time( Y ), X = Y }.
% 219.18/219.63 parent0[0]: (9931) {G1,W13,D2,L5,V2,M5} { ! X = Y, ! Y = X, ! time( X ), !
% 219.18/219.63 time( Y ), X = Y }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := X
% 219.18/219.63 Y := Y
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 factor: (9936) {G1,W10,D2,L4,V2,M4} { ! X = Y, ! time( Y ), ! time( X ), Y
% 219.18/219.63 = X }.
% 219.18/219.63 parent0[0, 1]: (9932) {G1,W13,D2,L5,V2,M5} { ! Y = X, ! Y = X, ! time( X )
% 219.18/219.63 , ! time( Y ), X = Y }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := Y
% 219.18/219.63 Y := X
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 subsumption: (31) {G1,W10,D2,L4,V2,M4} R(3,0);r(0) { ! time( X ), ! time( Y
% 219.18/219.63 ), X = Y, ! Y = X }.
% 219.18/219.63 parent0: (9936) {G1,W10,D2,L4,V2,M4} { ! X = Y, ! time( Y ), ! time( X ),
% 219.18/219.63 Y = X }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := Y
% 219.18/219.63 Y := X
% 219.18/219.63 end
% 219.18/219.63 permutation0:
% 219.18/219.63 0 ==> 3
% 219.18/219.63 1 ==> 0
% 219.18/219.63 2 ==> 1
% 219.18/219.63 3 ==> 2
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 eqswap: (9939) {G1,W10,D2,L4,V2,M4} { Y = X, ! time( X ), ! time( Y ), ! Y
% 219.18/219.63 = X }.
% 219.18/219.63 parent0[2]: (31) {G1,W10,D2,L4,V2,M4} R(3,0);r(0) { ! time( X ), ! time( Y
% 219.18/219.63 ), X = Y, ! Y = X }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := X
% 219.18/219.63 Y := Y
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 resolution: (9941) {G2,W8,D2,L3,V1,M3} { skol5 = X, ! time( X ), ! skol5 =
% 219.18/219.63 X }.
% 219.18/219.63 parent0[2]: (9939) {G1,W10,D2,L4,V2,M4} { Y = X, ! time( X ), ! time( Y )
% 219.18/219.63 , ! Y = X }.
% 219.18/219.63 parent1[0]: (26) {G1,W2,D2,L1,V0,M1} R(2,9) { time( skol5 ) }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := X
% 219.18/219.63 Y := skol5
% 219.18/219.63 end
% 219.18/219.63 substitution1:
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 eqswap: (9943) {G2,W8,D2,L3,V1,M3} { ! X = skol5, skol5 = X, ! time( X )
% 219.18/219.63 }.
% 219.18/219.63 parent0[2]: (9941) {G2,W8,D2,L3,V1,M3} { skol5 = X, ! time( X ), ! skol5 =
% 219.18/219.63 X }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := X
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 subsumption: (64) {G2,W8,D2,L3,V1,M3} R(31,26) { ! time( X ), skol5 = X, !
% 219.18/219.63 X = skol5 }.
% 219.18/219.63 parent0: (9943) {G2,W8,D2,L3,V1,M3} { ! X = skol5, skol5 = X, ! time( X )
% 219.18/219.63 }.
% 219.18/219.63 substitution0:
% 219.18/219.63 X := X
% 219.18/219.63 end
% 219.18/219.63 permutation0:
% 219.18/219.63 0 ==> 2
% 219.18/219.63 1 ==> 1
% 219.18/219.63 2 ==> 0
% 219.18/219.63 end
% 219.18/219.63
% 219.18/219.63 *** allocated 256285 integers for termspace/termends
% 219.18/219.63 *** allocated 15000 integers for justifications
% 219.18/219.63 *** allocated 22500 integers for justifications
% 219.18/219.63 *** allocated 33750 integers for justifications
% 219.18/219.63 *** allocated 576640 integers for clauses
% 219.18/219.63 *** allocated 50625 integers for justifications
% 219.18/219.63 *** allocated 384427 integers for termspace/termends
% 219.18/219.63 *** allocated 75937 integers for justifications
% 219.18/219.63 *** allocated 113905 integers for justifications
% 219.18/219.63 *** allocated 576640 integers for termspace/termends
% 219.18/219.63 *** allocated 170857 integers for justifications
% 219.18/219.63 *** allocated 864960 integers for clauses
% 219.18/219.63 *** allocated 256285 integers for justifications
% 219.18/219.63 *** allocated 864960 integers for termspace/termends
% 219.18/219.63 *** allocated 384427 integers for justifications
% 219.18/219.63 *** allocated 1297440 integers for termspace/termends
% 219.18/219.63 *** allocated 1297440 integers for clauses
% 219.18/219.63 *** allocated 576640 integers for justifications
% 219.18/219.63 *** allocated 1946160 integers for termspace/termends
% 219.18/219.63 *** allocated 864960 integers for justifications
% 219.18/219.63 *** allocated 1946160 integers for clauses
% 219.18/219.63 *** allocated 29Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------