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

View Problem - Process Solution

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

% Computer : n003.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:52 EDT 2022

% Result   : Unsatisfiable 0.66s 1.06s
% Output   : Refutation 0.66s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYO611-1 : TPTP v8.1.0. Released v7.1.0.
% 0.06/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n003.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % DateTime : Sat Jul  9 06:25:28 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.66/1.06  *** allocated 10000 integers for termspace/termends
% 0.66/1.06  *** allocated 10000 integers for clauses
% 0.66/1.06  *** allocated 10000 integers for justifications
% 0.66/1.06  Bliksem 1.12
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  Automatic Strategy Selection
% 0.66/1.06  
% 0.66/1.06  Clauses:
% 0.66/1.06  [
% 0.66/1.06     [ le( X, X ) ],
% 0.66/1.06     [ ~( le( max( X, Y ), Z ) ), le( X, Z ) ],
% 0.66/1.06     [ ~( le( max( X, Y ), Z ) ), le( Y, Z ) ],
% 0.66/1.06     [ eq( f( X ), a0 ) ],
% 0.66/1.06     [ ~( eq( f( X ), a0 ) ), ~( eq( f( Y ), a0 ) ), ~( le( s( X ), Y ) ) ]
% 0.66/1.06  ] .
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  percentage equality = 0.000000, percentage horn = 1.000000
% 0.66/1.06  This is a near-Horn, non-equality  problem
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  Options Used:
% 0.66/1.06  
% 0.66/1.06  useres =            1
% 0.66/1.06  useparamod =        0
% 0.66/1.06  useeqrefl =         0
% 0.66/1.06  useeqfact =         0
% 0.66/1.06  usefactor =         1
% 0.66/1.06  usesimpsplitting =  0
% 0.66/1.06  usesimpdemod =      0
% 0.66/1.06  usesimpres =        4
% 0.66/1.06  
% 0.66/1.06  resimpinuse      =  1000
% 0.66/1.06  resimpclauses =     20000
% 0.66/1.06  substype =          standard
% 0.66/1.06  backwardsubs =      1
% 0.66/1.06  selectoldest =      5
% 0.66/1.06  
% 0.66/1.06  litorderings [0] =  split
% 0.66/1.06  litorderings [1] =  liftord
% 0.66/1.06  
% 0.66/1.06  termordering =      none
% 0.66/1.06  
% 0.66/1.06  litapriori =        1
% 0.66/1.06  termapriori =       0
% 0.66/1.06  litaposteriori =    0
% 0.66/1.06  termaposteriori =   0
% 0.66/1.06  demodaposteriori =  0
% 0.66/1.06  ordereqreflfact =   0
% 0.66/1.06  
% 0.66/1.06  litselect =         negative
% 0.66/1.06  
% 0.66/1.06  maxweight =         30000
% 0.66/1.06  maxdepth =          30000
% 0.66/1.06  maxlength =         115
% 0.66/1.06  maxnrvars =         195
% 0.66/1.06  excuselevel =       0
% 0.66/1.06  increasemaxweight = 0
% 0.66/1.06  
% 0.66/1.06  maxselected =       10000000
% 0.66/1.06  maxnrclauses =      10000000
% 0.66/1.06  
% 0.66/1.06  showgenerated =    0
% 0.66/1.06  showkept =         0
% 0.66/1.06  showselected =     0
% 0.66/1.06  showdeleted =      0
% 0.66/1.06  showresimp =       1
% 0.66/1.06  showstatus =       2000
% 0.66/1.06  
% 0.66/1.06  prologoutput =     1
% 0.66/1.06  nrgoals =          5000000
% 0.66/1.06  totalproof =       1
% 0.66/1.06  
% 0.66/1.06  Symbols occurring in the translation:
% 0.66/1.06  
% 0.66/1.06  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.66/1.06  .  [1, 2]      (w:1, o:22, a:1, s:1, b:0), 
% 0.66/1.06  !  [4, 1]      (w:1, o:15, a:1, s:1, b:0), 
% 0.66/1.06  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.66/1.06  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.66/1.06  le  [40, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.66/1.06  max  [42, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.66/1.06  f  [44, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.66/1.06  a0  [45, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.66/1.06  eq  [46, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.66/1.06  s  [49, 1]      (w:1, o:21, a:1, s:1, b:0).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  Starting Search:
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  Bliksems!, er is een bewijs:
% 0.66/1.06  % SZS status Unsatisfiable
% 0.66/1.06  % SZS output start Refutation
% 0.66/1.06  
% 0.66/1.06  clause( 0, [ le( X, X ) ] )
% 0.66/1.06  .
% 0.66/1.06  clause( 1, [ le( X, Z ), ~( le( max( X, Y ), Z ) ) ] )
% 0.66/1.06  .
% 0.66/1.06  clause( 2, [ le( Y, Z ), ~( le( max( X, Y ), Z ) ) ] )
% 0.66/1.06  .
% 0.66/1.06  clause( 3, [ eq( f( X ), a0 ) ] )
% 0.66/1.06  .
% 0.66/1.06  clause( 4, [ ~( eq( f( Y ), a0 ) ), ~( le( s( X ), Y ) ) ] )
% 0.66/1.06  .
% 0.66/1.06  clause( 5, [ le( X, max( Y, X ) ) ] )
% 0.66/1.06  .
% 0.66/1.06  clause( 9, [ le( X, max( Y, max( X, Z ) ) ) ] )
% 0.66/1.06  .
% 0.66/1.06  clause( 19, [ ~( le( s( X ), Y ) ) ] )
% 0.66/1.06  .
% 0.66/1.06  clause( 20, [] )
% 0.66/1.06  .
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  % SZS output end Refutation
% 0.66/1.06  found a proof!
% 0.66/1.06  
% 0.66/1.06  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.66/1.06  
% 0.66/1.06  initialclauses(
% 0.66/1.06  [ clause( 22, [ le( X, X ) ] )
% 0.66/1.06  , clause( 23, [ ~( le( max( X, Y ), Z ) ), le( X, Z ) ] )
% 0.66/1.06  , clause( 24, [ ~( le( max( X, Y ), Z ) ), le( Y, Z ) ] )
% 0.66/1.06  , clause( 25, [ eq( f( X ), a0 ) ] )
% 0.66/1.06  , clause( 26, [ ~( eq( f( X ), a0 ) ), ~( eq( f( Y ), a0 ) ), ~( le( s( X )
% 0.66/1.06    , Y ) ) ] )
% 0.66/1.06  ] ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  subsumption(
% 0.66/1.06  clause( 0, [ le( X, X ) ] )
% 0.66/1.06  , clause( 22, [ le( X, X ) ] )
% 0.66/1.06  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  subsumption(
% 0.66/1.06  clause( 1, [ le( X, Z ), ~( le( max( X, Y ), Z ) ) ] )
% 0.66/1.06  , clause( 23, [ ~( le( max( X, Y ), Z ) ), le( X, Z ) ] )
% 0.66/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.66/1.06    permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  subsumption(
% 0.66/1.06  clause( 2, [ le( Y, Z ), ~( le( max( X, Y ), Z ) ) ] )
% 0.66/1.06  , clause( 24, [ ~( le( max( X, Y ), Z ) ), le( Y, Z ) ] )
% 0.66/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.66/1.06    permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  subsumption(
% 0.66/1.06  clause( 3, [ eq( f( X ), a0 ) ] )
% 0.66/1.06  , clause( 25, [ eq( f( X ), a0 ) ] )
% 0.66/1.06  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  resolution(
% 0.66/1.06  clause( 29, [ ~( eq( f( Y ), a0 ) ), ~( le( s( X ), Y ) ) ] )
% 0.66/1.06  , clause( 26, [ ~( eq( f( X ), a0 ) ), ~( eq( f( Y ), a0 ) ), ~( le( s( X )
% 0.66/1.06    , Y ) ) ] )
% 0.66/1.06  , 0, clause( 3, [ eq( f( X ), a0 ) ] )
% 0.66/1.06  , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.66/1.06    , X )] )).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  subsumption(
% 0.66/1.06  clause( 4, [ ~( eq( f( Y ), a0 ) ), ~( le( s( X ), Y ) ) ] )
% 0.66/1.06  , clause( 29, [ ~( eq( f( Y ), a0 ) ), ~( le( s( X ), Y ) ) ] )
% 0.66/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.66/1.06     ), ==>( 1, 1 )] ) ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  resolution(
% 0.66/1.06  clause( 31, [ le( X, max( Y, X ) ) ] )
% 0.66/1.06  , clause( 2, [ le( Y, Z ), ~( le( max( X, Y ), Z ) ) ] )
% 0.66/1.06  , 1, clause( 0, [ le( X, X ) ] )
% 0.66/1.06  , 0, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, max( Y, X ) )] ), 
% 0.66/1.06    substitution( 1, [ :=( X, max( Y, X ) )] )).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  subsumption(
% 0.66/1.06  clause( 5, [ le( X, max( Y, X ) ) ] )
% 0.66/1.06  , clause( 31, [ le( X, max( Y, X ) ) ] )
% 0.66/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.66/1.06     )] ) ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  resolution(
% 0.66/1.06  clause( 32, [ le( X, max( Y, max( X, Z ) ) ) ] )
% 0.66/1.06  , clause( 1, [ le( X, Z ), ~( le( max( X, Y ), Z ) ) ] )
% 0.66/1.06  , 1, clause( 5, [ le( X, max( Y, X ) ) ] )
% 0.66/1.06  , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, max( Y, max( X, Z )
% 0.66/1.06     ) )] ), substitution( 1, [ :=( X, max( X, Z ) ), :=( Y, Y )] )).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  subsumption(
% 0.66/1.06  clause( 9, [ le( X, max( Y, max( X, Z ) ) ) ] )
% 0.66/1.06  , clause( 32, [ le( X, max( Y, max( X, Z ) ) ) ] )
% 0.66/1.06  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.66/1.06    permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  resolution(
% 0.66/1.06  clause( 33, [ ~( le( s( Y ), X ) ) ] )
% 0.66/1.06  , clause( 4, [ ~( eq( f( Y ), a0 ) ), ~( le( s( X ), Y ) ) ] )
% 0.66/1.06  , 0, clause( 3, [ eq( f( X ), a0 ) ] )
% 0.66/1.06  , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] ), substitution( 1, [ :=( X
% 0.66/1.06    , X )] )).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  subsumption(
% 0.66/1.06  clause( 19, [ ~( le( s( X ), Y ) ) ] )
% 0.66/1.06  , clause( 33, [ ~( le( s( Y ), X ) ) ] )
% 0.66/1.06  , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.66/1.06     )] ) ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  resolution(
% 0.66/1.06  clause( 34, [] )
% 0.66/1.06  , clause( 19, [ ~( le( s( X ), Y ) ) ] )
% 0.66/1.06  , 0, clause( 9, [ le( X, max( Y, max( X, Z ) ) ) ] )
% 0.66/1.06  , 0, substitution( 0, [ :=( X, X ), :=( Y, max( Y, max( s( X ), Z ) ) )] )
% 0.66/1.06    , substitution( 1, [ :=( X, s( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  subsumption(
% 0.66/1.06  clause( 20, [] )
% 0.66/1.06  , clause( 34, [] )
% 0.66/1.06  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  end.
% 0.66/1.06  
% 0.66/1.06  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.66/1.06  
% 0.66/1.06  Memory use:
% 0.66/1.06  
% 0.66/1.06  space for terms:        265
% 0.66/1.06  space for clauses:      1309
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  clauses generated:      21
% 0.66/1.06  clauses kept:           21
% 0.66/1.06  clauses selected:       11
% 0.66/1.06  clauses deleted:        1
% 0.66/1.06  clauses inuse deleted:  0
% 0.66/1.06  
% 0.66/1.06  subsentry:          4
% 0.66/1.06  literals s-matched: 4
% 0.66/1.06  literals matched:   4
% 0.66/1.06  full subsumption:   0
% 0.66/1.06  
% 0.66/1.06  checksum:           279480
% 0.66/1.06  
% 0.66/1.06  
% 0.66/1.06  Bliksem ended
%------------------------------------------------------------------------------