%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUM836+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:53 EDT 2022
% Result : Theorem 0.41s 1.05s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM836+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 12:26:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.05 *** allocated 10000 integers for termspace/termends
% 0.41/1.05 *** allocated 10000 integers for clauses
% 0.41/1.05 *** allocated 10000 integers for justifications
% 0.41/1.05 Bliksem 1.12
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 Automatic Strategy Selection
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 Clauses:
% 0.41/1.05
% 0.41/1.05 { greater( vd203, vd204 ) }.
% 0.41/1.05 { less( vd203, vd204 ) }.
% 0.41/1.05 { ! vd203 = vd204, ! greater( vd203, vd204 ) }.
% 0.41/1.05 { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) ) }.
% 0.41/1.05 { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.41/1.05 { ! greater( Y, X ), Y = vplus( X, skol2( X, Y ) ) }.
% 0.41/1.05 { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.41/1.05 { X = Y, X = vplus( Y, skol3( X, Y ) ), Y = vplus( X, skol4( X, Y ) ) }.
% 0.41/1.05 { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.41/1.05 { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.41/1.05 { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.41/1.05 { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.41/1.05 { vplus( vplus( X, Y ), Z ) = vplus( X, vplus( Y, Z ) ) }.
% 0.41/1.05 { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y ) ) }.
% 0.41/1.05 { vplus( X, v1 ) = vsucc( X ) }.
% 0.41/1.05
% 0.41/1.05 percentage equality = 0.730769, percentage horn = 0.933333
% 0.41/1.05 This is a problem with some equality
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 Options Used:
% 0.41/1.05
% 0.41/1.05 useres = 1
% 0.41/1.05 useparamod = 1
% 0.41/1.05 useeqrefl = 1
% 0.41/1.05 useeqfact = 1
% 0.41/1.05 usefactor = 1
% 0.41/1.05 usesimpsplitting = 0
% 0.41/1.05 usesimpdemod = 5
% 0.41/1.05 usesimpres = 3
% 0.41/1.05
% 0.41/1.05 resimpinuse = 1000
% 0.41/1.05 resimpclauses = 20000
% 0.41/1.05 substype = eqrewr
% 0.41/1.05 backwardsubs = 1
% 0.41/1.05 selectoldest = 5
% 0.41/1.05
% 0.41/1.05 litorderings [0] = split
% 0.41/1.05 litorderings [1] = extend the termordering, first sorting on arguments
% 0.41/1.05
% 0.41/1.05 termordering = kbo
% 0.41/1.05
% 0.41/1.05 litapriori = 0
% 0.41/1.05 termapriori = 1
% 0.41/1.05 litaposteriori = 0
% 0.41/1.05 termaposteriori = 0
% 0.41/1.05 demodaposteriori = 0
% 0.41/1.05 ordereqreflfact = 0
% 0.41/1.05
% 0.41/1.05 litselect = negord
% 0.41/1.05
% 0.41/1.05 maxweight = 15
% 0.41/1.05 maxdepth = 30000
% 0.41/1.05 maxlength = 115
% 0.41/1.05 maxnrvars = 195
% 0.41/1.05 excuselevel = 1
% 0.41/1.05 increasemaxweight = 1
% 0.41/1.05
% 0.41/1.05 maxselected = 10000000
% 0.41/1.05 maxnrclauses = 10000000
% 0.41/1.05
% 0.41/1.05 showgenerated = 0
% 0.41/1.05 showkept = 0
% 0.41/1.05 showselected = 0
% 0.41/1.05 showdeleted = 0
% 0.41/1.05 showresimp = 1
% 0.41/1.05 showstatus = 2000
% 0.41/1.05
% 0.41/1.05 prologoutput = 0
% 0.41/1.05 nrgoals = 5000000
% 0.41/1.05 totalproof = 1
% 0.41/1.05
% 0.41/1.05 Symbols occurring in the translation:
% 0.41/1.05
% 0.41/1.05 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.05 . [1, 2] (w:1, o:33, a:1, s:1, b:0),
% 0.41/1.05 ! [4, 1] (w:0, o:27, a:1, s:1, b:0),
% 0.41/1.05 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.05 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.05 vd203 [35, 0] (w:1, o:6, a:1, s:1, b:0),
% 0.41/1.05 vd204 [36, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.41/1.05 greater [37, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.41/1.05 less [38, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.41/1.05 vplus [42, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.41/1.05 vsucc [58, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.41/1.05 v1 [59, 0] (w:1, o:26, a:1, s:1, b:0),
% 0.41/1.05 skol1 [60, 2] (w:1, o:60, a:1, s:1, b:1),
% 0.41/1.05 skol2 [61, 2] (w:1, o:61, a:1, s:1, b:1),
% 0.41/1.05 skol3 [62, 2] (w:1, o:62, a:1, s:1, b:1),
% 0.41/1.05 skol4 [63, 2] (w:1, o:63, a:1, s:1, b:1).
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 Starting Search:
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 Bliksems!, er is een bewijs:
% 0.41/1.05 % SZS status Theorem
% 0.41/1.05 % SZS output start Refutation
% 0.41/1.05
% 0.41/1.05 (0) {G0,W3,D2,L1,V0,M1} I { greater( vd203, vd204 ) }.
% 0.41/1.05 (1) {G0,W3,D2,L1,V0,M1} I { less( vd203, vd204 ) }.
% 0.41/1.05 (3) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1( X, Y ) ) ==>
% 0.41/1.05 X }.
% 0.41/1.05 (4) {G0,W8,D3,L2,V3,M2} I { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.41/1.05 (5) {G0,W10,D4,L2,V2,M2} I { ! greater( Y, X ), vplus( X, skol2( X, Y ) )
% 0.41/1.05 ==> Y }.
% 0.41/1.05 (9) {G0,W10,D3,L2,V4,M2} I { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.41/1.05 (14) {G1,W5,D3,L1,V2,M1} Q(4) { less( X, vplus( X, Y ) ) }.
% 0.41/1.05 (17) {G1,W7,D4,L1,V3,M1} Q(9) { ! vplus( vplus( X, Y ), Z ) ==> X }.
% 0.41/1.05 (38) {G2,W6,D2,L2,V2,M2} P(5,14) { less( X, Y ), ! greater( Y, X ) }.
% 0.41/1.05 (41) {G3,W3,D2,L1,V0,M1} R(38,0) { less( vd204, vd203 ) }.
% 0.41/1.05 (85) {G2,W5,D3,L1,V2,M1} R(17,3) { ! less( vplus( X, Y ), X ) }.
% 0.41/1.05 (113) {G3,W6,D2,L2,V2,M2} P(3,85) { ! less( Y, X ), ! less( X, Y ) }.
% 0.41/1.05 (115) {G4,W0,D0,L0,V0,M0} R(113,41);r(1) { }.
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 % SZS output end Refutation
% 0.41/1.05 found a proof!
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 Unprocessed initial clauses:
% 0.41/1.05
% 0.41/1.05 (117) {G0,W3,D2,L1,V0,M1} { greater( vd203, vd204 ) }.
% 0.41/1.05 (118) {G0,W3,D2,L1,V0,M1} { less( vd203, vd204 ) }.
% 0.41/1.05 (119) {G0,W6,D2,L2,V0,M2} { ! vd203 = vd204, ! greater( vd203, vd204 ) }.
% 0.41/1.05 (120) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y, skol1( X, Y ) )
% 0.41/1.05 }.
% 0.41/1.05 (121) {G0,W8,D3,L2,V3,M2} { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.41/1.05 (122) {G0,W10,D4,L2,V2,M2} { ! greater( Y, X ), Y = vplus( X, skol2( X, Y
% 0.41/1.05 ) ) }.
% 0.41/1.05 (123) {G0,W8,D3,L2,V3,M2} { ! Y = vplus( X, Z ), greater( Y, X ) }.
% 0.41/1.05 (124) {G0,W17,D4,L3,V2,M3} { X = Y, X = vplus( Y, skol3( X, Y ) ), Y =
% 0.41/1.05 vplus( X, skol4( X, Y ) ) }.
% 0.41/1.05 (125) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! Y = vplus( X, Z ) }.
% 0.41/1.05 (126) {G0,W10,D3,L2,V4,M2} { ! X = vplus( Y, Z ), ! Y = vplus( X, T ) }.
% 0.41/1.05 (127) {G0,W8,D3,L2,V3,M2} { ! X = Y, ! X = vplus( Y, Z ) }.
% 0.41/1.05 (128) {G0,W10,D3,L2,V3,M2} { X = Y, ! vplus( Z, X ) = vplus( Z, Y ) }.
% 0.41/1.05 (129) {G0,W11,D4,L1,V3,M1} { vplus( vplus( X, Y ), Z ) = vplus( X, vplus(
% 0.41/1.05 Y, Z ) ) }.
% 0.41/1.05 (130) {G0,W9,D4,L1,V2,M1} { vplus( X, vsucc( Y ) ) = vsucc( vplus( X, Y )
% 0.41/1.05 ) }.
% 0.41/1.05 (131) {G0,W6,D3,L1,V1,M1} { vplus( X, v1 ) = vsucc( X ) }.
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 Total Proof:
% 0.41/1.05
% 0.41/1.05 subsumption: (0) {G0,W3,D2,L1,V0,M1} I { greater( vd203, vd204 ) }.
% 0.41/1.05 parent0: (117) {G0,W3,D2,L1,V0,M1} { greater( vd203, vd204 ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (1) {G0,W3,D2,L1,V0,M1} I { less( vd203, vd204 ) }.
% 0.41/1.05 parent0: (118) {G0,W3,D2,L1,V0,M1} { less( vd203, vd204 ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 eqswap: (133) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol1( X, Y ) ) = X, ! less
% 0.41/1.05 ( Y, X ) }.
% 0.41/1.05 parent0[1]: (120) {G0,W10,D4,L2,V2,M2} { ! less( Y, X ), X = vplus( Y,
% 0.41/1.05 skol1( X, Y ) ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (3) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1(
% 0.41/1.05 X, Y ) ) ==> X }.
% 0.41/1.05 parent0: (133) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol1( X, Y ) ) = X, !
% 0.41/1.05 less( Y, X ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 1
% 0.41/1.05 1 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (4) {G0,W8,D3,L2,V3,M2} I { ! X = vplus( Y, Z ), less( Y, X )
% 0.41/1.05 }.
% 0.41/1.05 parent0: (121) {G0,W8,D3,L2,V3,M2} { ! X = vplus( Y, Z ), less( Y, X ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 Z := Z
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 1 ==> 1
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 eqswap: (140) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol2( Y, X ) ) = X, !
% 0.41/1.05 greater( X, Y ) }.
% 0.41/1.05 parent0[1]: (122) {G0,W10,D4,L2,V2,M2} { ! greater( Y, X ), Y = vplus( X,
% 0.41/1.05 skol2( X, Y ) ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := Y
% 0.41/1.05 Y := X
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (5) {G0,W10,D4,L2,V2,M2} I { ! greater( Y, X ), vplus( X,
% 0.41/1.05 skol2( X, Y ) ) ==> Y }.
% 0.41/1.05 parent0: (140) {G0,W10,D4,L2,V2,M2} { vplus( Y, skol2( Y, X ) ) = X, !
% 0.41/1.05 greater( X, Y ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := Y
% 0.41/1.05 Y := X
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 1
% 0.41/1.05 1 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (9) {G0,W10,D3,L2,V4,M2} I { ! X = vplus( Y, Z ), ! Y = vplus
% 0.41/1.05 ( X, T ) }.
% 0.41/1.05 parent0: (126) {G0,W10,D3,L2,V4,M2} { ! X = vplus( Y, Z ), ! Y = vplus( X
% 0.41/1.05 , T ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 Z := Z
% 0.41/1.05 T := T
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 1 ==> 1
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 eqswap: (160) {G0,W8,D3,L2,V3,M2} { ! vplus( Y, Z ) = X, less( Y, X ) }.
% 0.41/1.05 parent0[0]: (4) {G0,W8,D3,L2,V3,M2} I { ! X = vplus( Y, Z ), less( Y, X )
% 0.41/1.05 }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 Z := Z
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 eqrefl: (161) {G0,W5,D3,L1,V2,M1} { less( X, vplus( X, Y ) ) }.
% 0.41/1.05 parent0[0]: (160) {G0,W8,D3,L2,V3,M2} { ! vplus( Y, Z ) = X, less( Y, X )
% 0.41/1.05 }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := vplus( X, Y )
% 0.41/1.05 Y := X
% 0.41/1.05 Z := Y
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (14) {G1,W5,D3,L1,V2,M1} Q(4) { less( X, vplus( X, Y ) ) }.
% 0.41/1.05 parent0: (161) {G0,W5,D3,L1,V2,M1} { less( X, vplus( X, Y ) ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 eqswap: (162) {G0,W10,D3,L2,V4,M2} { ! vplus( Y, Z ) = X, ! Y = vplus( X,
% 0.41/1.05 T ) }.
% 0.41/1.05 parent0[0]: (9) {G0,W10,D3,L2,V4,M2} I { ! X = vplus( Y, Z ), ! Y = vplus(
% 0.41/1.05 X, T ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 Z := Z
% 0.41/1.05 T := T
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 eqswap: (163) {G0,W10,D3,L2,V4,M2} { ! vplus( Y, Z ) = X, ! vplus( X, T )
% 0.41/1.05 = Y }.
% 0.41/1.05 parent0[1]: (162) {G0,W10,D3,L2,V4,M2} { ! vplus( Y, Z ) = X, ! Y = vplus
% 0.41/1.05 ( X, T ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := Y
% 0.41/1.05 Y := X
% 0.41/1.05 Z := T
% 0.41/1.05 T := Z
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 eqrefl: (164) {G0,W7,D4,L1,V3,M1} { ! vplus( vplus( X, Y ), Z ) = X }.
% 0.41/1.05 parent0[0]: (163) {G0,W10,D3,L2,V4,M2} { ! vplus( Y, Z ) = X, ! vplus( X,
% 0.41/1.05 T ) = Y }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := vplus( X, Y )
% 0.41/1.05 Y := X
% 0.41/1.05 Z := Y
% 0.41/1.05 T := Z
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (17) {G1,W7,D4,L1,V3,M1} Q(9) { ! vplus( vplus( X, Y ), Z )
% 0.41/1.05 ==> X }.
% 0.41/1.05 parent0: (164) {G0,W7,D4,L1,V3,M1} { ! vplus( vplus( X, Y ), Z ) = X }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 Z := Z
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 paramod: (167) {G1,W6,D2,L2,V2,M2} { less( X, Y ), ! greater( Y, X ) }.
% 0.41/1.05 parent0[1]: (5) {G0,W10,D4,L2,V2,M2} I { ! greater( Y, X ), vplus( X, skol2
% 0.41/1.05 ( X, Y ) ) ==> Y }.
% 0.41/1.05 parent1[0; 2]: (14) {G1,W5,D3,L1,V2,M1} Q(4) { less( X, vplus( X, Y ) ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 end
% 0.41/1.05 substitution1:
% 0.41/1.05 X := X
% 0.41/1.05 Y := skol2( X, Y )
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (38) {G2,W6,D2,L2,V2,M2} P(5,14) { less( X, Y ), ! greater( Y
% 0.41/1.05 , X ) }.
% 0.41/1.05 parent0: (167) {G1,W6,D2,L2,V2,M2} { less( X, Y ), ! greater( Y, X ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 1 ==> 1
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 resolution: (168) {G1,W3,D2,L1,V0,M1} { less( vd204, vd203 ) }.
% 0.41/1.05 parent0[1]: (38) {G2,W6,D2,L2,V2,M2} P(5,14) { less( X, Y ), ! greater( Y,
% 0.41/1.05 X ) }.
% 0.41/1.05 parent1[0]: (0) {G0,W3,D2,L1,V0,M1} I { greater( vd203, vd204 ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := vd204
% 0.41/1.05 Y := vd203
% 0.41/1.05 end
% 0.41/1.05 substitution1:
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (41) {G3,W3,D2,L1,V0,M1} R(38,0) { less( vd204, vd203 ) }.
% 0.41/1.05 parent0: (168) {G1,W3,D2,L1,V0,M1} { less( vd204, vd203 ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 eqswap: (169) {G1,W7,D4,L1,V3,M1} { ! X ==> vplus( vplus( X, Y ), Z ) }.
% 0.41/1.05 parent0[0]: (17) {G1,W7,D4,L1,V3,M1} Q(9) { ! vplus( vplus( X, Y ), Z ) ==>
% 0.41/1.05 X }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 Z := Z
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 eqswap: (170) {G0,W10,D4,L2,V2,M2} { Y ==> vplus( X, skol1( Y, X ) ), !
% 0.41/1.05 less( X, Y ) }.
% 0.41/1.05 parent0[1]: (3) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1( X
% 0.41/1.05 , Y ) ) ==> X }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := Y
% 0.41/1.05 Y := X
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 resolution: (171) {G1,W5,D3,L1,V2,M1} { ! less( vplus( X, Y ), X ) }.
% 0.41/1.05 parent0[0]: (169) {G1,W7,D4,L1,V3,M1} { ! X ==> vplus( vplus( X, Y ), Z )
% 0.41/1.05 }.
% 0.41/1.05 parent1[0]: (170) {G0,W10,D4,L2,V2,M2} { Y ==> vplus( X, skol1( Y, X ) ),
% 0.41/1.05 ! less( X, Y ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 Z := skol1( X, vplus( X, Y ) )
% 0.41/1.05 end
% 0.41/1.05 substitution1:
% 0.41/1.05 X := vplus( X, Y )
% 0.41/1.05 Y := X
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (85) {G2,W5,D3,L1,V2,M1} R(17,3) { ! less( vplus( X, Y ), X )
% 0.41/1.05 }.
% 0.41/1.05 parent0: (171) {G1,W5,D3,L1,V2,M1} { ! less( vplus( X, Y ), X ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 paramod: (173) {G1,W6,D2,L2,V2,M2} { ! less( Y, X ), ! less( X, Y ) }.
% 0.41/1.05 parent0[1]: (3) {G0,W10,D4,L2,V2,M2} I { ! less( Y, X ), vplus( Y, skol1( X
% 0.41/1.05 , Y ) ) ==> X }.
% 0.41/1.05 parent1[0; 2]: (85) {G2,W5,D3,L1,V2,M1} R(17,3) { ! less( vplus( X, Y ), X
% 0.41/1.05 ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := Y
% 0.41/1.05 Y := X
% 0.41/1.05 end
% 0.41/1.05 substitution1:
% 0.41/1.05 X := X
% 0.41/1.05 Y := skol1( Y, X )
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 subsumption: (113) {G3,W6,D2,L2,V2,M2} P(3,85) { ! less( Y, X ), ! less( X
% 0.41/1.05 , Y ) }.
% 0.41/1.05 parent0: (173) {G1,W6,D2,L2,V2,M2} { ! less( Y, X ), ! less( X, Y ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := X
% 0.41/1.05 Y := Y
% 0.41/1.05 end
% 0.41/1.05 permutation0:
% 0.41/1.05 0 ==> 0
% 0.41/1.05 1 ==> 1
% 0.41/1.05 end
% 0.41/1.05
% 0.41/1.05 resolution: (175) {G4,W3,D2,L1,V0,M1} { ! less( vd203, vd204 ) }.
% 0.41/1.05 parent0[0]: (113) {G3,W6,D2,L2,V2,M2} P(3,85) { ! less( Y, X ), ! less( X,
% 0.41/1.05 Y ) }.
% 0.41/1.05 parent1[0]: (41) {G3,W3,D2,L1,V0,M1} R(38,0) { less( vd204, vd203 ) }.
% 0.41/1.05 substitution0:
% 0.41/1.05 X := vd203
% 0.41/1.05 Y := vd204
% 0.41/1.05 end
% 0.41/1.05 substitution1:
% 0.41/1.05 end
% 0.41/1.06
% 0.41/1.06 resolution: (176) {G1,W0,D0,L0,V0,M0} { }.
% 0.41/1.06 parent0[0]: (175) {G4,W3,D2,L1,V0,M1} { ! less( vd203, vd204 ) }.
% 0.41/1.06 parent1[0]: (1) {G0,W3,D2,L1,V0,M1} I { less( vd203, vd204 ) }.
% 0.41/1.06 substitution0:
% 0.41/1.06 end
% 0.41/1.06 substitution1:
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 subsumption: (115) {G4,W0,D0,L0,V0,M0} R(113,41);r(1) { }.
% 0.41/1.06 parent0: (176) {G1,W0,D0,L0,V0,M0} { }.
% 0.41/1.06 substitution0:
% 0.41/1.06 end
% 0.41/1.06 permutation0:
% 0.41/1.06 end
% 0.41/1.06
% 0.41/1.06 Proof check complete!
% 0.41/1.06
% 0.41/1.06 Memory use:
% 0.41/1.06
% 0.41/1.06 space for terms: 1917
% 0.41/1.06 space for clauses: 7744
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 clauses generated: 334
% 0.41/1.06 clauses kept: 116
% 0.41/1.06 clauses selected: 34
% 0.41/1.06 clauses deleted: 0
% 0.41/1.06 clauses inuse deleted: 0
% 0.41/1.06
% 0.41/1.06 subsentry: 591
% 0.41/1.06 literals s-matched: 341
% 0.41/1.06 literals matched: 341
% 0.41/1.06 full subsumption: 183
% 0.41/1.06
% 0.41/1.06 checksum: -1855860531
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Bliksem ended
%------------------------------------------------------------------------------