↑ Up

Bliksem---1.12.UNS-Ref.s

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

% Computer : n027.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:15 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CAT019-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.12/0.33  % Computer : n027.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 : Sun May 29 20:36:15 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.72/1.13  *** allocated 10000 integers for termspace/termends
% 0.72/1.13  *** allocated 10000 integers for clauses
% 0.72/1.13  *** allocated 10000 integers for justifications
% 0.72/1.13  Bliksem 1.12
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  Automatic Strategy Selection
% 0.72/1.13  
% 0.72/1.13  Clauses:
% 0.72/1.13  [
% 0.72/1.13     [ =( codomain( domain( X ) ), domain( X ) ) ],
% 0.72/1.13     [ =( domain( codomain( X ) ), codomain( X ) ) ],
% 0.72/1.13     [ =( compose( domain( X ), X ), X ) ],
% 0.72/1.13     [ =( compose( X, codomain( X ) ), X ) ],
% 0.72/1.13     [ ~( =( codomain( X ), domain( Y ) ) ), =( domain( compose( X, Y ) ), 
% 0.72/1.13    domain( X ) ) ],
% 0.72/1.13     [ ~( =( codomain( X ), domain( Y ) ) ), =( codomain( compose( X, Y ) ), 
% 0.72/1.13    codomain( Y ) ) ],
% 0.72/1.13     [ ~( =( codomain( X ), domain( Y ) ) ), ~( =( codomain( Y ), domain( Z )
% 0.72/1.13     ) ), =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.72/1.13    ,
% 0.72/1.13     [ ~( =( c2, X ) ), =( c1, X ) ],
% 0.72/1.13     [ =( c2, X ), ~( =( c1, X ) ) ],
% 0.72/1.13     [ ~( =( c2, c1 ) ) ]
% 0.72/1.13  ] .
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  percentage equality = 1.000000, percentage horn = 1.000000
% 0.72/1.13  This is a pure equality problem
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  Options Used:
% 0.72/1.13  
% 0.72/1.13  useres =            1
% 0.72/1.13  useparamod =        1
% 0.72/1.13  useeqrefl =         1
% 0.72/1.13  useeqfact =         1
% 0.72/1.13  usefactor =         1
% 0.72/1.13  usesimpsplitting =  0
% 0.72/1.13  usesimpdemod =      5
% 0.72/1.13  usesimpres =        3
% 0.72/1.13  
% 0.72/1.13  resimpinuse      =  1000
% 0.72/1.13  resimpclauses =     20000
% 0.72/1.13  substype =          eqrewr
% 0.72/1.13  backwardsubs =      1
% 0.72/1.13  selectoldest =      5
% 0.72/1.13  
% 0.72/1.13  litorderings [0] =  split
% 0.72/1.13  litorderings [1] =  extend the termordering, first sorting on arguments
% 0.72/1.13  
% 0.72/1.13  termordering =      kbo
% 0.72/1.13  
% 0.72/1.13  litapriori =        0
% 0.72/1.13  termapriori =       1
% 0.72/1.13  litaposteriori =    0
% 0.72/1.13  termaposteriori =   0
% 0.72/1.13  demodaposteriori =  0
% 0.72/1.13  ordereqreflfact =   0
% 0.72/1.13  
% 0.72/1.13  litselect =         negord
% 0.72/1.13  
% 0.72/1.13  maxweight =         15
% 0.72/1.13  maxdepth =          30000
% 0.72/1.13  maxlength =         115
% 0.72/1.13  maxnrvars =         195
% 0.72/1.13  excuselevel =       1
% 0.72/1.13  increasemaxweight = 1
% 0.72/1.13  
% 0.72/1.13  maxselected =       10000000
% 0.72/1.13  maxnrclauses =      10000000
% 0.72/1.13  
% 0.72/1.13  showgenerated =    0
% 0.72/1.13  showkept =         0
% 0.72/1.13  showselected =     0
% 0.72/1.13  showdeleted =      0
% 0.72/1.13  showresimp =       1
% 0.72/1.13  showstatus =       2000
% 0.72/1.13  
% 0.72/1.13  prologoutput =     1
% 0.72/1.13  nrgoals =          5000000
% 0.72/1.13  totalproof =       1
% 0.72/1.13  
% 0.72/1.13  Symbols occurring in the translation:
% 0.72/1.13  
% 0.72/1.13  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.72/1.13  .  [1, 2]      (w:1, o:21, a:1, s:1, b:0), 
% 0.72/1.13  !  [4, 1]      (w:0, o:14, a:1, s:1, b:0), 
% 0.72/1.13  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.72/1.13  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.72/1.13  domain  [40, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.72/1.13  codomain  [41, 1]      (w:1, o:19, a:1, s:1, b:0), 
% 0.72/1.13  compose  [42, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.72/1.13  c2  [45, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.72/1.13  c1  [46, 0]      (w:1, o:12, a:1, s:1, b:0).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  Starting Search:
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  Bliksems!, er is een bewijs:
% 0.72/1.13  % SZS status Unsatisfiable
% 0.72/1.13  % SZS output start Refutation
% 0.72/1.13  
% 0.72/1.13  clause( 7, [ ~( =( c2, X ) ), =( c1, X ) ] )
% 0.72/1.13  .
% 0.72/1.13  clause( 9, [ ~( =( c2, c1 ) ) ] )
% 0.72/1.13  .
% 0.72/1.13  clause( 11, [ =( c2, c1 ) ] )
% 0.72/1.13  .
% 0.72/1.13  clause( 12, [] )
% 0.72/1.13  .
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  % SZS output end Refutation
% 0.72/1.13  found a proof!
% 0.72/1.13  
% 0.72/1.13  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.13  
% 0.72/1.13  initialclauses(
% 0.72/1.13  [ clause( 14, [ =( codomain( domain( X ) ), domain( X ) ) ] )
% 0.72/1.13  , clause( 15, [ =( domain( codomain( X ) ), codomain( X ) ) ] )
% 0.72/1.13  , clause( 16, [ =( compose( domain( X ), X ), X ) ] )
% 0.72/1.13  , clause( 17, [ =( compose( X, codomain( X ) ), X ) ] )
% 0.72/1.13  , clause( 18, [ ~( =( codomain( X ), domain( Y ) ) ), =( domain( compose( X
% 0.72/1.13    , Y ) ), domain( X ) ) ] )
% 0.72/1.13  , clause( 19, [ ~( =( codomain( X ), domain( Y ) ) ), =( codomain( compose( 
% 0.72/1.13    X, Y ) ), codomain( Y ) ) ] )
% 0.72/1.13  , clause( 20, [ ~( =( codomain( X ), domain( Y ) ) ), ~( =( codomain( Y ), 
% 0.72/1.13    domain( Z ) ) ), =( compose( X, compose( Y, Z ) ), compose( compose( X, Y
% 0.72/1.13     ), Z ) ) ] )
% 0.72/1.13  , clause( 21, [ ~( =( c2, X ) ), =( c1, X ) ] )
% 0.72/1.13  , clause( 22, [ =( c2, X ), ~( =( c1, X ) ) ] )
% 0.72/1.13  , clause( 23, [ ~( =( c2, c1 ) ) ] )
% 0.72/1.13  ] ).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  subsumption(
% 0.72/1.13  clause( 7, [ ~( =( c2, X ) ), =( c1, X ) ] )
% 0.72/1.13  , clause( 21, [ ~( =( c2, X ) ), =( c1, X ) ] )
% 0.72/1.13  , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 
% 0.72/1.13    1 )] ) ).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  subsumption(
% 0.72/1.13  clause( 9, [ ~( =( c2, c1 ) ) ] )
% 0.72/1.13  , clause( 23, [ ~( =( c2, c1 ) ) ] )
% 0.72/1.13  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  eqswap(
% 0.72/1.13  clause( 76, [ ~( =( X, c2 ) ), =( c1, X ) ] )
% 0.72/1.13  , clause( 7, [ ~( =( c2, X ) ), =( c1, X ) ] )
% 0.72/1.13  , 0, substitution( 0, [ :=( X, X )] )).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  eqrefl(
% 0.72/1.13  clause( 79, [ =( c1, c2 ) ] )
% 0.72/1.13  , clause( 76, [ ~( =( X, c2 ) ), =( c1, X ) ] )
% 0.72/1.13  , 0, substitution( 0, [ :=( X, c2 )] )).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  eqswap(
% 0.72/1.13  clause( 80, [ =( c2, c1 ) ] )
% 0.72/1.13  , clause( 79, [ =( c1, c2 ) ] )
% 0.72/1.13  , 0, substitution( 0, [] )).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  subsumption(
% 0.72/1.13  clause( 11, [ =( c2, c1 ) ] )
% 0.72/1.13  , clause( 80, [ =( c2, c1 ) ] )
% 0.72/1.13  , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  paramod(
% 0.72/1.13  clause( 83, [ ~( =( c1, c1 ) ) ] )
% 0.72/1.13  , clause( 11, [ =( c2, c1 ) ] )
% 0.72/1.13  , 0, clause( 9, [ ~( =( c2, c1 ) ) ] )
% 0.72/1.13  , 0, 2, substitution( 0, [] ), substitution( 1, [] )).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  eqrefl(
% 0.72/1.13  clause( 84, [] )
% 0.72/1.13  , clause( 83, [ ~( =( c1, c1 ) ) ] )
% 0.72/1.13  , 0, substitution( 0, [] )).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  subsumption(
% 0.72/1.13  clause( 12, [] )
% 0.72/1.13  , clause( 84, [] )
% 0.72/1.13  , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  end.
% 0.72/1.13  
% 0.72/1.13  % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.72/1.13  
% 0.72/1.13  Memory use:
% 0.72/1.13  
% 0.72/1.13  space for terms:        352
% 0.72/1.13  space for clauses:      1118
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  clauses generated:      14
% 0.72/1.13  clauses kept:           13
% 0.72/1.13  clauses selected:       0
% 0.72/1.13  clauses deleted:        1
% 0.72/1.13  clauses inuse deleted:  0
% 0.72/1.13  
% 0.72/1.13  subsentry:          775
% 0.72/1.13  literals s-matched: 280
% 0.72/1.13  literals matched:   280
% 0.72/1.13  full subsumption:   42
% 0.72/1.13  
% 0.72/1.13  checksum:           166487
% 0.72/1.13  
% 0.72/1.13  
% 0.72/1.13  Bliksem ended
%------------------------------------------------------------------------------