↑ Up

Bliksem---1.12.THM-Ref.s

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

% Computer : n009.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 21 02:47:01 EDT 2022

% Result   : Theorem 0.45s 1.05s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN046+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14  % Command  : bliksem %s
% 0.13/0.35  % Computer : n009.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % DateTime : Mon Jul 11 22:49:37 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.45/1.05  *** allocated 10000 integers for termspace/termends
% 0.45/1.05  *** allocated 10000 integers for clauses
% 0.45/1.05  *** allocated 10000 integers for justifications
% 0.45/1.05  Bliksem 1.12
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  Automatic Strategy Selection
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  Clauses:
% 0.45/1.05  
% 0.45/1.05  { alpha2, ! p, q }.
% 0.45/1.05  { alpha2, ! alpha1 }.
% 0.45/1.05  { ! alpha2, alpha1 }.
% 0.45/1.05  { ! alpha2, p }.
% 0.45/1.05  { ! alpha2, ! q }.
% 0.45/1.05  { ! alpha1, ! p, q, alpha2 }.
% 0.45/1.05  { ! alpha1, ! p, q }.
% 0.45/1.05  { p, alpha1 }.
% 0.45/1.05  { ! q, alpha1 }.
% 0.45/1.05  
% 0.45/1.05  percentage equality = 0.000000, percentage horn = 0.750000
% 0.45/1.05  This a non-horn, non-equality problem
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  Options Used:
% 0.45/1.05  
% 0.45/1.05  useres =            1
% 0.45/1.05  useparamod =        0
% 0.45/1.05  useeqrefl =         0
% 0.45/1.05  useeqfact =         0
% 0.45/1.05  usefactor =         1
% 0.45/1.05  usesimpsplitting =  0
% 0.45/1.05  usesimpdemod =      0
% 0.45/1.05  usesimpres =        3
% 0.45/1.05  
% 0.45/1.05  resimpinuse      =  1000
% 0.45/1.05  resimpclauses =     20000
% 0.45/1.05  substype =          standard
% 0.45/1.05  backwardsubs =      1
% 0.45/1.05  selectoldest =      5
% 0.45/1.05  
% 0.45/1.05  litorderings [0] =  split
% 0.45/1.05  litorderings [1] =  liftord
% 0.45/1.05  
% 0.45/1.05  termordering =      none
% 0.45/1.05  
% 0.45/1.05  litapriori =        1
% 0.45/1.05  termapriori =       0
% 0.45/1.05  litaposteriori =    0
% 0.45/1.05  termaposteriori =   0
% 0.45/1.05  demodaposteriori =  0
% 0.45/1.05  ordereqreflfact =   0
% 0.45/1.05  
% 0.45/1.05  litselect =         none
% 0.45/1.05  
% 0.45/1.05  maxweight =         15
% 0.45/1.05  maxdepth =          30000
% 0.45/1.05  maxlength =         115
% 0.45/1.05  maxnrvars =         195
% 0.45/1.05  excuselevel =       1
% 0.45/1.05  increasemaxweight = 1
% 0.45/1.05  
% 0.45/1.05  maxselected =       10000000
% 0.45/1.05  maxnrclauses =      10000000
% 0.45/1.05  
% 0.45/1.05  showgenerated =    0
% 0.45/1.05  showkept =         0
% 0.45/1.05  showselected =     0
% 0.45/1.05  showdeleted =      0
% 0.45/1.05  showresimp =       1
% 0.45/1.05  showstatus =       2000
% 0.45/1.05  
% 0.45/1.05  prologoutput =     0
% 0.45/1.05  nrgoals =          5000000
% 0.45/1.05  totalproof =       1
% 0.45/1.05  
% 0.45/1.05  Symbols occurring in the translation:
% 0.45/1.05  
% 0.45/1.05  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.45/1.05  .  [1, 2]      (w:1, o:15, a:1, s:1, b:0), 
% 0.45/1.05  !  [4, 1]      (w:0, o:10, a:1, s:1, b:0), 
% 0.45/1.05  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.45/1.05  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.45/1.05  p  [35, 0]      (w:1, o:6, a:1, s:1, b:0), 
% 0.45/1.05  q  [36, 0]      (w:1, o:7, a:1, s:1, b:0), 
% 0.45/1.05  alpha1  [37, 0]      (w:1, o:8, a:1, s:1, b:0), 
% 0.45/1.05  alpha2  [38, 0]      (w:1, o:9, a:1, s:1, b:0).
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  Starting Search:
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  Bliksems!, er is een bewijs:
% 0.45/1.05  % SZS status Theorem
% 0.45/1.05  % SZS output start Refutation
% 0.45/1.05  
% 0.45/1.05  (0) {G0,W3,D1,L3,V0,M1} I { alpha2, q, ! p }.
% 0.45/1.05  (1) {G0,W2,D1,L2,V0,M1} I { alpha2, ! alpha1 }.
% 0.45/1.05  (2) {G0,W2,D1,L2,V0,M1} I { alpha1, ! alpha2 }.
% 0.45/1.05  (3) {G0,W2,D1,L2,V0,M1} I { p, ! alpha2 }.
% 0.45/1.05  (4) {G0,W2,D1,L2,V0,M1} I { ! q, ! alpha2 }.
% 0.45/1.05  (5) {G0,W3,D1,L3,V0,M1} I { ! p, q, ! alpha1 }.
% 0.45/1.05  (6) {G0,W2,D1,L2,V0,M1} I { p, alpha1 }.
% 0.45/1.05  (7) {G0,W2,D1,L2,V0,M1} I { alpha1, ! q }.
% 0.45/1.05  (8) {G1,W1,D1,L1,V0,M1} R(1,6);r(3) { p }.
% 0.45/1.05  (9) {G2,W2,D1,L2,V0,M1} R(8,0) { q, alpha2 }.
% 0.45/1.05  (10) {G3,W1,D1,L1,V0,M1} R(9,2);r(7) { alpha1 }.
% 0.45/1.05  (11) {G4,W1,D1,L1,V0,M1} R(10,1) { alpha2 }.
% 0.45/1.05  (12) {G4,W1,D1,L1,V0,M1} S(5);r(8);r(10) { q }.
% 0.45/1.05  (13) {G5,W0,D0,L0,V0,M0} R(11,4);r(12) {  }.
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  % SZS output end Refutation
% 0.45/1.05  found a proof!
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  Unprocessed initial clauses:
% 0.45/1.05  
% 0.45/1.05  (15) {G0,W3,D1,L3,V0,M3}  { alpha2, ! p, q }.
% 0.45/1.05  (16) {G0,W2,D1,L2,V0,M2}  { alpha2, ! alpha1 }.
% 0.45/1.05  (17) {G0,W2,D1,L2,V0,M2}  { ! alpha2, alpha1 }.
% 0.45/1.05  (18) {G0,W2,D1,L2,V0,M2}  { ! alpha2, p }.
% 0.45/1.05  (19) {G0,W2,D1,L2,V0,M2}  { ! alpha2, ! q }.
% 0.45/1.05  (20) {G0,W4,D1,L4,V0,M4}  { ! alpha1, ! p, q, alpha2 }.
% 0.45/1.05  (21) {G0,W3,D1,L3,V0,M3}  { ! alpha1, ! p, q }.
% 0.45/1.05  (22) {G0,W2,D1,L2,V0,M2}  { p, alpha1 }.
% 0.45/1.05  (23) {G0,W2,D1,L2,V0,M2}  { ! q, alpha1 }.
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  Total Proof:
% 0.45/1.05  
% 0.45/1.05  subsumption: (0) {G0,W3,D1,L3,V0,M1} I { alpha2, q, ! p }.
% 0.45/1.05  parent0: (15) {G0,W3,D1,L3,V0,M3}  { alpha2, ! p, q }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 0
% 0.45/1.05     1 ==> 2
% 0.45/1.05     2 ==> 1
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (1) {G0,W2,D1,L2,V0,M1} I { alpha2, ! alpha1 }.
% 0.45/1.05  parent0: (16) {G0,W2,D1,L2,V0,M2}  { alpha2, ! alpha1 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 0
% 0.45/1.05     1 ==> 1
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (2) {G0,W2,D1,L2,V0,M1} I { alpha1, ! alpha2 }.
% 0.45/1.05  parent0: (17) {G0,W2,D1,L2,V0,M2}  { ! alpha2, alpha1 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 1
% 0.45/1.05     1 ==> 0
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (3) {G0,W2,D1,L2,V0,M1} I { p, ! alpha2 }.
% 0.45/1.05  parent0: (18) {G0,W2,D1,L2,V0,M2}  { ! alpha2, p }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 1
% 0.45/1.05     1 ==> 0
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (4) {G0,W2,D1,L2,V0,M1} I { ! q, ! alpha2 }.
% 0.45/1.05  parent0: (19) {G0,W2,D1,L2,V0,M2}  { ! alpha2, ! q }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 1
% 0.45/1.05     1 ==> 0
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (5) {G0,W3,D1,L3,V0,M1} I { ! p, q, ! alpha1 }.
% 0.45/1.05  parent0: (21) {G0,W3,D1,L3,V0,M3}  { ! alpha1, ! p, q }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 2
% 0.45/1.05     1 ==> 0
% 0.45/1.05     2 ==> 1
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (6) {G0,W2,D1,L2,V0,M1} I { p, alpha1 }.
% 0.45/1.05  parent0: (22) {G0,W2,D1,L2,V0,M2}  { p, alpha1 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 0
% 0.45/1.05     1 ==> 1
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (7) {G0,W2,D1,L2,V0,M1} I { alpha1, ! q }.
% 0.45/1.05  parent0: (23) {G0,W2,D1,L2,V0,M2}  { ! q, alpha1 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 1
% 0.45/1.05     1 ==> 0
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (24) {G1,W2,D1,L2,V0,M2}  { alpha2, p }.
% 0.45/1.05  parent0[1]: (1) {G0,W2,D1,L2,V0,M1} I { alpha2, ! alpha1 }.
% 0.45/1.05  parent1[1]: (6) {G0,W2,D1,L2,V0,M1} I { p, alpha1 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (25) {G1,W2,D1,L2,V0,M2}  { p, p }.
% 0.45/1.05  parent0[1]: (3) {G0,W2,D1,L2,V0,M1} I { p, ! alpha2 }.
% 0.45/1.05  parent1[0]: (24) {G1,W2,D1,L2,V0,M2}  { alpha2, p }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  factor: (26) {G1,W1,D1,L1,V0,M1}  { p }.
% 0.45/1.05  parent0[0, 1]: (25) {G1,W2,D1,L2,V0,M2}  { p, p }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (8) {G1,W1,D1,L1,V0,M1} R(1,6);r(3) { p }.
% 0.45/1.05  parent0: (26) {G1,W1,D1,L1,V0,M1}  { p }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 0
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (27) {G1,W2,D1,L2,V0,M2}  { alpha2, q }.
% 0.45/1.05  parent0[2]: (0) {G0,W3,D1,L3,V0,M1} I { alpha2, q, ! p }.
% 0.45/1.05  parent1[0]: (8) {G1,W1,D1,L1,V0,M1} R(1,6);r(3) { p }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (9) {G2,W2,D1,L2,V0,M1} R(8,0) { q, alpha2 }.
% 0.45/1.05  parent0: (27) {G1,W2,D1,L2,V0,M2}  { alpha2, q }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 1
% 0.45/1.05     1 ==> 0
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (28) {G1,W2,D1,L2,V0,M2}  { alpha1, q }.
% 0.45/1.05  parent0[1]: (2) {G0,W2,D1,L2,V0,M1} I { alpha1, ! alpha2 }.
% 0.45/1.05  parent1[1]: (9) {G2,W2,D1,L2,V0,M1} R(8,0) { q, alpha2 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (29) {G1,W2,D1,L2,V0,M2}  { alpha1, alpha1 }.
% 0.45/1.05  parent0[1]: (7) {G0,W2,D1,L2,V0,M1} I { alpha1, ! q }.
% 0.45/1.05  parent1[1]: (28) {G1,W2,D1,L2,V0,M2}  { alpha1, q }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  factor: (30) {G1,W1,D1,L1,V0,M1}  { alpha1 }.
% 0.45/1.05  parent0[0, 1]: (29) {G1,W2,D1,L2,V0,M2}  { alpha1, alpha1 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (10) {G3,W1,D1,L1,V0,M1} R(9,2);r(7) { alpha1 }.
% 0.45/1.05  parent0: (30) {G1,W1,D1,L1,V0,M1}  { alpha1 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 0
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (31) {G1,W1,D1,L1,V0,M1}  { alpha2 }.
% 0.45/1.05  parent0[1]: (1) {G0,W2,D1,L2,V0,M1} I { alpha2, ! alpha1 }.
% 0.45/1.05  parent1[0]: (10) {G3,W1,D1,L1,V0,M1} R(9,2);r(7) { alpha1 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (11) {G4,W1,D1,L1,V0,M1} R(10,1) { alpha2 }.
% 0.45/1.05  parent0: (31) {G1,W1,D1,L1,V0,M1}  { alpha2 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 0
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (32) {G1,W2,D1,L2,V0,M2}  { q, ! alpha1 }.
% 0.45/1.05  parent0[0]: (5) {G0,W3,D1,L3,V0,M1} I { ! p, q, ! alpha1 }.
% 0.45/1.05  parent1[0]: (8) {G1,W1,D1,L1,V0,M1} R(1,6);r(3) { p }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (33) {G2,W1,D1,L1,V0,M1}  { q }.
% 0.45/1.05  parent0[1]: (32) {G1,W2,D1,L2,V0,M2}  { q, ! alpha1 }.
% 0.45/1.05  parent1[0]: (10) {G3,W1,D1,L1,V0,M1} R(9,2);r(7) { alpha1 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (12) {G4,W1,D1,L1,V0,M1} S(5);r(8);r(10) { q }.
% 0.45/1.05  parent0: (33) {G2,W1,D1,L1,V0,M1}  { q }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05     0 ==> 0
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (34) {G1,W1,D1,L1,V0,M1}  { ! q }.
% 0.45/1.05  parent0[1]: (4) {G0,W2,D1,L2,V0,M1} I { ! q, ! alpha2 }.
% 0.45/1.05  parent1[0]: (11) {G4,W1,D1,L1,V0,M1} R(10,1) { alpha2 }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  resolution: (35) {G2,W0,D0,L0,V0,M0}  {  }.
% 0.45/1.05  parent0[0]: (34) {G1,W1,D1,L1,V0,M1}  { ! q }.
% 0.45/1.05  parent1[0]: (12) {G4,W1,D1,L1,V0,M1} S(5);r(8);r(10) { q }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  substitution1:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  subsumption: (13) {G5,W0,D0,L0,V0,M0} R(11,4);r(12) {  }.
% 0.45/1.05  parent0: (35) {G2,W0,D0,L0,V0,M0}  {  }.
% 0.45/1.05  substitution0:
% 0.45/1.05  end
% 0.45/1.05  permutation0:
% 0.45/1.05  end
% 0.45/1.05  
% 0.45/1.05  Proof check complete!
% 0.45/1.05  
% 0.45/1.05  Memory use:
% 0.45/1.05  
% 0.45/1.05  space for terms:        110
% 0.45/1.05  space for clauses:      578
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  clauses generated:      20
% 0.45/1.05  clauses kept:           14
% 0.45/1.05  clauses selected:       12
% 0.45/1.05  clauses deleted:        1
% 0.45/1.05  clauses inuse deleted:  0
% 0.45/1.05  
% 0.45/1.05  subsentry:          5
% 0.45/1.05  literals s-matched: 5
% 0.45/1.05  literals matched:   5
% 0.45/1.05  full subsumption:   0
% 0.45/1.05  
% 0.45/1.05  checksum:           1222
% 0.45/1.05  
% 0.45/1.05  
% 0.45/1.05  Bliksem ended
%------------------------------------------------------------------------------