TSTP Solution File: GEO208+2 by Bliksem---1.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : GEO208+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n022.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 : Sat Jul 16 02:52:45 EDT 2022

% Result   : Theorem 0.73s 1.20s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO208+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.12/0.34  % Computer : n022.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 : Sat Jun 18 05:18:32 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.73/1.20  *** allocated 10000 integers for termspace/termends
% 0.73/1.20  *** allocated 10000 integers for clauses
% 0.73/1.20  *** allocated 10000 integers for justifications
% 0.73/1.20  Bliksem 1.12
% 0.73/1.20  
% 0.73/1.20  
% 0.73/1.20  Automatic Strategy Selection
% 0.73/1.20  
% 0.73/1.20  
% 0.73/1.20  Clauses:
% 0.73/1.20  
% 0.73/1.20  { ! distinct_points( X, X ) }.
% 0.73/1.20  { ! distinct_lines( X, X ) }.
% 0.73/1.20  { ! convergent_lines( X, X ) }.
% 0.73/1.20  { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.73/1.20     ) }.
% 0.73/1.20  { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.73/1.20     }.
% 0.73/1.20  { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.73/1.20    , Z ) }.
% 0.73/1.20  { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 0.73/1.20    , Y ) ), distinct_points( Z, X ) }.
% 0.73/1.20  { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 0.73/1.20    , Y ) ), distinct_points( Z, Y ) }.
% 0.73/1.20  { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, X ), 
% 0.73/1.20    distinct_points( Z, intersection_point( X, Y ) ) }.
% 0.73/1.20  { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, Y ), 
% 0.73/1.20    distinct_points( Z, intersection_point( X, Y ) ) }.
% 0.73/1.20  { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.73/1.20    ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ), 
% 0.73/1.20    apart_point_and_line( Y, T ) }.
% 0.73/1.20  { ! apart_point_and_line( X, Y ), distinct_points( X, Z ), 
% 0.73/1.20    apart_point_and_line( Z, Y ) }.
% 0.73/1.20  { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ), 
% 0.73/1.20    apart_point_and_line( X, Z ) }.
% 0.73/1.20  { ! convergent_lines( X, Y ), distinct_lines( X, Y ) }.
% 0.73/1.20  { ! convergent_lines( parallel_through_point( Y, X ), Y ) }.
% 0.73/1.20  { ! apart_point_and_line( X, parallel_through_point( Y, X ) ) }.
% 0.73/1.20  { ! distinct_lines( X, Y ), apart_point_and_line( Z, X ), 
% 0.73/1.20    apart_point_and_line( Z, Y ), convergent_lines( X, Y ) }.
% 0.73/1.20  { ! apart_point_and_line( skol3, skol1 ) }.
% 0.73/1.20  { ! apart_point_and_line( skol3, skol2 ) }.
% 0.73/1.20  { ! convergent_lines( skol1, skol2 ) }.
% 0.73/1.20  { distinct_lines( skol1, skol2 ) }.
% 0.73/1.20  
% 0.73/1.20  percentage equality = 0.000000, percentage horn = 0.666667
% 0.73/1.20  This a non-horn, non-equality problem
% 0.73/1.20  
% 0.73/1.20  
% 0.73/1.20  Options Used:
% 0.73/1.20  
% 0.73/1.20  useres =            1
% 0.73/1.20  useparamod =        0
% 0.73/1.20  useeqrefl =         0
% 0.73/1.20  useeqfact =         0
% 0.73/1.20  usefactor =         1
% 0.73/1.20  usesimpsplitting =  0
% 0.73/1.20  usesimpdemod =      0
% 0.73/1.20  usesimpres =        3
% 0.73/1.20  
% 0.73/1.20  resimpinuse      =  1000
% 0.73/1.20  resimpclauses =     20000
% 0.73/1.20  substype =          standard
% 0.73/1.20  backwardsubs =      1
% 0.73/1.20  selectoldest =      5
% 0.73/1.20  
% 0.73/1.20  litorderings [0] =  split
% 0.73/1.20  litorderings [1] =  liftord
% 0.73/1.20  
% 0.73/1.20  termordering =      none
% 0.73/1.20  
% 0.73/1.20  litapriori =        1
% 0.73/1.20  termapriori =       0
% 0.73/1.20  litaposteriori =    0
% 0.73/1.20  termaposteriori =   0
% 0.73/1.20  demodaposteriori =  0
% 0.73/1.20  ordereqreflfact =   0
% 0.73/1.20  
% 0.73/1.20  litselect =         none
% 0.73/1.20  
% 0.73/1.20  maxweight =         15
% 0.73/1.20  maxdepth =          30000
% 0.73/1.20  maxlength =         115
% 0.73/1.20  maxnrvars =         195
% 0.73/1.20  excuselevel =       1
% 0.73/1.20  increasemaxweight = 1
% 0.73/1.20  
% 0.73/1.20  maxselected =       10000000
% 0.73/1.20  maxnrclauses =      10000000
% 0.73/1.20  
% 0.73/1.20  showgenerated =    0
% 0.73/1.20  showkept =         0
% 0.73/1.20  showselected =     0
% 0.73/1.20  showdeleted =      0
% 0.73/1.20  showresimp =       1
% 0.73/1.20  showstatus =       2000
% 0.73/1.20  
% 0.73/1.20  prologoutput =     0
% 0.73/1.20  nrgoals =          5000000
% 0.73/1.20  totalproof =       1
% 0.73/1.20  
% 0.73/1.20  Symbols occurring in the translation:
% 0.73/1.20  
% 0.73/1.20  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.73/1.20  .  [1, 2]      (w:1, o:19, a:1, s:1, b:0), 
% 0.73/1.20  !  [4, 1]      (w:0, o:14, a:1, s:1, b:0), 
% 0.73/1.20  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.73/1.20  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.73/1.20  distinct_points  [36, 2]      (w:1, o:44, a:1, s:1, b:0), 
% 0.73/1.20  distinct_lines  [37, 2]      (w:1, o:45, a:1, s:1, b:0), 
% 0.73/1.20  convergent_lines  [38, 2]      (w:1, o:43, a:1, s:1, b:0), 
% 0.73/1.20  line_connecting  [41, 2]      (w:1, o:46, a:1, s:1, b:0), 
% 0.73/1.20  apart_point_and_line  [42, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.73/1.20  intersection_point  [43, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.73/1.20  parallel_through_point  [46, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.73/1.20  skol1  [47, 0]      (w:1, o:11, a:1, s:1, b:0), 
% 0.73/1.20  skol2  [48, 0]      (w:1, o:12, a:1, s:1, b:0), 
% 0.73/1.20  skol3  [49, 0]      (w:1, o:13, a:1, s:1, b:0).
% 0.73/1.20  
% 0.73/1.20  
% 0.73/1.20  Starting Search:
% 0.73/1.20  
% 0.73/1.20  *** allocated 15000 integers for clauses
% 0.73/1.20  *** allocated 22500 integers for clauses
% 0.73/1.20  *** allocated 33750 integers for clauses
% 0.73/1.20  *** allocated 15000 integers for termspace/termends
% 0.73/1.20  *** allocated 50625 integers for clauses
% 0.73/1.20  Resimplifying inuse:
% 0.73/1.20  Done
% 0.73/1.20  
% 0.73/1.20  
% 0.73/1.20  Bliksems!, er is een bewijs:
% 0.73/1.20  % SZS status Theorem
% 0.73/1.20  % SZS output start Refutation
% 0.73/1.20  
% 0.73/1.20  (16) {G0,W12,D2,L4,V3,M2} I { ! distinct_lines( X, Y ), convergent_lines( X
% 0.73/1.20    , Y ), apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ) }.
% 0.73/1.20  (17) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, skol1 ) }.
% 0.73/1.20  (18) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, skol2 ) }.
% 0.73/1.20  (19) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol2 ) }.
% 0.73/1.20  (20) {G0,W3,D2,L1,V0,M1} I { distinct_lines( skol1, skol2 ) }.
% 0.73/1.20  (206) {G1,W9,D2,L3,V1,M1} R(16,17) { convergent_lines( skol1, X ), ! 
% 0.73/1.20    distinct_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 0.73/1.20  (1091) {G2,W3,D2,L1,V0,M1} R(206,18);r(19) { ! distinct_lines( skol1, skol2
% 0.73/1.20     ) }.
% 0.73/1.20  (1092) {G3,W0,D0,L0,V0,M0} S(1091);r(20) {  }.
% 0.73/1.20  
% 0.73/1.20  
% 0.73/1.20  % SZS output end Refutation
% 0.73/1.20  found a proof!
% 0.73/1.20  
% 0.73/1.20  *** allocated 22500 integers for termspace/termends
% 0.73/1.20  
% 0.73/1.20  Unprocessed initial clauses:
% 0.73/1.20  
% 0.73/1.20  (1094) {G0,W3,D2,L1,V1,M1}  { ! distinct_points( X, X ) }.
% 0.73/1.20  (1095) {G0,W3,D2,L1,V1,M1}  { ! distinct_lines( X, X ) }.
% 0.73/1.20  (1096) {G0,W3,D2,L1,V1,M1}  { ! convergent_lines( X, X ) }.
% 0.73/1.20  (1097) {G0,W9,D2,L3,V3,M3}  { ! distinct_points( X, Y ), distinct_points( X
% 0.73/1.20    , Z ), distinct_points( Y, Z ) }.
% 0.73/1.20  (1098) {G0,W9,D2,L3,V3,M3}  { ! distinct_lines( X, Y ), distinct_lines( X, 
% 0.73/1.20    Z ), distinct_lines( Y, Z ) }.
% 0.73/1.20  (1099) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), convergent_lines
% 0.73/1.20    ( X, Z ), convergent_lines( Y, Z ) }.
% 0.73/1.20  (1100) {G0,W11,D3,L3,V3,M3}  { ! distinct_points( X, Y ), ! 
% 0.73/1.20    apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, X
% 0.73/1.20     ) }.
% 0.73/1.20  (1101) {G0,W11,D3,L3,V3,M3}  { ! distinct_points( X, Y ), ! 
% 0.73/1.20    apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, Y
% 0.73/1.20     ) }.
% 0.73/1.20  (1102) {G0,W11,D3,L3,V3,M3}  { ! convergent_lines( X, Y ), ! 
% 0.73/1.20    apart_point_and_line( Z, X ), distinct_points( Z, intersection_point( X, 
% 0.73/1.20    Y ) ) }.
% 0.73/1.20  (1103) {G0,W11,D3,L3,V3,M3}  { ! convergent_lines( X, Y ), ! 
% 0.73/1.20    apart_point_and_line( Z, Y ), distinct_points( Z, intersection_point( X, 
% 0.73/1.20    Y ) ) }.
% 0.73/1.20  (1104) {G0,W18,D2,L6,V4,M6}  { ! distinct_points( X, Y ), ! distinct_lines
% 0.73/1.20    ( Z, T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ), 
% 0.73/1.20    apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.73/1.20  (1105) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), 
% 0.73/1.20    distinct_points( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.73/1.20  (1106) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), 
% 0.73/1.20    distinct_lines( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.73/1.20  (1107) {G0,W6,D2,L2,V2,M2}  { ! convergent_lines( X, Y ), distinct_lines( X
% 0.73/1.20    , Y ) }.
% 0.73/1.20  (1108) {G0,W5,D3,L1,V2,M1}  { ! convergent_lines( parallel_through_point( Y
% 0.73/1.20    , X ), Y ) }.
% 0.73/1.20  (1109) {G0,W5,D3,L1,V2,M1}  { ! apart_point_and_line( X, 
% 0.73/1.20    parallel_through_point( Y, X ) ) }.
% 0.73/1.20  (1110) {G0,W12,D2,L4,V3,M4}  { ! distinct_lines( X, Y ), 
% 0.73/1.20    apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ), 
% 0.73/1.20    convergent_lines( X, Y ) }.
% 0.73/1.20  (1111) {G0,W3,D2,L1,V0,M1}  { ! apart_point_and_line( skol3, skol1 ) }.
% 0.73/1.20  (1112) {G0,W3,D2,L1,V0,M1}  { ! apart_point_and_line( skol3, skol2 ) }.
% 0.73/1.20  (1113) {G0,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol2 ) }.
% 0.73/1.20  (1114) {G0,W3,D2,L1,V0,M1}  { distinct_lines( skol1, skol2 ) }.
% 0.73/1.20  
% 0.73/1.20  
% 0.73/1.20  Total Proof:
% 0.73/1.20  
% 0.73/1.20  subsumption: (16) {G0,W12,D2,L4,V3,M2} I { ! distinct_lines( X, Y ), 
% 0.73/1.20    convergent_lines( X, Y ), apart_point_and_line( Z, X ), 
% 0.73/1.20    apart_point_and_line( Z, Y ) }.
% 0.73/1.20  parent0: (1110) {G0,W12,D2,L4,V3,M4}  { ! distinct_lines( X, Y ), 
% 0.73/1.20    apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ), 
% 0.73/1.20    convergent_lines( X, Y ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20     X := X
% 0.73/1.20     Y := Y
% 0.73/1.20     Z := Z
% 0.73/1.20  end
% 0.73/1.20  permutation0:
% 0.73/1.20     0 ==> 0
% 0.73/1.20     1 ==> 2
% 0.73/1.20     2 ==> 3
% 0.73/1.20     3 ==> 1
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  subsumption: (17) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, 
% 0.73/1.20    skol1 ) }.
% 0.73/1.20  parent0: (1111) {G0,W3,D2,L1,V0,M1}  { ! apart_point_and_line( skol3, skol1
% 0.73/1.20     ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  permutation0:
% 0.73/1.20     0 ==> 0
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  subsumption: (18) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, 
% 0.73/1.20    skol2 ) }.
% 0.73/1.20  parent0: (1112) {G0,W3,D2,L1,V0,M1}  { ! apart_point_and_line( skol3, skol2
% 0.73/1.20     ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  permutation0:
% 0.73/1.20     0 ==> 0
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  subsumption: (19) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol2
% 0.73/1.20     ) }.
% 0.73/1.20  parent0: (1113) {G0,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol2 )
% 0.73/1.20     }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  permutation0:
% 0.73/1.20     0 ==> 0
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  subsumption: (20) {G0,W3,D2,L1,V0,M1} I { distinct_lines( skol1, skol2 )
% 0.73/1.20     }.
% 0.73/1.20  parent0: (1114) {G0,W3,D2,L1,V0,M1}  { distinct_lines( skol1, skol2 ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  permutation0:
% 0.73/1.20     0 ==> 0
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  resolution: (1165) {G1,W9,D2,L3,V1,M3}  { ! distinct_lines( skol1, X ), 
% 0.73/1.20    convergent_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 0.73/1.20  parent0[0]: (17) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, 
% 0.73/1.20    skol1 ) }.
% 0.73/1.20  parent1[2]: (16) {G0,W12,D2,L4,V3,M2} I { ! distinct_lines( X, Y ), 
% 0.73/1.20    convergent_lines( X, Y ), apart_point_and_line( Z, X ), 
% 0.73/1.20    apart_point_and_line( Z, Y ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  substitution1:
% 0.73/1.20     X := skol1
% 0.73/1.20     Y := X
% 0.73/1.20     Z := skol3
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  subsumption: (206) {G1,W9,D2,L3,V1,M1} R(16,17) { convergent_lines( skol1, 
% 0.73/1.20    X ), ! distinct_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 0.73/1.20  parent0: (1165) {G1,W9,D2,L3,V1,M3}  { ! distinct_lines( skol1, X ), 
% 0.73/1.20    convergent_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20     X := X
% 0.73/1.20  end
% 0.73/1.20  permutation0:
% 0.73/1.20     0 ==> 1
% 0.73/1.20     1 ==> 0
% 0.73/1.20     2 ==> 2
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  resolution: (1167) {G1,W6,D2,L2,V0,M2}  { convergent_lines( skol1, skol2 )
% 0.73/1.20    , ! distinct_lines( skol1, skol2 ) }.
% 0.73/1.20  parent0[0]: (18) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, 
% 0.73/1.20    skol2 ) }.
% 0.73/1.20  parent1[2]: (206) {G1,W9,D2,L3,V1,M1} R(16,17) { convergent_lines( skol1, X
% 0.73/1.20     ), ! distinct_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  substitution1:
% 0.73/1.20     X := skol2
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  resolution: (1168) {G1,W3,D2,L1,V0,M1}  { ! distinct_lines( skol1, skol2 )
% 0.73/1.20     }.
% 0.73/1.20  parent0[0]: (19) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol2 )
% 0.73/1.20     }.
% 0.73/1.20  parent1[0]: (1167) {G1,W6,D2,L2,V0,M2}  { convergent_lines( skol1, skol2 )
% 0.73/1.20    , ! distinct_lines( skol1, skol2 ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  substitution1:
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  subsumption: (1091) {G2,W3,D2,L1,V0,M1} R(206,18);r(19) { ! distinct_lines
% 0.73/1.20    ( skol1, skol2 ) }.
% 0.73/1.20  parent0: (1168) {G1,W3,D2,L1,V0,M1}  { ! distinct_lines( skol1, skol2 ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  permutation0:
% 0.73/1.20     0 ==> 0
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  resolution: (1169) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.73/1.20  parent0[0]: (1091) {G2,W3,D2,L1,V0,M1} R(206,18);r(19) { ! distinct_lines( 
% 0.73/1.20    skol1, skol2 ) }.
% 0.73/1.20  parent1[0]: (20) {G0,W3,D2,L1,V0,M1} I { distinct_lines( skol1, skol2 ) }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  substitution1:
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  subsumption: (1092) {G3,W0,D0,L0,V0,M0} S(1091);r(20) {  }.
% 0.73/1.20  parent0: (1169) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.73/1.20  substitution0:
% 0.73/1.20  end
% 0.73/1.20  permutation0:
% 0.73/1.20  end
% 0.73/1.20  
% 0.73/1.20  Proof check complete!
% 0.73/1.20  
% 0.73/1.20  Memory use:
% 0.73/1.20  
% 0.73/1.20  space for terms:        14941
% 0.73/1.20  space for clauses:      40800
% 0.73/1.20  
% 0.73/1.20  
% 0.73/1.20  clauses generated:      9457
% 0.73/1.20  clauses kept:           1093
% 0.73/1.20  clauses selected:       173
% 0.73/1.20  clauses deleted:        1
% 0.73/1.20  clauses inuse deleted:  0
% 0.73/1.20  
% 0.73/1.20  subsentry:          170542
% 0.73/1.20  literals s-matched: 63524
% 0.73/1.20  literals matched:   63499
% 0.73/1.20  full subsumption:   44189
% 0.73/1.20  
% 0.73/1.20  checksum:           -651468180
% 0.73/1.20  
% 0.73/1.20  
% 0.73/1.20  Bliksem ended
%------------------------------------------------------------------------------