TSTP Solution File: GEO219+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GEO219+2 : 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:52:55 EDT 2022
% Result : Theorem 0.75s 1.69s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO219+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n005.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 03:58:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.75/1.69 *** allocated 10000 integers for termspace/termends
% 0.75/1.69 *** allocated 10000 integers for clauses
% 0.75/1.69 *** allocated 10000 integers for justifications
% 0.75/1.69 Bliksem 1.12
% 0.75/1.69
% 0.75/1.69
% 0.75/1.69 Automatic Strategy Selection
% 0.75/1.69
% 0.75/1.69
% 0.75/1.69 Clauses:
% 0.75/1.69
% 0.75/1.69 { ! distinct_points( X, X ) }.
% 0.75/1.69 { ! distinct_lines( X, X ) }.
% 0.75/1.69 { ! convergent_lines( X, X ) }.
% 0.75/1.69 { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.75/1.69 ) }.
% 0.75/1.69 { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.75/1.69 }.
% 0.75/1.69 { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.75/1.69 , Z ) }.
% 0.75/1.69 { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 0.75/1.69 , Y ) ), distinct_points( Z, X ) }.
% 0.75/1.69 { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 0.75/1.69 , Y ) ), distinct_points( Z, Y ) }.
% 0.75/1.69 { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, X ),
% 0.75/1.69 distinct_points( Z, intersection_point( X, Y ) ) }.
% 0.75/1.69 { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, Y ),
% 0.75/1.69 distinct_points( Z, intersection_point( X, Y ) ) }.
% 0.75/1.69 { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.75/1.69 ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ),
% 0.75/1.69 apart_point_and_line( Y, T ) }.
% 0.75/1.69 { ! apart_point_and_line( X, Y ), distinct_points( X, Z ),
% 0.75/1.69 apart_point_and_line( Z, Y ) }.
% 0.75/1.69 { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ),
% 0.75/1.69 apart_point_and_line( X, Z ) }.
% 0.75/1.69 { ! convergent_lines( X, Y ), distinct_lines( X, Y ) }.
% 0.75/1.69 { convergent_lines( X, Y ), unorthogonal_lines( X, Y ) }.
% 0.75/1.69 { alpha1( X, Z ), convergent_lines( Z, Y ), ! convergent_lines( X, Y ), !
% 0.75/1.69 unorthogonal_lines( X, Y ) }.
% 0.75/1.69 { alpha1( X, Z ), unorthogonal_lines( Z, Y ), ! convergent_lines( X, Y ), !
% 0.75/1.69 unorthogonal_lines( X, Y ) }.
% 0.75/1.69 { ! alpha1( X, Y ), convergent_lines( Y, X ) }.
% 0.75/1.69 { ! alpha1( X, Y ), unorthogonal_lines( Y, X ) }.
% 0.75/1.69 { ! convergent_lines( Y, X ), ! unorthogonal_lines( Y, X ), alpha1( X, Y )
% 0.75/1.69 }.
% 0.75/1.69 { unorthogonal_lines( Z, X ), unorthogonal_lines( Z, Y ), !
% 0.75/1.69 convergent_lines( X, Y ) }.
% 0.75/1.69 { ! unorthogonal_lines( skol3, skol1 ) }.
% 0.75/1.69 { ! convergent_lines( skol3, skol2 ) }.
% 0.75/1.69 { unorthogonal_lines( skol1, skol2 ) }.
% 0.75/1.69
% 0.75/1.69 percentage equality = 0.000000, percentage horn = 0.583333
% 0.75/1.69 This a non-horn, non-equality problem
% 0.75/1.69
% 0.75/1.69
% 0.75/1.69 Options Used:
% 0.75/1.69
% 0.75/1.69 useres = 1
% 0.75/1.69 useparamod = 0
% 0.75/1.69 useeqrefl = 0
% 0.75/1.69 useeqfact = 0
% 0.75/1.69 usefactor = 1
% 0.75/1.69 usesimpsplitting = 0
% 0.75/1.69 usesimpdemod = 0
% 0.75/1.69 usesimpres = 3
% 0.75/1.69
% 0.75/1.69 resimpinuse = 1000
% 0.75/1.69 resimpclauses = 20000
% 0.75/1.69 substype = standard
% 0.75/1.69 backwardsubs = 1
% 0.75/1.69 selectoldest = 5
% 0.75/1.69
% 0.75/1.69 litorderings [0] = split
% 0.75/1.69 litorderings [1] = liftord
% 0.75/1.69
% 0.75/1.69 termordering = none
% 0.75/1.69
% 0.75/1.69 litapriori = 1
% 0.75/1.69 termapriori = 0
% 0.75/1.69 litaposteriori = 0
% 0.75/1.69 termaposteriori = 0
% 0.75/1.69 demodaposteriori = 0
% 0.75/1.69 ordereqreflfact = 0
% 0.75/1.69
% 0.75/1.69 litselect = none
% 0.75/1.69
% 0.75/1.69 maxweight = 15
% 0.75/1.69 maxdepth = 30000
% 0.75/1.69 maxlength = 115
% 0.75/1.69 maxnrvars = 195
% 0.75/1.69 excuselevel = 1
% 0.75/1.69 increasemaxweight = 1
% 0.75/1.69
% 0.75/1.69 maxselected = 10000000
% 0.75/1.69 maxnrclauses = 10000000
% 0.75/1.69
% 0.75/1.69 showgenerated = 0
% 0.75/1.69 showkept = 0
% 0.75/1.69 showselected = 0
% 0.75/1.69 showdeleted = 0
% 0.75/1.69 showresimp = 1
% 0.75/1.69 showstatus = 2000
% 0.75/1.69
% 0.75/1.69 prologoutput = 0
% 0.75/1.69 nrgoals = 5000000
% 0.75/1.69 totalproof = 1
% 0.75/1.69
% 0.75/1.69 Symbols occurring in the translation:
% 0.75/1.69
% 0.75/1.69 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.75/1.69 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.75/1.69 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.75/1.69 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.69 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.75/1.69 distinct_points [36, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.75/1.69 distinct_lines [37, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.75/1.69 convergent_lines [38, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.75/1.69 line_connecting [41, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.75/1.69 apart_point_and_line [42, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.75/1.69 intersection_point [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.75/1.69 unorthogonal_lines [48, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.75/1.69 alpha1 [50, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.75/1.69 skol1 [51, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.75/1.69 skol2 [52, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.75/1.69 skol3 [53, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.75/1.69
% 0.75/1.69
% 0.75/1.69 Starting Search:
% 0.75/1.69
% 0.75/1.69 *** allocated 15000 integers for clauses
% 0.75/1.69 *** allocated 22500 integers for clauses
% 0.75/1.69 *** allocated 33750 integers for clauses
% 0.75/1.69 *** allocated 15000 integers for termspace/termends
% 0.75/1.69
% 0.75/1.69 Bliksems!, er is een bewijs:
% 0.75/1.69 % SZS status Theorem
% 0.75/1.69 % SZS output start Refutation
% 0.75/1.69
% 0.75/1.69 (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), convergent_lines( Y,
% 0.75/1.69 Z ), ! convergent_lines( X, Y ) }.
% 0.75/1.69 (14) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), unorthogonal_lines(
% 0.75/1.69 X, Y ) }.
% 0.75/1.69 (15) {G0,W12,D2,L4,V3,M1} I { convergent_lines( Z, Y ), ! convergent_lines
% 0.75/1.69 ( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z ) }.
% 0.75/1.69 (18) {G0,W6,D2,L2,V2,M1} I { unorthogonal_lines( Y, X ), ! alpha1( X, Y )
% 0.75/1.69 }.
% 0.75/1.69 (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1 ) }.
% 0.75/1.69 (22) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol3, skol2 ) }.
% 0.75/1.69 (23) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2 ) }.
% 0.75/1.69 (34) {G1,W3,D2,L1,V0,M1} R(14,21) { convergent_lines( skol3, skol1 ) }.
% 0.75/1.69 (39) {G2,W6,D2,L2,V1,M1} R(5,34) { convergent_lines( skol1, X ),
% 0.75/1.69 convergent_lines( skol3, X ) }.
% 0.75/1.69 (159) {G1,W12,D2,L4,V3,M2} R(15,18) { convergent_lines( X, Y ), !
% 0.75/1.69 convergent_lines( Z, Y ), unorthogonal_lines( X, Z ), !
% 0.75/1.69 unorthogonal_lines( Z, Y ) }.
% 0.75/1.69 (660) {G3,W6,D2,L2,V1,M1} R(159,21);r(39) { convergent_lines( skol3, X ), !
% 0.75/1.69 unorthogonal_lines( skol1, X ) }.
% 0.75/1.69 (666) {G4,W0,D0,L0,V0,M0} R(660,23);r(22) { }.
% 0.75/1.69
% 0.75/1.69
% 0.75/1.69 % SZS output end Refutation
% 0.75/1.69 found a proof!
% 0.75/1.69
% 0.75/1.69
% 0.75/1.69 Unprocessed initial clauses:
% 0.75/1.69
% 0.75/1.69 (668) {G0,W3,D2,L1,V1,M1} { ! distinct_points( X, X ) }.
% 0.75/1.69 (669) {G0,W3,D2,L1,V1,M1} { ! distinct_lines( X, X ) }.
% 0.75/1.69 (670) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 0.75/1.69 (671) {G0,W9,D2,L3,V3,M3} { ! distinct_points( X, Y ), distinct_points( X
% 0.75/1.69 , Z ), distinct_points( Y, Z ) }.
% 0.75/1.69 (672) {G0,W9,D2,L3,V3,M3} { ! distinct_lines( X, Y ), distinct_lines( X, Z
% 0.75/1.69 ), distinct_lines( Y, Z ) }.
% 0.75/1.69 (673) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), convergent_lines(
% 0.75/1.69 X, Z ), convergent_lines( Y, Z ) }.
% 0.75/1.69 (674) {G0,W11,D3,L3,V3,M3} { ! distinct_points( X, Y ), !
% 0.75/1.69 apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, X
% 0.75/1.69 ) }.
% 0.75/1.69 (675) {G0,W11,D3,L3,V3,M3} { ! distinct_points( X, Y ), !
% 0.75/1.69 apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, Y
% 0.75/1.69 ) }.
% 0.75/1.69 (676) {G0,W11,D3,L3,V3,M3} { ! convergent_lines( X, Y ), !
% 0.75/1.69 apart_point_and_line( Z, X ), distinct_points( Z, intersection_point( X,
% 0.75/1.69 Y ) ) }.
% 0.75/1.69 (677) {G0,W11,D3,L3,V3,M3} { ! convergent_lines( X, Y ), !
% 0.75/1.69 apart_point_and_line( Z, Y ), distinct_points( Z, intersection_point( X,
% 0.75/1.69 Y ) ) }.
% 0.75/1.69 (678) {G0,W18,D2,L6,V4,M6} { ! distinct_points( X, Y ), ! distinct_lines(
% 0.75/1.69 Z, T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ),
% 0.75/1.69 apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.75/1.69 (679) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ),
% 0.75/1.69 distinct_points( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.75/1.69 (680) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_lines
% 0.75/1.69 ( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.75/1.69 (681) {G0,W6,D2,L2,V2,M2} { ! convergent_lines( X, Y ), distinct_lines( X
% 0.75/1.69 , Y ) }.
% 0.75/1.69 (682) {G0,W6,D2,L2,V2,M2} { convergent_lines( X, Y ), unorthogonal_lines(
% 0.75/1.69 X, Y ) }.
% 0.75/1.69 (683) {G0,W12,D2,L4,V3,M4} { alpha1( X, Z ), convergent_lines( Z, Y ), !
% 0.75/1.69 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 0.75/1.69 (684) {G0,W12,D2,L4,V3,M4} { alpha1( X, Z ), unorthogonal_lines( Z, Y ), !
% 0.75/1.69 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 0.75/1.69 (685) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), convergent_lines( Y, X ) }.
% 0.75/1.69 (686) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), unorthogonal_lines( Y, X )
% 0.75/1.69 }.
% 0.75/1.69 (687) {G0,W9,D2,L3,V2,M3} { ! convergent_lines( Y, X ), !
% 0.75/1.69 unorthogonal_lines( Y, X ), alpha1( X, Y ) }.
% 0.75/1.69 (688) {G0,W9,D2,L3,V3,M3} { unorthogonal_lines( Z, X ), unorthogonal_lines
% 0.75/1.69 ( Z, Y ), ! convergent_lines( X, Y ) }.
% 0.75/1.69 (689) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol3, skol1 ) }.
% 0.75/1.69 (690) {G0,W3,D2,L1,V0,M1} { ! convergent_lines( skol3, skol2 ) }.
% 0.75/1.69 (691) {G0,W3,D2,L1,V0,M1} { unorthogonal_lines( skol1, skol2 ) }.
% 0.75/1.69
% 0.75/1.69
% 0.75/1.69 Total Proof:
% 0.75/1.69
% 0.75/1.69 subsumption: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 0.75/1.69 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 0.75/1.69 parent0: (673) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ),
% 0.75/1.69 convergent_lines( X, Z ), convergent_lines( Y, Z ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := X
% 0.75/1.69 Y := Y
% 0.75/1.69 Z := Z
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 2
% 0.75/1.69 1 ==> 0
% 0.75/1.69 2 ==> 1
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (14) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ),
% 0.75/1.69 unorthogonal_lines( X, Y ) }.
% 0.75/1.69 parent0: (682) {G0,W6,D2,L2,V2,M2} { convergent_lines( X, Y ),
% 0.75/1.69 unorthogonal_lines( X, Y ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := X
% 0.75/1.69 Y := Y
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 0
% 0.75/1.69 1 ==> 1
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (15) {G0,W12,D2,L4,V3,M1} I { convergent_lines( Z, Y ), !
% 0.75/1.69 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z )
% 0.75/1.69 }.
% 0.75/1.69 parent0: (683) {G0,W12,D2,L4,V3,M4} { alpha1( X, Z ), convergent_lines( Z
% 0.75/1.69 , Y ), ! convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := X
% 0.75/1.69 Y := Y
% 0.75/1.69 Z := Z
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 3
% 0.75/1.69 1 ==> 0
% 0.75/1.69 2 ==> 1
% 0.75/1.69 3 ==> 2
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (18) {G0,W6,D2,L2,V2,M1} I { unorthogonal_lines( Y, X ), !
% 0.75/1.69 alpha1( X, Y ) }.
% 0.75/1.69 parent0: (686) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), unorthogonal_lines
% 0.75/1.69 ( Y, X ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := X
% 0.75/1.69 Y := Y
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 1
% 0.75/1.69 1 ==> 0
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3,
% 0.75/1.69 skol1 ) }.
% 0.75/1.69 parent0: (689) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol3, skol1 )
% 0.75/1.69 }.
% 0.75/1.69 substitution0:
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 0
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (22) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol3, skol2
% 0.75/1.69 ) }.
% 0.75/1.69 parent0: (690) {G0,W3,D2,L1,V0,M1} { ! convergent_lines( skol3, skol2 )
% 0.75/1.69 }.
% 0.75/1.69 substitution0:
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 0
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (23) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2
% 0.75/1.69 ) }.
% 0.75/1.69 parent0: (691) {G0,W3,D2,L1,V0,M1} { unorthogonal_lines( skol1, skol2 )
% 0.75/1.69 }.
% 0.75/1.69 substitution0:
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 0
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 resolution: (752) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol3, skol1 )
% 0.75/1.69 }.
% 0.75/1.69 parent0[0]: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1
% 0.75/1.69 ) }.
% 0.75/1.69 parent1[1]: (14) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ),
% 0.75/1.69 unorthogonal_lines( X, Y ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 end
% 0.75/1.69 substitution1:
% 0.75/1.69 X := skol3
% 0.75/1.69 Y := skol1
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (34) {G1,W3,D2,L1,V0,M1} R(14,21) { convergent_lines( skol3,
% 0.75/1.69 skol1 ) }.
% 0.75/1.69 parent0: (752) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol3, skol1 ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 0
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 resolution: (753) {G1,W6,D2,L2,V1,M2} { convergent_lines( skol3, X ),
% 0.75/1.69 convergent_lines( skol1, X ) }.
% 0.75/1.69 parent0[2]: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 0.75/1.69 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 0.75/1.69 parent1[0]: (34) {G1,W3,D2,L1,V0,M1} R(14,21) { convergent_lines( skol3,
% 0.75/1.69 skol1 ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := skol3
% 0.75/1.69 Y := skol1
% 0.75/1.69 Z := X
% 0.75/1.69 end
% 0.75/1.69 substitution1:
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (39) {G2,W6,D2,L2,V1,M1} R(5,34) { convergent_lines( skol1, X
% 0.75/1.69 ), convergent_lines( skol3, X ) }.
% 0.75/1.69 parent0: (753) {G1,W6,D2,L2,V1,M2} { convergent_lines( skol3, X ),
% 0.75/1.69 convergent_lines( skol1, X ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := X
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 1
% 0.75/1.69 1 ==> 0
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 resolution: (755) {G1,W12,D2,L4,V3,M4} { unorthogonal_lines( X, Y ),
% 0.75/1.69 convergent_lines( X, Z ), ! convergent_lines( Y, Z ), !
% 0.75/1.69 unorthogonal_lines( Y, Z ) }.
% 0.75/1.69 parent0[1]: (18) {G0,W6,D2,L2,V2,M1} I { unorthogonal_lines( Y, X ), !
% 0.75/1.69 alpha1( X, Y ) }.
% 0.75/1.69 parent1[3]: (15) {G0,W12,D2,L4,V3,M1} I { convergent_lines( Z, Y ), !
% 0.75/1.69 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z )
% 0.75/1.69 }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := Y
% 0.75/1.69 Y := X
% 0.75/1.69 end
% 0.75/1.69 substitution1:
% 0.75/1.69 X := Y
% 0.75/1.69 Y := Z
% 0.75/1.69 Z := X
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (159) {G1,W12,D2,L4,V3,M2} R(15,18) { convergent_lines( X, Y )
% 0.75/1.69 , ! convergent_lines( Z, Y ), unorthogonal_lines( X, Z ), !
% 0.75/1.69 unorthogonal_lines( Z, Y ) }.
% 0.75/1.69 parent0: (755) {G1,W12,D2,L4,V3,M4} { unorthogonal_lines( X, Y ),
% 0.75/1.69 convergent_lines( X, Z ), ! convergent_lines( Y, Z ), !
% 0.75/1.69 unorthogonal_lines( Y, Z ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := X
% 0.75/1.69 Y := Z
% 0.75/1.69 Z := Y
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 2
% 0.75/1.69 1 ==> 0
% 0.75/1.69 2 ==> 1
% 0.75/1.69 3 ==> 3
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 resolution: (756) {G1,W9,D2,L3,V1,M3} { convergent_lines( skol3, X ), !
% 0.75/1.69 convergent_lines( skol1, X ), ! unorthogonal_lines( skol1, X ) }.
% 0.75/1.69 parent0[0]: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1
% 0.75/1.69 ) }.
% 0.75/1.69 parent1[2]: (159) {G1,W12,D2,L4,V3,M2} R(15,18) { convergent_lines( X, Y )
% 0.75/1.69 , ! convergent_lines( Z, Y ), unorthogonal_lines( X, Z ), !
% 0.75/1.69 unorthogonal_lines( Z, Y ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 end
% 0.75/1.69 substitution1:
% 0.75/1.69 X := skol3
% 0.75/1.69 Y := X
% 0.75/1.69 Z := skol1
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 resolution: (757) {G2,W9,D2,L3,V1,M3} { convergent_lines( skol3, X ), !
% 0.75/1.69 unorthogonal_lines( skol1, X ), convergent_lines( skol3, X ) }.
% 0.75/1.69 parent0[1]: (756) {G1,W9,D2,L3,V1,M3} { convergent_lines( skol3, X ), !
% 0.75/1.69 convergent_lines( skol1, X ), ! unorthogonal_lines( skol1, X ) }.
% 0.75/1.69 parent1[0]: (39) {G2,W6,D2,L2,V1,M1} R(5,34) { convergent_lines( skol1, X )
% 0.75/1.69 , convergent_lines( skol3, X ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := X
% 0.75/1.69 end
% 0.75/1.69 substitution1:
% 0.75/1.69 X := X
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 factor: (758) {G2,W6,D2,L2,V1,M2} { convergent_lines( skol3, X ), !
% 0.75/1.69 unorthogonal_lines( skol1, X ) }.
% 0.75/1.69 parent0[0, 2]: (757) {G2,W9,D2,L3,V1,M3} { convergent_lines( skol3, X ), !
% 0.75/1.69 unorthogonal_lines( skol1, X ), convergent_lines( skol3, X ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := X
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (660) {G3,W6,D2,L2,V1,M1} R(159,21);r(39) { convergent_lines(
% 0.75/1.69 skol3, X ), ! unorthogonal_lines( skol1, X ) }.
% 0.75/1.69 parent0: (758) {G2,W6,D2,L2,V1,M2} { convergent_lines( skol3, X ), !
% 0.75/1.69 unorthogonal_lines( skol1, X ) }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := X
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 0 ==> 0
% 0.75/1.69 1 ==> 1
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 resolution: (759) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol3, skol2 )
% 0.75/1.69 }.
% 0.75/1.69 parent0[1]: (660) {G3,W6,D2,L2,V1,M1} R(159,21);r(39) { convergent_lines(
% 0.75/1.69 skol3, X ), ! unorthogonal_lines( skol1, X ) }.
% 0.75/1.69 parent1[0]: (23) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2 )
% 0.75/1.69 }.
% 0.75/1.69 substitution0:
% 0.75/1.69 X := skol2
% 0.75/1.69 end
% 0.75/1.69 substitution1:
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 resolution: (760) {G1,W0,D0,L0,V0,M0} { }.
% 0.75/1.69 parent0[0]: (22) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol3, skol2 )
% 0.75/1.69 }.
% 0.75/1.69 parent1[0]: (759) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol3, skol2 )
% 0.75/1.69 }.
% 0.75/1.69 substitution0:
% 0.75/1.69 end
% 0.75/1.69 substitution1:
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 subsumption: (666) {G4,W0,D0,L0,V0,M0} R(660,23);r(22) { }.
% 0.75/1.69 parent0: (760) {G1,W0,D0,L0,V0,M0} { }.
% 0.75/1.69 substitution0:
% 0.75/1.69 end
% 0.75/1.69 permutation0:
% 0.75/1.69 end
% 0.75/1.69
% 0.75/1.69 Proof check complete!
% 0.75/1.69
% 0.75/1.69 Memory use:
% 0.75/1.69
% 0.75/1.69 space for terms: 10075
% 0.75/1.69 space for clauses: 23664
% 0.75/1.69
% 0.75/1.69
% 0.75/1.69 clauses generated: 40381
% 0.75/1.69 clauses kept: 667
% 0.75/1.69 clauses selected: 277
% 0.75/1.69 clauses deleted: 0
% 0.75/1.69 clauses inuse deleted: 0
% 0.75/1.69
% 0.75/1.69 subsentry: 575999
% 0.75/1.69 literals s-matched: 374168
% 0.75/1.69 literals matched: 374138
% 0.75/1.69 full subsumption: 339886
% 0.75/1.69
% 0.75/1.69 checksum: 373113
% 0.75/1.69
% 0.75/1.69
% 0.75/1.69 Bliksem ended
%------------------------------------------------------------------------------