%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GEO171+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n006.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:12 EDT 2022
% Result : Theorem 0.81s 1.24s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO171+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Sat Jun 18 02:06:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.81/1.24 *** allocated 10000 integers for termspace/termends
% 0.81/1.24 *** allocated 10000 integers for clauses
% 0.81/1.24 *** allocated 10000 integers for justifications
% 0.81/1.24 Bliksem 1.12
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 Automatic Strategy Selection
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 Clauses:
% 0.81/1.24
% 0.81/1.24 { ! distinct_points( X, X ) }.
% 0.81/1.24 { ! distinct_lines( X, X ) }.
% 0.81/1.24 { ! convergent_lines( X, X ) }.
% 0.81/1.24 { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.81/1.24 ) }.
% 0.81/1.24 { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.81/1.24 }.
% 0.81/1.24 { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.81/1.24 , Z ) }.
% 0.81/1.24 { ! distinct_points( X, Y ), ! apart_point_and_line( X, line_connecting( X
% 0.81/1.24 , Y ) ) }.
% 0.81/1.24 { ! distinct_points( X, Y ), ! apart_point_and_line( Y, line_connecting( X
% 0.81/1.24 , Y ) ) }.
% 0.81/1.24 { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.81/1.24 , Y ), X ) }.
% 0.81/1.24 { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.81/1.24 , Y ), Y ) }.
% 0.81/1.24 { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.81/1.24 ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ),
% 0.81/1.24 apart_point_and_line( Y, T ) }.
% 0.81/1.24 { ! apart_point_and_line( X, Y ), distinct_points( X, Z ),
% 0.81/1.24 apart_point_and_line( Z, Y ) }.
% 0.81/1.24 { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ),
% 0.81/1.24 apart_point_and_line( X, Z ) }.
% 0.81/1.24 { ! convergent_lines( X, Y ), distinct_lines( Y, Z ), convergent_lines( X,
% 0.81/1.24 Z ) }.
% 0.81/1.24 { convergent_lines( skol1, skol2 ) }.
% 0.81/1.24 { ! distinct_lines( skol1, skol2 ) }.
% 0.81/1.24
% 0.81/1.24 percentage equality = 0.000000, percentage horn = 0.562500
% 0.81/1.24 This a non-horn, non-equality problem
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 Options Used:
% 0.81/1.24
% 0.81/1.24 useres = 1
% 0.81/1.24 useparamod = 0
% 0.81/1.24 useeqrefl = 0
% 0.81/1.24 useeqfact = 0
% 0.81/1.24 usefactor = 1
% 0.81/1.24 usesimpsplitting = 0
% 0.81/1.24 usesimpdemod = 0
% 0.81/1.24 usesimpres = 3
% 0.81/1.24
% 0.81/1.24 resimpinuse = 1000
% 0.81/1.24 resimpclauses = 20000
% 0.81/1.24 substype = standard
% 0.81/1.24 backwardsubs = 1
% 0.81/1.24 selectoldest = 5
% 0.81/1.24
% 0.81/1.24 litorderings [0] = split
% 0.81/1.24 litorderings [1] = liftord
% 0.81/1.24
% 0.81/1.24 termordering = none
% 0.81/1.24
% 0.81/1.24 litapriori = 1
% 0.81/1.24 termapriori = 0
% 0.81/1.24 litaposteriori = 0
% 0.81/1.24 termaposteriori = 0
% 0.81/1.24 demodaposteriori = 0
% 0.81/1.24 ordereqreflfact = 0
% 0.81/1.24
% 0.81/1.24 litselect = none
% 0.81/1.24
% 0.81/1.24 maxweight = 15
% 0.81/1.24 maxdepth = 30000
% 0.81/1.24 maxlength = 115
% 0.81/1.24 maxnrvars = 195
% 0.81/1.24 excuselevel = 1
% 0.81/1.24 increasemaxweight = 1
% 0.81/1.24
% 0.81/1.24 maxselected = 10000000
% 0.81/1.24 maxnrclauses = 10000000
% 0.81/1.24
% 0.81/1.24 showgenerated = 0
% 0.81/1.24 showkept = 0
% 0.81/1.24 showselected = 0
% 0.81/1.24 showdeleted = 0
% 0.81/1.24 showresimp = 1
% 0.81/1.24 showstatus = 2000
% 0.81/1.24
% 0.81/1.24 prologoutput = 0
% 0.81/1.24 nrgoals = 5000000
% 0.81/1.24 totalproof = 1
% 0.81/1.24
% 0.81/1.24 Symbols occurring in the translation:
% 0.81/1.24
% 0.81/1.24 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.81/1.24 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.81/1.24 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.81/1.24 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.81/1.24 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.81/1.24 distinct_points [36, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.81/1.24 distinct_lines [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.81/1.24 convergent_lines [38, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.81/1.24 line_connecting [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.81/1.24 apart_point_and_line [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.81/1.24 intersection_point [43, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.81/1.24 skol1 [46, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.81/1.24 skol2 [47, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 Starting Search:
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 Bliksems!, er is een bewijs:
% 0.81/1.24 % SZS status Theorem
% 0.81/1.24 % SZS output start Refutation
% 0.81/1.24
% 0.81/1.24 (1) {G0,W3,D2,L1,V1,M1} I { ! distinct_lines( X, X ) }.
% 0.81/1.24 (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.81/1.24 (4) {G0,W9,D2,L3,V3,M3} I { distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.81/1.24 , ! distinct_lines( X, Y ) }.
% 0.81/1.24 (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), convergent_lines( Y,
% 0.81/1.24 Z ), ! convergent_lines( X, Y ) }.
% 0.81/1.24 (13) {G0,W9,D2,L3,V3,M1} I { ! convergent_lines( X, Y ), convergent_lines(
% 0.81/1.24 X, Z ), distinct_lines( Y, Z ) }.
% 0.81/1.24 (14) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 ) }.
% 0.81/1.24 (15) {G0,W3,D2,L1,V0,M1} I { ! distinct_lines( skol1, skol2 ) }.
% 0.81/1.24 (25) {G1,W6,D2,L2,V2,M2} R(4,1) { ! distinct_lines( Y, X ), distinct_lines
% 0.81/1.24 ( X, Y ) }.
% 0.81/1.24 (28) {G2,W3,D2,L1,V0,M1} R(25,15) { ! distinct_lines( skol2, skol1 ) }.
% 0.81/1.24 (39) {G1,W6,D2,L2,V1,M1} R(5,14) { convergent_lines( skol1, X ),
% 0.81/1.24 convergent_lines( skol2, X ) }.
% 0.81/1.24 (40) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ),
% 0.81/1.24 convergent_lines( X, Y ) }.
% 0.81/1.24 (44) {G2,W6,D2,L2,V1,M2} R(39,40) { convergent_lines( X, skol2 ),
% 0.81/1.24 convergent_lines( skol1, X ) }.
% 0.81/1.24 (46) {G3,W6,D2,L2,V1,M1} R(44,40) { convergent_lines( X, skol1 ),
% 0.81/1.24 convergent_lines( X, skol2 ) }.
% 0.81/1.24 (144) {G4,W3,D2,L1,V1,M1} R(13,28);r(46) { convergent_lines( X, skol1 ) }.
% 0.81/1.24 (150) {G5,W0,D0,L0,V0,M0} R(144,2) { }.
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 % SZS output end Refutation
% 0.81/1.24 found a proof!
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 Unprocessed initial clauses:
% 0.81/1.24
% 0.81/1.24 (152) {G0,W3,D2,L1,V1,M1} { ! distinct_points( X, X ) }.
% 0.81/1.24 (153) {G0,W3,D2,L1,V1,M1} { ! distinct_lines( X, X ) }.
% 0.81/1.24 (154) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 0.81/1.24 (155) {G0,W9,D2,L3,V3,M3} { ! distinct_points( X, Y ), distinct_points( X
% 0.81/1.24 , Z ), distinct_points( Y, Z ) }.
% 0.81/1.24 (156) {G0,W9,D2,L3,V3,M3} { ! distinct_lines( X, Y ), distinct_lines( X, Z
% 0.81/1.24 ), distinct_lines( Y, Z ) }.
% 0.81/1.24 (157) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), convergent_lines(
% 0.81/1.24 X, Z ), convergent_lines( Y, Z ) }.
% 0.81/1.24 (158) {G0,W8,D3,L2,V2,M2} { ! distinct_points( X, Y ), !
% 0.81/1.24 apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.81/1.24 (159) {G0,W8,D3,L2,V2,M2} { ! distinct_points( X, Y ), !
% 0.81/1.24 apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.81/1.24 (160) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 0.81/1.24 apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.81/1.24 (161) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 0.81/1.24 apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.81/1.24 (162) {G0,W18,D2,L6,V4,M6} { ! distinct_points( X, Y ), ! distinct_lines(
% 0.81/1.24 Z, T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ),
% 0.81/1.24 apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.81/1.24 (163) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ),
% 0.81/1.24 distinct_points( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.81/1.24 (164) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_lines
% 0.81/1.24 ( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.81/1.24 (165) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), distinct_lines( Y
% 0.81/1.24 , Z ), convergent_lines( X, Z ) }.
% 0.81/1.24 (166) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 ) }.
% 0.81/1.24 (167) {G0,W3,D2,L1,V0,M1} { ! distinct_lines( skol1, skol2 ) }.
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 Total Proof:
% 0.81/1.24
% 0.81/1.24 subsumption: (1) {G0,W3,D2,L1,V1,M1} I { ! distinct_lines( X, X ) }.
% 0.81/1.24 parent0: (153) {G0,W3,D2,L1,V1,M1} { ! distinct_lines( X, X ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.81/1.24 parent0: (154) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (4) {G0,W9,D2,L3,V3,M3} I { distinct_lines( X, Z ),
% 0.81/1.24 distinct_lines( Y, Z ), ! distinct_lines( X, Y ) }.
% 0.81/1.24 parent0: (156) {G0,W9,D2,L3,V3,M3} { ! distinct_lines( X, Y ),
% 0.81/1.24 distinct_lines( X, Z ), distinct_lines( Y, Z ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 Y := Y
% 0.81/1.24 Z := Z
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 2
% 0.81/1.24 1 ==> 0
% 0.81/1.24 2 ==> 1
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 0.81/1.24 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 0.81/1.24 parent0: (157) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ),
% 0.81/1.24 convergent_lines( X, Z ), convergent_lines( Y, Z ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 Y := Y
% 0.81/1.24 Z := Z
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 2
% 0.81/1.24 1 ==> 0
% 0.81/1.24 2 ==> 1
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (13) {G0,W9,D2,L3,V3,M1} I { ! convergent_lines( X, Y ),
% 0.81/1.24 convergent_lines( X, Z ), distinct_lines( Y, Z ) }.
% 0.81/1.24 parent0: (165) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ),
% 0.81/1.24 distinct_lines( Y, Z ), convergent_lines( X, Z ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 Y := Y
% 0.81/1.24 Z := Z
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 1 ==> 2
% 0.81/1.24 2 ==> 1
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (14) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.81/1.24 }.
% 0.81/1.24 parent0: (166) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (15) {G0,W3,D2,L1,V0,M1} I { ! distinct_lines( skol1, skol2 )
% 0.81/1.24 }.
% 0.81/1.24 parent0: (167) {G0,W3,D2,L1,V0,M1} { ! distinct_lines( skol1, skol2 ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 resolution: (200) {G1,W6,D2,L2,V2,M2} { distinct_lines( Y, X ), !
% 0.81/1.24 distinct_lines( X, Y ) }.
% 0.81/1.24 parent0[0]: (1) {G0,W3,D2,L1,V1,M1} I { ! distinct_lines( X, X ) }.
% 0.81/1.24 parent1[0]: (4) {G0,W9,D2,L3,V3,M3} I { distinct_lines( X, Z ),
% 0.81/1.24 distinct_lines( Y, Z ), ! distinct_lines( X, Y ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24 substitution1:
% 0.81/1.24 X := X
% 0.81/1.24 Y := Y
% 0.81/1.24 Z := X
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (25) {G1,W6,D2,L2,V2,M2} R(4,1) { ! distinct_lines( Y, X ),
% 0.81/1.24 distinct_lines( X, Y ) }.
% 0.81/1.24 parent0: (200) {G1,W6,D2,L2,V2,M2} { distinct_lines( Y, X ), !
% 0.81/1.24 distinct_lines( X, Y ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := Y
% 0.81/1.24 Y := X
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 1
% 0.81/1.24 1 ==> 0
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 resolution: (202) {G1,W3,D2,L1,V0,M1} { ! distinct_lines( skol2, skol1 )
% 0.81/1.24 }.
% 0.81/1.24 parent0[0]: (15) {G0,W3,D2,L1,V0,M1} I { ! distinct_lines( skol1, skol2 )
% 0.81/1.24 }.
% 0.81/1.24 parent1[1]: (25) {G1,W6,D2,L2,V2,M2} R(4,1) { ! distinct_lines( Y, X ),
% 0.81/1.24 distinct_lines( X, Y ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 end
% 0.81/1.24 substitution1:
% 0.81/1.24 X := skol1
% 0.81/1.24 Y := skol2
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (28) {G2,W3,D2,L1,V0,M1} R(25,15) { ! distinct_lines( skol2,
% 0.81/1.24 skol1 ) }.
% 0.81/1.24 parent0: (202) {G1,W3,D2,L1,V0,M1} { ! distinct_lines( skol2, skol1 ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 resolution: (203) {G1,W6,D2,L2,V1,M2} { convergent_lines( skol1, X ),
% 0.81/1.24 convergent_lines( skol2, X ) }.
% 0.81/1.24 parent0[2]: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 0.81/1.24 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 0.81/1.24 parent1[0]: (14) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.81/1.24 }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := skol1
% 0.81/1.24 Y := skol2
% 0.81/1.24 Z := X
% 0.81/1.24 end
% 0.81/1.24 substitution1:
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (39) {G1,W6,D2,L2,V1,M1} R(5,14) { convergent_lines( skol1, X
% 0.81/1.24 ), convergent_lines( skol2, X ) }.
% 0.81/1.24 parent0: (203) {G1,W6,D2,L2,V1,M2} { convergent_lines( skol1, X ),
% 0.81/1.24 convergent_lines( skol2, X ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 1 ==> 1
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 resolution: (204) {G1,W6,D2,L2,V2,M2} { convergent_lines( Y, X ), !
% 0.81/1.24 convergent_lines( X, Y ) }.
% 0.81/1.24 parent0[0]: (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.81/1.24 parent1[0]: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 0.81/1.24 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24 substitution1:
% 0.81/1.24 X := X
% 0.81/1.24 Y := Y
% 0.81/1.24 Z := X
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (40) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ),
% 0.81/1.24 convergent_lines( X, Y ) }.
% 0.81/1.24 parent0: (204) {G1,W6,D2,L2,V2,M2} { convergent_lines( Y, X ), !
% 0.81/1.24 convergent_lines( X, Y ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := Y
% 0.81/1.24 Y := X
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 1
% 0.81/1.24 1 ==> 0
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 resolution: (207) {G2,W6,D2,L2,V1,M2} { convergent_lines( X, skol2 ),
% 0.81/1.24 convergent_lines( skol1, X ) }.
% 0.81/1.24 parent0[0]: (40) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ),
% 0.81/1.24 convergent_lines( X, Y ) }.
% 0.81/1.24 parent1[1]: (39) {G1,W6,D2,L2,V1,M1} R(5,14) { convergent_lines( skol1, X )
% 0.81/1.24 , convergent_lines( skol2, X ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 Y := skol2
% 0.81/1.24 end
% 0.81/1.24 substitution1:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (44) {G2,W6,D2,L2,V1,M2} R(39,40) { convergent_lines( X, skol2
% 0.81/1.24 ), convergent_lines( skol1, X ) }.
% 0.81/1.24 parent0: (207) {G2,W6,D2,L2,V1,M2} { convergent_lines( X, skol2 ),
% 0.81/1.24 convergent_lines( skol1, X ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 1 ==> 1
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 resolution: (209) {G2,W6,D2,L2,V1,M2} { convergent_lines( X, skol1 ),
% 0.81/1.24 convergent_lines( X, skol2 ) }.
% 0.81/1.24 parent0[0]: (40) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ),
% 0.81/1.24 convergent_lines( X, Y ) }.
% 0.81/1.24 parent1[1]: (44) {G2,W6,D2,L2,V1,M2} R(39,40) { convergent_lines( X, skol2
% 0.81/1.24 ), convergent_lines( skol1, X ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 Y := skol1
% 0.81/1.24 end
% 0.81/1.24 substitution1:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (46) {G3,W6,D2,L2,V1,M1} R(44,40) { convergent_lines( X, skol1
% 0.81/1.24 ), convergent_lines( X, skol2 ) }.
% 0.81/1.24 parent0: (209) {G2,W6,D2,L2,V1,M2} { convergent_lines( X, skol1 ),
% 0.81/1.24 convergent_lines( X, skol2 ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 1 ==> 1
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 resolution: (210) {G1,W6,D2,L2,V1,M2} { ! convergent_lines( X, skol2 ),
% 0.81/1.24 convergent_lines( X, skol1 ) }.
% 0.81/1.24 parent0[0]: (28) {G2,W3,D2,L1,V0,M1} R(25,15) { ! distinct_lines( skol2,
% 0.81/1.24 skol1 ) }.
% 0.81/1.24 parent1[2]: (13) {G0,W9,D2,L3,V3,M1} I { ! convergent_lines( X, Y ),
% 0.81/1.24 convergent_lines( X, Z ), distinct_lines( Y, Z ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 end
% 0.81/1.24 substitution1:
% 0.81/1.24 X := X
% 0.81/1.24 Y := skol2
% 0.81/1.24 Z := skol1
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 resolution: (211) {G2,W6,D2,L2,V1,M2} { convergent_lines( X, skol1 ),
% 0.81/1.24 convergent_lines( X, skol1 ) }.
% 0.81/1.24 parent0[0]: (210) {G1,W6,D2,L2,V1,M2} { ! convergent_lines( X, skol2 ),
% 0.81/1.24 convergent_lines( X, skol1 ) }.
% 0.81/1.24 parent1[1]: (46) {G3,W6,D2,L2,V1,M1} R(44,40) { convergent_lines( X, skol1
% 0.81/1.24 ), convergent_lines( X, skol2 ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24 substitution1:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 factor: (212) {G2,W3,D2,L1,V1,M1} { convergent_lines( X, skol1 ) }.
% 0.81/1.24 parent0[0, 1]: (211) {G2,W6,D2,L2,V1,M2} { convergent_lines( X, skol1 ),
% 0.81/1.24 convergent_lines( X, skol1 ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (144) {G4,W3,D2,L1,V1,M1} R(13,28);r(46) { convergent_lines( X
% 0.81/1.24 , skol1 ) }.
% 0.81/1.24 parent0: (212) {G2,W3,D2,L1,V1,M1} { convergent_lines( X, skol1 ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := X
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 0 ==> 0
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 resolution: (213) {G1,W0,D0,L0,V0,M0} { }.
% 0.81/1.24 parent0[0]: (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.81/1.24 parent1[0]: (144) {G4,W3,D2,L1,V1,M1} R(13,28);r(46) { convergent_lines( X
% 0.81/1.24 , skol1 ) }.
% 0.81/1.24 substitution0:
% 0.81/1.24 X := skol1
% 0.81/1.24 end
% 0.81/1.24 substitution1:
% 0.81/1.24 X := skol1
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 subsumption: (150) {G5,W0,D0,L0,V0,M0} R(144,2) { }.
% 0.81/1.24 parent0: (213) {G1,W0,D0,L0,V0,M0} { }.
% 0.81/1.24 substitution0:
% 0.81/1.24 end
% 0.81/1.24 permutation0:
% 0.81/1.24 end
% 0.81/1.24
% 0.81/1.24 Proof check complete!
% 0.81/1.24
% 0.81/1.24 Memory use:
% 0.81/1.24
% 0.81/1.24 space for terms: 2269
% 0.81/1.24 space for clauses: 6019
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 clauses generated: 676
% 0.81/1.24 clauses kept: 151
% 0.81/1.24 clauses selected: 42
% 0.81/1.24 clauses deleted: 0
% 0.81/1.24 clauses inuse deleted: 0
% 0.81/1.24
% 0.81/1.24 subsentry: 3015
% 0.81/1.24 literals s-matched: 2057
% 0.81/1.24 literals matched: 2042
% 0.81/1.24 full subsumption: 1423
% 0.81/1.24
% 0.81/1.24 checksum: 71997
% 0.81/1.24
% 0.81/1.24
% 0.81/1.24 Bliksem ended
%------------------------------------------------------------------------------