↑ Up

Bliksem---1.12.UNS-Ref.s

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

% Computer : n005.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 07:34:15 EDT 2022

% Result   : Unsatisfiable 0.73s 1.11s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP004-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n005.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 Jun 13 06:38:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.73/1.11  *** allocated 10000 integers for termspace/termends
% 0.73/1.11  *** allocated 10000 integers for clauses
% 0.73/1.11  *** allocated 10000 integers for justifications
% 0.73/1.11  Bliksem 1.12
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Automatic Strategy Selection
% 0.73/1.11  
% 0.73/1.11  Clauses:
% 0.73/1.11  [
% 0.73/1.11     [ product( identity, X, X ) ],
% 0.73/1.11     [ product( inverse( X ), X, identity ) ],
% 0.73/1.11     [ product( X, Y, multiply( X, Y ) ) ],
% 0.73/1.11     [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), equalish( Z, T ) ]
% 0.73/1.11    ,
% 0.73/1.11     [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( Z, T, W
% 0.73/1.11     ) ), product( X, U, W ) ],
% 0.73/1.11     [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( product( X, U, W
% 0.73/1.11     ) ), product( Z, T, W ) ],
% 0.73/1.11     [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( Z, T, Y ) ]
% 0.73/1.11    ,
% 0.73/1.11     [ ~( product( a, inverse( a ), identity ) ) ]
% 0.73/1.11  ] .
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  percentage equality = 0.000000, percentage horn = 1.000000
% 0.73/1.11  This is a near-Horn, non-equality  problem
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Options Used:
% 0.73/1.11  
% 0.73/1.11  useres =            1
% 0.73/1.11  useparamod =        0
% 0.73/1.11  useeqrefl =         0
% 0.73/1.11  useeqfact =         0
% 0.73/1.11  usefactor =         1
% 0.73/1.11  usesimpsplitting =  0
% 0.73/1.11  usesimpdemod =      0
% 0.73/1.11  usesimpres =        4
% 0.73/1.11  
% 0.73/1.11  resimpinuse      =  1000
% 0.73/1.11  resimpclauses =     20000
% 0.73/1.11  substype =          standard
% 0.73/1.11  backwardsubs =      1
% 0.73/1.11  selectoldest =      5
% 0.73/1.11  
% 0.73/1.11  litorderings [0] =  split
% 0.73/1.11  litorderings [1] =  liftord
% 0.73/1.11  
% 0.73/1.11  termordering =      none
% 0.73/1.11  
% 0.73/1.11  litapriori =        1
% 0.73/1.11  termapriori =       0
% 0.73/1.11  litaposteriori =    0
% 0.73/1.11  termaposteriori =   0
% 0.73/1.11  demodaposteriori =  0
% 0.73/1.11  ordereqreflfact =   0
% 0.73/1.11  
% 0.73/1.11  litselect =         negative
% 0.73/1.11  
% 0.73/1.11  maxweight =         30000
% 0.73/1.11  maxdepth =          30000
% 0.73/1.11  maxlength =         115
% 0.73/1.11  maxnrvars =         195
% 0.73/1.11  excuselevel =       0
% 0.73/1.11  increasemaxweight = 0
% 0.73/1.11  
% 0.73/1.11  maxselected =       10000000
% 0.73/1.11  maxnrclauses =      10000000
% 0.73/1.11  
% 0.73/1.11  showgenerated =    0
% 0.73/1.11  showkept =         0
% 0.73/1.11  showselected =     0
% 0.73/1.11  showdeleted =      0
% 0.73/1.11  showresimp =       1
% 0.73/1.11  showstatus =       2000
% 0.73/1.11  
% 0.73/1.11  prologoutput =     1
% 0.73/1.11  nrgoals =          5000000
% 0.73/1.11  totalproof =       1
% 0.73/1.11  
% 0.73/1.11  Symbols occurring in the translation:
% 0.73/1.11  
% 0.73/1.11  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.73/1.11  .  [1, 2]      (w:1, o:23, a:1, s:1, b:0), 
% 0.73/1.11  !  [4, 1]      (w:1, o:17, a:1, s:1, b:0), 
% 0.73/1.11  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.73/1.11  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.73/1.11  identity  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.73/1.11  product  [41, 3]      (w:1, o:50, a:1, s:1, b:0), 
% 0.73/1.11  inverse  [42, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 0.73/1.11  multiply  [44, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.73/1.11  equalish  [47, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.73/1.11  a  [50, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Starting Search:
% 0.73/1.11  
% 0.73/1.11  Resimplifying inuse:
% 0.73/1.11  Done
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Bliksems!, er is een bewijs:
% 0.73/1.11  % SZS status Unsatisfiable
% 0.73/1.11  % SZS output start Refutation
% 0.73/1.11  
% 0.73/1.11  clause( 0, [ product( identity, X, X ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 1, [ product( inverse( X ), X, identity ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 2, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y, T
% 0.73/1.11     ) ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 4, [ ~( product( Y, T, U ) ), ~( product( X, Y, Z ) ), product( X, 
% 0.73/1.11    U, W ), ~( product( Z, T, W ) ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T, X
% 0.73/1.11     ) ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 7, [ ~( product( a, inverse( a ), identity ) ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 19, [ equalish( X, identity ), ~( product( inverse( Y ), Y, X ) ) ]
% 0.73/1.11     )
% 0.73/1.11  .
% 0.73/1.11  clause( 24, [ ~( product( X, Y, Z ) ), product( T, Z, Y ), ~( product( T, X
% 0.73/1.11    , identity ) ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 42, [ product( X, Y, Z ), ~( equalish( multiply( X, Y ), Z ) ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 271, [ product( inverse( X ), Z, Y ), ~( product( X, Y, Z ) ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 437, [ product( inverse( X ), multiply( X, Y ), Y ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 654, [ product( inverse( inverse( X ) ), Y, multiply( X, Y ) ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 1757, [ equalish( multiply( X, inverse( X ) ), identity ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 1762, [ product( X, inverse( X ), identity ) ] )
% 0.73/1.11  .
% 0.73/1.11  clause( 1777, [] )
% 0.73/1.11  .
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  % SZS output end Refutation
% 0.73/1.11  found a proof!
% 0.73/1.11  
% 0.73/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.11  
% 0.73/1.11  initialclauses(
% 0.73/1.11  [ clause( 1779, [ product( identity, X, X ) ] )
% 0.73/1.11  , clause( 1780, [ product( inverse( X ), X, identity ) ] )
% 0.73/1.11  , clause( 1781, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.73/1.11  , clause( 1782, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), 
% 0.73/1.11    equalish( Z, T ) ] )
% 0.73/1.11  , clause( 1783, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( 
% 0.73/1.11    product( Z, T, W ) ), product( X, U, W ) ] )
% 0.73/1.11  , clause( 1784, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( 
% 0.73/1.11    product( X, U, W ) ), product( Z, T, W ) ] )
% 0.73/1.11  , clause( 1785, [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( 
% 0.73/1.11    Z, T, Y ) ] )
% 0.73/1.11  , clause( 1786, [ ~( product( a, inverse( a ), identity ) ) ] )
% 0.73/1.11  ] ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 0, [ product( identity, X, X ) ] )
% 0.73/1.11  , clause( 1779, [ product( identity, X, X ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 1, [ product( inverse( X ), X, identity ) ] )
% 0.73/1.11  , clause( 1780, [ product( inverse( X ), X, identity ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 2, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.73/1.11  , clause( 1781, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.11     )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y, T
% 0.73/1.11     ) ) ] )
% 0.73/1.11  , clause( 1782, [ ~( product( X, Y, Z ) ), ~( product( X, Y, T ) ), 
% 0.73/1.11    equalish( Z, T ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ), 
% 0.73/1.11    permutation( 0, [ ==>( 0, 1 ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 4, [ ~( product( Y, T, U ) ), ~( product( X, Y, Z ) ), product( X, 
% 0.73/1.11    U, W ), ~( product( Z, T, W ) ) ] )
% 0.73/1.11  , clause( 1783, [ ~( product( X, Y, Z ) ), ~( product( Y, T, U ) ), ~( 
% 0.73/1.11    product( Z, T, W ) ), product( X, U, W ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.73/1.11    , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2
% 0.73/1.11    , 3 ), ==>( 3, 2 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T, X
% 0.73/1.11     ) ) ] )
% 0.73/1.11  , clause( 1785, [ ~( equalish( X, Y ) ), ~( product( Z, T, X ) ), product( 
% 0.73/1.11    Z, T, Y ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ), 
% 0.73/1.11    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 7, [ ~( product( a, inverse( a ), identity ) ) ] )
% 0.73/1.11  , clause( 1786, [ ~( product( a, inverse( a ), identity ) ) ] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 1812, [ equalish( X, identity ), ~( product( inverse( Y ), Y, X ) )
% 0.73/1.11     ] )
% 0.73/1.11  , clause( 3, [ equalish( Z, T ), ~( product( X, Y, Z ) ), ~( product( X, Y
% 0.73/1.11    , T ) ) ] )
% 0.73/1.11  , 2, clause( 1, [ product( inverse( X ), X, identity ) ] )
% 0.73/1.11  , 0, substitution( 0, [ :=( X, inverse( Y ) ), :=( Y, Y ), :=( Z, X ), :=( 
% 0.73/1.11    T, identity )] ), substitution( 1, [ :=( X, Y )] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 19, [ equalish( X, identity ), ~( product( inverse( Y ), Y, X ) ) ]
% 0.73/1.11     )
% 0.73/1.11  , clause( 1812, [ equalish( X, identity ), ~( product( inverse( Y ), Y, X )
% 0.73/1.11     ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.11     ), ==>( 1, 1 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 1815, [ ~( product( X, Y, Z ) ), ~( product( T, X, identity ) ), 
% 0.73/1.11    product( T, Z, Y ) ] )
% 0.73/1.11  , clause( 4, [ ~( product( Y, T, U ) ), ~( product( X, Y, Z ) ), product( X
% 0.73/1.11    , U, W ), ~( product( Z, T, W ) ) ] )
% 0.73/1.11  , 3, clause( 0, [ product( identity, X, X ) ] )
% 0.73/1.11  , 0, substitution( 0, [ :=( X, T ), :=( Y, X ), :=( Z, identity ), :=( T, Y
% 0.73/1.11     ), :=( U, Z ), :=( W, Y )] ), substitution( 1, [ :=( X, Y )] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 24, [ ~( product( X, Y, Z ) ), product( T, Z, Y ), ~( product( T, X
% 0.73/1.11    , identity ) ) ] )
% 0.73/1.11  , clause( 1815, [ ~( product( X, Y, Z ) ), ~( product( T, X, identity ) ), 
% 0.73/1.11    product( T, Z, Y ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ), 
% 0.73/1.11    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 1819, [ ~( equalish( multiply( X, Y ), Z ) ), product( X, Y, Z ) ]
% 0.73/1.11     )
% 0.73/1.11  , clause( 6, [ ~( equalish( X, Y ) ), product( Z, T, Y ), ~( product( Z, T
% 0.73/1.11    , X ) ) ] )
% 0.73/1.11  , 2, clause( 2, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.73/1.11  , 0, substitution( 0, [ :=( X, multiply( X, Y ) ), :=( Y, Z ), :=( Z, X ), 
% 0.73/1.11    :=( T, Y )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 42, [ product( X, Y, Z ), ~( equalish( multiply( X, Y ), Z ) ) ] )
% 0.73/1.11  , clause( 1819, [ ~( equalish( multiply( X, Y ), Z ) ), product( X, Y, Z )
% 0.73/1.11     ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.73/1.11    permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 1821, [ ~( product( X, Y, Z ) ), product( inverse( X ), Z, Y ) ] )
% 0.73/1.11  , clause( 24, [ ~( product( X, Y, Z ) ), product( T, Z, Y ), ~( product( T
% 0.73/1.11    , X, identity ) ) ] )
% 0.73/1.11  , 2, clause( 1, [ product( inverse( X ), X, identity ) ] )
% 0.73/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, inverse( 
% 0.73/1.11    X ) )] ), substitution( 1, [ :=( X, X )] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 271, [ product( inverse( X ), Z, Y ), ~( product( X, Y, Z ) ) ] )
% 0.73/1.11  , clause( 1821, [ ~( product( X, Y, Z ) ), product( inverse( X ), Z, Y ) ]
% 0.73/1.11     )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.73/1.11    permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 1822, [ product( inverse( X ), multiply( X, Y ), Y ) ] )
% 0.73/1.11  , clause( 271, [ product( inverse( X ), Z, Y ), ~( product( X, Y, Z ) ) ]
% 0.73/1.11     )
% 0.73/1.11  , 1, clause( 2, [ product( X, Y, multiply( X, Y ) ) ] )
% 0.73/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, multiply( X, Y ) )] )
% 0.73/1.11    , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 437, [ product( inverse( X ), multiply( X, Y ), Y ) ] )
% 0.73/1.11  , clause( 1822, [ product( inverse( X ), multiply( X, Y ), Y ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.11     )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 1823, [ product( inverse( inverse( X ) ), Y, multiply( X, Y ) ) ]
% 0.73/1.11     )
% 0.73/1.11  , clause( 271, [ product( inverse( X ), Z, Y ), ~( product( X, Y, Z ) ) ]
% 0.73/1.11     )
% 0.73/1.11  , 1, clause( 437, [ product( inverse( X ), multiply( X, Y ), Y ) ] )
% 0.73/1.11  , 0, substitution( 0, [ :=( X, inverse( X ) ), :=( Y, multiply( X, Y ) ), 
% 0.73/1.11    :=( Z, Y )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 654, [ product( inverse( inverse( X ) ), Y, multiply( X, Y ) ) ] )
% 0.73/1.11  , clause( 1823, [ product( inverse( inverse( X ) ), Y, multiply( X, Y ) ) ]
% 0.73/1.11     )
% 0.73/1.11  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.11     )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 1824, [ equalish( multiply( X, inverse( X ) ), identity ) ] )
% 0.73/1.11  , clause( 19, [ equalish( X, identity ), ~( product( inverse( Y ), Y, X ) )
% 0.73/1.11     ] )
% 0.73/1.11  , 1, clause( 654, [ product( inverse( inverse( X ) ), Y, multiply( X, Y ) )
% 0.73/1.11     ] )
% 0.73/1.11  , 0, substitution( 0, [ :=( X, multiply( X, inverse( X ) ) ), :=( Y, 
% 0.73/1.11    inverse( X ) )] ), substitution( 1, [ :=( X, X ), :=( Y, inverse( X ) )] )
% 0.73/1.11    ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 1757, [ equalish( multiply( X, inverse( X ) ), identity ) ] )
% 0.73/1.11  , clause( 1824, [ equalish( multiply( X, inverse( X ) ), identity ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 1825, [ product( X, inverse( X ), identity ) ] )
% 0.73/1.11  , clause( 42, [ product( X, Y, Z ), ~( equalish( multiply( X, Y ), Z ) ) ]
% 0.73/1.11     )
% 0.73/1.11  , 1, clause( 1757, [ equalish( multiply( X, inverse( X ) ), identity ) ] )
% 0.73/1.11  , 0, substitution( 0, [ :=( X, X ), :=( Y, inverse( X ) ), :=( Z, identity
% 0.73/1.11     )] ), substitution( 1, [ :=( X, X )] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 1762, [ product( X, inverse( X ), identity ) ] )
% 0.73/1.11  , clause( 1825, [ product( X, inverse( X ), identity ) ] )
% 0.73/1.11  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  resolution(
% 0.73/1.11  clause( 1826, [] )
% 0.73/1.11  , clause( 7, [ ~( product( a, inverse( a ), identity ) ) ] )
% 0.73/1.11  , 0, clause( 1762, [ product( X, inverse( X ), identity ) ] )
% 0.73/1.11  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  subsumption(
% 0.73/1.11  clause( 1777, [] )
% 0.73/1.11  , clause( 1826, [] )
% 0.73/1.11  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  end.
% 0.73/1.11  
% 0.73/1.11  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.11  
% 0.73/1.11  Memory use:
% 0.73/1.11  
% 0.73/1.11  space for terms:        22732
% 0.73/1.11  space for clauses:      97606
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  clauses generated:      2767
% 0.73/1.11  clauses kept:           1778
% 0.73/1.11  clauses selected:       211
% 0.73/1.11  clauses deleted:        28
% 0.73/1.11  clauses inuse deleted:  12
% 0.73/1.11  
% 0.73/1.11  subsentry:          11596
% 0.73/1.11  literals s-matched: 4023
% 0.73/1.11  literals matched:   3320
% 0.73/1.11  full subsumption:   481
% 0.73/1.11  
% 0.73/1.11  checksum:           913651165
% 0.73/1.11  
% 0.73/1.11  
% 0.73/1.11  Bliksem ended
%------------------------------------------------------------------------------