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

View Problem - Process Solution

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

% Computer : n015.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 : Mon Jul 18 22:52:51 EDT 2022

% Result   : Unsatisfiable 0.77s 1.16s
% Output   : Refutation 0.77s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET855-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n015.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.34  % CPULimit : 300
% 0.12/0.34  % DateTime : Sun Jul 10 10:55:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.77/1.16  *** allocated 10000 integers for termspace/termends
% 0.77/1.16  *** allocated 10000 integers for clauses
% 0.77/1.16  *** allocated 10000 integers for justifications
% 0.77/1.16  Bliksem 1.12
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  Automatic Strategy Selection
% 0.77/1.16  
% 0.77/1.16  Clauses:
% 0.77/1.16  [
% 0.77/1.16     [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 'c_lessequals'( Y, X, 
% 0.77/1.16    'tc_set'( Z ) ) ), =( Y, X ) ],
% 0.77/1.16     [ 'c_lessequals'( 'v_n', 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'tc_set'( 
% 0.77/1.16    'tc_set'( 't_a' ) ) ) ],
% 0.77/1.16     [ 'c_lessequals'( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n', 'tc_set'( 
% 0.77/1.16    'tc_set'( 't_a' ) ) ) ],
% 0.77/1.16     [ ~( =( 'v_n', 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ) ) ) ]
% 0.77/1.16  ] .
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  percentage equality = 0.333333, percentage horn = 1.000000
% 0.77/1.16  This is a problem with some equality
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  Options Used:
% 0.77/1.16  
% 0.77/1.16  useres =            1
% 0.77/1.16  useparamod =        1
% 0.77/1.16  useeqrefl =         1
% 0.77/1.16  useeqfact =         1
% 0.77/1.16  usefactor =         1
% 0.77/1.16  usesimpsplitting =  0
% 0.77/1.16  usesimpdemod =      5
% 0.77/1.16  usesimpres =        3
% 0.77/1.16  
% 0.77/1.16  resimpinuse      =  1000
% 0.77/1.16  resimpclauses =     20000
% 0.77/1.16  substype =          eqrewr
% 0.77/1.16  backwardsubs =      1
% 0.77/1.16  selectoldest =      5
% 0.77/1.16  
% 0.77/1.16  litorderings [0] =  split
% 0.77/1.16  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.77/1.16  
% 0.77/1.16  termordering =      kbo
% 0.77/1.16  
% 0.77/1.16  litapriori =        0
% 0.77/1.16  termapriori =       1
% 0.77/1.16  litaposteriori =    0
% 0.77/1.16  termaposteriori =   0
% 0.77/1.16  demodaposteriori =  0
% 0.77/1.16  ordereqreflfact =   0
% 0.77/1.16  
% 0.77/1.16  litselect =         negord
% 0.77/1.16  
% 0.77/1.16  maxweight =         15
% 0.77/1.16  maxdepth =          30000
% 0.77/1.16  maxlength =         115
% 0.77/1.16  maxnrvars =         195
% 0.77/1.16  excuselevel =       1
% 0.77/1.16  increasemaxweight = 1
% 0.77/1.16  
% 0.77/1.16  maxselected =       10000000
% 0.77/1.16  maxnrclauses =      10000000
% 0.77/1.16  
% 0.77/1.16  showgenerated =    0
% 0.77/1.16  showkept =         0
% 0.77/1.16  showselected =     0
% 0.77/1.16  showdeleted =      0
% 0.77/1.16  showresimp =       1
% 0.77/1.16  showstatus =       2000
% 0.77/1.16  
% 0.77/1.16  prologoutput =     1
% 0.77/1.16  nrgoals =          5000000
% 0.77/1.16  totalproof =       1
% 0.77/1.16  
% 0.77/1.16  Symbols occurring in the translation:
% 0.77/1.16  
% 0.77/1.16  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.77/1.16  .  [1, 2]      (w:1, o:21, a:1, s:1, b:0), 
% 0.77/1.16  !  [4, 1]      (w:0, o:15, a:1, s:1, b:0), 
% 0.77/1.16  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.77/1.16  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.77/1.16  'tc_set'  [42, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.77/1.16  'c_lessequals'  [43, 3]      (w:1, o:47, a:1, s:1, b:0), 
% 0.77/1.16  'v_n'  [44, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 0.77/1.16  'v_Y'  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.77/1.16  't_a'  [46, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.77/1.16  'c_Union'  [47, 2]      (w:1, o:46, a:1, s:1, b:0).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  Starting Search:
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  Bliksems!, er is een bewijs:
% 0.77/1.16  % SZS status Unsatisfiable
% 0.77/1.16  % SZS output start Refutation
% 0.77/1.16  
% 0.77/1.16  clause( 0, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 'c_lessequals'( 
% 0.77/1.16    Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.77/1.16  .
% 0.77/1.16  clause( 1, [ 'c_lessequals'( 'v_n', 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 
% 0.77/1.16    'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  .
% 0.77/1.16  clause( 2, [ 'c_lessequals'( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n', 
% 0.77/1.16    'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  .
% 0.77/1.16  clause( 3, [ ~( =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ) ] )
% 0.77/1.16  .
% 0.77/1.16  clause( 4, [ =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ] )
% 0.77/1.16  .
% 0.77/1.16  clause( 21, [] )
% 0.77/1.16  .
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  % SZS output end Refutation
% 0.77/1.16  found a proof!
% 0.77/1.16  
% 0.77/1.16  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.77/1.16  
% 0.77/1.16  initialclauses(
% 0.77/1.16  [ clause( 23, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 
% 0.77/1.16    'c_lessequals'( Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.77/1.16  , clause( 24, [ 'c_lessequals'( 'v_n', 'c_Union'( 'v_Y', 'tc_set'( 't_a' )
% 0.77/1.16     ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  , clause( 25, [ 'c_lessequals'( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 
% 0.77/1.16    'v_n', 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  , clause( 26, [ ~( =( 'v_n', 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ) ) ) ] )
% 0.77/1.16  ] ).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  subsumption(
% 0.77/1.16  clause( 0, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 'c_lessequals'( 
% 0.77/1.16    Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.77/1.16  , clause( 23, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 
% 0.77/1.16    'c_lessequals'( Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.77/1.16  , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ), 
% 0.77/1.16    permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  subsumption(
% 0.77/1.16  clause( 1, [ 'c_lessequals'( 'v_n', 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 
% 0.77/1.16    'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  , clause( 24, [ 'c_lessequals'( 'v_n', 'c_Union'( 'v_Y', 'tc_set'( 't_a' )
% 0.77/1.16     ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  subsumption(
% 0.77/1.16  clause( 2, [ 'c_lessequals'( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n', 
% 0.77/1.16    'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  , clause( 25, [ 'c_lessequals'( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 
% 0.77/1.16    'v_n', 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  eqswap(
% 0.77/1.16  clause( 31, [ ~( =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ) ] )
% 0.77/1.16  , clause( 26, [ ~( =( 'v_n', 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ) ) ) ] )
% 0.77/1.16  , 0, substitution( 0, [] )).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  subsumption(
% 0.77/1.16  clause( 3, [ ~( =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ) ] )
% 0.77/1.16  , clause( 31, [ ~( =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ) ] )
% 0.77/1.16  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  resolution(
% 0.77/1.16  clause( 32, [ ~( 'c_lessequals'( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 
% 0.77/1.16    'v_n', 'tc_set'( 'tc_set'( 't_a' ) ) ) ), =( 'c_Union'( 'v_Y', 'tc_set'( 
% 0.77/1.16    't_a' ) ), 'v_n' ) ] )
% 0.77/1.16  , clause( 0, [ ~( 'c_lessequals'( X, Y, 'tc_set'( Z ) ) ), ~( 
% 0.77/1.16    'c_lessequals'( Y, X, 'tc_set'( Z ) ) ), =( Y, X ) ] )
% 0.77/1.16  , 0, clause( 1, [ 'c_lessequals'( 'v_n', 'c_Union'( 'v_Y', 'tc_set'( 't_a'
% 0.77/1.16     ) ), 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  , 0, substitution( 0, [ :=( X, 'v_n' ), :=( Y, 'c_Union'( 'v_Y', 'tc_set'( 
% 0.77/1.16    't_a' ) ) ), :=( Z, 'tc_set'( 't_a' ) )] ), substitution( 1, [] )).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  resolution(
% 0.77/1.16  clause( 34, [ =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ] )
% 0.77/1.16  , clause( 32, [ ~( 'c_lessequals'( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 
% 0.77/1.16    'v_n', 'tc_set'( 'tc_set'( 't_a' ) ) ) ), =( 'c_Union'( 'v_Y', 'tc_set'( 
% 0.77/1.16    't_a' ) ), 'v_n' ) ] )
% 0.77/1.16  , 0, clause( 2, [ 'c_lessequals'( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 
% 0.77/1.16    'v_n', 'tc_set'( 'tc_set'( 't_a' ) ) ) ] )
% 0.77/1.16  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  subsumption(
% 0.77/1.16  clause( 4, [ =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ] )
% 0.77/1.16  , clause( 34, [ =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ] )
% 0.77/1.16  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  resolution(
% 0.77/1.16  clause( 38, [] )
% 0.77/1.16  , clause( 3, [ ~( =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ) ] )
% 0.77/1.16  , 0, clause( 4, [ =( 'c_Union'( 'v_Y', 'tc_set'( 't_a' ) ), 'v_n' ) ] )
% 0.77/1.16  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  subsumption(
% 0.77/1.16  clause( 21, [] )
% 0.77/1.16  , clause( 38, [] )
% 0.77/1.16  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  end.
% 0.77/1.16  
% 0.77/1.16  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.77/1.16  
% 0.77/1.16  Memory use:
% 0.77/1.16  
% 0.77/1.16  space for terms:        424
% 0.77/1.16  space for clauses:      1600
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  clauses generated:      84
% 0.77/1.16  clauses kept:           22
% 0.77/1.16  clauses selected:       5
% 0.77/1.16  clauses deleted:        1
% 0.77/1.16  clauses inuse deleted:  0
% 0.77/1.16  
% 0.77/1.16  subsentry:          79
% 0.77/1.16  literals s-matched: 66
% 0.77/1.16  literals matched:   66
% 0.77/1.16  full subsumption:   29
% 0.77/1.16  
% 0.77/1.16  checksum:           -1473206544
% 0.77/1.16  
% 0.77/1.16  
% 0.77/1.16  Bliksem ended
%------------------------------------------------------------------------------