TSTP Solution File: GEO226+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GEO226+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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:53:01 EDT 2022
% Result : Theorem 0.71s 1.11s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO226+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n020.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 10:24:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.11 *** allocated 10000 integers for termspace/termends
% 0.71/1.11 *** allocated 10000 integers for clauses
% 0.71/1.11 *** allocated 10000 integers for justifications
% 0.71/1.11 Bliksem 1.12
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Automatic Strategy Selection
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Clauses:
% 0.71/1.11
% 0.71/1.11 { ! distinct_points( X, X ) }.
% 0.71/1.11 { ! distinct_lines( X, X ) }.
% 0.71/1.11 { ! convergent_lines( X, X ) }.
% 0.71/1.11 { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.71/1.11 ) }.
% 0.71/1.11 { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.71/1.11 }.
% 0.71/1.11 { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.71/1.11 , Z ) }.
% 0.71/1.11 { ! distinct_points( X, Y ), ! apart_point_and_line( X, line_connecting( X
% 0.71/1.11 , Y ) ) }.
% 0.71/1.11 { ! distinct_points( X, Y ), ! apart_point_and_line( Y, line_connecting( X
% 0.71/1.11 , Y ) ) }.
% 0.71/1.11 { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.71/1.11 , Y ), X ) }.
% 0.71/1.11 { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.71/1.11 , Y ), Y ) }.
% 0.71/1.11 { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.71/1.11 ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ),
% 0.71/1.11 apart_point_and_line( Y, T ) }.
% 0.71/1.11 { ! apart_point_and_line( X, Y ), distinct_points( X, Z ),
% 0.71/1.11 apart_point_and_line( Z, Y ) }.
% 0.71/1.11 { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ),
% 0.71/1.11 apart_point_and_line( X, Z ) }.
% 0.71/1.11 { ! convergent_lines( X, Y ), distinct_lines( Y, Z ), convergent_lines( X,
% 0.71/1.11 Z ) }.
% 0.71/1.11 { ! point( X ), ! point( Y ), ! distinct_points( X, Y ), line(
% 0.71/1.11 line_connecting( X, Y ) ) }.
% 0.71/1.11 { ! line( X ), ! line( Y ), ! convergent_lines( X, Y ), point(
% 0.71/1.11 intersection_point( X, Y ) ) }.
% 0.71/1.11 { ! line( X ), ! point( Y ), line( parallel_through_point( X, Y ) ) }.
% 0.71/1.11 { ! line( X ), ! point( Y ), line( orthogonal_through_point( X, Y ) ) }.
% 0.71/1.11 { line( skol1 ) }.
% 0.71/1.11 { line( skol2 ) }.
% 0.71/1.11 { convergent_lines( skol1, skol2 ) }.
% 0.71/1.11 { point( X ) }.
% 0.71/1.11 { apart_point_and_line( X, skol1 ), apart_point_and_line( X, skol2 ) }.
% 0.71/1.11
% 0.71/1.11 percentage equality = 0.000000, percentage horn = 0.652174
% 0.71/1.11 This a non-horn, non-equality problem
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Options Used:
% 0.71/1.11
% 0.71/1.11 useres = 1
% 0.71/1.11 useparamod = 0
% 0.71/1.11 useeqrefl = 0
% 0.71/1.11 useeqfact = 0
% 0.71/1.11 usefactor = 1
% 0.71/1.11 usesimpsplitting = 0
% 0.71/1.11 usesimpdemod = 0
% 0.71/1.11 usesimpres = 3
% 0.71/1.11
% 0.71/1.11 resimpinuse = 1000
% 0.71/1.11 resimpclauses = 20000
% 0.71/1.11 substype = standard
% 0.71/1.11 backwardsubs = 1
% 0.71/1.11 selectoldest = 5
% 0.71/1.11
% 0.71/1.11 litorderings [0] = split
% 0.71/1.11 litorderings [1] = liftord
% 0.71/1.11
% 0.71/1.11 termordering = none
% 0.71/1.11
% 0.71/1.11 litapriori = 1
% 0.71/1.11 termapriori = 0
% 0.71/1.11 litaposteriori = 0
% 0.71/1.11 termaposteriori = 0
% 0.71/1.11 demodaposteriori = 0
% 0.71/1.11 ordereqreflfact = 0
% 0.71/1.11
% 0.71/1.11 litselect = none
% 0.71/1.11
% 0.71/1.11 maxweight = 15
% 0.71/1.11 maxdepth = 30000
% 0.71/1.11 maxlength = 115
% 0.71/1.11 maxnrvars = 195
% 0.71/1.11 excuselevel = 1
% 0.71/1.11 increasemaxweight = 1
% 0.71/1.11
% 0.71/1.11 maxselected = 10000000
% 0.71/1.11 maxnrclauses = 10000000
% 0.71/1.11
% 0.71/1.11 showgenerated = 0
% 0.71/1.11 showkept = 0
% 0.71/1.11 showselected = 0
% 0.71/1.11 showdeleted = 0
% 0.71/1.11 showresimp = 1
% 0.71/1.11 showstatus = 2000
% 0.71/1.11
% 0.71/1.11 prologoutput = 0
% 0.71/1.11 nrgoals = 5000000
% 0.71/1.11 totalproof = 1
% 0.71/1.11
% 0.71/1.11 Symbols occurring in the translation:
% 0.71/1.11
% 0.71/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.11 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.71/1.11 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.71/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.11 distinct_points [36, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.11 distinct_lines [37, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.11 convergent_lines [38, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.11 line_connecting [41, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.71/1.11 apart_point_and_line [42, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.71/1.11 intersection_point [43, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.71/1.11 point [48, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.11 line [49, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.71/1.11 parallel_through_point [52, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.71/1.11 orthogonal_through_point [53, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.71/1.11 skol1 [54, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.11 skol2 [55, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Starting Search:
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Bliksems!, er is een bewijs:
% 0.71/1.11 % SZS status Theorem
% 0.71/1.11 % SZS output start Refutation
% 0.71/1.11
% 0.71/1.11 (8) {G0,W8,D3,L2,V2,M1} I { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.71/1.11 (9) {G0,W8,D3,L2,V2,M1} I { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.71/1.11 (20) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 ) }.
% 0.71/1.11 (22) {G0,W6,D2,L2,V1,M1} I { apart_point_and_line( X, skol1 ),
% 0.71/1.11 apart_point_and_line( X, skol2 ) }.
% 0.71/1.11 (23) {G1,W8,D3,L2,V1,M1} R(9,22) { ! convergent_lines( X, skol2 ),
% 0.71/1.11 apart_point_and_line( intersection_point( X, skol2 ), skol1 ) }.
% 0.71/1.11 (36) {G2,W0,D0,L0,V0,M0} R(23,8);f;r(20) { }.
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 % SZS output end Refutation
% 0.71/1.11 found a proof!
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Unprocessed initial clauses:
% 0.71/1.11
% 0.71/1.11 (38) {G0,W3,D2,L1,V1,M1} { ! distinct_points( X, X ) }.
% 0.71/1.11 (39) {G0,W3,D2,L1,V1,M1} { ! distinct_lines( X, X ) }.
% 0.71/1.11 (40) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 0.71/1.11 (41) {G0,W9,D2,L3,V3,M3} { ! distinct_points( X, Y ), distinct_points( X,
% 0.71/1.11 Z ), distinct_points( Y, Z ) }.
% 0.71/1.11 (42) {G0,W9,D2,L3,V3,M3} { ! distinct_lines( X, Y ), distinct_lines( X, Z
% 0.71/1.11 ), distinct_lines( Y, Z ) }.
% 0.71/1.11 (43) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), convergent_lines( X
% 0.71/1.11 , Z ), convergent_lines( Y, Z ) }.
% 0.71/1.11 (44) {G0,W8,D3,L2,V2,M2} { ! distinct_points( X, Y ), !
% 0.71/1.11 apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.71/1.11 (45) {G0,W8,D3,L2,V2,M2} { ! distinct_points( X, Y ), !
% 0.71/1.11 apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.71/1.11 (46) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.71/1.11 (47) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.71/1.11 (48) {G0,W18,D2,L6,V4,M6} { ! distinct_points( X, Y ), ! distinct_lines( Z
% 0.71/1.11 , T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ),
% 0.71/1.11 apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.71/1.11 (49) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_points
% 0.71/1.11 ( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.71/1.11 (50) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_lines
% 0.71/1.11 ( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.71/1.11 (51) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), distinct_lines( Y,
% 0.71/1.11 Z ), convergent_lines( X, Z ) }.
% 0.71/1.11 (52) {G0,W11,D3,L4,V2,M4} { ! point( X ), ! point( Y ), ! distinct_points
% 0.71/1.11 ( X, Y ), line( line_connecting( X, Y ) ) }.
% 0.71/1.11 (53) {G0,W11,D3,L4,V2,M4} { ! line( X ), ! line( Y ), ! convergent_lines(
% 0.71/1.11 X, Y ), point( intersection_point( X, Y ) ) }.
% 0.71/1.11 (54) {G0,W8,D3,L3,V2,M3} { ! line( X ), ! point( Y ), line(
% 0.71/1.11 parallel_through_point( X, Y ) ) }.
% 0.71/1.11 (55) {G0,W8,D3,L3,V2,M3} { ! line( X ), ! point( Y ), line(
% 0.71/1.11 orthogonal_through_point( X, Y ) ) }.
% 0.71/1.11 (56) {G0,W2,D2,L1,V0,M1} { line( skol1 ) }.
% 0.71/1.11 (57) {G0,W2,D2,L1,V0,M1} { line( skol2 ) }.
% 0.71/1.11 (58) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 ) }.
% 0.71/1.11 (59) {G0,W2,D2,L1,V1,M1} { point( X ) }.
% 0.71/1.11 (60) {G0,W6,D2,L2,V1,M2} { apart_point_and_line( X, skol1 ),
% 0.71/1.11 apart_point_and_line( X, skol2 ) }.
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Total Proof:
% 0.71/1.11
% 0.71/1.11 subsumption: (8) {G0,W8,D3,L2,V2,M1} I { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.71/1.11 parent0: (46) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 1 ==> 1
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (9) {G0,W8,D3,L2,V2,M1} I { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.71/1.11 parent0: (47) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 Y := Y
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 1 ==> 1
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (20) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.71/1.11 }.
% 0.71/1.11 parent0: (58) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (22) {G0,W6,D2,L2,V1,M1} I { apart_point_and_line( X, skol1 )
% 0.71/1.11 , apart_point_and_line( X, skol2 ) }.
% 0.71/1.11 parent0: (60) {G0,W6,D2,L2,V1,M2} { apart_point_and_line( X, skol1 ),
% 0.71/1.11 apart_point_and_line( X, skol2 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 1 ==> 1
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 resolution: (90) {G1,W8,D3,L2,V1,M2} { ! convergent_lines( X, skol2 ),
% 0.71/1.11 apart_point_and_line( intersection_point( X, skol2 ), skol1 ) }.
% 0.71/1.11 parent0[1]: (9) {G0,W8,D3,L2,V2,M1} I { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.71/1.11 parent1[1]: (22) {G0,W6,D2,L2,V1,M1} I { apart_point_and_line( X, skol1 ),
% 0.71/1.11 apart_point_and_line( X, skol2 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 Y := skol2
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 X := intersection_point( X, skol2 )
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (23) {G1,W8,D3,L2,V1,M1} R(9,22) { ! convergent_lines( X,
% 0.71/1.11 skol2 ), apart_point_and_line( intersection_point( X, skol2 ), skol1 )
% 0.71/1.11 }.
% 0.71/1.11 parent0: (90) {G1,W8,D3,L2,V1,M2} { ! convergent_lines( X, skol2 ),
% 0.71/1.11 apart_point_and_line( intersection_point( X, skol2 ), skol1 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := X
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 0 ==> 0
% 0.71/1.11 1 ==> 1
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 resolution: (91) {G1,W6,D2,L2,V0,M2} { ! convergent_lines( skol1, skol2 )
% 0.71/1.11 , ! convergent_lines( skol1, skol2 ) }.
% 0.71/1.11 parent0[1]: (8) {G0,W8,D3,L2,V2,M1} I { ! convergent_lines( X, Y ), !
% 0.71/1.11 apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.71/1.11 parent1[1]: (23) {G1,W8,D3,L2,V1,M1} R(9,22) { ! convergent_lines( X, skol2
% 0.71/1.11 ), apart_point_and_line( intersection_point( X, skol2 ), skol1 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 X := skol1
% 0.71/1.11 Y := skol2
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 X := skol1
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 factor: (92) {G1,W3,D2,L1,V0,M1} { ! convergent_lines( skol1, skol2 ) }.
% 0.71/1.11 parent0[0, 1]: (91) {G1,W6,D2,L2,V0,M2} { ! convergent_lines( skol1, skol2
% 0.71/1.11 ), ! convergent_lines( skol1, skol2 ) }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 resolution: (94) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.11 parent0[0]: (92) {G1,W3,D2,L1,V0,M1} { ! convergent_lines( skol1, skol2 )
% 0.71/1.11 }.
% 0.71/1.11 parent1[0]: (20) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.71/1.11 }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 substitution1:
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 subsumption: (36) {G2,W0,D0,L0,V0,M0} R(23,8);f;r(20) { }.
% 0.71/1.11 parent0: (94) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.11 substitution0:
% 0.71/1.11 end
% 0.71/1.11 permutation0:
% 0.71/1.11 end
% 0.71/1.11
% 0.71/1.11 Proof check complete!
% 0.71/1.11
% 0.71/1.11 Memory use:
% 0.71/1.11
% 0.71/1.11 space for terms: 897
% 0.71/1.11 space for clauses: 1747
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 clauses generated: 78
% 0.71/1.11 clauses kept: 37
% 0.71/1.11 clauses selected: 19
% 0.71/1.11 clauses deleted: 0
% 0.71/1.11 clauses inuse deleted: 0
% 0.71/1.11
% 0.71/1.11 subsentry: 116
% 0.71/1.11 literals s-matched: 82
% 0.71/1.11 literals matched: 72
% 0.71/1.11 full subsumption: 36
% 0.71/1.11
% 0.71/1.11 checksum: -399638404
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 Bliksem ended
%------------------------------------------------------------------------------