TSTP Solution File: NUM850+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM850+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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:27:03 EDT 2022
% Result : Theorem 0.70s 1.14s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM850+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n019.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 : Tue Jul 5 13:12:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.14 *** allocated 10000 integers for termspace/termends
% 0.70/1.14 *** allocated 10000 integers for clauses
% 0.70/1.14 *** allocated 10000 integers for justifications
% 0.70/1.14 Bliksem 1.12
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Automatic Strategy Selection
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Clauses:
% 0.70/1.14
% 0.70/1.14 { ! vd470 = vplus( vd471, X ) }.
% 0.70/1.14 { greater( vd470, vd471 ) }.
% 0.70/1.14 { vmul( vmul( X, Y ), Z ) = vmul( X, vmul( Y, Z ) ) }.
% 0.70/1.14 { vmul( X, vplus( Y, Z ) ) = vplus( vmul( X, Y ), vmul( X, Z ) ) }.
% 0.70/1.14 { vmul( X, Y ) = vmul( Y, X ) }.
% 0.70/1.14 { vmul( vsucc( X ), Y ) = vplus( vmul( X, Y ), Y ) }.
% 0.70/1.14 { vmul( v1, X ) = X }.
% 0.70/1.14 { vmul( X, vsucc( Y ) ) = vplus( vmul( X, Y ), X ) }.
% 0.70/1.14 { vmul( X, v1 ) = X }.
% 0.70/1.14 { ! less( X, vplus( Y, v1 ) ), leq( X, Y ) }.
% 0.70/1.14 { ! greater( X, Y ), geq( X, vplus( Y, v1 ) ) }.
% 0.70/1.14 { geq( X, v1 ) }.
% 0.70/1.14 { ! geq( Z, T ), ! geq( X, Y ), geq( vplus( X, Z ), vplus( Y, T ) ) }.
% 0.70/1.14 { ! greater( Z, T ), ! geq( X, Y ), greater( vplus( X, Z ), vplus( Y, T ) )
% 0.70/1.14 }.
% 0.70/1.14 { ! geq( Z, T ), ! greater( X, Y ), greater( vplus( X, Z ), vplus( Y, T ) )
% 0.70/1.14 }.
% 0.70/1.14 { ! greater( Z, T ), ! greater( X, Y ), greater( vplus( X, Z ), vplus( Y, T
% 0.70/1.14 ) ) }.
% 0.70/1.14 { ! less( vplus( X, Z ), vplus( Y, Z ) ), less( X, Y ) }.
% 0.70/1.14 { ! vplus( X, Z ) = vplus( Y, Z ), X = Y }.
% 0.70/1.14 { ! greater( vplus( X, Z ), vplus( Y, Z ) ), greater( X, Y ) }.
% 0.70/1.14 { ! less( X, Y ), less( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.70/1.14 { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.70/1.14 { ! greater( X, Y ), greater( vplus( X, Z ), vplus( Y, Z ) ) }.
% 0.70/1.14 { greater( vplus( X, Y ), X ) }.
% 0.70/1.14 { ! leq( Z, Y ), ! leq( X, Z ), leq( X, Y ) }.
% 0.70/1.14 { ! less( Z, Y ), ! leq( X, Z ), less( X, Y ) }.
% 0.70/1.14 { ! leq( Z, Y ), ! less( X, Z ), less( X, Y ) }.
% 0.70/1.14 { ! less( Z, Y ), ! less( X, Z ), less( X, Y ) }.
% 0.70/1.14 { ! leq( X, Y ), geq( Y, X ) }.
% 0.70/1.14 { ! geq( X, Y ), leq( Y, X ) }.
% 0.70/1.14 { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.70/1.14 { ! less( Y, X ), leq( Y, X ) }.
% 0.70/1.14 { ! Y = X, leq( Y, X ) }.
% 0.70/1.14 { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.70/1.14 { ! greater( Y, X ), geq( Y, X ) }.
% 0.70/1.14 { ! Y = X, geq( Y, X ) }.
% 0.70/1.14 { ! less( X, Y ), greater( Y, X ) }.
% 0.70/1.14 { ! greater( X, Y ), less( Y, X ) }.
% 0.70/1.14 { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.70/1.14 { ! X = Y, ! less( X, Y ) }.
% 0.70/1.14 { ! greater( X, Y ), ! less( X, Y ) }.
% 0.70/1.14 { ! X = Y, ! greater( X, Y ) }.
% 0.70/1.14 { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) ) }.
% 0.70/1.14 { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.70/1.14 { ! greater( Y, X ), Y = vplus( X, skol2( X, Y ) ) }.
% 0.70/1.14 { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.70/1.14 { X = Y, X = vplus( Y, skol3( X, Y ) ), Y = vplus( X, skol4( X, Y ) ) }.
% 0.70/1.14 { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.70/1.14 { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.70/1.14 { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.70/1.14 { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.70/1.14 { ! Y = vplus( X, Y ) }.
% 0.70/1.14 { vplus( Y, X ) = vplus( X, Y ) }.
% 0.70/1.14 { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y ) ) }.
% 0.70/1.14 { vplus( v1, X ) = vsucc( X ) }.
% 0.70/1.14 { vplus( vplus( X, Y ), Z ) = vplus( X, vplus( Y, Z ) ) }.
% 0.70/1.14 { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y ) ) }.
% 0.70/1.14 { vplus( X, v1 ) = vsucc( X ) }.
% 0.70/1.14 { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.70/1.14 { ! vsucc( X ) = X }.
% 0.70/1.14 { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.70/1.14 { ! vsucc( X ) = vsucc( Y ), X = Y }.
% 0.70/1.14 { ! vsucc( X ) = v1 }.
% 0.70/1.14
% 0.70/1.14 percentage equality = 0.412281, percentage horn = 0.918033
% 0.70/1.14 This is a problem with some equality
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Options Used:
% 0.70/1.14
% 0.70/1.14 useres = 1
% 0.70/1.14 useparamod = 1
% 0.70/1.14 useeqrefl = 1
% 0.70/1.14 useeqfact = 1
% 0.70/1.14 usefactor = 1
% 0.70/1.14 usesimpsplitting = 0
% 0.70/1.14 usesimpdemod = 5
% 0.70/1.14 usesimpres = 3
% 0.70/1.14
% 0.70/1.14 resimpinuse = 1000
% 0.70/1.14 resimpclauses = 20000
% 0.70/1.14 substype = eqrewr
% 0.70/1.14 backwardsubs = 1
% 0.70/1.14 selectoldest = 5
% 0.70/1.14
% 0.70/1.14 litorderings [0] = split
% 0.70/1.14 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.14
% 0.70/1.14 termordering = kbo
% 0.70/1.14
% 0.70/1.14 litapriori = 0
% 0.70/1.14 termapriori = 1
% 0.70/1.14 litaposteriori = 0
% 0.70/1.14 termaposteriori = 0
% 0.70/1.14 demodaposteriori = 0
% 0.70/1.14 ordereqreflfact = 0
% 0.70/1.14
% 0.70/1.14 litselect = negord
% 0.70/1.14
% 0.70/1.14 maxweight = 15
% 0.70/1.14 maxdepth = 30000
% 0.70/1.14 maxlength = 115
% 0.70/1.14 maxnrvars = 195
% 0.70/1.14 excuselevel = 1
% 0.70/1.14 increasemaxweight = 1
% 0.70/1.14
% 0.70/1.14 maxselected = 10000000
% 0.70/1.14 maxnrclauses = 10000000
% 0.70/1.14
% 0.70/1.14 showgenerated = 0
% 0.70/1.14 showkept = 0
% 0.70/1.14 showselected = 0
% 0.70/1.14 showdeleted = 0
% 0.70/1.14 showresimp = 1
% 0.70/1.14 showstatus = 2000
% 0.70/1.14
% 0.70/1.14 prologoutput = 0
% 0.70/1.14 nrgoals = 5000000
% 0.70/1.14 totalproof = 1
% 0.70/1.14
% 0.70/1.14 Symbols occurring in the translation:
% 0.70/1.14
% 0.70/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.14 . [1, 2] (w:1, o:110, a:1, s:1, b:0),
% 0.70/1.14 ! [4, 1] (w:0, o:103, a:1, s:1, b:0),
% 0.70/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.14 vd470 [36, 0] (w:1, o:75, a:1, s:1, b:0),
% 0.70/1.14 vd471 [37, 0] (w:1, o:76, a:1, s:1, b:0),
% 0.70/1.14 vplus [38, 2] (w:1, o:134, a:1, s:1, b:0),
% 0.70/1.14 greater [39, 2] (w:1, o:135, a:1, s:1, b:0),
% 0.70/1.14 vmul [43, 2] (w:1, o:136, a:1, s:1, b:0),
% 0.70/1.14 vsucc [51, 1] (w:1, o:108, a:1, s:1, b:0),
% 0.70/1.14 v1 [53, 0] (w:1, o:90, a:1, s:1, b:0),
% 0.70/1.14 less [58, 2] (w:1, o:137, a:1, s:1, b:0),
% 0.70/1.14 leq [59, 2] (w:1, o:138, a:1, s:1, b:0),
% 0.70/1.14 geq [62, 2] (w:1, o:139, a:1, s:1, b:0),
% 0.70/1.14 vskolem2 [133, 1] (w:1, o:109, a:1, s:1, b:0),
% 0.70/1.14 skol1 [140, 2] (w:1, o:140, a:1, s:1, b:1),
% 0.70/1.14 skol2 [141, 2] (w:1, o:141, a:1, s:1, b:1),
% 0.70/1.14 skol3 [142, 2] (w:1, o:142, a:1, s:1, b:1),
% 0.70/1.14 skol4 [143, 2] (w:1, o:143, a:1, s:1, b:1).
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Starting Search:
% 0.70/1.14
% 0.70/1.14 *** allocated 15000 integers for clauses
% 0.70/1.14 *** allocated 22500 integers for clauses
% 0.70/1.14 *** allocated 33750 integers for clauses
% 0.70/1.14 *** allocated 50625 integers for clauses
% 0.70/1.14 *** allocated 15000 integers for termspace/termends
% 0.70/1.14 *** allocated 75937 integers for clauses
% 0.70/1.14 Resimplifying inuse:
% 0.70/1.14 Done
% 0.70/1.14
% 0.70/1.14 *** allocated 22500 integers for termspace/termends
% 0.70/1.14 *** allocated 113905 integers for clauses
% 0.70/1.14
% 0.70/1.14 Bliksems!, er is een bewijs:
% 0.70/1.14 % SZS status Theorem
% 0.70/1.14 % SZS output start Refutation
% 0.70/1.14
% 0.70/1.14 (0) {G0,W5,D3,L1,V1,M1} I { ! vplus( vd471, X ) ==> vd470 }.
% 0.70/1.14 (1) {G0,W3,D2,L1,V0,M1} I { greater( vd470, vd471 ) }.
% 0.70/1.14 (36) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), less( Y, X ) }.
% 0.70/1.14 (41) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1( X, Y ) ) ==>
% 0.70/1.14 X }.
% 0.70/1.14 (99) {G1,W3,D2,L1,V0,M1} R(36,1) { less( vd471, vd470 ) }.
% 0.70/1.14 (1637) {G2,W0,D0,L0,V0,M0} R(41,99);r(0) { }.
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 % SZS output end Refutation
% 0.70/1.14 found a proof!
% 0.70/1.14
% 0.70/1.14 *** allocated 33750 integers for termspace/termends
% 0.70/1.14
% 0.70/1.14 Unprocessed initial clauses:
% 0.70/1.14
% 0.70/1.14 (1639) {G0,W5,D3,L1,V1,M1} { ! vd470 = vplus( vd471, X ) }.
% 0.70/1.14 (1640) {G0,W3,D2,L1,V0,M1} { greater( vd470, vd471 ) }.
% 0.70/1.14 (1641) {G0,W11,D4,L1,V3,M1} { vmul( vmul( X, Y ), Z ) = vmul( X, vmul( Y,
% 0.70/1.14 Z ) ) }.
% 0.70/1.14 (1642) {G0,W13,D4,L1,V3,M1} { vmul( X, vplus( Y, Z ) ) = vplus( vmul( X, Y
% 0.70/1.14 ), vmul( X, Z ) ) }.
% 0.70/1.14 (1643) {G0,W7,D3,L1,V2,M1} { vmul( X, Y ) = vmul( Y, X ) }.
% 0.70/1.14 (1644) {G0,W10,D4,L1,V2,M1} { vmul( vsucc( X ), Y ) = vplus( vmul( X, Y )
% 0.70/1.14 , Y ) }.
% 0.70/1.14 (1645) {G0,W5,D3,L1,V1,M1} { vmul( v1, X ) = X }.
% 0.70/1.14 (1646) {G0,W10,D4,L1,V2,M1} { vmul( X, vsucc( Y ) ) = vplus( vmul( X, Y )
% 0.70/1.14 , X ) }.
% 0.70/1.14 (1647) {G0,W5,D3,L1,V1,M1} { vmul( X, v1 ) = X }.
% 0.70/1.14 (1648) {G0,W8,D3,L2,V2,M2} { ! less( X, vplus( Y, v1 ) ), leq( X, Y ) }.
% 0.70/1.14 (1649) {G0,W8,D3,L2,V2,M2} { ! greater( X, Y ), geq( X, vplus( Y, v1 ) )
% 0.70/1.14 }.
% 0.70/1.14 (1650) {G0,W3,D2,L1,V1,M1} { geq( X, v1 ) }.
% 0.70/1.14 (1651) {G0,W13,D3,L3,V4,M3} { ! geq( Z, T ), ! geq( X, Y ), geq( vplus( X
% 0.70/1.14 , Z ), vplus( Y, T ) ) }.
% 0.70/1.14 (1652) {G0,W13,D3,L3,V4,M3} { ! greater( Z, T ), ! geq( X, Y ), greater(
% 0.70/1.14 vplus( X, Z ), vplus( Y, T ) ) }.
% 0.70/1.14 (1653) {G0,W13,D3,L3,V4,M3} { ! geq( Z, T ), ! greater( X, Y ), greater(
% 0.70/1.14 vplus( X, Z ), vplus( Y, T ) ) }.
% 0.70/1.14 (1654) {G0,W13,D3,L3,V4,M3} { ! greater( Z, T ), ! greater( X, Y ),
% 0.70/1.14 greater( vplus( X, Z ), vplus( Y, T ) ) }.
% 0.70/1.14 (1655) {G0,W10,D3,L2,V3,M2} { ! less( vplus( X, Z ), vplus( Y, Z ) ), less
% 0.70/1.14 ( X, Y ) }.
% 0.70/1.14 (1656) {G0,W10,D3,L2,V3,M2} { ! vplus( X, Z ) = vplus( Y, Z ), X = Y }.
% 0.70/1.14 (1657) {G0,W10,D3,L2,V3,M2} { ! greater( vplus( X, Z ), vplus( Y, Z ) ),
% 0.70/1.14 greater( X, Y ) }.
% 0.70/1.14 (1658) {G0,W10,D3,L2,V3,M2} { ! less( X, Y ), less( vplus( X, Z ), vplus(
% 0.70/1.14 Y, Z ) ) }.
% 0.70/1.14 (1659) {G0,W10,D3,L2,V3,M2} { ! X = Y, vplus( X, Z ) = vplus( Y, Z ) }.
% 0.70/1.14 (1660) {G0,W10,D3,L2,V3,M2} { ! greater( X, Y ), greater( vplus( X, Z ),
% 0.70/1.14 vplus( Y, Z ) ) }.
% 0.70/1.14 (1661) {G0,W5,D3,L1,V2,M1} { greater( vplus( X, Y ), X ) }.
% 0.70/1.14 (1662) {G0,W9,D2,L3,V3,M3} { ! leq( Z, Y ), ! leq( X, Z ), leq( X, Y ) }.
% 0.70/1.14 (1663) {G0,W9,D2,L3,V3,M3} { ! less( Z, Y ), ! leq( X, Z ), less( X, Y )
% 0.70/1.14 }.
% 0.70/1.14 (1664) {G0,W9,D2,L3,V3,M3} { ! leq( Z, Y ), ! less( X, Z ), less( X, Y )
% 0.70/1.14 }.
% 0.70/1.14 (1665) {G0,W9,D2,L3,V3,M3} { ! less( Z, Y ), ! less( X, Z ), less( X, Y )
% 0.70/1.14 }.
% 0.70/1.14 (1666) {G0,W6,D2,L2,V2,M2} { ! leq( X, Y ), geq( Y, X ) }.
% 0.70/1.14 (1667) {G0,W6,D2,L2,V2,M2} { ! geq( X, Y ), leq( Y, X ) }.
% 0.70/1.14 (1668) {G0,W9,D2,L3,V2,M3} { ! leq( Y, X ), less( Y, X ), Y = X }.
% 0.70/1.14 (1669) {G0,W6,D2,L2,V2,M2} { ! less( Y, X ), leq( Y, X ) }.
% 0.70/1.14 (1670) {G0,W6,D2,L2,V2,M2} { ! Y = X, leq( Y, X ) }.
% 0.70/1.14 (1671) {G0,W9,D2,L3,V2,M3} { ! geq( Y, X ), greater( Y, X ), Y = X }.
% 0.70/1.14 (1672) {G0,W6,D2,L2,V2,M2} { ! greater( Y, X ), geq( Y, X ) }.
% 0.70/1.14 (1673) {G0,W6,D2,L2,V2,M2} { ! Y = X, geq( Y, X ) }.
% 0.70/1.14 (1674) {G0,W6,D2,L2,V2,M2} { ! less( X, Y ), greater( Y, X ) }.
% 0.70/1.14 (1675) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), less( Y, X ) }.
% 0.70/1.14 (1676) {G0,W9,D2,L3,V2,M3} { X = Y, greater( X, Y ), less( X, Y ) }.
% 0.70/1.14 (1677) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! less( X, Y ) }.
% 0.70/1.14 (1678) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), ! less( X, Y ) }.
% 0.70/1.14 (1679) {G0,W6,D2,L2,V2,M2} { ! X = Y, ! greater( X, Y ) }.
% 0.70/1.14 (1680) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y, skol1( X, Y )
% 0.70/1.14 ) }.
% 0.70/1.14 (1681) {G0,W8,D3,L2,V3,M2} { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.70/1.14 (1682) {G0,W10,D4,L2,V2,M2} { ! greater( Y, X ), Y = vplus( X, skol2( X, Y
% 0.70/1.14 ) ) }.
% 0.70/1.14 (1683) {G0,W8,D3,L2,V3,M2} { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.70/1.14 (1684) {G0,W17,D4,L3,V2,M3} { X = Y, X = vplus( Y, skol3( X, Y ) ), Y =
% 0.70/1.14 vplus( X, skol4( X, Y ) ) }.
% 0.70/1.14 (1685) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.70/1.14 (1686) {G0,W10,D3,L2,V4,M2} { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.70/1.14 (1687) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.70/1.14 (1688) {G0,W10,D3,L2,V3,M2} { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.70/1.14 (1689) {G0,W5,D3,L1,V2,M1} { ! Y = vplus( X, Y ) }.
% 0.70/1.14 (1690) {G0,W7,D3,L1,V2,M1} { vplus( Y, X ) = vplus( X, Y ) }.
% 0.70/1.14 (1691) {G0,W9,D4,L1,V2,M1} { vplus( vsucc( X ), Y ) = vsucc( vplus( X, Y )
% 0.70/1.14 ) }.
% 0.70/1.14 (1692) {G0,W6,D3,L1,V1,M1} { vplus( v1, X ) = vsucc( X ) }.
% 0.70/1.14 (1693) {G0,W11,D4,L1,V3,M1} { vplus( vplus( X, Y ), Z ) = vplus( X, vplus
% 0.70/1.14 ( Y, Z ) ) }.
% 0.70/1.14 (1694) {G0,W9,D4,L1,V2,M1} { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y )
% 0.70/1.14 ) }.
% 0.70/1.14 (1695) {G0,W6,D3,L1,V1,M1} { vplus( X, v1 ) = vsucc( X ) }.
% 0.70/1.14 (1696) {G0,W8,D4,L2,V1,M2} { X = v1, X = vsucc( vskolem2( X ) ) }.
% 0.70/1.14 (1697) {G0,W4,D3,L1,V1,M1} { ! vsucc( X ) = X }.
% 0.70/1.14 (1698) {G0,W8,D3,L2,V2,M2} { X = Y, ! vsucc( X ) = vsucc( Y ) }.
% 0.70/1.14 (1699) {G0,W8,D3,L2,V2,M2} { ! vsucc( X ) = vsucc( Y ), X = Y }.
% 0.70/1.14 (1700) {G0,W4,D3,L1,V1,M1} { ! vsucc( X ) = v1 }.
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Total Proof:
% 0.70/1.14
% 0.70/1.14 eqswap: (1701) {G0,W5,D3,L1,V1,M1} { ! vplus( vd471, X ) = vd470 }.
% 0.70/1.14 parent0[0]: (1639) {G0,W5,D3,L1,V1,M1} { ! vd470 = vplus( vd471, X ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (0) {G0,W5,D3,L1,V1,M1} I { ! vplus( vd471, X ) ==> vd470 }.
% 0.70/1.14 parent0: (1701) {G0,W5,D3,L1,V1,M1} { ! vplus( vd471, X ) = vd470 }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (1) {G0,W3,D2,L1,V0,M1} I { greater( vd470, vd471 ) }.
% 0.70/1.14 parent0: (1640) {G0,W3,D2,L1,V0,M1} { greater( vd470, vd471 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (36) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), less( Y, X )
% 0.70/1.14 }.
% 0.70/1.14 parent0: (1675) {G0,W6,D2,L2,V2,M2} { ! greater( X, Y ), less( Y, X ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 Y := Y
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 1 ==> 1
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 eqswap: (1740) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol1( X, Y ) ) = X, !
% 0.70/1.14 less( Y, X ) }.
% 0.70/1.14 parent0[1]: (1680) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y,
% 0.70/1.14 skol1( X, Y ) ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 Y := Y
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (41) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1
% 0.70/1.14 ( X, Y ) ) ==> X }.
% 0.70/1.14 parent0: (1740) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol1( X, Y ) ) = X, !
% 0.70/1.14 less( Y, X ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 Y := Y
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 1
% 0.70/1.14 1 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (1741) {G1,W3,D2,L1,V0,M1} { less( vd471, vd470 ) }.
% 0.70/1.14 parent0[0]: (36) {G0,W6,D2,L2,V2,M2} I { ! greater( X, Y ), less( Y, X )
% 0.70/1.14 }.
% 0.70/1.14 parent1[0]: (1) {G0,W3,D2,L1,V0,M1} I { greater( vd470, vd471 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := vd470
% 0.70/1.14 Y := vd471
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (99) {G1,W3,D2,L1,V0,M1} R(36,1) { less( vd471, vd470 ) }.
% 0.70/1.14 parent0: (1741) {G1,W3,D2,L1,V0,M1} { less( vd471, vd470 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 0 ==> 0
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 eqswap: (1742) {G0,W10,D4,L2,V2,M2} { Y ==> vplus( X, skol1( Y, X ) ), !
% 0.70/1.14 less( X, Y ) }.
% 0.70/1.14 parent0[1]: (41) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1(
% 0.70/1.14 X, Y ) ) ==> X }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := Y
% 0.70/1.14 Y := X
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 eqswap: (1743) {G0,W5,D3,L1,V1,M1} { ! vd470 ==> vplus( vd471, X ) }.
% 0.70/1.14 parent0[0]: (0) {G0,W5,D3,L1,V1,M1} I { ! vplus( vd471, X ) ==> vd470 }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := X
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (1744) {G1,W7,D4,L1,V0,M1} { vd470 ==> vplus( vd471, skol1(
% 0.70/1.14 vd470, vd471 ) ) }.
% 0.70/1.14 parent0[1]: (1742) {G0,W10,D4,L2,V2,M2} { Y ==> vplus( X, skol1( Y, X ) )
% 0.70/1.14 , ! less( X, Y ) }.
% 0.70/1.14 parent1[0]: (99) {G1,W3,D2,L1,V0,M1} R(36,1) { less( vd471, vd470 ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := vd471
% 0.70/1.14 Y := vd470
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 resolution: (1745) {G1,W0,D0,L0,V0,M0} { }.
% 0.70/1.14 parent0[0]: (1743) {G0,W5,D3,L1,V1,M1} { ! vd470 ==> vplus( vd471, X ) }.
% 0.70/1.14 parent1[0]: (1744) {G1,W7,D4,L1,V0,M1} { vd470 ==> vplus( vd471, skol1(
% 0.70/1.14 vd470, vd471 ) ) }.
% 0.70/1.14 substitution0:
% 0.70/1.14 X := skol1( vd470, vd471 )
% 0.70/1.14 end
% 0.70/1.14 substitution1:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 subsumption: (1637) {G2,W0,D0,L0,V0,M0} R(41,99);r(0) { }.
% 0.70/1.14 parent0: (1745) {G1,W0,D0,L0,V0,M0} { }.
% 0.70/1.14 substitution0:
% 0.70/1.14 end
% 0.70/1.14 permutation0:
% 0.70/1.14 end
% 0.70/1.14
% 0.70/1.14 Proof check complete!
% 0.70/1.14
% 0.70/1.14 Memory use:
% 0.70/1.14
% 0.70/1.14 space for terms: 22321
% 0.70/1.14 space for clauses: 83114
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 clauses generated: 3376
% 0.70/1.14 clauses kept: 1638
% 0.70/1.14 clauses selected: 129
% 0.70/1.14 clauses deleted: 5
% 0.70/1.14 clauses inuse deleted: 3
% 0.70/1.14
% 0.70/1.14 subsentry: 9757
% 0.70/1.14 literals s-matched: 8190
% 0.70/1.14 literals matched: 8174
% 0.70/1.14 full subsumption: 3218
% 0.70/1.14
% 0.70/1.14 checksum: -242198322
% 0.70/1.14
% 0.70/1.14
% 0.70/1.14 Bliksem ended
%------------------------------------------------------------------------------