TSTP Solution File: GEO207+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GEO207+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:44 EDT 2022
% Result : Theorem 0.80s 1.16s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO207+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n026.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 00:50:09 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.80/1.16 *** allocated 10000 integers for termspace/termends
% 0.80/1.16 *** allocated 10000 integers for clauses
% 0.80/1.16 *** allocated 10000 integers for justifications
% 0.80/1.16 Bliksem 1.12
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Automatic Strategy Selection
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Clauses:
% 0.80/1.16
% 0.80/1.16 { ! distinct_points( X, X ) }.
% 0.80/1.16 { ! distinct_lines( X, X ) }.
% 0.80/1.16 { ! convergent_lines( X, X ) }.
% 0.80/1.16 { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.80/1.16 ) }.
% 0.80/1.16 { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.80/1.16 }.
% 0.80/1.16 { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.80/1.16 , Z ) }.
% 0.80/1.16 { ! distinct_points( X, Y ), ! apart_point_and_line( X, line_connecting( X
% 0.80/1.16 , Y ) ) }.
% 0.80/1.16 { ! distinct_points( X, Y ), ! apart_point_and_line( Y, line_connecting( X
% 0.80/1.16 , Y ) ) }.
% 0.80/1.16 { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.80/1.16 , Y ), X ) }.
% 0.80/1.16 { ! convergent_lines( X, Y ), ! apart_point_and_line( intersection_point( X
% 0.80/1.16 , Y ), Y ) }.
% 0.80/1.16 { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.80/1.16 ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ),
% 0.80/1.16 apart_point_and_line( Y, T ) }.
% 0.80/1.16 { ! apart_point_and_line( X, Y ), distinct_points( X, Z ),
% 0.80/1.16 apart_point_and_line( Z, Y ) }.
% 0.80/1.16 { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ),
% 0.80/1.16 apart_point_and_line( X, Z ) }.
% 0.80/1.16 { ! convergent_lines( X, Y ), distinct_lines( Y, Z ), convergent_lines( X,
% 0.80/1.16 Z ) }.
% 0.80/1.16 { ! convergent_lines( parallel_through_point( Y, X ), Y ) }.
% 0.80/1.16 { ! apart_point_and_line( X, parallel_through_point( Y, X ) ) }.
% 0.80/1.16 { ! distinct_lines( X, Y ), apart_point_and_line( Z, X ),
% 0.80/1.16 apart_point_and_line( Z, Y ), convergent_lines( X, Y ) }.
% 0.80/1.16 { convergent_lines( skol1, skol1 ) }.
% 0.80/1.16
% 0.80/1.16 percentage equality = 0.000000, percentage horn = 0.555556
% 0.80/1.16 This a non-horn, non-equality problem
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Options Used:
% 0.80/1.16
% 0.80/1.16 useres = 1
% 0.80/1.16 useparamod = 0
% 0.80/1.16 useeqrefl = 0
% 0.80/1.16 useeqfact = 0
% 0.80/1.16 usefactor = 1
% 0.80/1.16 usesimpsplitting = 0
% 0.80/1.16 usesimpdemod = 0
% 0.80/1.16 usesimpres = 3
% 0.80/1.16
% 0.80/1.16 resimpinuse = 1000
% 0.80/1.16 resimpclauses = 20000
% 0.80/1.16 substype = standard
% 0.80/1.16 backwardsubs = 1
% 0.80/1.16 selectoldest = 5
% 0.80/1.16
% 0.80/1.16 litorderings [0] = split
% 0.80/1.16 litorderings [1] = liftord
% 0.80/1.16
% 0.80/1.16 termordering = none
% 0.80/1.16
% 0.80/1.16 litapriori = 1
% 0.80/1.16 termapriori = 0
% 0.80/1.16 litaposteriori = 0
% 0.80/1.16 termaposteriori = 0
% 0.80/1.16 demodaposteriori = 0
% 0.80/1.16 ordereqreflfact = 0
% 0.80/1.16
% 0.80/1.16 litselect = none
% 0.80/1.16
% 0.80/1.16 maxweight = 15
% 0.80/1.16 maxdepth = 30000
% 0.80/1.16 maxlength = 115
% 0.80/1.16 maxnrvars = 195
% 0.80/1.16 excuselevel = 1
% 0.80/1.16 increasemaxweight = 1
% 0.80/1.16
% 0.80/1.16 maxselected = 10000000
% 0.80/1.16 maxnrclauses = 10000000
% 0.80/1.16
% 0.80/1.16 showgenerated = 0
% 0.80/1.16 showkept = 0
% 0.80/1.16 showselected = 0
% 0.80/1.16 showdeleted = 0
% 0.80/1.16 showresimp = 1
% 0.80/1.16 showstatus = 2000
% 0.80/1.16
% 0.80/1.16 prologoutput = 0
% 0.80/1.16 nrgoals = 5000000
% 0.80/1.16 totalproof = 1
% 0.80/1.16
% 0.80/1.16 Symbols occurring in the translation:
% 0.80/1.16
% 0.80/1.16 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.80/1.16 . [1, 2] (w:1, o:17, a:1, s:1, b:0),
% 0.80/1.16 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.80/1.16 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.80/1.16 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.80/1.16 distinct_points [36, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.80/1.16 distinct_lines [37, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.80/1.16 convergent_lines [38, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.80/1.16 line_connecting [41, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.80/1.16 apart_point_and_line [42, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.80/1.16 intersection_point [43, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.80/1.16 parallel_through_point [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.80/1.16 skol1 [47, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Starting Search:
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Bliksems!, er is een bewijs:
% 0.80/1.16 % SZS status Theorem
% 0.80/1.16 % SZS output start Refutation
% 0.80/1.16
% 0.80/1.16 (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.80/1.16 (17) {G1,W0,D0,L0,V0,M0} I;r(2) { }.
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 % SZS output end Refutation
% 0.80/1.16 found a proof!
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Unprocessed initial clauses:
% 0.80/1.16
% 0.80/1.16 (19) {G0,W3,D2,L1,V1,M1} { ! distinct_points( X, X ) }.
% 0.80/1.16 (20) {G0,W3,D2,L1,V1,M1} { ! distinct_lines( X, X ) }.
% 0.80/1.16 (21) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 0.80/1.16 (22) {G0,W9,D2,L3,V3,M3} { ! distinct_points( X, Y ), distinct_points( X,
% 0.80/1.16 Z ), distinct_points( Y, Z ) }.
% 0.80/1.16 (23) {G0,W9,D2,L3,V3,M3} { ! distinct_lines( X, Y ), distinct_lines( X, Z
% 0.80/1.16 ), distinct_lines( Y, Z ) }.
% 0.80/1.16 (24) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), convergent_lines( X
% 0.80/1.16 , Z ), convergent_lines( Y, Z ) }.
% 0.80/1.16 (25) {G0,W8,D3,L2,V2,M2} { ! distinct_points( X, Y ), !
% 0.80/1.16 apart_point_and_line( X, line_connecting( X, Y ) ) }.
% 0.80/1.16 (26) {G0,W8,D3,L2,V2,M2} { ! distinct_points( X, Y ), !
% 0.80/1.16 apart_point_and_line( Y, line_connecting( X, Y ) ) }.
% 0.80/1.16 (27) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 0.80/1.16 apart_point_and_line( intersection_point( X, Y ), X ) }.
% 0.80/1.16 (28) {G0,W8,D3,L2,V2,M2} { ! convergent_lines( X, Y ), !
% 0.80/1.16 apart_point_and_line( intersection_point( X, Y ), Y ) }.
% 0.80/1.16 (29) {G0,W18,D2,L6,V4,M6} { ! distinct_points( X, Y ), ! distinct_lines( Z
% 0.80/1.16 , T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ),
% 0.80/1.16 apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.80/1.16 (30) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_points
% 0.80/1.16 ( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.80/1.16 (31) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_lines
% 0.80/1.16 ( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.80/1.16 (32) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), distinct_lines( Y,
% 0.80/1.16 Z ), convergent_lines( X, Z ) }.
% 0.80/1.16 (33) {G0,W5,D3,L1,V2,M1} { ! convergent_lines( parallel_through_point( Y,
% 0.80/1.16 X ), Y ) }.
% 0.80/1.16 (34) {G0,W5,D3,L1,V2,M1} { ! apart_point_and_line( X,
% 0.80/1.16 parallel_through_point( Y, X ) ) }.
% 0.80/1.16 (35) {G0,W12,D2,L4,V3,M4} { ! distinct_lines( X, Y ), apart_point_and_line
% 0.80/1.16 ( Z, X ), apart_point_and_line( Z, Y ), convergent_lines( X, Y ) }.
% 0.80/1.16 (36) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol1 ) }.
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Total Proof:
% 0.80/1.16
% 0.80/1.16 subsumption: (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.80/1.16 parent0: (21) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := X
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 0 ==> 0
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 resolution: (48) {G1,W0,D0,L0,V0,M0} { }.
% 0.80/1.16 parent0[0]: (2) {G0,W3,D2,L1,V1,M1} I { ! convergent_lines( X, X ) }.
% 0.80/1.16 parent1[0]: (36) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol1 )
% 0.80/1.16 }.
% 0.80/1.16 substitution0:
% 0.80/1.16 X := skol1
% 0.80/1.16 end
% 0.80/1.16 substitution1:
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 subsumption: (17) {G1,W0,D0,L0,V0,M0} I;r(2) { }.
% 0.80/1.16 parent0: (48) {G1,W0,D0,L0,V0,M0} { }.
% 0.80/1.16 substitution0:
% 0.80/1.16 end
% 0.80/1.16 permutation0:
% 0.80/1.16 end
% 0.80/1.16
% 0.80/1.16 Proof check complete!
% 0.80/1.16
% 0.80/1.16 Memory use:
% 0.80/1.16
% 0.80/1.16 space for terms: 633
% 0.80/1.16 space for clauses: 859
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 clauses generated: 18
% 0.80/1.16 clauses kept: 18
% 0.80/1.16 clauses selected: 0
% 0.80/1.16 clauses deleted: 0
% 0.80/1.16 clauses inuse deleted: 0
% 0.80/1.16
% 0.80/1.16 subsentry: 15
% 0.80/1.16 literals s-matched: 15
% 0.80/1.16 literals matched: 10
% 0.80/1.16 full subsumption: 2
% 0.80/1.16
% 0.80/1.16 checksum: 18722
% 0.80/1.16
% 0.80/1.16
% 0.80/1.16 Bliksem ended
%------------------------------------------------------------------------------