TSTP Solution File: GEO171+2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : GEO171+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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:12 EDT 2022
% Result : Theorem 0.73s 1.12s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GEO171+2 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.14 % Command : bliksem %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Fri Jun 17 14:54:11 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.73/1.12 *** allocated 10000 integers for termspace/termends
% 0.73/1.12 *** allocated 10000 integers for clauses
% 0.73/1.12 *** allocated 10000 integers for justifications
% 0.73/1.12 Bliksem 1.12
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Automatic Strategy Selection
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Clauses:
% 0.73/1.12
% 0.73/1.12 { ! distinct_points( X, X ) }.
% 0.73/1.12 { ! distinct_lines( X, X ) }.
% 0.73/1.12 { ! convergent_lines( X, X ) }.
% 0.73/1.12 { ! distinct_points( X, Y ), distinct_points( X, Z ), distinct_points( Y, Z
% 0.73/1.12 ) }.
% 0.73/1.12 { ! distinct_lines( X, Y ), distinct_lines( X, Z ), distinct_lines( Y, Z )
% 0.73/1.12 }.
% 0.73/1.12 { ! convergent_lines( X, Y ), convergent_lines( X, Z ), convergent_lines( Y
% 0.73/1.12 , Z ) }.
% 0.73/1.12 { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 0.73/1.12 , Y ) ), distinct_points( Z, X ) }.
% 0.73/1.12 { ! distinct_points( X, Y ), ! apart_point_and_line( Z, line_connecting( X
% 0.73/1.12 , Y ) ), distinct_points( Z, Y ) }.
% 0.73/1.12 { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, X ),
% 0.73/1.12 distinct_points( Z, intersection_point( X, Y ) ) }.
% 0.73/1.12 { ! convergent_lines( X, Y ), ! apart_point_and_line( Z, Y ),
% 0.73/1.12 distinct_points( Z, intersection_point( X, Y ) ) }.
% 0.73/1.12 { ! distinct_points( X, Y ), ! distinct_lines( Z, T ), apart_point_and_line
% 0.73/1.12 ( X, Z ), apart_point_and_line( X, T ), apart_point_and_line( Y, Z ),
% 0.73/1.12 apart_point_and_line( Y, T ) }.
% 0.73/1.12 { ! apart_point_and_line( X, Y ), distinct_points( X, Z ),
% 0.73/1.12 apart_point_and_line( Z, Y ) }.
% 0.73/1.12 { ! apart_point_and_line( X, Y ), distinct_lines( Y, Z ),
% 0.73/1.12 apart_point_and_line( X, Z ) }.
% 0.73/1.12 { ! convergent_lines( X, Y ), distinct_lines( X, Y ) }.
% 0.73/1.12 { convergent_lines( skol1, skol2 ) }.
% 0.73/1.12 { ! distinct_lines( skol1, skol2 ) }.
% 0.73/1.12
% 0.73/1.12 percentage equality = 0.000000, percentage horn = 0.625000
% 0.73/1.12 This a non-horn, non-equality problem
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Options Used:
% 0.73/1.12
% 0.73/1.12 useres = 1
% 0.73/1.12 useparamod = 0
% 0.73/1.12 useeqrefl = 0
% 0.73/1.12 useeqfact = 0
% 0.73/1.12 usefactor = 1
% 0.73/1.12 usesimpsplitting = 0
% 0.73/1.12 usesimpdemod = 0
% 0.73/1.12 usesimpres = 3
% 0.73/1.12
% 0.73/1.12 resimpinuse = 1000
% 0.73/1.12 resimpclauses = 20000
% 0.73/1.12 substype = standard
% 0.73/1.12 backwardsubs = 1
% 0.73/1.12 selectoldest = 5
% 0.73/1.12
% 0.73/1.12 litorderings [0] = split
% 0.73/1.12 litorderings [1] = liftord
% 0.73/1.12
% 0.73/1.12 termordering = none
% 0.73/1.12
% 0.73/1.12 litapriori = 1
% 0.73/1.12 termapriori = 0
% 0.73/1.12 litaposteriori = 0
% 0.73/1.12 termaposteriori = 0
% 0.73/1.12 demodaposteriori = 0
% 0.73/1.12 ordereqreflfact = 0
% 0.73/1.12
% 0.73/1.12 litselect = none
% 0.73/1.12
% 0.73/1.12 maxweight = 15
% 0.73/1.12 maxdepth = 30000
% 0.73/1.12 maxlength = 115
% 0.73/1.12 maxnrvars = 195
% 0.73/1.12 excuselevel = 1
% 0.73/1.12 increasemaxweight = 1
% 0.73/1.12
% 0.73/1.12 maxselected = 10000000
% 0.73/1.12 maxnrclauses = 10000000
% 0.73/1.12
% 0.73/1.12 showgenerated = 0
% 0.73/1.12 showkept = 0
% 0.73/1.12 showselected = 0
% 0.73/1.12 showdeleted = 0
% 0.73/1.12 showresimp = 1
% 0.73/1.12 showstatus = 2000
% 0.73/1.12
% 0.73/1.12 prologoutput = 0
% 0.73/1.12 nrgoals = 5000000
% 0.73/1.12 totalproof = 1
% 0.73/1.12
% 0.73/1.12 Symbols occurring in the translation:
% 0.73/1.12
% 0.73/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.12 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.73/1.12 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.73/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.12 distinct_points [36, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.73/1.12 distinct_lines [37, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.73/1.12 convergent_lines [38, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.73/1.12 line_connecting [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.73/1.12 apart_point_and_line [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.73/1.12 intersection_point [43, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.73/1.12 skol1 [46, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.73/1.12 skol2 [47, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Starting Search:
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Bliksems!, er is een bewijs:
% 0.73/1.12 % SZS status Theorem
% 0.73/1.12 % SZS output start Refutation
% 0.73/1.12
% 0.73/1.12 (13) {G0,W6,D2,L2,V2,M1} I { ! convergent_lines( X, Y ), distinct_lines( X
% 0.73/1.12 , Y ) }.
% 0.73/1.12 (14) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 ) }.
% 0.73/1.12 (15) {G0,W3,D2,L1,V0,M1} I { ! distinct_lines( skol1, skol2 ) }.
% 0.73/1.12 (21) {G1,W0,D0,L0,V0,M0} R(13,15);r(14) { }.
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 % SZS output end Refutation
% 0.73/1.12 found a proof!
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Unprocessed initial clauses:
% 0.73/1.12
% 0.73/1.12 (23) {G0,W3,D2,L1,V1,M1} { ! distinct_points( X, X ) }.
% 0.73/1.12 (24) {G0,W3,D2,L1,V1,M1} { ! distinct_lines( X, X ) }.
% 0.73/1.12 (25) {G0,W3,D2,L1,V1,M1} { ! convergent_lines( X, X ) }.
% 0.73/1.12 (26) {G0,W9,D2,L3,V3,M3} { ! distinct_points( X, Y ), distinct_points( X,
% 0.73/1.12 Z ), distinct_points( Y, Z ) }.
% 0.73/1.12 (27) {G0,W9,D2,L3,V3,M3} { ! distinct_lines( X, Y ), distinct_lines( X, Z
% 0.73/1.12 ), distinct_lines( Y, Z ) }.
% 0.73/1.12 (28) {G0,W9,D2,L3,V3,M3} { ! convergent_lines( X, Y ), convergent_lines( X
% 0.73/1.12 , Z ), convergent_lines( Y, Z ) }.
% 0.73/1.12 (29) {G0,W11,D3,L3,V3,M3} { ! distinct_points( X, Y ), !
% 0.73/1.12 apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, X
% 0.73/1.12 ) }.
% 0.73/1.12 (30) {G0,W11,D3,L3,V3,M3} { ! distinct_points( X, Y ), !
% 0.73/1.12 apart_point_and_line( Z, line_connecting( X, Y ) ), distinct_points( Z, Y
% 0.73/1.12 ) }.
% 0.73/1.12 (31) {G0,W11,D3,L3,V3,M3} { ! convergent_lines( X, Y ), !
% 0.73/1.12 apart_point_and_line( Z, X ), distinct_points( Z, intersection_point( X,
% 0.73/1.12 Y ) ) }.
% 0.73/1.12 (32) {G0,W11,D3,L3,V3,M3} { ! convergent_lines( X, Y ), !
% 0.73/1.12 apart_point_and_line( Z, Y ), distinct_points( Z, intersection_point( X,
% 0.73/1.12 Y ) ) }.
% 0.73/1.12 (33) {G0,W18,D2,L6,V4,M6} { ! distinct_points( X, Y ), ! distinct_lines( Z
% 0.73/1.12 , T ), apart_point_and_line( X, Z ), apart_point_and_line( X, T ),
% 0.73/1.12 apart_point_and_line( Y, Z ), apart_point_and_line( Y, T ) }.
% 0.73/1.12 (34) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_points
% 0.73/1.12 ( X, Z ), apart_point_and_line( Z, Y ) }.
% 0.73/1.12 (35) {G0,W9,D2,L3,V3,M3} { ! apart_point_and_line( X, Y ), distinct_lines
% 0.73/1.12 ( Y, Z ), apart_point_and_line( X, Z ) }.
% 0.73/1.12 (36) {G0,W6,D2,L2,V2,M2} { ! convergent_lines( X, Y ), distinct_lines( X,
% 0.73/1.12 Y ) }.
% 0.73/1.12 (37) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 ) }.
% 0.73/1.12 (38) {G0,W3,D2,L1,V0,M1} { ! distinct_lines( skol1, skol2 ) }.
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Total Proof:
% 0.73/1.12
% 0.73/1.12 subsumption: (13) {G0,W6,D2,L2,V2,M1} I { ! convergent_lines( X, Y ),
% 0.73/1.12 distinct_lines( X, Y ) }.
% 0.73/1.12 parent0: (36) {G0,W6,D2,L2,V2,M2} { ! convergent_lines( X, Y ),
% 0.73/1.12 distinct_lines( X, Y ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 1
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (14) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.73/1.12 }.
% 0.73/1.12 parent0: (37) {G0,W3,D2,L1,V0,M1} { convergent_lines( skol1, skol2 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (15) {G0,W3,D2,L1,V0,M1} I { ! distinct_lines( skol1, skol2 )
% 0.73/1.12 }.
% 0.73/1.12 parent0: (38) {G0,W3,D2,L1,V0,M1} { ! distinct_lines( skol1, skol2 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (66) {G1,W3,D2,L1,V0,M1} { ! convergent_lines( skol1, skol2 )
% 0.73/1.12 }.
% 0.73/1.12 parent0[0]: (15) {G0,W3,D2,L1,V0,M1} I { ! distinct_lines( skol1, skol2 )
% 0.73/1.12 }.
% 0.73/1.12 parent1[1]: (13) {G0,W6,D2,L2,V2,M1} I { ! convergent_lines( X, Y ),
% 0.73/1.12 distinct_lines( X, Y ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 X := skol1
% 0.73/1.12 Y := skol2
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (67) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.12 parent0[0]: (66) {G1,W3,D2,L1,V0,M1} { ! convergent_lines( skol1, skol2 )
% 0.73/1.12 }.
% 0.73/1.12 parent1[0]: (14) {G0,W3,D2,L1,V0,M1} I { convergent_lines( skol1, skol2 )
% 0.73/1.12 }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (21) {G1,W0,D0,L0,V0,M0} R(13,15);r(14) { }.
% 0.73/1.12 parent0: (67) {G1,W0,D0,L0,V0,M0} { }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 Proof check complete!
% 0.73/1.12
% 0.73/1.12 Memory use:
% 0.73/1.12
% 0.73/1.12 space for terms: 609
% 0.73/1.12 space for clauses: 978
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 clauses generated: 46
% 0.73/1.12 clauses kept: 22
% 0.73/1.12 clauses selected: 8
% 0.73/1.12 clauses deleted: 0
% 0.73/1.12 clauses inuse deleted: 0
% 0.73/1.12
% 0.73/1.12 subsentry: 92
% 0.73/1.12 literals s-matched: 75
% 0.73/1.12 literals matched: 60
% 0.73/1.12 full subsumption: 22
% 0.73/1.12
% 0.73/1.12 checksum: -763
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Bliksem ended
%------------------------------------------------------------------------------