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

View Problem - Process Solution

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

% Computer : n005.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:08 EDT 2022

% Result   : Unsatisfiable 0.41s 1.05s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN053-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n005.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 : Tue Jul 12 02:28:21 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.41/1.05  *** allocated 10000 integers for termspace/termends
% 0.41/1.05  *** allocated 10000 integers for clauses
% 0.41/1.05  *** allocated 10000 integers for justifications
% 0.41/1.05  Bliksem 1.12
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Automatic Strategy Selection
% 0.41/1.05  
% 0.41/1.05  Clauses:
% 0.41/1.05  [
% 0.41/1.05     [ p, 'big_f'( X ), 'big_f'( Y ) ],
% 0.41/1.05     [ p, 'big_f'( X ), 'big_f'( b ) ],
% 0.41/1.05     [ ~( p ) ],
% 0.41/1.05     [ ~( 'big_f'( a ) ), p, 'big_f'( X ) ],
% 0.41/1.05     [ ~( 'big_f'( a ) ), ~( 'big_f'( b ) ) ]
% 0.41/1.05  ] .
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  percentage equality = 0.000000, percentage horn = 0.666667
% 0.41/1.05  This a non-horn, non-equality problem
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Options Used:
% 0.41/1.05  
% 0.41/1.05  useres =            1
% 0.41/1.05  useparamod =        0
% 0.41/1.05  useeqrefl =         0
% 0.41/1.05  useeqfact =         0
% 0.41/1.05  usefactor =         1
% 0.41/1.05  usesimpsplitting =  0
% 0.41/1.05  usesimpdemod =      0
% 0.41/1.05  usesimpres =        3
% 0.41/1.05  
% 0.41/1.05  resimpinuse      =  1000
% 0.41/1.05  resimpclauses =     20000
% 0.41/1.05  substype =          standard
% 0.41/1.05  backwardsubs =      1
% 0.41/1.05  selectoldest =      5
% 0.41/1.05  
% 0.41/1.05  litorderings [0] =  split
% 0.41/1.05  litorderings [1] =  liftord
% 0.41/1.05  
% 0.41/1.05  termordering =      none
% 0.41/1.05  
% 0.41/1.05  litapriori =        1
% 0.41/1.05  termapriori =       0
% 0.41/1.05  litaposteriori =    0
% 0.41/1.05  termaposteriori =   0
% 0.41/1.05  demodaposteriori =  0
% 0.41/1.05  ordereqreflfact =   0
% 0.41/1.05  
% 0.41/1.05  litselect =         none
% 0.41/1.05  
% 0.41/1.05  maxweight =         15
% 0.41/1.05  maxdepth =          30000
% 0.41/1.05  maxlength =         115
% 0.41/1.05  maxnrvars =         195
% 0.41/1.05  excuselevel =       1
% 0.41/1.05  increasemaxweight = 1
% 0.41/1.05  
% 0.41/1.05  maxselected =       10000000
% 0.41/1.05  maxnrclauses =      10000000
% 0.41/1.05  
% 0.41/1.05  showgenerated =    0
% 0.41/1.05  showkept =         0
% 0.41/1.05  showselected =     0
% 0.41/1.05  showdeleted =      0
% 0.41/1.05  showresimp =       1
% 0.41/1.05  showstatus =       2000
% 0.41/1.05  
% 0.41/1.05  prologoutput =     1
% 0.41/1.05  nrgoals =          5000000
% 0.41/1.05  totalproof =       1
% 0.41/1.05  
% 0.41/1.05  Symbols occurring in the translation:
% 0.41/1.05  
% 0.41/1.05  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.41/1.05  .  [1, 2]      (w:1, o:20, a:1, s:1, b:0), 
% 0.41/1.05  !  [4, 1]      (w:0, o:14, a:1, s:1, b:0), 
% 0.41/1.05  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.41/1.05  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.41/1.05  p  [39, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.41/1.05  'big_f'  [41, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.41/1.05  b  [43, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.41/1.05  a  [44, 0]      (w:1, o:12, a:1, s:1, b:0).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Starting Search:
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Bliksems!, er is een bewijs:
% 0.41/1.05  % SZS status Unsatisfiable
% 0.41/1.05  % SZS output start Refutation
% 0.41/1.05  
% 0.41/1.05  clause( 0, [ p, 'big_f'( Y ), 'big_f'( X ) ] )
% 0.41/1.05  .
% 0.41/1.05  clause( 1, [ ~( p ) ] )
% 0.41/1.05  .
% 0.41/1.05  clause( 2, [ 'big_f'( X ), ~( 'big_f'( a ) ) ] )
% 0.41/1.05  .
% 0.41/1.05  clause( 3, [ ~( 'big_f'( a ) ) ] )
% 0.41/1.05  .
% 0.41/1.05  clause( 4, [ 'big_f'( X ) ] )
% 0.41/1.05  .
% 0.41/1.05  clause( 5, [] )
% 0.41/1.05  .
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  % SZS output end Refutation
% 0.41/1.05  found a proof!
% 0.41/1.05  
% 0.41/1.05  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.05  
% 0.41/1.05  initialclauses(
% 0.41/1.05  [ clause( 7, [ p, 'big_f'( X ), 'big_f'( Y ) ] )
% 0.41/1.05  , clause( 8, [ p, 'big_f'( X ), 'big_f'( b ) ] )
% 0.41/1.05  , clause( 9, [ ~( p ) ] )
% 0.41/1.05  , clause( 10, [ ~( 'big_f'( a ) ), p, 'big_f'( X ) ] )
% 0.41/1.05  , clause( 11, [ ~( 'big_f'( a ) ), ~( 'big_f'( b ) ) ] )
% 0.41/1.05  ] ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  subsumption(
% 0.41/1.05  clause( 0, [ p, 'big_f'( Y ), 'big_f'( X ) ] )
% 0.41/1.05  , clause( 7, [ p, 'big_f'( X ), 'big_f'( Y ) ] )
% 0.41/1.05  , substitution( 0, [ :=( X, Y ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.41/1.05     ), ==>( 1, 1 ), ==>( 2, 1 )] ) ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  subsumption(
% 0.41/1.05  clause( 1, [ ~( p ) ] )
% 0.41/1.05  , clause( 9, [ ~( p ) ] )
% 0.41/1.05  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  resolution(
% 0.41/1.05  clause( 17, [ 'big_f'( X ), 'big_f'( Y ) ] )
% 0.41/1.05  , clause( 1, [ ~( p ) ] )
% 0.41/1.05  , 0, clause( 7, [ p, 'big_f'( X ), 'big_f'( Y ) ] )
% 0.41/1.05  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.41/1.05    ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  subsumption(
% 0.41/1.05  clause( 2, [ 'big_f'( X ), ~( 'big_f'( a ) ) ] )
% 0.41/1.05  , clause( 17, [ 'big_f'( X ), 'big_f'( Y ) ] )
% 0.41/1.05  , substitution( 0, [ :=( X, X ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.41/1.05     ), ==>( 1, 0 )] ) ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  resolution(
% 0.41/1.05  clause( 23, [ ~( 'big_f'( a ) ), ~( 'big_f'( a ) ) ] )
% 0.41/1.05  , clause( 11, [ ~( 'big_f'( a ) ), ~( 'big_f'( b ) ) ] )
% 0.41/1.05  , 1, clause( 2, [ 'big_f'( X ), ~( 'big_f'( a ) ) ] )
% 0.41/1.05  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, b )] )).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  factor(
% 0.41/1.05  clause( 24, [ ~( 'big_f'( a ) ) ] )
% 0.41/1.05  , clause( 23, [ ~( 'big_f'( a ) ), ~( 'big_f'( a ) ) ] )
% 0.41/1.05  , 0, 1, substitution( 0, [] )).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  subsumption(
% 0.41/1.05  clause( 3, [ ~( 'big_f'( a ) ) ] )
% 0.41/1.05  , clause( 24, [ ~( 'big_f'( a ) ) ] )
% 0.41/1.05  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  factor(
% 0.41/1.05  clause( 25, [ p, 'big_f'( X ) ] )
% 0.41/1.05  , clause( 0, [ p, 'big_f'( Y ), 'big_f'( X ) ] )
% 0.41/1.05  , 1, 2, substitution( 0, [ :=( X, X ), :=( Y, X )] )).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  resolution(
% 0.41/1.05  clause( 26, [ 'big_f'( X ) ] )
% 0.41/1.05  , clause( 1, [ ~( p ) ] )
% 0.41/1.05  , 0, clause( 25, [ p, 'big_f'( X ) ] )
% 0.41/1.05  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  subsumption(
% 0.41/1.05  clause( 4, [ 'big_f'( X ) ] )
% 0.41/1.05  , clause( 26, [ 'big_f'( X ) ] )
% 0.41/1.05  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  resolution(
% 0.41/1.05  clause( 27, [] )
% 0.41/1.05  , clause( 3, [ ~( 'big_f'( a ) ) ] )
% 0.41/1.05  , 0, clause( 4, [ 'big_f'( X ) ] )
% 0.41/1.05  , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  subsumption(
% 0.41/1.05  clause( 5, [] )
% 0.41/1.05  , clause( 27, [] )
% 0.41/1.05  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  end.
% 0.41/1.05  
% 0.41/1.05  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.05  
% 0.41/1.05  Memory use:
% 0.41/1.05  
% 0.41/1.05  space for terms:        106
% 0.41/1.05  space for clauses:      231
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  clauses generated:      7
% 0.41/1.05  clauses kept:           6
% 0.41/1.05  clauses selected:       2
% 0.41/1.05  clauses deleted:        1
% 0.41/1.05  clauses inuse deleted:  0
% 0.41/1.05  
% 0.41/1.05  subsentry:          2
% 0.41/1.05  literals s-matched: 1
% 0.41/1.05  literals matched:   1
% 0.41/1.05  full subsumption:   0
% 0.41/1.05  
% 0.41/1.05  checksum:           2690
% 0.41/1.05  
% 0.41/1.05  
% 0.41/1.05  Bliksem ended
%------------------------------------------------------------------------------