TSTP Solution File: GEO212+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GEO212+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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:49 EDT 2022
% Result : Theorem 1.11s 1.48s
% Output : Refutation 1.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO212+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Sat Jun 18 01:47:54 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.11/1.48 *** allocated 10000 integers for termspace/termends
% 1.11/1.48 *** allocated 10000 integers for clauses
% 1.11/1.48 *** allocated 10000 integers for justifications
% 1.11/1.48 Bliksem 1.12
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 Automatic Strategy Selection
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 Clauses:
% 1.11/1.48
% 1.11/1.48 { ! distinct_points( X, X ) }.
% 1.11/1.48 { ! distinct_lines( X, X ) }.
% 1.11/1.48 { ! convergent_lines( X, X ) }.
% 1.11/1.48 { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 1.11/1.48 ) }.
% 1.11/1.48 { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 1.11/1.48 }.
% 1.11/1.48 { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 1.11/1.48 , Z ) }.
% 1.11/1.48 { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 1.11/1.48 , Y ) ), distinct_points( Z, X ) }.
% 1.11/1.48 { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 1.11/1.48 , Y ) ), distinct_points( Z, Y ) }.
% 1.11/1.48 { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, X ),
% 1.11/1.48 distinct_points( Z, intersection_point( X, Y ) ) }.
% 1.11/1.48 { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, Y ),
% 1.11/1.48 distinct_points( Z, intersection_point( X, Y ) ) }.
% 1.11/1.48 { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 1.11/1.48 ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ),
% 1.11/1.48 apart_point_and_line( Y, T ) }.
% 1.11/1.48 { ! apart_point_and_line( X, Y ), distinct_points( X, Z ),
% 1.11/1.48 apart_point_and_line( Z, Y ) }.
% 1.11/1.48 { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ),
% 1.11/1.48 apart_point_and_line( X, Z ) }.
% 1.11/1.48 { ! convergent_lines( X, Y ), distinct_lines( X, Y ) }.
% 1.11/1.48 { ! convergent_lines( parallel_through_point( Y, X ), Y ) }.
% 1.11/1.48 { ! apart_point_and_line( X, parallel_through_point( Y, X ) ) }.
% 1.11/1.48 { ! distinct_lines( X, Y ), apart_point_and_line( Z, X ),
% 1.11/1.48 apart_point_and_line( Z, Y ), convergent_lines( X, Y ) }.
% 1.11/1.48 { convergent_lines( X, Y ), unorthogonal_lines( X, Y ) }.
% 1.11/1.48 { ! convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z )
% 1.11/1.48 , convergent_lines( Y, Z ) }.
% 1.11/1.48 { ! convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Z )
% 1.11/1.48 , unorthogonal_lines( Y, Z ) }.
% 1.11/1.48 { ! alpha1( X, Y ), convergent_lines( X, Y ) }.
% 1.11/1.48 { ! alpha1( X, Y ), unorthogonal_lines( X, Y ) }.
% 1.11/1.48 { ! convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ), alpha1( X, Y )
% 1.11/1.48 }.
% 1.11/1.48 { ! unorthogonal_lines( orthogonal_through_point( Y, X ), Y ) }.
% 1.11/1.48 { ! apart_point_and_line( X, orthogonal_through_point( Y, X ) ) }.
% 1.11/1.48 { ! distinct_lines( X, Y ), apart_point_and_line( Z, X ),
% 1.11/1.48 apart_point_and_line( Z, Y ), unorthogonal_lines( X, T ),
% 1.11/1.48 unorthogonal_lines( Y, T ) }.
% 1.11/1.48 { unorthogonal_lines( skol1, skol2 ) }.
% 1.11/1.48 { ! convergent_lines( skol1, skol3 ) }.
% 1.11/1.48 { ! unorthogonal_lines( skol2, skol3 ) }.
% 1.11/1.48
% 1.11/1.48 percentage equality = 0.000000, percentage horn = 0.620690
% 1.11/1.48 This a non-horn, non-equality problem
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 Options Used:
% 1.11/1.48
% 1.11/1.48 useres = 1
% 1.11/1.48 useparamod = 0
% 1.11/1.48 useeqrefl = 0
% 1.11/1.48 useeqfact = 0
% 1.11/1.48 usefactor = 1
% 1.11/1.48 usesimpsplitting = 0
% 1.11/1.48 usesimpdemod = 0
% 1.11/1.48 usesimpres = 3
% 1.11/1.48
% 1.11/1.48 resimpinuse = 1000
% 1.11/1.48 resimpclauses = 20000
% 1.11/1.48 substype = standard
% 1.11/1.48 backwardsubs = 1
% 1.11/1.48 selectoldest = 5
% 1.11/1.48
% 1.11/1.48 litorderings [0] = split
% 1.11/1.48 litorderings [1] = liftord
% 1.11/1.48
% 1.11/1.48 termordering = none
% 1.11/1.48
% 1.11/1.48 litapriori = 1
% 1.11/1.48 termapriori = 0
% 1.11/1.48 litaposteriori = 0
% 1.11/1.48 termaposteriori = 0
% 1.11/1.48 demodaposteriori = 0
% 1.11/1.48 ordereqreflfact = 0
% 1.11/1.48
% 1.11/1.48 litselect = none
% 1.11/1.48
% 1.11/1.48 maxweight = 15
% 1.11/1.48 maxdepth = 30000
% 1.11/1.48 maxlength = 115
% 1.11/1.48 maxnrvars = 195
% 1.11/1.48 excuselevel = 1
% 1.11/1.48 increasemaxweight = 1
% 1.11/1.48
% 1.11/1.48 maxselected = 10000000
% 1.11/1.48 maxnrclauses = 10000000
% 1.11/1.48
% 1.11/1.48 showgenerated = 0
% 1.11/1.48 showkept = 0
% 1.11/1.48 showselected = 0
% 1.11/1.48 showdeleted = 0
% 1.11/1.48 showresimp = 1
% 1.11/1.48 showstatus = 2000
% 1.11/1.48
% 1.11/1.48 prologoutput = 0
% 1.11/1.48 nrgoals = 5000000
% 1.11/1.48 totalproof = 1
% 1.11/1.48
% 1.11/1.48 Symbols occurring in the translation:
% 1.11/1.48
% 1.11/1.48 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.11/1.48 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 1.11/1.48 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 1.11/1.48 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.11/1.48 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.11/1.48 distinct_points [36, 2] (w:1, o:48, a:1, s:1, b:0),
% 1.11/1.48 distinct_lines [37, 2] (w:1, o:49, a:1, s:1, b:0),
% 1.11/1.48 convergent_lines [38, 2] (w:1, o:47, a:1, s:1, b:0),
% 1.11/1.48 line_connecting [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 1.11/1.48 apart_point_and_line [42, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.11/1.48 intersection_point [43, 2] (w:1, o:52, a:1, s:1, b:0),
% 1.11/1.48 parallel_through_point [46, 2] (w:1, o:54, a:1, s:1, b:0),
% 1.11/1.48 unorthogonal_lines [49, 2] (w:1, o:55, a:1, s:1, b:0),
% 1.11/1.48 orthogonal_through_point [52, 2] (w:1, o:53, a:1, s:1, b:0),
% 1.11/1.48 alpha1 [53, 2] (w:1, o:56, a:1, s:1, b:0),
% 1.11/1.48 skol1 [54, 0] (w:1, o:15, a:1, s:1, b:0),
% 1.11/1.48 skol2 [55, 0] (w:1, o:16, a:1, s:1, b:0),
% 1.11/1.48 skol3 [56, 0] (w:1, o:17, a:1, s:1, b:0).
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 Starting Search:
% 1.11/1.48
% 1.11/1.48 *** allocated 15000 integers for clauses
% 1.11/1.48 *** allocated 22500 integers for clauses
% 1.11/1.48 *** allocated 33750 integers for clauses
% 1.11/1.48 *** allocated 50625 integers for clauses
% 1.11/1.48 *** allocated 15000 integers for termspace/termends
% 1.11/1.48 Resimplifying inuse:
% 1.11/1.48 Done
% 1.11/1.48
% 1.11/1.48 *** allocated 22500 integers for termspace/termends
% 1.11/1.48 *** allocated 75937 integers for clauses
% 1.11/1.48 *** allocated 33750 integers for termspace/termends
% 1.11/1.48 *** allocated 113905 integers for clauses
% 1.11/1.48
% 1.11/1.48 Intermediate Status:
% 1.11/1.48 Generated: 21626
% 1.11/1.48 Kept: 2035
% 1.11/1.48 Inuse: 339
% 1.11/1.48 Deleted: 0
% 1.11/1.48 Deletedinuse: 0
% 1.11/1.48
% 1.11/1.48 Resimplifying inuse:
% 1.11/1.48 Done
% 1.11/1.48
% 1.11/1.48 *** allocated 50625 integers for termspace/termends
% 1.11/1.48 *** allocated 170857 integers for clauses
% 1.11/1.48 Resimplifying inuse:
% 1.11/1.48 Done
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 Bliksems!, er is een bewijs:
% 1.11/1.48 % SZS status Theorem
% 1.11/1.48 % SZS output start Refutation
% 1.11/1.48
% 1.11/1.48 (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 1.11/1.48 (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ), convergent_lines( Y,
% 1.11/1.48 Z ), ! convergent_lines( X, Y ) }.
% 1.11/1.48 (17) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), unorthogonal_lines(
% 1.11/1.48 X, Y ) }.
% 1.11/1.48 (19) {G0,W12,D2,L4,V3,M1} I { ! convergent_lines( X, Y ), !
% 1.11/1.48 unorthogonal_lines( X, Y ), unorthogonal_lines( Y, Z ), alpha1( X, Z )
% 1.11/1.48 }.
% 1.11/1.48 (20) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), ! alpha1( X, Y ) }.
% 1.11/1.48 (26) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2 ) }.
% 1.11/1.48 (27) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol3 ) }.
% 1.11/1.48 (28) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol2, skol3 ) }.
% 1.11/1.48 (45) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ),
% 1.11/1.48 convergent_lines( X, Y ) }.
% 1.11/1.48 (49) {G2,W3,D2,L1,V0,M1} R(45,27) { ! convergent_lines( skol3, skol1 ) }.
% 1.11/1.48 (55) {G1,W3,D2,L1,V0,M1} R(17,28) { convergent_lines( skol2, skol3 ) }.
% 1.11/1.48 (57) {G2,W6,D2,L2,V1,M1} R(55,5) { convergent_lines( skol2, X ),
% 1.11/1.48 convergent_lines( skol3, X ) }.
% 1.11/1.48 (63) {G3,W3,D2,L1,V0,M1} R(57,49) { convergent_lines( skol2, skol1 ) }.
% 1.11/1.48 (66) {G4,W3,D2,L1,V0,M1} R(63,45) { convergent_lines( skol1, skol2 ) }.
% 1.11/1.48 (186) {G1,W12,D2,L4,V3,M2} R(19,20) { ! convergent_lines( X, Y ),
% 1.11/1.48 convergent_lines( X, Z ), ! unorthogonal_lines( X, Y ),
% 1.11/1.48 unorthogonal_lines( Y, Z ) }.
% 1.11/1.48 (3833) {G5,W6,D2,L2,V1,M1} R(186,26);r(66) { convergent_lines( skol1, X ),
% 1.11/1.48 unorthogonal_lines( skol2, X ) }.
% 1.11/1.48 (3838) {G6,W0,D0,L0,V0,M0} R(3833,28);r(27) { }.
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 % SZS output end Refutation
% 1.11/1.48 found a proof!
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 Unprocessed initial clauses:
% 1.11/1.48
% 1.11/1.48 (3840) {G0,W3,D2,L1,V1,M1} { ! distinct_points( X, X ) }.
% 1.11/1.48 (3841) {G0,W3,D2,L1,V1,M1} { ! distinct_lines( X, X ) }.
% 1.11/1.48 (3842) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 1.11/1.48 (3843) {G0,W9,D2,L3,V3,M3} { ! distinct_points( X, Y ), distinct_points( X
% 1.11/1.48 , Z ), distinct_points( Y, Z ) }.
% 1.11/1.48 (3844) {G0,W9,D2,L3,V3,M3} { ! distinct_lines( X, Y ), distinct_lines( X,
% 1.11/1.48 Z ), distinct_lines( Y, Z ) }.
% 1.11/1.48 (3845) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), convergent_lines
% 1.11/1.48 ( X, Z ), convergent_lines( Y, Z ) }.
% 1.11/1.48 (3846) {G0,W11,D3,L3,V3,M3} { ! distinct_points( X, Y ), !
% 1.11/1.48 apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, X
% 1.11/1.48 ) }.
% 1.11/1.48 (3847) {G0,W11,D3,L3,V3,M3} { ! distinct_points( X, Y ), !
% 1.11/1.48 apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, Y
% 1.11/1.48 ) }.
% 1.11/1.48 (3848) {G0,W11,D3,L3,V3,M3} { ! convergent_lines( X, Y ), !
% 1.11/1.48 apart_point_and_line( Z, X ), distinct_points( Z, intersection_point( X,
% 1.11/1.48 Y ) ) }.
% 1.11/1.48 (3849) {G0,W11,D3,L3,V3,M3} { ! convergent_lines( X, Y ), !
% 1.11/1.48 apart_point_and_line( Z, Y ), distinct_points( Z, intersection_point( X,
% 1.11/1.48 Y ) ) }.
% 1.11/1.48 (3850) {G0,W18,D2,L6,V4,M6} { ! distinct_points( X, Y ), ! distinct_lines
% 1.11/1.48 ( Z, T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ),
% 1.11/1.48 apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 1.11/1.48 (3851) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ),
% 1.11/1.48 distinct_points( X, Z ), apart_point_and_line( Z, Y ) }.
% 1.11/1.48 (3852) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ),
% 1.11/1.48 distinct_lines( Y, Z ), apart_point_and_line( X, Z ) }.
% 1.11/1.48 (3853) {G0,W6,D2,L2,V2,M2} { ! convergent_lines( X, Y ), distinct_lines( X
% 1.11/1.48 , Y ) }.
% 1.11/1.48 (3854) {G0,W5,D3,L1,V2,M1} { ! convergent_lines( parallel_through_point( Y
% 1.11/1.48 , X ), Y ) }.
% 1.11/1.48 (3855) {G0,W5,D3,L1,V2,M1} { ! apart_point_and_line( X,
% 1.11/1.48 parallel_through_point( Y, X ) ) }.
% 1.11/1.48 (3856) {G0,W12,D2,L4,V3,M4} { ! distinct_lines( X, Y ),
% 1.11/1.48 apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ),
% 1.11/1.48 convergent_lines( X, Y ) }.
% 1.11/1.48 (3857) {G0,W6,D2,L2,V2,M2} { convergent_lines( X, Y ), unorthogonal_lines
% 1.11/1.48 ( X, Y ) }.
% 1.11/1.48 (3858) {G0,W12,D2,L4,V3,M4} { ! convergent_lines( X, Y ), !
% 1.11/1.48 unorthogonal_lines( X, Y ), alpha1( X, Z ), convergent_lines( Y, Z ) }.
% 1.11/1.48 (3859) {G0,W12,D2,L4,V3,M4} { ! convergent_lines( X, Y ), !
% 1.11/1.48 unorthogonal_lines( X, Y ), alpha1( X, Z ), unorthogonal_lines( Y, Z )
% 1.11/1.48 }.
% 1.11/1.48 (3860) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), convergent_lines( X, Y )
% 1.11/1.48 }.
% 1.11/1.48 (3861) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), unorthogonal_lines( X, Y )
% 1.11/1.48 }.
% 1.11/1.48 (3862) {G0,W9,D2,L3,V2,M3} { ! convergent_lines( X, Y ), !
% 1.11/1.48 unorthogonal_lines( X, Y ), alpha1( X, Y ) }.
% 1.11/1.48 (3863) {G0,W5,D3,L1,V2,M1} { ! unorthogonal_lines(
% 1.11/1.48 orthogonal_through_point( Y, X ), Y ) }.
% 1.11/1.48 (3864) {G0,W5,D3,L1,V2,M1} { ! apart_point_and_line( X,
% 1.11/1.48 orthogonal_through_point( Y, X ) ) }.
% 1.11/1.48 (3865) {G0,W15,D2,L5,V4,M5} { ! distinct_lines( X, Y ),
% 1.11/1.48 apart_point_and_line( Z, X ), apart_point_and_line( Z, Y ),
% 1.11/1.48 unorthogonal_lines( X, T ), unorthogonal_lines( Y, T ) }.
% 1.11/1.48 (3866) {G0,W3,D2,L1,V0,M1} { unorthogonal_lines( skol1, skol2 ) }.
% 1.11/1.48 (3867) {G0,W3,D2,L1,V0,M1} { ! convergent_lines( skol1, skol3 ) }.
% 1.11/1.48 (3868) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol2, skol3 ) }.
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 Total Proof:
% 1.11/1.48
% 1.11/1.48 subsumption: (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 1.11/1.48 parent0: (3842) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 1.11/1.48 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 1.11/1.48 parent0: (3845) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ),
% 1.11/1.48 convergent_lines( X, Z ), convergent_lines( Y, Z ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 Y := Y
% 1.11/1.48 Z := Z
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 2
% 1.11/1.48 1 ==> 0
% 1.11/1.48 2 ==> 1
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (17) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ),
% 1.11/1.48 unorthogonal_lines( X, Y ) }.
% 1.11/1.48 parent0: (3857) {G0,W6,D2,L2,V2,M2} { convergent_lines( X, Y ),
% 1.11/1.48 unorthogonal_lines( X, Y ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 Y := Y
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 1 ==> 1
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (19) {G0,W12,D2,L4,V3,M1} I { ! convergent_lines( X, Y ), !
% 1.11/1.48 unorthogonal_lines( X, Y ), unorthogonal_lines( Y, Z ), alpha1( X, Z )
% 1.11/1.48 }.
% 1.11/1.48 parent0: (3859) {G0,W12,D2,L4,V3,M4} { ! convergent_lines( X, Y ), !
% 1.11/1.48 unorthogonal_lines( X, Y ), alpha1( X, Z ), unorthogonal_lines( Y, Z )
% 1.11/1.48 }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 Y := Y
% 1.11/1.48 Z := Z
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 1 ==> 1
% 1.11/1.48 2 ==> 3
% 1.11/1.48 3 ==> 2
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (20) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), !
% 1.11/1.48 alpha1( X, Y ) }.
% 1.11/1.48 parent0: (3860) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), convergent_lines(
% 1.11/1.48 X, Y ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 Y := Y
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 1
% 1.11/1.48 1 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (26) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2
% 1.11/1.48 ) }.
% 1.11/1.48 parent0: (3866) {G0,W3,D2,L1,V0,M1} { unorthogonal_lines( skol1, skol2 )
% 1.11/1.48 }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 *** allocated 75937 integers for termspace/termends
% 1.11/1.48 subsumption: (27) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol3
% 1.11/1.48 ) }.
% 1.11/1.48 parent0: (3867) {G0,W3,D2,L1,V0,M1} { ! convergent_lines( skol1, skol3 )
% 1.11/1.48 }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (28) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol2,
% 1.11/1.48 skol3 ) }.
% 1.11/1.48 parent0: (3868) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol2, skol3 )
% 1.11/1.48 }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3938) {G1,W6,D2,L2,V2,M2} { convergent_lines( Y, X ), !
% 1.11/1.48 convergent_lines( X, Y ) }.
% 1.11/1.48 parent0[0]: (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 1.11/1.48 parent1[0]: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 1.11/1.48 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 X := X
% 1.11/1.48 Y := Y
% 1.11/1.48 Z := X
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (45) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ),
% 1.11/1.48 convergent_lines( X, Y ) }.
% 1.11/1.48 parent0: (3938) {G1,W6,D2,L2,V2,M2} { convergent_lines( Y, X ), !
% 1.11/1.48 convergent_lines( X, Y ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := Y
% 1.11/1.48 Y := X
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 1
% 1.11/1.48 1 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3940) {G1,W3,D2,L1,V0,M1} { ! convergent_lines( skol3, skol1
% 1.11/1.48 ) }.
% 1.11/1.48 parent0[0]: (27) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol3 )
% 1.11/1.48 }.
% 1.11/1.48 parent1[1]: (45) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ),
% 1.11/1.48 convergent_lines( X, Y ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 X := skol1
% 1.11/1.48 Y := skol3
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (49) {G2,W3,D2,L1,V0,M1} R(45,27) { ! convergent_lines( skol3
% 1.11/1.48 , skol1 ) }.
% 1.11/1.48 parent0: (3940) {G1,W3,D2,L1,V0,M1} { ! convergent_lines( skol3, skol1 )
% 1.11/1.48 }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3941) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol2, skol3 )
% 1.11/1.48 }.
% 1.11/1.48 parent0[0]: (28) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol2, skol3
% 1.11/1.48 ) }.
% 1.11/1.48 parent1[1]: (17) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ),
% 1.11/1.48 unorthogonal_lines( X, Y ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 X := skol2
% 1.11/1.48 Y := skol3
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (55) {G1,W3,D2,L1,V0,M1} R(17,28) { convergent_lines( skol2,
% 1.11/1.48 skol3 ) }.
% 1.11/1.48 parent0: (3941) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol2, skol3 ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3942) {G1,W6,D2,L2,V1,M2} { convergent_lines( skol2, X ),
% 1.11/1.48 convergent_lines( skol3, X ) }.
% 1.11/1.48 parent0[2]: (5) {G0,W9,D2,L3,V3,M3} I { convergent_lines( X, Z ),
% 1.11/1.48 convergent_lines( Y, Z ), ! convergent_lines( X, Y ) }.
% 1.11/1.48 parent1[0]: (55) {G1,W3,D2,L1,V0,M1} R(17,28) { convergent_lines( skol2,
% 1.11/1.48 skol3 ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := skol2
% 1.11/1.48 Y := skol3
% 1.11/1.48 Z := X
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (57) {G2,W6,D2,L2,V1,M1} R(55,5) { convergent_lines( skol2, X
% 1.11/1.48 ), convergent_lines( skol3, X ) }.
% 1.11/1.48 parent0: (3942) {G1,W6,D2,L2,V1,M2} { convergent_lines( skol2, X ),
% 1.11/1.48 convergent_lines( skol3, X ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 1 ==> 1
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3943) {G3,W3,D2,L1,V0,M1} { convergent_lines( skol2, skol1 )
% 1.11/1.48 }.
% 1.11/1.48 parent0[0]: (49) {G2,W3,D2,L1,V0,M1} R(45,27) { ! convergent_lines( skol3,
% 1.11/1.48 skol1 ) }.
% 1.11/1.48 parent1[1]: (57) {G2,W6,D2,L2,V1,M1} R(55,5) { convergent_lines( skol2, X )
% 1.11/1.48 , convergent_lines( skol3, X ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 X := skol1
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (63) {G3,W3,D2,L1,V0,M1} R(57,49) { convergent_lines( skol2,
% 1.11/1.48 skol1 ) }.
% 1.11/1.48 parent0: (3943) {G3,W3,D2,L1,V0,M1} { convergent_lines( skol2, skol1 ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3944) {G2,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 )
% 1.11/1.48 }.
% 1.11/1.48 parent0[0]: (45) {G1,W6,D2,L2,V2,M2} R(5,2) { ! convergent_lines( Y, X ),
% 1.11/1.48 convergent_lines( X, Y ) }.
% 1.11/1.48 parent1[0]: (63) {G3,W3,D2,L1,V0,M1} R(57,49) { convergent_lines( skol2,
% 1.11/1.48 skol1 ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := skol1
% 1.11/1.48 Y := skol2
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (66) {G4,W3,D2,L1,V0,M1} R(63,45) { convergent_lines( skol1,
% 1.11/1.48 skol2 ) }.
% 1.11/1.48 parent0: (3944) {G2,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3946) {G1,W12,D2,L4,V3,M4} { convergent_lines( X, Y ), !
% 1.11/1.48 convergent_lines( X, Z ), ! unorthogonal_lines( X, Z ),
% 1.11/1.48 unorthogonal_lines( Z, Y ) }.
% 1.11/1.48 parent0[1]: (20) {G0,W6,D2,L2,V2,M1} I { convergent_lines( X, Y ), ! alpha1
% 1.11/1.48 ( X, Y ) }.
% 1.11/1.48 parent1[3]: (19) {G0,W12,D2,L4,V3,M1} I { ! convergent_lines( X, Y ), !
% 1.11/1.48 unorthogonal_lines( X, Y ), unorthogonal_lines( Y, Z ), alpha1( X, Z )
% 1.11/1.48 }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 Y := Y
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 X := X
% 1.11/1.48 Y := Z
% 1.11/1.48 Z := Y
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (186) {G1,W12,D2,L4,V3,M2} R(19,20) { ! convergent_lines( X, Y
% 1.11/1.48 ), convergent_lines( X, Z ), ! unorthogonal_lines( X, Y ),
% 1.11/1.48 unorthogonal_lines( Y, Z ) }.
% 1.11/1.48 parent0: (3946) {G1,W12,D2,L4,V3,M4} { convergent_lines( X, Y ), !
% 1.11/1.48 convergent_lines( X, Z ), ! unorthogonal_lines( X, Z ),
% 1.11/1.48 unorthogonal_lines( Z, Y ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 Y := Z
% 1.11/1.48 Z := Y
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 1
% 1.11/1.48 1 ==> 0
% 1.11/1.48 2 ==> 2
% 1.11/1.48 3 ==> 3
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3947) {G1,W9,D2,L3,V1,M3} { ! convergent_lines( skol1, skol2
% 1.11/1.48 ), convergent_lines( skol1, X ), unorthogonal_lines( skol2, X ) }.
% 1.11/1.48 parent0[2]: (186) {G1,W12,D2,L4,V3,M2} R(19,20) { ! convergent_lines( X, Y
% 1.11/1.48 ), convergent_lines( X, Z ), ! unorthogonal_lines( X, Y ),
% 1.11/1.48 unorthogonal_lines( Y, Z ) }.
% 1.11/1.48 parent1[0]: (26) {G0,W3,D2,L1,V0,M1} I { unorthogonal_lines( skol1, skol2 )
% 1.11/1.48 }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := skol1
% 1.11/1.48 Y := skol2
% 1.11/1.48 Z := X
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3948) {G2,W6,D2,L2,V1,M2} { convergent_lines( skol1, X ),
% 1.11/1.48 unorthogonal_lines( skol2, X ) }.
% 1.11/1.48 parent0[0]: (3947) {G1,W9,D2,L3,V1,M3} { ! convergent_lines( skol1, skol2
% 1.11/1.48 ), convergent_lines( skol1, X ), unorthogonal_lines( skol2, X ) }.
% 1.11/1.48 parent1[0]: (66) {G4,W3,D2,L1,V0,M1} R(63,45) { convergent_lines( skol1,
% 1.11/1.48 skol2 ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (3833) {G5,W6,D2,L2,V1,M1} R(186,26);r(66) { convergent_lines
% 1.11/1.48 ( skol1, X ), unorthogonal_lines( skol2, X ) }.
% 1.11/1.48 parent0: (3948) {G2,W6,D2,L2,V1,M2} { convergent_lines( skol1, X ),
% 1.11/1.48 unorthogonal_lines( skol2, X ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 X := X
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 0 ==> 0
% 1.11/1.48 1 ==> 1
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3949) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol3 )
% 1.11/1.48 }.
% 1.11/1.48 parent0[0]: (28) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol2, skol3
% 1.11/1.48 ) }.
% 1.11/1.48 parent1[1]: (3833) {G5,W6,D2,L2,V1,M1} R(186,26);r(66) { convergent_lines(
% 1.11/1.48 skol1, X ), unorthogonal_lines( skol2, X ) }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 X := skol3
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 resolution: (3950) {G1,W0,D0,L0,V0,M0} { }.
% 1.11/1.48 parent0[0]: (27) {G0,W3,D2,L1,V0,M1} I { ! convergent_lines( skol1, skol3 )
% 1.11/1.48 }.
% 1.11/1.48 parent1[0]: (3949) {G1,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol3 )
% 1.11/1.48 }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 substitution1:
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 subsumption: (3838) {G6,W0,D0,L0,V0,M0} R(3833,28);r(27) { }.
% 1.11/1.48 parent0: (3950) {G1,W0,D0,L0,V0,M0} { }.
% 1.11/1.48 substitution0:
% 1.11/1.48 end
% 1.11/1.48 permutation0:
% 1.11/1.48 end
% 1.11/1.48
% 1.11/1.48 Proof check complete!
% 1.11/1.48
% 1.11/1.48 Memory use:
% 1.11/1.48
% 1.11/1.48 space for terms: 49750
% 1.11/1.48 space for clauses: 152916
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 clauses generated: 34886
% 1.11/1.48 clauses kept: 3839
% 1.11/1.48 clauses selected: 482
% 1.11/1.48 clauses deleted: 0
% 1.11/1.48 clauses inuse deleted: 0
% 1.11/1.48
% 1.11/1.48 subsentry: 522599
% 1.11/1.48 literals s-matched: 170027
% 1.11/1.48 literals matched: 169997
% 1.11/1.48 full subsumption: 95092
% 1.11/1.48
% 1.11/1.48 checksum: -895348723
% 1.11/1.48
% 1.11/1.48
% 1.11/1.48 Bliksem ended
%------------------------------------------------------------------------------