TSTP Solution File: SWV411+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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 : Wed Jul 20 16:24:46 EDT 2022
% Result : Theorem 0.45s 1.14s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n020.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 : Wed Jun 15 23:23:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.14 *** allocated 10000 integers for termspace/termends
% 0.45/1.14 *** allocated 10000 integers for clauses
% 0.45/1.14 *** allocated 10000 integers for justifications
% 0.45/1.14 Bliksem 1.12
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 Automatic Strategy Selection
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 Clauses:
% 0.45/1.14
% 0.45/1.14 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.45/1.14 { less_than( X, Y ), less_than( Y, X ) }.
% 0.45/1.14 { less_than( X, X ) }.
% 0.45/1.14 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.45/1.14 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.45/1.14 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.45/1.14 { less_than( bottom, X ) }.
% 0.45/1.14 { ! isnonempty_slb( create_slb ) }.
% 0.45/1.14 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.45/1.14 { ! contains_slb( create_slb, X ) }.
% 0.45/1.14 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.45/1.14 , Y = Z }.
% 0.45/1.14 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.45/1.14 }.
% 0.45/1.14 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.45/1.14 { ! pair_in_list( create_slb, X, Y ) }.
% 0.45/1.14 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.45/1.14 , U ), alpha1( Y, Z, T, U ) }.
% 0.45/1.14 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.45/1.14 , U ) }.
% 0.45/1.14 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.45/1.14 ) }.
% 0.45/1.14 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.45/1.14 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.45/1.14 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.45/1.14 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.45/1.14 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.45/1.14 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.45/1.14 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.45/1.14 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.45/1.14 , Z ) = lookup_slb( X, Z ) }.
% 0.45/1.14 { update_slb( create_slb, X ) = create_slb }.
% 0.45/1.14 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.45/1.14 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.45/1.14 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.45/1.14 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.45/1.14 { ! contains_slb( skol1, X ), pair_in_list( skol1, X, skol2( X ) ) }.
% 0.45/1.14 { contains_slb( insert_slb( skol1, pair( skol4, skol5 ) ), skol3 ) }.
% 0.45/1.14 { ! pair_in_list( insert_slb( skol1, pair( skol4, skol5 ) ), skol3, X ) }.
% 0.45/1.14
% 0.45/1.14 percentage equality = 0.267857, percentage horn = 0.800000
% 0.45/1.14 This is a problem with some equality
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 Options Used:
% 0.45/1.14
% 0.45/1.14 useres = 1
% 0.45/1.14 useparamod = 1
% 0.45/1.14 useeqrefl = 1
% 0.45/1.14 useeqfact = 1
% 0.45/1.14 usefactor = 1
% 0.45/1.14 usesimpsplitting = 0
% 0.45/1.14 usesimpdemod = 5
% 0.45/1.14 usesimpres = 3
% 0.45/1.14
% 0.45/1.14 resimpinuse = 1000
% 0.45/1.14 resimpclauses = 20000
% 0.45/1.14 substype = eqrewr
% 0.45/1.14 backwardsubs = 1
% 0.45/1.14 selectoldest = 5
% 0.45/1.14
% 0.45/1.14 litorderings [0] = split
% 0.45/1.14 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.14
% 0.45/1.14 termordering = kbo
% 0.45/1.14
% 0.45/1.14 litapriori = 0
% 0.45/1.14 termapriori = 1
% 0.45/1.14 litaposteriori = 0
% 0.45/1.14 termaposteriori = 0
% 0.45/1.14 demodaposteriori = 0
% 0.45/1.14 ordereqreflfact = 0
% 0.45/1.14
% 0.45/1.14 litselect = negord
% 0.45/1.14
% 0.45/1.14 maxweight = 15
% 0.45/1.14 maxdepth = 30000
% 0.45/1.14 maxlength = 115
% 0.45/1.14 maxnrvars = 195
% 0.45/1.14 excuselevel = 1
% 0.45/1.14 increasemaxweight = 1
% 0.45/1.14
% 0.45/1.14 maxselected = 10000000
% 0.45/1.14 maxnrclauses = 10000000
% 0.45/1.14
% 0.45/1.14 showgenerated = 0
% 0.45/1.14 showkept = 0
% 0.45/1.14 showselected = 0
% 0.45/1.14 showdeleted = 0
% 0.45/1.14 showresimp = 1
% 0.45/1.14 showstatus = 2000
% 0.45/1.14
% 0.45/1.14 prologoutput = 0
% 0.45/1.14 nrgoals = 5000000
% 0.45/1.14 totalproof = 1
% 0.45/1.14
% 0.45/1.14 Symbols occurring in the translation:
% 0.45/1.14
% 0.45/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.14 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.45/1.14 ! [4, 1] (w:0, o:19, a:1, s:1, b:0),
% 0.45/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.14 less_than [38, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.45/1.14 strictly_less_than [39, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.45/1.14 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.45/1.14 create_slb [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.45/1.14 isnonempty_slb [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.45/1.14 pair [43, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.45/1.14 insert_slb [44, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.45/1.14 contains_slb [45, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.45/1.14 pair_in_list [47, 3] (w:1, o:58, a:1, s:1, b:0),
% 0.45/1.14 remove_slb [49, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.45/1.14 lookup_slb [50, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.45/1.14 update_slb [51, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.45/1.14 alpha1 [54, 4] (w:1, o:59, a:1, s:1, b:1),
% 0.45/1.14 skol1 [55, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.45/1.14 skol2 [56, 1] (w:1, o:25, a:1, s:1, b:1),
% 0.45/1.14 skol3 [57, 0] (w:1, o:16, a:1, s:1, b:1),
% 0.45/1.14 skol4 [58, 0] (w:1, o:17, a:1, s:1, b:1),
% 0.45/1.14 skol5 [59, 0] (w:1, o:18, a:1, s:1, b:1).
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 Starting Search:
% 0.45/1.14
% 0.45/1.14 *** allocated 15000 integers for clauses
% 0.45/1.14 *** allocated 22500 integers for clauses
% 0.45/1.14 *** allocated 33750 integers for clauses
% 0.45/1.14 *** allocated 15000 integers for termspace/termends
% 0.45/1.14 *** allocated 50625 integers for clauses
% 0.45/1.14 *** allocated 22500 integers for termspace/termends
% 0.45/1.14 *** allocated 75937 integers for clauses
% 0.45/1.14 Resimplifying inuse:
% 0.45/1.14 Done
% 0.45/1.14
% 0.45/1.14 *** allocated 33750 integers for termspace/termends
% 0.45/1.14
% 0.45/1.14 Bliksems!, er is een bewijs:
% 0.45/1.14 % SZS status Theorem
% 0.45/1.14 % SZS output start Refutation
% 0.45/1.14
% 0.45/1.14 (10) {G0,W13,D4,L3,V4,M3} I { ! contains_slb( insert_slb( X, pair( Y, T ) )
% 0.45/1.14 , Z ), contains_slb( X, Z ), Y = Z }.
% 0.45/1.14 (15) {G0,W12,D4,L2,V5,M2} I { ! pair_in_list( X, Z, U ), pair_in_list(
% 0.45/1.14 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 (16) {G0,W13,D4,L2,V5,M2} I { ! alpha1( Y, Z, T, U ), pair_in_list(
% 0.45/1.14 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 (19) {G0,W11,D2,L3,V4,M3} I { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.45/1.14 (27) {G0,W8,D3,L2,V1,M2} I { ! contains_slb( skol1, X ), pair_in_list(
% 0.45/1.14 skol1, X, skol2( X ) ) }.
% 0.45/1.14 (28) {G0,W7,D4,L1,V0,M1} I { contains_slb( insert_slb( skol1, pair( skol4,
% 0.45/1.14 skol5 ) ), skol3 ) }.
% 0.45/1.14 (29) {G0,W8,D4,L1,V1,M1} I { ! pair_in_list( insert_slb( skol1, pair( skol4
% 0.45/1.14 , skol5 ) ), skol3, X ) }.
% 0.45/1.14 (33) {G1,W8,D2,L2,V3,M2} Q(19) { ! X = Y, alpha1( X, Y, Z, Z ) }.
% 0.45/1.14 (75) {G1,W6,D2,L2,V0,M2} R(28,10) { contains_slb( skol1, skol3 ), skol4 ==>
% 0.45/1.14 skol3 }.
% 0.45/1.14 (1136) {G1,W5,D2,L1,V1,M1} R(29,16) { ! alpha1( skol4, skol3, skol5, X )
% 0.45/1.14 }.
% 0.45/1.14 (1137) {G1,W4,D2,L1,V1,M1} R(29,15) { ! pair_in_list( skol1, skol3, X ) }.
% 0.45/1.14 (1233) {G2,W3,D2,L1,V0,M1} R(1137,27) { ! contains_slb( skol1, skol3 ) }.
% 0.45/1.14 (1252) {G3,W3,D2,L1,V0,M1} R(1233,75) { skol4 ==> skol3 }.
% 0.45/1.14 (1272) {G4,W5,D2,L1,V1,M1} S(1136);d(1252) { ! alpha1( skol3, skol3, skol5
% 0.45/1.14 , X ) }.
% 0.45/1.14 (1295) {G5,W0,D0,L0,V0,M0} R(1272,33);q { }.
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 % SZS output end Refutation
% 0.45/1.14 found a proof!
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 Unprocessed initial clauses:
% 0.45/1.14
% 0.45/1.14 (1297) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 0.45/1.14 less_than( X, Y ) }.
% 0.45/1.14 (1298) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 0.45/1.14 (1299) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 0.45/1.14 (1300) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X, Y
% 0.45/1.14 ) }.
% 0.45/1.14 (1301) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 0.45/1.14 , X ) }.
% 0.45/1.14 (1302) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 0.45/1.14 strictly_less_than( X, Y ) }.
% 0.45/1.14 (1303) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 0.45/1.14 (1304) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 0.45/1.14 (1305) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z ) )
% 0.45/1.14 ) }.
% 0.45/1.14 (1306) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.45/1.14 (1307) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 0.45/1.14 ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.45/1.14 (1308) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 0.45/1.14 insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.45/1.14 (1309) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair(
% 0.45/1.14 Y, T ) ), Z ) }.
% 0.45/1.14 (1310) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 0.45/1.14 (1311) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 0.45/1.14 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 0.45/1.14 (1312) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 0.45/1.14 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 (1313) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 0.45/1.14 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 (1314) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.45/1.14 (1315) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.45/1.14 (1316) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.45/1.14 (1317) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.45/1.14 ) = X }.
% 0.45/1.14 (1318) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 0.45/1.14 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 0.45/1.14 ( Y, T ) ) }.
% 0.45/1.14 (1319) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.45/1.14 ) = Z }.
% 0.45/1.14 (1320) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 0.45/1.14 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 0.45/1.14 (1321) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 0.45/1.14 (1322) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 0.45/1.14 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 0.45/1.14 ( T, X ) ) }.
% 0.45/1.14 (1323) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 0.45/1.14 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 0.45/1.14 }.
% 0.45/1.14 (1324) {G0,W8,D3,L2,V1,M2} { ! contains_slb( skol1, X ), pair_in_list(
% 0.45/1.14 skol1, X, skol2( X ) ) }.
% 0.45/1.14 (1325) {G0,W7,D4,L1,V0,M1} { contains_slb( insert_slb( skol1, pair( skol4
% 0.45/1.14 , skol5 ) ), skol3 ) }.
% 0.45/1.14 (1326) {G0,W8,D4,L1,V1,M1} { ! pair_in_list( insert_slb( skol1, pair(
% 0.45/1.14 skol4, skol5 ) ), skol3, X ) }.
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 Total Proof:
% 0.45/1.14
% 0.45/1.14 subsumption: (10) {G0,W13,D4,L3,V4,M3} I { ! contains_slb( insert_slb( X,
% 0.45/1.14 pair( Y, T ) ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.45/1.14 parent0: (1307) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair
% 0.45/1.14 ( Y, T ) ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 Y := Y
% 0.45/1.14 Z := Z
% 0.45/1.14 T := T
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 1 ==> 1
% 0.45/1.14 2 ==> 2
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (15) {G0,W12,D4,L2,V5,M2} I { ! pair_in_list( X, Z, U ),
% 0.45/1.14 pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 parent0: (1312) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ),
% 0.45/1.14 pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 Y := Y
% 0.45/1.14 Z := Z
% 0.45/1.14 T := T
% 0.45/1.14 U := U
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 1 ==> 1
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (16) {G0,W13,D4,L2,V5,M2} I { ! alpha1( Y, Z, T, U ),
% 0.45/1.14 pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 parent0: (1313) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ),
% 0.45/1.14 pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 Y := Y
% 0.45/1.14 Z := Z
% 0.45/1.14 T := T
% 0.45/1.14 U := U
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 1 ==> 1
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (19) {G0,W11,D2,L3,V4,M3} I { ! X = Y, ! Z = T, alpha1( X, Y,
% 0.45/1.14 Z, T ) }.
% 0.45/1.14 parent0: (1316) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z,
% 0.45/1.14 T ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 Y := Y
% 0.45/1.14 Z := Z
% 0.45/1.14 T := T
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 1 ==> 1
% 0.45/1.14 2 ==> 2
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (27) {G0,W8,D3,L2,V1,M2} I { ! contains_slb( skol1, X ),
% 0.45/1.14 pair_in_list( skol1, X, skol2( X ) ) }.
% 0.45/1.14 parent0: (1324) {G0,W8,D3,L2,V1,M2} { ! contains_slb( skol1, X ),
% 0.45/1.14 pair_in_list( skol1, X, skol2( X ) ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 1 ==> 1
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (28) {G0,W7,D4,L1,V0,M1} I { contains_slb( insert_slb( skol1,
% 0.45/1.14 pair( skol4, skol5 ) ), skol3 ) }.
% 0.45/1.14 parent0: (1325) {G0,W7,D4,L1,V0,M1} { contains_slb( insert_slb( skol1,
% 0.45/1.14 pair( skol4, skol5 ) ), skol3 ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (29) {G0,W8,D4,L1,V1,M1} I { ! pair_in_list( insert_slb( skol1
% 0.45/1.14 , pair( skol4, skol5 ) ), skol3, X ) }.
% 0.45/1.14 parent0: (1326) {G0,W8,D4,L1,V1,M1} { ! pair_in_list( insert_slb( skol1,
% 0.45/1.14 pair( skol4, skol5 ) ), skol3, X ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 eqswap: (1423) {G0,W11,D2,L3,V4,M3} { ! Y = X, ! Z = T, alpha1( X, Y, Z, T
% 0.45/1.14 ) }.
% 0.45/1.14 parent0[0]: (19) {G0,W11,D2,L3,V4,M3} I { ! X = Y, ! Z = T, alpha1( X, Y, Z
% 0.45/1.14 , T ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 Y := Y
% 0.45/1.14 Z := Z
% 0.45/1.14 T := T
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 eqrefl: (1427) {G0,W8,D2,L2,V3,M2} { ! X = Y, alpha1( Y, X, Z, Z ) }.
% 0.45/1.14 parent0[1]: (1423) {G0,W11,D2,L3,V4,M3} { ! Y = X, ! Z = T, alpha1( X, Y,
% 0.45/1.14 Z, T ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := Y
% 0.45/1.14 Y := X
% 0.45/1.14 Z := Z
% 0.45/1.14 T := Z
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 eqswap: (1428) {G0,W8,D2,L2,V3,M2} { ! Y = X, alpha1( Y, X, Z, Z ) }.
% 0.45/1.14 parent0[0]: (1427) {G0,W8,D2,L2,V3,M2} { ! X = Y, alpha1( Y, X, Z, Z ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 Y := Y
% 0.45/1.14 Z := Z
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (33) {G1,W8,D2,L2,V3,M2} Q(19) { ! X = Y, alpha1( X, Y, Z, Z )
% 0.45/1.14 }.
% 0.45/1.14 parent0: (1428) {G0,W8,D2,L2,V3,M2} { ! Y = X, alpha1( Y, X, Z, Z ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := Y
% 0.45/1.14 Y := X
% 0.45/1.14 Z := Z
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 1 ==> 1
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 eqswap: (1430) {G0,W13,D4,L3,V4,M3} { Y = X, ! contains_slb( insert_slb( Z
% 0.45/1.14 , pair( X, T ) ), Y ), contains_slb( Z, Y ) }.
% 0.45/1.14 parent0[2]: (10) {G0,W13,D4,L3,V4,M3} I { ! contains_slb( insert_slb( X,
% 0.45/1.14 pair( Y, T ) ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := Z
% 0.45/1.14 Y := X
% 0.45/1.14 Z := Y
% 0.45/1.14 T := T
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 resolution: (1431) {G1,W6,D2,L2,V0,M2} { skol3 = skol4, contains_slb(
% 0.45/1.14 skol1, skol3 ) }.
% 0.45/1.14 parent0[1]: (1430) {G0,W13,D4,L3,V4,M3} { Y = X, ! contains_slb(
% 0.45/1.14 insert_slb( Z, pair( X, T ) ), Y ), contains_slb( Z, Y ) }.
% 0.45/1.14 parent1[0]: (28) {G0,W7,D4,L1,V0,M1} I { contains_slb( insert_slb( skol1,
% 0.45/1.14 pair( skol4, skol5 ) ), skol3 ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := skol4
% 0.45/1.14 Y := skol3
% 0.45/1.14 Z := skol1
% 0.45/1.14 T := skol5
% 0.45/1.14 end
% 0.45/1.14 substitution1:
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 eqswap: (1432) {G1,W6,D2,L2,V0,M2} { skol4 = skol3, contains_slb( skol1,
% 0.45/1.14 skol3 ) }.
% 0.45/1.14 parent0[0]: (1431) {G1,W6,D2,L2,V0,M2} { skol3 = skol4, contains_slb(
% 0.45/1.14 skol1, skol3 ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (75) {G1,W6,D2,L2,V0,M2} R(28,10) { contains_slb( skol1, skol3
% 0.45/1.14 ), skol4 ==> skol3 }.
% 0.45/1.14 parent0: (1432) {G1,W6,D2,L2,V0,M2} { skol4 = skol3, contains_slb( skol1,
% 0.45/1.14 skol3 ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 1
% 0.45/1.14 1 ==> 0
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 resolution: (1433) {G1,W5,D2,L1,V1,M1} { ! alpha1( skol4, skol3, skol5, X
% 0.45/1.14 ) }.
% 0.45/1.14 parent0[0]: (29) {G0,W8,D4,L1,V1,M1} I { ! pair_in_list( insert_slb( skol1
% 0.45/1.14 , pair( skol4, skol5 ) ), skol3, X ) }.
% 0.45/1.14 parent1[1]: (16) {G0,W13,D4,L2,V5,M2} I { ! alpha1( Y, Z, T, U ),
% 0.45/1.14 pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 end
% 0.45/1.14 substitution1:
% 0.45/1.14 X := skol1
% 0.45/1.14 Y := skol4
% 0.45/1.14 Z := skol3
% 0.45/1.14 T := skol5
% 0.45/1.14 U := X
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (1136) {G1,W5,D2,L1,V1,M1} R(29,16) { ! alpha1( skol4, skol3,
% 0.45/1.14 skol5, X ) }.
% 0.45/1.14 parent0: (1433) {G1,W5,D2,L1,V1,M1} { ! alpha1( skol4, skol3, skol5, X )
% 0.45/1.14 }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 resolution: (1434) {G1,W4,D2,L1,V1,M1} { ! pair_in_list( skol1, skol3, X )
% 0.45/1.14 }.
% 0.45/1.14 parent0[0]: (29) {G0,W8,D4,L1,V1,M1} I { ! pair_in_list( insert_slb( skol1
% 0.45/1.14 , pair( skol4, skol5 ) ), skol3, X ) }.
% 0.45/1.14 parent1[1]: (15) {G0,W12,D4,L2,V5,M2} I { ! pair_in_list( X, Z, U ),
% 0.45/1.14 pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 end
% 0.45/1.14 substitution1:
% 0.45/1.14 X := skol1
% 0.45/1.14 Y := skol4
% 0.45/1.14 Z := skol3
% 0.45/1.14 T := skol5
% 0.45/1.14 U := X
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (1137) {G1,W4,D2,L1,V1,M1} R(29,15) { ! pair_in_list( skol1,
% 0.45/1.14 skol3, X ) }.
% 0.45/1.14 parent0: (1434) {G1,W4,D2,L1,V1,M1} { ! pair_in_list( skol1, skol3, X )
% 0.45/1.14 }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 resolution: (1435) {G1,W3,D2,L1,V0,M1} { ! contains_slb( skol1, skol3 )
% 0.45/1.14 }.
% 0.45/1.14 parent0[0]: (1137) {G1,W4,D2,L1,V1,M1} R(29,15) { ! pair_in_list( skol1,
% 0.45/1.14 skol3, X ) }.
% 0.45/1.14 parent1[1]: (27) {G0,W8,D3,L2,V1,M2} I { ! contains_slb( skol1, X ),
% 0.45/1.14 pair_in_list( skol1, X, skol2( X ) ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := skol2( skol3 )
% 0.45/1.14 end
% 0.45/1.14 substitution1:
% 0.45/1.14 X := skol3
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (1233) {G2,W3,D2,L1,V0,M1} R(1137,27) { ! contains_slb( skol1
% 0.45/1.14 , skol3 ) }.
% 0.45/1.14 parent0: (1435) {G1,W3,D2,L1,V0,M1} { ! contains_slb( skol1, skol3 ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 eqswap: (1436) {G1,W6,D2,L2,V0,M2} { skol3 ==> skol4, contains_slb( skol1
% 0.45/1.14 , skol3 ) }.
% 0.45/1.14 parent0[1]: (75) {G1,W6,D2,L2,V0,M2} R(28,10) { contains_slb( skol1, skol3
% 0.45/1.14 ), skol4 ==> skol3 }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 resolution: (1437) {G2,W3,D2,L1,V0,M1} { skol3 ==> skol4 }.
% 0.45/1.14 parent0[0]: (1233) {G2,W3,D2,L1,V0,M1} R(1137,27) { ! contains_slb( skol1,
% 0.45/1.14 skol3 ) }.
% 0.45/1.14 parent1[1]: (1436) {G1,W6,D2,L2,V0,M2} { skol3 ==> skol4, contains_slb(
% 0.45/1.14 skol1, skol3 ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14 substitution1:
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 eqswap: (1438) {G2,W3,D2,L1,V0,M1} { skol4 ==> skol3 }.
% 0.45/1.14 parent0[0]: (1437) {G2,W3,D2,L1,V0,M1} { skol3 ==> skol4 }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (1252) {G3,W3,D2,L1,V0,M1} R(1233,75) { skol4 ==> skol3 }.
% 0.45/1.14 parent0: (1438) {G2,W3,D2,L1,V0,M1} { skol4 ==> skol3 }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 paramod: (1440) {G2,W5,D2,L1,V1,M1} { ! alpha1( skol3, skol3, skol5, X )
% 0.45/1.14 }.
% 0.45/1.14 parent0[0]: (1252) {G3,W3,D2,L1,V0,M1} R(1233,75) { skol4 ==> skol3 }.
% 0.45/1.14 parent1[0; 2]: (1136) {G1,W5,D2,L1,V1,M1} R(29,16) { ! alpha1( skol4, skol3
% 0.45/1.14 , skol5, X ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14 substitution1:
% 0.45/1.14 X := X
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (1272) {G4,W5,D2,L1,V1,M1} S(1136);d(1252) { ! alpha1( skol3,
% 0.45/1.14 skol3, skol5, X ) }.
% 0.45/1.14 parent0: (1440) {G2,W5,D2,L1,V1,M1} { ! alpha1( skol3, skol3, skol5, X )
% 0.45/1.14 }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 0 ==> 0
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 eqswap: (1441) {G1,W8,D2,L2,V3,M2} { ! Y = X, alpha1( X, Y, Z, Z ) }.
% 0.45/1.14 parent0[0]: (33) {G1,W8,D2,L2,V3,M2} Q(19) { ! X = Y, alpha1( X, Y, Z, Z )
% 0.45/1.14 }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := X
% 0.45/1.14 Y := Y
% 0.45/1.14 Z := Z
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 resolution: (1442) {G2,W3,D2,L1,V0,M1} { ! skol3 = skol3 }.
% 0.45/1.14 parent0[0]: (1272) {G4,W5,D2,L1,V1,M1} S(1136);d(1252) { ! alpha1( skol3,
% 0.45/1.14 skol3, skol5, X ) }.
% 0.45/1.14 parent1[1]: (1441) {G1,W8,D2,L2,V3,M2} { ! Y = X, alpha1( X, Y, Z, Z ) }.
% 0.45/1.14 substitution0:
% 0.45/1.14 X := skol5
% 0.45/1.14 end
% 0.45/1.14 substitution1:
% 0.45/1.14 X := skol3
% 0.45/1.14 Y := skol3
% 0.45/1.14 Z := skol5
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 eqrefl: (1443) {G0,W0,D0,L0,V0,M0} { }.
% 0.45/1.14 parent0[0]: (1442) {G2,W3,D2,L1,V0,M1} { ! skol3 = skol3 }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 subsumption: (1295) {G5,W0,D0,L0,V0,M0} R(1272,33);q { }.
% 0.45/1.14 parent0: (1443) {G0,W0,D0,L0,V0,M0} { }.
% 0.45/1.14 substitution0:
% 0.45/1.14 end
% 0.45/1.14 permutation0:
% 0.45/1.14 end
% 0.45/1.14
% 0.45/1.14 Proof check complete!
% 0.45/1.14
% 0.45/1.14 Memory use:
% 0.45/1.14
% 0.45/1.14 space for terms: 24191
% 0.45/1.14 space for clauses: 62717
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 clauses generated: 2989
% 0.45/1.14 clauses kept: 1296
% 0.45/1.14 clauses selected: 96
% 0.45/1.14 clauses deleted: 1
% 0.45/1.14 clauses inuse deleted: 0
% 0.45/1.14
% 0.45/1.14 subsentry: 5957
% 0.45/1.14 literals s-matched: 5172
% 0.45/1.14 literals matched: 4928
% 0.45/1.14 full subsumption: 2185
% 0.45/1.14
% 0.45/1.14 checksum: 18150932
% 0.45/1.14
% 0.45/1.14
% 0.45/1.14 Bliksem ended
%------------------------------------------------------------------------------