TSTP Solution File: MSC012+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n014.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 : Sun Jul 17 22:33:20 EDT 2022
% Result : Theorem 0.70s 1.09s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n014.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 : Fri Jul 1 16:43:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.09 *** allocated 10000 integers for termspace/termends
% 0.70/1.09 *** allocated 10000 integers for clauses
% 0.70/1.09 *** allocated 10000 integers for justifications
% 0.70/1.09 Bliksem 1.12
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Automatic Strategy Selection
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Clauses:
% 0.70/1.09
% 0.70/1.09 { ! p( X ), ! less( X, Y ), ! p( Y ), goal }.
% 0.70/1.09 { p( X ), p( skol1( Y ) ) }.
% 0.70/1.09 { p( X ), less( X, skol1( X ) ) }.
% 0.70/1.09 { ! less( X, Z ), ! less( Z, Y ), less( X, Y ) }.
% 0.70/1.09 { less( X, skol2( X ) ) }.
% 0.70/1.09 { ! goal }.
% 0.70/1.09
% 0.70/1.09 percentage equality = 0.000000, percentage horn = 0.666667
% 0.70/1.09 This a non-horn, non-equality problem
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Options Used:
% 0.70/1.09
% 0.70/1.09 useres = 1
% 0.70/1.09 useparamod = 0
% 0.70/1.09 useeqrefl = 0
% 0.70/1.09 useeqfact = 0
% 0.70/1.09 usefactor = 1
% 0.70/1.09 usesimpsplitting = 0
% 0.70/1.09 usesimpdemod = 0
% 0.70/1.09 usesimpres = 3
% 0.70/1.09
% 0.70/1.09 resimpinuse = 1000
% 0.70/1.09 resimpclauses = 20000
% 0.70/1.09 substype = standard
% 0.70/1.09 backwardsubs = 1
% 0.70/1.09 selectoldest = 5
% 0.70/1.09
% 0.70/1.09 litorderings [0] = split
% 0.70/1.09 litorderings [1] = liftord
% 0.70/1.09
% 0.70/1.09 termordering = none
% 0.70/1.09
% 0.70/1.09 litapriori = 1
% 0.70/1.09 termapriori = 0
% 0.70/1.09 litaposteriori = 0
% 0.70/1.09 termaposteriori = 0
% 0.70/1.09 demodaposteriori = 0
% 0.70/1.09 ordereqreflfact = 0
% 0.70/1.09
% 0.70/1.09 litselect = none
% 0.70/1.09
% 0.70/1.09 maxweight = 15
% 0.70/1.09 maxdepth = 30000
% 0.70/1.09 maxlength = 115
% 0.70/1.09 maxnrvars = 195
% 0.70/1.09 excuselevel = 1
% 0.70/1.09 increasemaxweight = 1
% 0.70/1.09
% 0.70/1.09 maxselected = 10000000
% 0.70/1.09 maxnrclauses = 10000000
% 0.70/1.09
% 0.70/1.09 showgenerated = 0
% 0.70/1.09 showkept = 0
% 0.70/1.09 showselected = 0
% 0.70/1.09 showdeleted = 0
% 0.70/1.09 showresimp = 1
% 0.70/1.09 showstatus = 2000
% 0.70/1.09
% 0.70/1.09 prologoutput = 0
% 0.70/1.09 nrgoals = 5000000
% 0.70/1.09 totalproof = 1
% 0.70/1.09
% 0.70/1.09 Symbols occurring in the translation:
% 0.70/1.09
% 0.70/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.09 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.70/1.09 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.70/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 p [37, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.70/1.09 less [38, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.70/1.09 goal [39, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.70/1.09 skol1 [41, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.70/1.09 skol2 [42, 1] (w:1, o:17, a:1, s:1, b:0).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Starting Search:
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksems!, er is een bewijs:
% 0.70/1.09 % SZS status Theorem
% 0.70/1.09 % SZS output start Refutation
% 0.70/1.09
% 0.70/1.09 (0) {G0,W8,D2,L4,V2,M1} I { ! p( X ), ! p( Y ), goal, ! less( X, Y ) }.
% 0.70/1.09 (1) {G0,W5,D3,L2,V2,M2} I { p( skol1( Y ) ), p( X ) }.
% 0.70/1.09 (2) {G0,W6,D3,L2,V1,M1} I { p( X ), less( X, skol1( X ) ) }.
% 0.70/1.09 (3) {G0,W9,D2,L3,V3,M3} I { ! less( Z, Y ), less( X, Y ), ! less( X, Z )
% 0.70/1.09 }.
% 0.70/1.09 (4) {G0,W4,D3,L1,V1,M1} I { less( X, skol2( X ) ) }.
% 0.70/1.09 (5) {G0,W1,D1,L1,V0,M1} I { ! goal }.
% 0.70/1.09 (7) {G1,W3,D3,L1,V1,M1} F(1) { p( skol1( X ) ) }.
% 0.70/1.09 (8) {G1,W7,D2,L3,V2,M1} S(0);r(5) { ! p( X ), ! p( Y ), ! less( X, Y ) }.
% 0.70/1.09 (12) {G2,W10,D2,L4,V3,M2} R(3,8) { ! p( Z ), ! p( Y ), ! less( Z, X ), !
% 0.70/1.09 less( X, Y ) }.
% 0.70/1.09 (16) {G1,W7,D3,L2,V2,M2} R(3,4) { ! less( X, Y ), less( X, skol2( Y ) ) }.
% 0.70/1.09 (24) {G2,W5,D4,L1,V1,M1} R(16,4) { less( X, skol2( skol2( X ) ) ) }.
% 0.70/1.09 (25) {G3,W6,D5,L1,V1,M1} R(24,16) { less( X, skol2( skol2( skol2( X ) ) ) )
% 0.70/1.09 }.
% 0.70/1.09 (49) {G4,W7,D5,L2,V1,M2} R(25,8) { ! p( skol2( skol2( skol2( X ) ) ) ), ! p
% 0.70/1.09 ( X ) }.
% 0.70/1.09 (78) {G3,W7,D2,L3,V2,M1} R(12,2);r(7) { ! p( X ), p( Y ), ! less( X, Y )
% 0.70/1.09 }.
% 0.70/1.09 (85) {G5,W2,D2,L1,V1,M1} R(78,25);r(49) { ! p( X ) }.
% 0.70/1.09 (86) {G6,W0,D0,L0,V0,M0} R(85,7) { }.
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 % SZS output end Refutation
% 0.70/1.09 found a proof!
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Unprocessed initial clauses:
% 0.70/1.09
% 0.70/1.09 (88) {G0,W8,D2,L4,V2,M4} { ! p( X ), ! less( X, Y ), ! p( Y ), goal }.
% 0.70/1.09 (89) {G0,W5,D3,L2,V2,M2} { p( X ), p( skol1( Y ) ) }.
% 0.70/1.09 (90) {G0,W6,D3,L2,V1,M2} { p( X ), less( X, skol1( X ) ) }.
% 0.70/1.09 (91) {G0,W9,D2,L3,V3,M3} { ! less( X, Z ), ! less( Z, Y ), less( X, Y )
% 0.70/1.09 }.
% 0.70/1.09 (92) {G0,W4,D3,L1,V1,M1} { less( X, skol2( X ) ) }.
% 0.70/1.09 (93) {G0,W1,D1,L1,V0,M1} { ! goal }.
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Total Proof:
% 0.70/1.09
% 0.70/1.09 subsumption: (0) {G0,W8,D2,L4,V2,M1} I { ! p( X ), ! p( Y ), goal, ! less(
% 0.70/1.09 X, Y ) }.
% 0.70/1.09 parent0: (88) {G0,W8,D2,L4,V2,M4} { ! p( X ), ! less( X, Y ), ! p( Y ),
% 0.70/1.09 goal }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 1 ==> 3
% 0.70/1.09 2 ==> 1
% 0.70/1.09 3 ==> 2
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (1) {G0,W5,D3,L2,V2,M2} I { p( skol1( Y ) ), p( X ) }.
% 0.70/1.09 parent0: (89) {G0,W5,D3,L2,V2,M2} { p( X ), p( skol1( Y ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := skol1( Y )
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 1 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (2) {G0,W6,D3,L2,V1,M1} I { p( X ), less( X, skol1( X ) ) }.
% 0.70/1.09 parent0: (90) {G0,W6,D3,L2,V1,M2} { p( X ), less( X, skol1( X ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 1 ==> 1
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (3) {G0,W9,D2,L3,V3,M3} I { ! less( Z, Y ), less( X, Y ), !
% 0.70/1.09 less( X, Z ) }.
% 0.70/1.09 parent0: (91) {G0,W9,D2,L3,V3,M3} { ! less( X, Z ), ! less( Z, Y ), less(
% 0.70/1.09 X, Y ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 Z := Z
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 2
% 0.70/1.09 1 ==> 0
% 0.70/1.09 2 ==> 1
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (4) {G0,W4,D3,L1,V1,M1} I { less( X, skol2( X ) ) }.
% 0.70/1.09 parent0: (92) {G0,W4,D3,L1,V1,M1} { less( X, skol2( X ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (5) {G0,W1,D1,L1,V0,M1} I { ! goal }.
% 0.70/1.09 parent0: (93) {G0,W1,D1,L1,V0,M1} { ! goal }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 factor: (108) {G0,W3,D3,L1,V1,M1} { p( skol1( X ) ) }.
% 0.70/1.09 parent0[0, 1]: (1) {G0,W5,D3,L2,V2,M2} I { p( skol1( Y ) ), p( X ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := skol1( X )
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (7) {G1,W3,D3,L1,V1,M1} F(1) { p( skol1( X ) ) }.
% 0.70/1.09 parent0: (108) {G0,W3,D3,L1,V1,M1} { p( skol1( X ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (111) {G1,W7,D2,L3,V2,M3} { ! p( X ), ! p( Y ), ! less( X, Y )
% 0.70/1.09 }.
% 0.70/1.09 parent0[0]: (5) {G0,W1,D1,L1,V0,M1} I { ! goal }.
% 0.70/1.09 parent1[2]: (0) {G0,W8,D2,L4,V2,M1} I { ! p( X ), ! p( Y ), goal, ! less( X
% 0.70/1.09 , Y ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (8) {G1,W7,D2,L3,V2,M1} S(0);r(5) { ! p( X ), ! p( Y ), ! less
% 0.70/1.09 ( X, Y ) }.
% 0.70/1.09 parent0: (111) {G1,W7,D2,L3,V2,M3} { ! p( X ), ! p( Y ), ! less( X, Y )
% 0.70/1.09 }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 1 ==> 1
% 0.70/1.09 2 ==> 2
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (113) {G1,W10,D2,L4,V3,M4} { ! p( X ), ! p( Y ), ! less( Z, Y
% 0.70/1.09 ), ! less( X, Z ) }.
% 0.70/1.09 parent0[2]: (8) {G1,W7,D2,L3,V2,M1} S(0);r(5) { ! p( X ), ! p( Y ), ! less
% 0.70/1.09 ( X, Y ) }.
% 0.70/1.09 parent1[1]: (3) {G0,W9,D2,L3,V3,M3} I { ! less( Z, Y ), less( X, Y ), !
% 0.70/1.09 less( X, Z ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 Z := Z
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (12) {G2,W10,D2,L4,V3,M2} R(3,8) { ! p( Z ), ! p( Y ), ! less
% 0.70/1.09 ( Z, X ), ! less( X, Y ) }.
% 0.70/1.09 parent0: (113) {G1,W10,D2,L4,V3,M4} { ! p( X ), ! p( Y ), ! less( Z, Y ),
% 0.70/1.09 ! less( X, Z ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Z
% 0.70/1.09 Y := Y
% 0.70/1.09 Z := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 1 ==> 1
% 0.70/1.09 2 ==> 3
% 0.70/1.09 3 ==> 2
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (117) {G1,W7,D3,L2,V2,M2} { less( Y, skol2( X ) ), ! less( Y,
% 0.70/1.09 X ) }.
% 0.70/1.09 parent0[0]: (3) {G0,W9,D2,L3,V3,M3} I { ! less( Z, Y ), less( X, Y ), !
% 0.70/1.09 less( X, Z ) }.
% 0.70/1.09 parent1[0]: (4) {G0,W4,D3,L1,V1,M1} I { less( X, skol2( X ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := skol2( X )
% 0.70/1.09 Z := X
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (16) {G1,W7,D3,L2,V2,M2} R(3,4) { ! less( X, Y ), less( X,
% 0.70/1.09 skol2( Y ) ) }.
% 0.70/1.09 parent0: (117) {G1,W7,D3,L2,V2,M2} { less( Y, skol2( X ) ), ! less( Y, X )
% 0.70/1.09 }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 1
% 0.70/1.09 1 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (119) {G1,W5,D4,L1,V1,M1} { less( X, skol2( skol2( X ) ) ) }.
% 0.70/1.09 parent0[0]: (16) {G1,W7,D3,L2,V2,M2} R(3,4) { ! less( X, Y ), less( X,
% 0.70/1.09 skol2( Y ) ) }.
% 0.70/1.09 parent1[0]: (4) {G0,W4,D3,L1,V1,M1} I { less( X, skol2( X ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := skol2( X )
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (24) {G2,W5,D4,L1,V1,M1} R(16,4) { less( X, skol2( skol2( X )
% 0.70/1.09 ) ) }.
% 0.70/1.09 parent0: (119) {G1,W5,D4,L1,V1,M1} { less( X, skol2( skol2( X ) ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (120) {G2,W6,D5,L1,V1,M1} { less( X, skol2( skol2( skol2( X )
% 0.70/1.09 ) ) ) }.
% 0.70/1.09 parent0[0]: (16) {G1,W7,D3,L2,V2,M2} R(3,4) { ! less( X, Y ), less( X,
% 0.70/1.09 skol2( Y ) ) }.
% 0.70/1.09 parent1[0]: (24) {G2,W5,D4,L1,V1,M1} R(16,4) { less( X, skol2( skol2( X ) )
% 0.70/1.09 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := skol2( skol2( X ) )
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (25) {G3,W6,D5,L1,V1,M1} R(24,16) { less( X, skol2( skol2(
% 0.70/1.09 skol2( X ) ) ) ) }.
% 0.70/1.09 parent0: (120) {G2,W6,D5,L1,V1,M1} { less( X, skol2( skol2( skol2( X ) ) )
% 0.70/1.09 ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (121) {G2,W7,D5,L2,V1,M2} { ! p( X ), ! p( skol2( skol2( skol2
% 0.70/1.09 ( X ) ) ) ) }.
% 0.70/1.09 parent0[2]: (8) {G1,W7,D2,L3,V2,M1} S(0);r(5) { ! p( X ), ! p( Y ), ! less
% 0.70/1.09 ( X, Y ) }.
% 0.70/1.09 parent1[0]: (25) {G3,W6,D5,L1,V1,M1} R(24,16) { less( X, skol2( skol2(
% 0.70/1.09 skol2( X ) ) ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := skol2( skol2( skol2( X ) ) )
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (49) {G4,W7,D5,L2,V1,M2} R(25,8) { ! p( skol2( skol2( skol2( X
% 0.70/1.09 ) ) ) ), ! p( X ) }.
% 0.70/1.09 parent0: (121) {G2,W7,D5,L2,V1,M2} { ! p( X ), ! p( skol2( skol2( skol2( X
% 0.70/1.09 ) ) ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 1
% 0.70/1.09 1 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (125) {G1,W10,D3,L4,V2,M4} { ! p( X ), ! p( skol1( Y ) ), !
% 0.70/1.09 less( X, Y ), p( Y ) }.
% 0.70/1.09 parent0[3]: (12) {G2,W10,D2,L4,V3,M2} R(3,8) { ! p( Z ), ! p( Y ), ! less(
% 0.70/1.09 Z, X ), ! less( X, Y ) }.
% 0.70/1.09 parent1[1]: (2) {G0,W6,D3,L2,V1,M1} I { p( X ), less( X, skol1( X ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := Y
% 0.70/1.09 Y := skol1( Y )
% 0.70/1.09 Z := X
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := Y
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (130) {G2,W7,D2,L3,V2,M3} { ! p( X ), ! less( X, Y ), p( Y )
% 0.70/1.09 }.
% 0.70/1.09 parent0[1]: (125) {G1,W10,D3,L4,V2,M4} { ! p( X ), ! p( skol1( Y ) ), !
% 0.70/1.09 less( X, Y ), p( Y ) }.
% 0.70/1.09 parent1[0]: (7) {G1,W3,D3,L1,V1,M1} F(1) { p( skol1( X ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := Y
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (78) {G3,W7,D2,L3,V2,M1} R(12,2);r(7) { ! p( X ), p( Y ), !
% 0.70/1.09 less( X, Y ) }.
% 0.70/1.09 parent0: (130) {G2,W7,D2,L3,V2,M3} { ! p( X ), ! less( X, Y ), p( Y ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := Y
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 1 ==> 2
% 0.70/1.09 2 ==> 1
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (131) {G4,W7,D5,L2,V1,M2} { ! p( X ), p( skol2( skol2( skol2(
% 0.70/1.09 X ) ) ) ) }.
% 0.70/1.09 parent0[2]: (78) {G3,W7,D2,L3,V2,M1} R(12,2);r(7) { ! p( X ), p( Y ), !
% 0.70/1.09 less( X, Y ) }.
% 0.70/1.09 parent1[0]: (25) {G3,W6,D5,L1,V1,M1} R(24,16) { less( X, skol2( skol2(
% 0.70/1.09 skol2( X ) ) ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 Y := skol2( skol2( skol2( X ) ) )
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (132) {G5,W4,D2,L2,V1,M2} { ! p( X ), ! p( X ) }.
% 0.70/1.09 parent0[0]: (49) {G4,W7,D5,L2,V1,M2} R(25,8) { ! p( skol2( skol2( skol2( X
% 0.70/1.09 ) ) ) ), ! p( X ) }.
% 0.70/1.09 parent1[1]: (131) {G4,W7,D5,L2,V1,M2} { ! p( X ), p( skol2( skol2( skol2(
% 0.70/1.09 X ) ) ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 factor: (133) {G5,W2,D2,L1,V1,M1} { ! p( X ) }.
% 0.70/1.09 parent0[0, 1]: (132) {G5,W4,D2,L2,V1,M2} { ! p( X ), ! p( X ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (85) {G5,W2,D2,L1,V1,M1} R(78,25);r(49) { ! p( X ) }.
% 0.70/1.09 parent0: (133) {G5,W2,D2,L1,V1,M1} { ! p( X ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 0 ==> 0
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 resolution: (134) {G2,W0,D0,L0,V0,M0} { }.
% 0.70/1.09 parent0[0]: (85) {G5,W2,D2,L1,V1,M1} R(78,25);r(49) { ! p( X ) }.
% 0.70/1.09 parent1[0]: (7) {G1,W3,D3,L1,V1,M1} F(1) { p( skol1( X ) ) }.
% 0.70/1.09 substitution0:
% 0.70/1.09 X := skol1( X )
% 0.70/1.09 end
% 0.70/1.09 substitution1:
% 0.70/1.09 X := X
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 subsumption: (86) {G6,W0,D0,L0,V0,M0} R(85,7) { }.
% 0.70/1.09 parent0: (134) {G2,W0,D0,L0,V0,M0} { }.
% 0.70/1.09 substitution0:
% 0.70/1.09 end
% 0.70/1.09 permutation0:
% 0.70/1.09 end
% 0.70/1.09
% 0.70/1.09 Proof check complete!
% 0.70/1.09
% 0.70/1.09 Memory use:
% 0.70/1.09
% 0.70/1.09 space for terms: 1059
% 0.70/1.09 space for clauses: 3791
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 clauses generated: 203
% 0.70/1.09 clauses kept: 87
% 0.70/1.09 clauses selected: 21
% 0.70/1.09 clauses deleted: 2
% 0.70/1.09 clauses inuse deleted: 0
% 0.70/1.09
% 0.70/1.09 subsentry: 1070
% 0.70/1.09 literals s-matched: 508
% 0.70/1.09 literals matched: 504
% 0.70/1.09 full subsumption: 371
% 0.70/1.09
% 0.70/1.09 checksum: 251507258
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksem ended
%------------------------------------------------------------------------------