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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : SYN044+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 : Thu Jul 21 02:46:59 EDT 2022

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

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