TSTP Solution File: SYO620-1 by Bliksem---1.12

View Problem - Process Solution

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

% Computer : n007.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 21 14:28:55 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYO620-1 : TPTP v8.1.0. Released v7.1.0.
% 0.12/0.13  % Command  : bliksem %s
% 0.12/0.34  % Computer : n007.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % DateTime : Sat Jul  9 05:31:16 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 104.13/104.50  *** allocated 10000 integers for termspace/termends
% 104.13/104.50  *** allocated 10000 integers for clauses
% 104.13/104.50  *** allocated 10000 integers for justifications
% 104.13/104.50  Bliksem 1.12
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  Automatic Strategy Selection
% 104.13/104.50  
% 104.13/104.50  Clauses:
% 104.13/104.50  [
% 104.13/104.50     [ le( X, X ) ],
% 104.13/104.50     [ ~( le( max( X, Y ), Z ) ), le( X, Z ) ],
% 104.13/104.50     [ ~( le( max( X, Y ), Z ) ), le( Y, Z ) ],
% 104.13/104.50     [ eq( f( X ), a0 ), eq( f( X ), a1 ), eq( f( X ), a2 ), eq( f( X ), a3 )
% 104.13/104.50     ],
% 104.13/104.50     [ ~( eq( f( X ), a0 ) ), ~( eq( f( Y ), a0 ) ), ~( le( s( X ), Y ) ) ]
% 104.13/104.50    ,
% 104.13/104.50     [ ~( eq( f( X ), a1 ) ), ~( eq( f( Y ), a1 ) ), ~( le( s( X ), Y ) ) ]
% 104.13/104.50    ,
% 104.13/104.50     [ ~( eq( f( X ), a2 ) ), ~( eq( f( Y ), a2 ) ), ~( le( s( X ), Y ) ) ]
% 104.13/104.50    ,
% 104.13/104.50     [ ~( eq( f( X ), a3 ) ), ~( eq( f( Y ), a3 ) ), ~( le( s( X ), Y ) ) ]
% 104.13/104.50  ] .
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  percentage equality = 0.000000, percentage horn = 0.875000
% 104.13/104.50  This a non-horn, non-equality problem
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  Options Used:
% 104.13/104.50  
% 104.13/104.50  useres =            1
% 104.13/104.50  useparamod =        0
% 104.13/104.50  useeqrefl =         0
% 104.13/104.50  useeqfact =         0
% 104.13/104.50  usefactor =         1
% 104.13/104.50  usesimpsplitting =  0
% 104.13/104.50  usesimpdemod =      0
% 104.13/104.50  usesimpres =        3
% 104.13/104.50  
% 104.13/104.50  resimpinuse      =  1000
% 104.13/104.50  resimpclauses =     20000
% 104.13/104.50  substype =          standard
% 104.13/104.50  backwardsubs =      1
% 104.13/104.50  selectoldest =      5
% 104.13/104.50  
% 104.13/104.50  litorderings [0] =  split
% 104.13/104.50  litorderings [1] =  liftord
% 104.13/104.50  
% 104.13/104.50  termordering =      none
% 104.13/104.50  
% 104.13/104.50  litapriori =        1
% 104.13/104.50  termapriori =       0
% 104.13/104.50  litaposteriori =    0
% 104.13/104.50  termaposteriori =   0
% 104.13/104.50  demodaposteriori =  0
% 104.13/104.50  ordereqreflfact =   0
% 104.13/104.50  
% 104.13/104.50  litselect =         none
% 104.13/104.50  
% 104.13/104.50  maxweight =         15
% 104.13/104.50  maxdepth =          30000
% 104.13/104.50  maxlength =         115
% 104.13/104.50  maxnrvars =         195
% 104.13/104.50  excuselevel =       1
% 104.13/104.50  increasemaxweight = 1
% 104.13/104.50  
% 104.13/104.50  maxselected =       10000000
% 104.13/104.50  maxnrclauses =      10000000
% 104.13/104.50  
% 104.13/104.50  showgenerated =    0
% 104.13/104.50  showkept =         0
% 104.13/104.50  showselected =     0
% 104.13/104.50  showdeleted =      0
% 104.13/104.50  showresimp =       1
% 104.13/104.50  showstatus =       2000
% 104.13/104.50  
% 104.13/104.50  prologoutput =     1
% 104.13/104.50  nrgoals =          5000000
% 104.13/104.50  totalproof =       1
% 104.13/104.50  
% 104.13/104.50  Symbols occurring in the translation:
% 104.13/104.50  
% 104.13/104.50  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 104.13/104.50  .  [1, 2]      (w:1, o:25, a:1, s:1, b:0), 
% 104.13/104.50  !  [4, 1]      (w:0, o:18, a:1, s:1, b:0), 
% 104.13/104.50  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 104.13/104.50  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 104.13/104.50  le  [40, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 104.13/104.50  max  [42, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 104.13/104.50  f  [44, 1]      (w:1, o:23, a:1, s:1, b:0), 
% 104.13/104.50  a0  [45, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 104.13/104.50  eq  [46, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 104.13/104.50  a1  [47, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 104.13/104.50  a2  [48, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 104.13/104.50  a3  [49, 0]      (w:1, o:17, a:1, s:1, b:0), 
% 104.13/104.50  s  [52, 1]      (w:1, o:24, a:1, s:1, b:0).
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  Starting Search:
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  Failed to find proof!
% 104.13/104.50  maxweight =   15
% 104.13/104.50  maxnrclauses = 10000000
% 104.13/104.50  Generated: 6648
% 104.13/104.50  Kept: 232
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  The strategy used was not complete!
% 104.13/104.50  
% 104.13/104.50  Increased maxweight to 16
% 104.13/104.50  
% 104.13/104.50  Starting Search:
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  Failed to find proof!
% 104.13/104.50  maxweight =   16
% 104.13/104.50  maxnrclauses = 10000000
% 104.13/104.50  Generated: 19672
% 104.13/104.50  Kept: 328
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  The strategy used was not complete!
% 104.13/104.50  
% 104.13/104.50  Increased maxweight to 17
% 104.13/104.50  
% 104.13/104.50  Starting Search:
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  Failed to find proof!
% 104.13/104.50  maxweight =   17
% 104.13/104.50  maxnrclauses = 10000000
% 104.13/104.50  Generated: 27608
% 104.13/104.50  Kept: 456
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  The strategy used was not complete!
% 104.13/104.50  
% 104.13/104.50  Increased maxweight to 18
% 104.13/104.50  
% 104.13/104.50  Starting Search:
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  Failed to find proof!
% 104.13/104.50  maxweight =   18
% 104.13/104.50  maxnrclauses = 10000000
% 104.13/104.50  Generated: 80280
% 104.13/104.50  Kept: 648
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  The strategy used was not complete!
% 104.13/104.50  
% 104.13/104.50  Increased maxweight to 19
% 104.13/104.50  
% 104.13/104.50  Starting Search:
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  Failed to find proof!
% 104.13/104.50  maxweight =   19
% 104.13/104.50  maxnrclauses = 10000000
% 104.13/104.50  Generated: 112536
% 104.13/104.50  Kept: 904
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  The strategy used was not complete!
% 104.13/104.50  
% 104.13/104.50  Increased maxweight to 20
% 104.13/104.50  
% 104.13/104.50  Starting Search:
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  Failed to find proof!
% 104.13/104.50  maxweight =   20
% 104.13/104.50  maxnrclauses = 10000000
% 104.13/104.50  Generated: 324376
% 104.13/104.50  Kept: 1288
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  The strategy used was not complete!
% 104.13/104.50  
% 104.13/104.50  Increased maxweight to 21
% 104.13/104.50  
% 104.13/104.50  Starting Search:
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  Failed to find proof!
% 104.13/104.50  maxweight =   21
% 104.13/104.50  maxnrclauses = 10000000
% 104.13/104.50  Generated: 454424
% 104.13/104.50  Kept: 1800
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  The strategy used was not complete!
% 104.13/104.50  
% 104.13/104.50  Increased maxweight to 22
% 104.13/104.50  
% 104.13/104.50  Starting Search:
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  
% 104.13/104.50  Intermediate Status:
% 104.13/104.50  Generated:    3768
% 104.13/104.50  Kept:         2056
% 104.13/104.50  Inuse:        135
% 104.13/104.50  Deleted:      5
% 104.13/104.50  Deletedinuse: 4
% 104.13/104.50  
% 104.13/104.50  Resimplifying inuse:
% 104.13/104.50  Done
% 104.13/104.50  
% 104.13/104.50  ResimplifyinCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------