TSTP Solution File: NUM839+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM839+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.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:55 EDT 2022
% Result : Theorem 0.64s 1.12s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM839+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n024.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 : Wed Jul 6 08:57:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.64/1.12 *** allocated 10000 integers for termspace/termends
% 0.64/1.12 *** allocated 10000 integers for clauses
% 0.64/1.12 *** allocated 10000 integers for justifications
% 0.64/1.12 Bliksem 1.12
% 0.64/1.12
% 0.64/1.12
% 0.64/1.12 Automatic Strategy Selection
% 0.64/1.12
% 0.64/1.12
% 0.64/1.12 Clauses:
% 0.64/1.12
% 0.64/1.12 { ! greater( vd328, vd329 ) }.
% 0.64/1.12 { greater( vplus( vd328, vd330 ), vplus( vd329, vd330 ) ) }.
% 0.64/1.12 { ! less( X, Y ), less( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.64/1.12 { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.64/1.12 { ! greater( X, Y ), greater( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.64/1.12 { greater( vplus( X, Y ), X ) }.
% 0.64/1.12 { ! leq( Z, Y ), ! leq( X, Z ), leq( X, Y ) }.
% 0.64/1.12 { ! less( Z, Y ), ! leq( X, Z ), less( X, Y ) }.
% 0.64/1.12 { ! leq( Z, Y ), ! less( X, Z ), less( X, Y ) }.
% 0.64/1.12 { ! less( Z, Y ), ! less( X, Z ), less( X, Y ) }.
% 0.64/1.12 { ! leq( X, Y ), geq( Y, X ) }.
% 0.64/1.12 { ! geq( X, Y ), leq( Y, X ) }.
% 0.64/1.12 { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.64/1.12 { ! less( Y, X ), leq( Y, X ) }.
% 0.64/1.12 { ! Y = X, leq( Y, X ) }.
% 0.64/1.12 { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.64/1.12 { ! greater( Y, X ), geq( Y, X ) }.
% 0.64/1.12 { ! Y = X, geq( Y, X ) }.
% 0.64/1.12 { ! less( X, Y ), greater( Y, X ) }.
% 0.64/1.12 { ! greater( X, Y ), less( Y, X ) }.
% 0.64/1.12 { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.64/1.12 { ! X = Y, ! less( X, Y ) }.
% 0.64/1.12 { ! greater( X, Y ), ! less( X, Y ) }.
% 0.64/1.12 { ! X = Y, ! greater( X, Y ) }.
% 0.64/1.12 { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) ) }.
% 0.64/1.12 { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.64/1.12 { ! greater( Y, X ), Y = vplus( X, skol2( X, Y ) ) }.
% 0.64/1.12 { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.64/1.12 { X = Y, X = vplus( Y, skol3( X, Y ) ), Y = vplus( X, skol4( X, Y ) ) }.
% 0.64/1.12 { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.64/1.12 { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.64/1.12 { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.64/1.12 { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.64/1.12 { ! Y = vplus( X, Y ) }.
% 0.64/1.12 { vplus( Y, X ) = vplus( X, Y ) }.
% 0.64/1.12 { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y ) ) }.
% 0.64/1.12 { vplus( v1, X ) = vsucc( X ) }.
% 0.64/1.12 { vplus( vplus( X, Y ), Z ) = vplus( X, vplus( Y, Z ) ) }.
% 0.64/1.12 { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y ) ) }.
% 0.64/1.12 { vplus( X, v1 ) = vsucc( X ) }.
% 0.64/1.12 { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.64/1.12 { ! vsucc( X ) = X }.
% 0.64/1.12 { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.64/1.12 { ! vsucc( X ) = vsucc( Y ), X = Y }.
% 0.64/1.12 { ! vsucc( X ) = v1 }.
% 0.64/1.12
% 0.64/1.12 percentage equality = 0.440476, percentage horn = 0.886364
% 0.64/1.12 This is a problem with some equality
% 0.64/1.12
% 0.64/1.12
% 0.64/1.12
% 0.64/1.12 Options Used:
% 0.64/1.12
% 0.64/1.12 useres = 1
% 0.64/1.12 useparamod = 1
% 0.64/1.12 useeqrefl = 1
% 0.64/1.12 useeqfact = 1
% 0.64/1.12 usefactor = 1
% 0.64/1.12 usesimpsplitting = 0
% 0.64/1.12 usesimpdemod = 5
% 0.64/1.12 usesimpres = 3
% 0.64/1.12
% 0.64/1.12 resimpinuse = 1000
% 0.64/1.12 resimpclauses = 20000
% 0.64/1.12 substype = eqrewr
% 0.64/1.12 backwardsubs = 1
% 0.64/1.12 selectoldest = 5
% 0.64/1.12
% 0.64/1.12 litorderings [0] = split
% 0.64/1.12 litorderings [1] = extend the termordering, first sorting on arguments
% 0.64/1.12
% 0.64/1.12 termordering = kbo
% 0.64/1.12
% 0.64/1.12 litapriori = 0
% 0.64/1.12 termapriori = 1
% 0.64/1.12 litaposteriori = 0
% 0.64/1.12 termaposteriori = 0
% 0.64/1.12 demodaposteriori = 0
% 0.64/1.12 ordereqreflfact = 0
% 0.64/1.12
% 0.64/1.12 litselect = negord
% 0.64/1.12
% 0.64/1.12 maxweight = 15
% 0.64/1.12 maxdepth = 30000
% 0.64/1.12 maxlength = 115
% 0.64/1.12 maxnrvars = 195
% 0.64/1.12 excuselevel = 1
% 0.64/1.12 increasemaxweight = 1
% 0.64/1.12
% 0.64/1.12 maxselected = 10000000
% 0.64/1.12 maxnrclauses = 10000000
% 0.64/1.12
% 0.64/1.12 showgenerated = 0
% 0.64/1.12 showkept = 0
% 0.64/1.12 showselected = 0
% 0.64/1.12 showdeleted = 0
% 0.64/1.12 showresimp = 1
% 0.64/1.12 showstatus = 2000
% 0.64/1.12
% 0.64/1.12 prologoutput = 0
% 0.64/1.12 nrgoals = 5000000
% 0.64/1.12 totalproof = 1
% 0.64/1.12
% 0.64/1.12 Symbols occurring in the translation:
% 0.64/1.12
% 0.64/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.64/1.12 . [1, 2] (w:1, o:77, a:1, s:1, b:0),
% 0.64/1.12 ! [4, 1] (w:0, o:70, a:1, s:1, b:0),
% 0.64/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.64/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.64/1.12 vd328 [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.64/1.12 vd329 [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.64/1.12 greater [37, 2] (w:1, o:101, a:1, s:1, b:0),
% 0.64/1.12 vd330 [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.64/1.12 vplus [39, 2] (w:1, o:102, a:1, s:1, b:0),
% 0.64/1.12 less [43, 2] (w:1, o:103, a:1, s:1, b:0),
% 0.64/1.12 leq [49, 2] (w:1, o:104, a:1, s:1, b:0),
% 0.64/1.12 geq [58, 2] (w:1, o:105, a:1, s:1, b:0),
% 0.64/1.12 vsucc [90, 1] (w:1, o:75, a:1, s:1, b:0),
% 0.64/1.12 v1 [92, 0] (w:1, o:69, a:1, s:1, b:0),
% 0.64/1.12 vskolem2 [99, 1] (w:1, o:76, a:1, s:1, b:0),
% 0.64/1.12 skol1 [106, 2] (w:1, o:106, a:1, s:1, b:1),
% 0.64/1.12 skol2 [107, 2] (w:1, o:107, a:1, s:1, b:1),
% 0.64/1.12 skol3 [108, 2] (w:1, o:108, a:1, s:1, b:1),
% 0.64/1.12 skol4 [109, 2] (w:1, o:109, a:1, s:1, b:1).
% 0.64/1.12
% 0.64/1.12
% 0.64/1.12 Starting Search:
% 0.64/1.12
% 0.64/1.12 *** allocated 15000 integers for clauses
% 0.64/1.12 *** allocated 22500 integers for clauses
% 0.64/1.12 *** allocated 33750 integers for clauses
% 0.64/1.12 *** allocated 50625 integers for clauses
% 0.64/1.12 *** allocated 15000 integers for termspace/termends
% 0.64/1.12 Resimplifying inuse:
% 0.64/1.12 Done
% 0.64/1.12
% 0.64/1.12 *** allocated 75937 integers for clauses
% 0.64/1.12 *** allocated 22500 integers for termspace/termends
% 0.64/1.12 *** allocated 113905 integers for clauses
% 0.64/1.12 *** allocated 33750 integers for termspace/termends
% 0.64/1.12
% 0.64/1.12 Intermediate Status:
% 0.64/1.12 Generated: 5032
% 0.64/1.12 Kept: 2064
% 0.64/1.12 Inuse: 131
% 0.64/1.12 Deleted: 0
% 0.64/1.12 Deletedinuse: 0
% 0.64/1.12
% 0.64/1.12 Resimplifying inuse:
% 0.64/1.12 Done
% 0.64/1.12
% 0.64/1.12 *** allocated 170857 integers for clauses
% 0.64/1.12 *** allocated 50625 integers for termspace/termends
% 0.64/1.12
% 0.64/1.12 Bliksems!, er is een bewijs:
% 0.64/1.12 % SZS status Theorem
% 0.64/1.12 % SZS output start Refutation
% 0.64/1.12
% 0.64/1.12 (0) {G0,W3,D2,L1,V0,M1} I { ! greater( vd328, vd329 ) }.
% 0.64/1.12 (1) {G0,W7,D3,L1,V0,M1} I { greater( vplus( vd328, vd330 ), vplus( vd329,
% 0.64/1.12 vd330 ) ) }.
% 0.64/1.12 (2) {G0,W10,D3,L2,V3,M2} I { ! less( X, Y ), less( vplus( X, Z ), vplus( Y
% 0.64/1.12 , Z ) ) }.
% 0.64/1.12 (12) {G0,W9,D2,L3,V2,M3} I { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.64/1.12 (14) {G0,W6,D2,L2,V2,M2} I { ! Y = X, leq( Y, X ) }.
% 0.64/1.12 (20) {G0,W9,D2,L3,V2,M3} I { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.64/1.12 (22) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), ! less( X, Y ) }.
% 0.64/1.12 (23) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! greater( X, Y ) }.
% 0.64/1.12 (43) {G1,W3,D2,L1,V1,M1} Q(14) { leq( X, X ) }.
% 0.64/1.12 (52) {G1,W7,D3,L1,V0,M1} R(23,1) { ! vplus( vd329, vd330 ) ==> vplus( vd328
% 0.64/1.12 , vd330 ) }.
% 0.64/1.12 (55) {G1,W10,D3,L2,V3,M2} R(22,2) { ! greater( vplus( X, Y ), vplus( Z, Y )
% 0.64/1.12 ), ! less( X, Z ) }.
% 0.64/1.12 (424) {G1,W6,D2,L2,V0,M2} R(20,0) { vd329 ==> vd328, less( vd328, vd329 )
% 0.64/1.12 }.
% 0.64/1.12 (2663) {G2,W13,D3,L3,V1,M3} P(12,52) { ! vplus( X, vd330 ) = vplus( vd328,
% 0.64/1.12 vd330 ), ! leq( X, vd329 ), less( X, vd329 ) }.
% 0.64/1.12 (2668) {G3,W3,D2,L1,V0,M1} Q(2663);d(424);r(43) { less( vd328, vd329 ) }.
% 0.64/1.12 (2741) {G4,W0,D0,L0,V0,M0} R(55,1);r(2668) { }.
% 0.64/1.12
% 0.64/1.12
% 0.64/1.12 % SZS output end Refutation
% 0.64/1.12 found a proof!
% 0.64/1.12
% 0.64/1.12
% 0.64/1.12 Unprocessed initial clauses:
% 0.64/1.12
% 0.64/1.12 (2743) {G0,W3,D2,L1,V0,M1} { ! greater( vd328, vd329 ) }.
% 0.64/1.12 (2744) {G0,W7,D3,L1,V0,M1} { greater( vplus( vd328, vd330 ), vplus( vd329
% 0.64/1.12 , vd330 ) ) }.
% 0.64/1.12 (2745) {G0,W10,D3,L2,V3,M2} { ! less( X, Y ), less( vplus( X, Z ), vplus(
% 0.64/1.12 Y, Z ) ) }.
% 0.64/1.12 (2746) {G0,W10,D3,L2,V3,M2} { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.64/1.12 (2747) {G0,W10,D3,L2,V3,M2} { ! greater( X, Y ), greater( vplus( X, Z ),
% 0.64/1.12 vplus( Y, Z ) ) }.
% 0.64/1.12 (2748) {G0,W5,D3,L1,V2,M1} { greater( vplus( X, Y ), X ) }.
% 0.64/1.12 (2749) {G0,W9,D2,L3,V3,M3} { ! leq( Z, Y ), ! leq( X, Z ), leq( X, Y ) }.
% 0.64/1.12 (2750) {G0,W9,D2,L3,V3,M3} { ! less( Z, Y ), ! leq( X, Z ), less( X, Y )
% 0.64/1.12 }.
% 0.64/1.12 (2751) {G0,W9,D2,L3,V3,M3} { ! leq( Z, Y ), ! less( X, Z ), less( X, Y )
% 0.64/1.12 }.
% 0.64/1.12 (2752) {G0,W9,D2,L3,V3,M3} { ! less( Z, Y ), ! less( X, Z ), less( X, Y )
% 0.64/1.12 }.
% 0.64/1.12 (2753) {G0,W6,D2,L2,V2,M2} { ! leq( X, Y ), geq( Y, X ) }.
% 0.64/1.12 (2754) {G0,W6,D2,L2,V2,M2} { ! geq( X, Y ), leq( Y, X ) }.
% 0.64/1.12 (2755) {G0,W9,D2,L3,V2,M3} { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.64/1.12 (2756) {G0,W6,D2,L2,V2,M2} { ! less( Y, X ), leq( Y, X ) }.
% 0.64/1.12 (2757) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( Y, X ) }.
% 0.64/1.12 (2758) {G0,W9,D2,L3,V2,M3} { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.64/1.12 (2759) {G0,W6,D2,L2,V2,M2} { ! greater( Y, X ), geq( Y, X ) }.
% 0.64/1.12 (2760) {G0,W6,D2,L2,V2,M2} { ! Y = X, geq( Y, X ) }.
% 0.64/1.12 (2761) {G0,W6,D2,L2,V2,M2} { ! less( X, Y ), greater( Y, X ) }.
% 0.64/1.12 (2762) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), less( Y, X ) }.
% 0.64/1.12 (2763) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.64/1.12 (2764) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! less( X, Y ) }.
% 0.64/1.12 (2765) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! less( X, Y ) }.
% 0.64/1.12 (2766) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.64/1.12 (2767) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y, skol1( X, Y )
% 0.64/1.12 ) }.
% 0.64/1.12 (2768) {G0,W8,D3,L2,V3,M2} { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.64/1.12 (2769) {G0,W10,D4,L2,V2,M2} { ! greater( Y, X ), Y = vplus( X, skol2( X, Y
% 0.64/1.12 ) ) }.
% 0.64/1.12 (2770) {G0,W8,D3,L2,V3,M2} { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.64/1.12 (2771) {G0,W17,D4,L3,V2,M3} { X = Y, X = vplus( Y, skol3( X, Y ) ), Y =
% 0.64/1.12 vplus( X, skol4( X, Y ) ) }.
% 0.64/1.12 (2772) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.64/1.12 (2773) {G0,W10,D3,L2,V4,M2} { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.64/1.12 (2774) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.64/1.12 (2775) {G0,W10,D3,L2,V3,M2} { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.64/1.12 (2776) {G0,W5,D3,L1,V2,M1} { ! Y = vplus( X, Y ) }.
% 0.64/1.12 (2777) {G0,W7,D3,L1,V2,M1} { vplus( Y, X ) = vplus( X, Y ) }.
% 0.64/1.12 (2778) {G0,W9,D4,L1,V2,M1} { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y )
% 0.64/1.12 ) }.
% 0.64/1.12 (2779) {G0,W6,D3,L1,V1,M1} { vplus( v1, X ) = vsucc( X ) }.
% 0.64/1.12 (2780) {G0,W11,D4,L1,V3,M1} { vplus( vplus( X, Y ), Z ) = vplus( X, vplus
% 0.64/1.12 ( Y, Z ) ) }.
% 0.64/1.12 (2781) {G0,W9,D4,L1,V2,M1} { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y )
% 0.64/1.12 ) }.
% 0.64/1.12 (2782) {G0,W6,D3,L1,V1,M1} { vplus( X, v1 ) = vsucc( X ) }.
% 0.64/1.12 (2783) {G0,W8,D4,L2,V1,M2} { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.64/1.12 (2784) {G0,W4,D3,L1,V1,M1} { ! vsucc( X ) = X }.
% 0.64/1.12 (2785) {G0,W8,D3,L2,V2,M2} { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.64/1.12 (2786) {G0,W8,D3,L2,V2,M2} { ! vsucc( X ) = vsucc( Y ), X = Y }.
% 0.64/1.12 (2787) {G0,W4,D3,L1,V1,M1} { ! vsucc( X ) = v1 }.
% 0.64/1.12
% 0.64/1.12
% 0.64/1.12 Total Proof:
% 0.64/1.12
% 0.64/1.12 subsumption: (0) {G0,W3,D2,L1,V0,M1} I { ! greater( vd328, vd329 ) }.
% 0.64/1.12 parent0: (2743) {G0,W3,D2,L1,V0,M1} { ! greater( vd328, vd329 ) }.
% 0.64/1.12 substitution0:
% 0.64/1.12 end
% 0.64/1.12 permutation0:
% 0.64/1.12 0 ==> 0
% 0.64/1.12 end
% 0.64/1.12
% 0.64/1.12 subsumption: (1) {G0,W7,D3,L1,V0,M1} I { greater( vplus( vd328, vd330 ),
% 0.64/1.12 vplus( vd329, vd330 ) ) }.
% 0.64/1.12 parent0: (2744) {G0,W7,D3,L1,V0,M1} { greater( vplus( vd328, vd330 ),
% 0.64/1.12 vplus( vd329, vd330 ) ) }.
% 0.64/1.12 substitution0:
% 0.64/1.12 end
% 0.64/1.12 permutation0:
% 0.64/1.12 0 ==> 0
% 0.64/1.12 end
% 0.64/1.12
% 0.64/1.12 subsumption: (2) {G0,W10,D3,L2,V3,M2} I { ! less( X, Y ), less( vplus( X, Z
% 0.64/1.12 ), vplus( Y, Z ) ) }.
% 0.64/1.12 parent0: (2745) {G0,W10,D3,L2,V3,M2} { ! less( X, Y ), less( vplus( X, Z )
% 0.64/1.12 , vplus( Y, Z ) ) }.
% 0.64/1.12 substitution0:
% 0.64/1.12 X := X
% 0.64/1.12 Y := Y
% 0.64/1.12 Z := Z
% 0.64/1.12 end
% 0.64/1.12 permutation0:
% 0.64/1.12 0 ==> 0
% 0.64/1.12 1 ==> 1
% 0.64/1.12 end
% 0.64/1.12
% 0.64/1.12 subsumption: (12) {G0,W9,D2,L3,V2,M3} I { ! leq( Y, X ), less( Y, X ), Y =
% 0.64/1.12 X }.
% 0.64/1.12 parent0: (2755) {G0,W9,D2,L3,V2,M3} { ! leq( Y, X ), less( Y, X ), Y = X
% 0.64/1.12 }.
% 0.64/1.12 substitution0:
% 0.64/1.12 X := X
% 0.64/1.12 Y := Y
% 0.64/1.12 end
% 0.64/1.12 permutation0:
% 0.64/1.12 0 ==> 0
% 0.64/1.12 1 ==> 1
% 0.64/1.12 2 ==> 2
% 0.64/1.12 end
% 0.64/1.12
% 0.64/1.12 subsumption: (14) {G0,W6,D2,L2,V2,M2} I { ! Y = X, leq( Y, X ) }.
% 0.64/1.12 parent0: (2757) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( Y, X ) }.
% 0.64/1.12 substitution0:
% 0.64/1.12 X := X
% 0.64/1.12 Y := Y
% 0.64/1.12 end
% 0.64/1.12 permutation0:
% 0.64/1.12 0 ==> 0
% 0.64/1.12 1 ==> 1
% 0.64/1.12 end
% 0.64/1.12
% 0.64/1.12 subsumption: (20) {G0,W9,D2,L3,V2,M3} I { X = Y, greater( X, Y ), less( X,
% 0.64/1.12 Y ) }.
% 0.64/1.12 parent0: (2763) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y )
% 0.64/1.12 }.
% 0.64/1.12 substitution0:
% 0.64/1.12 X := X
% 0.64/1.12 Y := Y
% 0.64/1.12 end
% 0.64/1.12 permutation0:
% 0.64/1.12 0 ==> 0
% 0.64/1.12 1 ==> 1
% 0.64/1.12 2 ==> 2
% 0.64/1.12 end
% 0.64/1.12
% 0.64/1.12 subsumption: (22) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), ! less( X, Y )
% 0.64/1.12 }.
% 0.64/1.12 parent0: (2765) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! less( X, Y )
% 0.64/1.12 }.
% 0.64/1.12 substitution0:
% 0.64/1.12 X := X
% 0.64/1.12 Y := Y
% 0.64/1.12 end
% 0.64/1.12 permutation0:
% 0.64/1.12 0 ==> 0
% 0.64/1.12 1 ==> 1
% 0.64/1.12 end
% 0.64/1.12
% 0.64/1.12 subsumption: (23) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! greater( X, Y ) }.
% 0.64/1.12 parent0: (2766) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.64/1.12 substitution0:
% 0.64/1.12 X := X
% 0.64/1.12 Y := Y
% 0.64/1.12 end
% 0.64/1.12 permutation0:
% 0.64/1.12 0 ==> 0
% 0.64/1.12 1 ==> 1
% 0.64/1.12 end
% 0.64/1.12
% 0.64/1.12 eqswap: (2824) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( X, Y ) }.
% 0.64/1.12 parent0[0]: (14) {G0,W6,D2,L2,V2,M2} I { ! Y = X, leq( Y, X ) }.
% 0.64/1.13 substitution0:
% 0.64/1.13 X := Y
% 0.64/1.13 Y := X
% 0.64/1.13 end
% 0.64/1.13
% 0.64/1.13 eqrefl: (2825) {G0,W3,D2,L1,V1,M1} { leq( X, X ) }.
% 0.64/1.13 parent0[0]: (2824) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( X, Y ) }.
% 0.64/1.13 substitution0:
% 0.64/1.13 X := X
% 0.64/1.13 Y := X
% 0.64/1.13 end
% 0.64/1.13
% 0.64/1.13 subsumption: (43) {G1,W3,D2,L1,V1,M1} Q(14) { leq( X, X ) }.
% 0.64/1.13 parent0: (2825) {G0,W3,D2,L1,V1,M1} { leq( X, X ) }.
% 0.64/1.13 substitution0:
% 0.64/1.13 X := X
% 0.64/1.13 end
% 0.64/1.13 permutation0:
% 0.64/1.13 0 ==> 0
% 0.64/1.13 end
% 0.64/1.13
% 0.64/1.13 eqswap: (2826) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! greater( X, Y ) }.
% 0.64/1.13 parent0[0]: (23) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! greater( X, Y ) }.
% 0.64/1.13 substitution0:
% 0.64/1.13 X := X
% 0.64/1.13 Y := Y
% 0.64/1.13 end
% 0.64/1.13
% 0.64/1.13 resolution: (2827) {G1,W7,D3,L1,V0,M1} { ! vplus( vd329, vd330 ) = vplus(
% 0.64/1.13 vd328, vd330 ) }.
% 0.64/1.13 parent0[1]: (2826) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! greater( X, Y ) }.
% 0.64/1.13 parent1[0]: (1) {G0,W7,D3,L1,V0,M1} I { greater( vplus( vd328, vd330 ),
% 0.64/1.13 vplus( vd329, vd330 ) ) }.
% 0.64/1.13 substitution0:
% 0.64/1.13 X := vplus( vd328, vd330 )
% 0.64/1.13 Y := vplus( vd329, vd330 )
% 0.64/1.13 end
% 0.64/1.13 substitution1:
% 0.64/1.13 end
% 0.64/1.13
% 0.64/1.13 subsumption: (52) {G1,W7,D3,L1,V0,M1} R(23,1) { ! vplus( vd329, vd330 Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------