TSTP Solution File: GRP816+1 by Bliksem---1.12

View Problem - Process Solution

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

% Computer : n017.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:39:42 EDT 2022

% Result   : Timeout 300.05s 300.42s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP816+1 : TPTP v8.1.0. Released v7.5.0.
% 0.12/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n017.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 : Tue Jun 14 06:03:38 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 58.47/58.89  *** allocated 10000 integers for termspace/termends
% 58.47/58.89  *** allocated 10000 integers for clauses
% 58.47/58.89  *** allocated 10000 integers for justifications
% 58.47/58.89  Bliksem 1.12
% 58.47/58.89  
% 58.47/58.89  
% 58.47/58.89  Automatic Strategy Selection
% 58.47/58.89  
% 58.47/58.89  
% 58.47/58.89  Clauses:
% 58.47/58.89  
% 58.47/58.89  { m( X, e ) = X }.
% 58.47/58.89  { m( e, X ) = X }.
% 58.47/58.89  { m( X, b( X, Y ) ) = Y }.
% 58.47/58.89  { b( X, m( X, Y ) ) = Y }.
% 58.47/58.89  { m( s( X, Y ), Y ) = X }.
% 58.47/58.89  { s( m( X, Y ), Y ) = X }.
% 58.47/58.89  { t( X, Y ) = b( X, m( Y, X ) ) }.
% 58.47/58.89  { i1( X, Y ) = m( X, m( Y, b( X, e ) ) ) }.
% 58.47/58.89  { j1( X, Y ) = m( m( s( e, X ), Y ), X ) }.
% 58.47/58.89  { i2( X, Y ) = m( b( X, Y ), b( b( X, e ), e ) ) }.
% 58.47/58.89  { j2( X, Y ) = m( s( e, s( e, X ) ), s( Y, X ) ) }.
% 58.47/58.89  { l( X, Y, Z ) = b( m( Y, X ), m( Y, m( X, Z ) ) ) }.
% 58.47/58.89  { r( X, Y, Z ) = s( m( m( Z, X ), Y ), m( X, Y ) ) }.
% 58.47/58.89  { l( X, Y, i1( Z, i1( X, r( Y, Z, l( X, Y, i1( Z, i1( X, r( Y, Z, l( X, Y, 
% 58.47/58.89    i1( Z, i1( X, r( Y, Z, l( X, Y, i1( Z, i1( X, r( Y, Z, T ) ) ) ) ) ) ) )
% 58.47/58.89     ) ) ) ) ) ) ) ) = T }.
% 58.47/58.89  { l( X, Y, i1( Z, l( X, Y, t( Z, l( X, Y, i1( Z, l( X, Y, t( Z, l( X, Y, i1
% 58.47/58.89    ( Z, l( X, Y, t( Z, l( X, Y, i1( Z, l( X, Y, t( Z, l( X, Y, i1( Z, l( X, 
% 58.47/58.89    Y, t( Z, T ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) = T }.
% 58.47/58.89  { t( X, j2( Y, i2( Z, T ) ) ) = j2( Y, i2( Z, t( X, T ) ) ) }.
% 58.47/58.89  { l( X, Y, t( Z, i1( T, U ) ) ) = t( Z, i1( T, l( X, Y, U ) ) ) }.
% 58.47/58.89  { i2( X, t( Y, i2( Z, i1( T, U ) ) ) ) = i2( Z, i1( T, i2( X, t( Y, U ) ) )
% 58.47/58.89     ) }.
% 58.47/58.89  { t( X, j2( Y, i1( Z, i1( T, U ) ) ) ) = i1( Z, i1( T, t( X, j2( Y, U ) ) )
% 58.47/58.89     ) }.
% 58.47/58.89  { i2( X, i2( Y, i1( Z, i1( T, U ) ) ) ) = i1( Z, i1( T, i2( X, i2( Y, U ) )
% 58.47/58.89     ) ) }.
% 58.47/58.89  { j2( X, i1( Y, t( Z, i2( T, U ) ) ) ) = t( Z, i2( T, j2( X, i1( Y, U ) ) )
% 58.47/58.89     ) }.
% 58.47/58.89  { i1( X, i1( Y, t( Z, i1( T, U ) ) ) ) = t( Z, i1( T, i1( X, i1( Y, U ) ) )
% 58.47/58.89     ) }.
% 58.47/58.89  { r( X, Y, i1( Z, i2( T, i2( U, W ) ) ) ) = i2( T, i2( U, r( X, Y, i1( Z, W
% 58.47/58.89     ) ) ) ) }.
% 58.47/58.89  { r( X, Y, i2( Z, t( T, i2( U, W ) ) ) ) = t( T, i2( U, r( X, Y, i2( Z, W )
% 58.47/58.89     ) ) ) }.
% 58.47/58.89  { l( X, Y, i2( Z, l( T, U, t( W, V0 ) ) ) ) = l( T, U, t( W, l( X, Y, i2( Z
% 58.47/58.89    , V0 ) ) ) ) }.
% 58.47/58.89  { r( X, Y, i2( Z, r( T, U, i2( W, V0 ) ) ) ) = r( T, U, i2( W, r( X, Y, i2
% 58.47/58.89    ( Z, V0 ) ) ) ) }.
% 58.47/58.89  { r( X, Y, t( Z, i2( T, r( U, W, i2( V0, V1 ) ) ) ) ) = r( U, W, i2( V0, r
% 58.47/58.89    ( X, Y, t( Z, i2( T, V1 ) ) ) ) ) }.
% 58.47/58.89  { l( X, Y, j2( Z, j2( T, l( U, W, i1( V0, V1 ) ) ) ) ) = l( U, W, i1( V0, l
% 58.47/58.89    ( X, Y, j2( Z, j2( T, V1 ) ) ) ) ) }.
% 58.47/58.89  { l( X, Y, t( Z, i2( T, r( U, W, j2( V0, V1 ) ) ) ) ) = r( U, W, j2( V0, l
% 58.47/58.89    ( X, Y, t( Z, i2( T, V1 ) ) ) ) ) }.
% 58.47/58.89  { r( X, Y, i2( Z, j2( T, l( U, W, t( V0, V1 ) ) ) ) ) = l( U, W, t( V0, r( 
% 58.47/58.89    X, Y, i2( Z, j2( T, V1 ) ) ) ) ) }.
% 58.47/58.89  { l( X, Y, i2( Z, i2( T, l( U, W, j2( V0, V1 ) ) ) ) ) = l( U, W, j2( V0, l
% 58.47/58.89    ( X, Y, i2( Z, i2( T, V1 ) ) ) ) ) }.
% 58.47/58.89  { l( X, Y, i2( Z, t( T, l( U, W, i2( V0, V1 ) ) ) ) ) = l( U, W, i2( V0, l
% 58.47/58.89    ( X, Y, i2( Z, t( T, V1 ) ) ) ) ) }.
% 58.47/58.89  { r( X, Y, t( Z, i1( T, r( U, W, t( V0, V1 ) ) ) ) ) = r( U, W, t( V0, r( X
% 58.47/58.89    , Y, t( Z, i1( T, V1 ) ) ) ) ) }.
% 58.47/58.89  { r( X, Y, i1( Z, i2( T, r( U, W, t( V0, V1 ) ) ) ) ) = r( U, W, t( V0, r( 
% 58.47/58.89    X, Y, i1( Z, i2( T, V1 ) ) ) ) ) }.
% 58.47/58.89  { r( X, Y, i2( Z, t( T, l( U, W, t( V0, V1 ) ) ) ) ) = l( U, W, t( V0, r( X
% 58.47/58.89    , Y, i2( Z, t( T, V1 ) ) ) ) ) }.
% 58.47/58.89  { ! a( skol5, m( s( e, skol1 ), r( skol2, skol3, skol1 ) ), skol4 ) = e }.
% 58.47/58.89  
% 58.47/58.89  percentage equality = 1.000000, percentage horn = 1.000000
% 58.47/58.89  This is a pure equality problem
% 58.47/58.89  
% 58.47/58.89  
% 58.47/58.89  
% 58.47/58.89  Options Used:
% 58.47/58.89  
% 58.47/58.89  useres =            1
% 58.47/58.89  useparamod =        1
% 58.47/58.89  useeqrefl =         1
% 58.47/58.89  useeqfact =         1
% 58.47/58.89  usefactor =         1
% 58.47/58.89  usesimpsplitting =  0
% 58.47/58.89  usesimpdemod =      5
% 58.47/58.89  usesimpres =        3
% 58.47/58.89  
% 58.47/58.89  resimpinuse      =  1000
% 58.47/58.89  resimpclauses =     20000
% 58.47/58.89  substype =          eqrewr
% 58.47/58.89  backwardsubs =      1
% 58.47/58.89  selectoldest =      5
% 58.47/58.89  
% 58.47/58.89  litorderings [0] =  split
% 58.47/58.89  litorderings [1] =  extend the termordering, first sorting on arguments
% 58.47/58.89  
% 58.47/58.89  termordering =      kbo
% 58.47/58.89  
% 58.47/58.89  litapriori =        0
% 58.47/58.89  termapriori =       1
% 58.47/58.89  litaposteriori =    0
% 58.47/58.89  termaposteriori =   0
% 58.47/58.89  demodaposteriori =  0
% 58.47/58.89  ordereqreflfact =   0
% 58.47/58.89  
% 58.47/58.89  litselect =         negord
% 58.47/58.89  
% 58.47/58.89  maxweight =         15
% 58.47/58.89  maxdepth =          30000
% 58.47/58.89  maxlength =         115
% 58.47/58.89  maxnrvars =         195
% 58.47/58.89  excuselevel =       1
% 58.47/58.89  increasemaxweight = 1
% 58.47/58.89  
% 58.47/58.89  maxselected =       10000000
% 58.47/58.89  maxnrclauses =      10000000
% 58.47/58.89  
% 58.47/58.89  showgenerated =    0
% 58.47/58.89  showkept =         0
% 58.47/58.89  showselected =     0
% 58.47/58.89  showdeleted =      0
% 58.47/58.89  showresimp =       1
% 58.47/58.89  showstaCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------