%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n012.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:47 EDT 2022
% Result : Theorem 0.73s 1.10s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Thu Jun 16 01:16:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.10 *** allocated 10000 integers for termspace/termends
% 0.73/1.10 *** allocated 10000 integers for clauses
% 0.73/1.10 *** allocated 10000 integers for justifications
% 0.73/1.10 Bliksem 1.12
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 Automatic Strategy Selection
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 Clauses:
% 0.73/1.10
% 0.73/1.10 { ! less_than( X, Z ), ! less_than( Z, Y ), less_than( X, Y ) }.
% 0.73/1.10 { less_than( X, Y ), less_than( Y, X ) }.
% 0.73/1.10 { less_than( X, X ) }.
% 0.73/1.10 { ! strictly_less_than( X, Y ), less_than( X, Y ) }.
% 0.73/1.10 { ! strictly_less_than( X, Y ), ! less_than( Y, X ) }.
% 0.73/1.10 { ! less_than( X, Y ), less_than( Y, X ), strictly_less_than( X, Y ) }.
% 0.73/1.10 { less_than( bottom, X ) }.
% 0.73/1.10 { ! isnonempty_slb( create_slb ) }.
% 0.73/1.10 { isnonempty_slb( insert_slb( X, pair( Y, Z ) ) ) }.
% 0.73/1.10 { ! contains_slb( create_slb, X ) }.
% 0.73/1.10 { ! contains_slb( insert_slb( X, pair( Y, T ) ), Z ), contains_slb( X, Z )
% 0.73/1.10 , Y = Z }.
% 0.73/1.10 { ! contains_slb( X, Z ), contains_slb( insert_slb( X, pair( Y, T ) ), Z )
% 0.73/1.10 }.
% 0.73/1.10 { ! Y = Z, contains_slb( insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.73/1.10 { ! pair_in_list( create_slb, X, Y ) }.
% 0.73/1.10 { ! pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U ), pair_in_list( X, Z
% 0.73/1.10 , U ), alpha1( Y, Z, T, U ) }.
% 0.73/1.10 { ! pair_in_list( X, Z, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z
% 0.73/1.10 , U ) }.
% 0.73/1.10 { ! alpha1( Y, Z, T, U ), pair_in_list( insert_slb( X, pair( Y, T ) ), Z, U
% 0.73/1.10 ) }.
% 0.73/1.10 { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.73/1.10 { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.73/1.10 { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.73/1.10 { remove_slb( insert_slb( X, pair( Y, Z ) ), Y ) = X }.
% 0.73/1.10 { Y = Z, ! contains_slb( X, Z ), remove_slb( insert_slb( X, pair( Y, T ) )
% 0.73/1.10 , Z ) = insert_slb( remove_slb( X, Z ), pair( Y, T ) ) }.
% 0.73/1.10 { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y ) = Z }.
% 0.73/1.10 { Y = Z, ! contains_slb( X, Z ), lookup_slb( insert_slb( X, pair( Y, T ) )
% 0.73/1.10 , Z ) = lookup_slb( X, Z ) }.
% 0.73/1.10 { update_slb( create_slb, X ) = create_slb }.
% 0.73/1.10 { ! strictly_less_than( Y, X ), update_slb( insert_slb( Z, pair( T, Y ) ),
% 0.73/1.10 X ) = insert_slb( update_slb( Z, X ), pair( T, X ) ) }.
% 0.73/1.10 { ! less_than( X, Y ), update_slb( insert_slb( Z, pair( T, Y ) ), X ) =
% 0.73/1.10 insert_slb( update_slb( Z, X ), pair( T, Y ) ) }.
% 0.73/1.10 { ! pair_in_list( X, Y, Z ), ! less_than( T, Z ), pair_in_list( update_slb
% 0.73/1.10 ( X, T ), Y, Z ) }.
% 0.73/1.10 { pair_in_list( skol1, skol2, skol4 ) }.
% 0.73/1.10 { strictly_less_than( skol2, skol3 ) }.
% 0.73/1.10 { less_than( skol3, skol4 ) }.
% 0.73/1.10 { ! pair_in_list( update_slb( skol1, skol3 ), skol2, X ), ! less_than(
% 0.73/1.10 skol3, X ) }.
% 0.73/1.10
% 0.73/1.10 percentage equality = 0.250000, percentage horn = 0.812500
% 0.73/1.10 This is a problem with some equality
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 Options Used:
% 0.73/1.10
% 0.73/1.10 useres = 1
% 0.73/1.10 useparamod = 1
% 0.73/1.10 useeqrefl = 1
% 0.73/1.10 useeqfact = 1
% 0.73/1.10 usefactor = 1
% 0.73/1.10 usesimpsplitting = 0
% 0.73/1.10 usesimpdemod = 5
% 0.73/1.10 usesimpres = 3
% 0.73/1.10
% 0.73/1.10 resimpinuse = 1000
% 0.73/1.10 resimpclauses = 20000
% 0.73/1.10 substype = eqrewr
% 0.73/1.10 backwardsubs = 1
% 0.73/1.10 selectoldest = 5
% 0.73/1.10
% 0.73/1.10 litorderings [0] = split
% 0.73/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.73/1.10
% 0.73/1.10 termordering = kbo
% 0.73/1.10
% 0.73/1.10 litapriori = 0
% 0.73/1.10 termapriori = 1
% 0.73/1.10 litaposteriori = 0
% 0.73/1.10 termaposteriori = 0
% 0.73/1.10 demodaposteriori = 0
% 0.73/1.10 ordereqreflfact = 0
% 0.73/1.10
% 0.73/1.10 litselect = negord
% 0.73/1.10
% 0.73/1.10 maxweight = 15
% 0.73/1.10 maxdepth = 30000
% 0.73/1.10 maxlength = 115
% 0.73/1.10 maxnrvars = 195
% 0.73/1.10 excuselevel = 1
% 0.73/1.10 increasemaxweight = 1
% 0.73/1.10
% 0.73/1.10 maxselected = 10000000
% 0.73/1.10 maxnrclauses = 10000000
% 0.73/1.10
% 0.73/1.10 showgenerated = 0
% 0.73/1.10 showkept = 0
% 0.73/1.10 showselected = 0
% 0.73/1.10 showdeleted = 0
% 0.73/1.10 showresimp = 1
% 0.73/1.10 showstatus = 2000
% 0.73/1.10
% 0.73/1.10 prologoutput = 0
% 0.73/1.10 nrgoals = 5000000
% 0.73/1.10 totalproof = 1
% 0.73/1.10
% 0.73/1.10 Symbols occurring in the translation:
% 0.73/1.10
% 0.73/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.10 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.73/1.10 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.73/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.10 less_than [38, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.73/1.10 strictly_less_than [39, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.73/1.10 bottom [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.73/1.10 create_slb [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.73/1.10 isnonempty_slb [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.73/1.10 pair [43, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.73/1.10 insert_slb [44, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.73/1.10 contains_slb [45, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.73/1.10 pair_in_list [47, 3] (w:1, o:55, a:1, s:1, b:0),
% 0.73/1.10 remove_slb [49, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.73/1.10 lookup_slb [50, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.73/1.10 update_slb [51, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.73/1.10 alpha1 [52, 4] (w:1, o:56, a:1, s:1, b:1),
% 0.73/1.10 skol1 [53, 0] (w:1, o:13, a:1, s:1, b:1),
% 0.73/1.10 skol2 [54, 0] (w:1, o:14, a:1, s:1, b:1),
% 0.73/1.10 skol3 [55, 0] (w:1, o:15, a:1, s:1, b:1),
% 0.73/1.10 skol4 [56, 0] (w:1, o:16, a:1, s:1, b:1).
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 Starting Search:
% 0.73/1.10
% 0.73/1.10 *** allocated 15000 integers for clauses
% 0.73/1.10 *** allocated 22500 integers for clauses
% 0.73/1.10 *** allocated 33750 integers for clauses
% 0.73/1.10 *** allocated 15000 integers for termspace/termends
% 0.73/1.10 *** allocated 50625 integers for clauses
% 0.73/1.10 *** allocated 22500 integers for termspace/termends
% 0.73/1.10 Resimplifying inuse:
% 0.73/1.10 Done
% 0.73/1.10
% 0.73/1.10 *** allocated 75937 integers for clauses
% 0.73/1.10 *** allocated 33750 integers for termspace/termends
% 0.73/1.10
% 0.73/1.10 Bliksems!, er is een bewijs:
% 0.73/1.10 % SZS status Theorem
% 0.73/1.10 % SZS output start Refutation
% 0.73/1.10
% 0.73/1.10 (27) {G0,W13,D3,L3,V4,M3} I { ! pair_in_list( X, Y, Z ), ! less_than( T, Z
% 0.73/1.10 ), pair_in_list( update_slb( X, T ), Y, Z ) }.
% 0.73/1.10 (28) {G0,W4,D2,L1,V0,M1} I { pair_in_list( skol1, skol2, skol4 ) }.
% 0.73/1.10 (30) {G0,W3,D2,L1,V0,M1} I { less_than( skol3, skol4 ) }.
% 0.73/1.10 (31) {G0,W9,D3,L2,V1,M2} I { ! pair_in_list( update_slb( skol1, skol3 ),
% 0.73/1.10 skol2, X ), ! less_than( skol3, X ) }.
% 0.73/1.10 (1175) {G1,W6,D3,L1,V0,M1} R(31,30) { ! pair_in_list( update_slb( skol1,
% 0.73/1.10 skol3 ), skol2, skol4 ) }.
% 0.73/1.10 (1594) {G2,W3,D2,L1,V0,M1} R(1175,27);r(28) { ! less_than( skol3, skol4 )
% 0.73/1.10 }.
% 0.73/1.10 (1616) {G3,W0,D0,L0,V0,M0} S(1594);r(30) { }.
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 % SZS output end Refutation
% 0.73/1.10 found a proof!
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 Unprocessed initial clauses:
% 0.73/1.10
% 0.73/1.10 (1618) {G0,W9,D2,L3,V3,M3} { ! less_than( X, Z ), ! less_than( Z, Y ),
% 0.73/1.10 less_than( X, Y ) }.
% 0.73/1.10 (1619) {G0,W6,D2,L2,V2,M2} { less_than( X, Y ), less_than( Y, X ) }.
% 0.73/1.10 (1620) {G0,W3,D2,L1,V1,M1} { less_than( X, X ) }.
% 0.73/1.10 (1621) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), less_than( X, Y
% 0.73/1.10 ) }.
% 0.73/1.10 (1622) {G0,W6,D2,L2,V2,M2} { ! strictly_less_than( X, Y ), ! less_than( Y
% 0.73/1.10 , X ) }.
% 0.73/1.10 (1623) {G0,W9,D2,L3,V2,M3} { ! less_than( X, Y ), less_than( Y, X ),
% 0.73/1.10 strictly_less_than( X, Y ) }.
% 0.73/1.10 (1624) {G0,W3,D2,L1,V1,M1} { less_than( bottom, X ) }.
% 0.73/1.10 (1625) {G0,W2,D2,L1,V0,M1} { ! isnonempty_slb( create_slb ) }.
% 0.73/1.10 (1626) {G0,W6,D4,L1,V3,M1} { isnonempty_slb( insert_slb( X, pair( Y, Z ) )
% 0.73/1.10 ) }.
% 0.73/1.10 (1627) {G0,W3,D2,L1,V1,M1} { ! contains_slb( create_slb, X ) }.
% 0.73/1.10 (1628) {G0,W13,D4,L3,V4,M3} { ! contains_slb( insert_slb( X, pair( Y, T )
% 0.73/1.10 ), Z ), contains_slb( X, Z ), Y = Z }.
% 0.73/1.10 (1629) {G0,W10,D4,L2,V4,M2} { ! contains_slb( X, Z ), contains_slb(
% 0.73/1.10 insert_slb( X, pair( Y, T ) ), Z ) }.
% 0.73/1.10 (1630) {G0,W10,D4,L2,V4,M2} { ! Y = Z, contains_slb( insert_slb( X, pair(
% 0.73/1.10 Y, T ) ), Z ) }.
% 0.73/1.10 (1631) {G0,W4,D2,L1,V2,M1} { ! pair_in_list( create_slb, X, Y ) }.
% 0.73/1.10 (1632) {G0,W17,D4,L3,V5,M3} { ! pair_in_list( insert_slb( X, pair( Y, T )
% 0.73/1.10 ), Z, U ), pair_in_list( X, Z, U ), alpha1( Y, Z, T, U ) }.
% 0.73/1.10 (1633) {G0,W12,D4,L2,V5,M2} { ! pair_in_list( X, Z, U ), pair_in_list(
% 0.73/1.10 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.73/1.10 (1634) {G0,W13,D4,L2,V5,M2} { ! alpha1( Y, Z, T, U ), pair_in_list(
% 0.73/1.10 insert_slb( X, pair( Y, T ) ), Z, U ) }.
% 0.73/1.10 (1635) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), X = Y }.
% 0.73/1.10 (1636) {G0,W8,D2,L2,V4,M2} { ! alpha1( X, Y, Z, T ), Z = T }.
% 0.73/1.10 (1637) {G0,W11,D2,L3,V4,M3} { ! X = Y, ! Z = T, alpha1( X, Y, Z, T ) }.
% 0.73/1.10 (1638) {G0,W9,D5,L1,V3,M1} { remove_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.73/1.10 ) = X }.
% 0.73/1.10 (1639) {G0,W21,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), remove_slb(
% 0.73/1.10 insert_slb( X, pair( Y, T ) ), Z ) = insert_slb( remove_slb( X, Z ), pair
% 0.73/1.10 ( Y, T ) ) }.
% 0.73/1.10 (1640) {G0,W9,D5,L1,V3,M1} { lookup_slb( insert_slb( X, pair( Y, Z ) ), Y
% 0.73/1.10 ) = Z }.
% 0.73/1.10 (1641) {G0,W17,D5,L3,V4,M3} { Y = Z, ! contains_slb( X, Z ), lookup_slb(
% 0.73/1.10 insert_slb( X, pair( Y, T ) ), Z ) = lookup_slb( X, Z ) }.
% 0.73/1.10 (1642) {G0,W5,D3,L1,V1,M1} { update_slb( create_slb, X ) = create_slb }.
% 0.73/1.10 (1643) {G0,W18,D5,L2,V4,M2} { ! strictly_less_than( Y, X ), update_slb(
% 0.73/1.10 insert_slb( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair
% 0.73/1.10 ( T, X ) ) }.
% 0.73/1.10 (1644) {G0,W18,D5,L2,V4,M2} { ! less_than( X, Y ), update_slb( insert_slb
% 0.73/1.10 ( Z, pair( T, Y ) ), X ) = insert_slb( update_slb( Z, X ), pair( T, Y ) )
% 0.73/1.10 }.
% 0.73/1.10 (1645) {G0,W13,D3,L3,V4,M3} { ! pair_in_list( X, Y, Z ), ! less_than( T, Z
% 0.73/1.10 ), pair_in_list( update_slb( X, T ), Y, Z ) }.
% 0.73/1.10 (1646) {G0,W4,D2,L1,V0,M1} { pair_in_list( skol1, skol2, skol4 ) }.
% 0.73/1.10 (1647) {G0,W3,D2,L1,V0,M1} { strictly_less_than( skol2, skol3 ) }.
% 0.73/1.10 (1648) {G0,W3,D2,L1,V0,M1} { less_than( skol3, skol4 ) }.
% 0.73/1.10 (1649) {G0,W9,D3,L2,V1,M2} { ! pair_in_list( update_slb( skol1, skol3 ),
% 0.73/1.10 skol2, X ), ! less_than( skol3, X ) }.
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 Total Proof:
% 0.73/1.10
% 0.73/1.10 subsumption: (27) {G0,W13,D3,L3,V4,M3} I { ! pair_in_list( X, Y, Z ), !
% 0.73/1.10 less_than( T, Z ), pair_in_list( update_slb( X, T ), Y, Z ) }.
% 0.73/1.10 parent0: (1645) {G0,W13,D3,L3,V4,M3} { ! pair_in_list( X, Y, Z ), !
% 0.73/1.10 less_than( T, Z ), pair_in_list( update_slb( X, T ), Y, Z ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 Y := Y
% 0.73/1.10 Z := Z
% 0.73/1.10 T := T
% 0.73/1.10 end
% 0.73/1.10 permutation0:
% 0.73/1.10 0 ==> 0
% 0.73/1.10 1 ==> 1
% 0.73/1.10 2 ==> 2
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 subsumption: (28) {G0,W4,D2,L1,V0,M1} I { pair_in_list( skol1, skol2, skol4
% 0.73/1.10 ) }.
% 0.73/1.10 parent0: (1646) {G0,W4,D2,L1,V0,M1} { pair_in_list( skol1, skol2, skol4 )
% 0.73/1.10 }.
% 0.73/1.10 substitution0:
% 0.73/1.10 end
% 0.73/1.10 permutation0:
% 0.73/1.10 0 ==> 0
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 subsumption: (30) {G0,W3,D2,L1,V0,M1} I { less_than( skol3, skol4 ) }.
% 0.73/1.10 parent0: (1648) {G0,W3,D2,L1,V0,M1} { less_than( skol3, skol4 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 end
% 0.73/1.10 permutation0:
% 0.73/1.10 0 ==> 0
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 subsumption: (31) {G0,W9,D3,L2,V1,M2} I { ! pair_in_list( update_slb( skol1
% 0.73/1.10 , skol3 ), skol2, X ), ! less_than( skol3, X ) }.
% 0.73/1.10 parent0: (1649) {G0,W9,D3,L2,V1,M2} { ! pair_in_list( update_slb( skol1,
% 0.73/1.10 skol3 ), skol2, X ), ! less_than( skol3, X ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := X
% 0.73/1.10 end
% 0.73/1.10 permutation0:
% 0.73/1.10 0 ==> 0
% 0.73/1.10 1 ==> 1
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 resolution: (1746) {G1,W6,D3,L1,V0,M1} { ! pair_in_list( update_slb( skol1
% 0.73/1.10 , skol3 ), skol2, skol4 ) }.
% 0.73/1.10 parent0[1]: (31) {G0,W9,D3,L2,V1,M2} I { ! pair_in_list( update_slb( skol1
% 0.73/1.10 , skol3 ), skol2, X ), ! less_than( skol3, X ) }.
% 0.73/1.10 parent1[0]: (30) {G0,W3,D2,L1,V0,M1} I { less_than( skol3, skol4 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 X := skol4
% 0.73/1.10 end
% 0.73/1.10 substitution1:
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 subsumption: (1175) {G1,W6,D3,L1,V0,M1} R(31,30) { ! pair_in_list(
% 0.73/1.10 update_slb( skol1, skol3 ), skol2, skol4 ) }.
% 0.73/1.10 parent0: (1746) {G1,W6,D3,L1,V0,M1} { ! pair_in_list( update_slb( skol1,
% 0.73/1.10 skol3 ), skol2, skol4 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 end
% 0.73/1.10 permutation0:
% 0.73/1.10 0 ==> 0
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 resolution: (1747) {G1,W7,D2,L2,V0,M2} { ! pair_in_list( skol1, skol2,
% 0.73/1.10 skol4 ), ! less_than( skol3, skol4 ) }.
% 0.73/1.10 parent0[0]: (1175) {G1,W6,D3,L1,V0,M1} R(31,30) { ! pair_in_list(
% 0.73/1.10 update_slb( skol1, skol3 ), skol2, skol4 ) }.
% 0.73/1.10 parent1[2]: (27) {G0,W13,D3,L3,V4,M3} I { ! pair_in_list( X, Y, Z ), !
% 0.73/1.10 less_than( T, Z ), pair_in_list( update_slb( X, T ), Y, Z ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 end
% 0.73/1.10 substitution1:
% 0.73/1.10 X := skol1
% 0.73/1.10 Y := skol2
% 0.73/1.10 Z := skol4
% 0.73/1.10 T := skol3
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 resolution: (1748) {G1,W3,D2,L1,V0,M1} { ! less_than( skol3, skol4 ) }.
% 0.73/1.10 parent0[0]: (1747) {G1,W7,D2,L2,V0,M2} { ! pair_in_list( skol1, skol2,
% 0.73/1.10 skol4 ), ! less_than( skol3, skol4 ) }.
% 0.73/1.10 parent1[0]: (28) {G0,W4,D2,L1,V0,M1} I { pair_in_list( skol1, skol2, skol4
% 0.73/1.10 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 end
% 0.73/1.10 substitution1:
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 subsumption: (1594) {G2,W3,D2,L1,V0,M1} R(1175,27);r(28) { ! less_than(
% 0.73/1.10 skol3, skol4 ) }.
% 0.73/1.10 parent0: (1748) {G1,W3,D2,L1,V0,M1} { ! less_than( skol3, skol4 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 end
% 0.73/1.10 permutation0:
% 0.73/1.10 0 ==> 0
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 resolution: (1749) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.10 parent0[0]: (1594) {G2,W3,D2,L1,V0,M1} R(1175,27);r(28) { ! less_than(
% 0.73/1.10 skol3, skol4 ) }.
% 0.73/1.10 parent1[0]: (30) {G0,W3,D2,L1,V0,M1} I { less_than( skol3, skol4 ) }.
% 0.73/1.10 substitution0:
% 0.73/1.10 end
% 0.73/1.10 substitution1:
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 subsumption: (1616) {G3,W0,D0,L0,V0,M0} S(1594);r(30) { }.
% 0.73/1.10 parent0: (1749) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.10 substitution0:
% 0.73/1.10 end
% 0.73/1.10 permutation0:
% 0.73/1.10 end
% 0.73/1.10
% 0.73/1.10 Proof check complete!
% 0.73/1.10
% 0.73/1.10 Memory use:
% 0.73/1.10
% 0.73/1.10 space for terms: 26547
% 0.73/1.10 space for clauses: 71994
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 clauses generated: 4975
% 0.73/1.10 clauses kept: 1617
% 0.73/1.10 clauses selected: 132
% 0.73/1.10 clauses deleted: 7
% 0.73/1.10 clauses inuse deleted: 1
% 0.73/1.10
% 0.73/1.10 subsentry: 11895
% 0.73/1.10 literals s-matched: 8700
% 0.73/1.10 literals matched: 8636
% 0.73/1.10 full subsumption: 2915
% 0.73/1.10
% 0.73/1.10 checksum: 156143136
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 Bliksem ended
%------------------------------------------------------------------------------