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

View Problem - Process Solution

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

% Computer : n006.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 02:47:32 EDT 2022

% Result   : Unsatisfiable 0.68s 1.08s
% Output   : Refutation 0.68s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN079-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.13/0.33  % Computer : n006.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % DateTime : Tue Jul 12 04:41:20 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.68/1.08  *** allocated 10000 integers for termspace/termends
% 0.68/1.08  *** allocated 10000 integers for clauses
% 0.68/1.08  *** allocated 10000 integers for justifications
% 0.68/1.08  Bliksem 1.12
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  Automatic Strategy Selection
% 0.68/1.08  
% 0.68/1.08  Clauses:
% 0.68/1.08  [
% 0.68/1.08     [ 'big_f'( f( a, b ), f( b, c ) ) ],
% 0.68/1.08     [ 'big_f'( f( b, c ), f( a, c ) ) ],
% 0.68/1.08     [ ~( 'big_f'( X, Y ) ), ~( 'big_f'( Y, Z ) ), 'big_f'( X, Z ) ],
% 0.68/1.08     [ ~( 'big_f'( f( a, b ), f( a, c ) ) ) ]
% 0.68/1.08  ] .
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  percentage equality = 0.000000, percentage horn = 1.000000
% 0.68/1.08  This is a near-Horn, non-equality  problem
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  Options Used:
% 0.68/1.08  
% 0.68/1.08  useres =            1
% 0.68/1.08  useparamod =        0
% 0.68/1.08  useeqrefl =         0
% 0.68/1.08  useeqfact =         0
% 0.68/1.08  usefactor =         1
% 0.68/1.08  usesimpsplitting =  0
% 0.68/1.08  usesimpdemod =      0
% 0.68/1.08  usesimpres =        4
% 0.68/1.08  
% 0.68/1.08  resimpinuse      =  1000
% 0.68/1.08  resimpclauses =     20000
% 0.68/1.08  substype =          standard
% 0.68/1.08  backwardsubs =      1
% 0.68/1.08  selectoldest =      5
% 0.68/1.08  
% 0.68/1.08  litorderings [0] =  split
% 0.68/1.08  litorderings [1] =  liftord
% 0.68/1.08  
% 0.68/1.08  termordering =      none
% 0.68/1.08  
% 0.68/1.08  litapriori =        1
% 0.68/1.08  termapriori =       0
% 0.68/1.08  litaposteriori =    0
% 0.68/1.08  termaposteriori =   0
% 0.68/1.08  demodaposteriori =  0
% 0.68/1.08  ordereqreflfact =   0
% 0.68/1.08  
% 0.68/1.08  litselect =         negative
% 0.68/1.08  
% 0.68/1.08  maxweight =         30000
% 0.68/1.08  maxdepth =          30000
% 0.68/1.08  maxlength =         115
% 0.68/1.08  maxnrvars =         195
% 0.68/1.08  excuselevel =       0
% 0.68/1.08  increasemaxweight = 0
% 0.68/1.08  
% 0.68/1.08  maxselected =       10000000
% 0.68/1.08  maxnrclauses =      10000000
% 0.68/1.08  
% 0.68/1.08  showgenerated =    0
% 0.68/1.08  showkept =         0
% 0.68/1.08  showselected =     0
% 0.68/1.08  showdeleted =      0
% 0.68/1.08  showresimp =       1
% 0.68/1.08  showstatus =       2000
% 0.68/1.08  
% 0.68/1.08  prologoutput =     1
% 0.68/1.08  nrgoals =          5000000
% 0.68/1.08  totalproof =       1
% 0.68/1.08  
% 0.68/1.08  Symbols occurring in the translation:
% 0.68/1.08  
% 0.68/1.08  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.68/1.08  .  [1, 2]      (w:1, o:20, a:1, s:1, b:0), 
% 0.68/1.08  !  [4, 1]      (w:1, o:15, a:1, s:1, b:0), 
% 0.68/1.08  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.68/1.08  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.68/1.08  a  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.68/1.08  b  [40, 0]      (w:1, o:10, a:1, s:1, b:0), 
% 0.68/1.08  f  [41, 2]      (w:1, o:45, a:1, s:1, b:0), 
% 0.68/1.08  c  [42, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 0.68/1.08  'big_f'  [43, 2]      (w:1, o:46, a:1, s:1, b:0).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  Starting Search:
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  Bliksems!, er is een bewijs:
% 0.68/1.08  % SZS status Unsatisfiable
% 0.68/1.08  % SZS output start Refutation
% 0.68/1.08  
% 0.68/1.08  clause( 0, [ 'big_f'( f( a, b ), f( b, c ) ) ] )
% 0.68/1.08  .
% 0.68/1.08  clause( 1, [ 'big_f'( f( b, c ), f( a, c ) ) ] )
% 0.68/1.08  .
% 0.68/1.08  clause( 2, [ ~( 'big_f'( X, Y ) ), 'big_f'( X, Z ), ~( 'big_f'( Y, Z ) ) ]
% 0.68/1.08     )
% 0.68/1.08  .
% 0.68/1.08  clause( 3, [ ~( 'big_f'( f( a, b ), f( a, c ) ) ) ] )
% 0.68/1.08  .
% 0.68/1.08  clause( 5, [ 'big_f'( X, f( a, c ) ), ~( 'big_f'( X, f( b, c ) ) ) ] )
% 0.68/1.08  .
% 0.68/1.08  clause( 6, [] )
% 0.68/1.08  .
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  % SZS output end Refutation
% 0.68/1.08  found a proof!
% 0.68/1.08  
% 0.68/1.08  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.08  
% 0.68/1.08  initialclauses(
% 0.68/1.08  [ clause( 8, [ 'big_f'( f( a, b ), f( b, c ) ) ] )
% 0.68/1.08  , clause( 9, [ 'big_f'( f( b, c ), f( a, c ) ) ] )
% 0.68/1.08  , clause( 10, [ ~( 'big_f'( X, Y ) ), ~( 'big_f'( Y, Z ) ), 'big_f'( X, Z )
% 0.68/1.08     ] )
% 0.68/1.08  , clause( 11, [ ~( 'big_f'( f( a, b ), f( a, c ) ) ) ] )
% 0.68/1.08  ] ).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  subsumption(
% 0.68/1.08  clause( 0, [ 'big_f'( f( a, b ), f( b, c ) ) ] )
% 0.68/1.08  , clause( 8, [ 'big_f'( f( a, b ), f( b, c ) ) ] )
% 0.68/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  subsumption(
% 0.68/1.08  clause( 1, [ 'big_f'( f( b, c ), f( a, c ) ) ] )
% 0.68/1.08  , clause( 9, [ 'big_f'( f( b, c ), f( a, c ) ) ] )
% 0.68/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  subsumption(
% 0.68/1.08  clause( 2, [ ~( 'big_f'( X, Y ) ), 'big_f'( X, Z ), ~( 'big_f'( Y, Z ) ) ]
% 0.68/1.08     )
% 0.68/1.08  , clause( 10, [ ~( 'big_f'( X, Y ) ), ~( 'big_f'( Y, Z ) ), 'big_f'( X, Z )
% 0.68/1.08     ] )
% 0.68/1.08  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.68/1.08    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  subsumption(
% 0.68/1.08  clause( 3, [ ~( 'big_f'( f( a, b ), f( a, c ) ) ) ] )
% 0.68/1.08  , clause( 11, [ ~( 'big_f'( f( a, b ), f( a, c ) ) ) ] )
% 0.68/1.08  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  resolution(
% 0.68/1.08  clause( 15, [ ~( 'big_f'( X, f( b, c ) ) ), 'big_f'( X, f( a, c ) ) ] )
% 0.68/1.08  , clause( 2, [ ~( 'big_f'( X, Y ) ), 'big_f'( X, Z ), ~( 'big_f'( Y, Z ) )
% 0.68/1.08     ] )
% 0.68/1.08  , 2, clause( 1, [ 'big_f'( f( b, c ), f( a, c ) ) ] )
% 0.68/1.08  , 0, substitution( 0, [ :=( X, X ), :=( Y, f( b, c ) ), :=( Z, f( a, c ) )] )
% 0.68/1.08    , substitution( 1, [] )).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  subsumption(
% 0.68/1.08  clause( 5, [ 'big_f'( X, f( a, c ) ), ~( 'big_f'( X, f( b, c ) ) ) ] )
% 0.68/1.08  , clause( 15, [ ~( 'big_f'( X, f( b, c ) ) ), 'big_f'( X, f( a, c ) ) ] )
% 0.68/1.08  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 
% 0.68/1.08    0 )] ) ).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  resolution(
% 0.68/1.08  clause( 16, [ 'big_f'( f( a, b ), f( a, c ) ) ] )
% 0.68/1.08  , clause( 5, [ 'big_f'( X, f( a, c ) ), ~( 'big_f'( X, f( b, c ) ) ) ] )
% 0.68/1.08  , 1, clause( 0, [ 'big_f'( f( a, b ), f( b, c ) ) ] )
% 0.68/1.08  , 0, substitution( 0, [ :=( X, f( a, b ) )] ), substitution( 1, [] )).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  resolution(
% 0.68/1.08  clause( 17, [] )
% 0.68/1.08  , clause( 3, [ ~( 'big_f'( f( a, b ), f( a, c ) ) ) ] )
% 0.68/1.08  , 0, clause( 16, [ 'big_f'( f( a, b ), f( a, c ) ) ] )
% 0.68/1.08  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  subsumption(
% 0.68/1.08  clause( 6, [] )
% 0.68/1.08  , clause( 17, [] )
% 0.68/1.08  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  end.
% 0.68/1.08  
% 0.68/1.08  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.08  
% 0.68/1.08  Memory use:
% 0.68/1.08  
% 0.68/1.08  space for terms:        148
% 0.68/1.08  space for clauses:      463
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  clauses generated:      8
% 0.68/1.08  clauses kept:           7
% 0.68/1.08  clauses selected:       6
% 0.68/1.08  clauses deleted:        0
% 0.68/1.08  clauses inuse deleted:  0
% 0.68/1.08  
% 0.68/1.08  subsentry:          5
% 0.68/1.08  literals s-matched: 0
% 0.68/1.08  literals matched:   0
% 0.68/1.08  full subsumption:   0
% 0.68/1.08  
% 0.68/1.08  checksum:           -2147432197
% 0.68/1.08  
% 0.68/1.08  
% 0.68/1.08  Bliksem ended
%------------------------------------------------------------------------------