%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN009-3 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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 : Thu Jul 21 02:46:41 EDT 2022
% Result : Unsatisfiable 0.70s 1.09s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN009-3 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n010.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 : Mon Jul 11 20:05:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.09 *** allocated 10000 integers for termspace/termends
% 0.70/1.09 *** allocated 10000 integers for clauses
% 0.70/1.09 *** allocated 10000 integers for justifications
% 0.70/1.09 Bliksem 1.12
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Automatic Strategy Selection
% 0.70/1.09
% 0.70/1.09 Clauses:
% 0.70/1.09 [
% 0.70/1.09 [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ],
% 0.70/1.09 [ ~( q( X, Y, Z ) ), ~( t( X, Y, Z ) ) ],
% 0.70/1.09 [ ~( r( X, Y, Z ) ), ~( t( X, Y, Z ) ) ],
% 0.70/1.09 [ s( a ) ],
% 0.70/1.09 [ s( b ) ],
% 0.70/1.09 [ s( c ) ],
% 0.70/1.09 [ ~( v( X, Y, Z ) ) ],
% 0.70/1.09 [ u( c, c, c ) ],
% 0.70/1.09 [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( X, Y, Z ), r(
% 0.70/1.09 X, Y, Z ) ],
% 0.70/1.09 [ ~( u( X, Y, Z ) ), t( X, Y, Z ), v( X, Y, Z ) ]
% 0.70/1.09 ] .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 percentage equality = 0.000000, percentage horn = 0.800000
% 0.70/1.09 This a non-horn, non-equality problem
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Options Used:
% 0.70/1.09
% 0.70/1.09 useres = 1
% 0.70/1.09 useparamod = 0
% 0.70/1.09 useeqrefl = 0
% 0.70/1.09 useeqfact = 0
% 0.70/1.09 usefactor = 1
% 0.70/1.09 usesimpsplitting = 0
% 0.70/1.09 usesimpdemod = 0
% 0.70/1.09 usesimpres = 3
% 0.70/1.09
% 0.70/1.09 resimpinuse = 1000
% 0.70/1.09 resimpclauses = 20000
% 0.70/1.09 substype = standard
% 0.70/1.09 backwardsubs = 1
% 0.70/1.09 selectoldest = 5
% 0.70/1.09
% 0.70/1.09 litorderings [0] = split
% 0.70/1.09 litorderings [1] = liftord
% 0.70/1.09
% 0.70/1.09 termordering = none
% 0.70/1.09
% 0.70/1.09 litapriori = 1
% 0.70/1.09 termapriori = 0
% 0.70/1.09 litaposteriori = 0
% 0.70/1.09 termaposteriori = 0
% 0.70/1.09 demodaposteriori = 0
% 0.70/1.09 ordereqreflfact = 0
% 0.70/1.09
% 0.70/1.09 litselect = none
% 0.70/1.09
% 0.70/1.09 maxweight = 15
% 0.70/1.09 maxdepth = 30000
% 0.70/1.09 maxlength = 115
% 0.70/1.09 maxnrvars = 195
% 0.70/1.09 excuselevel = 1
% 0.70/1.09 increasemaxweight = 1
% 0.70/1.09
% 0.70/1.09 maxselected = 10000000
% 0.70/1.09 maxnrclauses = 10000000
% 0.70/1.09
% 0.70/1.09 showgenerated = 0
% 0.70/1.09 showkept = 0
% 0.70/1.09 showselected = 0
% 0.70/1.09 showdeleted = 0
% 0.70/1.09 showresimp = 1
% 0.70/1.09 showstatus = 2000
% 0.70/1.09
% 0.70/1.09 prologoutput = 1
% 0.70/1.09 nrgoals = 5000000
% 0.70/1.09 totalproof = 1
% 0.70/1.09
% 0.70/1.09 Symbols occurring in the translation:
% 0.70/1.09
% 0.70/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.09 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.70/1.09 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.70/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.09 p [42, 3] (w:1, o:46, a:1, s:1, b:0),
% 0.70/1.09 t [43, 3] (w:1, o:47, a:1, s:1, b:0),
% 0.70/1.09 q [44, 3] (w:1, o:48, a:1, s:1, b:0),
% 0.70/1.09 r [45, 3] (w:1, o:49, a:1, s:1, b:0),
% 0.70/1.09 a [46, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.70/1.09 s [47, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.70/1.09 b [48, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.70/1.09 c [49, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.70/1.09 v [50, 3] (w:1, o:51, a:1, s:1, b:0),
% 0.70/1.09 u [51, 3] (w:1, o:50, a:1, s:1, b:0).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Starting Search:
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksems!, er is een bewijs:
% 0.70/1.09 % SZS status Unsatisfiable
% 0.70/1.09 % SZS output start Refutation
% 0.70/1.09
% 0.70/1.09 clause( 0, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 1, [ ~( t( X, Y, Z ) ), ~( q( X, Y, Z ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 2, [ ~( t( X, Y, Z ) ), ~( r( X, Y, Z ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 5, [ s( c ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 6, [ ~( v( X, Y, Z ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 7, [ u( c, c, c ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 8, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( X, Y,
% 0.70/1.09 Z ), r( X, Y, Z ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 9, [ t( X, Y, Z ), ~( u( X, Y, Z ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 12, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( X, Y, Y ), r( X, Y
% 0.70/1.09 , Y ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 13, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 14, [ t( c, c, c ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 16, [ ~( s( X ) ), ~( t( X, X, X ) ), q( X, X, X ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 17, [ ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.70/1.09 .
% 0.70/1.09 clause( 18, [] )
% 0.70/1.09 .
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 % SZS output end Refutation
% 0.70/1.09 found a proof!
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 initialclauses(
% 0.70/1.09 [ clause( 20, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.70/1.09 , clause( 21, [ ~( q( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.70/1.09 , clause( 22, [ ~( r( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.70/1.09 , clause( 23, [ s( a ) ] )
% 0.70/1.09 , clause( 24, [ s( b ) ] )
% 0.70/1.09 , clause( 25, [ s( c ) ] )
% 0.70/1.09 , clause( 26, [ ~( v( X, Y, Z ) ) ] )
% 0.70/1.09 , clause( 27, [ u( c, c, c ) ] )
% 0.70/1.09 , clause( 28, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( X,
% 0.70/1.09 Y, Z ), r( X, Y, Z ) ] )
% 0.70/1.09 , clause( 29, [ ~( u( X, Y, Z ) ), t( X, Y, Z ), v( X, Y, Z ) ] )
% 0.70/1.09 ] ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 0, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.70/1.09 , clause( 20, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.09 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 1, [ ~( t( X, Y, Z ) ), ~( q( X, Y, Z ) ) ] )
% 0.70/1.09 , clause( 21, [ ~( q( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 2, [ ~( t( X, Y, Z ) ), ~( r( X, Y, Z ) ) ] )
% 0.70/1.09 , clause( 22, [ ~( r( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 5, [ s( c ) ] )
% 0.70/1.09 , clause( 25, [ s( c ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 6, [ ~( v( X, Y, Z ) ) ] )
% 0.70/1.09 , clause( 26, [ ~( v( X, Y, Z ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 7, [ u( c, c, c ) ] )
% 0.70/1.09 , clause( 27, [ u( c, c, c ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 8, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( X, Y,
% 0.70/1.09 Z ), r( X, Y, Z ) ] )
% 0.70/1.09 , clause( 28, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( X,
% 0.70/1.09 Y, Z ), r( X, Y, Z ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.09 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 ),
% 0.70/1.09 ==>( 4, 4 ), ==>( 5, 5 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 38, [ ~( u( X, Y, Z ) ), t( X, Y, Z ) ] )
% 0.70/1.09 , clause( 6, [ ~( v( X, Y, Z ) ) ] )
% 0.70/1.09 , 0, clause( 29, [ ~( u( X, Y, Z ) ), t( X, Y, Z ), v( X, Y, Z ) ] )
% 0.70/1.09 , 2, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.09 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 9, [ t( X, Y, Z ), ~( u( X, Y, Z ) ) ] )
% 0.70/1.09 , clause( 38, [ ~( u( X, Y, Z ) ), t( X, Y, Z ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 factor(
% 0.70/1.09 clause( 41, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( X, Y, Y ), r( X, Y
% 0.70/1.09 , Y ) ] )
% 0.70/1.09 , clause( 8, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( X, Y
% 0.70/1.09 , Z ), r( X, Y, Z ) ] )
% 0.70/1.09 , 1, 2, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Y )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 12, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( X, Y, Y ), r( X, Y
% 0.70/1.09 , Y ) ] )
% 0.70/1.09 , clause( 41, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( X, Y, Y ), r( X
% 0.70/1.09 , Y, Y ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.09 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 ), ==>( 4, 4 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 factor(
% 0.70/1.09 clause( 43, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ] )
% 0.70/1.09 , clause( 12, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( X, Y, Y ), r( X
% 0.70/1.09 , Y, Y ) ] )
% 0.70/1.09 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 13, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ] )
% 0.70/1.09 , clause( 43, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.70/1.09 1 ), ==>( 2, 2 ), ==>( 3, 3 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 44, [ t( c, c, c ) ] )
% 0.70/1.09 , clause( 9, [ t( X, Y, Z ), ~( u( X, Y, Z ) ) ] )
% 0.70/1.09 , 1, clause( 7, [ u( c, c, c ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, c ), :=( Y, c ), :=( Z, c )] ),
% 0.70/1.09 substitution( 1, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 14, [ t( c, c, c ) ] )
% 0.70/1.09 , clause( 44, [ t( c, c, c ) ] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 45, [ ~( t( X, X, X ) ), ~( s( X ) ), p( X, X, X ), q( X, X, X ) ]
% 0.70/1.09 )
% 0.70/1.09 , clause( 2, [ ~( t( X, Y, Z ) ), ~( r( X, Y, Z ) ) ] )
% 0.70/1.09 , 1, clause( 13, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ]
% 0.70/1.09 )
% 0.70/1.09 , 3, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, X )] ),
% 0.70/1.09 substitution( 1, [ :=( X, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 46, [ ~( t( X, X, X ) ), ~( t( X, X, X ) ), ~( s( X ) ), q( X, X, X
% 0.70/1.09 ) ] )
% 0.70/1.09 , clause( 0, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.70/1.09 , 0, clause( 45, [ ~( t( X, X, X ) ), ~( s( X ) ), p( X, X, X ), q( X, X, X
% 0.70/1.09 ) ] )
% 0.70/1.09 , 2, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, X )] ),
% 0.70/1.09 substitution( 1, [ :=( X, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 factor(
% 0.70/1.09 clause( 47, [ ~( t( X, X, X ) ), ~( s( X ) ), q( X, X, X ) ] )
% 0.70/1.09 , clause( 46, [ ~( t( X, X, X ) ), ~( t( X, X, X ) ), ~( s( X ) ), q( X, X
% 0.70/1.09 , X ) ] )
% 0.70/1.09 , 0, 1, substitution( 0, [ :=( X, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 16, [ ~( s( X ) ), ~( t( X, X, X ) ), q( X, X, X ) ] )
% 0.70/1.09 , clause( 47, [ ~( t( X, X, X ) ), ~( s( X ) ), q( X, X, X ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.70/1.09 0 ), ==>( 2, 2 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 48, [ ~( t( X, X, X ) ), ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.70/1.09 , clause( 1, [ ~( t( X, Y, Z ) ), ~( q( X, Y, Z ) ) ] )
% 0.70/1.09 , 1, clause( 16, [ ~( s( X ) ), ~( t( X, X, X ) ), q( X, X, X ) ] )
% 0.70/1.09 , 2, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, X )] ),
% 0.70/1.09 substitution( 1, [ :=( X, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 factor(
% 0.70/1.09 clause( 49, [ ~( t( X, X, X ) ), ~( s( X ) ) ] )
% 0.70/1.09 , clause( 48, [ ~( t( X, X, X ) ), ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.70/1.09 , 0, 2, substitution( 0, [ :=( X, X )] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 17, [ ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.70/1.09 , clause( 49, [ ~( t( X, X, X ) ), ~( s( X ) ) ] )
% 0.70/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.70/1.09 0 )] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 50, [ ~( s( c ) ) ] )
% 0.70/1.09 , clause( 17, [ ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.70/1.09 , 1, clause( 14, [ t( c, c, c ) ] )
% 0.70/1.09 , 0, substitution( 0, [ :=( X, c )] ), substitution( 1, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 resolution(
% 0.70/1.09 clause( 51, [] )
% 0.70/1.09 , clause( 50, [ ~( s( c ) ) ] )
% 0.70/1.09 , 0, clause( 5, [ s( c ) ] )
% 0.70/1.09 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 subsumption(
% 0.70/1.09 clause( 18, [] )
% 0.70/1.09 , clause( 51, [] )
% 0.70/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 end.
% 0.70/1.09
% 0.70/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09
% 0.70/1.09 Memory use:
% 0.70/1.09
% 0.70/1.09 space for terms: 398
% 0.70/1.09 space for clauses: 1091
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 clauses generated: 21
% 0.70/1.09 clauses kept: 19
% 0.70/1.09 clauses selected: 13
% 0.70/1.09 clauses deleted: 1
% 0.70/1.09 clauses inuse deleted: 0
% 0.70/1.09
% 0.70/1.09 subsentry: 38
% 0.70/1.09 literals s-matched: 17
% 0.70/1.09 literals matched: 8
% 0.70/1.09 full subsumption: 0
% 0.70/1.09
% 0.70/1.09 checksum: 12836694
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 Bliksem ended
%------------------------------------------------------------------------------