%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GEO220+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n025.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:56 EDT 2022
% Result : Theorem 0.69s 1.10s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO220+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Sat Jun 18 10:49:28 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10
% 0.69/1.10 { ! distinct_points( X, X ) }.
% 0.69/1.10 { ! distinct_lines( X, X ) }.
% 0.69/1.10 { ! convergent_lines( X, X ) }.
% 0.69/1.10 { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.69/1.10 ) }.
% 0.69/1.10 { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.69/1.10 }.
% 0.69/1.10 { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.69/1.10 , Z ) }.
% 0.69/1.10 { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 0.69/1.10 , Y ) ), distinct_points( Z, X ) }.
% 0.69/1.10 { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 0.69/1.10 , Y ) ), distinct_points( Z, Y ) }.
% 0.69/1.10 { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, X ),
% 0.69/1.10 distinct_points( Z, intersection_point( X, Y ) ) }.
% 0.69/1.10 { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, Y ),
% 0.69/1.10 distinct_points( Z, intersection_point( X, Y ) ) }.
% 0.69/1.10 { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.69/1.10 ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ),
% 0.69/1.10 apart_point_and_line( Y, T ) }.
% 0.69/1.10 { ! apart_point_and_line( X, Y ), distinct_points( X, Z ),
% 0.69/1.10 apart_point_and_line( Z, Y ) }.
% 0.69/1.10 { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ),
% 0.69/1.10 apart_point_and_line( X, Z ) }.
% 0.69/1.10 { ! convergent_lines( X, Y ), distinct_lines( X, Y ) }.
% 0.69/1.10 { convergent_lines( X, Y ), unorthogonal_lines( X, Y ) }.
% 0.69/1.10 { alpha1( X, Z ), convergent_lines( Z, Y ), ! convergent_lines( X, Y ), !
% 0.69/1.10 unorthogonal_lines( X, Y ) }.
% 0.69/1.10 { alpha1( X, Z ), unorthogonal_lines( Z, Y ), ! convergent_lines( X, Y ), !
% 0.69/1.10 unorthogonal_lines( X, Y ) }.
% 0.69/1.10 { ! alpha1( X, Y ), convergent_lines( Y, X ) }.
% 0.69/1.10 { ! alpha1( X, Y ), unorthogonal_lines( Y, X ) }.
% 0.69/1.10 { ! convergent_lines( Y, X ), ! unorthogonal_lines( Y, X ), alpha1( X, Y )
% 0.69/1.10 }.
% 0.69/1.10 { unorthogonal_lines( Z, X ), unorthogonal_lines( Z, Y ), !
% 0.69/1.10 convergent_lines( X, Y ) }.
% 0.69/1.10 { ! unorthogonal_lines( skol3, skol1 ) }.
% 0.69/1.10 { ! unorthogonal_lines( skol3, skol2 ) }.
% 0.69/1.10 { convergent_lines( skol1, skol2 ) }.
% 0.69/1.10
% 0.69/1.10 percentage equality = 0.000000, percentage horn = 0.583333
% 0.69/1.10 This a non-horn, non-equality problem
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Options Used:
% 0.69/1.10
% 0.69/1.10 useres = 1
% 0.69/1.10 useparamod = 0
% 0.69/1.10 useeqrefl = 0
% 0.69/1.10 useeqfact = 0
% 0.69/1.10 usefactor = 1
% 0.69/1.10 usesimpsplitting = 0
% 0.69/1.10 usesimpdemod = 0
% 0.69/1.10 usesimpres = 3
% 0.69/1.10
% 0.69/1.10 resimpinuse = 1000
% 0.69/1.10 resimpclauses = 20000
% 0.69/1.10 substype = standard
% 0.69/1.10 backwardsubs = 1
% 0.69/1.10 selectoldest = 5
% 0.69/1.10
% 0.69/1.10 litorderings [0] = split
% 0.69/1.10 litorderings [1] = liftord
% 0.69/1.10
% 0.69/1.10 termordering = none
% 0.69/1.10
% 0.69/1.10 litapriori = 1
% 0.69/1.10 termapriori = 0
% 0.69/1.10 litaposteriori = 0
% 0.69/1.10 termaposteriori = 0
% 0.69/1.10 demodaposteriori = 0
% 0.69/1.10 ordereqreflfact = 0
% 0.69/1.10
% 0.69/1.10 litselect = none
% 0.69/1.10
% 0.69/1.10 maxweight = 15
% 0.69/1.10 maxdepth = 30000
% 0.69/1.10 maxlength = 115
% 0.69/1.10 maxnrvars = 195
% 0.69/1.10 excuselevel = 1
% 0.69/1.10 increasemaxweight = 1
% 0.69/1.10
% 0.69/1.10 maxselected = 10000000
% 0.69/1.10 maxnrclauses = 10000000
% 0.69/1.10
% 0.69/1.10 showgenerated = 0
% 0.69/1.10 showkept = 0
% 0.69/1.10 showselected = 0
% 0.69/1.10 showdeleted = 0
% 0.69/1.10 showresimp = 1
% 0.69/1.10 showstatus = 2000
% 0.69/1.10
% 0.69/1.10 prologoutput = 0
% 0.69/1.10 nrgoals = 5000000
% 0.69/1.10 totalproof = 1
% 0.69/1.10
% 0.69/1.10 Symbols occurring in the translation:
% 0.69/1.10
% 0.69/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.10 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.69/1.10 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.69/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 distinct_points [36, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.69/1.10 distinct_lines [37, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.69/1.10 convergent_lines [38, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.10 line_connecting [41, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.69/1.10 apart_point_and_line [42, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.69/1.10 intersection_point [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.69/1.10 unorthogonal_lines [48, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.69/1.10 alpha1 [50, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.69/1.10 skol1 [51, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.69/1.10 skol2 [52, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.69/1.10 skol3 [53, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Starting Search:
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksems!, er is een bewijs:
% 0.69/1.10 % SZS status Theorem
% 0.69/1.10 % SZS output start Refutation
% 0.69/1.10
% 0.69/1.10 (20) {G0,W9,D2,L3,V3,M2} I { ! convergent_lines( X, Y ), unorthogonal_lines
% 0.69/1.10 ( Z, X ), unorthogonal_lines( Z, Y ) }.
% 0.69/1.10 (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1 ) }.
% 0.69/1.10 (22) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol2 ) }.
% 0.69/1.10 (23) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 ) }.
% 0.69/1.10 (158) {G1,W6,D2,L2,V1,M1} R(20,21) { ! convergent_lines( skol1, X ),
% 0.69/1.10 unorthogonal_lines( skol3, X ) }.
% 0.69/1.10 (163) {G2,W0,D0,L0,V0,M0} R(158,22);r(23) { }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 % SZS output end Refutation
% 0.69/1.10 found a proof!
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Unprocessed initial clauses:
% 0.69/1.10
% 0.69/1.10 (165) {G0,W3,D2,L1,V1,M1} { ! distinct_points( X, X ) }.
% 0.69/1.10 (166) {G0,W3,D2,L1,V1,M1} { ! distinct_lines( X, X ) }.
% 0.69/1.10 (167) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 0.69/1.10 (168) {G0,W9,D2,L3,V3,M3} { ! distinct_points( X, Y ), distinct_points( X
% 0.69/1.10 , Z ), distinct_points( Y, Z ) }.
% 0.69/1.10 (169) {G0,W9,D2,L3,V3,M3} { ! distinct_lines( X, Y ), distinct_lines( X, Z
% 0.69/1.10 ), distinct_lines( Y, Z ) }.
% 0.69/1.10 (170) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), convergent_lines(
% 0.69/1.10 X, Z ), convergent_lines( Y, Z ) }.
% 0.69/1.10 (171) {G0,W11,D3,L3,V3,M3} { ! distinct_points( X, Y ), !
% 0.69/1.10 apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, X
% 0.69/1.10 ) }.
% 0.69/1.10 (172) {G0,W11,D3,L3,V3,M3} { ! distinct_points( X, Y ), !
% 0.69/1.10 apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, Y
% 0.69/1.10 ) }.
% 0.69/1.10 (173) {G0,W11,D3,L3,V3,M3} { ! convergent_lines( X, Y ), !
% 0.69/1.10 apart_point_and_line( Z, X ), distinct_points( Z, intersection_point( X,
% 0.69/1.10 Y ) ) }.
% 0.69/1.10 (174) {G0,W11,D3,L3,V3,M3} { ! convergent_lines( X, Y ), !
% 0.69/1.10 apart_point_and_line( Z, Y ), distinct_points( Z, intersection_point( X,
% 0.69/1.10 Y ) ) }.
% 0.69/1.10 (175) {G0,W18,D2,L6,V4,M6} { ! distinct_points( X, Y ), ! distinct_lines(
% 0.69/1.10 Z, T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ),
% 0.69/1.10 apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.69/1.10 (176) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ),
% 0.69/1.10 distinct_points( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.69/1.10 (177) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_lines
% 0.69/1.10 ( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.69/1.10 (178) {G0,W6,D2,L2,V2,M2} { ! convergent_lines( X, Y ), distinct_lines( X
% 0.69/1.10 , Y ) }.
% 0.69/1.10 (179) {G0,W6,D2,L2,V2,M2} { convergent_lines( X, Y ), unorthogonal_lines(
% 0.69/1.10 X, Y ) }.
% 0.69/1.10 (180) {G0,W12,D2,L4,V3,M4} { alpha1( X, Z ), convergent_lines( Z, Y ), !
% 0.69/1.10 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 0.69/1.10 (181) {G0,W12,D2,L4,V3,M4} { alpha1( X, Z ), unorthogonal_lines( Z, Y ), !
% 0.69/1.10 convergent_lines( X, Y ), ! unorthogonal_lines( X, Y ) }.
% 0.69/1.10 (182) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), convergent_lines( Y, X ) }.
% 0.69/1.10 (183) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), unorthogonal_lines( Y, X )
% 0.69/1.10 }.
% 0.69/1.10 (184) {G0,W9,D2,L3,V2,M3} { ! convergent_lines( Y, X ), !
% 0.69/1.10 unorthogonal_lines( Y, X ), alpha1( X, Y ) }.
% 0.69/1.10 (185) {G0,W9,D2,L3,V3,M3} { unorthogonal_lines( Z, X ), unorthogonal_lines
% 0.69/1.10 ( Z, Y ), ! convergent_lines( X, Y ) }.
% 0.69/1.10 (186) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol3, skol1 ) }.
% 0.69/1.10 (187) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol3, skol2 ) }.
% 0.69/1.10 (188) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 ) }.
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Total Proof:
% 0.69/1.10
% 0.69/1.10 subsumption: (20) {G0,W9,D2,L3,V3,M2} I { ! convergent_lines( X, Y ),
% 0.69/1.10 unorthogonal_lines( Z, X ), unorthogonal_lines( Z, Y ) }.
% 0.69/1.10 parent0: (185) {G0,W9,D2,L3,V3,M3} { unorthogonal_lines( Z, X ),
% 0.69/1.10 unorthogonal_lines( Z, Y ), ! convergent_lines( X, Y ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 Y := Y
% 0.69/1.10 Z := Z
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 1
% 0.69/1.10 1 ==> 2
% 0.69/1.10 2 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3,
% 0.69/1.10 skol1 ) }.
% 0.69/1.10 parent0: (186) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol3, skol1 )
% 0.69/1.10 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (22) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3,
% 0.69/1.10 skol2 ) }.
% 0.69/1.10 parent0: (187) {G0,W3,D2,L1,V0,M1} { ! unorthogonal_lines( skol3, skol2 )
% 0.69/1.10 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (23) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.69/1.10 }.
% 0.69/1.10 parent0: (188) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (229) {G1,W6,D2,L2,V1,M2} { ! convergent_lines( skol1, X ),
% 0.69/1.10 unorthogonal_lines( skol3, X ) }.
% 0.69/1.10 parent0[0]: (21) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol1
% 0.69/1.10 ) }.
% 0.69/1.10 parent1[1]: (20) {G0,W9,D2,L3,V3,M2} I { ! convergent_lines( X, Y ),
% 0.69/1.10 unorthogonal_lines( Z, X ), unorthogonal_lines( Z, Y ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := skol1
% 0.69/1.10 Y := X
% 0.69/1.10 Z := skol3
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (158) {G1,W6,D2,L2,V1,M1} R(20,21) { ! convergent_lines( skol1
% 0.69/1.10 , X ), unorthogonal_lines( skol3, X ) }.
% 0.69/1.10 parent0: (229) {G1,W6,D2,L2,V1,M2} { ! convergent_lines( skol1, X ),
% 0.69/1.10 unorthogonal_lines( skol3, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 X := X
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 0 ==> 0
% 0.69/1.10 1 ==> 1
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (231) {G1,W3,D2,L1,V0,M1} { ! convergent_lines( skol1, skol2 )
% 0.69/1.10 }.
% 0.69/1.10 parent0[0]: (22) {G0,W3,D2,L1,V0,M1} I { ! unorthogonal_lines( skol3, skol2
% 0.69/1.10 ) }.
% 0.69/1.10 parent1[1]: (158) {G1,W6,D2,L2,V1,M1} R(20,21) { ! convergent_lines( skol1
% 0.69/1.10 , X ), unorthogonal_lines( skol3, X ) }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 X := skol2
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 resolution: (232) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 parent0[0]: (231) {G1,W3,D2,L1,V0,M1} { ! convergent_lines( skol1, skol2 )
% 0.69/1.10 }.
% 0.69/1.10 parent1[0]: (23) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.69/1.10 }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 substitution1:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 subsumption: (163) {G2,W0,D0,L0,V0,M0} R(158,22);r(23) { }.
% 0.69/1.10 parent0: (232) {G1,W0,D0,L0,V0,M0} { }.
% 0.69/1.10 substitution0:
% 0.69/1.10 end
% 0.69/1.10 permutation0:
% 0.69/1.10 end
% 0.69/1.10
% 0.69/1.10 Proof check complete!
% 0.69/1.10
% 0.69/1.10 Memory use:
% 0.69/1.10
% 0.69/1.10 space for terms: 2617
% 0.69/1.10 space for clauses: 6556
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 clauses generated: 774
% 0.69/1.10 clauses kept: 164
% 0.69/1.10 clauses selected: 62
% 0.69/1.10 clauses deleted: 0
% 0.69/1.10 clauses inuse deleted: 0
% 0.69/1.10
% 0.69/1.10 subsentry: 2873
% 0.69/1.10 literals s-matched: 2467
% 0.69/1.10 literals matched: 2447
% 0.69/1.10 full subsumption: 1829
% 0.69/1.10
% 0.69/1.10 checksum: 1312667
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksem ended
%------------------------------------------------------------------------------