TSTP Solution File: NUM839+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM839+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:56 EDT 2022
% Result : Theorem 0.72s 1.21s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM839+2 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n026.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 10:14:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.21 *** allocated 10000 integers for termspace/termends
% 0.72/1.21 *** allocated 10000 integers for clauses
% 0.72/1.21 *** allocated 10000 integers for justifications
% 0.72/1.21 Bliksem 1.12
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 Automatic Strategy Selection
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 Clauses:
% 0.72/1.21
% 0.72/1.21 { ! greater( vd328, vd329 ) }.
% 0.72/1.21 { greater( vplus( vd328, vd330 ), vplus( vd329, vd330 ) ) }.
% 0.72/1.21 { ! less( X, Y ), less( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.72/1.21 { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.72/1.21 { ! greater( X, Y ), greater( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.72/1.21 { greater( vplus( X, Y ), X ) }.
% 0.72/1.21 { ! leq( Z, Y ), ! leq( X, Z ), leq( X, Y ) }.
% 0.72/1.21 { ! less( Z, Y ), ! leq( X, Z ), less( X, Y ) }.
% 0.72/1.21 { ! leq( Z, Y ), ! less( X, Z ), less( X, Y ) }.
% 0.72/1.21 { ! less( Z, Y ), ! less( X, Z ), less( X, Y ) }.
% 0.72/1.21 { ! leq( X, Y ), geq( Y, X ) }.
% 0.72/1.21 { ! geq( X, Y ), leq( Y, X ) }.
% 0.72/1.21 { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.72/1.21 { ! less( Y, X ), leq( Y, X ) }.
% 0.72/1.21 { ! Y = X, leq( Y, X ) }.
% 0.72/1.21 { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.72/1.21 { ! greater( Y, X ), geq( Y, X ) }.
% 0.72/1.21 { ! Y = X, geq( Y, X ) }.
% 0.72/1.21 { ! less( X, Y ), greater( Y, X ) }.
% 0.72/1.21 { ! greater( X, Y ), less( Y, X ) }.
% 0.72/1.21 { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.72/1.21 { ! X = Y, ! less( X, Y ) }.
% 0.72/1.21 { ! greater( X, Y ), ! less( X, Y ) }.
% 0.72/1.21 { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.21 { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) ) }.
% 0.72/1.21 { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.72/1.21 { ! greater( Y, X ), Y = vplus( X, skol2( X, Y ) ) }.
% 0.72/1.21 { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.72/1.21 { X = Y, X = vplus( Y, skol3( X, Y ) ), Y = vplus( X, skol4( X, Y ) ) }.
% 0.72/1.21 { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.72/1.21 { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.72/1.21 { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.72/1.21 { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.72/1.21 { ! Y = vplus( X, Y ) }.
% 0.72/1.21 { vplus( Y, X ) = vplus( X, Y ) }.
% 0.72/1.21 { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y ) ) }.
% 0.72/1.21 { vplus( v1, X ) = vsucc( X ) }.
% 0.72/1.21 { vplus( vplus( X, Y ), Z ) = vplus( X, vplus( Y, Z ) ) }.
% 0.72/1.21 { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y ) ) }.
% 0.72/1.21 { vplus( X, v1 ) = vsucc( X ) }.
% 0.72/1.21 { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.72/1.21 { ! vsucc( X ) = X }.
% 0.72/1.21 { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.72/1.21
% 0.72/1.21 percentage equality = 0.433735, percentage horn = 0.883721
% 0.72/1.21 This is a problem with some equality
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 Options Used:
% 0.72/1.21
% 0.72/1.21 useres = 1
% 0.72/1.21 useparamod = 1
% 0.72/1.21 useeqrefl = 1
% 0.72/1.21 useeqfact = 1
% 0.72/1.21 usefactor = 1
% 0.72/1.21 usesimpsplitting = 0
% 0.72/1.21 usesimpdemod = 5
% 0.72/1.21 usesimpres = 3
% 0.72/1.21
% 0.72/1.21 resimpinuse = 1000
% 0.72/1.21 resimpclauses = 20000
% 0.72/1.21 substype = eqrewr
% 0.72/1.21 backwardsubs = 1
% 0.72/1.21 selectoldest = 5
% 0.72/1.21
% 0.72/1.21 litorderings [0] = split
% 0.72/1.21 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.21
% 0.72/1.21 termordering = kbo
% 0.72/1.21
% 0.72/1.21 litapriori = 0
% 0.72/1.21 termapriori = 1
% 0.72/1.21 litaposteriori = 0
% 0.72/1.21 termaposteriori = 0
% 0.72/1.21 demodaposteriori = 0
% 0.72/1.21 ordereqreflfact = 0
% 0.72/1.21
% 0.72/1.21 litselect = negord
% 0.72/1.21
% 0.72/1.21 maxweight = 15
% 0.72/1.21 maxdepth = 30000
% 0.72/1.21 maxlength = 115
% 0.72/1.21 maxnrvars = 195
% 0.72/1.21 excuselevel = 1
% 0.72/1.21 increasemaxweight = 1
% 0.72/1.21
% 0.72/1.21 maxselected = 10000000
% 0.72/1.21 maxnrclauses = 10000000
% 0.72/1.21
% 0.72/1.21 showgenerated = 0
% 0.72/1.21 showkept = 0
% 0.72/1.21 showselected = 0
% 0.72/1.21 showdeleted = 0
% 0.72/1.21 showresimp = 1
% 0.72/1.21 showstatus = 2000
% 0.72/1.21
% 0.72/1.21 prologoutput = 0
% 0.72/1.21 nrgoals = 5000000
% 0.72/1.21 totalproof = 1
% 0.72/1.21
% 0.72/1.21 Symbols occurring in the translation:
% 0.72/1.21
% 0.72/1.21 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.21 . [1, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.72/1.21 ! [4, 1] (w:0, o:67, a:1, s:1, b:0),
% 0.72/1.21 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.21 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.21 vd328 [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.72/1.21 vd329 [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.72/1.21 greater [37, 2] (w:1, o:98, a:1, s:1, b:0),
% 0.72/1.21 vd330 [38, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.72/1.21 vplus [39, 2] (w:1, o:99, a:1, s:1, b:0),
% 0.72/1.21 less [43, 2] (w:1, o:100, a:1, s:1, b:0),
% 0.72/1.21 leq [49, 2] (w:1, o:101, a:1, s:1, b:0),
% 0.72/1.21 geq [58, 2] (w:1, o:102, a:1, s:1, b:0),
% 0.72/1.21 vsucc [90, 1] (w:1, o:72, a:1, s:1, b:0),
% 0.72/1.21 v1 [92, 0] (w:1, o:66, a:1, s:1, b:0),
% 0.72/1.21 vskolem2 [99, 1] (w:1, o:73, a:1, s:1, b:0),
% 0.72/1.21 skol1 [103, 2] (w:1, o:103, a:1, s:1, b:1),
% 0.72/1.21 skol2 [104, 2] (w:1, o:104, a:1, s:1, b:1),
% 0.72/1.21 skol3 [105, 2] (w:1, o:105, a:1, s:1, b:1),
% 0.72/1.21 skol4 [106, 2] (w:1, o:106, a:1, s:1, b:1).
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 Starting Search:
% 0.72/1.21
% 0.72/1.21 *** allocated 15000 integers for clauses
% 0.72/1.21 *** allocated 22500 integers for clauses
% 0.72/1.21 *** allocated 33750 integers for clauses
% 0.72/1.21 *** allocated 50625 integers for clauses
% 0.72/1.21 *** allocated 15000 integers for termspace/termends
% 0.72/1.21 Resimplifying inuse:
% 0.72/1.21 Done
% 0.72/1.21
% 0.72/1.21 *** allocated 75937 integers for clauses
% 0.72/1.21 *** allocated 22500 integers for termspace/termends
% 0.72/1.21 *** allocated 113905 integers for clauses
% 0.72/1.21 *** allocated 33750 integers for termspace/termends
% 0.72/1.21
% 0.72/1.21 Intermediate Status:
% 0.72/1.21 Generated: 5033
% 0.72/1.21 Kept: 2060
% 0.72/1.21 Inuse: 131
% 0.72/1.21 Deleted: 0
% 0.72/1.21 Deletedinuse: 0
% 0.72/1.21
% 0.72/1.21 Resimplifying inuse:
% 0.72/1.21 Done
% 0.72/1.21
% 0.72/1.21 *** allocated 170857 integers for clauses
% 0.72/1.21 *** allocated 50625 integers for termspace/termends
% 0.72/1.21
% 0.72/1.21 Bliksems!, er is een bewijs:
% 0.72/1.21 % SZS status Theorem
% 0.72/1.21 % SZS output start Refutation
% 0.72/1.21
% 0.72/1.21 (0) {G0,W3,D2,L1,V0,M1} I { ! greater( vd328, vd329 ) }.
% 0.72/1.21 (1) {G0,W7,D3,L1,V0,M1} I { greater( vplus( vd328, vd330 ), vplus( vd329,
% 0.72/1.21 vd330 ) ) }.
% 0.72/1.21 (2) {G0,W10,D3,L2,V3,M2} I { ! less( X, Y ), less( vplus( X, Z ), vplus( Y
% 0.72/1.21 , Z ) ) }.
% 0.72/1.21 (12) {G0,W9,D2,L3,V2,M3} I { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.72/1.21 (14) {G0,W6,D2,L2,V2,M2} I { ! Y = X, leq( Y, X ) }.
% 0.72/1.21 (20) {G0,W9,D2,L3,V2,M3} I { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.72/1.21 (22) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), ! less( X, Y ) }.
% 0.72/1.21 (23) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.21 (42) {G1,W3,D2,L1,V1,M1} Q(14) { leq( X, X ) }.
% 0.72/1.21 (51) {G1,W7,D3,L1,V0,M1} R(23,1) { ! vplus( vd329, vd330 ) ==> vplus( vd328
% 0.72/1.21 , vd330 ) }.
% 0.72/1.21 (53) {G1,W10,D3,L2,V3,M2} R(22,2) { ! greater( vplus( X, Y ), vplus( Z, Y )
% 0.72/1.21 ), ! less( X, Z ) }.
% 0.72/1.21 (427) {G1,W6,D2,L2,V0,M2} R(20,0) { vd329 ==> vd328, less( vd328, vd329 )
% 0.72/1.21 }.
% 0.72/1.21 (2645) {G2,W13,D3,L3,V1,M3} P(12,51) { ! vplus( X, vd330 ) = vplus( vd328,
% 0.72/1.21 vd330 ), ! leq( X, vd329 ), less( X, vd329 ) }.
% 0.72/1.21 (2650) {G3,W3,D2,L1,V0,M1} Q(2645);d(427);r(42) { less( vd328, vd329 ) }.
% 0.72/1.21 (2720) {G4,W0,D0,L0,V0,M0} R(53,1);r(2650) { }.
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 % SZS output end Refutation
% 0.72/1.21 found a proof!
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 Unprocessed initial clauses:
% 0.72/1.21
% 0.72/1.21 (2722) {G0,W3,D2,L1,V0,M1} { ! greater( vd328, vd329 ) }.
% 0.72/1.21 (2723) {G0,W7,D3,L1,V0,M1} { greater( vplus( vd328, vd330 ), vplus( vd329
% 0.72/1.21 , vd330 ) ) }.
% 0.72/1.21 (2724) {G0,W10,D3,L2,V3,M2} { ! less( X, Y ), less( vplus( X, Z ), vplus(
% 0.72/1.21 Y, Z ) ) }.
% 0.72/1.21 (2725) {G0,W10,D3,L2,V3,M2} { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.72/1.21 (2726) {G0,W10,D3,L2,V3,M2} { ! greater( X, Y ), greater( vplus( X, Z ),
% 0.72/1.21 vplus( Y, Z ) ) }.
% 0.72/1.21 (2727) {G0,W5,D3,L1,V2,M1} { greater( vplus( X, Y ), X ) }.
% 0.72/1.21 (2728) {G0,W9,D2,L3,V3,M3} { ! leq( Z, Y ), ! leq( X, Z ), leq( X, Y ) }.
% 0.72/1.21 (2729) {G0,W9,D2,L3,V3,M3} { ! less( Z, Y ), ! leq( X, Z ), less( X, Y )
% 0.72/1.21 }.
% 0.72/1.21 (2730) {G0,W9,D2,L3,V3,M3} { ! leq( Z, Y ), ! less( X, Z ), less( X, Y )
% 0.72/1.21 }.
% 0.72/1.21 (2731) {G0,W9,D2,L3,V3,M3} { ! less( Z, Y ), ! less( X, Z ), less( X, Y )
% 0.72/1.21 }.
% 0.72/1.21 (2732) {G0,W6,D2,L2,V2,M2} { ! leq( X, Y ), geq( Y, X ) }.
% 0.72/1.21 (2733) {G0,W6,D2,L2,V2,M2} { ! geq( X, Y ), leq( Y, X ) }.
% 0.72/1.21 (2734) {G0,W9,D2,L3,V2,M3} { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.72/1.21 (2735) {G0,W6,D2,L2,V2,M2} { ! less( Y, X ), leq( Y, X ) }.
% 0.72/1.21 (2736) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( Y, X ) }.
% 0.72/1.21 (2737) {G0,W9,D2,L3,V2,M3} { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.72/1.21 (2738) {G0,W6,D2,L2,V2,M2} { ! greater( Y, X ), geq( Y, X ) }.
% 0.72/1.21 (2739) {G0,W6,D2,L2,V2,M2} { ! Y = X, geq( Y, X ) }.
% 0.72/1.21 (2740) {G0,W6,D2,L2,V2,M2} { ! less( X, Y ), greater( Y, X ) }.
% 0.72/1.21 (2741) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), less( Y, X ) }.
% 0.72/1.21 (2742) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.72/1.21 (2743) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! less( X, Y ) }.
% 0.72/1.21 (2744) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! less( X, Y ) }.
% 0.72/1.21 (2745) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.21 (2746) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y, skol1( X, Y )
% 0.72/1.21 ) }.
% 0.72/1.21 (2747) {G0,W8,D3,L2,V3,M2} { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.72/1.21 (2748) {G0,W10,D4,L2,V2,M2} { ! greater( Y, X ), Y = vplus( X, skol2( X, Y
% 0.72/1.21 ) ) }.
% 0.72/1.21 (2749) {G0,W8,D3,L2,V3,M2} { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.72/1.21 (2750) {G0,W17,D4,L3,V2,M3} { X = Y, X = vplus( Y, skol3( X, Y ) ), Y =
% 0.72/1.21 vplus( X, skol4( X, Y ) ) }.
% 0.72/1.21 (2751) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.72/1.21 (2752) {G0,W10,D3,L2,V4,M2} { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.72/1.21 (2753) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.72/1.21 (2754) {G0,W10,D3,L2,V3,M2} { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.72/1.21 (2755) {G0,W5,D3,L1,V2,M1} { ! Y = vplus( X, Y ) }.
% 0.72/1.21 (2756) {G0,W7,D3,L1,V2,M1} { vplus( Y, X ) = vplus( X, Y ) }.
% 0.72/1.21 (2757) {G0,W9,D4,L1,V2,M1} { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y )
% 0.72/1.21 ) }.
% 0.72/1.21 (2758) {G0,W6,D3,L1,V1,M1} { vplus( v1, X ) = vsucc( X ) }.
% 0.72/1.21 (2759) {G0,W11,D4,L1,V3,M1} { vplus( vplus( X, Y ), Z ) = vplus( X, vplus
% 0.72/1.21 ( Y, Z ) ) }.
% 0.72/1.21 (2760) {G0,W9,D4,L1,V2,M1} { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y )
% 0.72/1.21 ) }.
% 0.72/1.21 (2761) {G0,W6,D3,L1,V1,M1} { vplus( X, v1 ) = vsucc( X ) }.
% 0.72/1.21 (2762) {G0,W8,D4,L2,V1,M2} { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.72/1.21 (2763) {G0,W4,D3,L1,V1,M1} { ! vsucc( X ) = X }.
% 0.72/1.21 (2764) {G0,W8,D3,L2,V2,M2} { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 Total Proof:
% 0.72/1.21
% 0.72/1.21 subsumption: (0) {G0,W3,D2,L1,V0,M1} I { ! greater( vd328, vd329 ) }.
% 0.72/1.21 parent0: (2722) {G0,W3,D2,L1,V0,M1} { ! greater( vd328, vd329 ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 subsumption: (1) {G0,W7,D3,L1,V0,M1} I { greater( vplus( vd328, vd330 ),
% 0.72/1.21 vplus( vd329, vd330 ) ) }.
% 0.72/1.21 parent0: (2723) {G0,W7,D3,L1,V0,M1} { greater( vplus( vd328, vd330 ),
% 0.72/1.21 vplus( vd329, vd330 ) ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 subsumption: (2) {G0,W10,D3,L2,V3,M2} I { ! less( X, Y ), less( vplus( X, Z
% 0.72/1.21 ), vplus( Y, Z ) ) }.
% 0.72/1.21 parent0: (2724) {G0,W10,D3,L2,V3,M2} { ! less( X, Y ), less( vplus( X, Z )
% 0.72/1.21 , vplus( Y, Z ) ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := X
% 0.72/1.21 Y := Y
% 0.72/1.21 Z := Z
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 1 ==> 1
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 subsumption: (12) {G0,W9,D2,L3,V2,M3} I { ! leq( Y, X ), less( Y, X ), Y =
% 0.72/1.21 X }.
% 0.72/1.21 parent0: (2734) {G0,W9,D2,L3,V2,M3} { ! leq( Y, X ), less( Y, X ), Y = X
% 0.72/1.21 }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := X
% 0.72/1.21 Y := Y
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 1 ==> 1
% 0.72/1.21 2 ==> 2
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 subsumption: (14) {G0,W6,D2,L2,V2,M2} I { ! Y = X, leq( Y, X ) }.
% 0.72/1.21 parent0: (2736) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( Y, X ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := X
% 0.72/1.21 Y := Y
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 1 ==> 1
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 subsumption: (20) {G0,W9,D2,L3,V2,M3} I { X = Y, greater( X, Y ), less( X,
% 0.72/1.21 Y ) }.
% 0.72/1.21 parent0: (2742) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y )
% 0.72/1.21 }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := X
% 0.72/1.21 Y := Y
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 1 ==> 1
% 0.72/1.21 2 ==> 2
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 subsumption: (22) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), ! less( X, Y )
% 0.72/1.21 }.
% 0.72/1.21 parent0: (2744) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! less( X, Y )
% 0.72/1.21 }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := X
% 0.72/1.21 Y := Y
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 1 ==> 1
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 subsumption: (23) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.21 parent0: (2745) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := X
% 0.72/1.21 Y := Y
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 1 ==> 1
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 eqswap: (2801) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( X, Y ) }.
% 0.72/1.21 parent0[0]: (14) {G0,W6,D2,L2,V2,M2} I { ! Y = X, leq( Y, X ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := Y
% 0.72/1.21 Y := X
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 eqrefl: (2802) {G0,W3,D2,L1,V1,M1} { leq( X, X ) }.
% 0.72/1.21 parent0[0]: (2801) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( X, Y ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := X
% 0.72/1.21 Y := X
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 subsumption: (42) {G1,W3,D2,L1,V1,M1} Q(14) { leq( X, X ) }.
% 0.72/1.21 parent0: (2802) {G0,W3,D2,L1,V1,M1} { leq( X, X ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := X
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 eqswap: (2803) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! greater( X, Y ) }.
% 0.72/1.21 parent0[0]: (23) {G0,W6,D2,L2,V2,M2} I { ! X = Y, ! greater( X, Y ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := X
% 0.72/1.21 Y := Y
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 resolution: (2804) {G1,W7,D3,L1,V0,M1} { ! vplus( vd329, vd330 ) = vplus(
% 0.72/1.21 vd328, vd330 ) }.
% 0.72/1.21 parent0[1]: (2803) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! greater( X, Y ) }.
% 0.72/1.21 parent1[0]: (1) {G0,W7,D3,L1,V0,M1} I { greater( vplus( vd328, vd330 ),
% 0.72/1.21 vplus( vd329, vd330 ) ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 X := vplus( vd328, vd330 )
% 0.72/1.21 Y := vplus( vd329, vd330 )
% 0.72/1.21 end
% 0.72/1.21 substitution1:
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 subsumption: (51) {G1,W7,D3,L1,V0,M1} R(23,1) { ! vplus( vd329, vd330 ) ==>
% 0.72/1.21 vplus( vd328, vd330 ) }.
% 0.72/1.21 parent0: (2804) {G1,W7,D3,L1,V0,M1} { ! vplus( vd329, vd330 ) = vplus(
% 0.72/1.21 vd328, vd330 ) }.
% 0.72/1.21 substitution0:
% 0.72/1.21 end
% 0.72/1.21 permutation0:
% 0.72/1.21 0 ==> 0
% 0.72/1.21 end
% 0.72/1.21
% 0.72/1.21 resoCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------