TSTP Solution File: SYO629-1 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SYO629-1 : TPTP v8.1.0. Released v7.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n023.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 14:28:58 EDT 2022

% Result   : Unsatisfiable 0.48s 1.03s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : SYO629-1 : TPTP v8.1.0. Released v7.1.0.
% 0.04/0.15  % Command  : bliksem %s
% 0.15/0.36  % Computer : n023.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % DateTime : Sat Jul  9 08:28:26 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.48/1.03  *** allocated 10000 integers for termspace/termends
% 0.48/1.03  *** allocated 10000 integers for clauses
% 0.48/1.03  *** allocated 10000 integers for justifications
% 0.48/1.03  Bliksem 1.12
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  Automatic Strategy Selection
% 0.48/1.03  
% 0.48/1.03  Clauses:
% 0.48/1.03  [
% 0.48/1.03     [ ~( 'E'( f( X ), f( g( X ) ) ) ) ],
% 0.48/1.03     [ iLEQ( X, X ) ],
% 0.48/1.03     [ ~( 'E'( '0', f( X ) ) ), ~( 'E'( '0', f( g( X ) ) ) ), 'E'( f( X ), f( 
% 0.48/1.03    g( X ) ) ) ],
% 0.48/1.03     [ 'E'( s( '0' ), f( X ) ), 'LE'( f( X ), s( '0' ) ) ],
% 0.48/1.03     [ ~( 'LE'( f( X ), '0' ) ) ],
% 0.48/1.03     [ ~( 'LE'( f( X ), s( '0' ) ) ), ~( iLEQ( X, Y ) ), 'E'( '0', f( Y ) ), 
% 0.48/1.03    'LE'( f( Y ), '0' ) ],
% 0.48/1.03     [ ~( 'E'( s( '0' ), f( X ) ) ), ~( 'E'( s( '0' ), f( g( X ) ) ) ), 'E'( 
% 0.48/1.03    f( X ), f( g( X ) ) ) ],
% 0.48/1.03     [ ~( 'LE'( f( g( X ) ), '0' ) ) ],
% 0.48/1.03     [ iLEQ( X, g( X ) ) ],
% 0.48/1.03     [ iLEQ( X, g( X ) ) ],
% 0.48/1.03     [ ~( 'E'( f( X ), f( g( X ) ) ) ) ],
% 0.48/1.03     [ iLEQ( X, X ) ]
% 0.48/1.03  ] .
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  percentage equality = 0.000000, percentage horn = 0.750000
% 0.48/1.03  This a non-horn, non-equality problem
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  Options Used:
% 0.48/1.03  
% 0.48/1.03  useres =            1
% 0.48/1.03  useparamod =        0
% 0.48/1.03  useeqrefl =         0
% 0.48/1.03  useeqfact =         0
% 0.48/1.03  usefactor =         1
% 0.48/1.03  usesimpsplitting =  0
% 0.48/1.03  usesimpdemod =      0
% 0.48/1.03  usesimpres =        3
% 0.48/1.03  
% 0.48/1.03  resimpinuse      =  1000
% 0.48/1.03  resimpclauses =     20000
% 0.48/1.03  substype =          standard
% 0.48/1.03  backwardsubs =      1
% 0.48/1.03  selectoldest =      5
% 0.48/1.03  
% 0.48/1.03  litorderings [0] =  split
% 0.48/1.03  litorderings [1] =  liftord
% 0.48/1.03  
% 0.48/1.03  termordering =      none
% 0.48/1.03  
% 0.48/1.03  litapriori =        1
% 0.48/1.03  termapriori =       0
% 0.48/1.03  litaposteriori =    0
% 0.48/1.03  termaposteriori =   0
% 0.48/1.03  demodaposteriori =  0
% 0.48/1.03  ordereqreflfact =   0
% 0.48/1.03  
% 0.48/1.03  litselect =         none
% 0.48/1.03  
% 0.48/1.03  maxweight =         15
% 0.48/1.03  maxdepth =          30000
% 0.48/1.03  maxlength =         115
% 0.48/1.03  maxnrvars =         195
% 0.48/1.03  excuselevel =       1
% 0.48/1.03  increasemaxweight = 1
% 0.48/1.03  
% 0.48/1.03  maxselected =       10000000
% 0.48/1.03  maxnrclauses =      10000000
% 0.48/1.03  
% 0.48/1.03  showgenerated =    0
% 0.48/1.03  showkept =         0
% 0.48/1.03  showselected =     0
% 0.48/1.03  showdeleted =      0
% 0.48/1.03  showresimp =       1
% 0.48/1.03  showstatus =       2000
% 0.48/1.03  
% 0.48/1.03  prologoutput =     1
% 0.48/1.03  nrgoals =          5000000
% 0.48/1.03  totalproof =       1
% 0.48/1.03  
% 0.48/1.03  Symbols occurring in the translation:
% 0.48/1.03  
% 0.48/1.03  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.48/1.03  .  [1, 2]      (w:1, o:23, a:1, s:1, b:0), 
% 0.48/1.03  !  [4, 1]      (w:0, o:15, a:1, s:1, b:0), 
% 0.48/1.03  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.48/1.03  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.48/1.03  f  [40, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.48/1.03  g  [41, 1]      (w:1, o:21, a:1, s:1, b:0), 
% 0.48/1.03  'E'  [42, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.48/1.03  iLEQ  [43, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.48/1.03  '0'  [44, 0]      (w:1, o:6, a:1, s:1, b:0), 
% 0.48/1.03  s  [45, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 0.48/1.03  'LE'  [47, 2]      (w:1, o:50, a:1, s:1, b:0).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  Starting Search:
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  Bliksems!, er is een bewijs:
% 0.48/1.03  % SZS status Unsatisfiable
% 0.48/1.03  % SZS output start Refutation
% 0.48/1.03  
% 0.48/1.03  clause( 0, [ ~( 'E'( f( X ), f( g( X ) ) ) ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 1, [ iLEQ( X, X ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 2, [ ~( 'E'( '0', f( g( X ) ) ) ), ~( 'E'( '0', f( X ) ) ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 3, [ 'E'( s( '0' ), f( X ) ), 'LE'( f( X ), s( '0' ) ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 4, [ ~( 'LE'( f( X ), '0' ) ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 5, [ ~( iLEQ( X, Y ) ), 'E'( '0', f( Y ) ), ~( 'LE'( f( X ), s( '0'
% 0.48/1.03     ) ) ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 6, [ ~( 'E'( s( '0' ), f( g( X ) ) ) ), ~( 'E'( s( '0' ), f( X ) )
% 0.48/1.03     ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 7, [ iLEQ( X, g( X ) ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 8, [ 'E'( '0', f( Y ) ), 'E'( s( '0' ), f( X ) ), ~( iLEQ( X, Y ) )
% 0.48/1.03     ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 9, [ 'E'( s( '0' ), f( X ) ), 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 10, [ 'E'( '0', f( X ) ), 'E'( s( '0' ), f( X ) ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 11, [ 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.03  .
% 0.48/1.03  clause( 14, [] )
% 0.48/1.03  .
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  % SZS output end Refutation
% 0.48/1.03  found a proof!
% 0.48/1.03  
% 0.48/1.03  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.48/1.03  
% 0.48/1.03  initialclauses(
% 0.48/1.03  [ clause( 16, [ ~( 'E'( f( X ), f( g( X ) ) ) ) ] )
% 0.48/1.03  , clause( 17, [ iLEQ( X, X ) ] )
% 0.48/1.03  , clause( 18, [ ~( 'E'( '0', f( X ) ) ), ~( 'E'( '0', f( g( X ) ) ) ), 'E'( 
% 0.48/1.03    f( X ), f( g( X ) ) ) ] )
% 0.48/1.03  , clause( 19, [ 'E'( s( '0' ), f( X ) ), 'LE'( f( X ), s( '0' ) ) ] )
% 0.48/1.03  , clause( 20, [ ~( 'LE'( f( X ), '0' ) ) ] )
% 0.48/1.03  , clause( 21, [ ~( 'LE'( f( X ), s( '0' ) ) ), ~( iLEQ( X, Y ) ), 'E'( '0'
% 0.48/1.03    , f( Y ) ), 'LE'( f( Y ), '0' ) ] )
% 0.48/1.03  , clause( 22, [ ~( 'E'( s( '0' ), f( X ) ) ), ~( 'E'( s( '0' ), f( g( X ) )
% 0.48/1.03     ) ), 'E'( f( X ), f( g( X ) ) ) ] )
% 0.48/1.03  , clause( 23, [ ~( 'LE'( f( g( X ) ), '0' ) ) ] )
% 0.48/1.03  , clause( 24, [ iLEQ( X, g( X ) ) ] )
% 0.48/1.03  , clause( 25, [ iLEQ( X, g( X ) ) ] )
% 0.48/1.03  , clause( 26, [ ~( 'E'( f( X ), f( g( X ) ) ) ) ] )
% 0.48/1.03  , clause( 27, [ iLEQ( X, X ) ] )
% 0.48/1.03  ] ).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  subsumption(
% 0.48/1.03  clause( 0, [ ~( 'E'( f( X ), f( g( X ) ) ) ) ] )
% 0.48/1.03  , clause( 16, [ ~( 'E'( f( X ), f( g( X ) ) ) ) ] )
% 0.48/1.03  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  subsumption(
% 0.48/1.03  clause( 1, [ iLEQ( X, X ) ] )
% 0.48/1.03  , clause( 17, [ iLEQ( X, X ) ] )
% 0.48/1.03  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  resolution(
% 0.48/1.03  clause( 28, [ ~( 'E'( '0', f( X ) ) ), ~( 'E'( '0', f( g( X ) ) ) ) ] )
% 0.48/1.03  , clause( 0, [ ~( 'E'( f( X ), f( g( X ) ) ) ) ] )
% 0.48/1.03  , 0, clause( 18, [ ~( 'E'( '0', f( X ) ) ), ~( 'E'( '0', f( g( X ) ) ) ), 
% 0.48/1.03    'E'( f( X ), f( g( X ) ) ) ] )
% 0.48/1.03  , 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.48/1.03    ).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  subsumption(
% 0.48/1.03  clause( 2, [ ~( 'E'( '0', f( g( X ) ) ) ), ~( 'E'( '0', f( X ) ) ) ] )
% 0.48/1.03  , clause( 28, [ ~( 'E'( '0', f( X ) ) ), ~( 'E'( '0', f( g( X ) ) ) ) ] )
% 0.48/1.03  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 
% 0.48/1.03    0 )] ) ).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  subsumption(
% 0.48/1.03  clause( 3, [ 'E'( s( '0' ), f( X ) ), 'LE'( f( X ), s( '0' ) ) ] )
% 0.48/1.03  , clause( 19, [ 'E'( s( '0' ), f( X ) ), 'LE'( f( X ), s( '0' ) ) ] )
% 0.48/1.03  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.48/1.03    1 )] ) ).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  subsumption(
% 0.48/1.03  clause( 4, [ ~( 'LE'( f( X ), '0' ) ) ] )
% 0.48/1.03  , clause( 20, [ ~( 'LE'( f( X ), '0' ) ) ] )
% 0.48/1.03  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  resolution(
% 0.48/1.03  clause( 29, [ ~( 'LE'( f( Y ), s( '0' ) ) ), ~( iLEQ( Y, X ) ), 'E'( '0', f( 
% 0.48/1.03    X ) ) ] )
% 0.48/1.03  , clause( 4, [ ~( 'LE'( f( X ), '0' ) ) ] )
% 0.48/1.03  , 0, clause( 21, [ ~( 'LE'( f( X ), s( '0' ) ) ), ~( iLEQ( X, Y ) ), 'E'( 
% 0.48/1.03    '0', f( Y ) ), 'LE'( f( Y ), '0' ) ] )
% 0.48/1.03  , 3, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, Y ), :=( Y
% 0.48/1.03    , X )] )).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  subsumption(
% 0.48/1.03  clause( 5, [ ~( iLEQ( X, Y ) ), 'E'( '0', f( Y ) ), ~( 'LE'( f( X ), s( '0'
% 0.48/1.03     ) ) ) ] )
% 0.48/1.03  , clause( 29, [ ~( 'LE'( f( Y ), s( '0' ) ) ), ~( iLEQ( Y, X ) ), 'E'( '0'
% 0.48/1.03    , f( X ) ) ] )
% 0.48/1.03  , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 2
% 0.48/1.03     ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.48/1.03  
% 0.48/1.03  
% 0.48/1.03  resolution(
% 0.48/1.04  clause( 31, [ ~( 'E'( s( '0' ), f( X ) ) ), ~( 'E'( s( '0' ), f( g( X ) ) )
% 0.48/1.04     ) ] )
% 0.48/1.04  , clause( 0, [ ~( 'E'( f( X ), f( g( X ) ) ) ) ] )
% 0.48/1.04  , 0, clause( 22, [ ~( 'E'( s( '0' ), f( X ) ) ), ~( 'E'( s( '0' ), f( g( X
% 0.48/1.04     ) ) ) ), 'E'( f( X ), f( g( X ) ) ) ] )
% 0.48/1.04  , 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.48/1.04    ).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  subsumption(
% 0.48/1.04  clause( 6, [ ~( 'E'( s( '0' ), f( g( X ) ) ) ), ~( 'E'( s( '0' ), f( X ) )
% 0.48/1.04     ) ] )
% 0.48/1.04  , clause( 31, [ ~( 'E'( s( '0' ), f( X ) ) ), ~( 'E'( s( '0' ), f( g( X ) )
% 0.48/1.04     ) ) ] )
% 0.48/1.04  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 
% 0.48/1.04    0 )] ) ).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  subsumption(
% 0.48/1.04  clause( 7, [ iLEQ( X, g( X ) ) ] )
% 0.48/1.04  , clause( 24, [ iLEQ( X, g( X ) ) ] )
% 0.48/1.04  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  resolution(
% 0.48/1.04  clause( 32, [ ~( iLEQ( X, Y ) ), 'E'( '0', f( Y ) ), 'E'( s( '0' ), f( X )
% 0.48/1.04     ) ] )
% 0.48/1.04  , clause( 5, [ ~( iLEQ( X, Y ) ), 'E'( '0', f( Y ) ), ~( 'LE'( f( X ), s( 
% 0.48/1.04    '0' ) ) ) ] )
% 0.48/1.04  , 2, clause( 3, [ 'E'( s( '0' ), f( X ) ), 'LE'( f( X ), s( '0' ) ) ] )
% 0.48/1.04  , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.48/1.04    , X )] )).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  subsumption(
% 0.48/1.04  clause( 8, [ 'E'( '0', f( Y ) ), 'E'( s( '0' ), f( X ) ), ~( iLEQ( X, Y ) )
% 0.48/1.04     ] )
% 0.48/1.04  , clause( 32, [ ~( iLEQ( X, Y ) ), 'E'( '0', f( Y ) ), 'E'( s( '0' ), f( X
% 0.48/1.04     ) ) ] )
% 0.48/1.04  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 2
% 0.48/1.04     ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  resolution(
% 0.48/1.04  clause( 33, [ 'E'( '0', f( g( X ) ) ), 'E'( s( '0' ), f( X ) ) ] )
% 0.48/1.04  , clause( 8, [ 'E'( '0', f( Y ) ), 'E'( s( '0' ), f( X ) ), ~( iLEQ( X, Y )
% 0.48/1.04     ) ] )
% 0.48/1.04  , 2, clause( 7, [ iLEQ( X, g( X ) ) ] )
% 0.48/1.04  , 0, substitution( 0, [ :=( X, X ), :=( Y, g( X ) )] ), substitution( 1, [ 
% 0.48/1.04    :=( X, X )] )).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  subsumption(
% 0.48/1.04  clause( 9, [ 'E'( s( '0' ), f( X ) ), 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.04  , clause( 33, [ 'E'( '0', f( g( X ) ) ), 'E'( s( '0' ), f( X ) ) ] )
% 0.48/1.04  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 
% 0.48/1.04    0 )] ) ).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  resolution(
% 0.48/1.04  clause( 34, [ 'E'( '0', f( X ) ), 'E'( s( '0' ), f( X ) ) ] )
% 0.48/1.04  , clause( 8, [ 'E'( '0', f( Y ) ), 'E'( s( '0' ), f( X ) ), ~( iLEQ( X, Y )
% 0.48/1.04     ) ] )
% 0.48/1.04  , 2, clause( 1, [ iLEQ( X, X ) ] )
% 0.48/1.04  , 0, substitution( 0, [ :=( X, X ), :=( Y, X )] ), substitution( 1, [ :=( X
% 0.48/1.04    , X )] )).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  subsumption(
% 0.48/1.04  clause( 10, [ 'E'( '0', f( X ) ), 'E'( s( '0' ), f( X ) ) ] )
% 0.48/1.04  , clause( 34, [ 'E'( '0', f( X ) ), 'E'( s( '0' ), f( X ) ) ] )
% 0.48/1.04  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.48/1.04    1 )] ) ).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  resolution(
% 0.48/1.04  clause( 35, [ ~( 'E'( s( '0' ), f( X ) ) ), 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.04  , clause( 6, [ ~( 'E'( s( '0' ), f( g( X ) ) ) ), ~( 'E'( s( '0' ), f( X )
% 0.48/1.04     ) ) ] )
% 0.48/1.04  , 0, clause( 10, [ 'E'( '0', f( X ) ), 'E'( s( '0' ), f( X ) ) ] )
% 0.48/1.04  , 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, g( X ) )] )
% 0.48/1.04    ).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  resolution(
% 0.48/1.04  clause( 37, [ 'E'( '0', f( g( X ) ) ), 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.04  , clause( 35, [ ~( 'E'( s( '0' ), f( X ) ) ), 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.04  , 0, clause( 9, [ 'E'( s( '0' ), f( X ) ), 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.04  , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.48/1.04    ).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  factor(
% 0.48/1.04  clause( 38, [ 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.04  , clause( 37, [ 'E'( '0', f( g( X ) ) ), 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.04  , 0, 1, substitution( 0, [ :=( X, X )] )).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  subsumption(
% 0.48/1.04  clause( 11, [ 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.04  , clause( 38, [ 'E'( '0', f( g( X ) ) ) ] )
% 0.48/1.04  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  ==> clause( 14, [] )
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  
% 0.48/1.04  !!! Internal Problem: OH, OH, COULD NOT DERIVE GOAL !!!
% 0.48/1.04  
% 0.48/1.04  Bliksem ended
%------------------------------------------------------------------------------