TSTP Solution File: SWV490+3 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SWV490+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n020.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 : Wed Jul 20 16:25:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWV490+3 : TPTP v8.1.0. Released v4.0.0.
% 0.14/0.14  % Command  : bliksem %s
% 0.15/0.35  % Computer : n020.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % DateTime : Thu Jun 16 01:25:34 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 23.54/23.94  *** allocated 10000 integers for termspace/termends
% 23.54/23.94  *** allocated 10000 integers for clauses
% 23.54/23.94  *** allocated 10000 integers for justifications
% 23.54/23.94  Bliksem 1.12
% 23.54/23.94  
% 23.54/23.94  
% 23.54/23.94  Automatic Strategy Selection
% 23.54/23.94  
% 23.54/23.94  
% 23.54/23.94  Clauses:
% 23.54/23.94  
% 23.54/23.94  { ! int_leq( X, Y ), int_less( X, Y ), X = Y }.
% 23.54/23.94  { ! int_less( X, Y ), int_leq( X, Y ) }.
% 23.54/23.94  { ! X = Y, int_leq( X, Y ) }.
% 23.54/23.94  { ! int_less( X, Z ), ! int_less( Z, Y ), int_less( X, Y ) }.
% 23.54/23.94  { ! int_less( X, Y ), ! X = Y }.
% 23.54/23.94  { int_less( X, Y ), int_leq( Y, X ) }.
% 23.54/23.94  { int_less( int_zero, int_one ) }.
% 23.54/23.94  { plus( X, Y ) = plus( Y, X ) }.
% 23.54/23.94  { plus( X, int_zero ) = X }.
% 23.54/23.94  { ! int_less( X, Y ), ! int_leq( Z, T ), int_leq( plus( X, Z ), plus( Y, T
% 23.54/23.94     ) ) }.
% 23.54/23.94  { ! int_less( X, Y ), int_less( int_zero, skol1( Z, T ) ) }.
% 23.54/23.94  { ! int_less( X, Y ), plus( X, skol1( X, Y ) ) = Y }.
% 23.54/23.94  { ! plus( X, Z ) = Y, ! int_less( int_zero, Z ), int_less( X, Y ) }.
% 23.54/23.94  { ! int_less( int_zero, X ), int_leq( int_one, X ) }.
% 23.54/23.94  { ! int_leq( int_one, X ), int_less( int_zero, X ) }.
% 23.54/23.94  { ! real_zero = real_one }.
% 23.54/23.94  { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), ! 
% 23.54/23.94    int_leq( Y, n ), ! int_less( int_zero, Z ), ! X = plus( Y, Z ), ! int_leq
% 23.54/23.94    ( int_one, T ), ! int_leq( T, Y ), a( plus( T, Z ), T ) = real_zero }.
% 23.54/23.94  { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), ! 
% 23.54/23.94    int_leq( Y, n ), ! int_leq( int_one, Z ), ! int_leq( Z, Y ), a( Z, Z ) = 
% 23.54/23.94    real_one }.
% 23.54/23.94  { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), ! 
% 23.54/23.94    int_leq( Y, n ), ! int_less( int_zero, Z ), ! Y = plus( X, Z ), ! int_leq
% 23.54/23.94    ( int_one, T ), ! int_leq( T, X ), a( T, plus( T, Z ) ) = real_zero }.
% 23.54/23.94  { int_leq( int_one, skol2 ) }.
% 23.54/23.94  { int_leq( skol2, n ) }.
% 23.54/23.94  { int_leq( int_one, skol3 ) }.
% 23.54/23.94  { int_leq( skol3, n ) }.
% 23.54/23.94  { alpha1( skol2, skol3 ), skol2 = skol3 }.
% 23.54/23.94  { alpha1( skol2, skol3 ), a( skol2, skol3 ) = real_zero }.
% 23.54/23.94  { ! alpha1( X, Y ), ! X = Y }.
% 23.54/23.94  { ! alpha1( X, Y ), ! a( X, Y ) = real_zero }.
% 23.54/23.94  { X = Y, a( X, Y ) = real_zero, alpha1( X, Y ) }.
% 23.54/23.94  
% 23.54/23.94  percentage equality = 0.263889, percentage horn = 0.821429
% 23.54/23.94  This is a problem with some equality
% 23.54/23.94  
% 23.54/23.94  
% 23.54/23.94  
% 23.54/23.94  Options Used:
% 23.54/23.94  
% 23.54/23.94  useres =            1
% 23.54/23.94  useparamod =        1
% 23.54/23.94  useeqrefl =         1
% 23.54/23.94  useeqfact =         1
% 23.54/23.94  usefactor =         1
% 23.54/23.94  usesimpsplitting =  0
% 23.54/23.94  usesimpdemod =      5
% 23.54/23.94  usesimpres =        3
% 23.54/23.94  
% 23.54/23.94  resimpinuse      =  1000
% 23.54/23.94  resimpclauses =     20000
% 23.54/23.94  substype =          eqrewr
% 23.54/23.94  backwardsubs =      1
% 23.54/23.94  selectoldest =      5
% 23.54/23.94  
% 23.54/23.94  litorderings [0] =  split
% 23.54/23.94  litorderings [1] =  extend the termordering, first sorting on arguments
% 23.54/23.94  
% 23.54/23.94  termordering =      kbo
% 23.54/23.94  
% 23.54/23.94  litapriori =        0
% 23.54/23.94  termapriori =       1
% 23.54/23.94  litaposteriori =    0
% 23.54/23.94  termaposteriori =   0
% 23.54/23.94  demodaposteriori =  0
% 23.54/23.94  ordereqreflfact =   0
% 23.54/23.94  
% 23.54/23.94  litselect =         negord
% 23.54/23.94  
% 23.54/23.94  maxweight =         15
% 23.54/23.94  maxdepth =          30000
% 23.54/23.94  maxlength =         115
% 23.54/23.94  maxnrvars =         195
% 23.54/23.94  excuselevel =       1
% 23.54/23.94  increasemaxweight = 1
% 23.54/23.94  
% 23.54/23.94  maxselected =       10000000
% 23.54/23.94  maxnrclauses =      10000000
% 23.54/23.94  
% 23.54/23.94  showgenerated =    0
% 23.54/23.94  showkept =         0
% 23.54/23.94  showselected =     0
% 23.54/23.94  showdeleted =      0
% 23.54/23.94  showresimp =       1
% 23.54/23.94  showstatus =       2000
% 23.54/23.94  
% 23.54/23.94  prologoutput =     0
% 23.54/23.94  nrgoals =          5000000
% 23.54/23.94  totalproof =       1
% 23.54/23.94  
% 23.54/23.94  Symbols occurring in the translation:
% 23.54/23.94  
% 23.54/23.94  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 23.54/23.94  .  [1, 2]      (w:1, o:26, a:1, s:1, b:0), 
% 23.54/23.94  !  [4, 1]      (w:0, o:21, a:1, s:1, b:0), 
% 23.54/23.94  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 23.54/23.94  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 23.54/23.94  int_leq  [37, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 23.54/23.94  int_less  [38, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 23.54/23.94  int_zero  [40, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 23.54/23.94  int_one  [41, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 23.54/23.94  plus  [42, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 23.54/23.94  real_zero  [47, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 23.54/23.94  real_one  [48, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 23.54/23.94  n  [49, 0]      (w:1, o:17, a:1, s:1, b:0), 
% 23.54/23.94  a  [51, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 23.54/23.94  alpha1  [52, 2]      (w:1, o:54, a:1, s:1, b:1), 
% 23.54/23.94  skol1  [53, 2]      (w:1, o:55, a:1, s:1, b:1), 
% 23.54/23.94  skol2  [54, 0]      (w:1, o:19, a:1, s:1, b:1), 
% 23.54/23.94  skol3  [55, 0]      (w:1, o:20, a:1, s:1, b:1).
% 23.54/23.94  
% 23.54/23.94  
% 23.54/23.94  Starting Search:
% 23.54/23.94  
% 23.54/23.94  *** allocated 15000 integers for clauses
% 23.54/23.94  *** allocated 22500 integers for clauses
% 23.54/23.94  *** allocated 33750 integers for clauses
% 23.54/23.94  *** allocated 15000 integers for termspaceCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------