TSTP Solution File: NUM843+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM843+2 : TPTP v8.1.0. Released v4.1.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 : Mon Jul 18 06:26:59 EDT 2022
% Result : Theorem 0.72s 1.10s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM843+2 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Thu Jul 7 07:34:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.10 *** allocated 10000 integers for termspace/termends
% 0.72/1.10 *** allocated 10000 integers for clauses
% 0.72/1.10 *** allocated 10000 integers for justifications
% 0.72/1.10 Bliksem 1.12
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Automatic Strategy Selection
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Clauses:
% 0.72/1.10
% 0.72/1.10 { ! greater( vd390, vd391 ) }.
% 0.72/1.10 { ! leq( vd390, vd391 ) }.
% 0.72/1.10 { less( vd390, vplus( vd391, v1 ) ) }.
% 0.72/1.10 { ! greater( X, Y ), geq( X, vplus( Y, v1 ) ) }.
% 0.72/1.10 { geq( X, v1 ) }.
% 0.72/1.10 { ! geq( Z, T ), ! geq( X, Y ), geq( vplus( X, Z ), vplus( Y, T ) ) }.
% 0.72/1.10 { ! greater( Z, T ), ! geq( X, Y ), greater( vplus( X, Z ), vplus( Y, T ) )
% 0.72/1.10 }.
% 0.72/1.10 { ! geq( Z, T ), ! greater( X, Y ), greater( vplus( X, Z ), vplus( Y, T ) )
% 0.72/1.10 }.
% 0.72/1.10 { ! greater( Z, T ), ! greater( X, Y ), greater( vplus( X, Z ), vplus( Y, T
% 0.72/1.10 ) ) }.
% 0.72/1.10 { ! less( vplus( X, Z ), vplus( Y, Z ) ), less( X, Y ) }.
% 0.72/1.10 { ! vplus( X, Z ) = vplus( Y, Z ), X = Y }.
% 0.72/1.10 { ! greater( vplus( X, Z ), vplus( Y, Z ) ), greater( X, Y ) }.
% 0.72/1.10 { ! less( X, Y ), less( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.72/1.10 { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.72/1.10 { ! greater( X, Y ), greater( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.72/1.10 { greater( vplus( X, Y ), X ) }.
% 0.72/1.10 { ! leq( Z, Y ), ! leq( X, Z ), leq( X, Y ) }.
% 0.72/1.10 { ! less( Z, Y ), ! leq( X, Z ), less( X, Y ) }.
% 0.72/1.10 { ! leq( Z, Y ), ! less( X, Z ), less( X, Y ) }.
% 0.72/1.10 { ! less( Z, Y ), ! less( X, Z ), less( X, Y ) }.
% 0.72/1.10 { ! leq( X, Y ), geq( Y, X ) }.
% 0.72/1.10 { ! geq( X, Y ), leq( Y, X ) }.
% 0.72/1.10 { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.72/1.10 { ! less( Y, X ), leq( Y, X ) }.
% 0.72/1.10 { ! Y = X, leq( Y, X ) }.
% 0.72/1.10 { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.72/1.10 { ! greater( Y, X ), geq( Y, X ) }.
% 0.72/1.10 { ! Y = X, geq( Y, X ) }.
% 0.72/1.10 { ! less( X, Y ), greater( Y, X ) }.
% 0.72/1.10 { ! greater( X, Y ), less( Y, X ) }.
% 0.72/1.10 { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.72/1.10 { ! X = Y, ! less( X, Y ) }.
% 0.72/1.10 { ! greater( X, Y ), ! less( X, Y ) }.
% 0.72/1.10 { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.10 { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) ) }.
% 0.72/1.10 { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.72/1.10 { ! greater( Y, X ), Y = vplus( X, skol2( X, Y ) ) }.
% 0.72/1.10 { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.72/1.10 { X = Y, X = vplus( Y, skol3( X, Y ) ), Y = vplus( X, skol4( X, Y ) ) }.
% 0.72/1.10 { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.72/1.10 { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.72/1.10 { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.72/1.10 { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.72/1.10 { ! Y = vplus( X, Y ) }.
% 0.72/1.10 { vplus( Y, X ) = vplus( X, Y ) }.
% 0.72/1.10 { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y ) ) }.
% 0.72/1.10 { vplus( v1, X ) = vsucc( X ) }.
% 0.72/1.10 { vplus( vplus( X, Y ), Z ) = vplus( X, vplus( Y, Z ) ) }.
% 0.72/1.10 { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y ) ) }.
% 0.72/1.10 { vplus( X, v1 ) = vsucc( X ) }.
% 0.72/1.10 { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.72/1.10 { ! vsucc( X ) = X }.
% 0.72/1.10 { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.72/1.10 { ! vsucc( X ) = vsucc( Y ), X = Y }.
% 0.72/1.10 { ! vsucc( X ) = v1 }.
% 0.72/1.10
% 0.72/1.10 percentage equality = 0.367925, percentage horn = 0.907407
% 0.72/1.10 This is a problem with some equality
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Options Used:
% 0.72/1.10
% 0.72/1.10 useres = 1
% 0.72/1.10 useparamod = 1
% 0.72/1.10 useeqrefl = 1
% 0.72/1.10 useeqfact = 1
% 0.72/1.10 usefactor = 1
% 0.72/1.10 usesimpsplitting = 0
% 0.72/1.10 usesimpdemod = 5
% 0.72/1.10 usesimpres = 3
% 0.72/1.10
% 0.72/1.10 resimpinuse = 1000
% 0.72/1.10 resimpclauses = 20000
% 0.72/1.10 substype = eqrewr
% 0.72/1.10 backwardsubs = 1
% 0.72/1.10 selectoldest = 5
% 0.72/1.10
% 0.72/1.10 litorderings [0] = split
% 0.72/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.10
% 0.72/1.10 termordering = kbo
% 0.72/1.10
% 0.72/1.10 litapriori = 0
% 0.72/1.10 termapriori = 1
% 0.72/1.10 litaposteriori = 0
% 0.72/1.10 termaposteriori = 0
% 0.72/1.10 demodaposteriori = 0
% 0.72/1.10 ordereqreflfact = 0
% 0.72/1.10
% 0.72/1.10 litselect = negord
% 0.72/1.10
% 0.72/1.10 maxweight = 15
% 0.72/1.10 maxdepth = 30000
% 0.72/1.10 maxlength = 115
% 0.72/1.10 maxnrvars = 195
% 0.72/1.10 excuselevel = 1
% 0.72/1.10 increasemaxweight = 1
% 0.72/1.10
% 0.72/1.10 maxselected = 10000000
% 0.72/1.10 maxnrclauses = 10000000
% 0.72/1.10
% 0.72/1.10 showgenerated = 0
% 0.72/1.10 showkept = 0
% 0.72/1.10 showselected = 0
% 0.72/1.10 showdeleted = 0
% 0.72/1.10 showresimp = 1
% 0.72/1.10 showstatus = 2000
% 0.72/1.10
% 0.72/1.10 prologoutput = 0
% 0.72/1.10 nrgoals = 5000000
% 0.72/1.10 totalproof = 1
% 0.72/1.10
% 0.72/1.10 Symbols occurring in the translation:
% 0.72/1.10
% 0.72/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.10 . [1, 2] (w:1, o:94, a:1, s:1, b:0),
% 0.72/1.10 ! [4, 1] (w:0, o:87, a:1, s:1, b:0),
% 0.72/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.10 vd390 [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.72/1.10 vd391 [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.72/1.10 greater [37, 2] (w:1, o:118, a:1, s:1, b:0),
% 0.72/1.10 leq [38, 2] (w:1, o:119, a:1, s:1, b:0),
% 0.72/1.10 v1 [39, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.72/1.10 vplus [40, 2] (w:1, o:120, a:1, s:1, b:0),
% 0.72/1.10 less [41, 2] (w:1, o:121, a:1, s:1, b:0),
% 0.72/1.10 geq [44, 2] (w:1, o:122, a:1, s:1, b:0),
% 0.72/1.10 vsucc [108, 1] (w:1, o:92, a:1, s:1, b:0),
% 0.72/1.10 vskolem2 [116, 1] (w:1, o:93, a:1, s:1, b:0),
% 0.72/1.10 skol1 [123, 2] (w:1, o:123, a:1, s:1, b:1),
% 0.72/1.10 skol2 [124, 2] (w:1, o:124, a:1, s:1, b:1),
% 0.72/1.10 skol3 [125, 2] (w:1, o:125, a:1, s:1, b:1),
% 0.72/1.10 skol4 [126, 2] (w:1, o:126, a:1, s:1, b:1).
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Starting Search:
% 0.72/1.10
% 0.72/1.10 *** allocated 15000 integers for clauses
% 0.72/1.10 *** allocated 22500 integers for clauses
% 0.72/1.10 *** allocated 33750 integers for clauses
% 0.72/1.10 *** allocated 50625 integers for clauses
% 0.72/1.10 *** allocated 15000 integers for termspace/termends
% 0.72/1.10 Resimplifying inuse:
% 0.72/1.10 Done
% 0.72/1.10
% 0.72/1.10 *** allocated 75937 integers for clauses
% 0.72/1.10 *** allocated 22500 integers for termspace/termends
% 0.72/1.10
% 0.72/1.10 Bliksems!, er is een bewijs:
% 0.72/1.10 % SZS status Theorem
% 0.72/1.10 % SZS output start Refutation
% 0.72/1.10
% 0.72/1.10 (0) {G0,W3,D2,L1,V0,M1} I { ! greater( vd390, vd391 ) }.
% 0.72/1.10 (1) {G0,W3,D2,L1,V0,M1} I { ! leq( vd390, vd391 ) }.
% 0.72/1.10 (23) {G0,W6,D2,L2,V2,M2} I { ! less( Y, X ), leq( Y, X ) }.
% 0.72/1.10 (24) {G0,W6,D2,L2,V2,M2} I { ! Y = X, leq( Y, X ) }.
% 0.72/1.10 (28) {G0,W6,D2,L2,V2,M2} I { ! less( X, Y ), greater( Y, X ) }.
% 0.72/1.10 (29) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), less( Y, X ) }.
% 0.72/1.10 (30) {G0,W9,D2,L3,V2,M3} I { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.72/1.10 (31) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! less( X, Y ) }.
% 0.72/1.10 (33) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.10 (57) {G1,W3,D2,L1,V1,M1} Q(31) { ! less( X, X ) }.
% 0.72/1.10 (87) {G1,W3,D2,L1,V0,M1} R(28,0) { ! less( vd391, vd390 ) }.
% 0.72/1.10 (134) {G1,W3,D2,L1,V0,M1} R(24,1) { ! vd391 ==> vd390 }.
% 0.72/1.10 (149) {G1,W3,D2,L1,V0,M1} R(23,1) { ! less( vd390, vd391 ) }.
% 0.72/1.10 (151) {G2,W3,D2,L1,V0,M1} R(149,29) { ! greater( vd391, vd390 ) }.
% 0.72/1.10 (1013) {G3,W3,D2,L1,V0,M1} R(30,151);r(87) { vd391 ==> vd390 }.
% 0.72/1.10 (1094) {G4,W6,D2,L2,V1,M2} P(30,134);d(1013);d(1013);r(33) { ! X = vd390,
% 0.72/1.10 less( X, vd390 ) }.
% 0.72/1.10 (1139) {G5,W0,D0,L0,V0,M0} Q(1094);r(57) { }.
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 % SZS output end Refutation
% 0.72/1.10 found a proof!
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Unprocessed initial clauses:
% 0.72/1.10
% 0.72/1.10 (1141) {G0,W3,D2,L1,V0,M1} { ! greater( vd390, vd391 ) }.
% 0.72/1.10 (1142) {G0,W3,D2,L1,V0,M1} { ! leq( vd390, vd391 ) }.
% 0.72/1.10 (1143) {G0,W5,D3,L1,V0,M1} { less( vd390, vplus( vd391, v1 ) ) }.
% 0.72/1.10 (1144) {G0,W8,D3,L2,V2,M2} { ! greater( X, Y ), geq( X, vplus( Y, v1 ) )
% 0.72/1.10 }.
% 0.72/1.10 (1145) {G0,W3,D2,L1,V1,M1} { geq( X, v1 ) }.
% 0.72/1.10 (1146) {G0,W13,D3,L3,V4,M3} { ! geq( Z, T ), ! geq( X, Y ), geq( vplus( X
% 0.72/1.10 , Z ), vplus( Y, T ) ) }.
% 0.72/1.10 (1147) {G0,W13,D3,L3,V4,M3} { ! greater( Z, T ), ! geq( X, Y ), greater(
% 0.72/1.10 vplus( X, Z ), vplus( Y, T ) ) }.
% 0.72/1.10 (1148) {G0,W13,D3,L3,V4,M3} { ! geq( Z, T ), ! greater( X, Y ), greater(
% 0.72/1.10 vplus( X, Z ), vplus( Y, T ) ) }.
% 0.72/1.10 (1149) {G0,W13,D3,L3,V4,M3} { ! greater( Z, T ), ! greater( X, Y ),
% 0.72/1.10 greater( vplus( X, Z ), vplus( Y, T ) ) }.
% 0.72/1.10 (1150) {G0,W10,D3,L2,V3,M2} { ! less( vplus( X, Z ), vplus( Y, Z ) ), less
% 0.72/1.10 ( X, Y ) }.
% 0.72/1.10 (1151) {G0,W10,D3,L2,V3,M2} { ! vplus( X, Z ) = vplus( Y, Z ), X = Y }.
% 0.72/1.10 (1152) {G0,W10,D3,L2,V3,M2} { ! greater( vplus( X, Z ), vplus( Y, Z ) ),
% 0.72/1.10 greater( X, Y ) }.
% 0.72/1.10 (1153) {G0,W10,D3,L2,V3,M2} { ! less( X, Y ), less( vplus( X, Z ), vplus(
% 0.72/1.10 Y, Z ) ) }.
% 0.72/1.10 (1154) {G0,W10,D3,L2,V3,M2} { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.72/1.10 (1155) {G0,W10,D3,L2,V3,M2} { ! greater( X, Y ), greater( vplus( X, Z ),
% 0.72/1.10 vplus( Y, Z ) ) }.
% 0.72/1.10 (1156) {G0,W5,D3,L1,V2,M1} { greater( vplus( X, Y ), X ) }.
% 0.72/1.10 (1157) {G0,W9,D2,L3,V3,M3} { ! leq( Z, Y ), ! leq( X, Z ), leq( X, Y ) }.
% 0.72/1.10 (1158) {G0,W9,D2,L3,V3,M3} { ! less( Z, Y ), ! leq( X, Z ), less( X, Y )
% 0.72/1.10 }.
% 0.72/1.10 (1159) {G0,W9,D2,L3,V3,M3} { ! leq( Z, Y ), ! less( X, Z ), less( X, Y )
% 0.72/1.10 }.
% 0.72/1.10 (1160) {G0,W9,D2,L3,V3,M3} { ! less( Z, Y ), ! less( X, Z ), less( X, Y )
% 0.72/1.10 }.
% 0.72/1.10 (1161) {G0,W6,D2,L2,V2,M2} { ! leq( X, Y ), geq( Y, X ) }.
% 0.72/1.10 (1162) {G0,W6,D2,L2,V2,M2} { ! geq( X, Y ), leq( Y, X ) }.
% 0.72/1.10 (1163) {G0,W9,D2,L3,V2,M3} { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.72/1.10 (1164) {G0,W6,D2,L2,V2,M2} { ! less( Y, X ), leq( Y, X ) }.
% 0.72/1.10 (1165) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( Y, X ) }.
% 0.72/1.10 (1166) {G0,W9,D2,L3,V2,M3} { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.72/1.10 (1167) {G0,W6,D2,L2,V2,M2} { ! greater( Y, X ), geq( Y, X ) }.
% 0.72/1.10 (1168) {G0,W6,D2,L2,V2,M2} { ! Y = X, geq( Y, X ) }.
% 0.72/1.10 (1169) {G0,W6,D2,L2,V2,M2} { ! less( X, Y ), greater( Y, X ) }.
% 0.72/1.10 (1170) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), less( Y, X ) }.
% 0.72/1.10 (1171) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.72/1.10 (1172) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! less( X, Y ) }.
% 0.72/1.10 (1173) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! less( X, Y ) }.
% 0.72/1.10 (1174) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.10 (1175) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y, skol1( X, Y )
% 0.72/1.10 ) }.
% 0.72/1.10 (1176) {G0,W8,D3,L2,V3,M2} { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.72/1.10 (1177) {G0,W10,D4,L2,V2,M2} { ! greater( Y, X ), Y = vplus( X, skol2( X, Y
% 0.72/1.10 ) ) }.
% 0.72/1.10 (1178) {G0,W8,D3,L2,V3,M2} { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.72/1.10 (1179) {G0,W17,D4,L3,V2,M3} { X = Y, X = vplus( Y, skol3( X, Y ) ), Y =
% 0.72/1.10 vplus( X, skol4( X, Y ) ) }.
% 0.72/1.10 (1180) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.72/1.10 (1181) {G0,W10,D3,L2,V4,M2} { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.72/1.10 (1182) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.72/1.10 (1183) {G0,W10,D3,L2,V3,M2} { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.72/1.10 (1184) {G0,W5,D3,L1,V2,M1} { ! Y = vplus( X, Y ) }.
% 0.72/1.10 (1185) {G0,W7,D3,L1,V2,M1} { vplus( Y, X ) = vplus( X, Y ) }.
% 0.72/1.10 (1186) {G0,W9,D4,L1,V2,M1} { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y )
% 0.72/1.10 ) }.
% 0.72/1.10 (1187) {G0,W6,D3,L1,V1,M1} { vplus( v1, X ) = vsucc( X ) }.
% 0.72/1.10 (1188) {G0,W11,D4,L1,V3,M1} { vplus( vplus( X, Y ), Z ) = vplus( X, vplus
% 0.72/1.10 ( Y, Z ) ) }.
% 0.72/1.10 (1189) {G0,W9,D4,L1,V2,M1} { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y )
% 0.72/1.10 ) }.
% 0.72/1.10 (1190) {G0,W6,D3,L1,V1,M1} { vplus( X, v1 ) = vsucc( X ) }.
% 0.72/1.10 (1191) {G0,W8,D4,L2,V1,M2} { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.72/1.10 (1192) {G0,W4,D3,L1,V1,M1} { ! vsucc( X ) = X }.
% 0.72/1.10 (1193) {G0,W8,D3,L2,V2,M2} { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.72/1.10 (1194) {G0,W8,D3,L2,V2,M2} { ! vsucc( X ) = vsucc( Y ), X = Y }.
% 0.72/1.10 (1195) {G0,W4,D3,L1,V1,M1} { ! vsucc( X ) = v1 }.
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 Total Proof:
% 0.72/1.10
% 0.72/1.10 subsumption: (0) {G0,W3,D2,L1,V0,M1} I { ! greater( vd390, vd391 ) }.
% 0.72/1.10 parent0: (1141) {G0,W3,D2,L1,V0,M1} { ! greater( vd390, vd391 ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (1) {G0,W3,D2,L1,V0,M1} I { ! leq( vd390, vd391 ) }.
% 0.72/1.10 parent0: (1142) {G0,W3,D2,L1,V0,M1} { ! leq( vd390, vd391 ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (23) {G0,W6,D2,L2,V2,M2} I { ! less( Y, X ), leq( Y, X ) }.
% 0.72/1.10 parent0: (1164) {G0,W6,D2,L2,V2,M2} { ! less( Y, X ), leq( Y, X ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 Y := Y
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 1 ==> 1
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (24) {G0,W6,D2,L2,V2,M2} I { ! Y = X, leq( Y, X ) }.
% 0.72/1.10 parent0: (1165) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( Y, X ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 Y := Y
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 1 ==> 1
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (28) {G0,W6,D2,L2,V2,M2} I { ! less( X, Y ), greater( Y, X )
% 0.72/1.10 }.
% 0.72/1.10 parent0: (1169) {G0,W6,D2,L2,V2,M2} { ! less( X, Y ), greater( Y, X ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 Y := Y
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 1 ==> 1
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (29) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), less( Y, X )
% 0.72/1.10 }.
% 0.72/1.10 parent0: (1170) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), less( Y, X ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 Y := Y
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 1 ==> 1
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (30) {G0,W9,D2,L3,V2,M3} I { X = Y, greater( X, Y ), less( X,
% 0.72/1.10 Y ) }.
% 0.72/1.10 parent0: (1171) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y )
% 0.72/1.10 }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 Y := Y
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 1 ==> 1
% 0.72/1.10 2 ==> 2
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (31) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! less( X, Y ) }.
% 0.72/1.10 parent0: (1172) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! less( X, Y ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 Y := Y
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 1 ==> 1
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 subsumption: (33) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.10 parent0: (1174) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.10 substitution0:
% 0.72/1.10 X := X
% 0.72/1.10 Y := Y
% 0.72/1.10 end
% 0.72/1.10 permutation0:
% 0.72/1.10 0 ==> 0
% 0.72/1.10 1 ==> 1
% 0.72/1.10 end
% 0.72/1.10
% 0.72/1.10 eqswap: (1267) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! less( X, Y ) }.
% 0.72/1.10 parent0[0]: (31) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! less( X, Y ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 X := X
% 3.71/4.11 Y := Y
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 eqrefl: (1268) {G0,W3,D2,L1,V1,M1} { ! less( X, X ) }.
% 3.71/4.11 parent0[0]: (1267) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! less( X, Y ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 X := X
% 3.71/4.11 Y := X
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 subsumption: (57) {G1,W3,D2,L1,V1,M1} Q(31) { ! less( X, X ) }.
% 3.71/4.11 parent0: (1268) {G0,W3,D2,L1,V1,M1} { ! less( X, X ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 X := X
% 3.71/4.11 end
% 3.71/4.11 permutation0:
% 3.71/4.11 0 ==> 0
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 resolution: (1269) {G1,W3,D2,L1,V0,M1} { ! less( vd391, vd390 ) }.
% 3.71/4.11 parent0[0]: (0) {G0,W3,D2,L1,V0,M1} I { ! greater( vd390, vd391 ) }.
% 3.71/4.11 parent1[1]: (28) {G0,W6,D2,L2,V2,M2} I { ! less( X, Y ), greater( Y, X )
% 3.71/4.11 }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 substitution1:
% 3.71/4.11 X := vd391
% 3.71/4.11 Y := vd390
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 subsumption: (87) {G1,W3,D2,L1,V0,M1} R(28,0) { ! less( vd391, vd390 ) }.
% 3.71/4.11 parent0: (1269) {G1,W3,D2,L1,V0,M1} { ! less( vd391, vd390 ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 permutation0:
% 3.71/4.11 0 ==> 0
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 eqswap: (1270) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( X, Y ) }.
% 3.71/4.11 parent0[0]: (24) {G0,W6,D2,L2,V2,M2} I { ! Y = X, leq( Y, X ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 X := Y
% 3.71/4.11 Y := X
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 resolution: (1271) {G1,W3,D2,L1,V0,M1} { ! vd391 = vd390 }.
% 3.71/4.11 parent0[0]: (1) {G0,W3,D2,L1,V0,M1} I { ! leq( vd390, vd391 ) }.
% 3.71/4.11 parent1[1]: (1270) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( X, Y ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 substitution1:
% 3.71/4.11 X := vd390
% 3.71/4.11 Y := vd391
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 subsumption: (134) {G1,W3,D2,L1,V0,M1} R(24,1) { ! vd391 ==> vd390 }.
% 3.71/4.11 parent0: (1271) {G1,W3,D2,L1,V0,M1} { ! vd391 = vd390 }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 permutation0:
% 3.71/4.11 0 ==> 0
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 resolution: (1273) {G1,W3,D2,L1,V0,M1} { ! less( vd390, vd391 ) }.
% 3.71/4.11 parent0[0]: (1) {G0,W3,D2,L1,V0,M1} I { ! leq( vd390, vd391 ) }.
% 3.71/4.11 parent1[1]: (23) {G0,W6,D2,L2,V2,M2} I { ! less( Y, X ), leq( Y, X ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 substitution1:
% 3.71/4.11 X := vd391
% 3.71/4.11 Y := vd390
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 subsumption: (149) {G1,W3,D2,L1,V0,M1} R(23,1) { ! less( vd390, vd391 ) }.
% 3.71/4.11 parent0: (1273) {G1,W3,D2,L1,V0,M1} { ! less( vd390, vd391 ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 permutation0:
% 3.71/4.11 0 ==> 0
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 resolution: (1274) {G1,W3,D2,L1,V0,M1} { ! greater( vd391, vd390 ) }.
% 3.71/4.11 parent0[0]: (149) {G1,W3,D2,L1,V0,M1} R(23,1) { ! less( vd390, vd391 ) }.
% 3.71/4.11 parent1[1]: (29) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), less( Y, X )
% 3.71/4.11 }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 substitution1:
% 3.71/4.11 X := vd391
% 3.71/4.11 Y := vd390
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 subsumption: (151) {G2,W3,D2,L1,V0,M1} R(149,29) { ! greater( vd391, vd390
% 3.71/4.11 ) }.
% 3.71/4.11 parent0: (1274) {G1,W3,D2,L1,V0,M1} { ! greater( vd391, vd390 ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 permutation0:
% 3.71/4.11 0 ==> 0
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 eqswap: (1275) {G0,W9,D2,L3,V2,M3} { Y = X, greater( X, Y ), less( X, Y )
% 3.71/4.11 }.
% 3.71/4.11 parent0[0]: (30) {G0,W9,D2,L3,V2,M3} I { X = Y, greater( X, Y ), less( X, Y
% 3.71/4.11 ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 X := X
% 3.71/4.11 Y := Y
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 resolution: (1276) {G1,W6,D2,L2,V0,M2} { vd390 = vd391, less( vd391, vd390
% 3.71/4.11 ) }.
% 3.71/4.11 parent0[0]: (151) {G2,W3,D2,L1,V0,M1} R(149,29) { ! greater( vd391, vd390 )
% 3.71/4.11 }.
% 3.71/4.11 parent1[1]: (1275) {G0,W9,D2,L3,V2,M3} { Y = X, greater( X, Y ), less( X,
% 3.71/4.11 Y ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 substitution1:
% 3.71/4.11 X := vd391
% 3.71/4.11 Y := vd390
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 resolution: (1277) {G2,W3,D2,L1,V0,M1} { vd390 = vd391 }.
% 3.71/4.11 parent0[0]: (87) {G1,W3,D2,L1,V0,M1} R(28,0) { ! less( vd391, vd390 ) }.
% 3.71/4.11 parent1[1]: (1276) {G1,W6,D2,L2,V0,M2} { vd390 = vd391, less( vd391, vd390
% 3.71/4.11 ) }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 substitution1:
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 eqswap: (1278) {G2,W3,D2,L1,V0,M1} { vd391 = vd390 }.
% 3.71/4.11 parent0[0]: (1277) {G2,W3,D2,L1,V0,M1} { vd390 = vd391 }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 subsumption: (1013) {G3,W3,D2,L1,V0,M1} R(30,151);r(87) { vd391 ==> vd390
% 3.71/4.11 }.
% 3.71/4.11 parent0: (1278) {G2,W3,D2,L1,V0,M1} { vd391 = vd390 }.
% 3.71/4.11 substitution0:
% 3.71/4.11 end
% 3.71/4.11 permutation0:
% 3.71/4.11 0 ==> 0
% 3.71/4.11 end
% 3.71/4.11
% 3.71/4.11 *** allocated 33750 integers for termspace/termends
% 3.71/4.11 *** allocated 15000 integers for justifications
% 3.71/4.11 *** allocated 50625 integers for termspace/termends
% 3.71/4.11 *** allocated 22500 integers for justifications
% 3.71/4.11 *** allocated 113905 integers for clauses
% 3.71/4.11 *** allocated 33750 integers for justifications
% 3.71/4.11 *** allocated 75937 integers for termspace/termends
% 3.71/4.11 *** allocated 50625 integers for justifications
% 3.71/4.11 *** allocated 113905 integers for termspace/termends
% 3.71/4.11 *** allocated 170857 integers for clauses
% 3.71/4.11 *** allocated 75937 integers for justifications
% 3.71/4.11 *** allocated 170857 integerCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------