TSTP Solution File: NUN069+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : NUN069+2 : TPTP v8.1.0. Released v7.3.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 16:19:13 EDT 2022
% Result : Theorem 0.69s 1.10s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUN069+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Thu Jun 2 04:46:46 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10
% 0.69/1.10 { alpha1( skol1, X ), r1( X ) }.
% 0.69/1.10 { alpha1( skol1, X ), X = skol1 }.
% 0.69/1.10 { ! alpha1( X, Y ), ! r1( Y ) }.
% 0.69/1.10 { ! alpha1( X, Y ), ! Y = X }.
% 0.69/1.10 { r1( Y ), Y = X, alpha1( X, Y ) }.
% 0.69/1.10 { alpha2( X, skol2( X ), Y ), r2( X, Y ) }.
% 0.69/1.10 { alpha2( X, skol2( X ), Y ), Y = skol2( X ) }.
% 0.69/1.10 { ! alpha2( X, Y, Z ), ! r2( X, Z ) }.
% 0.69/1.10 { ! alpha2( X, Y, Z ), ! Z = Y }.
% 0.69/1.10 { r2( X, Z ), Z = Y, alpha2( X, Y, Z ) }.
% 0.69/1.10 { alpha3( X, Y, skol3( X, Y ), Z ), r3( X, Y, Z ) }.
% 0.69/1.10 { alpha3( X, Y, skol3( X, Y ), Z ), Z = skol3( X, Y ) }.
% 0.69/1.10 { ! alpha3( X, Y, Z, T ), ! r3( X, Y, T ) }.
% 0.69/1.10 { ! alpha3( X, Y, Z, T ), ! T = Z }.
% 0.69/1.10 { r3( X, Y, T ), T = Z, alpha3( X, Y, Z, T ) }.
% 0.69/1.10 { alpha4( X, Y, skol4( X, Y ), Z ), r4( X, Y, Z ) }.
% 0.69/1.10 { alpha4( X, Y, skol4( X, Y ), Z ), Z = skol4( X, Y ) }.
% 0.69/1.10 { ! alpha4( X, Y, Z, T ), ! r4( X, Y, T ) }.
% 0.69/1.10 { ! alpha4( X, Y, Z, T ), ! T = Z }.
% 0.69/1.10 { r4( X, Y, T ), T = Z, alpha4( X, Y, Z, T ) }.
% 0.69/1.10 { r2( Y, skol16( Z, Y ) ) }.
% 0.69/1.10 { r3( X, skol16( X, Y ), skol11( X, Y ) ) }.
% 0.69/1.10 { skol11( X, Y ) = skol5( X, Y ) }.
% 0.69/1.10 { r2( skol19( X, Y ), skol5( X, Y ) ) }.
% 0.69/1.10 { r3( X, Y, skol19( X, Y ) ) }.
% 0.69/1.10 { r2( Y, skol17( Z, Y ) ) }.
% 0.69/1.10 { r4( X, skol17( X, Y ), skol12( X, Y ) ) }.
% 0.69/1.10 { skol12( X, Y ) = skol6( X, Y ) }.
% 0.69/1.10 { r3( skol20( X, Y ), X, skol6( X, Y ) ) }.
% 0.69/1.10 { r4( X, Y, skol20( X, Y ) ) }.
% 0.69/1.10 { ! r2( X, T ), ! T = Z, ! r2( Y, Z ), X = Y }.
% 0.69/1.10 { r1( skol13( Y ) ) }.
% 0.69/1.10 { r3( X, skol13( X ), skol7( X ) ) }.
% 0.69/1.10 { skol7( X ) = X }.
% 0.69/1.10 { r1( skol14( Z ) ) }.
% 0.69/1.10 { skol8( Y ) = skol14( Y ) }.
% 0.69/1.10 { r1( skol18( Y ) ) }.
% 0.69/1.10 { r4( X, skol18( X ), skol8( X ) ) }.
% 0.69/1.10 { alpha5( X ), r2( skol15( Y ), skol9( Y ) ) }.
% 0.69/1.10 { alpha5( X ), X = skol9( X ) }.
% 0.69/1.10 { ! alpha5( X ), r1( skol10( Y ) ) }.
% 0.69/1.10 { ! alpha5( X ), X = skol10( X ) }.
% 0.69/1.10 { ! r1( Y ), ! X = Y, alpha5( X ) }.
% 0.69/1.10 { ! r1( Y ), ! Y = X, ! r2( Z, X ) }.
% 0.69/1.10 { ! X = X, ! r1( Y ), ! r2( Y, X ) }.
% 0.69/1.10
% 0.69/1.10 percentage equality = 0.280488, percentage horn = 0.688889
% 0.69/1.10 This is a problem with some equality
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Options Used:
% 0.69/1.10
% 0.69/1.10 useres = 1
% 0.69/1.10 useparamod = 1
% 0.69/1.10 useeqrefl = 1
% 0.69/1.10 useeqfact = 1
% 0.69/1.10 usefactor = 1
% 0.69/1.10 usesimpsplitting = 0
% 0.69/1.10 usesimpdemod = 5
% 0.69/1.10 usesimpres = 3
% 0.69/1.10
% 0.69/1.10 resimpinuse = 1000
% 0.69/1.10 resimpclauses = 20000
% 0.69/1.10 substype = eqrewr
% 0.69/1.10 backwardsubs = 1
% 0.69/1.10 selectoldest = 5
% 0.69/1.10
% 0.69/1.10 litorderings [0] = split
% 0.69/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.10
% 0.69/1.10 termordering = kbo
% 0.69/1.10
% 0.69/1.10 litapriori = 0
% 0.69/1.10 termapriori = 1
% 0.69/1.10 litaposteriori = 0
% 0.69/1.10 termaposteriori = 0
% 0.69/1.10 demodaposteriori = 0
% 0.69/1.10 ordereqreflfact = 0
% 0.69/1.10
% 0.69/1.10 litselect = negord
% 0.69/1.10
% 0.69/1.10 maxweight = 15
% 0.69/1.10 maxdepth = 30000
% 0.69/1.10 maxlength = 115
% 0.69/1.10 maxnrvars = 195
% 0.69/1.10 excuselevel = 1
% 0.69/1.10 increasemaxweight = 1
% 0.69/1.10
% 0.69/1.10 maxselected = 10000000
% 0.69/1.10 maxnrclauses = 10000000
% 0.69/1.10
% 0.69/1.10 showgenerated = 0
% 0.69/1.10 showkept = 0
% 0.69/1.10 showselected = 0
% 0.69/1.10 showdeleted = 0
% 0.69/1.10 showresimp = 1
% 0.69/1.10 showstatus = 2000
% 0.69/1.10
% 0.69/1.10 prologoutput = 0
% 0.69/1.10 nrgoals = 5000000
% 0.69/1.10 totalproof = 1
% 0.69/1.10
% 0.69/1.10 Symbols occurring in the translation:
% 0.69/1.10
% 0.69/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.10 . [1, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.69/1.10 ! [4, 1] (w:0, o:50, a:1, s:1, b:0),
% 0.69/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 r1 [37, 1] (w:1, o:55, a:1, s:1, b:0),
% 0.69/1.10 r2 [41, 2] (w:1, o:90, a:1, s:1, b:0),
% 0.69/1.10 r3 [46, 3] (w:1, o:102, a:1, s:1, b:0),
% 0.69/1.10 r4 [51, 3] (w:1, o:103, a:1, s:1, b:0),
% 0.69/1.10 alpha1 [82, 2] (w:1, o:91, a:1, s:1, b:1),
% 0.69/1.10 alpha2 [83, 3] (w:1, o:104, a:1, s:1, b:1),
% 0.69/1.10 alpha3 [84, 4] (w:1, o:105, a:1, s:1, b:1),
% 0.69/1.10 alpha4 [85, 4] (w:1, o:106, a:1, s:1, b:1),
% 0.69/1.10 alpha5 [86, 1] (w:1, o:56, a:1, s:1, b:1),
% 0.69/1.10 skol1 [87, 0] (w:1, o:49, a:1, s:1, b:1),
% 0.69/1.10 skol2 [88, 1] (w:1, o:62, a:1, s:1, b:1),
% 0.69/1.10 skol3 [89, 2] (w:1, o:93, a:1, s:1, b:1),
% 0.69/1.10 skol4 [90, 2] (w:1, o:94, a:1, s:1, b:1),
% 0.69/1.10 skol5 [91, 2] (w:1, o:95, a:1, s:1, b:1),
% 0.69/1.10 skol6 [92, 2] (w:1, o:96, a:1, s:1, b:1),
% 0.69/1.10 skol7 [93, 1] (w:1, o:63, a:1, s:1, b:1),
% 0.69/1.10 skol8 [94, 1] (w:1, o:64, a:1, s:1, b:1),
% 0.69/1.10 skol9 [95, 1] (w:1, o:65, a:1, s:1, b:1),
% 0.69/1.10 skol10 [96, 1] (w:1, o:57, a:1, s:1, b:1),
% 0.69/1.10 skol11 [97, 2] (w:1, o:97, a:1, s:1, b:1),
% 0.69/1.10 skol12 [98, 2] (w:1, o:98, a:1, s:1, b:1),
% 0.69/1.10 skol13 [99, 1] (w:1, o:58, a:1, s:1, b:1),
% 0.69/1.10 skol14 [100, 1] (w:1, o:59, a:1, s:1, b:1),
% 0.69/1.10 skol15 [101, 1] (w:1, o:60, a:1, s:1, b:1),
% 0.69/1.10 skol16 [102, 2] (w:1, o:99, a:1, s:1, b:1),
% 0.69/1.10 skol17 [103, 2] (w:1, o:100, a:1, s:1, b:1),
% 0.69/1.10 skol18 [104, 1] (w:1, o:61, a:1, s:1, b:1),
% 0.69/1.10 skol19 [105, 2] (w:1, o:101, a:1, s:1, b:1),
% 0.69/1.10 skol20 [106, 2] (w:1, o:92, a:1, s:1, b:1).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Starting Search:
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksems!, er is een bewijs:
% 0.69/1.10 % SZS status Theorem
% 0.69/1.10 % SZS output start Refutation
% 0.69/1.10
% 0.69/1.10 (0) {G0,W5,D2,L2,V1,M2} I { alpha1( skol1, X ), r1( X ) }.
% 0.69/1.10 (3) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), ! Y = X }.
% 0.69/1.10 (5) {G0,W8,D3,L2,V2,M2} I { alpha2( X, skol2( X ), Y ), r2( X, Y ) }.
% 0.69/1.10 (8) {G0,W7,D2,L2,V3,M2} I { ! alpha2( X, Y, Z ), ! Z = Y }.
% 0.69/1.10 (44) {G0,W5,D2,L2,V2,M2} I;q { ! r1( Y ), ! r2( Y, X ) }.
% 0.69/1.10 (45) {G1,W3,D2,L1,V1,M1} Q(3) { ! alpha1( X, X ) }.
% 0.69/1.10 (46) {G1,W4,D2,L1,V2,M1} Q(8) { ! alpha2( X, Y, Y ) }.
% 0.69/1.10 (52) {G2,W2,D2,L1,V0,M1} R(0,45) { r1( skol1 ) }.
% 0.69/1.10 (72) {G3,W3,D2,L1,V1,M1} R(44,52) { ! r2( skol1, X ) }.
% 0.69/1.10 (81) {G2,W4,D3,L1,V1,M1} R(5,46) { r2( X, skol2( X ) ) }.
% 0.69/1.10 (83) {G4,W0,D0,L0,V0,M0} R(81,72) { }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 % SZS output end Refutation
% 0.69/1.10 found a proof!
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Unprocessed initial clauses:
% 0.69/1.10
% 0.69/1.10 (85) {G0,W5,D2,L2,V1,M2} { alpha1( skol1, X ), r1( X ) }.
% 0.69/1.10 (86) {G0,W6,D2,L2,V1,M2} { alpha1( skol1, X ), X = skol1 }.
% 0.69/1.10 (87) {G0,W5,D2,L2,V2,M2} { ! alpha1( X, Y ), ! r1( Y ) }.
% 0.69/1.10 (88) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! Y = X }.
% 0.69/1.10 (89) {G0,W8,D2,L3,V2,M3} { r1( Y ), Y = X, alpha1( X, Y ) }.
% 0.69/1.10 (90) {G0,W8,D3,L2,V2,M2} { alpha2( X, skol2( X ), Y ), r2( X, Y ) }.
% 0.69/1.10 (91) {G0,W9,D3,L2,V2,M2} { alpha2( X, skol2( X ), Y ), Y = skol2( X ) }.
% 0.69/1.10 (92) {G0,W7,D2,L2,V3,M2} { ! alpha2( X, Y, Z ), ! r2( X, Z ) }.
% 0.69/1.10 (93) {G0,W7,D2,L2,V3,M2} { ! alpha2( X, Y, Z ), ! Z = Y }.
% 0.69/1.10 (94) {G0,W10,D2,L3,V3,M3} { r2( X, Z ), Z = Y, alpha2( X, Y, Z ) }.
% 0.69/1.10 (95) {G0,W11,D3,L2,V3,M2} { alpha3( X, Y, skol3( X, Y ), Z ), r3( X, Y, Z
% 0.69/1.10 ) }.
% 0.69/1.10 (96) {G0,W12,D3,L2,V3,M2} { alpha3( X, Y, skol3( X, Y ), Z ), Z = skol3( X
% 0.69/1.10 , Y ) }.
% 0.69/1.10 (97) {G0,W9,D2,L2,V4,M2} { ! alpha3( X, Y, Z, T ), ! r3( X, Y, T ) }.
% 0.69/1.10 (98) {G0,W8,D2,L2,V4,M2} { ! alpha3( X, Y, Z, T ), ! T = Z }.
% 0.69/1.10 (99) {G0,W12,D2,L3,V4,M3} { r3( X, Y, T ), T = Z, alpha3( X, Y, Z, T ) }.
% 0.69/1.10 (100) {G0,W11,D3,L2,V3,M2} { alpha4( X, Y, skol4( X, Y ), Z ), r4( X, Y, Z
% 0.69/1.10 ) }.
% 0.69/1.10 (101) {G0,W12,D3,L2,V3,M2} { alpha4( X, Y, skol4( X, Y ), Z ), Z = skol4(
% 0.69/1.10 X, Y ) }.
% 0.69/1.10 (102) {G0,W9,D2,L2,V4,M2} { ! alpha4( X, Y, Z, T ), ! r4( X, Y, T ) }.
% 0.69/1.10 (103) {G0,W8,D2,L2,V4,M2} { ! alpha4( X, Y, Z, T ), ! T = Z }.
% 0.69/1.10 (104) {G0,W12,D2,L3,V4,M3} { r4( X, Y, T ), T = Z, alpha4( X, Y, Z, T )
% 0.69/1.10 }.
% 0.69/1.10 (105) {G0,W5,D3,L1,V2,M1} { r2( Y, skol16( Z, Y ) ) }.
% 0.69/1.10 (106) {G0,W8,D3,L1,V2,M1} { r3( X, skol16( X, Y ), skol11( X, Y ) ) }.
% 0.69/1.10 (107) {G0,W7,D3,L1,V2,M1} { skol11( X, Y ) = skol5( X, Y ) }.
% 0.69/1.10 (108) {G0,W7,D3,L1,V2,M1} { r2( skol19( X, Y ), skol5( X, Y ) ) }.
% 0.69/1.10 (109) {G0,W6,D3,L1,V2,M1} { r3( X, Y, skol19( X, Y ) ) }.
% 0.69/1.10 (110) {G0,W5,D3,L1,V2,M1} { r2( Y, skol17( Z, Y ) ) }.
% 0.69/1.10 (111) {G0,W8,D3,L1,V2,M1} { r4( X, skol17( X, Y ), skol12( X, Y ) ) }.
% 0.69/1.10 (112) {G0,W7,D3,L1,V2,M1} { skol12( X, Y ) = skol6( X, Y ) }.
% 0.69/1.10 (113) {G0,W8,D3,L1,V2,M1} { r3( skol20( X, Y ), X, skol6( X, Y ) ) }.
% 0.69/1.10 (114) {G0,W6,D3,L1,V2,M1} { r4( X, Y, skol20( X, Y ) ) }.
% 0.69/1.10 (115) {G0,W12,D2,L4,V4,M4} { ! r2( X, T ), ! T = Z, ! r2( Y, Z ), X = Y
% 0.69/1.10 }.
% 0.69/1.10 (116) {G0,W3,D3,L1,V1,M1} { r1( skol13( Y ) ) }.
% 0.69/1.10 (117) {G0,W6,D3,L1,V1,M1} { r3( X, skol13( X ), skol7( X ) ) }.
% 0.69/1.10 (118) {G0,W4,D3,L1,V1,M1} { skol7( X ) = X }.
% 0.69/1.10 (119) {G0,W3,D3,L1,V1,M1} { r1( skol14( Z ) ) }.
% 0.69/1.10 (120) {G0,W5,D3,L1,V1,M1} { skol8( Y ) = skol14( Y ) }.
% 0.69/1.10 (121) {G0,W3,D3,L1,V1,M1} { r1( skol18( Y ) ) }.
% 0.69/1.10 (122) {G0,W6,D3,L1,V1,M1} { r4( X, skol18( X ), skol8( X ) ) }.
% 0.69/1.10 (123) {G0,W7,D3,L2,V2,M2} { alpha5( X ), r2( skol15( Y ), skol9( Y ) ) }.
% 0.69/1.10 (124) {G0,W6,D3,L2,V1,M2} { alpha5( X ), X = skol9( X ) }.
% 0.69/1.10 (125) {G0,W5,D3,L2,V2,M2} { ! alpha5( X ), r1( skol10( Y ) ) }.
% 0.69/1.10 (126) {G0,W6,D3,L2,V1,M2} { ! alpha5( X ), X = skol10( X ) }.
% 0.69/1.10 (127) {G0,W7,D2,L3,V2,M3} { ! r1( Y ), ! X = Y, alpha5( X ) }.
% 0.69/1.10 (128) {G0,W8,D2,L3,V3,M3} { ! r1( Y ), ! Y = X, ! r2( Z, X ) }.
% 0.69/1.10 (129) {G0,W8,D2,L3,V2,M3} { ! X = X, ! r1( Y ), ! r2( Y, X ) }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Total Proof:
% 0.69/1.10
% 0.69/1.10 subsumption: (0) {G0,W5,D2,L2,V1,M2} I { alpha1( skol1, X ), r1( X ) }.
% 0.69/1.10 parent0: (85) {G0,W5,D2,L2,V1,M2} { alpha1( skol1, X ), r1( X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (3) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), ! Y = X }.
% 0.69/1.10 parent0: (88) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! Y = X }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (5) {G0,W8,D3,L2,V2,M2} I { alpha2( X, skol2( X ), Y ), r2( X
% 0.69/1.10 , Y ) }.
% 0.69/1.10 parent0: (90) {G0,W8,D3,L2,V2,M2} { alpha2( X, skol2( X ), Y ), r2( X, Y )
% 0.69/1.10 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (8) {G0,W7,D2,L2,V3,M2} I { ! alpha2( X, Y, Z ), ! Z = Y }.
% 0.69/1.10 parent0: (93) {G0,W7,D2,L2,V3,M2} { ! alpha2( X, Y, Z ), ! Z = Y }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 Z := Z
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqrefl: (163) {G0,W5,D2,L2,V2,M2} { ! r1( Y ), ! r2( Y, X ) }.
% 0.69/1.10 parent0[0]: (129) {G0,W8,D2,L3,V2,M3} { ! X = X, ! r1( Y ), ! r2( Y, X )
% 0.69/1.10 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (44) {G0,W5,D2,L2,V2,M2} I;q { ! r1( Y ), ! r2( Y, X ) }.
% 0.69/1.10 parent0: (163) {G0,W5,D2,L2,V2,M2} { ! r1( Y ), ! r2( Y, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (164) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! alpha1( Y, X ) }.
% 0.69/1.10 parent0[1]: (3) {G0,W6,D2,L2,V2,M2} I { ! alpha1( X, Y ), ! Y = X }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := Y
% 0.69/1.10 Y := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqrefl: (165) {G0,W3,D2,L1,V1,M1} { ! alpha1( X, X ) }.
% 0.69/1.10 parent0[0]: (164) {G0,W6,D2,L2,V2,M2} { ! Y = X, ! alpha1( Y, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (45) {G1,W3,D2,L1,V1,M1} Q(3) { ! alpha1( X, X ) }.
% 0.69/1.10 parent0: (165) {G0,W3,D2,L1,V1,M1} { ! alpha1( X, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqswap: (166) {G0,W7,D2,L2,V3,M2} { ! Y = X, ! alpha2( Z, Y, X ) }.
% 0.69/1.10 parent0[1]: (8) {G0,W7,D2,L2,V3,M2} I { ! alpha2( X, Y, Z ), ! Z = Y }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := Z
% 0.69/1.10 Y := Y
% 0.69/1.10 Z := X
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 eqrefl: (167) {G0,W4,D2,L1,V2,M1} { ! alpha2( Y, X, X ) }.
% 0.69/1.10 parent0[0]: (166) {G0,W7,D2,L2,V3,M2} { ! Y = X, ! alpha2( Z, Y, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := X
% 0.69/1.10 Z := Y
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (46) {G1,W4,D2,L1,V2,M1} Q(8) { ! alpha2( X, Y, Y ) }.
% 0.69/1.10 parent0: (167) {G0,W4,D2,L1,V2,M1} { ! alpha2( Y, X, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := Y
% 0.69/1.10 Y := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (168) {G1,W2,D2,L1,V0,M1} { r1( skol1 ) }.
% 0.69/1.10 parent0[0]: (45) {G1,W3,D2,L1,V1,M1} Q(3) { ! alpha1( X, X ) }.
% 0.69/1.10 parent1[0]: (0) {G0,W5,D2,L2,V1,M2} I { alpha1( skol1, X ), r1( X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := skol1
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := skol1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (52) {G2,W2,D2,L1,V0,M1} R(0,45) { r1( skol1 ) }.
% 0.69/1.10 parent0: (168) {G1,W2,D2,L1,V0,M1} { r1( skol1 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (169) {G1,W3,D2,L1,V1,M1} { ! r2( skol1, X ) }.
% 0.69/1.10 parent0[0]: (44) {G0,W5,D2,L2,V2,M2} I;q { ! r1( Y ), ! r2( Y, X ) }.
% 0.69/1.10 parent1[0]: (52) {G2,W2,D2,L1,V0,M1} R(0,45) { r1( skol1 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := skol1
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (72) {G3,W3,D2,L1,V1,M1} R(44,52) { ! r2( skol1, X ) }.
% 0.69/1.10 parent0: (169) {G1,W3,D2,L1,V1,M1} { ! r2( skol1, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (170) {G1,W4,D3,L1,V1,M1} { r2( X, skol2( X ) ) }.
% 0.69/1.10 parent0[0]: (46) {G1,W4,D2,L1,V2,M1} Q(8) { ! alpha2( X, Y, Y ) }.
% 0.69/1.10 parent1[0]: (5) {G0,W8,D3,L2,V2,M2} I { alpha2( X, skol2( X ), Y ), r2( X,
% 0.69/1.10 Y ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := skol2( X )
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := X
% 0.69/1.10 Y := skol2( X )
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (81) {G2,W4,D3,L1,V1,M1} R(5,46) { r2( X, skol2( X ) ) }.
% 0.69/1.10 parent0: (170) {G1,W4,D3,L1,V1,M1} { r2( X, skol2( X ) ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (171) {G3,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 parent0[0]: (72) {G3,W3,D2,L1,V1,M1} R(44,52) { ! r2( skol1, X ) }.
% 0.69/1.10 parent1[0]: (81) {G2,W4,D3,L1,V1,M1} R(5,46) { r2( X, skol2( X ) ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := skol2( skol1 )
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := skol1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (83) {G4,W0,D0,L0,V0,M0} R(81,72) { }.
% 0.69/1.10 parent0: (171) {G3,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 Proof check complete!
% 0.69/1.10
% 0.69/1.10 Memory use:
% 0.69/1.10
% 0.69/1.10 space for terms: 1343
% 0.69/1.10 space for clauses: 4804
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 clauses generated: 160
% 0.69/1.10 clauses kept: 84
% 0.69/1.10 clauses selected: 32
% 0.69/1.10 clauses deleted: 0
% 0.69/1.10 clauses inuse deleted: 0
% 0.69/1.10
% 0.69/1.10 subsentry: 202
% 0.69/1.10 literals s-matched: 170
% 0.69/1.10 literals matched: 170
% 0.69/1.10 full subsumption: 14
% 0.69/1.10
% 0.69/1.10 checksum: -2069979801
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksem ended
%------------------------------------------------------------------------------