TSTP Solution File: SWW413-1 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SWW413-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n032.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 23:22:04 EDT 2022

% Result   : Unsatisfiable 0.51s 0.92s
% Output   : Refutation 70.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SWW413-1 : TPTP v8.1.0. Released v5.2.0.
% 0.00/0.09  % Command  : bliksem %s
% 0.09/0.28  % Computer : n032.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % DateTime : Sun Jun  5 23:35:49 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.51/0.92  *** allocated 10000 integers for termspace/termends
% 0.51/0.92  *** allocated 10000 integers for clauses
% 0.51/0.92  *** allocated 10000 integers for justifications
% 0.51/0.92  Bliksem 1.12
% 0.51/0.92  
% 0.51/0.92  
% 0.51/0.92  Automatic Strategy Selection
% 0.51/0.92  
% 0.51/0.92  Clauses:
% 0.51/0.92  [
% 0.51/0.92     [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ],
% 0.51/0.92     [ =( sep( lseg( X, X ), Y ), Y ) ],
% 0.51/0.92     [ ~( heap( sep( next( nil, X ), Y ) ) ) ],
% 0.51/0.92     [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ],
% 0.51/0.92     [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) ) ],
% 0.51/0.92     [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Z ) ]
% 0.51/0.92    ,
% 0.51/0.92     [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Y ), 
% 0.51/0.92    =( X, Z ) ],
% 0.51/0.92     [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X, Y ), 
% 0.51/0.92    heap( sep( lseg( X, Z ), T ) ) ],
% 0.51/0.92     [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ), heap( sep( 
% 0.51/0.92    lseg( X, nil ), Z ) ) ],
% 0.51/0.92     [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next( Z, T ), U )
% 0.51/0.92     ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) ) ],
% 0.51/0.92     [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg( Z, T ), U )
% 0.51/0.92     ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T ), U ) ) )
% 0.51/0.92     ],
% 0.51/0.92     [ ~( =( nil, x1 ) ) ],
% 0.51/0.92     [ ~( =( nil, x2 ) ) ],
% 0.51/0.92     [ ~( =( x3, x2 ) ) ],
% 0.51/0.92     [ ~( =( x4, x1 ) ) ],
% 0.51/0.92     [ ~( =( x4, x2 ) ) ],
% 0.51/0.92     [ ~( =( x1, x2 ) ) ],
% 0.51/0.92     [ heap( sep( lseg( x3, nil ), sep( next( x2, x3 ), emp ) ) ) ],
% 0.51/0.92     [ ~( heap( sep( lseg( x2, nil ), emp ) ) ) ]
% 0.51/0.92  ] .
% 0.51/0.92  
% 0.51/0.92  
% 0.51/0.92  percentage equality = 0.482759, percentage horn = 0.842105
% 0.51/0.92  This is a problem with some equality
% 0.51/0.92  
% 0.51/0.92  
% 0.51/0.92  
% 0.51/0.92  Options Used:
% 0.51/0.92  
% 0.51/0.92  useres =            1
% 0.51/0.92  useparamod =        1
% 0.51/0.92  useeqrefl =         1
% 0.51/0.92  useeqfact =         1
% 0.51/0.92  usefactor =         1
% 0.51/0.92  usesimpsplitting =  0
% 0.51/0.92  usesimpdemod =      5
% 0.51/0.92  usesimpres =        3
% 0.51/0.92  
% 0.51/0.92  resimpinuse      =  1000
% 0.51/0.92  resimpclauses =     20000
% 0.51/0.92  substype =          eqrewr
% 0.51/0.92  backwardsubs =      1
% 0.51/0.92  selectoldest =      5
% 0.51/0.92  
% 0.51/0.92  litorderings [0] =  split
% 0.51/0.92  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.51/0.92  
% 0.51/0.92  termordering =      kbo
% 0.51/0.92  
% 0.51/0.92  litapriori =        0
% 0.51/0.92  termapriori =       1
% 0.51/0.92  litaposteriori =    0
% 0.51/0.92  termaposteriori =   0
% 0.51/0.92  demodaposteriori =  0
% 0.51/0.92  ordereqreflfact =   0
% 0.51/0.92  
% 0.51/0.92  litselect =         negord
% 0.51/0.92  
% 0.51/0.92  maxweight =         15
% 0.51/0.92  maxdepth =          30000
% 0.51/0.92  maxlength =         115
% 0.51/0.92  maxnrvars =         195
% 0.51/0.92  excuselevel =       1
% 0.51/0.92  increasemaxweight = 1
% 0.51/0.92  
% 0.51/0.92  maxselected =       10000000
% 0.51/0.92  maxnrclauses =      10000000
% 0.51/0.92  
% 0.51/0.92  showgenerated =    0
% 0.51/0.92  showkept =         0
% 0.51/0.92  showselected =     0
% 0.51/0.92  showdeleted =      0
% 0.51/0.92  showresimp =       1
% 0.51/0.92  showstatus =       2000
% 0.51/0.92  
% 0.51/0.92  prologoutput =     1
% 0.51/0.92  nrgoals =          5000000
% 0.51/0.92  totalproof =       1
% 0.51/0.92  
% 0.51/0.92  Symbols occurring in the translation:
% 0.51/0.92  
% 0.51/0.92  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.51/0.92  .  [1, 2]      (w:1, o:28, a:1, s:1, b:0), 
% 0.51/0.92  !  [4, 1]      (w:0, o:22, a:1, s:1, b:0), 
% 0.51/0.92  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.51/0.92  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.51/0.92  sep  [42, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 0.51/0.92  lseg  [44, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 0.51/0.92  nil  [45, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.51/0.92  next  [47, 2]      (w:1, o:55, a:1, s:1, b:0), 
% 0.51/0.92  heap  [48, 1]      (w:1, o:27, a:1, s:1, b:0), 
% 0.51/0.92  x1  [51, 0]      (w:1, o:17, a:1, s:1, b:0), 
% 0.51/0.92  x2  [52, 0]      (w:1, o:18, a:1, s:1, b:0), 
% 0.51/0.92  x3  [53, 0]      (w:1, o:19, a:1, s:1, b:0), 
% 0.51/0.92  x4  [54, 0]      (w:1, o:20, a:1, s:1, b:0), 
% 0.51/0.92  emp  [55, 0]      (w:1, o:21, a:1, s:1, b:0).
% 0.51/0.92  
% 0.51/0.92  
% 0.51/0.92  Starting Search:
% 0.51/0.92  
% 0.51/0.92  
% 0.51/0.92  Bliksems!, er is een bewijs:
% 0.51/0.92  % SZS status Unsatisfiable
% 0.51/0.92  % SZS output start Refutation
% 0.51/0.92  
% 0.51/0.92  clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 0.51/0.92  .
% 0.51/0.92  clause( 2, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 0.51/0.92  .
% 0.51/0.92  clause( 5, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 0.51/0.92    , Z ) ] )
% 0.51/0.92  .
% 0.51/0.92  clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 0.51/0.92    , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 0.51/0.92  .
% 0.51/0.92  clause( 17, [ heap( sep( lseg( x3, nil ), sep( next( x2, x3 ), emp ) ) ) ]
% 0.51/0.92     )
% 0.51/0.92  .
% 0.51/0.92  clause( 18, [ ~( heap( sep( lseg( x2, nil ), emp ) ) ) ] )
% 0.51/0.92  .
% 0.51/0.92  clause( 121, [ ~( heap( sep( next( X, Y ), Z ) ) ), ~( heap( sep( next( X, 
% 0.51/0.92    T ), sep( lseg( X, nil ), U ) ) ) ) ] )
% 0.51/0.92  .
% 0.51/0.92  clause( 150, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) ) ) ) ]
% 0.51/0.92     )
% 0.51/0.92  .
% 0.51/0.92  clause( 151, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) ) ) ]
% 70.52/70.95     )
% 70.52/70.95  .
% 70.52/70.95  clause( 887, [ heap( sep( next( x2, x3 ), sep( lseg( x3, nil ), emp ) ) ) ]
% 70.52/70.95     )
% 70.52/70.95  .
% 70.52/70.95  clause( 940, [ =( x3, x2 ) ] )
% 70.52/70.95  .
% 70.52/70.95  clause( 953, [] )
% 70.52/70.95  .
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  % SZS output end Refutation
% 70.52/70.95  found a proof!
% 70.52/70.95  
% 70.52/70.95  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 70.52/70.95  
% 70.52/70.95  initialclauses(
% 70.52/70.95  [ clause( 955, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 70.52/70.95  , clause( 956, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 70.52/70.95  , clause( 957, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 70.52/70.95  , clause( 958, [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ] )
% 70.52/70.95  , clause( 959, [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) ) ]
% 70.52/70.95     )
% 70.52/70.95  , clause( 960, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), 
% 70.52/70.95    =( X, Z ) ] )
% 70.52/70.95  , clause( 961, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), 
% 70.52/70.95    =( X, Y ), =( X, Z ) ] )
% 70.52/70.95  , clause( 962, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), 
% 70.52/70.95    =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 70.52/70.95  , clause( 963, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) )
% 70.52/70.95    , heap( sep( lseg( X, nil ), Z ) ) ] )
% 70.52/70.95  , clause( 964, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next( 
% 70.52/70.95    Z, T ), U ) ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , clause( 965, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg( 
% 70.52/70.95    Z, T ), U ) ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T
% 70.52/70.95     ), U ) ) ) ] )
% 70.52/70.95  , clause( 966, [ ~( =( nil, x1 ) ) ] )
% 70.52/70.95  , clause( 967, [ ~( =( nil, x2 ) ) ] )
% 70.52/70.95  , clause( 968, [ ~( =( x3, x2 ) ) ] )
% 70.52/70.95  , clause( 969, [ ~( =( x4, x1 ) ) ] )
% 70.52/70.95  , clause( 970, [ ~( =( x4, x2 ) ) ] )
% 70.52/70.95  , clause( 971, [ ~( =( x1, x2 ) ) ] )
% 70.52/70.95  , clause( 972, [ heap( sep( lseg( x3, nil ), sep( next( x2, x3 ), emp ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , clause( 973, [ ~( heap( sep( lseg( x2, nil ), emp ) ) ) ] )
% 70.52/70.95  ] ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 70.52/70.95  , clause( 955, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 70.52/70.95  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 70.52/70.95    permutation( 0, [ ==>( 0, 0 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 2, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 70.52/70.95  , clause( 957, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 70.52/70.95  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 70.52/70.95     )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 5, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 70.52/70.95    , Z ) ] )
% 70.52/70.95  , clause( 960, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), 
% 70.52/70.95    =( X, Z ) ] )
% 70.52/70.95  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ), 
% 70.52/70.95    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 70.52/70.95    , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 70.52/70.95  , clause( 962, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), 
% 70.52/70.95    =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 70.52/70.95  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ), 
% 70.52/70.95    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 17, [ heap( sep( lseg( x3, nil ), sep( next( x2, x3 ), emp ) ) ) ]
% 70.52/70.95     )
% 70.52/70.95  , clause( 972, [ heap( sep( lseg( x3, nil ), sep( next( x2, x3 ), emp ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 18, [ ~( heap( sep( lseg( x2, nil ), emp ) ) ) ] )
% 70.52/70.95  , clause( 973, [ ~( heap( sep( lseg( x2, nil ), emp ) ) ) ] )
% 70.52/70.95  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  eqswap(
% 70.52/70.95  clause( 1019, [ =( Y, X ), ~( heap( sep( next( X, Z ), sep( lseg( X, Y ), T
% 70.52/70.95     ) ) ) ) ] )
% 70.52/70.95  , clause( 5, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), 
% 70.52/70.95    =( X, Z ) ] )
% 70.52/70.95  , 1, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y ), :=( T, T )] )
% 70.52/70.95    ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  paramod(
% 70.52/70.95  clause( 1022, [ ~( heap( sep( next( Z, X ), Y ) ) ), ~( heap( sep( next( Z
% 70.52/70.95    , T ), sep( lseg( Z, nil ), U ) ) ) ) ] )
% 70.52/70.95  , clause( 1019, [ =( Y, X ), ~( heap( sep( next( X, Z ), sep( lseg( X, Y )
% 70.52/70.95    , T ) ) ) ) ] )
% 70.52/70.95  , 0, clause( 2, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 70.52/70.95  , 0, 4, substitution( 0, [ :=( X, Z ), :=( Y, nil ), :=( Z, T ), :=( T, U )] )
% 70.52/70.95    , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 121, [ ~( heap( sep( next( X, Y ), Z ) ) ), ~( heap( sep( next( X, 
% 70.52/70.95    T ), sep( lseg( X, nil ), U ) ) ) ) ] )
% 70.52/70.95  , clause( 1022, [ ~( heap( sep( next( Z, X ), Y ) ) ), ~( heap( sep( next( 
% 70.52/70.95    Z, T ), sep( lseg( Z, nil ), U ) ) ) ) ] )
% 70.52/70.95  , substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X ), :=( T, T ), :=( U
% 70.52/70.95    , U )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  factor(
% 70.52/70.95  clause( 59456, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , clause( 121, [ ~( heap( sep( next( X, Y ), Z ) ) ), ~( heap( sep( next( X
% 70.52/70.95    , T ), sep( lseg( X, nil ), U ) ) ) ) ] )
% 70.52/70.95  , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, sep( lseg( X, nil
% 70.52/70.95     ), Z ) ), :=( T, Y ), :=( U, Z )] )).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 150, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) ) ) ) ]
% 70.52/70.95     )
% 70.52/70.95  , clause( 59456, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) ) )
% 70.52/70.95     ) ] )
% 70.52/70.95  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 70.52/70.95    permutation( 0, [ ==>( 0, 0 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  paramod(
% 70.52/70.95  clause( 59457, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 70.52/70.95  , 0, clause( 150, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) )
% 70.52/70.95     ) ) ] )
% 70.52/70.95  , 0, 2, substitution( 0, [ :=( X, next( X, Y ) ), :=( Y, lseg( X, nil ) ), 
% 70.52/70.95    :=( Z, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 70.52/70.95    ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 151, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) ) ) ]
% 70.52/70.95     )
% 70.52/70.95  , clause( 59457, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) )
% 70.52/70.95     ) ] )
% 70.52/70.95  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 70.52/70.95    permutation( 0, [ ==>( 0, 0 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  paramod(
% 70.52/70.95  clause( 59464, [ heap( sep( next( x2, x3 ), sep( lseg( x3, nil ), emp ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 70.52/70.95  , 0, clause( 17, [ heap( sep( lseg( x3, nil ), sep( next( x2, x3 ), emp ) )
% 70.52/70.95     ) ] )
% 70.52/70.95  , 0, 1, substitution( 0, [ :=( X, lseg( x3, nil ) ), :=( Y, next( x2, x3 )
% 70.52/70.95     ), :=( Z, emp )] ), substitution( 1, [] )).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 887, [ heap( sep( next( x2, x3 ), sep( lseg( x3, nil ), emp ) ) ) ]
% 70.52/70.95     )
% 70.52/70.95  , clause( 59464, [ heap( sep( next( x2, x3 ), sep( lseg( x3, nil ), emp ) )
% 70.52/70.95     ) ] )
% 70.52/70.95  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  eqswap(
% 70.52/70.95  clause( 59466, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), 
% 70.52/70.95    T ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 70.52/70.95  , clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), 
% 70.52/70.95    =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 70.52/70.95  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 70.52/70.95    ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  resolution(
% 70.52/70.95  clause( 59467, [ =( x3, x2 ), heap( sep( lseg( x2, nil ), emp ) ) ] )
% 70.52/70.95  , clause( 59466, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z )
% 70.52/70.95    , T ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 70.52/70.95  , 1, clause( 887, [ heap( sep( next( x2, x3 ), sep( lseg( x3, nil ), emp )
% 70.52/70.95     ) ) ] )
% 70.52/70.95  , 0, substitution( 0, [ :=( X, x2 ), :=( Y, x3 ), :=( Z, nil ), :=( T, emp
% 70.52/70.95     )] ), substitution( 1, [] )).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  resolution(
% 70.52/70.95  clause( 59468, [ =( x3, x2 ) ] )
% 70.52/70.95  , clause( 18, [ ~( heap( sep( lseg( x2, nil ), emp ) ) ) ] )
% 70.52/70.95  , 0, clause( 59467, [ =( x3, x2 ), heap( sep( lseg( x2, nil ), emp ) ) ] )
% 70.52/70.95  , 1, substitution( 0, [] ), substitution( 1, [] )).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 940, [ =( x3, x2 ) ] )
% 70.52/70.95  , clause( 59468, [ =( x3, x2 ) ] )
% 70.52/70.95  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  paramod(
% 70.52/70.95  clause( 59471, [ heap( sep( lseg( x3, nil ), sep( next( x2, x3 ), emp ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 70.52/70.95  , 0, clause( 887, [ heap( sep( next( x2, x3 ), sep( lseg( x3, nil ), emp )
% 70.52/70.95     ) ) ] )
% 70.52/70.95  , 0, 1, substitution( 0, [ :=( X, next( x2, x3 ) ), :=( Y, lseg( x3, nil )
% 70.52/70.95     ), :=( Z, emp )] ), substitution( 1, [] )).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  paramod(
% 70.52/70.95  clause( 59474, [ heap( sep( lseg( x3, nil ), sep( next( x2, x2 ), emp ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , clause( 940, [ =( x3, x2 ) ] )
% 70.52/70.95  , 0, clause( 59471, [ heap( sep( lseg( x3, nil ), sep( next( x2, x3 ), emp
% 70.52/70.95     ) ) ) ] )
% 70.52/70.95  , 0, 8, substitution( 0, [] ), substitution( 1, [] )).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  paramod(
% 70.52/70.95  clause( 59475, [ heap( sep( lseg( x2, nil ), sep( next( x2, x2 ), emp ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , clause( 940, [ =( x3, x2 ) ] )
% 70.52/70.95  , 0, clause( 59474, [ heap( sep( lseg( x3, nil ), sep( next( x2, x2 ), emp
% 70.52/70.95     ) ) ) ] )
% 70.52/70.95  , 0, 3, substitution( 0, [] ), substitution( 1, [] )).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  resolution(
% 70.52/70.95  clause( 59476, [] )
% 70.52/70.95  , clause( 151, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) ) )
% 70.52/70.95     ] )
% 70.52/70.95  , 0, clause( 59475, [ heap( sep( lseg( x2, nil ), sep( next( x2, x2 ), emp
% 70.52/70.95     ) ) ) ] )
% 70.52/70.95  , 0, substitution( 0, [ :=( X, x2 ), :=( Y, x2 ), :=( Z, emp )] ), 
% 70.52/70.95    substitution( 1, [] )).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  subsumption(
% 70.52/70.95  clause( 953, [] )
% 70.52/70.95  , clause( 59476, [] )
% 70.52/70.95  , substitution( 0, [] ), permutation( 0, [] ) ).
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  end.
% 70.52/70.95  
% 70.52/70.95  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 70.52/70.95  
% 70.52/70.95  Memory use:
% 70.52/70.95  
% 70.52/70.95  space for terms:        28376
% 70.52/70.95  space for clauses:      57350
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  clauses generated:      8779
% 70.52/70.95  clauses kept:           954
% 70.52/70.95  clauses selected:       67
% 70.52/70.95  clauses deleted:        3
% 70.52/70.95  clauses inuse deleted:  0
% 70.52/70.95  
% 70.52/70.95  subsentry:          634460467
% 70.52/70.95  literals s-matched: 4980597
% 70.52/70.95  literals matched:   2838329
% 70.52/70.95  full subsumption:   2791640
% 70.52/70.95  
% 70.52/70.95  checksum:           2081102827
% 70.52/70.95  
% 70.52/70.95  
% 70.52/70.95  Bliksem ended
%------------------------------------------------------------------------------