↑ Up

Bliksem---1.12.TMO-Non.f

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

% Computer : n014.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:47 PM UTC 2026

% Result   : Timeout 299.68s 300.03s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX203+1 : TPTP v9.3.0. Released v9.3.0.
% 0.13/0.13  % Command  : bliksem %s
% 0.17/0.35  % Computer : n014.cluster.edu
% 0.17/0.35  % Model    : x86_64 x86_64
% 0.17/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35  % Memory   : 8042.1875MB
% 0.17/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % DateTime : Tue May  5 11:24:06 EDT 2026
% 0.17/0.35  % CPUTime  : 
% 24.84/25.20  *** allocated 10000 integers for termspace/termends
% 24.84/25.20  *** allocated 10000 integers for clauses
% 24.84/25.20  *** allocated 10000 integers for justifications
% 24.84/25.20  Bliksem 1.12
% 24.84/25.20  
% 24.84/25.20  
% 24.84/25.20  Automatic Strategy Selection
% 24.84/25.20  
% 24.84/25.20  
% 24.84/25.20  Clauses:
% 24.84/25.20  
% 24.84/25.20  { head( cons( X, Y ) ) = X }.
% 24.84/25.20  { tail( cons( X, Y ) ) = Y }.
% 24.84/25.20  { ! nil = cons( X, Y ) }.
% 24.84/25.20  { proj1S( s( X ) ) = X }.
% 24.84/25.20  { ! z = s( X ) }.
% 24.84/25.20  { leqNat( z, X ) }.
% 24.84/25.20  { ! leqNat( s( X ), z ) }.
% 24.84/25.20  { ! leqNat( s( X ), s( Y ) ), leqNat( X, Y ) }.
% 24.84/25.20  { ! leqNat( X, Y ), leqNat( s( X ), s( Y ) ) }.
% 24.84/25.20  { sorted( nil ) }.
% 24.84/25.20  { sorted( cons( X, nil ) ) }.
% 24.84/25.20  { ! sorted( cons( X, cons( Y, Z ) ) ), leqNat( X, Y ) }.
% 24.84/25.20  { ! sorted( cons( X, cons( Y, Z ) ) ), sorted( cons( Y, Z ) ) }.
% 24.84/25.20  { ! leqNat( X, Y ), ! sorted( cons( Y, Z ) ), sorted( cons( X, cons( Y, Z )
% 24.84/25.20     ) ) }.
% 24.84/25.20  { lengthNat( nil ) = z }.
% 24.84/25.20  { lengthNat( cons( X, Y ) ) = s( lengthNat( Y ) ) }.
% 24.84/25.20  { ! elemNat( X, nil ) }.
% 24.84/25.20  { ! elemNat( X, cons( Y, Z ) ), X = Y, elemNat( X, Z ) }.
% 24.84/25.20  { ! X = Y, elemNat( X, cons( Y, Z ) ) }.
% 24.84/25.20  { ! elemNat( X, Z ), elemNat( X, cons( Y, Z ) ) }.
% 24.84/25.20  { unique( nil ) }.
% 24.84/25.20  { ! unique( cons( X, Y ) ), ! elemNat( X, Y ) }.
% 24.84/25.20  { ! unique( cons( X, Y ) ), unique( Y ) }.
% 24.84/25.20  { elemNat( X, Y ), ! unique( Y ), unique( cons( X, Y ) ) }.
% 24.84/25.20  { append( nil, X ) = X }.
% 24.84/25.20  { append( cons( Y, Z ), X ) = cons( Y, append( Z, X ) ) }.
% 24.84/25.20  { rev( nil ) = nil }.
% 24.84/25.20  { rev( cons( X, Y ) ) = append( rev( Y ), cons( X, nil ) ) }.
% 24.84/25.20  { ! sorted( rev( X ) ), ! unique( X ), leqNat( lengthNat( X ), s( s( s( z )
% 24.84/25.20     ) ) ) }.
% 24.84/25.20  
% 24.84/25.20  percentage equality = 0.288889, percentage horn = 0.931034
% 24.84/25.20  This is a problem with some equality
% 24.84/25.20  
% 24.84/25.20  
% 24.84/25.20  
% 24.84/25.20  Options Used:
% 24.84/25.20  
% 24.84/25.20  useres =            1
% 24.84/25.20  useparamod =        1
% 24.84/25.20  useeqrefl =         1
% 24.84/25.20  useeqfact =         1
% 24.84/25.20  usefactor =         1
% 24.84/25.20  usesimpsplitting =  0
% 24.84/25.20  usesimpdemod =      5
% 24.84/25.20  usesimpres =        3
% 24.84/25.20  
% 24.84/25.20  resimpinuse      =  1000
% 24.84/25.20  resimpclauses =     20000
% 24.84/25.20  substype =          eqrewr
% 24.84/25.20  backwardsubs =      1
% 24.84/25.20  selectoldest =      5
% 24.84/25.20  
% 24.84/25.20  litorderings [0] =  split
% 24.84/25.20  litorderings [1] =  extend the termordering, first sorting on arguments
% 24.84/25.20  
% 24.84/25.20  termordering =      kbo
% 24.84/25.20  
% 24.84/25.20  litapriori =        0
% 24.84/25.20  termapriori =       1
% 24.84/25.20  litaposteriori =    0
% 24.84/25.20  termaposteriori =   0
% 24.84/25.20  demodaposteriori =  0
% 24.84/25.20  ordereqreflfact =   0
% 24.84/25.20  
% 24.84/25.20  litselect =         negord
% 24.84/25.20  
% 24.84/25.20  maxweight =         15
% 24.84/25.20  maxdepth =          30000
% 24.84/25.20  maxlength =         115
% 24.84/25.20  maxnrvars =         195
% 24.84/25.20  excuselevel =       1
% 24.84/25.20  increasemaxweight = 1
% 24.84/25.20  
% 24.84/25.20  maxselected =       10000000
% 24.84/25.20  maxnrclauses =      10000000
% 24.84/25.20  
% 24.84/25.20  showgenerated =    0
% 24.84/25.20  showkept =         0
% 24.84/25.20  showselected =     0
% 24.84/25.20  showdeleted =      0
% 24.84/25.20  showresimp =       1
% 24.84/25.20  showstatus =       2000
% 24.84/25.20  
% 24.84/25.20  prologoutput =     0
% 24.84/25.20  nrgoals =          5000000
% 24.84/25.20  totalproof =       1
% 24.84/25.20  
% 24.84/25.20  Symbols occurring in the translation:
% 24.84/25.20  
% 24.84/25.20  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 24.84/25.20  .  [1, 2]      (w:1, o:28, a:1, s:1, b:0), 
% 24.84/25.20  !  [4, 1]      (w:0, o:15, a:1, s:1, b:0), 
% 24.84/25.20  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 24.84/25.20  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 24.84/25.20  cons  [37, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 24.84/25.20  head  [38, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 24.84/25.20  tail  [39, 1]      (w:1, o:24, a:1, s:1, b:0), 
% 24.84/25.20  nil  [40, 0]      (w:1, o:8, a:1, s:1, b:0), 
% 24.84/25.20  s  [41, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 24.84/25.20  proj1S  [42, 1]      (w:1, o:25, a:1, s:1, b:0), 
% 24.84/25.20  z  [43, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 24.84/25.20  leqNat  [45, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 24.84/25.20  sorted  [48, 1]      (w:1, o:23, a:1, s:1, b:0), 
% 24.84/25.20  lengthNat  [51, 1]      (w:1, o:26, a:1, s:1, b:0), 
% 24.84/25.20  elemNat  [52, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 24.84/25.20  unique  [53, 1]      (w:1, o:27, a:1, s:1, b:0), 
% 24.84/25.20  append  [54, 2]      (w:1, o:55, a:1, s:1, b:0), 
% 24.84/25.20  rev  [55, 1]      (w:1, o:21, a:1, s:1, b:0).
% 24.84/25.20  
% 24.84/25.20  
% 24.84/25.20  Starting Search:
% 24.84/25.20  
% 24.84/25.20  *** allocated 15000 integers for clauses
% 24.84/25.20  *** allocated 22500 integers for clauses
% 24.84/25.20  *** allocated 33750 integers for clauses
% 24.84/25.20  *** allocated 15000 integers for termspace/termends
% 24.84/25.20  *** allocated 50625 integers for clauses
% 24.84/25.20  Resimplifying inuse:
% 24.84/25.20  Done
% 24.84/25.20  
% 24.84/25.20  *** allocated 22500 integers for termspace/termends
% 24.84/25.20  *** allocated 75937 integers for clauses
% 24.84/25.20  *** allocated 33750 integers for termspace/termends
% 24.84/25.20  *** allocated 113905 integers for clauses
% 24.84/25.20  
% 24.84/25.20  Intermediate Status:
% 24.84/25.20  Generated:    6398
% 24.84/25.20  Kept:         2009
% 24.84/25.20  Inuse:        147
% 24.84/25.20  Deleted:      1
% 24.84/25.20  Deletedinuse: 0
% 24.84/25.20  
% 24.84/25.20  Resimplifying inuse:
% 24.84/25.20  Done
% 24.84/25.20  
% 24.84/25.20  *** allocated 50625 integers for termspace/termends
% 24.84/25.20  *** alTerminated 
% 299.68/300.03  Bliksem ended
%------------------------------------------------------------------------------