TSTP Solution File: SET045-5 by Bliksem---1.12

View Problem - Process Solution

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

% Computer : n020.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:46:05 EDT 2022

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

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