↑ Up

Bliksem---1.12.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Bliksem---1.12
% Problem  : GEO212+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : bliksem %s

% Computer : n008.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:48 EDT 2022

% Result   : Theorem 0.80s 1.51s
% Output   : Refutation 0.80s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GEO212+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14  % Command  : bliksem %s
% 0.14/0.35  % Computer : n008.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 00:04:52 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.80/1.51  *** allocated 10000 integers for termspace/termends
% 0.80/1.51  *** allocated 10000 integers for clauses
% 0.80/1.51  *** allocated 10000 integers for justifications
% 0.80/1.51  Bliksem 1.12
% 0.80/1.51  
% 0.80/1.51  
% 0.80/1.51  Automatic Strategy Selection
% 0.80/1.51  
% 0.80/1.51  
% 0.80/1.51  Clauses:
% 0.80/1.51  
% 0.80/1.51  { ! distinct_points( X, X ) }.
% 0.80/1.51  { ! distinct_lines( X, X ) }.
% 0.80/1.51  { ! convergent_lines( X, X ) }.
% 0.80/1.51  { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.80/1.51     ) }.
% 0.80/1.51  { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.80/1.51     }.
% 0.80/1.51  { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.80/1.51    , Z ) }.
% 0.80/1.51  { ! distinct_points( X, Y ), ! apart_point_and_line( X, line_connecting( X
% 0.80/1.51    , Y ) ) }.
% 0.80/1.51  { ! distinct_points( X, Y ), ! apart_point_and_line( Y, line_connecting( X
% 0.80/1.51    , Y ) ) }.
% 0.80/1.51  { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.80/1.51    , Y ), X ) }.
% 0.80/1.51  { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.80/1.51    , Y ), Y ) }.
% 0.80/1.51  { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.80/1.51    ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ), 
% 0.80/1.51    apart_point_and_line( Y, T ) }.
% 0.80/1.51  { ! apart_point_and_line( X, Y ), distinct_points( X, Z ), 
% 0.80/1.51    apart_point_and_line( Z, Y ) }.
% 0.80/1.51  { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ), 
% 0.80/1.51    apart_point_and_line( X, Z ) }.
% 0.80/1.51  { ! convergent_lines( X, Y ), distinct_lines( Y, Z ), convergent_lines( X, 
% 0.80/1.51    Z ) }.
% 0.80/1.51  { ! convergent_lines( parallel_through_point( Y, X ), Y ) }.
% 0.80/1.51  { ! apart_point_and_line( X, parallel_through_point( Y, X ) ) }.
% 0.80/1.51  { ! distinct_lines( X, Y ), apart_point_and_line( Z, X ), 
% 0.80/1.51    apart_point_and_line( Z, Y ), convergent_lines( X, Y ) }.
% 0.80/1.51  { convergent_lines( X, Y ), unorthogonal_lines( X, Y ) }.
% 0.80/1.51  { ! convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z )
% 0.80/1.51    , convergent_lines( Y, Z ) }.
% 0.80/1.51  { ! convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z )
% 0.80/1.51    , unorthogonal_lines( Y, Z ) }.
% 0.80/1.51  { ! alpha1( X, Y ), convergent_lines( X, Y ) }.
% 0.80/1.51  { ! alpha1( X, Y ), unorthogonal_lines( X, Y ) }.
% 0.80/1.51  { ! convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Y )
% 0.80/1.51     }.
% 0.80/1.51  { ! unorthogonal_lines( orthogonal_through_point( Y, X ), Y ) }.
% 0.80/1.51  { ! apart_point_and_line( X, orthogonal_through_point( Y, X ) ) }.
% 0.80/1.51  { ! distinct_lines( X, Y ), apart_point_and_line( Z, X ), 
% 0.80/1.51    apart_point_and_line( Z, Y ), unorthogonal_lines( X, T ), 
% 0.80/1.51    unorthogonal_lines( Y, T ) }.
% 0.80/1.51  { unorthogonal_lines( skol1, skol2 ) }.
% 0.80/1.51  { ! convergent_lines( skol1, skol3 ) }.
% 0.80/1.51  { ! unorthogonal_lines( skol2, skol3 ) }.
% 0.80/1.51  
% 0.80/1.51  percentage equality = 0.000000, percentage horn = 0.586207
% 0.80/1.51  This a non-horn, non-equality problem
% 0.80/1.51  
% 0.80/1.51  
% 0.80/1.51  Options Used:
% 0.80/1.51  
% 0.80/1.51  useres =            1
% 0.80/1.51  useparamod =        0
% 0.80/1.51  useeqrefl =         0
% 0.80/1.51  useeqfact =         0
% 0.80/1.51  usefactor =         1
% 0.80/1.51  usesimpsplitting =  0
% 0.80/1.51  usesimpdemod =      0
% 0.80/1.51  usesimpres =        3
% 0.80/1.51  
% 0.80/1.51  resimpinuse      =  1000
% 0.80/1.51  resimpclauses =     20000
% 0.80/1.51  substype =          standard
% 0.80/1.51  backwardsubs =      1
% 0.80/1.51  selectoldest =      5
% 0.80/1.51  
% 0.80/1.51  litorderings [0] =  split
% 0.80/1.51  litorderings [1] =  liftord
% 0.80/1.51  
% 0.80/1.51  termordering =      none
% 0.80/1.51  
% 0.80/1.51  litapriori =        1
% 0.80/1.51  termapriori =       0
% 0.80/1.51  litaposteriori =    0
% 0.80/1.51  termaposteriori =   0
% 0.80/1.51  demodaposteriori =  0
% 0.80/1.51  ordereqreflfact =   0
% 0.80/1.51  
% 0.80/1.51  litselect =         none
% 0.80/1.51  
% 0.80/1.51  maxweight =         15
% 0.80/1.51  maxdepth =          30000
% 0.80/1.51  maxlength =         115
% 0.80/1.51  maxnrvars =         195
% 0.80/1.51  excuselevel =       1
% 0.80/1.51  increasemaxweight = 1
% 0.80/1.51  
% 0.80/1.51  maxselected =       10000000
% 0.80/1.51  maxnrclauses =      10000000
% 0.80/1.51  
% 0.80/1.51  showgenerated =    0
% 0.80/1.51  showkept =         0
% 0.80/1.51  showselected =     0
% 0.80/1.51  showdeleted =      0
% 0.80/1.51  showresimp =       1
% 0.80/1.51  showstatus =       2000
% 0.80/1.51  
% 0.80/1.51  prologoutput =     0
% 0.80/1.51  nrgoals =          5000000
% 0.80/1.51  totalproof =       1
% 0.80/1.51  
% 0.80/1.51  Symbols occurring in the translation:
% 0.80/1.51  
% 0.80/1.51  {}  [0, 0]      (w:1, o:2, a:1, s:1, b:0), 
% 0.80/1.51  .  [1, 2]      (w:1, o:23, a:1, s:1, b:0), 
% 0.80/1.51  !  [4, 1]      (w:0, o:18, a:1, s:1, b:0), 
% 0.80/1.51  =  [13, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.80/1.51  ==>  [14, 2]      (w:1, o:0, a:0, s:1, b:0), 
% 0.80/1.51  distinct_points  [36, 2]      (w:1, o:48, a:1, s:1, b:0), 
% 0.80/1.51  distinct_lines  [37, 2]      (w:1, o:49, a:1, s:1, b:0), 
% 0.80/1.51  convergent_lines  [38, 2]      (w:1, o:47, a:1, s:1, b:0), 
% 0.80/1.51  line_connecting  [41, 2]      (w:1, o:50, a:1, s:1, b:0), 
% 0.80/1.51  apart_point_and_line  [42, 2]      (w:1, o:51, a:1, s:1, b:0), 
% 0.80/1.51  intersection_point  [43, 2]      (w:1, o:52, a:1, s:1, b:0), 
% 0.80/1.51  parallel_through_point  [46, 2]      (w:1, o:54, a:1, s:1, b:0), 
% 0.80/1.51  unorthogonal_lines  [49, 2]      (w:1, o:55, a:1, s:1, b:0), 
% 0.80/1.51  orthogonal_through_point  [52, 2]      (w:1, o:53, a:1, s:1, b:0), 
% 0.80/1.51  alpha1  [53, 2]      (w:1, o:56, a:1, s:1, b:0), 
% 0.80/1.51  skol1  [54, 0]      (w:1, o:15, a:1, s:1, b:0), 
% 0.80/1.51  skol2  [55, 0]      (w:1, o:16, a:1, s:1, b:0), 
% 0.80/1.51  skol3  [56, 0]      (w:1, o:17, a:1, s:1, b:0).
% 0.80/1.51  
% 0.80/1.51  
% 0.80/1.51  Starting Search:
% 0.80/1.51  
% 0.80/1.51  *** allocated 15000 integers for clauses
% 0.80/1.51  *** allocated 22500 integers for clauses
% 0.80/1.51  *** allocated 33750 integers for clauses
% 0.80/1.51  *** allocated 50625 integers for clauses
% 0.80/1.51  *** allocated 15000 integers for termspace/termends
% 0.80/1.51  Resimplifying inuse:
% 0.80/1.51  Done
% 0.80/1.51  
% 0.80/1.51  *** allocated 22500 integers for termspace/termends
% 0.80/1.51  *** allocated 75937 integers for clauses
% 0.80/1.51  *** allocated 33750 integers for termspace/termends
% 0.80/1.51  *** allocated 113905 integers for clauses
% 0.80/1.51  
% 0.80/1.51  Intermediate Status:
% 0.80/1.51  Generated:    20838
% 0.80/1.51  Kept:         2020
% 0.80/1.51  Inuse:        329
% 0.80/1.51  Deleted:      0
% 0.80/1.51  Deletedinuse: 0
% 0.80/1.51  
% 0.80/1.51  Resimplifying inuse:
% 0.80/1.51  Done
% 0.80/1.51  
% 0.80/1.51  *** allocated 50625 integers for termspace/termends
% 0.80/1.51  *** allocated 170857 integers for clauses
% 0.80/1.51  Resimplifying inuse:
% 0.80/1.51  Done
% 0.80/1.51  
% 0.80/1.51  *** allocated 75937 integers for termspace/termends
% 0.80/1.51  
% 0.80/1.51  Bliksems!, er is een bewijs:
% 0.80/1.51  % SZS status Theorem
% 0.80/1.51  % SZS output start Refutation
% 0.80/1.51  
% 0.80/1.51  (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.80/1.51  (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), convergent_lines( Y, 
% 0.80/1.51    Z ), ! convergent_lines( X, Y ) }.
% 0.80/1.51  (17) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), unorthogonal_lines( 
% 0.80/1.51    X, Y ) }.
% 0.80/1.51  (19) {G0,W12,D2,L4,V3,M1} I { ! convergent_lines( X, Y ), ! 
% 0.80/1.51    unorthogonal_lines( X, Y ), unorthogonal_lines( Y, Z ), alpha1( X, Z )
% 0.80/1.51     }.
% 0.80/1.51  (20) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), ! alpha1( X, Y ) }.
% 0.80/1.51  (26) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2 ) }.
% 0.80/1.51  (27) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol3 ) }.
% 0.80/1.51  (28) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol2, skol3 ) }.
% 0.80/1.51  (45) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ), 
% 0.80/1.51    convergent_lines( X, Y ) }.
% 0.80/1.51  (49) {G2,W3,D2,L1,V0,M1} R(45,27) { ! convergent_lines( skol3, skol1 ) }.
% 0.80/1.51  (55) {G1,W3,D2,L1,V0,M1} R(17,28) { convergent_lines( skol2, skol3 ) }.
% 0.80/1.51  (57) {G2,W6,D2,L2,V1,M1} R(55,5) { convergent_lines( skol2, X ), 
% 0.80/1.51    convergent_lines( skol3, X ) }.
% 0.80/1.51  (61) {G3,W3,D2,L1,V0,M1} R(57,49) { convergent_lines( skol2, skol1 ) }.
% 0.80/1.51  (64) {G4,W3,D2,L1,V0,M1} R(61,45) { convergent_lines( skol1, skol2 ) }.
% 0.80/1.51  (197) {G1,W12,D2,L4,V3,M2} R(19,20) { ! convergent_lines( X, Y ), 
% 0.80/1.51    convergent_lines( X, Z ), ! unorthogonal_lines( X, Y ), 
% 0.80/1.51    unorthogonal_lines( Y, Z ) }.
% 0.80/1.51  (3999) {G5,W6,D2,L2,V1,M1} R(197,26);r(64) { convergent_lines( skol1, X ), 
% 0.80/1.51    unorthogonal_lines( skol2, X ) }.
% 0.80/1.51  (4004) {G6,W0,D0,L0,V0,M0} R(3999,28);r(27) {  }.
% 0.80/1.51  
% 0.80/1.51  
% 0.80/1.51  % SZS output end Refutation
% 0.80/1.51  found a proof!
% 0.80/1.51  
% 0.80/1.51  
% 0.80/1.51  Unprocessed initial clauses:
% 0.80/1.51  
% 0.80/1.51  (4006) {G0,W3,D2,L1,V1,M1}  { ! distinct_points( X, X ) }.
% 0.80/1.51  (4007) {G0,W3,D2,L1,V1,M1}  { ! distinct_lines( X, X ) }.
% 0.80/1.51  (4008) {G0,W3,D2,L1,V1,M1}  { ! convergent_lines( X, X ) }.
% 0.80/1.51  (4009) {G0,W9,D2,L3,V3,M3}  { ! distinct_points( X, Y ), distinct_points( X
% 0.80/1.51    , Z ), distinct_points( Y, Z ) }.
% 0.80/1.51  (4010) {G0,W9,D2,L3,V3,M3}  { ! distinct_lines( X, Y ), distinct_lines( X, 
% 0.80/1.51    Z ), distinct_lines( Y, Z ) }.
% 0.80/1.51  (4011) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), convergent_lines
% 0.80/1.51    ( X, Z ), convergent_lines( Y, Z ) }.
% 0.80/1.51  (4012) {G0,W8,D3,L2,V2,M2}  { ! distinct_points( X, Y ), ! 
% 0.80/1.51    apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.80/1.51  (4013) {G0,W8,D3,L2,V2,M2}  { ! distinct_points( X, Y ), ! 
% 0.80/1.51    apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.80/1.51  (4014) {G0,W8,D3,L2,V2,M2}  { ! convergent_lines( X, Y ), ! 
% 0.80/1.51    apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.80/1.51  (4015) {G0,W8,D3,L2,V2,M2}  { ! convergent_lines( X, Y ), ! 
% 0.80/1.51    apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.80/1.51  (4016) {G0,W18,D2,L6,V4,M6}  { ! distinct_points( X, Y ), ! distinct_lines
% 0.80/1.51    ( Z, T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ), 
% 0.80/1.51    apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.80/1.51  (4017) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), 
% 0.80/1.51    distinct_points( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.80/1.51  (4018) {G0,W9,D2,L3,V3,M3}  { ! apart_point_and_line( X, Y ), 
% 0.80/1.51    distinct_lines( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.80/1.51  (4019) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), distinct_lines( Y
% 0.80/1.51    , Z ), convergent_lines( X, Z ) }.
% 0.80/1.51  (4020) {G0,W5,D3,L1,V2,M1}  { ! convergent_lines( parallel_through_point( Y
% 0.80/1.51    , X ), Y ) }.
% 0.80/1.51  (4021) {G0,W5,D3,L1,V2,M1}  { ! apart_point_and_line( X, 
% 0.80/1.51    parallel_through_point( Y, X ) ) }.
% 0.80/1.51  (4022) {G0,W12,D2,L4,V3,M4}  { ! distinct_lines( X, Y ), 
% 0.80/1.51    apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ), 
% 0.80/1.51    convergent_lines( X, Y ) }.
% 0.80/1.51  (4023) {G0,W6,D2,L2,V2,M2}  { convergent_lines( X, Y ), unorthogonal_lines
% 0.80/1.51    ( X, Y ) }.
% 0.80/1.51  (4024) {G0,W12,D2,L4,V3,M4}  { ! convergent_lines( X, Y ), ! 
% 0.80/1.51    unorthogonal_lines( X, Y ), alpha1( X, Z ), convergent_lines( Y, Z ) }.
% 0.80/1.51  (4025) {G0,W12,D2,L4,V3,M4}  { ! convergent_lines( X, Y ), ! 
% 0.80/1.51    unorthogonal_lines( X, Y ), alpha1( X, Z ), unorthogonal_lines( Y, Z )
% 0.80/1.51     }.
% 0.80/1.51  (4026) {G0,W6,D2,L2,V2,M2}  { ! alpha1( X, Y ), convergent_lines( X, Y )
% 0.80/1.51     }.
% 0.80/1.51  (4027) {G0,W6,D2,L2,V2,M2}  { ! alpha1( X, Y ), unorthogonal_lines( X, Y )
% 0.80/1.51     }.
% 0.80/1.51  (4028) {G0,W9,D2,L3,V2,M3}  { ! convergent_lines( X, Y ), ! 
% 0.80/1.51    unorthogonal_lines( X, Y ), alpha1( X, Y ) }.
% 0.80/1.51  (4029) {G0,W5,D3,L1,V2,M1}  { ! unorthogonal_lines( 
% 0.80/1.51    orthogonal_through_point( Y, X ), Y ) }.
% 0.80/1.51  (4030) {G0,W5,D3,L1,V2,M1}  { ! apart_point_and_line( X, 
% 0.80/1.51    orthogonal_through_point( Y, X ) ) }.
% 0.80/1.51  (4031) {G0,W15,D2,L5,V4,M5}  { ! distinct_lines( X, Y ), 
% 0.80/1.51    apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ), 
% 0.80/1.51    unorthogonal_lines( X, T ), unorthogonal_lines( Y, T ) }.
% 0.80/1.51  (4032) {G0,W3,D2,L1,V0,M1}  { unorthogonal_lines( skol1, skol2 ) }.
% 0.80/1.51  (4033) {G0,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol3 ) }.
% 0.80/1.51  (4034) {G0,W3,D2,L1,V0,M1}  { ! unorthogonal_lines( skol2, skol3 ) }.
% 0.80/1.51  
% 0.80/1.51  
% 0.80/1.51  Total Proof:
% 0.80/1.51  
% 0.80/1.51  subsumption: (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.80/1.51  parent0: (4008) {G0,W3,D2,L1,V1,M1}  { ! convergent_lines( X, X ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), 
% 0.80/1.51    convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 0.80/1.51  parent0: (4011) {G0,W9,D2,L3,V3,M3}  { ! convergent_lines( X, Y ), 
% 0.80/1.51    convergent_lines( X, Z ), convergent_lines( Y, Z ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51     Y := Y
% 0.80/1.51     Z := Z
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 2
% 0.80/1.51     1 ==> 0
% 0.80/1.51     2 ==> 1
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (17) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), 
% 0.80/1.51    unorthogonal_lines( X, Y ) }.
% 0.80/1.51  parent0: (4023) {G0,W6,D2,L2,V2,M2}  { convergent_lines( X, Y ), 
% 0.80/1.51    unorthogonal_lines( X, Y ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51     Y := Y
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51     1 ==> 1
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (19) {G0,W12,D2,L4,V3,M1} I { ! convergent_lines( X, Y ), ! 
% 0.80/1.51    unorthogonal_lines( X, Y ), unorthogonal_lines( Y, Z ), alpha1( X, Z )
% 0.80/1.51     }.
% 0.80/1.51  parent0: (4025) {G0,W12,D2,L4,V3,M4}  { ! convergent_lines( X, Y ), ! 
% 0.80/1.51    unorthogonal_lines( X, Y ), alpha1( X, Z ), unorthogonal_lines( Y, Z )
% 0.80/1.51     }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51     Y := Y
% 0.80/1.51     Z := Z
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51     1 ==> 1
% 0.80/1.51     2 ==> 3
% 0.80/1.51     3 ==> 2
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (20) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), ! 
% 0.80/1.51    alpha1( X, Y ) }.
% 0.80/1.51  parent0: (4026) {G0,W6,D2,L2,V2,M2}  { ! alpha1( X, Y ), convergent_lines( 
% 0.80/1.51    X, Y ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51     Y := Y
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 1
% 0.80/1.51     1 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (26) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2
% 0.80/1.51     ) }.
% 0.80/1.51  parent0: (4032) {G0,W3,D2,L1,V0,M1}  { unorthogonal_lines( skol1, skol2 )
% 0.80/1.51     }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (27) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol3
% 0.80/1.51     ) }.
% 0.80/1.51  parent0: (4033) {G0,W3,D2,L1,V0,M1}  { ! convergent_lines( skol1, skol3 )
% 0.80/1.51     }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (28) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol2, 
% 0.80/1.51    skol3 ) }.
% 0.80/1.51  parent0: (4034) {G0,W3,D2,L1,V0,M1}  { ! unorthogonal_lines( skol2, skol3 )
% 0.80/1.51     }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4104) {G1,W6,D2,L2,V2,M2}  { convergent_lines( Y, X ), ! 
% 0.80/1.51    convergent_lines( X, Y ) }.
% 0.80/1.51  parent0[0]: (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.80/1.51  parent1[0]: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), 
% 0.80/1.51    convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51     X := X
% 0.80/1.51     Y := Y
% 0.80/1.51     Z := X
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (45) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ), 
% 0.80/1.51    convergent_lines( X, Y ) }.
% 0.80/1.51  parent0: (4104) {G1,W6,D2,L2,V2,M2}  { convergent_lines( Y, X ), ! 
% 0.80/1.51    convergent_lines( X, Y ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := Y
% 0.80/1.51     Y := X
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 1
% 0.80/1.51     1 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4106) {G1,W3,D2,L1,V0,M1}  { ! convergent_lines( skol3, skol1
% 0.80/1.51     ) }.
% 0.80/1.51  parent0[0]: (27) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol3 )
% 0.80/1.51     }.
% 0.80/1.51  parent1[1]: (45) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ), 
% 0.80/1.51    convergent_lines( X, Y ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51     X := skol1
% 0.80/1.51     Y := skol3
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (49) {G2,W3,D2,L1,V0,M1} R(45,27) { ! convergent_lines( skol3
% 0.80/1.51    , skol1 ) }.
% 0.80/1.51  parent0: (4106) {G1,W3,D2,L1,V0,M1}  { ! convergent_lines( skol3, skol1 )
% 0.80/1.51     }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4107) {G1,W3,D2,L1,V0,M1}  { convergent_lines( skol2, skol3 )
% 0.80/1.51     }.
% 0.80/1.51  parent0[0]: (28) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol2, skol3
% 0.80/1.51     ) }.
% 0.80/1.51  parent1[1]: (17) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), 
% 0.80/1.51    unorthogonal_lines( X, Y ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51     X := skol2
% 0.80/1.51     Y := skol3
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (55) {G1,W3,D2,L1,V0,M1} R(17,28) { convergent_lines( skol2, 
% 0.80/1.51    skol3 ) }.
% 0.80/1.51  parent0: (4107) {G1,W3,D2,L1,V0,M1}  { convergent_lines( skol2, skol3 ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4108) {G1,W6,D2,L2,V1,M2}  { convergent_lines( skol2, X ), 
% 0.80/1.51    convergent_lines( skol3, X ) }.
% 0.80/1.51  parent0[2]: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), 
% 0.80/1.51    convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 0.80/1.51  parent1[0]: (55) {G1,W3,D2,L1,V0,M1} R(17,28) { convergent_lines( skol2, 
% 0.80/1.51    skol3 ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := skol2
% 0.80/1.51     Y := skol3
% 0.80/1.51     Z := X
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (57) {G2,W6,D2,L2,V1,M1} R(55,5) { convergent_lines( skol2, X
% 0.80/1.51     ), convergent_lines( skol3, X ) }.
% 0.80/1.51  parent0: (4108) {G1,W6,D2,L2,V1,M2}  { convergent_lines( skol2, X ), 
% 0.80/1.51    convergent_lines( skol3, X ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51     1 ==> 1
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4109) {G3,W3,D2,L1,V0,M1}  { convergent_lines( skol2, skol1 )
% 0.80/1.51     }.
% 0.80/1.51  parent0[0]: (49) {G2,W3,D2,L1,V0,M1} R(45,27) { ! convergent_lines( skol3, 
% 0.80/1.51    skol1 ) }.
% 0.80/1.51  parent1[1]: (57) {G2,W6,D2,L2,V1,M1} R(55,5) { convergent_lines( skol2, X )
% 0.80/1.51    , convergent_lines( skol3, X ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51     X := skol1
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (61) {G3,W3,D2,L1,V0,M1} R(57,49) { convergent_lines( skol2, 
% 0.80/1.51    skol1 ) }.
% 0.80/1.51  parent0: (4109) {G3,W3,D2,L1,V0,M1}  { convergent_lines( skol2, skol1 ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4110) {G2,W3,D2,L1,V0,M1}  { convergent_lines( skol1, skol2 )
% 0.80/1.51     }.
% 0.80/1.51  parent0[0]: (45) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ), 
% 0.80/1.51    convergent_lines( X, Y ) }.
% 0.80/1.51  parent1[0]: (61) {G3,W3,D2,L1,V0,M1} R(57,49) { convergent_lines( skol2, 
% 0.80/1.51    skol1 ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := skol1
% 0.80/1.51     Y := skol2
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (64) {G4,W3,D2,L1,V0,M1} R(61,45) { convergent_lines( skol1, 
% 0.80/1.51    skol2 ) }.
% 0.80/1.51  parent0: (4110) {G2,W3,D2,L1,V0,M1}  { convergent_lines( skol1, skol2 ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4112) {G1,W12,D2,L4,V3,M4}  { convergent_lines( X, Y ), ! 
% 0.80/1.51    convergent_lines( X, Z ), ! unorthogonal_lines( X, Z ), 
% 0.80/1.51    unorthogonal_lines( Z, Y ) }.
% 0.80/1.51  parent0[1]: (20) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), ! alpha1
% 0.80/1.51    ( X, Y ) }.
% 0.80/1.51  parent1[3]: (19) {G0,W12,D2,L4,V3,M1} I { ! convergent_lines( X, Y ), ! 
% 0.80/1.51    unorthogonal_lines( X, Y ), unorthogonal_lines( Y, Z ), alpha1( X, Z )
% 0.80/1.51     }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51     Y := Y
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51     X := X
% 0.80/1.51     Y := Z
% 0.80/1.51     Z := Y
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (197) {G1,W12,D2,L4,V3,M2} R(19,20) { ! convergent_lines( X, Y
% 0.80/1.51     ), convergent_lines( X, Z ), ! unorthogonal_lines( X, Y ), 
% 0.80/1.51    unorthogonal_lines( Y, Z ) }.
% 0.80/1.51  parent0: (4112) {G1,W12,D2,L4,V3,M4}  { convergent_lines( X, Y ), ! 
% 0.80/1.51    convergent_lines( X, Z ), ! unorthogonal_lines( X, Z ), 
% 0.80/1.51    unorthogonal_lines( Z, Y ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51     Y := Z
% 0.80/1.51     Z := Y
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 1
% 0.80/1.51     1 ==> 0
% 0.80/1.51     2 ==> 2
% 0.80/1.51     3 ==> 3
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4113) {G1,W9,D2,L3,V1,M3}  { ! convergent_lines( skol1, skol2
% 0.80/1.51     ), convergent_lines( skol1, X ), unorthogonal_lines( skol2, X ) }.
% 0.80/1.51  parent0[2]: (197) {G1,W12,D2,L4,V3,M2} R(19,20) { ! convergent_lines( X, Y
% 0.80/1.51     ), convergent_lines( X, Z ), ! unorthogonal_lines( X, Y ), 
% 0.80/1.51    unorthogonal_lines( Y, Z ) }.
% 0.80/1.51  parent1[0]: (26) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2 )
% 0.80/1.51     }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := skol1
% 0.80/1.51     Y := skol2
% 0.80/1.51     Z := X
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4114) {G2,W6,D2,L2,V1,M2}  { convergent_lines( skol1, X ), 
% 0.80/1.51    unorthogonal_lines( skol2, X ) }.
% 0.80/1.51  parent0[0]: (4113) {G1,W9,D2,L3,V1,M3}  { ! convergent_lines( skol1, skol2
% 0.80/1.51     ), convergent_lines( skol1, X ), unorthogonal_lines( skol2, X ) }.
% 0.80/1.51  parent1[0]: (64) {G4,W3,D2,L1,V0,M1} R(61,45) { convergent_lines( skol1, 
% 0.80/1.51    skol2 ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (3999) {G5,W6,D2,L2,V1,M1} R(197,26);r(64) { convergent_lines
% 0.80/1.51    ( skol1, X ), unorthogonal_lines( skol2, X ) }.
% 0.80/1.51  parent0: (4114) {G2,W6,D2,L2,V1,M2}  { convergent_lines( skol1, X ), 
% 0.80/1.51    unorthogonal_lines( skol2, X ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51     X := X
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51     0 ==> 0
% 0.80/1.51     1 ==> 1
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4115) {G1,W3,D2,L1,V0,M1}  { convergent_lines( skol1, skol3 )
% 0.80/1.51     }.
% 0.80/1.51  parent0[0]: (28) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol2, skol3
% 0.80/1.51     ) }.
% 0.80/1.51  parent1[1]: (3999) {G5,W6,D2,L2,V1,M1} R(197,26);r(64) { convergent_lines( 
% 0.80/1.51    skol1, X ), unorthogonal_lines( skol2, X ) }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51     X := skol3
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  resolution: (4116) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.80/1.51  parent0[0]: (27) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol3 )
% 0.80/1.51     }.
% 0.80/1.51  parent1[0]: (4115) {G1,W3,D2,L1,V0,M1}  { convergent_lines( skol1, skol3 )
% 0.80/1.51     }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  substitution1:
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  subsumption: (4004) {G6,W0,D0,L0,V0,M0} R(3999,28);r(27) {  }.
% 0.80/1.51  parent0: (4116) {G1,W0,D0,L0,V0,M0}  {  }.
% 0.80/1.51  substitution0:
% 0.80/1.51  end
% 0.80/1.51  permutation0:
% 0.80/1.51  end
% 0.80/1.51  
% 0.80/1.51  Proof check complete!
% 0.80/1.51  
% 0.80/1.51  Memory use:
% 0.80/1.51  
% 0.80/1.51  space for terms:        52054
% 0.80/1.51  space for clauses:      159007
% 0.80/1.51  
% 0.80/1.51  
% 0.80/1.51  clauses generated:      38523
% 0.80/1.51  clauses kept:           4005
% 0.80/1.51  clauses selected:       516
% 0.80/1.51  clauses deleted:        1
% 0.80/1.51  clauses inuse deleted:  0
% 0.80/1.51  
% 0.80/1.51  subsentry:          584216
% 0.80/1.51  literals s-matched: 184533
% 0.80/1.51  literals matched:   184503
% 0.80/1.51  full subsumption:   97797
% 0.80/1.51  
% 0.80/1.51  checksum:           -1581875768
% 0.80/1.51  
% 0.80/1.51  
% 0.80/1.51  Bliksem ended
%------------------------------------------------------------------------------