↑ Up

Bliksem---1.12.THM-Ref.s

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

% Computer : n004.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 19:01:30 EDT 2022

% Result   : Theorem 0.70s 1.08s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.13/0.34  % Computer : n004.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 : Fri Jul  8 15:34:37 EDT 2022
% 0.13/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  
% 0.70/1.08  Clauses:
% 0.70/1.08  
% 0.70/1.08  { join( X, Y ) = join( Y, X ) }.
% 0.70/1.08  { join( X, join( Y, Z ) ) = join( join( X, Y ), Z ) }.
% 0.70/1.08  { X = join( complement( join( complement( X ), complement( Y ) ) ), 
% 0.70/1.08    complement( join( complement( X ), Y ) ) ) }.
% 0.70/1.08  { meet( X, Y ) = complement( join( complement( X ), complement( Y ) ) ) }.
% 0.70/1.08  { composition( X, composition( Y, Z ) ) = composition( composition( X, Y )
% 0.70/1.08    , Z ) }.
% 0.70/1.08  { composition( X, one ) = X }.
% 0.70/1.08  { composition( join( X, Y ), Z ) = join( composition( X, Z ), composition( 
% 0.70/1.08    Y, Z ) ) }.
% 0.70/1.08  { converse( converse( X ) ) = X }.
% 0.70/1.08  { converse( join( X, Y ) ) = join( converse( X ), converse( Y ) ) }.
% 0.70/1.08  { converse( composition( X, Y ) ) = composition( converse( Y ), converse( X
% 0.70/1.08     ) ) }.
% 0.70/1.08  { join( composition( converse( X ), complement( composition( X, Y ) ) ), 
% 0.70/1.08    complement( Y ) ) = complement( Y ) }.
% 0.70/1.08  { top = join( X, complement( X ) ) }.
% 0.70/1.08  { zero = meet( X, complement( X ) ) }.
% 0.70/1.08  { join( skol1, skol2 ) = skol2 }.
% 0.70/1.08  { join( skol3, skol2 ) = skol2 }.
% 0.70/1.08  { ! join( join( skol1, skol3 ), skol2 ) = skol2 }.
% 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 =     0
% 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:22, a:1, s:1, b:0), 
% 0.70/1.08  !  [4, 1]      (w:0, o:15, a:1, s:1, b:0), 
% 0.70/1.08  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.70/1.08  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.70/1.08  join  [37, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.70/1.08  complement  [39, 1]      (w:1, o:20, a:1, s:1, b:0), 
% 0.70/1.08  meet  [40, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.70/1.08  composition  [41, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.70/1.08  one  [42, 0]      (w:1, o:9, a:1, s:1, b:0), 
% 0.70/1.08  converse  [43, 1]      (w:1, o:21, a:1, s:1, b:0), 
% 0.70/1.08  top  [44, 0]      (w:1, o:13, a:1, s:1, b:0), 
% 0.70/1.08  zero  [45, 0]      (w:1, o:14, a:1, s:1, b:0), 
% 0.70/1.08  skol1  [46, 0]      (w:1, o:10, a:1, s:1, b:1), 
% 0.70/1.08  skol2  [47, 0]      (w:1, o:11, a:1, s:1, b:1), 
% 0.70/1.08  skol3  [48, 0]      (w:1, o:12, a:1, s:1, b:1).
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  Starting Search:
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  Bliksems!, er is een bewijs:
% 0.70/1.08  % SZS status Theorem
% 0.70/1.08  % SZS output start Refutation
% 0.70/1.08  
% 0.70/1.08  (1) {G0,W11,D4,L1,V3,M1} I { join( X, join( Y, Z ) ) ==> join( join( X, Y )
% 0.70/1.08    , Z ) }.
% 0.70/1.08  (13) {G0,W5,D3,L1,V0,M1} I { join( skol1, skol2 ) ==> skol2 }.
% 0.70/1.08  (14) {G0,W5,D3,L1,V0,M1} I { join( skol3, skol2 ) ==> skol2 }.
% 0.70/1.08  (15) {G0,W7,D4,L1,V0,M1} I { ! join( join( skol1, skol3 ), skol2 ) ==> 
% 0.70/1.08    skol2 }.
% 0.70/1.08  (27) {G1,W9,D4,L1,V1,M1} P(14,1) { join( join( X, skol3 ), skol2 ) ==> join
% 0.70/1.08    ( X, skol2 ) }.
% 0.70/1.08  (28) {G2,W0,D0,L0,V0,M0} S(15);d(27);d(13);q {  }.
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  % SZS output end Refutation
% 0.70/1.08  found a proof!
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  Unprocessed initial clauses:
% 0.70/1.08  
% 0.70/1.08  (30) {G0,W7,D3,L1,V2,M1}  { join( X, Y ) = join( Y, X ) }.
% 0.70/1.08  (31) {G0,W11,D4,L1,V3,M1}  { join( X, join( Y, Z ) ) = join( join( X, Y ), 
% 0.70/1.08    Z ) }.
% 0.70/1.08  (32) {G0,W14,D6,L1,V2,M1}  { X = join( complement( join( complement( X ), 
% 0.70/1.08    complement( Y ) ) ), complement( join( complement( X ), Y ) ) ) }.
% 0.70/1.08  (33) {G0,W10,D5,L1,V2,M1}  { meet( X, Y ) = complement( join( complement( X
% 0.70/1.08     ), complement( Y ) ) ) }.
% 0.70/1.08  (34) {G0,W11,D4,L1,V3,M1}  { composition( X, composition( Y, Z ) ) = 
% 0.70/1.08    composition( composition( X, Y ), Z ) }.
% 0.70/1.08  (35) {G0,W5,D3,L1,V1,M1}  { composition( X, one ) = X }.
% 0.70/1.08  (36) {G0,W13,D4,L1,V3,M1}  { composition( join( X, Y ), Z ) = join( 
% 0.70/1.08    composition( X, Z ), composition( Y, Z ) ) }.
% 0.70/1.08  (37) {G0,W5,D4,L1,V1,M1}  { converse( converse( X ) ) = X }.
% 0.70/1.08  (38) {G0,W10,D4,L1,V2,M1}  { converse( join( X, Y ) ) = join( converse( X )
% 0.70/1.08    , converse( Y ) ) }.
% 0.70/1.08  (39) {G0,W10,D4,L1,V2,M1}  { converse( composition( X, Y ) ) = composition
% 0.70/1.08    ( converse( Y ), converse( X ) ) }.
% 0.70/1.08  (40) {G0,W13,D6,L1,V2,M1}  { join( composition( converse( X ), complement( 
% 0.70/1.08    composition( X, Y ) ) ), complement( Y ) ) = complement( Y ) }.
% 0.70/1.08  (41) {G0,W6,D4,L1,V1,M1}  { top = join( X, complement( X ) ) }.
% 0.70/1.08  (42) {G0,W6,D4,L1,V1,M1}  { zero = meet( X, complement( X ) ) }.
% 0.70/1.08  (43) {G0,W5,D3,L1,V0,M1}  { join( skol1, skol2 ) = skol2 }.
% 0.70/1.08  (44) {G0,W5,D3,L1,V0,M1}  { join( skol3, skol2 ) = skol2 }.
% 0.70/1.08  (45) {G0,W7,D4,L1,V0,M1}  { ! join( join( skol1, skol3 ), skol2 ) = skol2
% 0.70/1.08     }.
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  Total Proof:
% 0.70/1.08  
% 0.70/1.08  subsumption: (1) {G0,W11,D4,L1,V3,M1} I { join( X, join( Y, Z ) ) ==> join
% 0.70/1.08    ( join( X, Y ), Z ) }.
% 0.70/1.08  parent0: (31) {G0,W11,D4,L1,V3,M1}  { join( X, join( Y, Z ) ) = join( join
% 0.70/1.08    ( X, Y ), Z ) }.
% 0.70/1.08  substitution0:
% 0.70/1.08     X := X
% 0.70/1.08     Y := Y
% 0.70/1.08     Z := Z
% 0.70/1.08  end
% 0.70/1.08  permutation0:
% 0.70/1.08     0 ==> 0
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  subsumption: (13) {G0,W5,D3,L1,V0,M1} I { join( skol1, skol2 ) ==> skol2
% 0.70/1.08     }.
% 0.70/1.08  parent0: (43) {G0,W5,D3,L1,V0,M1}  { join( skol1, skol2 ) = skol2 }.
% 0.70/1.08  substitution0:
% 0.70/1.08  end
% 0.70/1.08  permutation0:
% 0.70/1.08     0 ==> 0
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  subsumption: (14) {G0,W5,D3,L1,V0,M1} I { join( skol3, skol2 ) ==> skol2
% 0.70/1.08     }.
% 0.70/1.08  parent0: (44) {G0,W5,D3,L1,V0,M1}  { join( skol3, skol2 ) = skol2 }.
% 0.70/1.08  substitution0:
% 0.70/1.08  end
% 0.70/1.08  permutation0:
% 0.70/1.08     0 ==> 0
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  subsumption: (15) {G0,W7,D4,L1,V0,M1} I { ! join( join( skol1, skol3 ), 
% 0.70/1.08    skol2 ) ==> skol2 }.
% 0.70/1.08  parent0: (45) {G0,W7,D4,L1,V0,M1}  { ! join( join( skol1, skol3 ), skol2 ) 
% 0.70/1.08    = skol2 }.
% 0.70/1.08  substitution0:
% 0.70/1.08  end
% 0.70/1.08  permutation0:
% 0.70/1.08     0 ==> 0
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  eqswap: (90) {G0,W11,D4,L1,V3,M1}  { join( join( X, Y ), Z ) ==> join( X, 
% 0.70/1.08    join( Y, Z ) ) }.
% 0.70/1.08  parent0[0]: (1) {G0,W11,D4,L1,V3,M1} I { join( X, join( Y, Z ) ) ==> join( 
% 0.70/1.08    join( X, Y ), Z ) }.
% 0.70/1.08  substitution0:
% 0.70/1.08     X := X
% 0.70/1.08     Y := Y
% 0.70/1.08     Z := Z
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  paramod: (92) {G1,W9,D4,L1,V1,M1}  { join( join( X, skol3 ), skol2 ) ==> 
% 0.70/1.08    join( X, skol2 ) }.
% 0.70/1.08  parent0[0]: (14) {G0,W5,D3,L1,V0,M1} I { join( skol3, skol2 ) ==> skol2 }.
% 0.70/1.08  parent1[0; 8]: (90) {G0,W11,D4,L1,V3,M1}  { join( join( X, Y ), Z ) ==> 
% 0.70/1.08    join( X, join( Y, Z ) ) }.
% 0.70/1.08  substitution0:
% 0.70/1.08  end
% 0.70/1.08  substitution1:
% 0.70/1.08     X := X
% 0.70/1.08     Y := skol3
% 0.70/1.08     Z := skol2
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  subsumption: (27) {G1,W9,D4,L1,V1,M1} P(14,1) { join( join( X, skol3 ), 
% 0.70/1.08    skol2 ) ==> join( X, skol2 ) }.
% 0.70/1.08  parent0: (92) {G1,W9,D4,L1,V1,M1}  { join( join( X, skol3 ), skol2 ) ==> 
% 0.70/1.08    join( X, skol2 ) }.
% 0.70/1.08  substitution0:
% 0.70/1.08     X := X
% 0.70/1.08  end
% 0.70/1.08  permutation0:
% 0.70/1.08     0 ==> 0
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  paramod: (98) {G1,W5,D3,L1,V0,M1}  { ! join( skol1, skol2 ) ==> skol2 }.
% 0.70/1.08  parent0[0]: (27) {G1,W9,D4,L1,V1,M1} P(14,1) { join( join( X, skol3 ), 
% 0.70/1.08    skol2 ) ==> join( X, skol2 ) }.
% 0.70/1.08  parent1[0; 2]: (15) {G0,W7,D4,L1,V0,M1} I { ! join( join( skol1, skol3 ), 
% 0.70/1.08    skol2 ) ==> skol2 }.
% 0.70/1.08  substitution0:
% 0.70/1.08     X := skol1
% 0.70/1.08  end
% 0.70/1.08  substitution1:
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  paramod: (99) {G1,W3,D2,L1,V0,M1}  { ! skol2 ==> skol2 }.
% 0.70/1.08  parent0[0]: (13) {G0,W5,D3,L1,V0,M1} I { join( skol1, skol2 ) ==> skol2 }.
% 0.70/1.08  parent1[0; 2]: (98) {G1,W5,D3,L1,V0,M1}  { ! join( skol1, skol2 ) ==> skol2
% 0.70/1.08     }.
% 0.70/1.08  substitution0:
% 0.70/1.08  end
% 0.70/1.08  substitution1:
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  eqrefl: (100) {G0,W0,D0,L0,V0,M0}  {  }.
% 0.70/1.08  parent0[0]: (99) {G1,W3,D2,L1,V0,M1}  { ! skol2 ==> skol2 }.
% 0.70/1.08  substitution0:
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  subsumption: (28) {G2,W0,D0,L0,V0,M0} S(15);d(27);d(13);q {  }.
% 0.70/1.08  parent0: (100) {G0,W0,D0,L0,V0,M0}  {  }.
% 0.70/1.08  substitution0:
% 0.70/1.08  end
% 0.70/1.08  permutation0:
% 0.70/1.08  end
% 0.70/1.08  
% 0.70/1.08  Proof check complete!
% 0.70/1.08  
% 0.70/1.08  Memory use:
% 0.70/1.08  
% 0.70/1.08  space for terms:        612
% 0.70/1.08  space for clauses:      2902
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  clauses generated:      87
% 0.70/1.08  clauses kept:           29
% 0.70/1.08  clauses selected:       11
% 0.70/1.08  clauses deleted:        1
% 0.70/1.08  clauses inuse deleted:  0
% 0.70/1.08  
% 0.70/1.08  subsentry:          296
% 0.70/1.08  literals s-matched: 148
% 0.70/1.08  literals matched:   148
% 0.70/1.08  full subsumption:   0
% 0.70/1.08  
% 0.70/1.08  checksum:           -218139949
% 0.70/1.08  
% 0.70/1.08  
% 0.70/1.08  Bliksem ended
%------------------------------------------------------------------------------