%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWW399-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:03 EDT 2022
% Result : Unsatisfiable 0.82s 1.19s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SWW399-1 : TPTP v8.1.0. Released v5.2.0.
% 0.09/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sat Jun 4 16:20:52 EDT 2022
% 0.12/0.33 % 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 Clauses:
% 0.82/1.19 [
% 0.82/1.19 [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ],
% 0.82/1.19 [ =( sep( lseg( X, X ), Y ), Y ) ],
% 0.82/1.19 [ ~( heap( sep( next( nil, X ), Y ) ) ) ],
% 0.82/1.19 [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ],
% 0.82/1.19 [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) ) ],
% 0.82/1.19 [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Z ) ]
% 0.82/1.19 ,
% 0.82/1.19 [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Y ),
% 0.82/1.19 =( X, Z ) ],
% 0.82/1.19 [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X, Y ),
% 0.82/1.19 heap( sep( lseg( X, Z ), T ) ) ],
% 0.82/1.19 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ), heap( sep(
% 0.82/1.19 lseg( X, nil ), Z ) ) ],
% 0.82/1.19 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next( Z, T ), U )
% 0.82/1.19 ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) ) ],
% 0.82/1.19 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg( Z, T ), U )
% 0.82/1.19 ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T ), U ) ) )
% 0.82/1.19 ],
% 0.82/1.19 [ ~( =( nil, x1 ) ) ],
% 0.82/1.19 [ heap( sep( next( x1, nil ), emp ) ) ],
% 0.82/1.19 [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ]
% 0.82/1.19 ] .
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 percentage equality = 0.375000, percentage horn = 0.785714
% 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 = 1
% 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:25, a:1, s:1, b:0),
% 0.82/1.19 ! [4, 1] (w:0, o:19, 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 sep [42, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.82/1.19 lseg [44, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.82/1.19 nil [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.82/1.19 next [47, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.82/1.19 heap [48, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.82/1.19 x1 [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.82/1.19 emp [52, 0] (w:1, o:18, a:1, s:1, b:0).
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Starting Search:
% 0.82/1.19
% 0.82/1.19
% 0.82/1.19 Bliksems!, er is een bewijs:
% 0.82/1.19 % SZS status Unsatisfiable
% 0.82/1.19 % SZS output start Refutation
% 0.82/1.19
% 0.82/1.19 clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 6, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 0.82/1.19 , Y ), =( X, Z ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 0.82/1.19 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 11, [ ~( =( x1, nil ) ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 12, [ heap( sep( next( x1, nil ), emp ) ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 13, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 14, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Y ), Z ) ) ) ), =(
% 0.82/1.19 X, Y ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 275, [ ~( heap( sep( next( x1, X ), sep( lseg( X, nil ), emp ) ) )
% 0.82/1.19 ), =( x1, X ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 767, [ ~( =( X, nil ) ), ~( heap( sep( lseg( X, x1 ), sep( lseg( X
% 0.82/1.19 , x1 ), Y ) ) ) ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 860, [ ~( heap( X ) ) ] )
% 0.82/1.19 .
% 0.82/1.19 clause( 862, [] )
% 0.82/1.19 .
% 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 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.82/1.19
% 0.82/1.19 initialclauses(
% 0.82/1.19 [ clause( 864, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 0.82/1.19 , clause( 865, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 0.82/1.19 , clause( 866, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 0.82/1.20 , clause( 867, [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ] )
% 0.82/1.20 , clause( 868, [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) ) ]
% 0.82/1.20 )
% 0.82/1.20 , clause( 869, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ),
% 0.82/1.20 =( X, Z ) ] )
% 0.82/1.20 , clause( 870, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ),
% 0.82/1.20 =( X, Y ), =( X, Z ) ] )
% 0.82/1.20 , clause( 871, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ),
% 0.82/1.20 =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 0.82/1.20 , clause( 872, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) )
% 0.82/1.20 , heap( sep( lseg( X, nil ), Z ) ) ] )
% 0.82/1.20 , clause( 873, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next(
% 0.82/1.20 Z, T ), U ) ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) )
% 0.82/1.20 ] )
% 0.82/1.20 , clause( 874, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg(
% 0.82/1.20 Z, T ), U ) ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T
% 0.82/1.20 ), U ) ) ) ] )
% 0.82/1.20 , clause( 875, [ ~( =( nil, x1 ) ) ] )
% 0.82/1.20 , clause( 876, [ heap( sep( next( x1, nil ), emp ) ) ] )
% 0.82/1.20 , clause( 877, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 0.82/1.20 ] ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 subsumption(
% 0.82/1.20 clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 0.82/1.20 , clause( 865, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 0.82/1.20 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.82/1.20 )] ) ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 subsumption(
% 0.82/1.20 clause( 6, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 0.82/1.20 , Y ), =( X, Z ) ] )
% 0.82/1.20 , clause( 870, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ),
% 0.82/1.20 =( X, Y ), =( X, Z ) ] )
% 0.82/1.20 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.82/1.20 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 subsumption(
% 0.82/1.20 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 0.82/1.20 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 0.82/1.20 , clause( 871, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ),
% 0.82/1.20 =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 0.82/1.20 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.82/1.20 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 eqswap(
% 0.82/1.20 clause( 906, [ ~( =( x1, nil ) ) ] )
% 0.82/1.20 , clause( 875, [ ~( =( nil, x1 ) ) ] )
% 0.82/1.20 , 0, substitution( 0, [] )).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 subsumption(
% 0.82/1.20 clause( 11, [ ~( =( x1, nil ) ) ] )
% 0.82/1.20 , clause( 906, [ ~( =( x1, nil ) ) ] )
% 0.82/1.20 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 subsumption(
% 0.82/1.20 clause( 12, [ heap( sep( next( x1, nil ), emp ) ) ] )
% 0.82/1.20 , clause( 876, [ heap( sep( next( x1, nil ), emp ) ) ] )
% 0.82/1.20 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 subsumption(
% 0.82/1.20 clause( 13, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 0.82/1.20 , clause( 877, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 0.82/1.20 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 factor(
% 0.82/1.20 clause( 932, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Y ), Z ) ) ) ),
% 0.82/1.20 =( X, Y ) ] )
% 0.82/1.20 , clause( 6, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ),
% 0.82/1.20 =( X, Y ), =( X, Z ) ] )
% 0.82/1.20 , 1, 2, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Y ), :=( T, Z )] )
% 0.82/1.20 ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 subsumption(
% 0.82/1.20 clause( 14, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Y ), Z ) ) ) ), =(
% 0.82/1.20 X, Y ) ] )
% 0.82/1.20 , clause( 932, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Y ), Z ) ) ) ),
% 0.82/1.20 =( X, Y ) ] )
% 0.82/1.20 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.82/1.20 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 eqswap(
% 0.82/1.20 clause( 934, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T
% 0.82/1.20 ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 0.82/1.20 , clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ),
% 0.82/1.20 =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 0.82/1.20 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 0.82/1.20 ).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 resolution(
% 0.82/1.20 clause( 935, [ =( X, x1 ), ~( heap( sep( next( x1, X ), sep( lseg( X, nil )
% 0.82/1.20 , emp ) ) ) ) ] )
% 0.82/1.20 , clause( 13, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 0.82/1.20 , 0, clause( 934, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z
% 0.82/1.20 ), T ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 0.82/1.20 , 2, substitution( 0, [] ), substitution( 1, [ :=( X, x1 ), :=( Y, X ),
% 0.82/1.20 :=( Z, nil ), :=( T, emp )] )).
% 0.82/1.20
% 0.82/1.20
% 0.82/1.20 eqswap(
% 0.82/1.20 clause( 936, [ =( x1, X ), ~( heap( sep( next( x1, X ), sep( lseg( X, nil )
% 0.86/1.26 , emp ) ) ) ) ] )
% 0.86/1.26 , clause( 935, [ =( X, x1 ), ~( heap( sep( next( x1, X ), sep( lseg( X, nil
% 0.86/1.26 ), emp ) ) ) ) ] )
% 0.86/1.26 , 0, substitution( 0, [ :=( X, X )] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 subsumption(
% 0.86/1.26 clause( 275, [ ~( heap( sep( next( x1, X ), sep( lseg( X, nil ), emp ) ) )
% 0.86/1.26 ), =( x1, X ) ] )
% 0.86/1.26 , clause( 936, [ =( x1, X ), ~( heap( sep( next( x1, X ), sep( lseg( X, nil
% 0.86/1.26 ), emp ) ) ) ) ] )
% 0.86/1.26 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.86/1.26 0 )] ) ).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 eqswap(
% 0.86/1.26 clause( 937, [ =( Y, X ), ~( heap( sep( lseg( X, Y ), sep( lseg( X, Y ), Z
% 0.86/1.26 ) ) ) ) ] )
% 0.86/1.26 , clause( 14, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Y ), Z ) ) ) ),
% 0.86/1.26 =( X, Y ) ] )
% 0.86/1.26 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 eqswap(
% 0.86/1.26 clause( 938, [ ~( =( nil, x1 ) ) ] )
% 0.86/1.26 , clause( 11, [ ~( =( x1, nil ) ) ] )
% 0.86/1.26 , 0, substitution( 0, [] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 paramod(
% 0.86/1.26 clause( 940, [ ~( =( nil, X ) ), ~( heap( sep( lseg( X, x1 ), sep( lseg( X
% 0.86/1.26 , x1 ), Y ) ) ) ) ] )
% 0.86/1.26 , clause( 937, [ =( Y, X ), ~( heap( sep( lseg( X, Y ), sep( lseg( X, Y ),
% 0.86/1.26 Z ) ) ) ) ] )
% 0.86/1.26 , 0, clause( 938, [ ~( =( nil, x1 ) ) ] )
% 0.86/1.26 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, x1 ), :=( Z, Y )] ),
% 0.86/1.26 substitution( 1, [] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 eqswap(
% 0.86/1.26 clause( 1236, [ ~( =( X, nil ) ), ~( heap( sep( lseg( X, x1 ), sep( lseg( X
% 0.86/1.26 , x1 ), Y ) ) ) ) ] )
% 0.86/1.26 , clause( 940, [ ~( =( nil, X ) ), ~( heap( sep( lseg( X, x1 ), sep( lseg(
% 0.86/1.26 X, x1 ), Y ) ) ) ) ] )
% 0.86/1.26 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 subsumption(
% 0.86/1.26 clause( 767, [ ~( =( X, nil ) ), ~( heap( sep( lseg( X, x1 ), sep( lseg( X
% 0.86/1.26 , x1 ), Y ) ) ) ) ] )
% 0.86/1.26 , clause( 1236, [ ~( =( X, nil ) ), ~( heap( sep( lseg( X, x1 ), sep( lseg(
% 0.86/1.26 X, x1 ), Y ) ) ) ) ] )
% 0.86/1.26 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.86/1.26 ), ==>( 1, 1 )] ) ).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 eqswap(
% 0.86/1.26 clause( 1923, [ =( X, x1 ), ~( heap( sep( next( x1, X ), sep( lseg( X, nil
% 0.86/1.26 ), emp ) ) ) ) ] )
% 0.86/1.26 , clause( 275, [ ~( heap( sep( next( x1, X ), sep( lseg( X, nil ), emp ) )
% 0.86/1.26 ) ), =( x1, X ) ] )
% 0.86/1.26 , 1, substitution( 0, [ :=( X, X )] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 eqswap(
% 0.86/1.26 clause( 1924, [ ~( =( nil, X ) ), ~( heap( sep( lseg( X, x1 ), sep( lseg( X
% 0.86/1.26 , x1 ), Y ) ) ) ) ] )
% 0.86/1.26 , clause( 767, [ ~( =( X, nil ) ), ~( heap( sep( lseg( X, x1 ), sep( lseg(
% 0.86/1.26 X, x1 ), Y ) ) ) ) ] )
% 0.86/1.26 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 resolution(
% 0.86/1.26 clause( 1928, [ ~( heap( sep( lseg( x1, x1 ), sep( lseg( x1, x1 ), X ) ) )
% 0.86/1.26 ), ~( heap( sep( next( x1, nil ), sep( lseg( nil, nil ), emp ) ) ) ) ]
% 0.86/1.26 )
% 0.86/1.26 , clause( 1924, [ ~( =( nil, X ) ), ~( heap( sep( lseg( X, x1 ), sep( lseg(
% 0.86/1.26 X, x1 ), Y ) ) ) ) ] )
% 0.86/1.26 , 0, clause( 1923, [ =( X, x1 ), ~( heap( sep( next( x1, X ), sep( lseg( X
% 0.86/1.26 , nil ), emp ) ) ) ) ] )
% 0.86/1.26 , 0, substitution( 0, [ :=( X, x1 ), :=( Y, X )] ), substitution( 1, [ :=(
% 0.86/1.26 X, nil )] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 paramod(
% 0.86/1.26 clause( 1930, [ ~( heap( sep( next( x1, nil ), emp ) ) ), ~( heap( sep(
% 0.86/1.26 lseg( x1, x1 ), sep( lseg( x1, x1 ), X ) ) ) ) ] )
% 0.86/1.26 , clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 0.86/1.26 , 0, clause( 1928, [ ~( heap( sep( lseg( x1, x1 ), sep( lseg( x1, x1 ), X )
% 0.86/1.26 ) ) ), ~( heap( sep( next( x1, nil ), sep( lseg( nil, nil ), emp ) ) ) )
% 0.86/1.26 ] )
% 0.86/1.26 , 1, 6, substitution( 0, [ :=( X, nil ), :=( Y, emp )] ), substitution( 1
% 0.86/1.26 , [ :=( X, X )] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 paramod(
% 0.86/1.26 clause( 1936, [ ~( heap( sep( lseg( x1, x1 ), X ) ) ), ~( heap( sep( next(
% 0.86/1.26 x1, nil ), emp ) ) ) ] )
% 0.86/1.26 , clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 0.86/1.26 , 0, clause( 1930, [ ~( heap( sep( next( x1, nil ), emp ) ) ), ~( heap( sep(
% 0.86/1.26 lseg( x1, x1 ), sep( lseg( x1, x1 ), X ) ) ) ) ] )
% 0.86/1.26 , 1, 2, substitution( 0, [ :=( X, x1 ), :=( Y, sep( lseg( x1, x1 ), X ) )] )
% 0.86/1.26 , substitution( 1, [ :=( X, X )] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 paramod(
% 0.86/1.26 clause( 1939, [ ~( heap( X ) ), ~( heap( sep( next( x1, nil ), emp ) ) ) ]
% 0.86/1.26 )
% 0.86/1.26 , clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 0.86/1.26 , 0, clause( 1936, [ ~( heap( sep( lseg( x1, x1 ), X ) ) ), ~( heap( sep(
% 0.86/1.26 next( x1, nil ), emp ) ) ) ] )
% 0.86/1.26 , 0, 2, substitution( 0, [ :=( X, x1 ), :=( Y, X )] ), substitution( 1, [
% 0.86/1.26 :=( X, X )] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 resolution(
% 0.86/1.26 clause( 1942, [ ~( heap( X ) ) ] )
% 0.86/1.26 , clause( 1939, [ ~( heap( X ) ), ~( heap( sep( next( x1, nil ), emp ) ) )
% 0.86/1.26 ] )
% 0.86/1.26 , 1, clause( 12, [ heap( sep( next( x1, nil ), emp ) ) ] )
% 0.86/1.26 , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 subsumption(
% 0.86/1.26 clause( 860, [ ~( heap( X ) ) ] )
% 0.86/1.26 , clause( 1942, [ ~( heap( X ) ) ] )
% 0.86/1.26 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 resolution(
% 0.86/1.26 clause( 1943, [] )
% 0.86/1.26 , clause( 860, [ ~( heap( X ) ) ] )
% 0.86/1.26 , 0, clause( 12, [ heap( sep( next( x1, nil ), emp ) ) ] )
% 0.86/1.26 , 0, substitution( 0, [ :=( X, sep( next( x1, nil ), emp ) )] ),
% 0.86/1.26 substitution( 1, [] )).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 subsumption(
% 0.86/1.26 clause( 862, [] )
% 0.86/1.26 , clause( 1943, [] )
% 0.86/1.26 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 end.
% 0.86/1.26
% 0.86/1.26 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.86/1.26
% 0.86/1.26 Memory use:
% 0.86/1.26
% 0.86/1.26 space for terms: 26345
% 0.86/1.26 space for clauses: 52197
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 clauses generated: 25273
% 0.86/1.26 clauses kept: 863
% 0.86/1.26 clauses selected: 112
% 0.86/1.26 clauses deleted: 1
% 0.86/1.26 clauses inuse deleted: 0
% 0.86/1.26
% 0.86/1.26 subsentry: 161861
% 0.86/1.26 literals s-matched: 12399
% 0.86/1.26 literals matched: 11441
% 0.86/1.26 full subsumption: 6543
% 0.86/1.26
% 0.86/1.26 checksum: 497401788
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 Bliksem ended
%------------------------------------------------------------------------------