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

View Problem - Process Solution

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

% Computer : n006.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:33 EDT 2022

% Result   : Timeout 300.06s 300.41s
% Output   : None 
% Verified : 
% SZS Type : -

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