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

View Problem - Process Solution

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

% Computer : n016.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:46 EDT 2022

% Result   : Theorem 1.33s 1.70s
% Output   : Refutation 1.33s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO209+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : bliksem %s
% 0.14/0.34  % Computer : n016.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % DateTime : Fri Jun 17 17:53:21 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 1.33/1.70  *** allocated 10000 integers for termspace/termends
% 1.33/1.70  *** allocated 10000 integers for clauses
% 1.33/1.70  *** allocated 10000 integers for justifications
% 1.33/1.70  Bliksem 1.12
% 1.33/1.70  
% 1.33/1.70  
% 1.33/1.70  Automatic Strategy Selection
% 1.33/1.70  
% 1.33/1.70  
% 1.33/1.70  Clauses:
% 1.33/1.70  
% 1.33/1.70  { ! distinct_points( X, X ) }.
% 1.33/1.70  { ! distinct_lines( X, X ) }.
% 1.33/1.70  { ! convergent_lines( X, X ) }.
% 1.33/1.70  { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 1.33/1.70     ) }.
% 1.33/1.70  { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 1.33/1.70     }.
% 1.33/1.70  { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 1.33/1.70    , Z ) }.
% 1.33/1.70  { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 1.33/1.70    , Y ) ), distinct_points( Z, X ) }.
% 1.33/1.70  { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 1.33/1.70    , Y ) ), distinct_points( Z, Y ) }.
% 1.33/1.70  { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, X ), 
% 1.33/1.70    distinct_points( Z, intersection_point( X, Y ) ) }.
% 1.33/1.70  { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, Y ), 
% 1.33/1.70    distinct_points( Z, intersection_point( X, Y ) ) }.
% 1.33/1.70  { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 1.33/1.70    ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ), 
% 1.33/1.70    apart_point_and_line( Y, T ) }.
% 1.33/1.70  { ! apart_point_and_line( X, Y ), distinct_points( X, Z ), 
% 1.33/1.70    apart_point_and_line( Z, Y ) }.
% 1.33/1.70  { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ), 
% 1.33/1.70    apart_point_and_line( X, Z ) }.
% 1.33/1.70  { ! convergent_lines( X, Y ), distinct_lines( X, Y ) }.
% 1.33/1.70  { ! convergent_lines( parallel_through_point( Y, X ), Y ) }.
% 1.33/1.70  { ! apart_point_and_line( X, parallel_through_point( Y, X ) ) }.
% 1.33/1.70  { ! distinct_lines( X, Y ), apart_point_and_line( Z, X ), 
% 1.33/1.70    apart_point_and_line( Z, Y ), convergent_lines( X, Y ) }.
% 1.33/1.70  { apart_point_and_line( skol3, skol4 ) }.
% 1.33/1.70  { ! apart_point_and_line( skol3, skol1 ) }.
% 1.33/1.70  { ! apart_point_and_line( skol3, skol2 ) }.
% 1.33/1.70  { ! convergent_lines( skol1, skol4 ) }.
% 1.33/1.70  { ! convergent_lines( skol2, skol4 ) }.
% 1.33/1.70  { distinct_lines( skol1, skol2 ) }.
% 1.33/1.70  
% 1.33/1.70  percentage equality = 0.000000, percentage horn = 0.695652
% 1.33/1.70  This a non-horn, non-equality problem
% 1.33/1.70  
% 1.33/1.70  
% 1.33/1.70  Options Used:
% 1.33/1.70  
% 1.33/1.70  useres =            1
% 1.33/1.70  useparamod =        0
% 1.33/1.70  useeqrefl =         0
% 1.33/1.70  useeqfact =         0
% 1.33/1.70  usefactor =         1
% 1.33/1.70  usesimpsplitting =  0
% 1.33/1.70  usesimpdemod =      0
% 1.33/1.70  usesimpres =        3
% 1.33/1.70  
% 1.33/1.70  resimpinuse      =  1000
% 1.33/1.70  resimpclauses =     20000
% 1.33/1.70  substype =          standard
% 1.33/1.70  backwardsubs =      1
% 1.33/1.70  selectoldest =      5
% 1.33/1.70  
% 1.33/1.70  litorderings [0] =  split
% 1.33/1.70  litorderings [1] =  liftord
% 1.33/1.70  
% 1.33/1.70  termordering =      none
% 1.33/1.70  
% 1.33/1.70  litapriori =        1
% 1.33/1.70  termapriori =       0
% 1.33/1.70  litaposteriori =    0
% 1.33/1.70  termaposteriori =   0
% 1.33/1.70  demodaposteriori =  0
% 1.33/1.70  ordereqreflfact =   0
% 1.33/1.70  
% 1.33/1.70  litselect =         none
% 1.33/1.70  
% 1.33/1.70  maxweight =         15
% 1.33/1.70  maxdepth =          30000
% 1.33/1.70  maxlength =         115
% 1.33/1.70  maxnrvars =         195
% 1.33/1.70  excuselevel =       1
% 1.33/1.70  increasemaxweight = 1
% 1.33/1.70  
% 1.33/1.70  maxselected =       10000000
% 1.33/1.70  maxnrclauses =      10000000
% 1.33/1.70  
% 1.33/1.70  showgenerated =    0
% 1.33/1.70  showkept =         0
% 1.33/1.70  showselected =     0
% 1.33/1.70  showdeleted =      0
% 1.33/1.70  showresimp =       1
% 1.33/1.70  showstatus =       2000
% 1.33/1.70  
% 1.33/1.70  prologoutput =     0
% 1.33/1.70  nrgoals =          5000000
% 1.33/1.70  totalproof =       1
% 1.33/1.70  
% 1.33/1.70  Symbols occurring in the translation:
% 1.33/1.70  
% 1.33/1.70  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 1.33/1.70  .  [1, 2]      (w:1, o:24, a:1, s:1, b:0), 
% 1.33/1.70  !  [4, 1]      (w:0, o:19, a:1, s:1, b:0), 
% 1.33/1.70  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 1.33/1.70  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 1.33/1.70  distinct_points  [36, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 1.33/1.70  distinct_lines  [37, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 1.33/1.70  convergent_lines  [38, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 1.33/1.70  line_connecting  [41, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 1.33/1.70  apart_point_and_line  [42, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 1.33/1.70  intersection_point  [43, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 1.33/1.70  parallel_through_point  [46, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 1.33/1.70  skol1  [51, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 1.33/1.70  skol2  [52, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 1.33/1.70  skol3  [53, 0]      (w:1, o:17, a:1, s:1, b:0), 
% 1.33/1.70  skol4  [54, 0]      (w:1, o:18, a:1, s:1, b:0).
% 1.33/1.70  
% 1.33/1.70  
% 1.33/1.70  Starting Search:
% 1.33/1.70  
% 1.33/1.70  *** allocated 15000 integers for clauses
% 1.33/1.70  *** allocated 22500 integers for clauses
% 1.33/1.70  *** allocated 33750 integers for clauses
% 1.33/1.70  *** allocated 15000 integers for termspace/termends
% 1.33/1.70  *** allocated 50625 integers for clauses
% 1.33/1.70  Resimplifying inuse:
% 1.33/1.70  Done
% 1.33/1.70  
% 1.33/1.70  *** allocated 22500 integers for termspace/termends
% 1.33/1.70  *** allocated 75937 integers for clauses
% 1.33/1.70  *** allocated 33750 integers for termspace/termends
% 1.33/1.70  
% 1.33/1.70  Intermediate Status:
% 1.33/1.70  Generated:    14211
% 1.33/1.70  Kept:         2001
% 1.33/1.70  Inuse:        246
% 1.33/1.70  Deleted:      0
% 1.33/1.70  Deletedinuse: 0
% 1.33/1.70  
% 1.33/1.70  Resimplifying inuse:
% 1.33/1.70  Done
% 1.33/1.70  
% 1.33/1.70  *** allocated 113905 integers for clauses
% 1.33/1.70  *** allocated 50625 integers for termspace/termends
% 1.33/1.70  
% 1.33/1.70  Bliksems!, er is een bewijs:
% 1.33/1.70  % SZS status Theorem
% 1.33/1.70  % SZS output start Refutation
% 1.33/1.70  
% 1.33/1.70  (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), convergent_lines( Y, 
% 1.33/1.70    Z ), ! convergent_lines( X, Y ) }.
% 1.33/1.70  (16) {G0,W12,D2,L4,V3,M2} I { ! distinct_lines( X, Y ), convergent_lines( X
% 1.33/1.70    , Y ), apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ) }.
% 1.33/1.70  (18) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, skol1 ) }.
% 1.33/1.70  (19) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, skol2 ) }.
% 1.33/1.70  (20) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol4 ) }.
% 1.33/1.70  (21) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol2, skol4 ) }.
% 1.33/1.70  (22) {G0,W3,D2,L1,V0,M1} I { distinct_lines( skol1, skol2 ) }.
% 1.33/1.70  (37) {G1,W6,D2,L2,V1,M2} R(5,20) { ! convergent_lines( skol1, X ), 
% 1.33/1.70    convergent_lines( X, skol4 ) }.
% 1.33/1.70  (99) {G2,W3,D2,L1,V0,M1} R(37,21) { ! convergent_lines( skol1, skol2 ) }.
% 1.33/1.70  (207) {G1,W9,D2,L3,V1,M1} R(16,18) { convergent_lines( skol1, X ), ! 
% 1.33/1.70    distinct_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 1.33/1.70  (2621) {G3,W3,D2,L1,V0,M1} R(207,19);r(99) { ! distinct_lines( skol1, skol2
% 1.33/1.70     ) }.
% 1.33/1.70  (2622) {G4,W0,D0,L0,V0,M0} S(2621);r(22) {  }.
% 1.33/1.70  
% 1.33/1.70  
% 1.33/1.70  % SZS output end Refutation
% 1.33/1.70  found a proof!
% 1.33/1.70  
% 1.33/1.70  
% 1.33/1.70  Unprocessed initial clauses:
% 1.33/1.70  
% 1.33/1.70  (2624) {G0,W3,D2,L1,V1,M1}  { ! distinct_points( X, X ) }.
% 1.33/1.70  (2625) {G0,W3,D2,L1,V1,M1}  { ! distinct_lines( X, X ) }.
% 1.33/1.70  (2626) {G0,W3,D2,L1,V1,M1}  { ! convergent_lines( X, X ) }.
% 1.33/1.70  (2627) {G0,W9,D2,L3,V3,M3}  { ! distinct_points( X, Y ), distinct_points( X
% 1.33/1.70    , Z ), distinct_points( Y, Z ) }.
% 1.33/1.70  (2628) {G0,W9,D2,L3,V3,M3}  { ! distinct_lines( X, Y ), distinct_lines( X, 
% 1.33/1.70    Z ), distinct_lines( Y, Z ) }.
% 1.33/1.70  (2629) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), convergent_lines
% 1.33/1.70    ( X, Z ), convergent_lines( Y, Z ) }.
% 1.33/1.70  (2630) {G0,W11,D3,L3,V3,M3}  { ! distinct_points( X, Y ), ! 
% 1.33/1.70    apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, X
% 1.33/1.70     ) }.
% 1.33/1.70  (2631) {G0,W11,D3,L3,V3,M3}  { ! distinct_points( X, Y ), ! 
% 1.33/1.70    apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, Y
% 1.33/1.70     ) }.
% 1.33/1.70  (2632) {G0,W11,D3,L3,V3,M3}  { ! convergent_lines( X, Y ), ! 
% 1.33/1.70    apart_point_and_line( Z, X ), distinct_points( Z, intersection_point( X, 
% 1.33/1.70    Y ) ) }.
% 1.33/1.70  (2633) {G0,W11,D3,L3,V3,M3}  { ! convergent_lines( X, Y ), ! 
% 1.33/1.70    apart_point_and_line( Z, Y ), distinct_points( Z, intersection_point( X, 
% 1.33/1.70    Y ) ) }.
% 1.33/1.70  (2634) {G0,W18,D2,L6,V4,M6}  { ! distinct_points( X, Y ), ! distinct_lines
% 1.33/1.70    ( Z, T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ), 
% 1.33/1.70    apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 1.33/1.70  (2635) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), 
% 1.33/1.70    distinct_points( X, Z ), apart_point_and_line( Z, Y ) }.
% 1.33/1.70  (2636) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), 
% 1.33/1.70    distinct_lines( Y, Z ), apart_point_and_line( X, Z ) }.
% 1.33/1.70  (2637) {G0,W6,D2,L2,V2,M2}  { ! convergent_lines( X, Y ), distinct_lines( X
% 1.33/1.70    , Y ) }.
% 1.33/1.70  (2638) {G0,W5,D3,L1,V2,M1}  { ! convergent_lines( parallel_through_point( Y
% 1.33/1.70    , X ), Y ) }.
% 1.33/1.70  (2639) {G0,W5,D3,L1,V2,M1}  { ! apart_point_and_line( X, 
% 1.33/1.70    parallel_through_point( Y, X ) ) }.
% 1.33/1.70  (2640) {G0,W12,D2,L4,V3,M4}  { ! distinct_lines( X, Y ), 
% 1.33/1.70    apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ), 
% 1.33/1.70    convergent_lines( X, Y ) }.
% 1.33/1.70  (2641) {G0,W3,D2,L1,V0,M1}  { apart_point_and_line( skol3, skol4 ) }.
% 1.33/1.70  (2642) {G0,W3,D2,L1,V0,M1}  { ! apart_point_and_line( skol3, skol1 ) }.
% 1.33/1.70  (2643) {G0,W3,D2,L1,V0,M1}  { ! apart_point_and_line( skol3, skol2 ) }.
% 1.33/1.70  (2644) {G0,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol4 ) }.
% 1.33/1.70  (2645) {G0,W3,D2,L1,V0,M1}  { ! convergent_lines( skol2, skol4 ) }.
% 1.33/1.70  (2646) {G0,W3,D2,L1,V0,M1}  { distinct_lines( skol1, skol2 ) }.
% 1.33/1.70  
% 1.33/1.70  
% 1.33/1.70  Total Proof:
% 1.33/1.70  
% 1.33/1.70  subsumption: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), 
% 1.33/1.70    convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 1.33/1.70  parent0: (2629) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), 
% 1.33/1.70    convergent_lines( X, Z ), convergent_lines( Y, Z ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70     X := X
% 1.33/1.70     Y := Y
% 1.33/1.70     Z := Z
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 2
% 1.33/1.70     1 ==> 0
% 1.33/1.70     2 ==> 1
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (16) {G0,W12,D2,L4,V3,M2} I { ! distinct_lines( X, Y ), 
% 1.33/1.70    convergent_lines( X, Y ), apart_point_and_line( Z, X ), 
% 1.33/1.70    apart_point_and_line( Z, Y ) }.
% 1.33/1.70  parent0: (2640) {G0,W12,D2,L4,V3,M4}  { ! distinct_lines( X, Y ), 
% 1.33/1.70    apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ), 
% 1.33/1.70    convergent_lines( X, Y ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70     X := X
% 1.33/1.70     Y := Y
% 1.33/1.70     Z := Z
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 0
% 1.33/1.70     1 ==> 2
% 1.33/1.70     2 ==> 3
% 1.33/1.70     3 ==> 1
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (18) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, 
% 1.33/1.70    skol1 ) }.
% 1.33/1.70  parent0: (2642) {G0,W3,D2,L1,V0,M1}  { ! apart_point_and_line( skol3, skol1
% 1.33/1.70     ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 0
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (19) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, 
% 1.33/1.70    skol2 ) }.
% 1.33/1.70  parent0: (2643) {G0,W3,D2,L1,V0,M1}  { ! apart_point_and_line( skol3, skol2
% 1.33/1.70     ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 0
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (20) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol4
% 1.33/1.70     ) }.
% 1.33/1.70  parent0: (2644) {G0,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol4 )
% 1.33/1.70     }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 0
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (21) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol2, skol4
% 1.33/1.70     ) }.
% 1.33/1.70  parent0: (2645) {G0,W3,D2,L1,V0,M1}  { ! convergent_lines( skol2, skol4 )
% 1.33/1.70     }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 0
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (22) {G0,W3,D2,L1,V0,M1} I { distinct_lines( skol1, skol2 )
% 1.33/1.70     }.
% 1.33/1.70  parent0: (2646) {G0,W3,D2,L1,V0,M1}  { distinct_lines( skol1, skol2 ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 0
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  resolution: (2710) {G1,W6,D2,L2,V1,M2}  { convergent_lines( X, skol4 ), ! 
% 1.33/1.70    convergent_lines( skol1, X ) }.
% 1.33/1.70  parent0[0]: (20) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol4 )
% 1.33/1.70     }.
% 1.33/1.70  parent1[0]: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), 
% 1.33/1.70    convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  substitution1:
% 1.33/1.70     X := skol1
% 1.33/1.70     Y := X
% 1.33/1.70     Z := skol4
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (37) {G1,W6,D2,L2,V1,M2} R(5,20) { ! convergent_lines( skol1, 
% 1.33/1.70    X ), convergent_lines( X, skol4 ) }.
% 1.33/1.70  parent0: (2710) {G1,W6,D2,L2,V1,M2}  { convergent_lines( X, skol4 ), ! 
% 1.33/1.70    convergent_lines( skol1, X ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70     X := X
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 1
% 1.33/1.70     1 ==> 0
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  resolution: (2712) {G1,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol2
% 1.33/1.70     ) }.
% 1.33/1.70  parent0[0]: (21) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol2, skol4 )
% 1.33/1.70     }.
% 1.33/1.70  parent1[1]: (37) {G1,W6,D2,L2,V1,M2} R(5,20) { ! convergent_lines( skol1, X
% 1.33/1.70     ), convergent_lines( X, skol4 ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  substitution1:
% 1.33/1.70     X := skol2
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (99) {G2,W3,D2,L1,V0,M1} R(37,21) { ! convergent_lines( skol1
% 1.33/1.70    , skol2 ) }.
% 1.33/1.70  parent0: (2712) {G1,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol2 )
% 1.33/1.70     }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 0
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  resolution: (2713) {G1,W9,D2,L3,V1,M3}  { ! distinct_lines( skol1, X ), 
% 1.33/1.70    convergent_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 1.33/1.70  parent0[0]: (18) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, 
% 1.33/1.70    skol1 ) }.
% 1.33/1.70  parent1[2]: (16) {G0,W12,D2,L4,V3,M2} I { ! distinct_lines( X, Y ), 
% 1.33/1.70    convergent_lines( X, Y ), apart_point_and_line( Z, X ), 
% 1.33/1.70    apart_point_and_line( Z, Y ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  substitution1:
% 1.33/1.70     X := skol1
% 1.33/1.70     Y := X
% 1.33/1.70     Z := skol3
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (207) {G1,W9,D2,L3,V1,M1} R(16,18) { convergent_lines( skol1, 
% 1.33/1.70    X ), ! distinct_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 1.33/1.70  parent0: (2713) {G1,W9,D2,L3,V1,M3}  { ! distinct_lines( skol1, X ), 
% 1.33/1.70    convergent_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70     X := X
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 1
% 1.33/1.70     1 ==> 0
% 1.33/1.70     2 ==> 2
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  resolution: (2715) {G1,W6,D2,L2,V0,M2}  { convergent_lines( skol1, skol2 )
% 1.33/1.70    , ! distinct_lines( skol1, skol2 ) }.
% 1.33/1.70  parent0[0]: (19) {G0,W3,D2,L1,V0,M1} I { ! apart_point_and_line( skol3, 
% 1.33/1.70    skol2 ) }.
% 1.33/1.70  parent1[2]: (207) {G1,W9,D2,L3,V1,M1} R(16,18) { convergent_lines( skol1, X
% 1.33/1.70     ), ! distinct_lines( skol1, X ), apart_point_and_line( skol3, X ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  substitution1:
% 1.33/1.70     X := skol2
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  resolution: (2716) {G2,W3,D2,L1,V0,M1}  { ! distinct_lines( skol1, skol2 )
% 1.33/1.70     }.
% 1.33/1.70  parent0[0]: (99) {G2,W3,D2,L1,V0,M1} R(37,21) { ! convergent_lines( skol1, 
% 1.33/1.70    skol2 ) }.
% 1.33/1.70  parent1[0]: (2715) {G1,W6,D2,L2,V0,M2}  { convergent_lines( skol1, skol2 )
% 1.33/1.70    , ! distinct_lines( skol1, skol2 ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  substitution1:
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (2621) {G3,W3,D2,L1,V0,M1} R(207,19);r(99) { ! distinct_lines
% 1.33/1.70    ( skol1, skol2 ) }.
% 1.33/1.70  parent0: (2716) {G2,W3,D2,L1,V0,M1}  { ! distinct_lines( skol1, skol2 ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70     0 ==> 0
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  resolution: (2717) {G1,W0,D0,L0,V0,M0}  {  }.
% 1.33/1.70  parent0[0]: (2621) {G3,W3,D2,L1,V0,M1} R(207,19);r(99) { ! distinct_lines( 
% 1.33/1.70    skol1, skol2 ) }.
% 1.33/1.70  parent1[0]: (22) {G0,W3,D2,L1,V0,M1} I { distinct_lines( skol1, skol2 ) }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  substitution1:
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  subsumption: (2622) {G4,W0,D0,L0,V0,M0} S(2621);r(22) {  }.
% 1.33/1.70  parent0: (2717) {G1,W0,D0,L0,V0,M0}  {  }.
% 1.33/1.70  substitution0:
% 1.33/1.70  end
% 1.33/1.70  permutation0:
% 1.33/1.70  end
% 1.33/1.70  
% 1.33/1.70  Proof check complete!
% 1.33/1.70  
% 1.33/1.70  Memory use:
% 1.33/1.70  
% 1.33/1.70  space for terms:        34494
% 1.33/1.70  space for clauses:      95953
% 1.33/1.70  
% 1.33/1.70  
% 1.33/1.70  clauses generated:      44424
% 1.33/1.70  clauses kept:           2623
% 1.33/1.70  clauses selected:       409
% 1.33/1.70  clauses deleted:        1
% 1.33/1.70  clauses inuse deleted:  0
% 1.33/1.70  
% 1.33/1.70  subsentry:          973952
% 1.33/1.70  literals s-matched: 260130
% 1.33/1.70  literals matched:   260100
% 1.33/1.70  full subsumption:   167618
% 1.33/1.70  
% 1.33/1.70  checksum:           1821646088
% 1.33/1.70  
% 1.33/1.70  
% 1.33/1.70  Bliksem ended
%------------------------------------------------------------------------------