TSTP Solution File: ANA002-2 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : ANA002-2 : TPTP v8.1.0. Bugfixed v1.0.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n019.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 : Thu Jul 14 18:37:57 EDT 2022

% Result   : Timeout 300.08s 300.52s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : ANA002-2 : TPTP v8.1.0. Bugfixed v1.0.1.
% 0.11/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n019.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 : Fri Jul  8 04:14:38 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 265.88/266.33  *** allocated 10000 integers for termspace/termends
% 265.88/266.33  *** allocated 10000 integers for clauses
% 265.88/266.33  *** allocated 10000 integers for justifications
% 265.88/266.33  Bliksem 1.12
% 265.88/266.33  
% 265.88/266.33  
% 265.88/266.33  Automatic Strategy Selection
% 265.88/266.33  
% 265.88/266.33  Clauses:
% 265.88/266.33  [
% 265.88/266.33     [ 'in_interval'( X, Y, Z ), ~( 'less_than_or_equal'( X, Y ) ), ~( 
% 265.88/266.33    'less_than_or_equal'( Y, Z ) ) ],
% 265.88/266.33     [ 'less_than_or_equal'( X, X ) ],
% 265.88/266.33     [ 'less_than_or_equal'( X, Y ), 'less_than_or_equal'( Y, X ) ],
% 265.88/266.33     [ 'less_than_or_equal'( X, Y ), ~( 'less_than_or_equal'( X, Z ) ), ~( 
% 265.88/266.33    'less_than_or_equal'( Z, Y ) ) ],
% 265.88/266.33     [ ~( 'less_than_or_equal'( X, q( Y, X ) ) ), 'less_than_or_equal'( X, Y
% 265.88/266.33     ) ],
% 265.88/266.33     [ ~( 'less_than_or_equal'( q( X, Y ), X ) ), 'less_than_or_equal'( Y, X
% 265.88/266.33     ) ],
% 265.88/266.33     [ 'less_than_or_equal'( f( X ), n0 ), ~( 'less_than_or_equal'( X, h( X )
% 265.88/266.33     ) ), ~( 'in_interval'( 'lower_bound', X, 'upper_bound' ) ) ],
% 265.88/266.33     [ 'less_than_or_equal'( f( X ), n0 ), ~( 'less_than_or_equal'( Y, X ) )
% 265.88/266.33    , ~( 'less_than_or_equal'( f( Y ), n0 ) ), 'less_than_or_equal'( Y, h( X
% 265.88/266.33     ) ), ~( 'in_interval'( 'lower_bound', X, 'upper_bound' ) ) ],
% 265.88/266.33     [ 'less_than_or_equal'( n0, f( X ) ), ~( 'less_than_or_equal'( k( X ), X
% 265.88/266.33     ) ), ~( 'in_interval'( 'lower_bound', X, 'upper_bound' ) ) ],
% 265.88/266.33     [ 'less_than_or_equal'( n0, f( X ) ), ~( 'less_than_or_equal'( X, Y ) )
% 265.88/266.33    , ~( 'less_than_or_equal'( n0, f( Y ) ) ), 'less_than_or_equal'( k( X ), 
% 265.88/266.33    Y ), ~( 'in_interval'( 'lower_bound', X, 'upper_bound' ) ) ],
% 265.88/266.33     [ 'less_than_or_equal'( X, l ), ~( 'less_than_or_equal'( X, 
% 265.88/266.33    'upper_bound' ) ), ~( 'less_than_or_equal'( f( X ), n0 ) ) ],
% 265.88/266.33     [ 'less_than_or_equal'( g( X ), 'upper_bound' ), 'less_than_or_equal'( l
% 265.88/266.33    , X ) ],
% 265.88/266.33     [ 'less_than_or_equal'( f( g( X ) ), n0 ), 'less_than_or_equal'( l, X )
% 265.88/266.33     ],
% 265.88/266.33     [ ~( 'less_than_or_equal'( g( X ), X ) ), 'less_than_or_equal'( l, X ) ]
% 265.88/266.33    ,
% 265.88/266.33     [ 'less_than_or_equal'( 'lower_bound', 'upper_bound' ) ],
% 265.88/266.33     [ 'less_than_or_equal'( f( 'lower_bound' ), n0 ) ],
% 265.88/266.33     [ 'less_than_or_equal'( n0, f( 'upper_bound' ) ) ],
% 265.88/266.33     [ ~( 'in_interval'( f( l ), n0, f( l ) ) ) ]
% 265.88/266.33  ] .
% 265.88/266.33  
% 265.88/266.33  
% 265.88/266.33  percentage equality = 0.000000, percentage horn = 0.722222
% 265.88/266.33  This a non-horn, non-equality problem
% 265.88/266.33  
% 265.88/266.33  
% 265.88/266.33  Options Used:
% 265.88/266.33  
% 265.88/266.33  useres =            1
% 265.88/266.33  useparamod =        0
% 265.88/266.33  useeqrefl =         0
% 265.88/266.33  useeqfact =         0
% 265.88/266.33  usefactor =         1
% 265.88/266.33  usesimpsplitting =  0
% 265.88/266.33  usesimpdemod =      0
% 265.88/266.33  usesimpres =        3
% 265.88/266.33  
% 265.88/266.33  resimpinuse      =  1000
% 265.88/266.33  resimpclauses =     20000
% 265.88/266.33  substype =          standard
% 265.88/266.33  backwardsubs =      1
% 265.88/266.33  selectoldest =      5
% 265.88/266.33  
% 265.88/266.33  litorderings [0] =  split
% 265.88/266.33  litorderings [1] =  liftord
% 265.88/266.33  
% 265.88/266.33  termordering =      none
% 265.88/266.33  
% 265.88/266.33  litapriori =        1
% 265.88/266.33  termapriori =       0
% 265.88/266.33  litaposteriori =    0
% 265.88/266.33  termaposteriori =   0
% 265.88/266.33  demodaposteriori =  0
% 265.88/266.33  ordereqreflfact =   0
% 265.88/266.33  
% 265.88/266.33  litselect =         none
% 265.88/266.33  
% 265.88/266.33  maxweight =         15
% 265.88/266.33  maxdepth =          30000
% 265.88/266.33  maxlength =         115
% 265.88/266.33  maxnrvars =         195
% 265.88/266.33  excuselevel =       1
% 265.88/266.33  increasemaxweight = 1
% 265.88/266.33  
% 265.88/266.33  maxselected =       10000000
% 265.88/266.33  maxnrclauses =      10000000
% 265.88/266.33  
% 265.88/266.33  showgenerated =    0
% 265.88/266.33  showkept =         0
% 265.88/266.33  showselected =     0
% 265.88/266.33  showdeleted =      0
% 265.88/266.33  showresimp =       1
% 265.88/266.33  showstatus =       2000
% 265.88/266.33  
% 265.88/266.33  prologoutput =     1
% 265.88/266.33  nrgoals =          5000000
% 265.88/266.33  totalproof =       1
% 265.88/266.33  
% 265.88/266.33  Symbols occurring in the translation:
% 265.88/266.33  
% 265.88/266.33  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 265.88/266.33  .  [1, 2]      (w:1, o:27, a:1, s:1, b:0), 
% 265.88/266.33  !  [4, 1]      (w:0, o:18, a:1, s:1, b:0), 
% 265.88/266.33  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 265.88/266.33  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 265.88/266.33  'in_interval'  [42, 3]      (w:1, o:54, a:1, s:1, b:0), 
% 265.88/266.33  'less_than_or_equal'  [43, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 265.88/266.33  q  [46, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 265.88/266.33  f  [47, 1]      (w:1, o:23, a:1, s:1, b:0), 
% 265.88/266.33  n0  [48, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 265.88/266.33  h  [49, 1]      (w:1, o:25, a:1, s:1, b:0), 
% 265.88/266.33  'lower_bound'  [50, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 265.88/266.33  'upper_bound'  [51, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 265.88/266.33  k  [52, 1]      (w:1, o:26, a:1, s:1, b:0), 
% 265.88/266.33  l  [53, 0]      (w:1, o:17, a:1, s:1, b:0), 
% 265.88/266.33  g  [54, 1]      (w:1, o:24, a:1, s:1, b:0).
% 265.88/266.33  
% 265.88/266.33  
% 265.88/266.33  Starting Search:
% 265.88/266.33  
% 265.88/266.33  Resimplifying inuse:
% 265.88/266.33  Done
% 265.88/266.33  
% 265.88/266.33  
% 265.88/266.33  Intermediate Status:
% 265.88/266.33  Generated:    6617
% 265.88/266.33  Kept:         2099
% 265.88/266.33  Inuse:        128
% 265.88/266.33  Deleted:      3
% 265.88/266.33  Deletedinuse: 0
% 265.88/266.33  
% 265.88/266.33  Resimplifying inuse:
% 265.88/266.33  Done
% 265.88/266.33  
% 265.88/266.33  Resimplifying inuse:
% 265.88/266.33  Done
% 265.88/266.33  
% 265.88/266.33  
% 265.88/266.33  Intermediate StatusCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------