TSTP Solution File: SYN417+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN417+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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 : Thu Jul 21 02:50:31 EDT 2022
% Result : Theorem 0.82s 1.19s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN417+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Tue Jul 12 02:51:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.82/1.19 *** allocated 10000 integers for termspace/termends
% 0.82/1.19 *** allocated 10000 integers for clauses
% 0.82/1.19 *** allocated 10000 integers for justifications
% 0.82/1.19 Bliksem 1.12
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Automatic Strategy Selection
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Clauses:
% 0.82/1.19
% 0.82/1.19 { alpha4, skol1 = g( f( skol1 ) ) }.
% 0.82/1.19 { alpha4, alpha2( skol1 ) }.
% 0.82/1.19 { alpha4, ! alpha1 }.
% 0.82/1.19 { ! alpha4, alpha1 }.
% 0.82/1.19 { ! alpha4, ! X = g( f( X ) ), ! alpha2( X ) }.
% 0.82/1.19 { ! alpha1, skol2 = g( f( skol2 ) ), alpha4 }.
% 0.82/1.19 { ! alpha1, alpha2( skol2 ), alpha4 }.
% 0.82/1.19 { ! alpha2( X ), ! Y = g( f( Y ) ), X = Y }.
% 0.82/1.19 { skol3( Y ) = g( f( skol3( Y ) ) ), alpha2( X ) }.
% 0.82/1.19 { ! X = skol3( X ), alpha2( X ) }.
% 0.82/1.19 { ! alpha1, skol4 = f( g( skol4 ) ) }.
% 0.82/1.19 { ! alpha1, alpha3( skol4 ) }.
% 0.82/1.19 { ! X = f( g( X ) ), ! alpha3( X ), alpha1 }.
% 0.82/1.19 { ! alpha3( X ), ! Y = f( g( Y ) ), X = Y }.
% 0.82/1.19 { skol5( Y ) = f( g( skol5( Y ) ) ), alpha3( X ) }.
% 0.82/1.19 { ! X = skol5( X ), alpha3( X ) }.
% 0.82/1.19
% 0.82/1.19 percentage equality = 0.375000, percentage horn = 0.714286
% 0.82/1.19 This is a problem with some equality
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Options Used:
% 0.82/1.19
% 0.82/1.19 useres = 1
% 0.82/1.19 useparamod = 1
% 0.82/1.19 useeqrefl = 1
% 0.82/1.19 useeqfact = 1
% 0.82/1.19 usefactor = 1
% 0.82/1.19 usesimpsplitting = 0
% 0.82/1.19 usesimpdemod = 5
% 0.82/1.19 usesimpres = 3
% 0.82/1.19
% 0.82/1.19 resimpinuse = 1000
% 0.82/1.19 resimpclauses = 20000
% 0.82/1.19 substype = eqrewr
% 0.82/1.19 backwardsubs = 1
% 0.82/1.19 selectoldest = 5
% 0.82/1.19
% 0.82/1.19 litorderings [0] = split
% 0.82/1.19 litorderings [1] = extend the termordering, first sorting on arguments
% 0.82/1.19
% 0.82/1.19 termordering = kbo
% 0.82/1.19
% 0.82/1.19 litapriori = 0
% 0.82/1.19 termapriori = 1
% 0.82/1.19 litaposteriori = 0
% 0.82/1.19 termaposteriori = 0
% 0.82/1.19 demodaposteriori = 0
% 0.82/1.19 ordereqreflfact = 0
% 0.82/1.19
% 0.82/1.19 litselect = negord
% 0.82/1.19
% 0.82/1.19 maxweight = 15
% 0.82/1.19 maxdepth = 30000
% 0.82/1.19 maxlength = 115
% 0.82/1.19 maxnrvars = 195
% 0.82/1.19 excuselevel = 1
% 0.82/1.19 increasemaxweight = 1
% 0.82/1.19
% 0.82/1.19 maxselected = 10000000
% 0.82/1.19 maxnrclauses = 10000000
% 0.82/1.19
% 0.82/1.19 showgenerated = 0
% 0.82/1.19 showkept = 0
% 0.82/1.19 showselected = 0
% 0.82/1.19 showdeleted = 0
% 0.82/1.19 showresimp = 1
% 0.82/1.19 showstatus = 2000
% 0.82/1.19
% 0.82/1.19 prologoutput = 0
% 0.82/1.19 nrgoals = 5000000
% 0.82/1.19 totalproof = 1
% 0.82/1.19
% 0.82/1.19 Symbols occurring in the translation:
% 0.82/1.19
% 0.82/1.19 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.82/1.19 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.82/1.19 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.82/1.19 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.82/1.19 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.82/1.19 g [36, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.82/1.19 f [37, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.82/1.19 alpha1 [39, 0] (w:1, o:8, a:1, s:1, b:1),
% 0.82/1.19 alpha2 [40, 1] (w:1, o:20, a:1, s:1, b:1),
% 0.82/1.19 alpha3 [41, 1] (w:1, o:21, a:1, s:1, b:1),
% 0.82/1.19 alpha4 [42, 0] (w:1, o:9, a:1, s:1, b:1),
% 0.82/1.19 skol1 [43, 0] (w:1, o:10, a:1, s:1, b:1),
% 0.82/1.19 skol2 [44, 0] (w:1, o:11, a:1, s:1, b:1),
% 0.82/1.19 skol3 [45, 1] (w:1, o:22, a:1, s:1, b:1),
% 0.82/1.19 skol4 [46, 0] (w:1, o:12, a:1, s:1, b:1),
% 0.82/1.19 skol5 [47, 1] (w:1, o:23, a:1, s:1, b:1).
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Starting Search:
% 0.82/1.19
% 0.82/1.19 *** allocated 15000 integers for clauses
% 0.82/1.19 *** allocated 22500 integers for clauses
% 0.82/1.19 *** allocated 33750 integers for clauses
% 0.82/1.19 *** allocated 15000 integers for termspace/termends
% 0.82/1.19 *** allocated 50625 integers for clauses
% 0.82/1.19 Resimplifying inuse:
% 0.82/1.19 Done
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Bliksems!, er is een bewijs:
% 0.82/1.19 % SZS status Theorem
% 0.82/1.19 % SZS output start Refutation
% 0.82/1.19
% 0.82/1.19 (0) {G0,W6,D4,L2,V0,M2} I { alpha4, g( f( skol1 ) ) ==> skol1 }.
% 0.82/1.19 (1) {G0,W3,D2,L2,V0,M2} I { alpha4, alpha2( skol1 ) }.
% 0.82/1.19 (2) {G0,W2,D1,L2,V0,M2} I { alpha4, ! alpha1 }.
% 0.82/1.19 (3) {G0,W2,D1,L2,V0,M2} I { ! alpha4, alpha1 }.
% 0.82/1.19 (4) {G0,W8,D4,L3,V1,M3} I { ! alpha4, ! g( f( X ) ) ==> X, ! alpha2( X )
% 0.82/1.19 }.
% 0.82/1.19 (5) {G0,W10,D4,L3,V2,M3} I { ! alpha2( X ), ! g( f( Y ) ) ==> Y, X = Y }.
% 0.82/1.19 (6) {G0,W9,D5,L2,V2,M2} I { g( f( skol3( Y ) ) ) ==> skol3( Y ), alpha2( X
% 0.82/1.19 ) }.
% 0.82/1.19 (7) {G0,W6,D3,L2,V1,M2} I { ! skol3( X ) ==> X, alpha2( X ) }.
% 0.82/1.19 (8) {G0,W6,D4,L2,V0,M2} I { ! alpha1, f( g( skol4 ) ) ==> skol4 }.
% 0.82/1.19 (9) {G0,W3,D2,L2,V0,M2} I { ! alpha1, alpha3( skol4 ) }.
% 0.82/1.19 (10) {G0,W8,D4,L3,V1,M3} I { ! f( g( X ) ) ==> X, ! alpha3( X ), alpha1 }.
% 0.82/1.19 (11) {G0,W10,D4,L3,V2,M3} I { ! alpha3( X ), ! f( g( Y ) ) ==> Y, X = Y }.
% 0.82/1.19 (12) {G0,W9,D5,L2,V2,M2} I { f( g( skol5( Y ) ) ) ==> skol5( Y ), alpha3( X
% 0.82/1.19 ) }.
% 0.82/1.19 (13) {G0,W6,D3,L2,V1,M2} I { ! skol5( X ) ==> X, alpha3( X ) }.
% 0.82/1.19 (14) {G1,W3,D2,L2,V0,M2} R(9,3) { alpha3( skol4 ), ! alpha4 }.
% 0.82/1.19 (18) {G1,W6,D4,L2,V0,M2} R(0,3) { g( f( skol1 ) ) ==> skol1, alpha1 }.
% 0.82/1.19 (25) {G1,W6,D4,L2,V0,M2} R(8,3) { f( g( skol4 ) ) ==> skol4, ! alpha4 }.
% 0.82/1.19 (26) {G1,W4,D3,L2,V0,M2} P(8,4);q;r(2) { ! alpha2( g( skol4 ) ), ! alpha1
% 0.82/1.19 }.
% 0.82/1.19 (30) {G2,W4,D3,L2,V0,M2} R(26,3) { ! alpha2( g( skol4 ) ), ! alpha4 }.
% 0.82/1.19 (31) {G3,W7,D4,L2,V0,M2} R(30,7) { ! alpha4, ! skol3( g( skol4 ) ) ==> g(
% 0.82/1.19 skol4 ) }.
% 0.82/1.19 (33) {G1,W12,D4,L3,V2,M3} R(5,7) { ! g( f( X ) ) ==> X, Y = X, ! skol3( Y )
% 0.82/1.19 ==> Y }.
% 0.82/1.19 (36) {G1,W6,D2,L3,V1,M3} R(5,0) { ! alpha2( X ), X = skol1, alpha4 }.
% 0.82/1.19 (37) {G1,W9,D4,L3,V1,M3} R(5,1) { ! g( f( X ) ) ==> X, skol1 = X, alpha4
% 0.82/1.19 }.
% 0.82/1.19 (94) {G2,W9,D3,L4,V1,M4} P(36,13) { ! skol1 = X, alpha3( X ), ! alpha2(
% 0.82/1.19 skol5( X ) ), alpha4 }.
% 0.82/1.19 (96) {G3,W6,D3,L3,V0,M3} Q(94) { alpha3( skol1 ), ! alpha2( skol5( skol1 )
% 0.82/1.19 ), alpha4 }.
% 0.82/1.19 (112) {G3,W8,D5,L2,V1,M2} R(6,30) { g( f( skol3( X ) ) ) ==> skol3( X ), !
% 0.82/1.19 alpha4 }.
% 0.82/1.19 (193) {G1,W17,D6,L5,V2,M5} P(11,10) { ! Y = X, ! alpha3( X ), alpha1, !
% 0.82/1.19 alpha3( Y ), ! f( g( f( g( X ) ) ) ) ==> f( g( X ) ) }.
% 0.82/1.19 (223) {G2,W7,D3,L3,V1,M3} P(11,18);d(18);q { g( X ) ==> skol1, alpha1, !
% 0.82/1.19 alpha3( X ) }.
% 0.82/1.19 (254) {G3,W3,D2,L2,V1,M2} F(193);q;d(223);d(18);q { ! alpha3( X ), alpha1
% 0.82/1.19 }.
% 0.82/1.19 (258) {G4,W4,D3,L2,V0,M2} R(254,96);r(2) { ! alpha2( skol5( skol1 ) ),
% 0.82/1.19 alpha4 }.
% 0.82/1.19 (262) {G4,W4,D2,L2,V1,M2} R(254,9) { ! alpha3( X ), alpha3( skol4 ) }.
% 0.82/1.19 (263) {G4,W3,D2,L2,V1,M2} R(254,2) { ! alpha3( X ), alpha4 }.
% 0.82/1.19 (267) {G5,W6,D3,L2,V1,M2} R(262,13) { alpha3( skol4 ), ! skol5( X ) ==> X
% 0.82/1.19 }.
% 0.82/1.19 (276) {G5,W8,D5,L2,V1,M2} R(12,263) { f( g( skol5( X ) ) ) ==> skol5( X ),
% 0.82/1.19 alpha4 }.
% 0.82/1.19 (877) {G4,W9,D3,L3,V1,M3} P(33,31);d(112);q { ! alpha4, ! X = g( skol4 ), !
% 0.82/1.19 skol3( X ) ==> X }.
% 0.82/1.19 (891) {G5,W5,D3,L2,V1,M2} P(25,33);q;r(877) { ! skol3( X ) ==> X, ! alpha4
% 0.82/1.19 }.
% 0.82/1.19 (929) {G6,W6,D2,L3,V2,M3} P(5,891);d(112);q { ! Y = X, ! alpha4, ! alpha2(
% 0.82/1.19 Y ) }.
% 0.82/1.19 (930) {G7,W3,D2,L2,V1,M2} Q(929) { ! alpha4, ! alpha2( X ) }.
% 0.82/1.19 (958) {G8,W5,D3,L2,V1,M2} R(930,258) { ! alpha2( X ), ! alpha2( skol5(
% 0.82/1.19 skol1 ) ) }.
% 0.82/1.19 (963) {G9,W3,D3,L1,V0,M1} F(958) { ! alpha2( skol5( skol1 ) ) }.
% 0.82/1.19 (966) {G10,W7,D5,L1,V1,M1} R(963,6) { g( f( skol3( X ) ) ) ==> skol3( X )
% 0.82/1.19 }.
% 0.82/1.19 (1004) {G5,W6,D4,L2,V1,M2} P(12,37);q;r(263) { g( skol5( X ) ) ==> skol1,
% 0.82/1.19 alpha4 }.
% 0.82/1.19 (1005) {G6,W6,D3,L2,V1,M2} P(37,12);d(276);d(1004);q;r(263) { f( skol1 ) =
% 0.82/1.19 skol5( X ), alpha4 }.
% 0.82/1.19 (1088) {G7,W5,D3,L2,V1,M2} P(1005,267);r(263) { ! f( skol1 ) = X, alpha4
% 0.82/1.19 }.
% 0.82/1.19 (1091) {G8,W1,D1,L1,V0,M1} Q(1088) { alpha4 }.
% 0.82/1.19 (1093) {G9,W4,D3,L1,V1,M1} R(1091,891) { ! skol3( X ) ==> X }.
% 0.82/1.19 (1095) {G9,W2,D2,L1,V0,M1} R(1091,14) { alpha3( skol4 ) }.
% 0.82/1.19 (1129) {G11,W7,D3,L2,V2,M2} P(11,966);d(966);q { g( Y ) = skol3( X ), !
% 0.82/1.19 alpha3( Y ) }.
% 0.82/1.19 (1139) {G12,W6,D3,L2,V2,M2} P(1129,1093) { ! g( Y ) = X, ! alpha3( Y ) }.
% 0.82/1.19 (1146) {G13,W2,D2,L1,V1,M1} Q(1139) { ! alpha3( X ) }.
% 0.82/1.19 (1147) {G14,W0,D0,L0,V0,M0} R(1146,1095) { }.
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 % SZS output end Refutation
% 0.82/1.19 found a proof!
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Unprocessed initial clauses:
% 0.82/1.19
% 0.82/1.19 (1149) {G0,W6,D4,L2,V0,M2} { alpha4, skol1 = g( f( skol1 ) ) }.
% 0.82/1.19 (1150) {G0,W3,D2,L2,V0,M2} { alpha4, alpha2( skol1 ) }.
% 0.82/1.19 (1151) {G0,W2,D1,L2,V0,M2} { alpha4, ! alpha1 }.
% 0.82/1.19 (1152) {G0,W2,D1,L2,V0,M2} { ! alpha4, alpha1 }.
% 0.82/1.19 (1153) {G0,W8,D4,L3,V1,M3} { ! alpha4, ! X = g( f( X ) ), ! alpha2( X )
% 0.82/1.19 }.
% 0.82/1.19 (1154) {G0,W7,D4,L3,V0,M3} { ! alpha1, skol2 = g( f( skol2 ) ), alpha4 }.
% 0.82/1.19 (1155) {G0,W4,D2,L3,V0,M3} { ! alpha1, alpha2( skol2 ), alpha4 }.
% 0.82/1.19 (1156) {G0,W10,D4,L3,V2,M3} { ! alpha2( X ), ! Y = g( f( Y ) ), X = Y }.
% 0.82/1.19 (1157) {G0,W9,D5,L2,V2,M2} { skol3( Y ) = g( f( skol3( Y ) ) ), alpha2( X
% 0.82/1.19 ) }.
% 0.82/1.19 (1158) {G0,W6,D3,L2,V1,M2} { ! X = skol3( X ), alpha2( X ) }.
% 0.82/1.19 (1159) {G0,W6,D4,L2,V0,M2} { ! alpha1, skol4 = f( g( skol4 ) ) }.
% 0.82/1.19 (1160) {G0,W3,D2,L2,V0,M2} { ! alpha1, alpha3( skol4 ) }.
% 0.82/1.19 (1161) {G0,W8,D4,L3,V1,M3} { ! X = f( g( X ) ), ! alpha3( X ), alpha1 }.
% 0.82/1.19 (1162) {G0,W10,D4,L3,V2,M3} { ! alpha3( X ), ! Y = f( g( Y ) ), X = Y }.
% 0.82/1.19 (1163) {G0,W9,D5,L2,V2,M2} { skol5( Y ) = f( g( skol5( Y ) ) ), alpha3( X
% 0.82/1.19 ) }.
% 0.82/1.19 (1164) {G0,W6,D3,L2,V1,M2} { ! X = skol5( X ), alpha3( X ) }.
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Total Proof:
% 0.82/1.19
% 0.82/1.19 eqswap: (1165) {G0,W6,D4,L2,V0,M2} { g( f( skol1 ) ) = skol1, alpha4 }.
% 0.82/1.19 parent0[1]: (1149) {G0,W6,D4,L2,V0,M2} { alpha4, skol1 = g( f( skol1 ) )
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (0) {G0,W6,D4,L2,V0,M2} I { alpha4, g( f( skol1 ) ) ==> skol1
% 0.82/1.19 }.
% 0.82/1.19 parent0: (1165) {G0,W6,D4,L2,V0,M2} { g( f( skol1 ) ) = skol1, alpha4 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 1
% 0.82/1.19 1 ==> 0
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (1) {G0,W3,D2,L2,V0,M2} I { alpha4, alpha2( skol1 ) }.
% 0.82/1.19 parent0: (1150) {G0,W3,D2,L2,V0,M2} { alpha4, alpha2( skol1 ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (2) {G0,W2,D1,L2,V0,M2} I { alpha4, ! alpha1 }.
% 0.82/1.19 parent0: (1151) {G0,W2,D1,L2,V0,M2} { alpha4, ! alpha1 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (3) {G0,W2,D1,L2,V0,M2} I { ! alpha4, alpha1 }.
% 0.82/1.19 parent0: (1152) {G0,W2,D1,L2,V0,M2} { ! alpha4, alpha1 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1170) {G0,W8,D4,L3,V1,M3} { ! g( f( X ) ) = X, ! alpha4, ! alpha2
% 0.82/1.19 ( X ) }.
% 0.82/1.19 parent0[1]: (1153) {G0,W8,D4,L3,V1,M3} { ! alpha4, ! X = g( f( X ) ), !
% 0.82/1.19 alpha2( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (4) {G0,W8,D4,L3,V1,M3} I { ! alpha4, ! g( f( X ) ) ==> X, !
% 0.82/1.19 alpha2( X ) }.
% 0.82/1.19 parent0: (1170) {G0,W8,D4,L3,V1,M3} { ! g( f( X ) ) = X, ! alpha4, !
% 0.82/1.19 alpha2( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 1
% 0.82/1.19 1 ==> 0
% 0.82/1.19 2 ==> 2
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1174) {G0,W10,D4,L3,V2,M3} { ! g( f( X ) ) = X, ! alpha2( Y ), Y
% 0.82/1.19 = X }.
% 0.82/1.19 parent0[1]: (1156) {G0,W10,D4,L3,V2,M3} { ! alpha2( X ), ! Y = g( f( Y ) )
% 0.82/1.19 , X = Y }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (5) {G0,W10,D4,L3,V2,M3} I { ! alpha2( X ), ! g( f( Y ) ) ==>
% 0.82/1.19 Y, X = Y }.
% 0.82/1.19 parent0: (1174) {G0,W10,D4,L3,V2,M3} { ! g( f( X ) ) = X, ! alpha2( Y ), Y
% 0.82/1.19 = X }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 1
% 0.82/1.19 1 ==> 0
% 0.82/1.19 2 ==> 2
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 *** allocated 22500 integers for termspace/termends
% 0.82/1.19 eqswap: (1183) {G0,W9,D5,L2,V2,M2} { g( f( skol3( X ) ) ) = skol3( X ),
% 0.82/1.19 alpha2( Y ) }.
% 0.82/1.19 parent0[0]: (1157) {G0,W9,D5,L2,V2,M2} { skol3( Y ) = g( f( skol3( Y ) ) )
% 0.82/1.19 , alpha2( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (6) {G0,W9,D5,L2,V2,M2} I { g( f( skol3( Y ) ) ) ==> skol3( Y
% 0.82/1.19 ), alpha2( X ) }.
% 0.82/1.19 parent0: (1183) {G0,W9,D5,L2,V2,M2} { g( f( skol3( X ) ) ) = skol3( X ),
% 0.82/1.19 alpha2( Y ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1191) {G0,W6,D3,L2,V1,M2} { ! skol3( X ) = X, alpha2( X ) }.
% 0.82/1.19 parent0[0]: (1158) {G0,W6,D3,L2,V1,M2} { ! X = skol3( X ), alpha2( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (7) {G0,W6,D3,L2,V1,M2} I { ! skol3( X ) ==> X, alpha2( X )
% 0.82/1.19 }.
% 0.82/1.19 parent0: (1191) {G0,W6,D3,L2,V1,M2} { ! skol3( X ) = X, alpha2( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1200) {G0,W6,D4,L2,V0,M2} { f( g( skol4 ) ) = skol4, ! alpha1 }.
% 0.82/1.19 parent0[1]: (1159) {G0,W6,D4,L2,V0,M2} { ! alpha1, skol4 = f( g( skol4 ) )
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (8) {G0,W6,D4,L2,V0,M2} I { ! alpha1, f( g( skol4 ) ) ==>
% 0.82/1.19 skol4 }.
% 0.82/1.19 parent0: (1200) {G0,W6,D4,L2,V0,M2} { f( g( skol4 ) ) = skol4, ! alpha1
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 1
% 0.82/1.19 1 ==> 0
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (9) {G0,W3,D2,L2,V0,M2} I { ! alpha1, alpha3( skol4 ) }.
% 0.82/1.19 parent0: (1160) {G0,W3,D2,L2,V0,M2} { ! alpha1, alpha3( skol4 ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1219) {G0,W8,D4,L3,V1,M3} { ! f( g( X ) ) = X, ! alpha3( X ),
% 0.82/1.19 alpha1 }.
% 0.82/1.19 parent0[0]: (1161) {G0,W8,D4,L3,V1,M3} { ! X = f( g( X ) ), ! alpha3( X )
% 0.82/1.19 , alpha1 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (10) {G0,W8,D4,L3,V1,M3} I { ! f( g( X ) ) ==> X, ! alpha3( X
% 0.82/1.19 ), alpha1 }.
% 0.82/1.19 parent0: (1219) {G0,W8,D4,L3,V1,M3} { ! f( g( X ) ) = X, ! alpha3( X ),
% 0.82/1.19 alpha1 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 2 ==> 2
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1230) {G0,W10,D4,L3,V2,M3} { ! f( g( X ) ) = X, ! alpha3( Y ), Y
% 0.82/1.19 = X }.
% 0.82/1.19 parent0[1]: (1162) {G0,W10,D4,L3,V2,M3} { ! alpha3( X ), ! Y = f( g( Y ) )
% 0.82/1.19 , X = Y }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (11) {G0,W10,D4,L3,V2,M3} I { ! alpha3( X ), ! f( g( Y ) ) ==>
% 0.82/1.19 Y, X = Y }.
% 0.82/1.19 parent0: (1230) {G0,W10,D4,L3,V2,M3} { ! f( g( X ) ) = X, ! alpha3( Y ), Y
% 0.82/1.19 = X }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 1
% 0.82/1.19 1 ==> 0
% 0.82/1.19 2 ==> 2
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1246) {G0,W9,D5,L2,V2,M2} { f( g( skol5( X ) ) ) = skol5( X ),
% 0.82/1.19 alpha3( Y ) }.
% 0.82/1.19 parent0[0]: (1163) {G0,W9,D5,L2,V2,M2} { skol5( Y ) = f( g( skol5( Y ) ) )
% 0.82/1.19 , alpha3( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (12) {G0,W9,D5,L2,V2,M2} I { f( g( skol5( Y ) ) ) ==> skol5( Y
% 0.82/1.19 ), alpha3( X ) }.
% 0.82/1.19 parent0: (1246) {G0,W9,D5,L2,V2,M2} { f( g( skol5( X ) ) ) = skol5( X ),
% 0.82/1.19 alpha3( Y ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1261) {G0,W6,D3,L2,V1,M2} { ! skol5( X ) = X, alpha3( X ) }.
% 0.82/1.19 parent0[0]: (1164) {G0,W6,D3,L2,V1,M2} { ! X = skol5( X ), alpha3( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (13) {G0,W6,D3,L2,V1,M2} I { ! skol5( X ) ==> X, alpha3( X )
% 0.82/1.19 }.
% 0.82/1.19 parent0: (1261) {G0,W6,D3,L2,V1,M2} { ! skol5( X ) = X, alpha3( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (1262) {G1,W3,D2,L2,V0,M2} { alpha3( skol4 ), ! alpha4 }.
% 0.82/1.19 parent0[0]: (9) {G0,W3,D2,L2,V0,M2} I { ! alpha1, alpha3( skol4 ) }.
% 0.82/1.19 parent1[1]: (3) {G0,W2,D1,L2,V0,M2} I { ! alpha4, alpha1 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (14) {G1,W3,D2,L2,V0,M2} R(9,3) { alpha3( skol4 ), ! alpha4
% 0.82/1.19 }.
% 0.82/1.19 parent0: (1262) {G1,W3,D2,L2,V0,M2} { alpha3( skol4 ), ! alpha4 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1263) {G0,W6,D4,L2,V0,M2} { skol1 ==> g( f( skol1 ) ), alpha4 }.
% 0.82/1.19 parent0[1]: (0) {G0,W6,D4,L2,V0,M2} I { alpha4, g( f( skol1 ) ) ==> skol1
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (1264) {G1,W6,D4,L2,V0,M2} { alpha1, skol1 ==> g( f( skol1 ) )
% 0.82/1.19 }.
% 0.82/1.19 parent0[0]: (3) {G0,W2,D1,L2,V0,M2} I { ! alpha4, alpha1 }.
% 0.82/1.19 parent1[1]: (1263) {G0,W6,D4,L2,V0,M2} { skol1 ==> g( f( skol1 ) ), alpha4
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1265) {G1,W6,D4,L2,V0,M2} { g( f( skol1 ) ) ==> skol1, alpha1 }.
% 0.82/1.19 parent0[1]: (1264) {G1,W6,D4,L2,V0,M2} { alpha1, skol1 ==> g( f( skol1 ) )
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (18) {G1,W6,D4,L2,V0,M2} R(0,3) { g( f( skol1 ) ) ==> skol1,
% 0.82/1.19 alpha1 }.
% 0.82/1.19 parent0: (1265) {G1,W6,D4,L2,V0,M2} { g( f( skol1 ) ) ==> skol1, alpha1
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1266) {G0,W6,D4,L2,V0,M2} { skol4 ==> f( g( skol4 ) ), ! alpha1
% 0.82/1.19 }.
% 0.82/1.19 parent0[1]: (8) {G0,W6,D4,L2,V0,M2} I { ! alpha1, f( g( skol4 ) ) ==> skol4
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (1267) {G1,W6,D4,L2,V0,M2} { skol4 ==> f( g( skol4 ) ), !
% 0.82/1.19 alpha4 }.
% 0.82/1.19 parent0[1]: (1266) {G0,W6,D4,L2,V0,M2} { skol4 ==> f( g( skol4 ) ), !
% 0.82/1.19 alpha1 }.
% 0.82/1.19 parent1[1]: (3) {G0,W2,D1,L2,V0,M2} I { ! alpha4, alpha1 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1268) {G1,W6,D4,L2,V0,M2} { f( g( skol4 ) ) ==> skol4, ! alpha4
% 0.82/1.19 }.
% 0.82/1.19 parent0[0]: (1267) {G1,W6,D4,L2,V0,M2} { skol4 ==> f( g( skol4 ) ), !
% 0.82/1.19 alpha4 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (25) {G1,W6,D4,L2,V0,M2} R(8,3) { f( g( skol4 ) ) ==> skol4, !
% 0.82/1.19 alpha4 }.
% 0.82/1.19 parent0: (1268) {G1,W6,D4,L2,V0,M2} { f( g( skol4 ) ) ==> skol4, ! alpha4
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1270) {G0,W8,D4,L3,V1,M3} { ! X ==> g( f( X ) ), ! alpha4, !
% 0.82/1.19 alpha2( X ) }.
% 0.82/1.19 parent0[1]: (4) {G0,W8,D4,L3,V1,M3} I { ! alpha4, ! g( f( X ) ) ==> X, !
% 0.82/1.19 alpha2( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 paramod: (1271) {G1,W10,D3,L4,V0,M4} { ! g( skol4 ) ==> g( skol4 ), !
% 0.82/1.19 alpha1, ! alpha4, ! alpha2( g( skol4 ) ) }.
% 0.82/1.19 parent0[1]: (8) {G0,W6,D4,L2,V0,M2} I { ! alpha1, f( g( skol4 ) ) ==> skol4
% 0.82/1.19 }.
% 0.82/1.19 parent1[0; 5]: (1270) {G0,W8,D4,L3,V1,M3} { ! X ==> g( f( X ) ), ! alpha4
% 0.82/1.19 , ! alpha2( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 X := g( skol4 )
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqrefl: (1272) {G0,W5,D3,L3,V0,M3} { ! alpha1, ! alpha4, ! alpha2( g(
% 0.82/1.19 skol4 ) ) }.
% 0.82/1.19 parent0[0]: (1271) {G1,W10,D3,L4,V0,M4} { ! g( skol4 ) ==> g( skol4 ), !
% 0.82/1.19 alpha1, ! alpha4, ! alpha2( g( skol4 ) ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (1273) {G1,W5,D3,L3,V0,M3} { ! alpha1, ! alpha2( g( skol4 ) )
% 0.82/1.19 , ! alpha1 }.
% 0.82/1.19 parent0[1]: (1272) {G0,W5,D3,L3,V0,M3} { ! alpha1, ! alpha4, ! alpha2( g(
% 0.82/1.19 skol4 ) ) }.
% 0.82/1.19 parent1[0]: (2) {G0,W2,D1,L2,V0,M2} I { alpha4, ! alpha1 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 factor: (1274) {G1,W4,D3,L2,V0,M2} { ! alpha1, ! alpha2( g( skol4 ) ) }.
% 0.82/1.19 parent0[0, 2]: (1273) {G1,W5,D3,L3,V0,M3} { ! alpha1, ! alpha2( g( skol4 )
% 0.82/1.19 ), ! alpha1 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (26) {G1,W4,D3,L2,V0,M2} P(8,4);q;r(2) { ! alpha2( g( skol4 )
% 0.82/1.19 ), ! alpha1 }.
% 0.82/1.19 parent0: (1274) {G1,W4,D3,L2,V0,M2} { ! alpha1, ! alpha2( g( skol4 ) ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 1
% 0.82/1.19 1 ==> 0
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (1275) {G1,W4,D3,L2,V0,M2} { ! alpha2( g( skol4 ) ), ! alpha4
% 0.82/1.19 }.
% 0.82/1.19 parent0[1]: (26) {G1,W4,D3,L2,V0,M2} P(8,4);q;r(2) { ! alpha2( g( skol4 ) )
% 0.82/1.19 , ! alpha1 }.
% 0.82/1.19 parent1[1]: (3) {G0,W2,D1,L2,V0,M2} I { ! alpha4, alpha1 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (30) {G2,W4,D3,L2,V0,M2} R(26,3) { ! alpha2( g( skol4 ) ), !
% 0.82/1.19 alpha4 }.
% 0.82/1.19 parent0: (1275) {G1,W4,D3,L2,V0,M2} { ! alpha2( g( skol4 ) ), ! alpha4 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1276) {G0,W6,D3,L2,V1,M2} { ! X ==> skol3( X ), alpha2( X ) }.
% 0.82/1.19 parent0[0]: (7) {G0,W6,D3,L2,V1,M2} I { ! skol3( X ) ==> X, alpha2( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (1277) {G1,W7,D4,L2,V0,M2} { ! alpha4, ! g( skol4 ) ==> skol3
% 0.82/1.19 ( g( skol4 ) ) }.
% 0.82/1.19 parent0[0]: (30) {G2,W4,D3,L2,V0,M2} R(26,3) { ! alpha2( g( skol4 ) ), !
% 0.82/1.19 alpha4 }.
% 0.82/1.19 parent1[1]: (1276) {G0,W6,D3,L2,V1,M2} { ! X ==> skol3( X ), alpha2( X )
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 X := g( skol4 )
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1278) {G1,W7,D4,L2,V0,M2} { ! skol3( g( skol4 ) ) ==> g( skol4 )
% 0.82/1.19 , ! alpha4 }.
% 0.82/1.19 parent0[1]: (1277) {G1,W7,D4,L2,V0,M2} { ! alpha4, ! g( skol4 ) ==> skol3
% 0.82/1.19 ( g( skol4 ) ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (31) {G3,W7,D4,L2,V0,M2} R(30,7) { ! alpha4, ! skol3( g( skol4
% 0.82/1.19 ) ) ==> g( skol4 ) }.
% 0.82/1.19 parent0: (1278) {G1,W7,D4,L2,V0,M2} { ! skol3( g( skol4 ) ) ==> g( skol4 )
% 0.82/1.19 , ! alpha4 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 1
% 0.82/1.19 1 ==> 0
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1279) {G0,W10,D4,L3,V2,M3} { ! X ==> g( f( X ) ), ! alpha2( Y ),
% 0.82/1.19 Y = X }.
% 0.82/1.19 parent0[1]: (5) {G0,W10,D4,L3,V2,M3} I { ! alpha2( X ), ! g( f( Y ) ) ==> Y
% 0.82/1.19 , X = Y }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1282) {G0,W6,D3,L2,V1,M2} { ! X ==> skol3( X ), alpha2( X ) }.
% 0.82/1.19 parent0[0]: (7) {G0,W6,D3,L2,V1,M2} I { ! skol3( X ) ==> X, alpha2( X ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (1283) {G1,W12,D4,L3,V2,M3} { ! X ==> g( f( X ) ), Y = X, ! Y
% 0.82/1.19 ==> skol3( Y ) }.
% 0.82/1.19 parent0[1]: (1279) {G0,W10,D4,L3,V2,M3} { ! X ==> g( f( X ) ), ! alpha2( Y
% 0.82/1.19 ), Y = X }.
% 0.82/1.19 parent1[1]: (1282) {G0,W6,D3,L2,V1,M2} { ! X ==> skol3( X ), alpha2( X )
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 Y := Y
% 0.82/1.19 end
% 0.82/1.19 substitution1:
% 0.82/1.19 X := Y
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1286) {G1,W12,D4,L3,V2,M3} { ! skol3( X ) ==> X, ! Y ==> g( f( Y
% 0.82/1.19 ) ), X = Y }.
% 0.82/1.19 parent0[2]: (1283) {G1,W12,D4,L3,V2,M3} { ! X ==> g( f( X ) ), Y = X, ! Y
% 0.82/1.19 ==> skol3( Y ) }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1287) {G1,W12,D4,L3,V2,M3} { ! g( f( X ) ) ==> X, ! skol3( Y )
% 0.82/1.19 ==> Y, Y = X }.
% 0.82/1.19 parent0[1]: (1286) {G1,W12,D4,L3,V2,M3} { ! skol3( X ) ==> X, ! Y ==> g( f
% 0.82/1.19 ( Y ) ), X = Y }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 subsumption: (33) {G1,W12,D4,L3,V2,M3} R(5,7) { ! g( f( X ) ) ==> X, Y = X
% 0.82/1.19 , ! skol3( Y ) ==> Y }.
% 0.82/1.19 parent0: (1287) {G1,W12,D4,L3,V2,M3} { ! g( f( X ) ) ==> X, ! skol3( Y )
% 0.82/1.19 ==> Y, Y = X }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := X
% 0.82/1.19 Y := Y
% 0.82/1.19 end
% 0.82/1.19 permutation0:
% 0.82/1.19 0 ==> 0
% 0.82/1.19 1 ==> 2
% 0.82/1.19 2 ==> 1
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1291) {G0,W10,D4,L3,V2,M3} { ! X ==> g( f( X ) ), ! alpha2( Y ),
% 0.82/1.19 Y = X }.
% 0.82/1.19 parent0[1]: (5) {G0,W10,D4,L3,V2,M3} I { ! alpha2( X ), ! g( f( Y ) ) ==> Y
% 0.82/1.19 , X = Y }.
% 0.82/1.19 substitution0:
% 0.82/1.19 X := Y
% 0.82/1.19 Y := X
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 eqswap: (1294) {G0,W6,D4,L2,V0,M2} { skol1 ==> g( f( skol1 ) ), alpha4 }.
% 0.82/1.19 parent0[1]: (0) {G0,W6,D4,L2,V0,M2} I { alpha4, g( f( skol1 ) ) ==> skol1
% 0.82/1.19 }.
% 0.82/1.19 substitution0:
% 0.82/1.19 end
% 0.82/1.19
% 0.82/1.19 resolution: (1295) {G1,W6,D2,L3,V1,M3} { ! alpha2( X ), X = skol1, alpha4
% 0.82/1.19 }.
% 0.82/1.19 parent0[0]: (1291) {G0,W10,D4,L3,V2,M3} { ! X ==> g( f( X ) ), ! alpha2( Y
% 0.82/1.19 ), Y = X }.
% 0.82/1.19 parent1[0]: (1294) {G0,W6,D4,L2,V0,M2} { skol1 ==> g( f( skol1 ) ), alpha4
% 0.85/1.21 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := skol1
% 0.85/1.21 Y := X
% 0.85/1.21 end
% 0.85/1.21 substitution1:
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (36) {G1,W6,D2,L3,V1,M3} R(5,0) { ! alpha2( X ), X = skol1,
% 0.85/1.21 alpha4 }.
% 0.85/1.21 parent0: (1295) {G1,W6,D2,L3,V1,M3} { ! alpha2( X ), X = skol1, alpha4 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 1 ==> 1
% 0.85/1.21 2 ==> 2
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (1297) {G0,W10,D4,L3,V2,M3} { ! X ==> g( f( X ) ), ! alpha2( Y ),
% 0.85/1.21 Y = X }.
% 0.85/1.21 parent0[1]: (5) {G0,W10,D4,L3,V2,M3} I { ! alpha2( X ), ! g( f( Y ) ) ==> Y
% 0.85/1.21 , X = Y }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := Y
% 0.85/1.21 Y := X
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 resolution: (1300) {G1,W9,D4,L3,V1,M3} { ! X ==> g( f( X ) ), skol1 = X,
% 0.85/1.21 alpha4 }.
% 0.85/1.21 parent0[1]: (1297) {G0,W10,D4,L3,V2,M3} { ! X ==> g( f( X ) ), ! alpha2( Y
% 0.85/1.21 ), Y = X }.
% 0.85/1.21 parent1[1]: (1) {G0,W3,D2,L2,V0,M2} I { alpha4, alpha2( skol1 ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 Y := skol1
% 0.85/1.21 end
% 0.85/1.21 substitution1:
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (1301) {G1,W9,D4,L3,V1,M3} { ! g( f( X ) ) ==> X, skol1 = X,
% 0.85/1.21 alpha4 }.
% 0.85/1.21 parent0[0]: (1300) {G1,W9,D4,L3,V1,M3} { ! X ==> g( f( X ) ), skol1 = X,
% 0.85/1.21 alpha4 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (37) {G1,W9,D4,L3,V1,M3} R(5,1) { ! g( f( X ) ) ==> X, skol1 =
% 0.85/1.21 X, alpha4 }.
% 0.85/1.21 parent0: (1301) {G1,W9,D4,L3,V1,M3} { ! g( f( X ) ) ==> X, skol1 = X,
% 0.85/1.21 alpha4 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 1 ==> 1
% 0.85/1.21 2 ==> 2
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 *** allocated 75937 integers for clauses
% 0.85/1.21 eqswap: (1305) {G0,W6,D3,L2,V1,M2} { ! X ==> skol5( X ), alpha3( X ) }.
% 0.85/1.21 parent0[0]: (13) {G0,W6,D3,L2,V1,M2} I { ! skol5( X ) ==> X, alpha3( X )
% 0.85/1.21 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 paramod: (1306) {G1,W9,D3,L4,V1,M4} { ! X ==> skol1, ! alpha2( skol5( X )
% 0.85/1.21 ), alpha4, alpha3( X ) }.
% 0.85/1.21 parent0[1]: (36) {G1,W6,D2,L3,V1,M3} R(5,0) { ! alpha2( X ), X = skol1,
% 0.85/1.21 alpha4 }.
% 0.85/1.21 parent1[0; 3]: (1305) {G0,W6,D3,L2,V1,M2} { ! X ==> skol5( X ), alpha3( X
% 0.85/1.21 ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := skol5( X )
% 0.85/1.21 end
% 0.85/1.21 substitution1:
% 0.85/1.21 X := X
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (1327) {G1,W9,D3,L4,V1,M4} { ! skol1 ==> X, ! alpha2( skol5( X ) )
% 0.85/1.21 , alpha4, alpha3( X ) }.
% 0.85/1.21 parent0[0]: (1306) {G1,W9,D3,L4,V1,M4} { ! X ==> skol1, ! alpha2( skol5( X
% 0.85/1.21 ) ), alpha4, alpha3( X ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (94) {G2,W9,D3,L4,V1,M4} P(36,13) { ! skol1 = X, alpha3( X ),
% 0.85/1.21 ! alpha2( skol5( X ) ), alpha4 }.
% 0.85/1.21 parent0: (1327) {G1,W9,D3,L4,V1,M4} { ! skol1 ==> X, ! alpha2( skol5( X )
% 0.85/1.21 ), alpha4, alpha3( X ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 1 ==> 2
% 0.85/1.21 2 ==> 3
% 0.85/1.21 3 ==> 1
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (1420) {G2,W9,D3,L4,V1,M4} { ! X = skol1, alpha3( X ), ! alpha2(
% 0.85/1.21 skol5( X ) ), alpha4 }.
% 0.85/1.21 parent0[0]: (94) {G2,W9,D3,L4,V1,M4} P(36,13) { ! skol1 = X, alpha3( X ), !
% 0.85/1.21 alpha2( skol5( X ) ), alpha4 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqrefl: (1421) {G0,W6,D3,L3,V0,M3} { alpha3( skol1 ), ! alpha2( skol5(
% 0.85/1.21 skol1 ) ), alpha4 }.
% 0.85/1.21 parent0[0]: (1420) {G2,W9,D3,L4,V1,M4} { ! X = skol1, alpha3( X ), !
% 0.85/1.21 alpha2( skol5( X ) ), alpha4 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := skol1
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (96) {G3,W6,D3,L3,V0,M3} Q(94) { alpha3( skol1 ), ! alpha2(
% 0.85/1.21 skol5( skol1 ) ), alpha4 }.
% 0.85/1.21 parent0: (1421) {G0,W6,D3,L3,V0,M3} { alpha3( skol1 ), ! alpha2( skol5(
% 0.85/1.21 skol1 ) ), alpha4 }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 permutation0:
% 0.85/1.21 0 ==> 0
% 0.85/1.21 1 ==> 1
% 0.85/1.21 2 ==> 2
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (1422) {G0,W9,D5,L2,V2,M2} { skol3( X ) ==> g( f( skol3( X ) ) ),
% 0.85/1.21 alpha2( Y ) }.
% 0.85/1.21 parent0[0]: (6) {G0,W9,D5,L2,V2,M2} I { g( f( skol3( Y ) ) ) ==> skol3( Y )
% 0.85/1.21 , alpha2( X ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := Y
% 0.85/1.21 Y := X
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 resolution: (1423) {G1,W8,D5,L2,V1,M2} { ! alpha4, skol3( X ) ==> g( f(
% 0.85/1.21 skol3( X ) ) ) }.
% 0.85/1.21 parent0[0]: (30) {G2,W4,D3,L2,V0,M2} R(26,3) { ! alpha2( g( skol4 ) ), !
% 0.85/1.21 alpha4 }.
% 0.85/1.21 parent1[1]: (1422) {G0,W9,D5,L2,V2,M2} { skol3( X ) ==> g( f( skol3( X ) )
% 0.85/1.21 ), alpha2( Y ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 end
% 0.85/1.21 substitution1:
% 0.85/1.21 X := X
% 0.85/1.21 Y := g( skol4 )
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 eqswap: (1424) {G1,W8,D5,L2,V1,M2} { g( f( skol3( X ) ) ) ==> skol3( X ),
% 0.85/1.21 ! alpha4 }.
% 0.85/1.21 parent0[1]: (1423) {G1,W8,D5,L2,V1,M2} { ! alpha4, skol3( X ) ==> g( f(
% 0.85/1.21 skol3( X ) ) ) }.
% 0.85/1.21 substitution0:
% 0.85/1.21 X := X
% 0.85/1.21 end
% 0.85/1.21
% 0.85/1.21 subsumption: (112) {G3,W8,D5,L2,V1,M2} R(6,30) { g( f( skol3( X ) ) ) ==>
% 0.85/1.21 skol3( X ),Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------