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