TSTP Solution File: LCL181+1 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : LCL181+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n013.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 : Sun Jul 17 07:51:18 EDT 2022

% Result   : Theorem 0.44s 1.07s
% Output   : Refutation 0.44s
% Verified : 
% SZS Type : -

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