↑ Up

Bliksem---1.12.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : CAT011-2 : 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 : Thu Jul 14 23:54:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CAT011-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : bliksem %s
% 0.12/0.33  % Computer : n020.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 : Mon May 30 00:26:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.70/1.08  *** allocated 10000 integers for termspace/termends
% 0.70/1.08  *** allocated 10000 integers for clauses
% 0.70/1.08  *** allocated 10000 integers for justifications
% 0.70/1.08  Bliksem 1.12
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  Automatic Strategy Selection
% 0.70/1.08  
% 0.70/1.08  Clauses:
% 0.70/1.08  [
% 0.70/1.08     [ =( codomain( domain( X ) ), domain( X ) ) ],
% 0.70/1.08     [ =( domain( codomain( X ) ), codomain( X ) ) ],
% 0.70/1.08     [ =( compose( domain( X ), X ), X ) ],
% 0.70/1.08     [ =( compose( X, codomain( X ) ), X ) ],
% 0.70/1.08     [ ~( =( codomain( X ), domain( Y ) ) ), =( domain( compose( X, Y ) ), 
% 0.70/1.08    domain( X ) ) ],
% 0.70/1.08     [ ~( =( codomain( X ), domain( Y ) ) ), =( codomain( compose( X, Y ) ), 
% 0.70/1.08    codomain( Y ) ) ],
% 0.70/1.08     [ ~( =( codomain( X ), domain( Y ) ) ), ~( =( codomain( Y ), domain( Z )
% 0.70/1.08     ) ), =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.70/1.08    ,
% 0.70/1.08     [ ~( =( domain( domain( a ) ), domain( a ) ) ) ]
% 0.70/1.08  ] .
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  percentage equality = 1.000000, percentage horn = 1.000000
% 0.70/1.08  This is a pure equality problem
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  Options Used:
% 0.70/1.08  
% 0.70/1.08  useres =            1
% 0.70/1.08  useparamod =        1
% 0.70/1.08  useeqrefl =         1
% 0.70/1.08  useeqfact =         1
% 0.70/1.08  usefactor =         1
% 0.70/1.08  usesimpsplitting =  0
% 0.70/1.08  usesimpdemod =      5
% 0.70/1.08  usesimpres =        3
% 0.70/1.08  
% 0.70/1.08  resimpinuse      =  1000
% 0.70/1.08  resimpclauses =     20000
% 0.70/1.08  substype =          eqrewr
% 0.70/1.08  backwardsubs =      1
% 0.70/1.08  selectoldest =      5
% 0.70/1.08  
% 0.70/1.08  litorderings [0] =  split
% 0.70/1.08  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.70/1.08  
% 0.70/1.08  termordering =      kbo
% 0.70/1.08  
% 0.70/1.08  litapriori =        0
% 0.70/1.08  termapriori =       1
% 0.70/1.08  litaposteriori =    0
% 0.70/1.08  termaposteriori =   0
% 0.70/1.08  demodaposteriori =  0
% 0.70/1.08  ordereqreflfact =   0
% 0.70/1.08  
% 0.70/1.08  litselect =         negord
% 0.70/1.08  
% 0.70/1.08  maxweight =         15
% 0.70/1.08  maxdepth =          30000
% 0.70/1.08  maxlength =         115
% 0.70/1.08  maxnrvars =         195
% 0.70/1.08  excuselevel =       1
% 0.70/1.08  increasemaxweight = 1
% 0.70/1.08  
% 0.70/1.08  maxselected =       10000000
% 0.70/1.08  maxnrclauses =      10000000
% 0.70/1.08  
% 0.70/1.08  showgenerated =    0
% 0.70/1.08  showkept =         0
% 0.70/1.08  showselected =     0
% 0.70/1.08  showdeleted =      0
% 0.70/1.08  showresimp =       1
% 0.70/1.08  showstatus =       2000
% 0.70/1.08  
% 0.70/1.08  prologoutput =     1
% 0.70/1.08  nrgoals =          5000000
% 0.70/1.08  totalproof =       1
% 0.70/1.08  
% 0.70/1.08  Symbols occurring in the translation:
% 0.70/1.08  
% 0.70/1.08  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.70/1.08  .  [1, 2]      (w:1, o:20, a:1, s:1, b:0), 
% 0.70/1.08  !  [4, 1]      (w:0, o:13, a:1, s:1, b:0), 
% 0.70/1.09  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.70/1.09  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.70/1.09  domain  [40, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.70/1.09  codomain  [41, 1]      (w:1, o:18, a:1, s:1, b:0), 
% 0.70/1.09  compose  [42, 2]      (w:1, o:45, a:1, s:1, b:0), 
% 0.70/1.09  a  [45, 0]      (w:1, o:12, a:1, s:1, b:0).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  Starting Search:
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  Bliksems!, er is een bewijs:
% 0.70/1.09  % SZS status Unsatisfiable
% 0.70/1.09  % SZS output start Refutation
% 0.70/1.09  
% 0.70/1.09  clause( 0, [ =( codomain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  .
% 0.70/1.09  clause( 1, [ =( domain( codomain( X ) ), codomain( X ) ) ] )
% 0.70/1.09  .
% 0.70/1.09  clause( 7, [ ~( =( domain( domain( a ) ), domain( a ) ) ) ] )
% 0.70/1.09  .
% 0.70/1.09  clause( 10, [ =( domain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  .
% 0.70/1.09  clause( 20, [] )
% 0.70/1.09  .
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  % SZS output end Refutation
% 0.70/1.09  found a proof!
% 0.70/1.09  
% 0.70/1.09  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09  
% 0.70/1.09  initialclauses(
% 0.70/1.09  [ clause( 22, [ =( codomain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  , clause( 23, [ =( domain( codomain( X ) ), codomain( X ) ) ] )
% 0.70/1.09  , clause( 24, [ =( compose( domain( X ), X ), X ) ] )
% 0.70/1.09  , clause( 25, [ =( compose( X, codomain( X ) ), X ) ] )
% 0.70/1.09  , clause( 26, [ ~( =( codomain( X ), domain( Y ) ) ), =( domain( compose( X
% 0.70/1.09    , Y ) ), domain( X ) ) ] )
% 0.70/1.09  , clause( 27, [ ~( =( codomain( X ), domain( Y ) ) ), =( codomain( compose( 
% 0.70/1.09    X, Y ) ), codomain( Y ) ) ] )
% 0.70/1.09  , clause( 28, [ ~( =( codomain( X ), domain( Y ) ) ), ~( =( codomain( Y ), 
% 0.70/1.09    domain( Z ) ) ), =( compose( X, compose( Y, Z ) ), compose( compose( X, Y
% 0.70/1.09     ), Z ) ) ] )
% 0.70/1.09  , clause( 29, [ ~( =( domain( domain( a ) ), domain( a ) ) ) ] )
% 0.70/1.09  ] ).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  subsumption(
% 0.70/1.09  clause( 0, [ =( codomain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  , clause( 22, [ =( codomain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  subsumption(
% 0.70/1.09  clause( 1, [ =( domain( codomain( X ) ), codomain( X ) ) ] )
% 0.70/1.09  , clause( 23, [ =( domain( codomain( X ) ), codomain( X ) ) ] )
% 0.70/1.09  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  subsumption(
% 0.70/1.09  clause( 7, [ ~( =( domain( domain( a ) ), domain( a ) ) ) ] )
% 0.70/1.09  , clause( 29, [ ~( =( domain( domain( a ) ), domain( a ) ) ) ] )
% 0.70/1.09  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  eqswap(
% 0.70/1.09  clause( 56, [ =( codomain( X ), domain( codomain( X ) ) ) ] )
% 0.70/1.09  , clause( 1, [ =( domain( codomain( X ) ), codomain( X ) ) ] )
% 0.70/1.09  , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  paramod(
% 0.70/1.09  clause( 64, [ =( codomain( domain( X ) ), domain( domain( X ) ) ) ] )
% 0.70/1.09  , clause( 0, [ =( codomain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  , 0, clause( 56, [ =( codomain( X ), domain( codomain( X ) ) ) ] )
% 0.70/1.09  , 0, 5, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, domain( 
% 0.70/1.09    X ) )] )).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  paramod(
% 0.70/1.09  clause( 65, [ =( domain( X ), domain( domain( X ) ) ) ] )
% 0.70/1.09  , clause( 0, [ =( codomain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  , 0, clause( 64, [ =( codomain( domain( X ) ), domain( domain( X ) ) ) ] )
% 0.70/1.09  , 0, 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.70/1.09    ).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  eqswap(
% 0.70/1.09  clause( 67, [ =( domain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  , clause( 65, [ =( domain( X ), domain( domain( X ) ) ) ] )
% 0.70/1.09  , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  subsumption(
% 0.70/1.09  clause( 10, [ =( domain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  , clause( 67, [ =( domain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  paramod(
% 0.70/1.09  clause( 71, [ ~( =( domain( a ), domain( a ) ) ) ] )
% 0.70/1.09  , clause( 10, [ =( domain( domain( X ) ), domain( X ) ) ] )
% 0.70/1.09  , 0, clause( 7, [ ~( =( domain( domain( a ) ), domain( a ) ) ) ] )
% 0.70/1.09  , 0, 2, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  eqrefl(
% 0.70/1.09  clause( 72, [] )
% 0.70/1.09  , clause( 71, [ ~( =( domain( a ), domain( a ) ) ) ] )
% 0.70/1.09  , 0, substitution( 0, [] )).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  subsumption(
% 0.70/1.09  clause( 20, [] )
% 0.70/1.09  , clause( 72, [] )
% 0.70/1.09  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  end.
% 0.70/1.09  
% 0.70/1.09  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.09  
% 0.70/1.09  Memory use:
% 0.70/1.09  
% 0.70/1.09  space for terms:        440
% 0.70/1.09  space for clauses:      2027
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  clauses generated:      52
% 0.70/1.09  clauses kept:           21
% 0.70/1.09  clauses selected:       7
% 0.70/1.09  clauses deleted:        1
% 0.70/1.09  clauses inuse deleted:  0
% 0.70/1.09  
% 0.70/1.09  subsentry:          410
% 0.70/1.09  literals s-matched: 144
% 0.70/1.09  literals matched:   144
% 0.70/1.09  full subsumption:   21
% 0.70/1.09  
% 0.70/1.09  checksum:           -2147325452
% 0.70/1.09  
% 0.70/1.09  
% 0.70/1.09  Bliksem ended
%------------------------------------------------------------------------------