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