↑ Up

Bliksem---1.12.TMO-Non.f

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SWX225+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n010.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 : Tue May  5 06:56:51 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWX225+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12  % Command  : bliksem %s
% 0.15/0.33  % Computer : n010.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit : 300
% 0.15/0.33  % DateTime : Tue May  5 12:42:21 EDT 2026
% 0.15/0.33  % CPUTime  : 
% 254.25/254.67  *** allocated 10000 integers for termspace/termends
% 254.25/254.67  *** allocated 10000 integers for clauses
% 254.25/254.67  *** allocated 10000 integers for justifications
% 254.25/254.67  Bliksem 1.12
% 254.25/254.67  
% 254.25/254.67  
% 254.25/254.67  Automatic Strategy Selection
% 254.25/254.67  
% 254.25/254.67  
% 254.25/254.67  Clauses:
% 254.25/254.67  
% 254.25/254.67  { proj1( x( X, Y ) ) = X }.
% 254.25/254.67  { proj2( x( X, Y ) ) = Y }.
% 254.25/254.67  { ! x( X, Y ) = theVar }.
% 254.25/254.67  { ! x( X, Y ) = k }.
% 254.25/254.67  { ! x( X, Y ) = i }.
% 254.25/254.67  { ! x( X, Y ) = s }.
% 254.25/254.67  { ! x( X, Y ) = b }.
% 254.25/254.67  { ! x( X, Y ) = c }.
% 254.25/254.67  { ! theVar = k }.
% 254.25/254.67  { ! theVar = i }.
% 254.25/254.67  { ! theVar = s }.
% 254.25/254.67  { ! theVar = b }.
% 254.25/254.67  { ! theVar = c }.
% 254.25/254.67  { ! k = i }.
% 254.25/254.67  { ! k = s }.
% 254.25/254.67  { ! k = b }.
% 254.25/254.67  { ! k = c }.
% 254.25/254.67  { ! i = s }.
% 254.25/254.67  { ! i = b }.
% 254.25/254.67  { ! i = c }.
% 254.25/254.67  { ! s = b }.
% 254.25/254.67  { ! s = c }.
% 254.25/254.67  { ! b = c }.
% 254.25/254.67  { proj1Suc( suc( X ) ) = X }.
% 254.25/254.67  { ! suc( X ) = z }.
% 254.25/254.67  { proj1Just( just( X ) ) = X }.
% 254.25/254.67  { ! nothing = just( X ) }.
% 254.25/254.67  { fail( X, Y ) = par( X, Y, step( X ), step( Y ) ) }.
% 254.25/254.67  { par( X, Y, nothing, nothing ) = nothing }.
% 254.25/254.67  { par( X, Y, nothing, just( Z ) ) = just( x( X, Z ) ) }.
% 254.25/254.67  { par( X, Y, just( Z ), nothing ) = just( x( Z, Y ) ) }.
% 254.25/254.67  { par( X, Y, just( Z ), just( T ) ) = just( x( Z, T ) ) }.
% 254.25/254.67  { X = x( proj1( X ), proj2( X ) ), step( X ) = nothing }.
% 254.25/254.67  { X = x( proj1( X ), proj2( X ) ), X = i, step( x( X, Y ) ) = fail( X, Y )
% 254.25/254.67     }.
% 254.25/254.67  { X = x( proj1( X ), proj2( X ) ), X = k, step( x( x( X, Z ), Y ) ) = fail
% 254.25/254.67    ( x( X, Z ), Y ) }.
% 254.25/254.67  { X = s, X = b, X = c, step( x( x( x( X, T ), Z ), Y ) ) = fail( x( x( X, T
% 254.25/254.67     ), Z ), Y ) }.
% 254.25/254.67  { step( x( x( x( s, Z ), Y ), X ) ) = just( x( x( Z, X ), x( Y, X ) ) ) }.
% 254.25/254.67  { step( x( x( x( b, Z ), Y ), X ) ) = just( x( Z, x( Y, X ) ) ) }.
% 254.25/254.67  { step( x( x( x( c, Z ), Y ), X ) ) = just( x( x( Z, X ), Y ) ) }.
% 254.25/254.67  { step( x( x( k, Y ), X ) ) = just( Y ) }.
% 254.25/254.67  { step( x( i, X ) ) = just( X ) }.
% 254.25/254.67  { ! step( X ) = just( X ) }.
% 254.25/254.67  
% 254.25/254.67  percentage equality = 1.000000, percentage horn = 0.904762
% 254.25/254.67  This is a pure equality problem
% 254.25/254.67  
% 254.25/254.67  
% 254.25/254.67  
% 254.25/254.67  Options Used:
% 254.25/254.67  
% 254.25/254.67  useres =            1
% 254.25/254.67  useparamod =        1
% 254.25/254.67  useeqrefl =         1
% 254.25/254.67  useeqfact =         1
% 254.25/254.67  usefactor =         1
% 254.25/254.67  usesimpsplitting =  0
% 254.25/254.67  usesimpdemod =      5
% 254.25/254.67  usesimpres =        3
% 254.25/254.67  
% 254.25/254.67  resimpinuse      =  1000
% 254.25/254.67  resimpclauses =     20000
% 254.25/254.67  substype =          eqrewr
% 254.25/254.67  backwardsubs =      1
% 254.25/254.67  selectoldest =      5
% 254.25/254.67  
% 254.25/254.67  litorderings [0] =  split
% 254.25/254.67  litorderings [1] =  extend the termordering, first sorting on arguments
% 254.25/254.67  
% 254.25/254.67  termordering =      kbo
% 254.25/254.67  
% 254.25/254.67  litapriori =        0
% 254.25/254.67  termapriori =       1
% 254.25/254.67  litaposteriori =    0
% 254.25/254.67  termaposteriori =   0
% 254.25/254.67  demodaposteriori =  0
% 254.25/254.67  ordereqreflfact =   0
% 254.25/254.67  
% 254.25/254.67  litselect =         negord
% 254.25/254.67  
% 254.25/254.67  maxweight =         15
% 254.25/254.67  maxdepth =          30000
% 254.25/254.67  maxlength =         115
% 254.25/254.67  maxnrvars =         195
% 254.25/254.67  excuselevel =       1
% 254.25/254.67  increasemaxweight = 1
% 254.25/254.67  
% 254.25/254.67  maxselected =       10000000
% 254.25/254.67  maxnrclauses =      10000000
% 254.25/254.67  
% 254.25/254.67  showgenerated =    0
% 254.25/254.67  showkept =         0
% 254.25/254.67  showselected =     0
% 254.25/254.67  showdeleted =      0
% 254.25/254.67  showresimp =       1
% 254.25/254.67  showstatus =       2000
% 254.25/254.67  
% 254.25/254.67  prologoutput =     0
% 254.25/254.67  nrgoals =          5000000
% 254.25/254.67  totalproof =       1
% 254.25/254.67  
% 254.25/254.67  Symbols occurring in the translation:
% 254.25/254.67  
% 254.25/254.67  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 254.25/254.67  .  [1, 2]      (w:1, o:36, a:1, s:1, b:0), 
% 254.25/254.67  !  [4, 1]      (w:0, o:24, a:1, s:1, b:0), 
% 254.25/254.67  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 254.25/254.67  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 254.25/254.67  x  [37, 2]      (w:1, o:60, a:1, s:1, b:0), 
% 254.25/254.67  proj1  [38, 1]      (w:1, o:29, a:1, s:1, b:0), 
% 254.25/254.67  proj2  [39, 1]      (w:1, o:32, a:1, s:1, b:0), 
% 254.25/254.67  theVar  [40, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 254.25/254.67  k  [41, 0]      (w:1, o:10, a:1, s:1, b:0), 
% 254.25/254.67  i  [42, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 254.25/254.67  s  [43, 0]      (w:1, o:8, a:1, s:1, b:0), 
% 254.25/254.67  b  [44, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 254.25/254.67  c  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 254.25/254.67  suc  [46, 1]      (w:1, o:34, a:1, s:1, b:0), 
% 254.25/254.67  proj1Suc  [47, 1]      (w:1, o:30, a:1, s:1, b:0), 
% 254.25/254.67  z  [48, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 254.25/254.67  just  [49, 1]      (w:1, o:35, a:1, s:1, b:0), 
% 254.25/254.67  proj1Just  [50, 1]      (w:1, o:31, a:1, s:1, b:0), 
% 254.25/254.67  nothing  [51, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 254.25/254.67  fail  [54, 2]      (w:1, o:61, a:1, s:1, b:0), 
% 254.25/254.67  step  [55, 1]      (w:1, o:33, a:1, s:1, b:0), 
% 254.25/254.67  par  [56, 4]      (w:1, o:62, a:1, s:1, b:0).
% 254.25/254.67  
% 254.25/254.67  
% 254.25/254.67  Starting Search:
% 254.25/254.67  
% 254.25/254.67  *** allocated 15000 integers for clauses
% 254.25/254.67  *** allocated 22500 integers for clauses
% 254.25/254.67  *** allocated 33750 integers for clauses
% 254.25/254.67  *** allocated 15000 integers for termspace/termends
% 254.25/254.67  *** allocated 50625 integers for clauses
% 254.25/254.67  *** allocated 7593Terminated 
% 299.70/300.05  Bliksem ended
%------------------------------------------------------------------------------