TSTP Solution File: SWV492+1 by Bliksem---1.12

View Problem - Process Solution

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

% Computer : n017.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:20 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWV492+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n017.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 : Thu Jun 16 03:00:25 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 15.48/15.86  *** allocated 10000 integers for termspace/termends
% 15.48/15.86  *** allocated 10000 integers for clauses
% 15.48/15.86  *** allocated 10000 integers for justifications
% 15.48/15.86  Bliksem 1.12
% 15.48/15.86  
% 15.48/15.86  
% 15.48/15.86  Automatic Strategy Selection
% 15.48/15.86  
% 15.48/15.86  
% 15.48/15.86  Clauses:
% 15.48/15.86  
% 15.48/15.86  { ! int_leq( X, Y ), int_less( X, Y ), X = Y }.
% 15.48/15.86  { ! int_less( X, Y ), int_leq( X, Y ) }.
% 15.48/15.86  { ! X = Y, int_leq( X, Y ) }.
% 15.48/15.86  { ! int_less( X, Z ), ! int_less( Z, Y ), int_less( X, Y ) }.
% 15.48/15.86  { ! int_less( X, Y ), ! X = Y }.
% 15.48/15.86  { int_less( X, Y ), int_leq( Y, X ) }.
% 15.48/15.86  { int_less( int_zero, int_one ) }.
% 15.48/15.86  { plus( X, Y ) = plus( Y, X ) }.
% 15.48/15.86  { plus( X, int_zero ) = X }.
% 15.48/15.86  { ! int_less( X, Y ), ! int_leq( Z, T ), int_leq( plus( X, Z ), plus( Y, T
% 15.48/15.86     ) ) }.
% 15.48/15.86  { ! int_less( X, Y ), int_less( int_zero, skol1( Z, T ) ) }.
% 15.48/15.86  { ! int_less( X, Y ), plus( X, skol1( X, Y ) ) = Y }.
% 15.48/15.86  { ! plus( X, Z ) = Y, ! int_less( int_zero, Z ), int_less( X, Y ) }.
% 15.48/15.86  { ! int_less( int_zero, X ), int_leq( int_one, X ) }.
% 15.48/15.86  { ! int_leq( int_one, X ), int_less( int_zero, X ) }.
% 15.48/15.86  { ! real_zero = real_one }.
% 15.48/15.86  { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), ! 
% 15.48/15.86    int_leq( Y, n ), ! int_less( int_zero, Z ), ! X = plus( Y, Z ), ! int_leq
% 15.48/15.86    ( int_one, T ), ! int_leq( T, Y ), a( plus( T, Z ), T ) = qr( plus( T, Z
% 15.48/15.86     ), T ) }.
% 15.48/15.86  { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), ! 
% 15.48/15.86    int_leq( Y, n ), ! int_leq( int_one, Z ), ! int_leq( Z, Y ), a( Z, Z ) = 
% 15.48/15.86    real_one }.
% 15.48/15.86  { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), ! 
% 15.48/15.86    int_leq( Y, n ), ! int_less( int_zero, Z ), ! Y = plus( X, Z ), ! int_leq
% 15.48/15.86    ( int_one, T ), ! int_leq( T, X ), a( T, plus( T, Z ) ) = real_zero }.
% 15.48/15.86  { alpha1, alpha2( skol2, skol4 ) }.
% 15.48/15.86  { alpha1, a( skol2, skol4 ) = real_zero }.
% 15.48/15.86  { ! alpha2( X, Y ), int_leq( int_one, X ) }.
% 15.48/15.86  { ! alpha2( X, Y ), int_leq( Y, n ) }.
% 15.48/15.86  { ! alpha2( X, Y ), X = Y }.
% 15.48/15.86  { ! int_leq( int_one, X ), ! int_leq( Y, n ), ! X = Y, alpha2( X, Y ) }.
% 15.48/15.86  { ! alpha1, alpha3( skol3, skol5 ) }.
% 15.48/15.86  { ! alpha1, ! a( skol3, skol5 ) = real_zero }.
% 15.48/15.86  { ! alpha3( X, Y ), a( X, Y ) = real_zero, alpha1 }.
% 15.48/15.86  { ! alpha3( X, Y ), int_leq( int_one, X ) }.
% 15.48/15.86  { ! alpha3( X, Y ), int_less( X, Y ) }.
% 15.48/15.86  { ! alpha3( X, Y ), int_leq( Y, n ) }.
% 15.48/15.86  { ! int_leq( int_one, X ), ! int_less( X, Y ), ! int_leq( Y, n ), alpha3( X
% 15.48/15.86    , Y ) }.
% 15.48/15.86  
% 15.48/15.86  percentage equality = 0.204545, percentage horn = 0.843750
% 15.48/15.86  This is a problem with some equality
% 15.48/15.86  
% 15.48/15.86  
% 15.48/15.86  
% 15.48/15.86  Options Used:
% 15.48/15.86  
% 15.48/15.86  useres =            1
% 15.48/15.86  useparamod =        1
% 15.48/15.86  useeqrefl =         1
% 15.48/15.86  useeqfact =         1
% 15.48/15.86  usefactor =         1
% 15.48/15.86  usesimpsplitting =  0
% 15.48/15.86  usesimpdemod =      5
% 15.48/15.86  usesimpres =        3
% 15.48/15.86  
% 15.48/15.86  resimpinuse      =  1000
% 15.48/15.86  resimpclauses =     20000
% 15.48/15.86  substype =          eqrewr
% 15.48/15.86  backwardsubs =      1
% 15.48/15.86  selectoldest =      5
% 15.48/15.86  
% 15.48/15.86  litorderings [0] =  split
% 15.48/15.86  litorderings [1] =  extend the termordering, first sorting on arguments
% 15.48/15.86  
% 15.48/15.86  termordering =      kbo
% 15.48/15.86  
% 15.48/15.86  litapriori =        0
% 15.48/15.86  termapriori =       1
% 15.48/15.86  litaposteriori =    0
% 15.48/15.86  termaposteriori =   0
% 15.48/15.86  demodaposteriori =  0
% 15.48/15.86  ordereqreflfact =   0
% 15.48/15.86  
% 15.48/15.86  litselect =         negord
% 15.48/15.86  
% 15.48/15.86  maxweight =         15
% 15.48/15.86  maxdepth =          30000
% 15.48/15.86  maxlength =         115
% 15.48/15.86  maxnrvars =         195
% 15.48/15.86  excuselevel =       1
% 15.48/15.86  increasemaxweight = 1
% 15.48/15.86  
% 15.48/15.86  maxselected =       10000000
% 15.48/15.86  maxnrclauses =      10000000
% 15.48/15.86  
% 15.48/15.86  showgenerated =    0
% 15.48/15.86  showkept =         0
% 15.48/15.86  showselected =     0
% 15.48/15.86  showdeleted =      0
% 15.48/15.86  showresimp =       1
% 15.48/15.86  showstatus =       2000
% 15.48/15.86  
% 15.48/15.86  prologoutput =     0
% 15.48/15.86  nrgoals =          5000000
% 15.48/15.86  totalproof =       1
% 15.48/15.86  
% 15.48/15.86  Symbols occurring in the translation:
% 15.48/15.86  
% 15.48/15.86  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 15.48/15.86  .  [1, 2]      (w:1, o:29, a:1, s:1, b:0), 
% 15.48/15.86  !  [4, 1]      (w:0, o:24, a:1, s:1, b:0), 
% 15.48/15.86  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 15.48/15.86  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 15.48/15.86  int_leq  [37, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 15.48/15.86  int_less  [38, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 15.48/15.86  int_zero  [40, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 15.48/15.86  int_one  [41, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 15.48/15.86  plus  [42, 2]      (w:1, o:55, a:1, s:1, b:0), 
% 15.48/15.86  real_zero  [47, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 15.48/15.86  real_one  [48, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 15.48/15.86  n  [49, 0]      (w:1, o:17, a:1, s:1, b:0), 
% 15.48/15.86  a  [51, 2]      (w:1, o:56, a:1, s:1, b:0), 
% 15.48/15.86  qr  [52, 2]      (w:1, o:57, a:1, s:1, b:0), 
% 15.48/15.86  alpha1  [53, 0]      (w:1, o:19, a:1, s:1, b:1),Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------