TSTP Solution File: SWW409-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n024.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 1.57s 1.95s
% Output : Refutation 1.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWW409-1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Sun Jun 5 16:31:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.57/1.95 *** allocated 10000 integers for termspace/termends
% 1.57/1.95 *** allocated 10000 integers for clauses
% 1.57/1.95 *** allocated 10000 integers for justifications
% 1.57/1.95 Bliksem 1.12
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 Automatic Strategy Selection
% 1.57/1.95
% 1.57/1.95 Clauses:
% 1.57/1.95 [
% 1.57/1.95 [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ],
% 1.57/1.95 [ =( sep( lseg( X, X ), Y ), Y ) ],
% 1.57/1.95 [ ~( heap( sep( next( nil, X ), Y ) ) ) ],
% 1.57/1.95 [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ],
% 1.57/1.95 [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) ) ],
% 1.57/1.95 [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Z ) ]
% 1.57/1.95 ,
% 1.57/1.95 [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X, Y ),
% 1.57/1.95 =( X, Z ) ],
% 1.57/1.95 [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X, Y ),
% 1.57/1.95 heap( sep( lseg( X, Z ), T ) ) ],
% 1.57/1.95 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ), heap( sep(
% 1.57/1.95 lseg( X, nil ), Z ) ) ],
% 1.57/1.95 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next( Z, T ), U )
% 1.57/1.95 ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) ) ],
% 1.57/1.95 [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg( Z, T ), U )
% 1.57/1.95 ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T ), U ) ) )
% 1.57/1.95 ],
% 1.57/1.95 [ ~( =( nil, x1 ) ) ],
% 1.57/1.95 [ ~( =( nil, x2 ) ) ],
% 1.57/1.95 [ ~( =( x1, x3 ) ) ],
% 1.57/1.95 [ ~( =( x2, x3 ) ) ],
% 1.57/1.95 [ heap( sep( lseg( x2, x1 ), sep( lseg( x3, nil ), sep( next( x1, x3 ),
% 1.57/1.95 emp ) ) ) ) ],
% 1.57/1.95 [ ~( heap( sep( lseg( x2, nil ), emp ) ) ) ]
% 1.57/1.95 ] .
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 percentage equality = 0.444444, percentage horn = 0.823529
% 1.57/1.95 This is a problem with some equality
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 Options Used:
% 1.57/1.95
% 1.57/1.95 useres = 1
% 1.57/1.95 useparamod = 1
% 1.57/1.95 useeqrefl = 1
% 1.57/1.95 useeqfact = 1
% 1.57/1.95 usefactor = 1
% 1.57/1.95 usesimpsplitting = 0
% 1.57/1.95 usesimpdemod = 5
% 1.57/1.95 usesimpres = 3
% 1.57/1.95
% 1.57/1.95 resimpinuse = 1000
% 1.57/1.95 resimpclauses = 20000
% 1.57/1.95 substype = eqrewr
% 1.57/1.95 backwardsubs = 1
% 1.57/1.95 selectoldest = 5
% 1.57/1.95
% 1.57/1.95 litorderings [0] = split
% 1.57/1.95 litorderings [1] = extend the termordering, first sorting on arguments
% 1.57/1.95
% 1.57/1.95 termordering = kbo
% 1.57/1.95
% 1.57/1.95 litapriori = 0
% 1.57/1.95 termapriori = 1
% 1.57/1.95 litaposteriori = 0
% 1.57/1.95 termaposteriori = 0
% 1.57/1.95 demodaposteriori = 0
% 1.57/1.95 ordereqreflfact = 0
% 1.57/1.95
% 1.57/1.95 litselect = negord
% 1.57/1.95
% 1.57/1.95 maxweight = 15
% 1.57/1.95 maxdepth = 30000
% 1.57/1.95 maxlength = 115
% 1.57/1.95 maxnrvars = 195
% 1.57/1.95 excuselevel = 1
% 1.57/1.95 increasemaxweight = 1
% 1.57/1.95
% 1.57/1.95 maxselected = 10000000
% 1.57/1.95 maxnrclauses = 10000000
% 1.57/1.95
% 1.57/1.95 showgenerated = 0
% 1.57/1.95 showkept = 0
% 1.57/1.95 showselected = 0
% 1.57/1.95 showdeleted = 0
% 1.57/1.95 showresimp = 1
% 1.57/1.95 showstatus = 2000
% 1.57/1.95
% 1.57/1.95 prologoutput = 1
% 1.57/1.95 nrgoals = 5000000
% 1.57/1.95 totalproof = 1
% 1.57/1.95
% 1.57/1.95 Symbols occurring in the translation:
% 1.57/1.95
% 1.57/1.95 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.57/1.95 . [1, 2] (w:1, o:27, a:1, s:1, b:0),
% 1.57/1.95 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 1.57/1.95 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.57/1.95 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.57/1.95 sep [42, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.57/1.95 lseg [44, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.57/1.95 nil [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 1.57/1.95 next [47, 2] (w:1, o:54, a:1, s:1, b:0),
% 1.57/1.95 heap [48, 1] (w:1, o:26, a:1, s:1, b:0),
% 1.57/1.95 x1 [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 1.57/1.95 x2 [52, 0] (w:1, o:18, a:1, s:1, b:0),
% 1.57/1.95 x3 [53, 0] (w:1, o:19, a:1, s:1, b:0),
% 1.57/1.95 emp [54, 0] (w:1, o:20, a:1, s:1, b:0).
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 Starting Search:
% 1.57/1.95
% 1.57/1.95 Resimplifying inuse:
% 1.57/1.95 Done
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 Bliksems!, er is een bewijs:
% 1.57/1.95 % SZS status Unsatisfiable
% 1.57/1.95 % SZS output start Refutation
% 1.57/1.95
% 1.57/1.95 clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 2, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 5, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 1.57/1.95 , Z ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 6, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 1.57/1.95 , Y ), =( X, Z ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 1.57/1.95 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 8, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) ) ),
% 1.57/1.95 heap( sep( lseg( X, nil ), Z ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 14, [ ~( =( x3, x2 ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 15, [ heap( sep( lseg( x2, x1 ), sep( lseg( x3, nil ), sep( next(
% 1.57/1.95 x1, x3 ), emp ) ) ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 16, [ ~( heap( sep( lseg( x2, nil ), emp ) ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 20, [ =( sep( T, sep( Y, sep( X, Z ) ) ), sep( X, sep( T, sep( Y, Z
% 1.57/1.95 ) ) ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 114, [ ~( heap( sep( next( X, Y ), Z ) ) ), ~( heap( sep( next( X,
% 1.57/1.95 T ), sep( lseg( X, nil ), U ) ) ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 129, [ ~( heap( sep( next( X, Y ), sep( lseg( X, nil ), Z ) ) ) ) ]
% 1.57/1.95 )
% 1.57/1.95 .
% 1.57/1.95 clause( 269, [ ~( =( X, x2 ) ), ~( heap( sep( lseg( X, Y ), sep( lseg( X,
% 1.57/1.95 x3 ), Z ) ) ) ), =( X, Y ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 270, [ ~( heap( sep( lseg( x2, X ), sep( lseg( x2, x3 ), Y ) ) ) )
% 1.57/1.95 , =( x2, X ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 412, [ ~( heap( sep( lseg( x2, X ), sep( lseg( X, nil ), emp ) ) )
% 1.57/1.95 ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 763, [ ~( heap( sep( lseg( X, nil ), sep( lseg( x2, X ), emp ) ) )
% 1.57/1.95 ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 961, [ heap( sep( next( x1, x3 ), sep( lseg( x2, x1 ), sep( lseg(
% 1.57/1.95 x3, nil ), emp ) ) ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 1332, [ heap( sep( next( x1, x3 ), sep( lseg( x3, nil ), sep( lseg(
% 1.57/1.95 x2, x1 ), emp ) ) ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 1361, [ =( x3, x1 ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 1371, [ ~( heap( sep( lseg( x2, x1 ), X ) ) ) ] )
% 1.57/1.95 .
% 1.57/1.95 clause( 1376, [] )
% 1.57/1.95 .
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 % SZS output end Refutation
% 1.57/1.95 found a proof!
% 1.57/1.95
% 1.57/1.95 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.57/1.95
% 1.57/1.95 initialclauses(
% 1.57/1.95 [ clause( 1378, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 1.57/1.95 , clause( 1379, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 1.57/1.95 , clause( 1380, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 1.57/1.95 , clause( 1381, [ ~( heap( sep( lseg( nil, X ), Y ) ) ), =( X, nil ) ] )
% 1.57/1.95 , clause( 1382, [ ~( heap( sep( next( X, Y ), sep( next( X, Z ), T ) ) ) )
% 1.57/1.95 ] )
% 1.57/1.95 , clause( 1383, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) )
% 1.57/1.95 , =( X, Z ) ] )
% 1.57/1.95 , clause( 1384, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) )
% 1.57/1.95 , =( X, Y ), =( X, Z ) ] )
% 1.57/1.95 , clause( 1385, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) )
% 1.57/1.95 , =( X, Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 1.57/1.95 , clause( 1386, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, nil ), Z ) ) )
% 1.57/1.95 ), heap( sep( lseg( X, nil ), Z ) ) ] )
% 1.57/1.95 , clause( 1387, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( next(
% 1.57/1.95 Z, T ), U ) ) ) ) ), heap( sep( lseg( X, Z ), sep( next( Z, T ), U ) ) )
% 1.57/1.95 ] )
% 1.57/1.95 , clause( 1388, [ ~( heap( sep( lseg( X, Y ), sep( lseg( Y, Z ), sep( lseg(
% 1.57/1.95 Z, T ), U ) ) ) ) ), =( Z, T ), heap( sep( lseg( X, Z ), sep( lseg( Z, T
% 1.57/1.95 ), U ) ) ) ] )
% 1.57/1.95 , clause( 1389, [ ~( =( nil, x1 ) ) ] )
% 1.57/1.95 , clause( 1390, [ ~( =( nil, x2 ) ) ] )
% 1.57/1.95 , clause( 1391, [ ~( =( x1, x3 ) ) ] )
% 1.57/1.95 , clause( 1392, [ ~( =( x2, x3 ) ) ] )
% 1.57/1.95 , clause( 1393, [ heap( sep( lseg( x2, x1 ), sep( lseg( x3, nil ), sep(
% 1.57/1.95 next( x1, x3 ), emp ) ) ) ) ] )
% 1.57/1.95 , clause( 1394, [ ~( heap( sep( lseg( x2, nil ), emp ) ) ) ] )
% 1.57/1.95 ] ).
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 subsumption(
% 1.57/1.95 clause( 0, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 1.57/1.95 , clause( 1378, [ =( sep( X, sep( Y, Z ) ), sep( Y, sep( X, Z ) ) ) ] )
% 1.57/1.95 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.57/1.95 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 subsumption(
% 1.57/1.95 clause( 1, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 1.57/1.95 , clause( 1379, [ =( sep( lseg( X, X ), Y ), Y ) ] )
% 1.57/1.95 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.57/1.95 )] ) ).
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 subsumption(
% 1.57/1.95 clause( 2, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 1.57/1.95 , clause( 1380, [ ~( heap( sep( next( nil, X ), Y ) ) ) ] )
% 1.57/1.95 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.57/1.95 )] ) ).
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 subsumption(
% 1.57/1.95 clause( 5, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 1.57/1.95 , Z ) ] )
% 1.57/1.95 , clause( 1383, [ ~( heap( sep( next( X, Y ), sep( lseg( X, Z ), T ) ) ) )
% 1.57/1.95 , =( X, Z ) ] )
% 1.57/1.95 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.57/1.95 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 subsumption(
% 1.57/1.95 clause( 6, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) ), =( X
% 1.57/1.95 , Y ), =( X, Z ) ] )
% 1.57/1.95 , clause( 1384, [ ~( heap( sep( lseg( X, Y ), sep( lseg( X, Z ), T ) ) ) )
% 1.57/1.95 , =( X, Y ), =( X, Z ) ] )
% 1.57/1.95 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 1.57/1.95 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.57/1.95
% 1.57/1.95
% 1.57/1.95 subsumption(
% 1.57/1.95 clause( 7, [ ~( heap( sep( next( X, Y ), sep( lseg( Y, Z ), T ) ) ) ), =( X
% 1.57/1.95 , Y ), heap( sep( lseg( X, Z ), T ) ) ] )
% 1.57/1.95 , clause( 1385, [ ~( heap( sep( next( X, Y ), sep( lCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------