↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : CAT016-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n024.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 23:54:13 EDT 2022

% Result   : Unsatisfiable 0.72s 1.09s
% Output   : Refutation 0.72s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CAT016-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % DateTime : Sun May 29 19:05:21 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.72/1.09  *** allocated 10000 integers for termspace/termends
% 0.72/1.09  *** allocated 10000 integers for clauses
% 0.72/1.09  *** allocated 10000 integers for justifications
% 0.72/1.09  Bliksem 1.12
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  Automatic Strategy Selection
% 0.72/1.09  
% 0.72/1.09  Clauses:
% 0.72/1.09  [
% 0.72/1.09     [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ],
% 0.72/1.09     [ ~( equivalent( X, Y ) ), =( X, Y ) ],
% 0.72/1.09     [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ],
% 0.72/1.09     [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ],
% 0.72/1.09     [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ],
% 0.72/1.09     [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( X ) )
% 0.72/1.09     ],
% 0.72/1.09     [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), codomain( Y )
% 0.72/1.09     ) ],
% 0.72/1.09     [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), codomain( Y ) )
% 0.72/1.09     ), 'there_exists'( compose( X, Y ) ) ],
% 0.72/1.09     [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.72/1.09    ,
% 0.72/1.09     [ =( compose( X, domain( X ) ), X ) ],
% 0.72/1.09     [ =( compose( codomain( X ), X ), X ) ],
% 0.72/1.09     [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ],
% 0.72/1.09     [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~( =( X, Y ) ), 
% 0.72/1.09    equivalent( X, Y ) ],
% 0.72/1.09     [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( codomain( X )
% 0.72/1.09     ) ],
% 0.72/1.09     [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ],
% 0.72/1.09     [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ],
% 0.72/1.09     [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y ) ],
% 0.72/1.09     [ 'there_exists'( a ) ],
% 0.72/1.09     [ ~( 'there_exists'( domain( a ) ) ) ]
% 0.72/1.09  ] .
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  percentage equality = 0.400000, percentage horn = 0.888889
% 0.72/1.09  This is a problem with some equality
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  Options Used:
% 0.72/1.09  
% 0.72/1.09  useres =            1
% 0.72/1.09  useparamod =        1
% 0.72/1.09  useeqrefl =         1
% 0.72/1.09  useeqfact =         1
% 0.72/1.09  usefactor =         1
% 0.72/1.09  usesimpsplitting =  0
% 0.72/1.09  usesimpdemod =      5
% 0.72/1.09  usesimpres =        3
% 0.72/1.09  
% 0.72/1.09  resimpinuse      =  1000
% 0.72/1.09  resimpclauses =     20000
% 0.72/1.09  substype =          eqrewr
% 0.72/1.09  backwardsubs =      1
% 0.72/1.09  selectoldest =      5
% 0.72/1.09  
% 0.72/1.09  litorderings [0] =  split
% 0.72/1.09  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.72/1.09  
% 0.72/1.09  termordering =      kbo
% 0.72/1.09  
% 0.72/1.09  litapriori =        0
% 0.72/1.09  termapriori =       1
% 0.72/1.09  litaposteriori =    0
% 0.72/1.09  termaposteriori =   0
% 0.72/1.09  demodaposteriori =  0
% 0.72/1.09  ordereqreflfact =   0
% 0.72/1.09  
% 0.72/1.09  litselect =         negord
% 0.72/1.09  
% 0.72/1.09  maxweight =         15
% 0.72/1.09  maxdepth =          30000
% 0.72/1.09  maxlength =         115
% 0.72/1.09  maxnrvars =         195
% 0.72/1.09  excuselevel =       1
% 0.72/1.09  increasemaxweight = 1
% 0.72/1.09  
% 0.72/1.09  maxselected =       10000000
% 0.72/1.09  maxnrclauses =      10000000
% 0.72/1.09  
% 0.72/1.09  showgenerated =    0
% 0.72/1.09  showkept =         0
% 0.72/1.09  showselected =     0
% 0.72/1.09  showdeleted =      0
% 0.72/1.09  showresimp =       1
% 0.72/1.09  showstatus =       2000
% 0.72/1.09  
% 0.72/1.09  prologoutput =     1
% 0.72/1.09  nrgoals =          5000000
% 0.72/1.09  totalproof =       1
% 0.72/1.09  
% 0.72/1.09  Symbols occurring in the translation:
% 0.72/1.09  
% 0.72/1.09  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.72/1.09  .  [1, 2]      (w:1, o:21, a:1, s:1, b:0), 
% 0.72/1.09  !  [4, 1]      (w:0, o:13, a:1, s:1, b:0), 
% 0.72/1.09  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.72/1.09  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.72/1.09  equivalent  [41, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.72/1.09  'there_exists'  [42, 1]      (w:1, o:18, a:1, s:1, b:0), 
% 0.72/1.09  domain  [43, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.72/1.09  codomain  [44, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.72/1.09  compose  [45, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.72/1.09  f1  [47, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.72/1.09  a  [48, 0]      (w:1, o:12, a:1, s:1, b:0).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  Starting Search:
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  Bliksems!, er is een bewijs:
% 0.72/1.09  % SZS status Unsatisfiable
% 0.72/1.09  % SZS output start Refutation
% 0.72/1.09  
% 0.72/1.09  clause( 5, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( 
% 0.72/1.09    X ) ) ] )
% 0.72/1.09  .
% 0.72/1.09  clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.72/1.09  .
% 0.72/1.09  clause( 16, [ 'there_exists'( a ) ] )
% 0.72/1.09  .
% 0.72/1.09  clause( 17, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 0.72/1.09  .
% 0.72/1.09  clause( 72, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 0.72/1.09  .
% 0.72/1.09  clause( 199, [] )
% 0.72/1.09  .
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  % SZS output end Refutation
% 0.72/1.09  found a proof!
% 0.72/1.09  
% 0.72/1.09  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.09  
% 0.72/1.09  initialclauses(
% 0.72/1.09  [ clause( 201, [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ] )
% 0.72/1.09  , clause( 202, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 0.72/1.09  , clause( 203, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y
% 0.72/1.09     ) ] )
% 0.72/1.09  , clause( 204, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.72/1.09     )
% 0.72/1.09  , clause( 205, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.72/1.09     ] )
% 0.72/1.09  , clause( 206, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.72/1.09    domain( X ) ) ] )
% 0.72/1.09  , clause( 207, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), 
% 0.72/1.09    codomain( Y ) ) ] )
% 0.72/1.09  , clause( 208, [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), 
% 0.72/1.09    codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 0.72/1.09  , clause( 209, [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y )
% 0.72/1.09    , Z ) ) ] )
% 0.72/1.09  , clause( 210, [ =( compose( X, domain( X ) ), X ) ] )
% 0.72/1.09  , clause( 211, [ =( compose( codomain( X ), X ), X ) ] )
% 0.72/1.09  , clause( 212, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.72/1.09  , clause( 213, [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~( =( 
% 0.72/1.09    X, Y ) ), equivalent( X, Y ) ] )
% 0.72/1.09  , clause( 214, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.72/1.09    codomain( X ) ) ] )
% 0.72/1.09  , clause( 215, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.72/1.09  , clause( 216, [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ] )
% 0.72/1.09  , clause( 217, [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y
% 0.72/1.09     ) ] )
% 0.72/1.09  , clause( 218, [ 'there_exists'( a ) ] )
% 0.72/1.09  , clause( 219, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 0.72/1.09  ] ).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  subsumption(
% 0.72/1.09  clause( 5, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( 
% 0.72/1.09    X ) ) ] )
% 0.72/1.09  , clause( 206, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.72/1.09    domain( X ) ) ] )
% 0.72/1.09  , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.72/1.09     ), ==>( 1, 1 )] ) ).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  subsumption(
% 0.72/1.09  clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.72/1.09  , clause( 210, [ =( compose( X, domain( X ) ), X ) ] )
% 0.72/1.09  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  subsumption(
% 0.72/1.09  clause( 16, [ 'there_exists'( a ) ] )
% 0.72/1.09  , clause( 218, [ 'there_exists'( a ) ] )
% 0.72/1.09  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  subsumption(
% 0.72/1.09  clause( 17, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 0.72/1.09  , clause( 219, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 0.72/1.09  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  resolution(
% 0.72/1.09  clause( 284, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 0.72/1.09  , clause( 17, [ ~( 'there_exists'( domain( a ) ) ) ] )
% 0.72/1.09  , 0, clause( 5, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( 
% 0.72/1.09    domain( X ) ) ] )
% 0.72/1.09  , 1, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, X )] )
% 0.72/1.09    ).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  subsumption(
% 0.72/1.09  clause( 72, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 0.72/1.09  , clause( 284, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 0.72/1.09  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  paramod(
% 0.72/1.09  clause( 286, [ ~( 'there_exists'( a ) ) ] )
% 0.72/1.09  , clause( 9, [ =( compose( X, domain( X ) ), X ) ] )
% 0.72/1.09  , 0, clause( 72, [ ~( 'there_exists'( compose( a, X ) ) ) ] )
% 0.72/1.09  , 0, 2, substitution( 0, [ :=( X, a )] ), substitution( 1, [ :=( X, domain( 
% 0.72/1.09    a ) )] )).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  resolution(
% 0.72/1.09  clause( 287, [] )
% 0.72/1.09  , clause( 286, [ ~( 'there_exists'( a ) ) ] )
% 0.72/1.09  , 0, clause( 16, [ 'there_exists'( a ) ] )
% 0.72/1.09  , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  subsumption(
% 0.72/1.09  clause( 199, [] )
% 0.72/1.09  , clause( 287, [] )
% 0.72/1.09  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  end.
% 0.72/1.09  
% 0.72/1.09  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.09  
% 0.72/1.09  Memory use:
% 0.72/1.09  
% 0.72/1.09  space for terms:        2277
% 0.72/1.09  space for clauses:      10546
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  clauses generated:      424
% 0.72/1.09  clauses kept:           200
% 0.72/1.09  clauses selected:       36
% 0.72/1.09  clauses deleted:        0
% 0.72/1.09  clauses inuse deleted:  0
% 0.72/1.09  
% 0.72/1.09  subsentry:          1443
% 0.72/1.09  literals s-matched: 1096
% 0.72/1.09  literals matched:   798
% 0.72/1.09  full subsumption:   183
% 0.72/1.09  
% 0.72/1.09  checksum:           1904165752
% 0.72/1.09  
% 0.72/1.09  
% 0.72/1.09  Bliksem ended
%------------------------------------------------------------------------------