TSTP Solution File: GEO219+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GEO219+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:55 EDT 2022
% Result : Theorem 1.09s 1.45s
% Output : Refutation 1.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GEO219+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sat Jun 18 13:26:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.09/1.45 *** allocated 10000 integers for termspace/termends
% 1.09/1.45 *** allocated 10000 integers for clauses
% 1.09/1.45 *** allocated 10000 integers for justifications
% 1.09/1.45 Bliksem 1.12
% 1.09/1.45
% 1.09/1.45
% 1.09/1.45 Automatic Strategy Selection
% 1.09/1.45
% 1.09/1.45
% 1.09/1.45 Clauses:
% 1.09/1.45
% 1.09/1.45 { ! distinct_points( X, X ) }.
% 1.09/1.45 { ! distinct_lines( X, X ) }.
% 1.09/1.45 { ! convergent_lines( X, X ) }.
% 1.09/1.45 { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 1.09/1.45 ) }.
% 1.09/1.45 { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 1.09/1.45 }.
% 1.09/1.45 { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 1.09/1.45 , Z ) }.
% 1.09/1.45 { ! distinct_points( X, Y ), ! apart_point_and_line( X, line_connecting( X
% 1.09/1.45 , Y ) ) }.
% 1.09/1.45 { ! distinct_points( X, Y ), ! apart_point_and_line( Y, line_connecting( X
% 1.09/1.45 , Y ) ) }.
% 1.09/1.45 { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 1.09/1.45 , Y ), X ) }.
% 1.09/1.45 { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 1.09/1.45 , Y ), Y ) }.
% 1.09/1.45 { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 1.09/1.45 ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ),
% 1.09/1.45 apart_point_and_line( Y, T ) }.
% 1.09/1.45 { ! apart_point_and_line( X, Y ), distinct_points( X, Z ),
% 1.09/1.45 apart_point_and_line( Z, Y ) }.
% 1.09/1.45 { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ),
% 1.09/1.45 apart_point_and_line( X, Z ) }.
% 1.09/1.45 { ! convergent_lines( X, Y ), distinct_lines( Y, Z ), convergent_lines( X,
% 1.09/1.45 Z ) }.
% 1.09/1.45 { convergent_lines( X, Y ), unorthogonal_lines( X, Y ) }.
% 1.09/1.45 { alpha1( X, Z ), convergent_lines( Z, Y ), ! convergent_lines( X, Y ), !
% 1.09/1.45 unorthogonal_lines( X, Y ) }.
% 1.09/1.45 { alpha1( X, Z ), unorthogonal_lines( Z, Y ), ! convergent_lines( X, Y ), !
% 1.09/1.45 unorthogonal_lines( X, Y ) }.
% 1.09/1.45 { ! alpha1( X, Y ), convergent_lines( Y, X ) }.
% 1.09/1.45 { ! alpha1( X, Y ), unorthogonal_lines( Y, X ) }.
% 1.09/1.45 { ! convergent_lines( Y, X ), ! unorthogonal_lines( Y, X ), alpha1( X, Y )
% 1.09/1.45 }.
% 1.09/1.45 { unorthogonal_lines( Z, X ), unorthogonal_lines( Z, Y ), !
% 1.09/1.45 convergent_lines( X, Y ) }.
% 1.09/1.45 { ! unorthogonal_lines( skol3, skol1 ) }.
% 1.09/1.45 { ! convergent_lines( skol3, skol2 ) }.
% 1.09/1.45 { unorthogonal_lines( skol1, skol2 ) }.
% 1.09/1.45
% 1.09/1.45 percentage equality = 0.000000, percentage horn = 0.541667
% 1.09/1.45 This a non-horn, non-equality problem
% 1.09/1.45
% 1.09/1.45
% 1.09/1.45 Options Used:
% 1.09/1.45
% 1.09/1.45 useres = 1
% 1.09/1.45 useparamod = 0
% 1.09/1.45 useeqrefl = 0
% 1.09/1.45 useeqfact = 0
% 1.09/1.45 usefactor = 1
% 1.09/1.45 usesimpsplitting = 0
% 1.09/1.45 usesimpdemod = 0
% 1.09/1.45 usesimpres = 3
% 1.09/1.45
% 1.09/1.45 resimpinuse = 1000
% 1.09/1.45 resimpclauses = 20000
% 1.09/1.45 substype = standard
% 1.09/1.45 backwardsubs = 1
% 1.09/1.45 selectoldest = 5
% 1.09/1.45
% 1.09/1.45 litorderings [0] = split
% 1.09/1.45 litorderings [1] = liftord
% 1.09/1.45
% 1.09/1.45 termordering = none
% 1.09/1.45
% 1.09/1.45 litapriori = 1
% 1.09/1.45 termapriori = 0
% 1.09/1.45 litaposteriori = 0
% 1.09/1.45 termaposteriori = 0
% 1.09/1.45 demodaposteriori = 0
% 1.09/1.45 ordereqreflfact = 0
% 1.09/1.45
% 1.09/1.45 litselect = none
% 1.09/1.45
% 1.09/1.45 maxweight = 15
% 1.09/1.45 maxdepth = 30000
% 1.09/1.45 maxlength = 115
% 1.09/1.45 maxnrvars = 195
% 1.09/1.45 excuselevel = 1
% 1.09/1.45 increasemaxweight = 1
% 1.09/1.45
% 1.09/1.45 maxselected = 10000000
% 1.09/1.45 maxnrclauses = 10000000
% 1.09/1.45
% 1.09/1.45 showgenerated = 0
% 1.09/1.45 showkept = 0
% 1.09/1.45 showselected = 0
% 1.09/1.45 showdeleted = 0
% 1.09/1.45 showresimp = 1
% 1.09/1.45 showstatus = 2000
% 1.09/1.45
% 1.09/1.45 prologoutput = 0
% 1.09/1.45 nrgoals = 5000000
% 1.09/1.45 totalproof = 1
% 1.09/1.45
% 1.09/1.45 Symbols occurring in the translation:
% 1.09/1.45
% 1.09/1.45 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.09/1.45 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 1.09/1.45 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 1.09/1.45 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.09/1.45 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.09/1.45 distinct_points [36, 2] (w:1, o:47, a:1, s:1, b:0),
% 1.09/1.45 distinct_lines [37, 2] (w:1, o:48, a:1, s:1, b:0),
% 1.09/1.45 convergent_lines [38, 2] (w:1, o:46, a:1, s:1, b:0),
% 1.09/1.45 line_connecting [41, 2] (w:1, o:49, a:1, s:1, b:0),
% 1.09/1.45 apart_point_and_line [42, 2] (w:1, o:50, a:1, s:1, b:0),
% 1.09/1.45 intersection_point [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.09/1.45 unorthogonal_lines [48, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.09/1.45 alpha1 [50, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.09/1.45 skol1 [51, 0] (w:1, o:14, a:1, s:1, b:0),
% 1.09/1.45 skol2 [52, 0] (w:1, o:15, a:1, s:1, b:0),
% 1.09/1.45 skol3 [53, 0] (w:1, o:16, a:1, s:1, b:0).
% 1.09/1.45
% 1.09/1.45
% 1.09/1.45 Starting Search:
% 1.09/1.45
% 1.09/1.45 *** allocated 15000 integers for clauses
% 1.09/1.45 *** allocated 22500 integers for clauses
% 1.09/1.45 *** allocated 33750 integers for clauses
% 1.09/1.45
% 1.09/1.45 Bliksems!, er is een bewijs:
% 1.09/1.45 % SZS status Theorem
% 1.09/1.45 % SZS output start Refutation
% 1.09/1.45
% 1.09/1.45 (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), convergent_lines( Y,
% 1.09/1.45 Z ), ! convergent_lines( X, Y ) }.
% 1.09/1.45 (14) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), unorthogonal_lines(
% 1.09/1.45 X, Y ) }.
% 1.09/1.45 (15) {G0,W12,D2,L4,V3,M1} I { convergent_lines( Z, Y ), ! convergent_lines
% 1.09/1.45 ( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z ) }.
% 1.09/1.45 (18) {G0,W6,D2,L2,V2,M1} I { unorthogonal_lines( Y, X ), ! alpha1( X, Y )
% 1.09/1.45 }.
% 1.09/1.45 (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1 ) }.
% 1.09/1.45 (22) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol3, skol2 ) }.
% 1.09/1.45 (23) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2 ) }.
% 1.09/1.45 (34) {G1,W3,D2,L1,V0,M1} R(14,21) { convergent_lines( skol3, skol1 ) }.
% 1.09/1.45 (37) {G2,W6,D2,L2,V1,M1} R(5,34) { convergent_lines( skol1, X ),
% 1.09/1.45 convergent_lines( skol3, X ) }.
% 1.09/1.45 (165) {G1,W12,D2,L4,V3,M2} R(15,18) { convergent_lines( X, Y ), !
% 1.09/1.45 convergent_lines( Z, Y ), unorthogonal_lines( X, Z ), !
% 1.09/1.45 unorthogonal_lines( Z, Y ) }.
% 1.09/1.45 (646) {G3,W6,D2,L2,V1,M1} R(165,21);r(37) { convergent_lines( skol3, X ), !
% 1.09/1.45 unorthogonal_lines( skol1, X ) }.
% 1.09/1.45 (652) {G4,W0,D0,L0,V0,M0} R(646,23);r(22) { }.
% 1.09/1.45
% 1.09/1.45
% 1.09/1.45 % SZS output end Refutation
% 1.09/1.45 found a proof!
% 1.09/1.45
% 1.09/1.45 *** allocated 15000 integers for termspace/termends
% 1.09/1.45
% 1.09/1.45 Unprocessed initial clauses:
% 1.09/1.45
% 1.09/1.45 (654) {G0,W3,D2,L1,V1,M1} { ! distinct_points( X, X ) }.
% 1.09/1.45 (655) {G0,W3,D2,L1,V1,M1} { ! distinct_lines( X, X ) }.
% 1.09/1.45 (656) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 1.09/1.45 (657) {G0,W9,D2,L3,V3,M3} { ! distinct_points( X, Y ), distinct_points( X
% 1.09/1.45 , Z ), distinct_points( Y, Z ) }.
% 1.09/1.45 (658) {G0,W9,D2,L3,V3,M3} { ! distinct_lines( X, Y ), distinct_lines( X, Z
% 1.09/1.45 ), distinct_lines( Y, Z ) }.
% 1.09/1.45 (659) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), convergent_lines(
% 1.09/1.45 X, Z ), convergent_lines( Y, Z ) }.
% 1.09/1.45 (660) {G0,W8,D3,L2,V2,M2} { ! distinct_points( X, Y ), !
% 1.09/1.45 apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 1.09/1.45 (661) {G0,W8,D3,L2,V2,M2} { ! distinct_points( X, Y ), !
% 1.09/1.45 apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 1.09/1.45 (662) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 1.09/1.45 apart_point_and_line( intersection_point( X, Y ), X ) }.
% 1.09/1.45 (663) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 1.09/1.45 apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 1.09/1.45 (664) {G0,W18,D2,L6,V4,M6} { ! distinct_points( X, Y ), ! distinct_lines(
% 1.09/1.45 Z, T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ),
% 1.09/1.45 apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 1.09/1.45 (665) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ),
% 1.09/1.45 distinct_points( X, Z ), apart_point_and_line( Z, Y ) }.
% 1.09/1.45 (666) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_lines
% 1.09/1.45 ( Y, Z ), apart_point_and_line( X, Z ) }.
% 1.09/1.45 (667) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), distinct_lines( Y
% 1.09/1.45 , Z ), convergent_lines( X, Z ) }.
% 1.09/1.45 (668) {G0,W6,D2,L2,V2,M2} { convergent_lines( X, Y ), unorthogonal_lines(
% 1.09/1.45 X, Y ) }.
% 1.09/1.45 (669) {G0,W12,D2,L4,V3,M4} { alpha1( X, Z ), convergent_lines( Z, Y ), !
% 1.09/1.45 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 1.09/1.45 (670) {G0,W12,D2,L4,V3,M4} { alpha1( X, Z ), unorthogonal_lines( Z, Y ), !
% 1.09/1.45 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 1.09/1.45 (671) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), convergent_lines( Y, X ) }.
% 1.09/1.45 (672) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), unorthogonal_lines( Y, X )
% 1.09/1.45 }.
% 1.09/1.45 (673) {G0,W9,D2,L3,V2,M3} { ! convergent_lines( Y, X ), !
% 1.09/1.45 unorthogonal_lines( Y, X ), alpha1( X, Y ) }.
% 1.09/1.45 (674) {G0,W9,D2,L3,V3,M3} { unorthogonal_lines( Z, X ), unorthogonal_lines
% 1.09/1.45 ( Z, Y ), ! convergent_lines( X, Y ) }.
% 1.09/1.45 (675) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol3, skol1 ) }.
% 1.09/1.45 (676) {G0,W3,D2,L1,V0,M1} { ! convergent_lines( skol3, skol2 ) }.
% 1.09/1.45 (677) {G0,W3,D2,L1,V0,M1} { unorthogonal_lines( skol1, skol2 ) }.
% 1.09/1.45
% 1.09/1.45
% 1.09/1.45 Total Proof:
% 1.09/1.45
% 1.09/1.45 subsumption: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 1.09/1.45 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 1.09/1.45 parent0: (659) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ),
% 1.09/1.45 convergent_lines( X, Z ), convergent_lines( Y, Z ) }.
% 1.09/1.45 substitution0:
% 1.09/1.45 X := X
% 1.09/1.45 Y := Y
% 1.09/1.45 Z := Z
% 1.09/1.45 end
% 1.09/1.45 permutation0:
% 1.09/1.45 0 ==> 2
% 1.09/1.45 1 ==> 0
% 1.09/1.45 2 ==> 1
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 subsumption: (14) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ),
% 1.09/1.45 unorthogonal_lines( X, Y ) }.
% 1.09/1.45 parent0: (668) {G0,W6,D2,L2,V2,M2} { convergent_lines( X, Y ),
% 1.09/1.45 unorthogonal_lines( X, Y ) }.
% 1.09/1.45 substitution0:
% 1.09/1.45 X := X
% 1.09/1.45 Y := Y
% 1.09/1.45 end
% 1.09/1.45 permutation0:
% 1.09/1.45 0 ==> 0
% 1.09/1.45 1 ==> 1
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 subsumption: (15) {G0,W12,D2,L4,V3,M1} I { convergent_lines( Z, Y ), !
% 1.09/1.45 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z )
% 1.09/1.45 }.
% 1.09/1.45 parent0: (669) {G0,W12,D2,L4,V3,M4} { alpha1( X, Z ), convergent_lines( Z
% 1.09/1.45 , Y ), ! convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 1.09/1.45 substitution0:
% 1.09/1.45 X := X
% 1.09/1.45 Y := Y
% 1.09/1.45 Z := Z
% 1.09/1.45 end
% 1.09/1.45 permutation0:
% 1.09/1.45 0 ==> 3
% 1.09/1.45 1 ==> 0
% 1.09/1.45 2 ==> 1
% 1.09/1.45 3 ==> 2
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 subsumption: (18) {G0,W6,D2,L2,V2,M1} I { unorthogonal_lines( Y, X ), !
% 1.09/1.45 alpha1( X, Y ) }.
% 1.09/1.45 parent0: (672) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), unorthogonal_lines
% 1.09/1.45 ( Y, X ) }.
% 1.09/1.45 substitution0:
% 1.09/1.45 X := X
% 1.09/1.45 Y := Y
% 1.09/1.45 end
% 1.09/1.45 permutation0:
% 1.09/1.45 0 ==> 1
% 1.09/1.45 1 ==> 0
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 subsumption: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3,
% 1.09/1.45 skol1 ) }.
% 1.09/1.45 parent0: (675) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol3, skol1 )
% 1.09/1.45 }.
% 1.09/1.45 substitution0:
% 1.09/1.45 end
% 1.09/1.45 permutation0:
% 1.09/1.45 0 ==> 0
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 subsumption: (22) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol3, skol2
% 1.09/1.45 ) }.
% 1.09/1.45 parent0: (676) {G0,W3,D2,L1,V0,M1} { ! convergent_lines( skol3, skol2 )
% 1.09/1.45 }.
% 1.09/1.45 substitution0:
% 1.09/1.45 end
% 1.09/1.45 permutation0:
% 1.09/1.45 0 ==> 0
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 subsumption: (23) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2
% 1.09/1.45 ) }.
% 1.09/1.45 parent0: (677) {G0,W3,D2,L1,V0,M1} { unorthogonal_lines( skol1, skol2 )
% 1.09/1.45 }.
% 1.09/1.45 substitution0:
% 1.09/1.45 end
% 1.09/1.45 permutation0:
% 1.09/1.45 0 ==> 0
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 resolution: (738) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol3, skol1 )
% 1.09/1.45 }.
% 1.09/1.45 parent0[0]: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1
% 1.09/1.45 ) }.
% 1.09/1.45 parent1[1]: (14) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ),
% 1.09/1.45 unorthogonal_lines( X, Y ) }.
% 1.09/1.45 substitution0:
% 1.09/1.45 end
% 1.09/1.45 substitution1:
% 1.09/1.45 X := skol3
% 1.09/1.45 Y := skol1
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 subsumption: (34) {G1,W3,D2,L1,V0,M1} R(14,21) { convergent_lines( skol3,
% 1.09/1.45 skol1 ) }.
% 1.09/1.45 parent0: (738) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol3, skol1 ) }.
% 1.09/1.45 substitution0:
% 1.09/1.45 end
% 1.09/1.45 permutation0:
% 1.09/1.45 0 ==> 0
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 resolution: (739) {G1,W6,D2,L2,V1,M2} { convergent_lines( skol3, X ),
% 1.09/1.45 convergent_lines( skol1, X ) }.
% 1.09/1.45 parent0[2]: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 1.09/1.45 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 1.09/1.45 parent1[0]: (34) {G1,W3,D2,L1,V0,M1} R(14,21) { convergent_lines( skol3,
% 1.09/1.45 skol1 ) }.
% 1.09/1.45 substitution0:
% 1.09/1.45 X := skol3
% 1.09/1.45 Y := skol1
% 1.09/1.45 Z := X
% 1.09/1.45 end
% 1.09/1.45 substitution1:
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 subsumption: (37) {G2,W6,D2,L2,V1,M1} R(5,34) { convergent_lines( skol1, X
% 1.09/1.45 ), convergent_lines( skol3, X ) }.
% 1.09/1.45 parent0: (739) {G1,W6,D2,L2,V1,M2} { convergent_lines( skol3, X ),
% 1.09/1.45 convergent_lines( skol1, X ) }.
% 1.09/1.45 substitution0:
% 1.09/1.45 X := X
% 1.09/1.45 end
% 1.09/1.45 permutation0:
% 1.09/1.45 0 ==> 1
% 1.09/1.45 1 ==> 0
% 1.09/1.45 end
% 1.09/1.45
% 1.09/1.45 resolution: (741) {G1,W12,D2,L4,V3,M4} { unorthogonal_lines( X, Y ),
% 1.09/1.45 convergent_lines( X, Z ), ! convergent_lines( Y, Z ), !
% 1.09/1.45 unorthogonal_lines( Y, Z ) }.
% 1.09/1.45 parent0[1]: (18) {G0,W6,D2,L2,V2,M1} I { unorthogonal_lines( Y, X ), !
% 1.09/1.46 alpha1( X, Y ) }.
% 1.09/1.46 parent1[3]: (15) {G0,W12,D2,L4,V3,M1} I { convergent_lines( Z, Y ), !
% 1.09/1.46 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z )
% 1.09/1.46 }.
% 1.09/1.46 substitution0:
% 1.09/1.46 X := Y
% 1.09/1.46 Y := X
% 1.09/1.46 end
% 1.09/1.46 substitution1:
% 1.09/1.46 X := Y
% 1.09/1.46 Y := Z
% 1.09/1.46 Z := X
% 1.09/1.46 end
% 1.09/1.46
% 1.09/1.46 subsumption: (165) {G1,W12,D2,L4,V3,M2} R(15,18) { convergent_lines( X, Y )
% 1.09/1.46 , ! convergent_lines( Z, Y ), unorthogonal_lines( X, Z ), !
% 1.09/1.46 unorthogonal_lines( Z, Y ) }.
% 1.09/1.46 parent0: (741) {G1,W12,D2,L4,V3,M4} { unorthogonal_lines( X, Y ),
% 1.09/1.46 convergent_lines( X, Z ), ! convergent_lines( Y, Z ), !
% 1.09/1.46 unorthogonal_lines( Y, Z ) }.
% 1.09/1.46 substitution0:
% 1.09/1.46 X := X
% 1.09/1.46 Y := Z
% 1.09/1.46 Z := Y
% 1.09/1.46 end
% 1.09/1.46 permutation0:
% 1.09/1.46 0 ==> 2
% 1.09/1.46 1 ==> 0
% 1.09/1.46 2 ==> 1
% 1.09/1.46 3 ==> 3
% 1.09/1.46 end
% 1.09/1.46
% 1.09/1.46 resolution: (742) {G1,W9,D2,L3,V1,M3} { convergent_lines( skol3, X ), !
% 1.09/1.46 convergent_lines( skol1, X ), ! unorthogonal_lines( skol1, X ) }.
% 1.09/1.46 parent0[0]: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1
% 1.09/1.46 ) }.
% 1.09/1.46 parent1[2]: (165) {G1,W12,D2,L4,V3,M2} R(15,18) { convergent_lines( X, Y )
% 1.09/1.46 , ! convergent_lines( Z, Y ), unorthogonal_lines( X, Z ), !
% 1.09/1.46 unorthogonal_lines( Z, Y ) }.
% 1.09/1.46 substitution0:
% 1.09/1.46 end
% 1.09/1.46 substitution1:
% 1.09/1.46 X := skol3
% 1.09/1.46 Y := X
% 1.09/1.46 Z := skol1
% 1.09/1.46 end
% 1.09/1.46
% 1.09/1.46 resolution: (743) {G2,W9,D2,L3,V1,M3} { convergent_lines( skol3, X ), !
% 1.09/1.46 unorthogonal_lines( skol1, X ), convergent_lines( skol3, X ) }.
% 1.09/1.46 parent0[1]: (742) {G1,W9,D2,L3,V1,M3} { convergent_lines( skol3, X ), !
% 1.09/1.46 convergent_lines( skol1, X ), ! unorthogonal_lines( skol1, X ) }.
% 1.09/1.46 parent1[0]: (37) {G2,W6,D2,L2,V1,M1} R(5,34) { convergent_lines( skol1, X )
% 1.09/1.46 , convergent_lines( skol3, X ) }.
% 1.09/1.46 substitution0:
% 1.09/1.46 X := X
% 1.09/1.46 end
% 1.09/1.46 substitution1:
% 1.09/1.46 X := X
% 1.09/1.46 end
% 1.09/1.46
% 1.09/1.46 factor: (744) {G2,W6,D2,L2,V1,M2} { convergent_lines( skol3, X ), !
% 1.09/1.46 unorthogonal_lines( skol1, X ) }.
% 1.09/1.46 parent0[0, 2]: (743) {G2,W9,D2,L3,V1,M3} { convergent_lines( skol3, X ), !
% 1.09/1.46 unorthogonal_lines( skol1, X ), convergent_lines( skol3, X ) }.
% 1.09/1.46 substitution0:
% 1.09/1.46 X := X
% 1.09/1.46 end
% 1.09/1.46
% 1.09/1.46 subsumption: (646) {G3,W6,D2,L2,V1,M1} R(165,21);r(37) { convergent_lines(
% 1.09/1.46 skol3, X ), ! unorthogonal_lines( skol1, X ) }.
% 1.09/1.46 parent0: (744) {G2,W6,D2,L2,V1,M2} { convergent_lines( skol3, X ), !
% 1.09/1.46 unorthogonal_lines( skol1, X ) }.
% 1.09/1.46 substitution0:
% 1.09/1.46 X := X
% 1.09/1.46 end
% 1.09/1.46 permutation0:
% 1.09/1.46 0 ==> 0
% 1.09/1.46 1 ==> 1
% 1.09/1.46 end
% 1.09/1.46
% 1.09/1.46 resolution: (745) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol3, skol2 )
% 1.09/1.46 }.
% 1.09/1.46 parent0[1]: (646) {G3,W6,D2,L2,V1,M1} R(165,21);r(37) { convergent_lines(
% 1.09/1.46 skol3, X ), ! unorthogonal_lines( skol1, X ) }.
% 1.09/1.46 parent1[0]: (23) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2 )
% 1.09/1.46 }.
% 1.09/1.46 substitution0:
% 1.09/1.46 X := skol2
% 1.09/1.46 end
% 1.09/1.46 substitution1:
% 1.09/1.46 end
% 1.09/1.46
% 1.09/1.46 resolution: (746) {G1,W0,D0,L0,V0,M0} { }.
% 1.09/1.46 parent0[0]: (22) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol3, skol2 )
% 1.09/1.46 }.
% 1.09/1.46 parent1[0]: (745) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol3, skol2 )
% 1.09/1.46 }.
% 1.09/1.46 substitution0:
% 1.09/1.46 end
% 1.09/1.46 substitution1:
% 1.09/1.46 end
% 1.09/1.46
% 1.09/1.46 subsumption: (652) {G4,W0,D0,L0,V0,M0} R(646,23);r(22) { }.
% 1.09/1.46 parent0: (746) {G1,W0,D0,L0,V0,M0} { }.
% 1.09/1.46 substitution0:
% 1.09/1.46 end
% 1.09/1.46 permutation0:
% 1.09/1.46 end
% 1.09/1.46
% 1.09/1.46 Proof check complete!
% 1.09/1.46
% 1.09/1.46 Memory use:
% 1.09/1.46
% 1.09/1.46 space for terms: 9865
% 1.09/1.46 space for clauses: 23184
% 1.09/1.46
% 1.09/1.46
% 1.09/1.46 clauses generated: 27618
% 1.09/1.46 clauses kept: 653
% 1.09/1.46 clauses selected: 242
% 1.09/1.46 clauses deleted: 0
% 1.09/1.46 clauses inuse deleted: 0
% 1.09/1.46
% 1.09/1.46 subsentry: 352674
% 1.09/1.46 literals s-matched: 222404
% 1.09/1.46 literals matched: 222374
% 1.09/1.46 full subsumption: 196990
% 1.09/1.46
% 1.09/1.46 checksum: -367028
% 1.09/1.46
% 1.09/1.46
% 1.09/1.46 Bliksem ended
%------------------------------------------------------------------------------