TSTP Solution File: SWW410-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWW410-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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 8.45s 8.86s
% Output : Refutation 8.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWW410-1 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Sun Jun 5 13:10:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 8.45/8.86 *** allocated 10000 integers for termspace/termends
% 8.45/8.86 *** allocated 10000 integers for clauses
% 8.45/8.86 *** allocated 10000 integers for justifications
% 8.45/8.86 Bliksem 1.12
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 Automatic Strategy Selection
% 8.45/8.86
% 8.45/8.86 Clauses:
% 8.45/8.86 [
% 8.45/8.86 [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ],
% 8.45/8.86 [ =( sep( lseg( X, X ), Y ), Y ) ],
% 8.45/8.86 [ ~( heap( sep( next( nil, X ), Y ) ) ) ],
% 8.45/8.86 [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ],
% 8.45/8.86 [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) ) ],
% 8.45/8.86 [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Z ) ]
% 8.45/8.86 ,
% 8.45/8.86 [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Y ),
% 8.45/8.86 =( X, Z ) ],
% 8.45/8.86 [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X, Y ),
% 8.45/8.86 heap( sep( lseg( X, Z ), T ) ) ],
% 8.45/8.86 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ), heap( sep(
% 8.45/8.86 lseg( X, nil ), Z ) ) ],
% 8.45/8.86 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next( Z, T ), U )
% 8.45/8.86 ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) ) ],
% 8.45/8.86 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg( Z, T ), U )
% 8.45/8.86 ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T ), U ) ) )
% 8.45/8.86 ],
% 8.45/8.86 [ ~( =( nil, x1 ) ) ],
% 8.45/8.86 [ ~( =( nil, x2 ) ) ],
% 8.45/8.86 [ ~( =( x1, x3 ) ) ],
% 8.45/8.86 [ ~( =( x3, x2 ) ) ],
% 8.45/8.86 [ heap( sep( lseg( x2, x1 ), sep( lseg( x3, nil ), sep( next( x1, x3 ),
% 8.45/8.86 emp ) ) ) ) ],
% 8.45/8.86 [ ~( heap( sep( lseg( x3, nil ), sep( lseg( x2, x3 ), emp ) ) ) ) ]
% 8.45/8.86 ] .
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 percentage equality = 0.444444, percentage horn = 0.823529
% 8.45/8.86 This is a problem with some equality
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 Options Used:
% 8.45/8.86
% 8.45/8.86 useres = 1
% 8.45/8.86 useparamod = 1
% 8.45/8.86 useeqrefl = 1
% 8.45/8.86 useeqfact = 1
% 8.45/8.86 usefactor = 1
% 8.45/8.86 usesimpsplitting = 0
% 8.45/8.86 usesimpdemod = 5
% 8.45/8.86 usesimpres = 3
% 8.45/8.86
% 8.45/8.86 resimpinuse = 1000
% 8.45/8.86 resimpclauses = 20000
% 8.45/8.86 substype = eqrewr
% 8.45/8.86 backwardsubs = 1
% 8.45/8.86 selectoldest = 5
% 8.45/8.86
% 8.45/8.86 litorderings [0] = split
% 8.45/8.86 litorderings [1] = extend the termordering, first sorting on arguments
% 8.45/8.86
% 8.45/8.86 termordering = kbo
% 8.45/8.86
% 8.45/8.86 litapriori = 0
% 8.45/8.86 termapriori = 1
% 8.45/8.86 litaposteriori = 0
% 8.45/8.86 termaposteriori = 0
% 8.45/8.86 demodaposteriori = 0
% 8.45/8.86 ordereqreflfact = 0
% 8.45/8.86
% 8.45/8.86 litselect = negord
% 8.45/8.86
% 8.45/8.86 maxweight = 15
% 8.45/8.86 maxdepth = 30000
% 8.45/8.86 maxlength = 115
% 8.45/8.86 maxnrvars = 195
% 8.45/8.86 excuselevel = 1
% 8.45/8.86 increasemaxweight = 1
% 8.45/8.86
% 8.45/8.86 maxselected = 10000000
% 8.45/8.86 maxnrclauses = 10000000
% 8.45/8.86
% 8.45/8.86 showgenerated = 0
% 8.45/8.86 showkept = 0
% 8.45/8.86 showselected = 0
% 8.45/8.86 showdeleted = 0
% 8.45/8.86 showresimp = 1
% 8.45/8.86 showstatus = 2000
% 8.45/8.86
% 8.45/8.86 prologoutput = 1
% 8.45/8.86 nrgoals = 5000000
% 8.45/8.86 totalproof = 1
% 8.45/8.86
% 8.45/8.86 Symbols occurring in the translation:
% 8.45/8.86
% 8.45/8.86 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 8.45/8.86 . [1, 2] (w:1, o:27, a:1, s:1, b:0),
% 8.45/8.86 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 8.45/8.86 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 8.45/8.86 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 8.45/8.86 sep [42, 2] (w:1, o:52, a:1, s:1, b:0),
% 8.45/8.86 lseg [44, 2] (w:1, o:53, a:1, s:1, b:0),
% 8.45/8.86 nil [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 8.45/8.86 next [47, 2] (w:1, o:54, a:1, s:1, b:0),
% 8.45/8.86 heap [48, 1] (w:1, o:26, a:1, s:1, b:0),
% 8.45/8.86 x1 [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 8.45/8.86 x2 [52, 0] (w:1, o:18, a:1, s:1, b:0),
% 8.45/8.86 x3 [53, 0] (w:1, o:19, a:1, s:1, b:0),
% 8.45/8.86 emp [54, 0] (w:1, o:20, a:1, s:1, b:0).
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 Starting Search:
% 8.45/8.86
% 8.45/8.86 Resimplifying inuse:
% 8.45/8.86 Done
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 Bliksems!, er is een bewijs:
% 8.45/8.86 % SZS status Unsatisfiable
% 8.45/8.86 % SZS output start Refutation
% 8.45/8.86
% 8.45/8.86 clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 3, [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 8.45/8.86 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 8, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ),
% 8.45/8.86 heap( sep( lseg( X, nil ), Z ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 10, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg( Z,
% 8.45/8.86 T ), U ) ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T ),
% 8.45/8.86 U ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 13, [ ~( =( x3, x1 ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 15, [ heap( sep( lseg( x2, x1 ), sep( lseg( x3, nil ), sep( next(
% 8.45/8.86 x1, x3 ), emp ) ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 16, [ ~( heap( sep( lseg( x3, nil ), sep( lseg( x2, x3 ), emp ) ) )
% 8.45/8.86 ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 20, [ =( sep( T, sep( Y, sep( X, Z ) ) ), sep( X, sep( T, sep( Y, Z
% 8.45/8.86 ) ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 340, [ ~( heap( sep( next( Z, X ), Y ) ) ), =( Z, X ), heap( sep(
% 8.45/8.86 lseg( Z, X ), Y ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 792, [ ~( heap( sep( lseg( nil, x3 ), X ) ) ), ~( heap( sep( lseg(
% 8.45/8.86 x2, nil ), emp ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 797, [ ~( heap( sep( lseg( x2, x3 ), sep( lseg( x3, nil ), emp ) )
% 8.45/8.86 ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 985, [ heap( sep( next( x1, x3 ), sep( lseg( x2, x1 ), sep( lseg(
% 8.45/8.86 x3, nil ), emp ) ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1313, [ heap( sep( next( x1, x3 ), sep( lseg( x3, nil ), sep( lseg(
% 8.45/8.86 x2, x1 ), emp ) ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1314, [ =( x3, x1 ), heap( sep( lseg( x1, nil ), sep( lseg( x2, x1
% 8.45/8.86 ), emp ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1315, [ heap( sep( lseg( x1, nil ), sep( lseg( x2, x1 ), emp ) ) )
% 8.45/8.86 ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1316, [ heap( sep( lseg( x2, x1 ), sep( lseg( x1, nil ), emp ) ) )
% 8.45/8.86 ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1317, [ heap( sep( lseg( x2, nil ), emp ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1321, [ ~( heap( sep( lseg( nil, x3 ), X ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1341, [ ~( heap( sep( X, sep( Y, sep( lseg( nil, x3 ), Z ) ) ) ) )
% 8.45/8.86 ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1427, [ ~( =( X, x1 ) ), ~( heap( sep( next( X, x3 ), Y ) ) ), heap(
% 8.45/8.86 sep( lseg( X, x3 ), Y ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1432, [ ~( heap( sep( next( x1, x3 ), X ) ) ), heap( sep( lseg( x1
% 8.45/8.86 , x3 ), X ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1452, [ heap( sep( lseg( x1, x3 ), sep( lseg( x3, nil ), sep( lseg(
% 8.45/8.86 x2, x1 ), emp ) ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1531, [ heap( sep( lseg( x2, x1 ), sep( lseg( x1, x3 ), sep( lseg(
% 8.45/8.86 x3, nil ), emp ) ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1591, [ =( x3, nil ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1622, [ ~( heap( sep( X, sep( Y, Z ) ) ) ) ] )
% 8.45/8.86 .
% 8.45/8.86 clause( 1625, [] )
% 8.45/8.86 .
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 % SZS output end Refutation
% 8.45/8.86 found a proof!
% 8.45/8.86
% 8.45/8.86 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 8.45/8.86
% 8.45/8.86 initialclauses(
% 8.45/8.86 [ clause( 1627, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 8.45/8.86 , clause( 1628, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 8.45/8.86 , clause( 1629, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 8.45/8.86 , clause( 1630, [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ] )
% 8.45/8.86 , clause( 1631, [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) )
% 8.45/8.86 ] )
% 8.45/8.86 , clause( 1632, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) )
% 8.45/8.86 , =( X, Z ) ] )
% 8.45/8.86 , clause( 1633, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) )
% 8.45/8.86 , =( X, Y ), =( X, Z ) ] )
% 8.45/8.86 , clause( 1634, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) )
% 8.45/8.86 , =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 8.45/8.86 , clause( 1635, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) )
% 8.45/8.86 ), heap( sep( lseg( X, nil ), Z ) ) ] )
% 8.45/8.86 , clause( 1636, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next(
% 8.45/8.86 Z, T ), U ) ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) )
% 8.45/8.86 ] )
% 8.45/8.86 , clause( 1637, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg(
% 8.45/8.86 Z, T ), U ) ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T
% 8.45/8.86 ), U ) ) ) ] )
% 8.45/8.86 , clause( 1638, [ ~( =( nil, x1 ) ) ] )
% 8.45/8.86 , clause( 1639, [ ~( =( nil, x2 ) ) ] )
% 8.45/8.86 , clause( 1640, [ ~( =( x1, x3 ) ) ] )
% 8.45/8.86 , clause( 1641, [ ~( =( x3, x2 ) ) ] )
% 8.45/8.86 , clause( 1642, [ heap( sep( lseg( x2, x1 ), sep( lseg( x3, nil ), sep(
% 8.45/8.86 next( x1, x3 ), emp ) ) ) ) ] )
% 8.45/8.86 , clause( 1643, [ ~( heap( sep( lseg( x3, nil ), sep( lseg( x2, x3 ), emp )
% 8.45/8.86 ) ) ) ] )
% 8.45/8.86 ] ).
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 subsumption(
% 8.45/8.86 clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 8.45/8.86 , clause( 1627, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 8.45/8.86 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 8.45/8.86 permutation( 0, [ ==>( 0, 0 )] ) ).
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 subsumption(
% 8.45/8.86 clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 8.45/8.86 , clause( 1628, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 8.45/8.86 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 8.45/8.86 )] ) ).
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 subsumption(
% 8.45/8.86 clause( 3, [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ] )
% 8.45/8.86 , clause( 1630, [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ] )
% 8.45/8.86 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 8.45/8.86 ), ==>( 1, 1 )] ) ).
% 8.45/8.86
% 8.45/8.86
% 8.45/8.86 subsumption(
% 8.45/8.86 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 8.45/8.86 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 8.45/8.86 , clause( 1634, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) )
% 12.27/12.65 , =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 12.27/12.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 12.27/12.65 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 subsumption(
% 12.27/12.65 clause( 8, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ),
% 12.27/12.65 heap( sep( lseg( X, nil ), Z ) ) ] )
% 12.27/12.65 , clause( 1635, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) )
% 12.27/12.65 ), heap( sep( lseg( X, nil ), Z ) ) ] )
% 12.27/12.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 12.27/12.65 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 subsumption(
% 12.27/12.65 clause( 10, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg( Z,
% 12.27/12.65 T ), U ) ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T ),
% 12.27/12.65 U ) ) ) ] )
% 12.27/12.65 , clause( 1637, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg(
% 12.27/12.65 Z, T ), U ) ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T
% 12.27/12.65 ), U ) ) ) ] )
% 12.27/12.65 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 12.27/12.65 , U )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] )
% 12.27/12.65 ).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 eqswap(
% 12.27/12.65 clause( 1687, [ ~( =( x3, x1 ) ) ] )
% 12.27/12.65 , clause( 1640, [ ~( =( x1, x3 ) ) ] )
% 12.27/12.65 , 0, substitution( 0, [] )).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 subsumption(
% 12.27/12.65 clause( 13, [ ~( =( x3, x1 ) ) ] )
% 12.27/12.65 , clause( 1687, [ ~( =( x3, x1 ) ) ] )
% 12.27/12.65 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 subsumption(
% 12.27/12.65 clause( 15, [ heap( sep( lseg( x2, x1 ), sep( lseg( x3, nil ), sep( next(
% 12.27/12.65 x1, x3 ), emp ) ) ) ) ] )
% 12.27/12.65 , clause( 1642, [ heap( sep( lseg( x2, x1 ), sep( lseg( x3, nil ), sep(
% 12.27/12.65 next( x1, x3 ), emp ) ) ) ) ] )
% 12.27/12.65 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 subsumption(
% 12.27/12.65 clause( 16, [ ~( heap( sep( lseg( x3, nil ), sep( lseg( x2, x3 ), emp ) ) )
% 12.27/12.65 ) ] )
% 12.27/12.65 , clause( 1643, [ ~( heap( sep( lseg( x3, nil ), sep( lseg( x2, x3 ), emp )
% 12.27/12.65 ) ) ) ] )
% 12.27/12.65 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 paramod(
% 12.27/12.65 clause( 1717, [ =( sep( X, sep( Z, sep( Y, T ) ) ), sep( Y, sep( X, sep( Z
% 12.27/12.65 , T ) ) ) ) ] )
% 12.27/12.65 , clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 12.27/12.65 , 0, clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 12.27/12.65 , 0, 3, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T )] ),
% 12.27/12.65 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, sep( Z, T ) )] )).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 subsumption(
% 12.27/12.65 clause( 20, [ =( sep( T, sep( Y, sep( X, Z ) ) ), sep( X, sep( T, sep( Y, Z
% 12.27/12.65 ) ) ) ) ] )
% 12.27/12.65 , clause( 1717, [ =( sep( X, sep( Z, sep( Y, T ) ) ), sep( Y, sep( X, sep(
% 12.27/12.65 Z, T ) ) ) ) ] )
% 12.27/12.65 , substitution( 0, [ :=( X, T ), :=( Y, X ), :=( Z, Y ), :=( T, Z )] ),
% 12.27/12.65 permutation( 0, [ ==>( 0, 0 )] ) ).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 eqswap(
% 12.27/12.65 clause( 1724, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T
% 12.27/12.65 ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 12.27/12.65 , clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ),
% 12.27/12.65 =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 12.27/12.65 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 12.27/12.65 ).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 paramod(
% 12.27/12.65 clause( 7613, [ ~( heap( sep( next( X, Y ), Z ) ) ), =( Y, X ), heap( sep(
% 12.27/12.65 lseg( X, Y ), Z ) ) ] )
% 12.27/12.65 , clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 12.27/12.65 , 0, clause( 1724, [ =( Y, X ), ~( heap( sep( next( X, Y ), sep( lseg( Y, Z
% 12.27/12.65 ), T ) ) ) ), heap( sep( lseg( X, Z ), T ) ) ] )
% 12.27/12.65 , 1, 6, substitution( 0, [ :=( X, Y ), :=( Y, Z )] ), substitution( 1, [
% 12.27/12.65 :=( X, X ), :=( Y, Y ), :=( Z, Y ), :=( T, Z )] )).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 eqswap(
% 12.27/12.65 clause( 7615, [ =( Y, X ), ~( heap( sep( next( Y, X ), Z ) ) ), heap( sep(
% 12.27/12.65 lseg( Y, X ), Z ) ) ] )
% 12.27/12.65 , clause( 7613, [ ~( heap( sep( next( X, Y ), Z ) ) ), =( Y, X ), heap( sep(
% 12.27/12.65 lseg( X, Y ), Z ) ) ] )
% 12.27/12.65 , 1, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 subsumption(
% 12.27/12.65 clause( 340, [ ~( heap( sep( next( Z, X ), Y ) ) ), =( Z, X ), heap( sep(
% 12.27/12.65 lseg( Z, X ), Y ) ) ] )
% 12.27/12.65 , clause( 7615, [ =( Y, X ), ~( heap( sep( next( Y, X ), Z ) ) ), heap( sep(
% 12.27/12.65 lseg( Y, X ), Z ) ) ] )
% 12.27/12.65 , substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] ),
% 12.27/12.65 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 2 )] ) ).
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 ==> clause( 792, [ ~( heap( sep( lseg( nil, x3 ), X ) ) ), ~( heap( sep(
% 12.27/12.65 lseg( x2, nil ), emp ) ) ) ] )
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65
% 12.27/12.65 !!! Internal Problem: OH, OH, COULD NOT DERIVE GOAL !!!
% 12.27/12.65
% 12.27/12.65 Bliksem ended
%------------------------------------------------------------------------------