↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : NUM015-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n020.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 : Mon Jul 18 06:19:15 EDT 2022

% Result   : Unsatisfiable 0.75s 1.15s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : NUM015-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14  % Command  : bliksem %s
% 0.14/0.36  % Computer : n020.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % DateTime : Wed Jul  6 14:32:29 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.75/1.15  *** allocated 10000 integers for termspace/termends
% 0.75/1.15  *** allocated 10000 integers for clauses
% 0.75/1.15  *** allocated 10000 integers for justifications
% 0.75/1.15  Bliksem 1.12
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  Automatic Strategy Selection
% 0.75/1.15  
% 0.75/1.15  Clauses:
% 0.75/1.15  [
% 0.75/1.15     [ divides( X, X ) ],
% 0.75/1.15     [ ~( divides( X, Y ) ), ~( divides( Y, Z ) ), divides( X, Z ) ],
% 0.75/1.15     [ prime( X ), divides( divisor( X ), X ) ],
% 0.75/1.15     [ prime( X ), less( n1, divisor( X ) ) ],
% 0.75/1.15     [ prime( X ), less( divisor( X ), X ) ],
% 0.75/1.15     [ ~( less( n1, X ) ), ~( less( X, a ) ), prime( 'factor_of'( X ) ) ]
% 0.75/1.15    ,
% 0.75/1.15     [ ~( less( n1, X ) ), ~( less( X, a ) ), divides( 'factor_of'( X ), X )
% 0.75/1.15     ],
% 0.75/1.15     [ less( n1, a ) ],
% 0.75/1.15     [ ~( prime( X ) ), ~( divides( X, a ) ) ]
% 0.75/1.15  ] .
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  percentage equality = 0.000000, percentage horn = 0.666667
% 0.75/1.15  This a non-horn, non-equality problem
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  Options Used:
% 0.75/1.15  
% 0.75/1.15  useres =            1
% 0.75/1.15  useparamod =        0
% 0.75/1.15  useeqrefl =         0
% 0.75/1.15  useeqfact =         0
% 0.75/1.15  usefactor =         1
% 0.75/1.15  usesimpsplitting =  0
% 0.75/1.15  usesimpdemod =      0
% 0.75/1.15  usesimpres =        3
% 0.75/1.15  
% 0.75/1.15  resimpinuse      =  1000
% 0.75/1.15  resimpclauses =     20000
% 0.75/1.15  substype =          standard
% 0.75/1.15  backwardsubs =      1
% 0.75/1.15  selectoldest =      5
% 0.75/1.15  
% 0.75/1.15  litorderings [0] =  split
% 0.75/1.15  litorderings [1] =  liftord
% 0.75/1.15  
% 0.75/1.15  termordering =      none
% 0.75/1.15  
% 0.75/1.15  litapriori =        1
% 0.75/1.15  termapriori =       0
% 0.75/1.15  litaposteriori =    0
% 0.75/1.15  termaposteriori =   0
% 0.75/1.15  demodaposteriori =  0
% 0.75/1.15  ordereqreflfact =   0
% 0.75/1.15  
% 0.75/1.15  litselect =         none
% 0.75/1.15  
% 0.75/1.15  maxweight =         15
% 0.75/1.15  maxdepth =          30000
% 0.75/1.15  maxlength =         115
% 0.75/1.15  maxnrvars =         195
% 0.75/1.15  excuselevel =       1
% 0.75/1.15  increasemaxweight = 1
% 0.75/1.15  
% 0.75/1.15  maxselected =       10000000
% 0.75/1.15  maxnrclauses =      10000000
% 0.75/1.15  
% 0.75/1.15  showgenerated =    0
% 0.75/1.15  showkept =         0
% 0.75/1.15  showselected =     0
% 0.75/1.15  showdeleted =      0
% 0.75/1.15  showresimp =       1
% 0.75/1.15  showstatus =       2000
% 0.75/1.15  
% 0.75/1.15  prologoutput =     1
% 0.75/1.15  nrgoals =          5000000
% 0.75/1.15  totalproof =       1
% 0.75/1.15  
% 0.75/1.15  Symbols occurring in the translation:
% 0.75/1.15  
% 0.75/1.15  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.75/1.15  .  [1, 2]      (w:1, o:22, a:1, s:1, b:0), 
% 0.75/1.15  !  [4, 1]      (w:0, o:14, a:1, s:1, b:0), 
% 0.75/1.15  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.75/1.15  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.75/1.15  divides  [40, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.75/1.15  prime  [43, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.75/1.15  divisor  [44, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.75/1.15  n1  [45, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 0.75/1.15  less  [46, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.75/1.15  a  [47, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.75/1.15  'factor_of'  [48, 1]      (w:1, o:21, a:1, s:1, b:0).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  Starting Search:
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  Bliksems!, er is een bewijs:
% 0.75/1.15  % SZS status Unsatisfiable
% 0.75/1.15  % SZS output start Refutation
% 0.75/1.15  
% 0.75/1.15  clause( 0, [ divides( X, X ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 1, [ ~( divides( Y, Z ) ), divides( X, Z ), ~( divides( X, Y ) ) ]
% 0.75/1.15     )
% 0.75/1.15  .
% 0.75/1.15  clause( 2, [ prime( X ), divides( divisor( X ), X ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 3, [ prime( X ), less( n1, divisor( X ) ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 4, [ prime( X ), less( divisor( X ), X ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 5, [ prime( 'factor_of'( X ) ), ~( less( n1, X ) ), ~( less( X, a )
% 0.75/1.15     ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 6, [ divides( 'factor_of'( X ), X ), ~( less( n1, X ) ), ~( less( X
% 0.75/1.15    , a ) ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 8, [ ~( prime( X ) ), ~( divides( X, a ) ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 9, [ ~( prime( a ) ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 11, [ ~( prime( Y ) ), ~( divides( X, a ) ), ~( divides( Y, X ) ) ]
% 0.75/1.15     )
% 0.75/1.15  .
% 0.75/1.15  clause( 15, [ ~( prime( X ) ), ~( divides( X, divisor( a ) ) ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 19, [ prime( a ), prime( 'factor_of'( divisor( a ) ) ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 26, [ prime( a ), divides( 'factor_of'( divisor( a ) ), divisor( a
% 0.75/1.15     ) ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 29, [ prime( 'factor_of'( divisor( a ) ) ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 37, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ) ] )
% 0.75/1.15  .
% 0.75/1.15  clause( 41, [] )
% 0.75/1.15  .
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  % SZS output end Refutation
% 0.75/1.15  found a proof!
% 0.75/1.15  
% 0.75/1.15  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.75/1.15  
% 0.75/1.15  initialclauses(
% 0.75/1.15  [ clause( 43, [ divides( X, X ) ] )
% 0.75/1.15  , clause( 44, [ ~( divides( X, Y ) ), ~( divides( Y, Z ) ), divides( X, Z )
% 0.75/1.15     ] )
% 0.75/1.15  , clause( 45, [ prime( X ), divides( divisor( X ), X ) ] )
% 0.75/1.15  , clause( 46, [ prime( X ), less( n1, divisor( X ) ) ] )
% 0.75/1.15  , clause( 47, [ prime( X ), less( divisor( X ), X ) ] )
% 0.75/1.15  , clause( 48, [ ~( less( n1, X ) ), ~( less( X, a ) ), prime( 'factor_of'( 
% 0.75/1.15    X ) ) ] )
% 0.75/1.15  , clause( 49, [ ~( less( n1, X ) ), ~( less( X, a ) ), divides( 'factor_of'( 
% 0.75/1.15    X ), X ) ] )
% 0.75/1.15  , clause( 50, [ less( n1, a ) ] )
% 0.75/1.15  , clause( 51, [ ~( prime( X ) ), ~( divides( X, a ) ) ] )
% 0.75/1.15  ] ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 0, [ divides( X, X ) ] )
% 0.75/1.15  , clause( 43, [ divides( X, X ) ] )
% 0.75/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 1, [ ~( divides( Y, Z ) ), divides( X, Z ), ~( divides( X, Y ) ) ]
% 0.75/1.15     )
% 0.75/1.15  , clause( 44, [ ~( divides( X, Y ) ), ~( divides( Y, Z ) ), divides( X, Z )
% 0.75/1.15     ] )
% 0.75/1.15  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.75/1.15    permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 2, [ prime( X ), divides( divisor( X ), X ) ] )
% 0.75/1.15  , clause( 45, [ prime( X ), divides( divisor( X ), X ) ] )
% 0.75/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.75/1.15    1 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 3, [ prime( X ), less( n1, divisor( X ) ) ] )
% 0.75/1.15  , clause( 46, [ prime( X ), less( n1, divisor( X ) ) ] )
% 0.75/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.75/1.15    1 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 4, [ prime( X ), less( divisor( X ), X ) ] )
% 0.75/1.15  , clause( 47, [ prime( X ), less( divisor( X ), X ) ] )
% 0.75/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.75/1.15    1 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 5, [ prime( 'factor_of'( X ) ), ~( less( n1, X ) ), ~( less( X, a )
% 0.75/1.15     ) ] )
% 0.75/1.15  , clause( 48, [ ~( less( n1, X ) ), ~( less( X, a ) ), prime( 'factor_of'( 
% 0.75/1.15    X ) ) ] )
% 0.75/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 
% 0.75/1.15    2 ), ==>( 2, 0 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 6, [ divides( 'factor_of'( X ), X ), ~( less( n1, X ) ), ~( less( X
% 0.75/1.15    , a ) ) ] )
% 0.75/1.15  , clause( 49, [ ~( less( n1, X ) ), ~( less( X, a ) ), divides( 'factor_of'( 
% 0.75/1.15    X ), X ) ] )
% 0.75/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 
% 0.75/1.15    2 ), ==>( 2, 0 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 8, [ ~( prime( X ) ), ~( divides( X, a ) ) ] )
% 0.75/1.15  , clause( 51, [ ~( prime( X ) ), ~( divides( X, a ) ) ] )
% 0.75/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.75/1.15    1 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 59, [ ~( prime( a ) ) ] )
% 0.75/1.15  , clause( 8, [ ~( prime( X ) ), ~( divides( X, a ) ) ] )
% 0.75/1.15  , 1, clause( 0, [ divides( X, X ) ] )
% 0.75/1.15  , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [ :=( X, a )] )
% 0.75/1.15    ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 9, [ ~( prime( a ) ) ] )
% 0.75/1.15  , clause( 59, [ ~( prime( a ) ) ] )
% 0.75/1.15  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 60, [ ~( prime( X ) ), ~( divides( Y, a ) ), ~( divides( X, Y ) ) ]
% 0.75/1.15     )
% 0.75/1.15  , clause( 8, [ ~( prime( X ) ), ~( divides( X, a ) ) ] )
% 0.75/1.15  , 1, clause( 1, [ ~( divides( Y, Z ) ), divides( X, Z ), ~( divides( X, Y )
% 0.75/1.15     ) ] )
% 0.75/1.15  , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.75/1.15    , Y ), :=( Z, a )] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 11, [ ~( prime( Y ) ), ~( divides( X, a ) ), ~( divides( Y, X ) ) ]
% 0.75/1.15     )
% 0.75/1.15  , clause( 60, [ ~( prime( X ) ), ~( divides( Y, a ) ), ~( divides( X, Y ) )
% 0.75/1.15     ] )
% 0.75/1.15  , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.75/1.15     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 63, [ ~( prime( X ) ), ~( divides( X, divisor( a ) ) ), prime( a )
% 0.75/1.15     ] )
% 0.75/1.15  , clause( 11, [ ~( prime( Y ) ), ~( divides( X, a ) ), ~( divides( Y, X ) )
% 0.75/1.15     ] )
% 0.75/1.15  , 1, clause( 2, [ prime( X ), divides( divisor( X ), X ) ] )
% 0.75/1.15  , 1, substitution( 0, [ :=( X, divisor( a ) ), :=( Y, X )] ), 
% 0.75/1.15    substitution( 1, [ :=( X, a )] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 66, [ ~( prime( X ) ), ~( divides( X, divisor( a ) ) ) ] )
% 0.75/1.15  , clause( 9, [ ~( prime( a ) ) ] )
% 0.75/1.15  , 0, clause( 63, [ ~( prime( X ) ), ~( divides( X, divisor( a ) ) ), prime( 
% 0.75/1.15    a ) ] )
% 0.75/1.15  , 2, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 15, [ ~( prime( X ) ), ~( divides( X, divisor( a ) ) ) ] )
% 0.75/1.15  , clause( 66, [ ~( prime( X ) ), ~( divides( X, divisor( a ) ) ) ] )
% 0.75/1.15  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.75/1.15    1 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 67, [ prime( 'factor_of'( divisor( a ) ) ), ~( less( n1, divisor( a
% 0.75/1.15     ) ) ), prime( a ) ] )
% 0.75/1.15  , clause( 5, [ prime( 'factor_of'( X ) ), ~( less( n1, X ) ), ~( less( X, a
% 0.75/1.15     ) ) ] )
% 0.75/1.15  , 2, clause( 4, [ prime( X ), less( divisor( X ), X ) ] )
% 0.75/1.15  , 1, substitution( 0, [ :=( X, divisor( a ) )] ), substitution( 1, [ :=( X
% 0.75/1.15    , a )] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 68, [ prime( 'factor_of'( divisor( a ) ) ), prime( a ), prime( a )
% 0.75/1.15     ] )
% 0.75/1.15  , clause( 67, [ prime( 'factor_of'( divisor( a ) ) ), ~( less( n1, divisor( 
% 0.75/1.15    a ) ) ), prime( a ) ] )
% 0.75/1.15  , 1, clause( 3, [ prime( X ), less( n1, divisor( X ) ) ] )
% 0.75/1.15  , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  factor(
% 0.75/1.15  clause( 69, [ prime( 'factor_of'( divisor( a ) ) ), prime( a ) ] )
% 0.75/1.15  , clause( 68, [ prime( 'factor_of'( divisor( a ) ) ), prime( a ), prime( a
% 0.75/1.15     ) ] )
% 0.75/1.15  , 1, 2, substitution( 0, [] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 19, [ prime( a ), prime( 'factor_of'( divisor( a ) ) ) ] )
% 0.75/1.15  , clause( 69, [ prime( 'factor_of'( divisor( a ) ) ), prime( a ) ] )
% 0.75/1.15  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.75/1.15     ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 70, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ), ~( less( 
% 0.75/1.15    n1, divisor( a ) ) ), prime( a ) ] )
% 0.75/1.15  , clause( 6, [ divides( 'factor_of'( X ), X ), ~( less( n1, X ) ), ~( less( 
% 0.75/1.15    X, a ) ) ] )
% 0.75/1.15  , 2, clause( 4, [ prime( X ), less( divisor( X ), X ) ] )
% 0.75/1.15  , 1, substitution( 0, [ :=( X, divisor( a ) )] ), substitution( 1, [ :=( X
% 0.75/1.15    , a )] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 71, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ), prime( 
% 0.75/1.15    a ), prime( a ) ] )
% 0.75/1.15  , clause( 70, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ), ~( 
% 0.75/1.15    less( n1, divisor( a ) ) ), prime( a ) ] )
% 0.75/1.15  , 1, clause( 3, [ prime( X ), less( n1, divisor( X ) ) ] )
% 0.75/1.15  , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  factor(
% 0.75/1.15  clause( 72, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ), prime( 
% 0.75/1.15    a ) ] )
% 0.75/1.15  , clause( 71, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ), prime( 
% 0.75/1.15    a ), prime( a ) ] )
% 0.75/1.15  , 1, 2, substitution( 0, [] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 26, [ prime( a ), divides( 'factor_of'( divisor( a ) ), divisor( a
% 0.75/1.15     ) ) ] )
% 0.75/1.15  , clause( 72, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ), prime( 
% 0.75/1.15    a ) ] )
% 0.75/1.15  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.75/1.15     ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 73, [ prime( 'factor_of'( divisor( a ) ) ) ] )
% 0.75/1.15  , clause( 9, [ ~( prime( a ) ) ] )
% 0.75/1.15  , 0, clause( 19, [ prime( a ), prime( 'factor_of'( divisor( a ) ) ) ] )
% 0.75/1.15  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 29, [ prime( 'factor_of'( divisor( a ) ) ) ] )
% 0.75/1.15  , clause( 73, [ prime( 'factor_of'( divisor( a ) ) ) ] )
% 0.75/1.15  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 74, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ) ] )
% 0.75/1.15  , clause( 9, [ ~( prime( a ) ) ] )
% 0.75/1.15  , 0, clause( 26, [ prime( a ), divides( 'factor_of'( divisor( a ) ), 
% 0.75/1.15    divisor( a ) ) ] )
% 0.75/1.15  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 37, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ) ] )
% 0.75/1.15  , clause( 74, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ) ] )
% 0.75/1.15  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 75, [ ~( prime( 'factor_of'( divisor( a ) ) ) ) ] )
% 0.75/1.15  , clause( 15, [ ~( prime( X ) ), ~( divides( X, divisor( a ) ) ) ] )
% 0.75/1.15  , 1, clause( 37, [ divides( 'factor_of'( divisor( a ) ), divisor( a ) ) ]
% 0.75/1.15     )
% 0.75/1.15  , 0, substitution( 0, [ :=( X, 'factor_of'( divisor( a ) ) )] ), 
% 0.75/1.15    substitution( 1, [] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  resolution(
% 0.75/1.15  clause( 76, [] )
% 0.75/1.15  , clause( 75, [ ~( prime( 'factor_of'( divisor( a ) ) ) ) ] )
% 0.75/1.15  , 0, clause( 29, [ prime( 'factor_of'( divisor( a ) ) ) ] )
% 0.75/1.15  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  subsumption(
% 0.75/1.15  clause( 41, [] )
% 0.75/1.15  , clause( 76, [] )
% 0.75/1.15  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  end.
% 0.75/1.15  
% 0.75/1.15  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.75/1.15  
% 0.75/1.15  Memory use:
% 0.75/1.15  
% 0.75/1.15  space for terms:        603
% 0.75/1.15  space for clauses:      2142
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  clauses generated:      99
% 0.75/1.15  clauses kept:           42
% 0.75/1.15  clauses selected:       22
% 0.75/1.15  clauses deleted:        2
% 0.75/1.15  clauses inuse deleted:  0
% 0.75/1.15  
% 0.75/1.15  subsentry:          145
% 0.75/1.15  literals s-matched: 124
% 0.75/1.15  literals matched:   124
% 0.75/1.15  full subsumption:   77
% 0.75/1.15  
% 0.75/1.15  checksum:           71876929
% 0.75/1.15  
% 0.75/1.15  
% 0.75/1.15  Bliksem ended
%------------------------------------------------------------------------------