TSTP Solution File: SWW417-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWW417-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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:05 EDT 2022
% Result : Unsatisfiable 0.49s 1.12s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWW417-1 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.14 % Command : bliksem %s
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % DateTime : Sat Jun 4 12:50:02 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.12 *** allocated 10000 integers for termspace/termends
% 0.49/1.12 *** allocated 10000 integers for clauses
% 0.49/1.12 *** allocated 10000 integers for justifications
% 0.49/1.12 Bliksem 1.12
% 0.49/1.12
% 0.49/1.12
% 0.49/1.12 Automatic Strategy Selection
% 0.49/1.12
% 0.49/1.12 Clauses:
% 0.49/1.12 [
% 0.49/1.12 [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ],
% 0.49/1.12 [ =( sep( lseg( X, X ), Y ), Y ) ],
% 0.49/1.12 [ ~( heap( sep( next( nil, X ), Y ) ) ) ],
% 0.49/1.12 [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ],
% 0.49/1.12 [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) ) ],
% 0.49/1.12 [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Z ) ]
% 0.49/1.12 ,
% 0.49/1.12 [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Y ),
% 0.49/1.12 =( X, Z ) ],
% 0.49/1.12 [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X, Y ),
% 0.49/1.12 heap( sep( lseg( X, Z ), T ) ) ],
% 0.49/1.12 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ), heap( sep(
% 0.49/1.12 lseg( X, nil ), Z ) ) ],
% 0.49/1.12 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next( Z, T ), U )
% 0.49/1.12 ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) ) ],
% 0.49/1.12 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg( Z, T ), U )
% 0.49/1.12 ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T ), U ) ) )
% 0.49/1.12 ],
% 0.49/1.12 [ ~( =( nil, x1 ) ) ],
% 0.49/1.12 [ ~( =( x2, x1 ) ) ],
% 0.49/1.12 [ heap( sep( lseg( x2, nil ), sep( next( x1, x2 ), emp ) ) ) ],
% 0.49/1.12 [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ]
% 0.49/1.12 ] .
% 0.49/1.12
% 0.49/1.12
% 0.49/1.12 percentage equality = 0.400000, percentage horn = 0.800000
% 0.49/1.12 This is a problem with some equality
% 0.49/1.12
% 0.49/1.12
% 0.49/1.12
% 0.49/1.12 Options Used:
% 0.49/1.12
% 0.49/1.12 useres = 1
% 0.49/1.12 useparamod = 1
% 0.49/1.12 useeqrefl = 1
% 0.49/1.12 useeqfact = 1
% 0.49/1.12 usefactor = 1
% 0.49/1.12 usesimpsplitting = 0
% 0.49/1.12 usesimpdemod = 5
% 0.49/1.12 usesimpres = 3
% 0.49/1.12
% 0.49/1.12 resimpinuse = 1000
% 0.49/1.12 resimpclauses = 20000
% 0.49/1.12 substype = eqrewr
% 0.49/1.12 backwardsubs = 1
% 0.49/1.12 selectoldest = 5
% 0.49/1.12
% 0.49/1.12 litorderings [0] = split
% 0.49/1.12 litorderings [1] = extend the termordering, first sorting on arguments
% 0.49/1.12
% 0.49/1.12 termordering = kbo
% 0.49/1.12
% 0.49/1.12 litapriori = 0
% 0.49/1.12 termapriori = 1
% 0.49/1.12 litaposteriori = 0
% 0.49/1.12 termaposteriori = 0
% 0.49/1.12 demodaposteriori = 0
% 0.49/1.12 ordereqreflfact = 0
% 0.49/1.12
% 0.49/1.12 litselect = negord
% 0.49/1.12
% 0.49/1.12 maxweight = 15
% 0.49/1.12 maxdepth = 30000
% 0.49/1.12 maxlength = 115
% 0.49/1.12 maxnrvars = 195
% 0.49/1.12 excuselevel = 1
% 0.49/1.12 increasemaxweight = 1
% 0.49/1.12
% 0.49/1.12 maxselected = 10000000
% 0.49/1.12 maxnrclauses = 10000000
% 0.49/1.12
% 0.49/1.12 showgenerated = 0
% 0.49/1.12 showkept = 0
% 0.49/1.12 showselected = 0
% 0.49/1.12 showdeleted = 0
% 0.49/1.12 showresimp = 1
% 0.49/1.12 showstatus = 2000
% 0.49/1.12
% 0.49/1.12 prologoutput = 1
% 0.49/1.12 nrgoals = 5000000
% 0.49/1.12 totalproof = 1
% 0.49/1.12
% 0.49/1.12 Symbols occurring in the translation:
% 0.49/1.12
% 0.49/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.49/1.12 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.49/1.12 ! [4, 1] (w:0, o:20, a:1, s:1, b:0),
% 0.49/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.49/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.49/1.12 sep [42, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.49/1.12 lseg [44, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.49/1.12 nil [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.49/1.12 next [47, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.49/1.12 heap [48, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.49/1.12 x1 [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.49/1.12 x2 [52, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.49/1.12 emp [53, 0] (w:1, o:19, a:1, s:1, b:0).
% 0.49/1.12
% 0.49/1.12
% 0.49/1.12 Starting Search:
% 0.49/1.12
% 0.49/1.12
% 0.49/1.12 Bliksems!, er is een bewijs:
% 0.49/1.12 % SZS status Unsatisfiable
% 0.49/1.12 % SZS output start Refutation
% 0.49/1.12
% 0.49/1.12 clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 0.49/1.12 .
% 0.49/1.12 clause( 2, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 0.49/1.12 .
% 0.49/1.12 clause( 5, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 0.49/1.12 , Z ) ] )
% 0.49/1.12 .
% 0.49/1.12 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 0.49/1.12 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 0.49/1.12 .
% 0.49/1.12 clause( 13, [ heap( sep( lseg( x2, nil ), sep( next( x1, x2 ), emp ) ) ) ]
% 0.49/1.12 )
% 0.49/1.12 .
% 0.49/1.12 clause( 14, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 0.49/1.12 .
% 0.49/1.12 clause( 112, [ ~( heap( sep( next( X, Y ), Z ) ) ), ~( heap( sep( next( X,
% 0.49/1.12 T ), sep( lseg( X, nil ), U ) ) ) ) ] )
% 0.49/1.12 .
% 0.49/1.12 clause( 120, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) ) ) ) ]
% 0.49/1.12 )
% 0.49/1.12 .
% 0.49/1.12 clause( 121, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) ) ) ]
% 0.49/1.12 )
% 0.49/1.12 .
% 0.49/1.12 clause( 439, [ heap( sep( next( x1, x2 ), sep( lseg( x2, nil ), emp ) ) ) ]
% 0.49/1.12 )
% 0.49/1.12 .
% 0.49/1.12 clause( 440, [ =( x2, x1 ) ] )
% 0.49/1.12 .
% 0.49/1.12 clause( 448, [] )
% 0.49/1.12 .
% 0.49/1.12
% 0.49/1.12
% 0.49/1.12 % SZS output end Refutation
% 71.61/71.99 found a proof!
% 71.61/71.99
% 71.61/71.99 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 71.61/71.99
% 71.61/71.99 initialclauses(
% 71.61/71.99 [ clause( 450, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 71.61/71.99 , clause( 451, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 71.61/71.99 , clause( 452, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 71.61/71.99 , clause( 453, [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ] )
% 71.61/71.99 , clause( 454, [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) ) ]
% 71.61/71.99 )
% 71.61/71.99 , clause( 455, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ),
% 71.61/71.99 =( X, Z ) ] )
% 71.61/71.99 , clause( 456, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ),
% 71.61/71.99 =( X, Y ), =( X, Z ) ] )
% 71.61/71.99 , clause( 457, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ),
% 71.61/71.99 =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 71.61/71.99 , clause( 458, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) )
% 71.61/71.99 , heap( sep( lseg( X, nil ), Z ) ) ] )
% 71.61/71.99 , clause( 459, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next(
% 71.61/71.99 Z, T ), U ) ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , clause( 460, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg(
% 71.61/71.99 Z, T ), U ) ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T
% 71.61/71.99 ), U ) ) ) ] )
% 71.61/71.99 , clause( 461, [ ~( =( nil, x1 ) ) ] )
% 71.61/71.99 , clause( 462, [ ~( =( x2, x1 ) ) ] )
% 71.61/71.99 , clause( 463, [ heap( sep( lseg( x2, nil ), sep( next( x1, x2 ), emp ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , clause( 464, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 71.61/71.99 ] ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 71.61/71.99 , clause( 450, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 71.61/71.99 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 71.61/71.99 permutation( 0, [ ==>( 0, 0 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 2, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 71.61/71.99 , clause( 452, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 71.61/71.99 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 71.61/71.99 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 5, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 71.61/71.99 , Z ) ] )
% 71.61/71.99 , clause( 455, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ),
% 71.61/71.99 =( X, Z ) ] )
% 71.61/71.99 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 71.61/71.99 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 71.61/71.99 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 71.61/71.99 , clause( 457, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ),
% 71.61/71.99 =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 71.61/71.99 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 71.61/71.99 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 13, [ heap( sep( lseg( x2, nil ), sep( next( x1, x2 ), emp ) ) ) ]
% 71.61/71.99 )
% 71.61/71.99 , clause( 463, [ heap( sep( lseg( x2, nil ), sep( next( x1, x2 ), emp ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 14, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 71.61/71.99 , clause( 464, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 71.61/71.99 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 eqswap(
% 71.61/71.99 clause( 502, [ =( Y, X ), ~( heap( sep( next( X, Z ), sep( lseg( X, Y ), T
% 71.61/71.99 ) ) ) ) ] )
% 71.61/71.99 , clause( 5, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ),
% 71.61/71.99 =( X, Z ) ] )
% 71.61/71.99 , 1, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y ), :=( T, T )] )
% 71.61/71.99 ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 paramod(
% 71.61/71.99 clause( 505, [ ~( heap( sep( next( Z, X ), Y ) ) ), ~( heap( sep( next( Z,
% 71.61/71.99 T ), sep( lseg( Z, nil ), U ) ) ) ) ] )
% 71.61/71.99 , clause( 502, [ =( Y, X ), ~( heap( sep( next( X, Z ), sep( lseg( X, Y ),
% 71.61/71.99 T ) ) ) ) ] )
% 71.61/71.99 , 0, clause( 2, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 71.61/71.99 , 0, 4, substitution( 0, [ :=( X, Z ), :=( Y, nil ), :=( Z, T ), :=( T, U )] )
% 71.61/71.99 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 112, [ ~( heap( sep( next( X, Y ), Z ) ) ), ~( heap( sep( next( X,
% 71.61/71.99 T ), sep( lseg( X, nil ), U ) ) ) ) ] )
% 71.61/71.99 , clause( 505, [ ~( heap( sep( next( Z, X ), Y ) ) ), ~( heap( sep( next( Z
% 71.61/71.99 , T ), sep( lseg( Z, nil ), U ) ) ) ) ] )
% 71.61/71.99 , substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X ), :=( T, T ), :=( U
% 71.61/71.99 , U )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 factor(
% 71.61/71.99 clause( 58939, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , clause( 112, [ ~( heap( sep( next( X, Y ), Z ) ) ), ~( heap( sep( next( X
% 71.61/71.99 , T ), sep( lseg( X, nil ), U ) ) ) ) ] )
% 71.61/71.99 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, sep( lseg( X, nil
% 71.61/71.99 ), Z ) ), :=( T, Y ), :=( U, Z )] )).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 120, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) ) ) ) ]
% 71.61/71.99 )
% 71.61/71.99 , clause( 58939, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) ) )
% 71.61/71.99 ) ] )
% 71.61/71.99 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 71.61/71.99 permutation( 0, [ ==>( 0, 0 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 paramod(
% 71.61/71.99 clause( 58940, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 71.61/71.99 , 0, clause( 120, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) )
% 71.61/71.99 ) ) ] )
% 71.61/71.99 , 0, 2, substitution( 0, [ :=( X, next( X, Y ) ), :=( Y, lseg( X, nil ) ),
% 71.61/71.99 :=( Z, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 71.61/71.99 ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 121, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) ) ) ]
% 71.61/71.99 )
% 71.61/71.99 , clause( 58940, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) )
% 71.61/71.99 ) ] )
% 71.61/71.99 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 71.61/71.99 permutation( 0, [ ==>( 0, 0 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 paramod(
% 71.61/71.99 clause( 58947, [ heap( sep( next( x1, x2 ), sep( lseg( x2, nil ), emp ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 71.61/71.99 , 0, clause( 13, [ heap( sep( lseg( x2, nil ), sep( next( x1, x2 ), emp ) )
% 71.61/71.99 ) ] )
% 71.61/71.99 , 0, 1, substitution( 0, [ :=( X, lseg( x2, nil ) ), :=( Y, next( x1, x2 )
% 71.61/71.99 ), :=( Z, emp )] ), substitution( 1, [] )).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 439, [ heap( sep( next( x1, x2 ), sep( lseg( x2, nil ), emp ) ) ) ]
% 71.61/71.99 )
% 71.61/71.99 , clause( 58947, [ heap( sep( next( x1, x2 ), sep( lseg( x2, nil ), emp ) )
% 71.61/71.99 ) ] )
% 71.61/71.99 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 eqswap(
% 71.61/71.99 clause( 58949, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ),
% 71.61/71.99 T ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 71.61/71.99 , clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ),
% 71.61/71.99 =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 71.61/71.99 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 71.61/71.99 ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 resolution(
% 71.61/71.99 clause( 58950, [ =( x2, x1 ), heap( sep( lseg( x1, nil ), emp ) ) ] )
% 71.61/71.99 , clause( 58949, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z )
% 71.61/71.99 , T ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 71.61/71.99 , 1, clause( 439, [ heap( sep( next( x1, x2 ), sep( lseg( x2, nil ), emp )
% 71.61/71.99 ) ) ] )
% 71.61/71.99 , 0, substitution( 0, [ :=( X, x1 ), :=( Y, x2 ), :=( Z, nil ), :=( T, emp
% 71.61/71.99 )] ), substitution( 1, [] )).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 resolution(
% 71.61/71.99 clause( 58951, [ =( x2, x1 ) ] )
% 71.61/71.99 , clause( 14, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 71.61/71.99 , 0, clause( 58950, [ =( x2, x1 ), heap( sep( lseg( x1, nil ), emp ) ) ] )
% 71.61/71.99 , 1, substitution( 0, [] ), substitution( 1, [] )).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 440, [ =( x2, x1 ) ] )
% 71.61/71.99 , clause( 58951, [ =( x2, x1 ) ] )
% 71.61/71.99 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 paramod(
% 71.61/71.99 clause( 58954, [ heap( sep( lseg( x2, nil ), sep( next( x1, x2 ), emp ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 71.61/71.99 , 0, clause( 439, [ heap( sep( next( x1, x2 ), sep( lseg( x2, nil ), emp )
% 71.61/71.99 ) ) ] )
% 71.61/71.99 , 0, 1, substitution( 0, [ :=( X, next( x1, x2 ) ), :=( Y, lseg( x2, nil )
% 71.61/71.99 ), :=( Z, emp )] ), substitution( 1, [] )).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 paramod(
% 71.61/71.99 clause( 58957, [ heap( sep( lseg( x2, nil ), sep( next( x1, x1 ), emp ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , clause( 440, [ =( x2, x1 ) ] )
% 71.61/71.99 , 0, clause( 58954, [ heap( sep( lseg( x2, nil ), sep( next( x1, x2 ), emp
% 71.61/71.99 ) ) ) ] )
% 71.61/71.99 , 0, 8, substitution( 0, [] ), substitution( 1, [] )).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 paramod(
% 71.61/71.99 clause( 58958, [ heap( sep( lseg( x1, nil ), sep( next( x1, x1 ), emp ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , clause( 440, [ =( x2, x1 ) ] )
% 71.61/71.99 , 0, clause( 58957, [ heap( sep( lseg( x2, nil ), sep( next( x1, x1 ), emp
% 71.61/71.99 ) ) ) ] )
% 71.61/71.99 , 0, 3, substitution( 0, [] ), substitution( 1, [] )).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 resolution(
% 71.61/71.99 clause( 58959, [] )
% 71.61/71.99 , clause( 121, [ ~( heap( sep( lseg( X, nil ), sep( next( X, Y ), Z ) ) ) )
% 71.61/71.99 ] )
% 71.61/71.99 , 0, clause( 58958, [ heap( sep( lseg( x1, nil ), sep( next( x1, x1 ), emp
% 71.61/71.99 ) ) ) ] )
% 71.61/71.99 , 0, substitution( 0, [ :=( X, x1 ), :=( Y, x1 ), :=( Z, emp )] ),
% 71.61/71.99 substitution( 1, [] )).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 subsumption(
% 71.61/71.99 clause( 448, [] )
% 71.61/71.99 , clause( 58959, [] )
% 71.61/71.99 , substitution( 0, [] ), permutation( 0, [] ) ).
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 end.
% 71.61/71.99
% 71.61/71.99 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 71.61/71.99
% 71.61/71.99 Memory use:
% 71.61/71.99
% 71.61/71.99 space for terms: 11416
% 71.61/71.99 space for clauses: 28908
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 clauses generated: 2551
% 71.61/71.99 clauses kept: 449
% 71.61/71.99 clauses selected: 28
% 71.61/71.99 clauses deleted: 2
% 71.61/71.99 clauses inuse deleted: 0
% 71.61/71.99
% 71.61/71.99 subsentry: 634458617
% 71.61/71.99 literals s-matched: 4979555
% 71.61/71.99 literals matched: 2837316
% 71.61/71.99 full subsumption: 2790962
% 71.61/71.99
% 71.61/71.99 checksum: -74356540
% 71.61/71.99
% 71.61/71.99
% 71.61/71.99 Bliksem ended
%------------------------------------------------------------------------------