↑ Up

Bliksem---1.12.UNS-Ref.s

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

% Computer : n021.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 : Sat Jul 16 12:47:08 EDT 2022

% Result   : Unsatisfiable 0.44s 1.08s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : HEN008-6 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n021.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 : Fri Jul  1 14:45:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.44/1.08  *** allocated 10000 integers for termspace/termends
% 0.44/1.08  *** allocated 10000 integers for clauses
% 0.44/1.08  *** allocated 10000 integers for justifications
% 0.44/1.08  Bliksem 1.12
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  Automatic Strategy Selection
% 0.44/1.08  
% 0.44/1.08  Clauses:
% 0.44/1.08  [
% 0.44/1.08     [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ],
% 0.44/1.08     [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ],
% 0.44/1.08     [ 'less_equal'( divide( X, Y ), X ) ],
% 0.44/1.08     [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( divide( 
% 0.44/1.08    X, Z ), Y ) ) ],
% 0.44/1.08     [ 'less_equal'( zero, X ) ],
% 0.44/1.08     [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y ) ],
% 0.44/1.08     [ 'less_equal'( X, identity ) ],
% 0.44/1.08     [ =( divide( X, identity ), zero ) ],
% 0.44/1.08     [ =( divide( zero, X ), zero ) ],
% 0.44/1.08     [ =( divide( X, X ), zero ) ],
% 0.44/1.08     [ 'less_equal'( a, b ) ],
% 0.44/1.08     [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ]
% 0.44/1.08  ] .
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  percentage equality = 0.375000, percentage horn = 1.000000
% 0.44/1.08  This is a problem with some equality
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  Options Used:
% 0.44/1.08  
% 0.44/1.08  useres =            1
% 0.44/1.08  useparamod =        1
% 0.44/1.08  useeqrefl =         1
% 0.44/1.08  useeqfact =         1
% 0.44/1.08  usefactor =         1
% 0.44/1.08  usesimpsplitting =  0
% 0.44/1.08  usesimpdemod =      5
% 0.44/1.08  usesimpres =        3
% 0.44/1.08  
% 0.44/1.08  resimpinuse      =  1000
% 0.44/1.08  resimpclauses =     20000
% 0.44/1.08  substype =          eqrewr
% 0.44/1.08  backwardsubs =      1
% 0.44/1.08  selectoldest =      5
% 0.44/1.08  
% 0.44/1.08  litorderings [0] =  split
% 0.44/1.08  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.44/1.08  
% 0.44/1.08  termordering =      kbo
% 0.44/1.08  
% 0.44/1.08  litapriori =        0
% 0.44/1.08  termapriori =       1
% 0.44/1.08  litaposteriori =    0
% 0.44/1.08  termaposteriori =   0
% 0.44/1.08  demodaposteriori =  0
% 0.44/1.08  ordereqreflfact =   0
% 0.44/1.08  
% 0.44/1.08  litselect =         negord
% 0.44/1.08  
% 0.44/1.08  maxweight =         15
% 0.44/1.08  maxdepth =          30000
% 0.44/1.08  maxlength =         115
% 0.44/1.08  maxnrvars =         195
% 0.44/1.08  excuselevel =       1
% 0.44/1.08  increasemaxweight = 1
% 0.44/1.08  
% 0.44/1.08  maxselected =       10000000
% 0.44/1.08  maxnrclauses =      10000000
% 0.44/1.08  
% 0.44/1.08  showgenerated =    0
% 0.44/1.08  showkept =         0
% 0.44/1.08  showselected =     0
% 0.44/1.08  showdeleted =      0
% 0.44/1.08  showresimp =       1
% 0.44/1.08  showstatus =       2000
% 0.44/1.08  
% 0.44/1.08  prologoutput =     1
% 0.44/1.08  nrgoals =          5000000
% 0.44/1.08  totalproof =       1
% 0.44/1.08  
% 0.44/1.08  Symbols occurring in the translation:
% 0.44/1.08  
% 0.44/1.08  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.44/1.08  .  [1, 2]      (w:1, o:22, a:1, s:1, b:0), 
% 0.44/1.08  !  [4, 1]      (w:0, o:17, a:1, s:1, b:0), 
% 0.44/1.08  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.44/1.08  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.44/1.08  'less_equal'  [41, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.44/1.08  divide  [42, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.44/1.08  zero  [43, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 0.44/1.08  identity  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.44/1.08  a  [46, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.44/1.08  b  [47, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.44/1.08  c  [48, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  Starting Search:
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  Bliksems!, er is een bewijs:
% 0.44/1.08  % SZS status Unsatisfiable
% 0.44/1.08  % SZS output start Refutation
% 0.44/1.08  
% 0.44/1.08  clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( 
% 0.44/1.08    divide( X, Z ), Y ) ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.44/1.08     ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 8, [ =( divide( zero, X ), zero ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 10, [ 'less_equal'( a, b ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 11, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 13, [ =( divide( a, b ), zero ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 16, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 23, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), zero
% 0.44/1.08     ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 37, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.44/1.08  .
% 0.44/1.08  clause( 171, [] )
% 0.44/1.08  .
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  % SZS output end Refutation
% 0.44/1.08  found a proof!
% 0.44/1.08  
% 0.44/1.08  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.08  
% 0.44/1.08  initialclauses(
% 0.44/1.08  [ clause( 173, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.44/1.08  , clause( 174, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.44/1.08  , clause( 175, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.44/1.08  , clause( 176, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 0.44/1.08    divide( divide( X, Z ), Y ) ) ] )
% 0.44/1.08  , clause( 177, [ 'less_equal'( zero, X ) ] )
% 0.44/1.08  , clause( 178, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.44/1.08    , Y ) ] )
% 0.44/1.08  , clause( 179, [ 'less_equal'( X, identity ) ] )
% 0.44/1.08  , clause( 180, [ =( divide( X, identity ), zero ) ] )
% 0.44/1.08  , clause( 181, [ =( divide( zero, X ), zero ) ] )
% 0.44/1.08  , clause( 182, [ =( divide( X, X ), zero ) ] )
% 0.44/1.08  , clause( 183, [ 'less_equal'( a, b ) ] )
% 0.44/1.08  , clause( 184, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.44/1.08  ] ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.44/1.08  , clause( 173, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.44/1.08  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.08     ), ==>( 1, 1 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.44/1.08  , clause( 174, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.44/1.08  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.08     ), ==>( 1, 1 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( 
% 0.44/1.08    divide( X, Z ), Y ) ) ] )
% 0.44/1.08  , clause( 176, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 0.44/1.08    divide( divide( X, Z ), Y ) ) ] )
% 0.44/1.08  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.44/1.08    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.44/1.08  , clause( 177, [ 'less_equal'( zero, X ) ] )
% 0.44/1.08  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.44/1.08     ) ] )
% 0.44/1.08  , clause( 178, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.44/1.08    , Y ) ] )
% 0.44/1.08  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.08     ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 8, [ =( divide( zero, X ), zero ) ] )
% 0.44/1.08  , clause( 181, [ =( divide( zero, X ), zero ) ] )
% 0.44/1.08  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 10, [ 'less_equal'( a, b ) ] )
% 0.44/1.08  , clause( 183, [ 'less_equal'( a, b ) ] )
% 0.44/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 11, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.44/1.08  , clause( 184, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.44/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  eqswap(
% 0.44/1.08  clause( 212, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.44/1.08  , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.44/1.08  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  resolution(
% 0.44/1.08  clause( 213, [ =( zero, divide( a, b ) ) ] )
% 0.44/1.08  , clause( 212, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.44/1.08  , 1, clause( 10, [ 'less_equal'( a, b ) ] )
% 0.44/1.08  , 0, substitution( 0, [ :=( X, a ), :=( Y, b )] ), substitution( 1, [] )
% 0.44/1.08    ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  eqswap(
% 0.44/1.08  clause( 214, [ =( divide( a, b ), zero ) ] )
% 0.44/1.08  , clause( 213, [ =( zero, divide( a, b ) ) ] )
% 0.44/1.08  , 0, substitution( 0, [] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 13, [ =( divide( a, b ), zero ) ] )
% 0.44/1.08  , clause( 214, [ =( divide( a, b ), zero ) ] )
% 0.44/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  eqswap(
% 0.44/1.08  clause( 215, [ ~( =( zero, divide( X, Y ) ) ), 'less_equal'( X, Y ) ] )
% 0.44/1.08  , clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.44/1.08  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  resolution(
% 0.44/1.08  clause( 216, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) ) ) ]
% 0.44/1.08     )
% 0.44/1.08  , clause( 11, [ ~( 'less_equal'( divide( a, c ), divide( b, c ) ) ) ] )
% 0.44/1.08  , 0, clause( 215, [ ~( =( zero, divide( X, Y ) ) ), 'less_equal'( X, Y ) ]
% 0.44/1.08     )
% 0.44/1.08  , 1, substitution( 0, [] ), substitution( 1, [ :=( X, divide( a, c ) ), 
% 0.44/1.08    :=( Y, divide( b, c ) )] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  eqswap(
% 0.44/1.08  clause( 217, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ]
% 0.44/1.08     )
% 0.44/1.08  , clause( 216, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) ) ) ]
% 0.44/1.08     )
% 0.44/1.08  , 0, substitution( 0, [] )).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  subsumption(
% 0.44/1.08  clause( 16, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ] )
% 0.44/1.08  , clause( 217, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ]
% 0.44/1.08     )
% 0.44/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08  
% 0.44/1.08  
% 0.44/1.08  paramod(
% 0.44/1.08  clause( 222, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), 
% 0.44/1.08    divide( zero, X ) ) ] )
% 0.44/1.08  , clause( 13, [ =( divide( a, b ), zero ) ] )
% 0.44/1.08  , 0, clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), 
% 0.44/1.08    divide( divide( X, Z ), Y ) ) ] )
% 0.44/1.09  , 0, 9, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, X ), 
% 0.44/1.09    :=( Z, b )] )).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  paramod(
% 0.44/1.09  clause( 223, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), zero
% 0.44/1.09     ) ] )
% 0.44/1.09  , clause( 8, [ =( divide( zero, X ), zero ) ] )
% 0.44/1.09  , 0, clause( 222, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) )
% 0.44/1.09    , divide( zero, X ) ) ] )
% 0.44/1.09  , 0, 8, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.44/1.09    ).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  subsumption(
% 0.44/1.09  clause( 23, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), zero
% 0.44/1.09     ) ] )
% 0.44/1.09  , clause( 223, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), 
% 0.44/1.09    zero ) ] )
% 0.44/1.09  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  resolution(
% 0.44/1.09  clause( 224, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.44/1.09  , clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, 
% 0.44/1.09    Y ) ] )
% 0.44/1.09  , 0, clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.44/1.09  , 0, substitution( 0, [ :=( X, zero ), :=( Y, X )] ), substitution( 1, [ 
% 0.44/1.09    :=( X, X )] )).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  subsumption(
% 0.44/1.09  clause( 37, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.44/1.09  , clause( 224, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.44/1.09  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.44/1.09    1 )] ) ).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  eqswap(
% 0.44/1.09  clause( 226, [ =( X, zero ), ~( 'less_equal'( X, zero ) ) ] )
% 0.44/1.09  , clause( 37, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.44/1.09  , 1, substitution( 0, [ :=( X, X )] )).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  eqswap(
% 0.44/1.09  clause( 227, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) ) ) ]
% 0.44/1.09     )
% 0.44/1.09  , clause( 16, [ ~( =( divide( divide( a, c ), divide( b, c ) ), zero ) ) ]
% 0.44/1.09     )
% 0.44/1.09  , 0, substitution( 0, [] )).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  paramod(
% 0.44/1.09  clause( 229, [ ~( =( zero, zero ) ), ~( 'less_equal'( divide( divide( a, c
% 0.44/1.09     ), divide( b, c ) ), zero ) ) ] )
% 0.44/1.09  , clause( 226, [ =( X, zero ), ~( 'less_equal'( X, zero ) ) ] )
% 0.44/1.09  , 0, clause( 227, [ ~( =( zero, divide( divide( a, c ), divide( b, c ) ) )
% 0.44/1.09     ) ] )
% 0.44/1.09  , 0, 3, substitution( 0, [ :=( X, divide( divide( a, c ), divide( b, c ) )
% 0.44/1.09     )] ), substitution( 1, [] )).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  eqrefl(
% 0.44/1.09  clause( 361, [ ~( 'less_equal'( divide( divide( a, c ), divide( b, c ) ), 
% 0.44/1.09    zero ) ) ] )
% 0.44/1.09  , clause( 229, [ ~( =( zero, zero ) ), ~( 'less_equal'( divide( divide( a, 
% 0.44/1.09    c ), divide( b, c ) ), zero ) ) ] )
% 0.44/1.09  , 0, substitution( 0, [] )).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  resolution(
% 0.44/1.09  clause( 362, [] )
% 0.44/1.09  , clause( 361, [ ~( 'less_equal'( divide( divide( a, c ), divide( b, c ) )
% 0.44/1.09    , zero ) ) ] )
% 0.44/1.09  , 0, clause( 23, [ 'less_equal'( divide( divide( a, X ), divide( b, X ) ), 
% 0.44/1.09    zero ) ] )
% 0.44/1.09  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, c )] )).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  subsumption(
% 0.44/1.09  clause( 171, [] )
% 0.44/1.09  , clause( 362, [] )
% 0.44/1.09  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  end.
% 0.44/1.09  
% 0.44/1.09  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.09  
% 0.44/1.09  Memory use:
% 0.44/1.09  
% 0.44/1.09  space for terms:        2157
% 0.44/1.09  space for clauses:      10903
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  clauses generated:      800
% 0.44/1.09  clauses kept:           172
% 0.44/1.09  clauses selected:       45
% 0.44/1.09  clauses deleted:        0
% 0.44/1.09  clauses inuse deleted:  0
% 0.44/1.09  
% 0.44/1.09  subsentry:          1938
% 0.44/1.09  literals s-matched: 1159
% 0.44/1.09  literals matched:   1159
% 0.44/1.09  full subsumption:   63
% 0.44/1.09  
% 0.44/1.09  checksum:           404789457
% 0.44/1.09  
% 0.44/1.09  
% 0.44/1.09  Bliksem ended
%------------------------------------------------------------------------------