TSTP Solution File: SWW400-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWW400-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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 1.17s 1.57s
% Output : Refutation 1.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW400-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n029.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 : Sun Jun 5 10:35:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.17/1.57 *** allocated 10000 integers for termspace/termends
% 1.17/1.57 *** allocated 10000 integers for clauses
% 1.17/1.57 *** allocated 10000 integers for justifications
% 1.17/1.57 Bliksem 1.12
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Automatic Strategy Selection
% 1.17/1.57
% 1.17/1.57 Clauses:
% 1.17/1.57 [
% 1.17/1.57 [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ],
% 1.17/1.57 [ =( sep( lseg( X, X ), Y ), Y ) ],
% 1.17/1.57 [ ~( heap( sep( next( nil, X ), Y ) ) ) ],
% 1.17/1.57 [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ],
% 1.17/1.57 [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) ) ],
% 1.17/1.57 [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Z ) ]
% 1.17/1.57 ,
% 1.17/1.57 [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Y ),
% 1.17/1.57 =( X, Z ) ],
% 1.17/1.57 [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X, Y ),
% 1.17/1.57 heap( sep( lseg( X, Z ), T ) ) ],
% 1.17/1.57 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ), heap( sep(
% 1.17/1.57 lseg( X, nil ), Z ) ) ],
% 1.17/1.57 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next( Z, T ), U )
% 1.17/1.57 ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) ) ],
% 1.17/1.57 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg( Z, T ), U )
% 1.17/1.57 ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T ), U ) ) )
% 1.17/1.57 ],
% 1.17/1.57 [ ~( =( nil, x1 ) ) ],
% 1.17/1.57 [ ~( =( nil, x2 ) ) ],
% 1.17/1.57 [ heap( sep( next( x2, nil ), sep( lseg( x1, x2 ), emp ) ) ) ],
% 1.17/1.57 [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ]
% 1.17/1.57 ] .
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 percentage equality = 0.400000, percentage horn = 0.800000
% 1.17/1.57 This is a problem with some equality
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Options Used:
% 1.17/1.57
% 1.17/1.57 useres = 1
% 1.17/1.57 useparamod = 1
% 1.17/1.57 useeqrefl = 1
% 1.17/1.57 useeqfact = 1
% 1.17/1.57 usefactor = 1
% 1.17/1.57 usesimpsplitting = 0
% 1.17/1.57 usesimpdemod = 5
% 1.17/1.57 usesimpres = 3
% 1.17/1.57
% 1.17/1.57 resimpinuse = 1000
% 1.17/1.57 resimpclauses = 20000
% 1.17/1.57 substype = eqrewr
% 1.17/1.57 backwardsubs = 1
% 1.17/1.57 selectoldest = 5
% 1.17/1.57
% 1.17/1.57 litorderings [0] = split
% 1.17/1.57 litorderings [1] = extend the termordering, first sorting on arguments
% 1.17/1.57
% 1.17/1.57 termordering = kbo
% 1.17/1.57
% 1.17/1.57 litapriori = 0
% 1.17/1.57 termapriori = 1
% 1.17/1.57 litaposteriori = 0
% 1.17/1.57 termaposteriori = 0
% 1.17/1.57 demodaposteriori = 0
% 1.17/1.57 ordereqreflfact = 0
% 1.17/1.57
% 1.17/1.57 litselect = negord
% 1.17/1.57
% 1.17/1.57 maxweight = 15
% 1.17/1.57 maxdepth = 30000
% 1.17/1.57 maxlength = 115
% 1.17/1.57 maxnrvars = 195
% 1.17/1.57 excuselevel = 1
% 1.17/1.57 increasemaxweight = 1
% 1.17/1.57
% 1.17/1.57 maxselected = 10000000
% 1.17/1.57 maxnrclauses = 10000000
% 1.17/1.57
% 1.17/1.57 showgenerated = 0
% 1.17/1.57 showkept = 0
% 1.17/1.57 showselected = 0
% 1.17/1.57 showdeleted = 0
% 1.17/1.57 showresimp = 1
% 1.17/1.57 showstatus = 2000
% 1.17/1.57
% 1.17/1.57 prologoutput = 1
% 1.17/1.57 nrgoals = 5000000
% 1.17/1.57 totalproof = 1
% 1.17/1.57
% 1.17/1.57 Symbols occurring in the translation:
% 1.17/1.57
% 1.17/1.57 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.17/1.57 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 1.17/1.57 ! [4, 1] (w:0, o:20, a:1, s:1, b:0),
% 1.17/1.57 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.17/1.57 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.17/1.57 sep [42, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.17/1.57 lseg [44, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.17/1.57 nil [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 1.17/1.57 next [47, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.17/1.57 heap [48, 1] (w:1, o:25, a:1, s:1, b:0),
% 1.17/1.57 x1 [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 1.17/1.57 x2 [52, 0] (w:1, o:18, a:1, s:1, b:0),
% 1.17/1.57 emp [53, 0] (w:1, o:19, a:1, s:1, b:0).
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Starting Search:
% 1.17/1.57
% 1.17/1.57 Resimplifying inuse:
% 1.17/1.57 Done
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 Bliksems!, er is een bewijs:
% 1.17/1.57 % SZS status Unsatisfiable
% 1.17/1.57 % SZS output start Refutation
% 1.17/1.57
% 1.17/1.57 clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 1.17/1.57 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 8, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ),
% 1.17/1.57 heap( sep( lseg( X, nil ), Z ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 12, [ ~( =( x2, nil ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 13, [ heap( sep( next( x2, nil ), sep( lseg( x1, x2 ), emp ) ) ) ]
% 1.17/1.57 )
% 1.17/1.57 .
% 1.17/1.57 clause( 14, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 354, [ ~( heap( sep( next( Z, X ), Y ) ) ), =( Z, X ), heap( sep(
% 1.17/1.57 lseg( Z, X ), Y ) ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 386, [ ~( heap( sep( lseg( x1, X ), sep( lseg( X, nil ), emp ) ) )
% 1.17/1.57 ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 448, [ ~( heap( sep( lseg( X, nil ), sep( lseg( x1, X ), emp ) ) )
% 1.17/1.57 ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1032, [ =( x2, nil ) ] )
% 1.17/1.57 .
% 1.17/1.57 clause( 1042, [] )
% 1.17/1.57 .
% 1.17/1.57
% 1.17/1.57
% 1.17/1.57 % SZS output end Refutation
% 1.17/1.57 found a proof!
% 2.05/2.44
% 2.05/2.44 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.05/2.44
% 2.05/2.44 initialclauses(
% 2.05/2.44 [ clause( 1044, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 2.05/2.44 , clause( 1045, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 2.05/2.44 , clause( 1046, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 2.05/2.44 , clause( 1047, [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ] )
% 2.05/2.44 , clause( 1048, [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) )
% 2.05/2.44 ] )
% 2.05/2.44 , clause( 1049, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) )
% 2.05/2.44 , =( X, Z ) ] )
% 2.05/2.44 , clause( 1050, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) )
% 2.05/2.44 , =( X, Y ), =( X, Z ) ] )
% 2.05/2.44 , clause( 1051, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) )
% 2.05/2.44 , =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 2.05/2.44 , clause( 1052, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) )
% 2.05/2.44 ), heap( sep( lseg( X, nil ), Z ) ) ] )
% 2.05/2.44 , clause( 1053, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next(
% 2.05/2.44 Z, T ), U ) ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) )
% 2.05/2.44 ] )
% 2.05/2.44 , clause( 1054, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg(
% 2.05/2.44 Z, T ), U ) ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T
% 2.05/2.44 ), U ) ) ) ] )
% 2.05/2.44 , clause( 1055, [ ~( =( nil, x1 ) ) ] )
% 2.05/2.44 , clause( 1056, [ ~( =( nil, x2 ) ) ] )
% 2.05/2.44 , clause( 1057, [ heap( sep( next( x2, nil ), sep( lseg( x1, x2 ), emp ) )
% 2.05/2.44 ) ] )
% 2.05/2.44 , clause( 1058, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 2.05/2.44 ] ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 2.05/2.44 , clause( 1044, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 2.05/2.44 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.05/2.44 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 2.05/2.44 , clause( 1045, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 2.05/2.44 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.05/2.44 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 2.05/2.44 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 2.05/2.44 , clause( 1051, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) )
% 2.05/2.44 , =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 2.05/2.44 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.05/2.44 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 8, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ),
% 2.05/2.44 heap( sep( lseg( X, nil ), Z ) ) ] )
% 2.05/2.44 , clause( 1052, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) )
% 2.05/2.44 ), heap( sep( lseg( X, nil ), Z ) ) ] )
% 2.05/2.44 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.05/2.44 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 eqswap(
% 2.05/2.44 clause( 1089, [ ~( =( x2, nil ) ) ] )
% 2.05/2.44 , clause( 1056, [ ~( =( nil, x2 ) ) ] )
% 2.05/2.44 , 0, substitution( 0, [] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 12, [ ~( =( x2, nil ) ) ] )
% 2.05/2.44 , clause( 1089, [ ~( =( x2, nil ) ) ] )
% 2.05/2.44 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 13, [ heap( sep( next( x2, nil ), sep( lseg( x1, x2 ), emp ) ) ) ]
% 2.05/2.44 )
% 2.05/2.44 , clause( 1057, [ heap( sep( next( x2, nil ), sep( lseg( x1, x2 ), emp ) )
% 2.05/2.44 ) ] )
% 2.05/2.44 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 14, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 2.05/2.44 , clause( 1058, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 2.05/2.44 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 eqswap(
% 2.05/2.44 clause( 1115, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T
% 2.05/2.44 ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 2.05/2.44 , clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ),
% 2.05/2.44 =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 2.05/2.44 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 2.05/2.44 ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 paramod(
% 2.05/2.44 clause( 7004, [ ~( heap( sep( next( X, Y ), Z ) ) ), =( Y, X ), heap( sep(
% 2.05/2.44 lseg( X, Y ), Z ) ) ] )
% 2.05/2.44 , clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 2.05/2.44 , 0, clause( 1115, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z
% 2.05/2.44 ), T ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 2.05/2.44 , 1, 6, substitution( 0, [ :=( X, Y ), :=( Y, Z )] ), substitution( 1, [
% 2.05/2.44 :=( X, X ), :=( Y, Y ), :=( Z, Y ), :=( T, Z )] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 eqswap(
% 2.05/2.44 clause( 7006, [ =( Y, X ), ~( heap( sep( next( Y, X ), Z ) ) ), heap( sep(
% 2.05/2.44 lseg( Y, X ), Z ) ) ] )
% 2.05/2.44 , clause( 7004, [ ~( heap( sep( next( X, Y ), Z ) ) ), =( Y, X ), heap( sep(
% 2.05/2.44 lseg( X, Y ), Z ) ) ] )
% 2.05/2.44 , 1, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 354, [ ~( heap( sep( next( Z, X ), Y ) ) ), =( Z, X ), heap( sep(
% 2.05/2.44 lseg( Z, X ), Y ) ) ] )
% 2.05/2.44 , clause( 7006, [ =( Y, X ), ~( heap( sep( next( Y, X ), Z ) ) ), heap( sep(
% 2.05/2.44 lseg( Y, X ), Z ) ) ] )
% 2.05/2.44 , substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] ),
% 2.05/2.44 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 2 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 resolution(
% 2.05/2.44 clause( 7008, [ ~( heap( sep( lseg( x1, X ), sep( lseg( X, nil ), emp ) ) )
% 2.05/2.44 ) ] )
% 2.05/2.44 , clause( 14, [ ~( heap( sep( lseg( x1, nil ), emp ) ) ) ] )
% 2.05/2.44 , 0, clause( 8, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) )
% 2.05/2.44 ), heap( sep( lseg( X, nil ), Z ) ) ] )
% 2.05/2.44 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, x1 ), :=( Y, X ),
% 2.05/2.44 :=( Z, emp )] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 386, [ ~( heap( sep( lseg( x1, X ), sep( lseg( X, nil ), emp ) ) )
% 2.05/2.44 ) ] )
% 2.05/2.44 , clause( 7008, [ ~( heap( sep( lseg( x1, X ), sep( lseg( X, nil ), emp ) )
% 2.05/2.44 ) ) ] )
% 2.05/2.44 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 paramod(
% 2.05/2.44 clause( 7009, [ ~( heap( sep( lseg( X, nil ), sep( lseg( x1, X ), emp ) ) )
% 2.05/2.44 ) ] )
% 2.05/2.44 , clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 2.05/2.44 , 0, clause( 386, [ ~( heap( sep( lseg( x1, X ), sep( lseg( X, nil ), emp )
% 2.05/2.44 ) ) ) ] )
% 2.05/2.44 , 0, 2, substitution( 0, [ :=( X, lseg( x1, X ) ), :=( Y, lseg( X, nil ) )
% 2.05/2.44 , :=( Z, emp )] ), substitution( 1, [ :=( X, X )] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 448, [ ~( heap( sep( lseg( X, nil ), sep( lseg( x1, X ), emp ) ) )
% 2.05/2.44 ) ] )
% 2.05/2.44 , clause( 7009, [ ~( heap( sep( lseg( X, nil ), sep( lseg( x1, X ), emp ) )
% 2.05/2.44 ) ) ] )
% 2.05/2.44 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 eqswap(
% 2.05/2.44 clause( 7011, [ =( Y, X ), ~( heap( sep( next( X, Y ), Z ) ) ), heap( sep(
% 2.05/2.44 lseg( X, Y ), Z ) ) ] )
% 2.05/2.44 , clause( 354, [ ~( heap( sep( next( Z, X ), Y ) ) ), =( Z, X ), heap( sep(
% 2.05/2.44 lseg( Z, X ), Y ) ) ] )
% 2.05/2.44 , 1, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X )] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 resolution(
% 2.05/2.44 clause( 7012, [ =( nil, x2 ), heap( sep( lseg( x2, nil ), sep( lseg( x1, x2
% 2.05/2.44 ), emp ) ) ) ] )
% 2.05/2.44 , clause( 7011, [ =( Y, X ), ~( heap( sep( next( X, Y ), Z ) ) ), heap( sep(
% 2.05/2.44 lseg( X, Y ), Z ) ) ] )
% 2.05/2.44 , 1, clause( 13, [ heap( sep( next( x2, nil ), sep( lseg( x1, x2 ), emp ) )
% 2.05/2.44 ) ] )
% 2.05/2.44 , 0, substitution( 0, [ :=( X, x2 ), :=( Y, nil ), :=( Z, sep( lseg( x1, x2
% 2.05/2.44 ), emp ) )] ), substitution( 1, [] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 resolution(
% 2.05/2.44 clause( 7013, [ =( nil, x2 ) ] )
% 2.05/2.44 , clause( 448, [ ~( heap( sep( lseg( X, nil ), sep( lseg( x1, X ), emp ) )
% 2.05/2.44 ) ) ] )
% 2.05/2.44 , 0, clause( 7012, [ =( nil, x2 ), heap( sep( lseg( x2, nil ), sep( lseg(
% 2.05/2.44 x1, x2 ), emp ) ) ) ] )
% 2.05/2.44 , 1, substitution( 0, [ :=( X, x2 )] ), substitution( 1, [] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 eqswap(
% 2.05/2.44 clause( 7014, [ =( x2, nil ) ] )
% 2.05/2.44 , clause( 7013, [ =( nil, x2 ) ] )
% 2.05/2.44 , 0, substitution( 0, [] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 1032, [ =( x2, nil ) ] )
% 2.05/2.44 , clause( 7014, [ =( x2, nil ) ] )
% 2.05/2.44 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 resolution(
% 2.05/2.44 clause( 7017, [] )
% 2.05/2.44 , clause( 12, [ ~( =( x2, nil ) ) ] )
% 2.05/2.44 , 0, clause( 1032, [ =( x2, nil ) ] )
% 2.05/2.44 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 subsumption(
% 2.05/2.44 clause( 1042, [] )
% 2.05/2.44 , clause( 7017, [] )
% 2.05/2.44 , substitution( 0, [] ), permutation( 0, [] ) ).
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 end.
% 2.05/2.44
% 2.05/2.44 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.05/2.44
% 2.05/2.44 Memory use:
% 2.05/2.44
% 2.05/2.44 space for terms: 29681
% 2.05/2.44 space for clauses: 65065
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 clauses generated: 182131
% 2.05/2.44 clauses kept: 1043
% 2.05/2.44 clauses selected: 314
% 2.05/2.44 clauses deleted: 10
% 2.05/2.44 clauses inuse deleted: 0
% 2.05/2.44
% 2.05/2.44 subsentry: 2692884
% 2.05/2.44 literals s-matched: 502924
% 2.05/2.44 literals matched: 173200
% 2.05/2.44 full subsumption: 164508
% 2.05/2.44
% 2.05/2.44 checksum: -1317366451
% 2.05/2.44
% 2.05/2.44
% 2.05/2.44 Bliksem ended
%------------------------------------------------------------------------------