TSTP Solution File: ANA041-2 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : ANA041-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n012.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 14 18:38:44 EDT 2022

% Result   : Unsatisfiable 0.48s 1.12s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : -

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