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

View Problem - Process Solution

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

% Computer : n005.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:53:00 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO225+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : bliksem %s
% 0.14/0.35  % Computer : n005.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % DateTime : Sat Jun 18 05:10:38 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.74/1.11  *** allocated 10000 integers for termspace/termends
% 0.74/1.11  *** allocated 10000 integers for clauses
% 0.74/1.11  *** allocated 10000 integers for justifications
% 0.74/1.11  Bliksem 1.12
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  Automatic Strategy Selection
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  Clauses:
% 0.74/1.11  
% 0.74/1.11  { ! distinct_points( X, X ) }.
% 0.74/1.11  { ! distinct_lines( X, X ) }.
% 0.74/1.11  { ! convergent_lines( X, X ) }.
% 0.74/1.11  { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.74/1.11     ) }.
% 0.74/1.11  { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.74/1.11     }.
% 0.74/1.11  { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.74/1.11    , Z ) }.
% 0.74/1.11  { ! distinct_points( X, Y ), ! apart_point_and_line( X, line_connecting( X
% 0.74/1.11    , Y ) ) }.
% 0.74/1.11  { ! distinct_points( X, Y ), ! apart_point_and_line( Y, line_connecting( X
% 0.74/1.11    , Y ) ) }.
% 0.74/1.11  { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.74/1.11    , Y ), X ) }.
% 0.74/1.11  { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.74/1.11    , Y ), Y ) }.
% 0.74/1.11  { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.74/1.11    ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ), 
% 0.74/1.11    apart_point_and_line( Y, T ) }.
% 0.74/1.11  { ! apart_point_and_line( X, Y ), distinct_points( X, Z ), 
% 0.74/1.11    apart_point_and_line( Z, Y ) }.
% 0.74/1.11  { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ), 
% 0.74/1.11    apart_point_and_line( X, Z ) }.
% 0.74/1.11  { ! convergent_lines( X, Y ), distinct_lines( Y, Z ), convergent_lines( X, 
% 0.74/1.11    Z ) }.
% 0.74/1.11  { ! point( X ), ! point( Y ), ! distinct_points( X, Y ), line( 
% 0.74/1.11    line_connecting( X, Y ) ) }.
% 0.74/1.11  { ! line( X ), ! line( Y ), ! convergent_lines( X, Y ), point( 
% 0.74/1.11    intersection_point( X, Y ) ) }.
% 0.74/1.11  { ! line( X ), ! point( Y ), line( parallel_through_point( X, Y ) ) }.
% 0.74/1.11  { ! line( X ), ! point( Y ), line( orthogonal_through_point( X, Y ) ) }.
% 0.74/1.11  { point( skol1 ) }.
% 0.74/1.11  { point( skol2 ) }.
% 0.74/1.11  { distinct_points( skol1, skol2 ) }.
% 0.74/1.11  { line( X ) }.
% 0.74/1.11  { apart_point_and_line( skol1, X ), apart_point_and_line( skol2, X ) }.
% 0.74/1.11  
% 0.74/1.11  percentage equality = 0.000000, percentage horn = 0.652174
% 0.74/1.11  This a non-horn, non-equality problem
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  Options Used:
% 0.74/1.11  
% 0.74/1.11  useres =            1
% 0.74/1.11  useparamod =        0
% 0.74/1.11  useeqrefl =         0
% 0.74/1.11  useeqfact =         0
% 0.74/1.11  usefactor =         1
% 0.74/1.11  usesimpsplitting =  0
% 0.74/1.11  usesimpdemod =      0
% 0.74/1.11  usesimpres =        3
% 0.74/1.11  
% 0.74/1.11  resimpinuse      =  1000
% 0.74/1.11  resimpclauses =     20000
% 0.74/1.11  substype =          standard
% 0.74/1.11  backwardsubs =      1
% 0.74/1.11  selectoldest =      5
% 0.74/1.11  
% 0.74/1.11  litorderings [0] =  split
% 0.74/1.11  litorderings [1] =  liftord
% 0.74/1.11  
% 0.74/1.11  termordering =      none
% 0.74/1.11  
% 0.74/1.11  litapriori =        1
% 0.74/1.11  termapriori =       0
% 0.74/1.11  litaposteriori =    0
% 0.74/1.11  termaposteriori =   0
% 0.74/1.11  demodaposteriori =  0
% 0.74/1.11  ordereqreflfact =   0
% 0.74/1.11  
% 0.74/1.11  litselect =         none
% 0.74/1.11  
% 0.74/1.11  maxweight =         15
% 0.74/1.11  maxdepth =          30000
% 0.74/1.11  maxlength =         115
% 0.74/1.11  maxnrvars =         195
% 0.74/1.11  excuselevel =       1
% 0.74/1.11  increasemaxweight = 1
% 0.74/1.11  
% 0.74/1.11  maxselected =       10000000
% 0.74/1.11  maxnrclauses =      10000000
% 0.74/1.11  
% 0.74/1.11  showgenerated =    0
% 0.74/1.11  showkept =         0
% 0.74/1.11  showselected =     0
% 0.74/1.11  showdeleted =      0
% 0.74/1.11  showresimp =       1
% 0.74/1.11  showstatus =       2000
% 0.74/1.11  
% 0.74/1.11  prologoutput =     0
% 0.74/1.11  nrgoals =          5000000
% 0.74/1.11  totalproof =       1
% 0.74/1.11  
% 0.74/1.11  Symbols occurring in the translation:
% 0.74/1.11  
% 0.74/1.11  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.74/1.11  .  [1, 2]      (w:1, o:24, a:1, s:1, b:0), 
% 0.74/1.11  !  [4, 1]      (w:0, o:17, a:1, s:1, b:0), 
% 0.74/1.11  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.74/1.11  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.74/1.11  distinct_points  [36, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.74/1.11  distinct_lines  [37, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 0.74/1.11  convergent_lines  [38, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.74/1.11  line_connecting  [41, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 0.74/1.11  apart_point_and_line  [42, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 0.74/1.11  intersection_point  [43, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 0.74/1.11  point  [48, 1]      (w:1, o:22, a:1, s:1, b:0), 
% 0.74/1.11  line  [49, 1]      (w:1, o:23, a:1, s:1, b:0), 
% 0.74/1.11  parallel_through_point  [52, 2]      (w:1, o:55, a:1, s:1, b:0), 
% 0.74/1.11  orthogonal_through_point  [53, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 0.74/1.11  skol1  [54, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.74/1.11  skol2  [55, 0]      (w:1, o:16, a:1, s:1, b:0).
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  Starting Search:
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  Bliksems!, er is een bewijs:
% 0.74/1.11  % SZS status Theorem
% 0.74/1.11  % SZS output start Refutation
% 0.74/1.11  
% 0.74/1.11  (0) {G0,W3,D2,L1,V1,M1} I { ! distinct_points( X, X ) }.
% 0.74/1.11  (3) {G0,W9,D2,L3,V3,M3} I { distinct_points( X, Z ), distinct_points( Y, Z
% 0.74/1.11     ), ! distinct_points( X, Y ) }.
% 0.74/1.11  (6) {G0,W8,D3,L2,V2,M1} I { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.74/1.11  (7) {G0,W8,D3,L2,V2,M1} I { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.74/1.11  (20) {G0,W3,D2,L1,V0,M1} I { distinct_points( skol1, skol2 ) }.
% 0.74/1.11  (22) {G0,W6,D2,L2,V1,M1} I { apart_point_and_line( skol1, X ), 
% 0.74/1.11    apart_point_and_line( skol2, X ) }.
% 0.74/1.11  (26) {G1,W6,D2,L2,V2,M2} R(3,0) { ! distinct_points( Y, X ), 
% 0.74/1.11    distinct_points( X, Y ) }.
% 0.74/1.11  (29) {G2,W3,D2,L1,V0,M1} R(26,20) { distinct_points( skol2, skol1 ) }.
% 0.74/1.11  (48) {G1,W8,D3,L2,V1,M1} R(6,22) { ! distinct_points( skol2, X ), 
% 0.74/1.11    apart_point_and_line( skol1, line_connecting( skol2, X ) ) }.
% 0.74/1.11  (49) {G3,W0,D0,L0,V0,M0} R(48,7);f;r(29) {  }.
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  % SZS output end Refutation
% 0.74/1.11  found a proof!
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  Unprocessed initial clauses:
% 0.74/1.11  
% 0.74/1.11  (51) {G0,W3,D2,L1,V1,M1}  { ! distinct_points( X, X ) }.
% 0.74/1.11  (52) {G0,W3,D2,L1,V1,M1}  { ! distinct_lines( X, X ) }.
% 0.74/1.11  (53) {G0,W3,D2,L1,V1,M1}  { ! convergent_lines( X, X ) }.
% 0.74/1.11  (54) {G0,W9,D2,L3,V3,M3}  { ! distinct_points( X, Y ), distinct_points( X, 
% 0.74/1.11    Z ), distinct_points( Y, Z ) }.
% 0.74/1.11  (55) {G0,W9,D2,L3,V3,M3}  { ! distinct_lines( X, Y ), distinct_lines( X, Z
% 0.74/1.11     ), distinct_lines( Y, Z ) }.
% 0.74/1.11  (56) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), convergent_lines( X
% 0.74/1.11    , Z ), convergent_lines( Y, Z ) }.
% 0.74/1.11  (57) {G0,W8,D3,L2,V2,M2}  { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.74/1.11  (58) {G0,W8,D3,L2,V2,M2}  { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.74/1.11  (59) {G0,W8,D3,L2,V2,M2}  { ! convergent_lines( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.74/1.11  (60) {G0,W8,D3,L2,V2,M2}  { ! convergent_lines( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.74/1.11  (61) {G0,W18,D2,L6,V4,M6}  { ! distinct_points( X, Y ), ! distinct_lines( Z
% 0.74/1.11    , T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ), 
% 0.74/1.11    apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.74/1.11  (62) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), distinct_points
% 0.74/1.11    ( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.74/1.11  (63) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), distinct_lines
% 0.74/1.11    ( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.74/1.11  (64) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), distinct_lines( Y, 
% 0.74/1.11    Z ), convergent_lines( X, Z ) }.
% 0.74/1.11  (65) {G0,W11,D3,L4,V2,M4}  { ! point( X ), ! point( Y ), ! distinct_points
% 0.74/1.11    ( X, Y ), line( line_connecting( X, Y ) ) }.
% 0.74/1.11  (66) {G0,W11,D3,L4,V2,M4}  { ! line( X ), ! line( Y ), ! convergent_lines( 
% 0.74/1.11    X, Y ), point( intersection_point( X, Y ) ) }.
% 0.74/1.11  (67) {G0,W8,D3,L3,V2,M3}  { ! line( X ), ! point( Y ), line( 
% 0.74/1.11    parallel_through_point( X, Y ) ) }.
% 0.74/1.11  (68) {G0,W8,D3,L3,V2,M3}  { ! line( X ), ! point( Y ), line( 
% 0.74/1.11    orthogonal_through_point( X, Y ) ) }.
% 0.74/1.11  (69) {G0,W2,D2,L1,V0,M1}  { point( skol1 ) }.
% 0.74/1.11  (70) {G0,W2,D2,L1,V0,M1}  { point( skol2 ) }.
% 0.74/1.11  (71) {G0,W3,D2,L1,V0,M1}  { distinct_points( skol1, skol2 ) }.
% 0.74/1.11  (72) {G0,W2,D2,L1,V1,M1}  { line( X ) }.
% 0.74/1.11  (73) {G0,W6,D2,L2,V1,M2}  { apart_point_and_line( skol1, X ), 
% 0.74/1.11    apart_point_and_line( skol2, X ) }.
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  Total Proof:
% 0.74/1.11  
% 0.74/1.11  subsumption: (0) {G0,W3,D2,L1,V1,M1} I { ! distinct_points( X, X ) }.
% 0.74/1.11  parent0: (51) {G0,W3,D2,L1,V1,M1}  { ! distinct_points( X, X ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := X
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11     0 ==> 0
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  subsumption: (3) {G0,W9,D2,L3,V3,M3} I { distinct_points( X, Z ), 
% 0.74/1.11    distinct_points( Y, Z ), ! distinct_points( X, Y ) }.
% 0.74/1.11  parent0: (54) {G0,W9,D2,L3,V3,M3}  { ! distinct_points( X, Y ), 
% 0.74/1.11    distinct_points( X, Z ), distinct_points( Y, Z ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := X
% 0.74/1.11     Y := Y
% 0.74/1.11     Z := Z
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11     0 ==> 2
% 0.74/1.11     1 ==> 0
% 0.74/1.11     2 ==> 1
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  subsumption: (6) {G0,W8,D3,L2,V2,M1} I { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.74/1.11  parent0: (57) {G0,W8,D3,L2,V2,M2}  { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := X
% 0.74/1.11     Y := Y
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11     0 ==> 0
% 0.74/1.11     1 ==> 1
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  subsumption: (7) {G0,W8,D3,L2,V2,M1} I { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.74/1.11  parent0: (58) {G0,W8,D3,L2,V2,M2}  { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := X
% 0.74/1.11     Y := Y
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11     0 ==> 0
% 0.74/1.11     1 ==> 1
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  subsumption: (20) {G0,W3,D2,L1,V0,M1} I { distinct_points( skol1, skol2 )
% 0.74/1.11     }.
% 0.74/1.11  parent0: (71) {G0,W3,D2,L1,V0,M1}  { distinct_points( skol1, skol2 ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11     0 ==> 0
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  subsumption: (22) {G0,W6,D2,L2,V1,M1} I { apart_point_and_line( skol1, X )
% 0.74/1.11    , apart_point_and_line( skol2, X ) }.
% 0.74/1.11  parent0: (73) {G0,W6,D2,L2,V1,M2}  { apart_point_and_line( skol1, X ), 
% 0.74/1.11    apart_point_and_line( skol2, X ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := X
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11     0 ==> 0
% 0.74/1.11     1 ==> 1
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  resolution: (103) {G1,W6,D2,L2,V2,M2}  { distinct_points( Y, X ), ! 
% 0.74/1.11    distinct_points( X, Y ) }.
% 0.74/1.11  parent0[0]: (0) {G0,W3,D2,L1,V1,M1} I { ! distinct_points( X, X ) }.
% 0.74/1.11  parent1[0]: (3) {G0,W9,D2,L3,V3,M3} I { distinct_points( X, Z ), 
% 0.74/1.11    distinct_points( Y, Z ), ! distinct_points( X, Y ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := X
% 0.74/1.11  end
% 0.74/1.11  substitution1:
% 0.74/1.11     X := X
% 0.74/1.11     Y := Y
% 0.74/1.11     Z := X
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  subsumption: (26) {G1,W6,D2,L2,V2,M2} R(3,0) { ! distinct_points( Y, X ), 
% 0.74/1.11    distinct_points( X, Y ) }.
% 0.74/1.11  parent0: (103) {G1,W6,D2,L2,V2,M2}  { distinct_points( Y, X ), ! 
% 0.74/1.11    distinct_points( X, Y ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := Y
% 0.74/1.11     Y := X
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11     0 ==> 1
% 0.74/1.11     1 ==> 0
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  resolution: (105) {G1,W3,D2,L1,V0,M1}  { distinct_points( skol2, skol1 )
% 0.74/1.11     }.
% 0.74/1.11  parent0[0]: (26) {G1,W6,D2,L2,V2,M2} R(3,0) { ! distinct_points( Y, X ), 
% 0.74/1.11    distinct_points( X, Y ) }.
% 0.74/1.11  parent1[0]: (20) {G0,W3,D2,L1,V0,M1} I { distinct_points( skol1, skol2 )
% 0.74/1.11     }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := skol2
% 0.74/1.11     Y := skol1
% 0.74/1.11  end
% 0.74/1.11  substitution1:
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  subsumption: (29) {G2,W3,D2,L1,V0,M1} R(26,20) { distinct_points( skol2, 
% 0.74/1.11    skol1 ) }.
% 0.74/1.11  parent0: (105) {G1,W3,D2,L1,V0,M1}  { distinct_points( skol2, skol1 ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11     0 ==> 0
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  resolution: (107) {G1,W8,D3,L2,V1,M2}  { ! distinct_points( skol2, X ), 
% 0.74/1.11    apart_point_and_line( skol1, line_connecting( skol2, X ) ) }.
% 0.74/1.11  parent0[1]: (6) {G0,W8,D3,L2,V2,M1} I { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.74/1.11  parent1[1]: (22) {G0,W6,D2,L2,V1,M1} I { apart_point_and_line( skol1, X ), 
% 0.74/1.11    apart_point_and_line( skol2, X ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := skol2
% 0.74/1.11     Y := X
% 0.74/1.11  end
% 0.74/1.11  substitution1:
% 0.74/1.11     X := line_connecting( skol2, X )
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  subsumption: (48) {G1,W8,D3,L2,V1,M1} R(6,22) { ! distinct_points( skol2, X
% 0.74/1.11     ), apart_point_and_line( skol1, line_connecting( skol2, X ) ) }.
% 0.74/1.11  parent0: (107) {G1,W8,D3,L2,V1,M2}  { ! distinct_points( skol2, X ), 
% 0.74/1.11    apart_point_and_line( skol1, line_connecting( skol2, X ) ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := X
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11     0 ==> 0
% 0.74/1.11     1 ==> 1
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  resolution: (108) {G1,W6,D2,L2,V0,M2}  { ! distinct_points( skol2, skol1 )
% 0.74/1.11    , ! distinct_points( skol2, skol1 ) }.
% 0.74/1.11  parent0[1]: (7) {G0,W8,D3,L2,V2,M1} I { ! distinct_points( X, Y ), ! 
% 0.74/1.11    apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.74/1.11  parent1[1]: (48) {G1,W8,D3,L2,V1,M1} R(6,22) { ! distinct_points( skol2, X
% 0.74/1.11     ), apart_point_and_line( skol1, line_connecting( skol2, X ) ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11     X := skol2
% 0.74/1.11     Y := skol1
% 0.74/1.11  end
% 0.74/1.11  substitution1:
% 0.74/1.11     X := skol1
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  factor: (109) {G1,W3,D2,L1,V0,M1}  { ! distinct_points( skol2, skol1 ) }.
% 0.74/1.11  parent0[0, 1]: (108) {G1,W6,D2,L2,V0,M2}  { ! distinct_points( skol2, skol1
% 0.74/1.11     ), ! distinct_points( skol2, skol1 ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  resolution: (111) {G2,W0,D0,L0,V0,M0}  {  }.
% 0.74/1.11  parent0[0]: (109) {G1,W3,D2,L1,V0,M1}  { ! distinct_points( skol2, skol1 )
% 0.74/1.11     }.
% 0.74/1.11  parent1[0]: (29) {G2,W3,D2,L1,V0,M1} R(26,20) { distinct_points( skol2, 
% 0.74/1.11    skol1 ) }.
% 0.74/1.11  substitution0:
% 0.74/1.11  end
% 0.74/1.11  substitution1:
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  subsumption: (49) {G3,W0,D0,L0,V0,M0} R(48,7);f;r(29) {  }.
% 0.74/1.11  parent0: (111) {G2,W0,D0,L0,V0,M0}  {  }.
% 0.74/1.11  substitution0:
% 0.74/1.11  end
% 0.74/1.11  permutation0:
% 0.74/1.11  end
% 0.74/1.11  
% 0.74/1.11  Proof check complete!
% 0.74/1.11  
% 0.74/1.11  Memory use:
% 0.74/1.11  
% 0.74/1.11  space for terms:        1009
% 0.74/1.11  space for clauses:      2277
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  clauses generated:      129
% 0.74/1.11  clauses kept:           50
% 0.74/1.11  clauses selected:       24
% 0.74/1.11  clauses deleted:        0
% 0.74/1.11  clauses inuse deleted:  0
% 0.74/1.11  
% 0.74/1.11  subsentry:          190
% 0.74/1.11  literals s-matched: 135
% 0.74/1.11  literals matched:   125
% 0.74/1.11  full subsumption:   56
% 0.74/1.11  
% 0.74/1.11  checksum:           1472853342
% 0.74/1.11  
% 0.74/1.11  
% 0.74/1.11  Bliksem ended
%------------------------------------------------------------------------------