%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO255+3 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n029.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 : 300s
% DateTime : Thu May 7 07:22:13 PM UTC 2026
% Result : Theorem 2.27s 1.01s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO255+3 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n029.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 11:57:15 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.27/1.01 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.01 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.01 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.01 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.01 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.01 Execution resolution_2 ended with status: unsatisfiable
% 2.27/1.01 Used heuristic: resolution_2
% 2.27/1.01
% 2.27/1.01 Input Clauses:
% 2.27/1.01
% 2.27/1.01 Predicates: unequally_directed_opposite_lines unequally_directed_lines right_apart_point left_apart_point right_convergent_lines left_convergent_lines equally_directed_lines equally_directed_opposite_lines apart_point_and_line convergent_lines divides_points before_on_line distinct_points incident_point_and_line between_on_line distinct_lines point line ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8
% 2.27/1.01 Fol Constants: skc1 skc2 skc3
% 2.27/1.01 Fol Functions: reverse_line line_connecting intersection_point parallel_through_point
% 2.27/1.01 Problem Properties:
% 2.27/1.01 This is a full first-order problem without equality.
% 2.27/1.01
% 2.27/1.01 After reduction: Problem Properties:
% 2.27/1.01 This is a full first-order problem without equality.
% 2.27/1.01
% 2.27/1.01
% 2.27/1.01 Reduced Input Clauses:
% 2.27/1.01 78:1:2:[53.0,3.1]:TopTop: right_apart_point(x0,x1) ->
% 2.27/1.01 79:1:2:[55.0,5.1]:TopTop: right_convergent_lines(x0,x1) ->
% 2.27/1.01 81:1:2:[53.0,11.1,78.0,80.2]:TopTop: apart_point_and_line(x0,x1) ->
% 2.27/1.01 95:2:4:[53.0,71.2,53.0,88.3,53.0,89.4,53.0,90.5,53.0,91.6,53.0,92.7,53.0,93.8,53.0,94.9]:TopTopTopTop: distinct_points(x0,x1),distinct_lines(x2,x3) ->
% 2.27/1.01 82:1:3:[53.0,17.1]:TopTopTop: ren1(x0,x1,x2) ->
% 2.27/1.01 83:1:3:[78.0,20.1]:TopTopTop: ren2(x0,x1,x2) ->
% 2.27/1.01 85:1:3:[82.0,23.1,83.0,84.2]:TopTopTop: divides_points(x0,x1,x2) ->
% 2.27/1.01 87:2:2:[55.0,52.2,55.0,86.3]:TopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,reverse_line(x1)) ->
% 2.27/1.01
% 2.27/1.01 Most General Atoms: unequally_directed_opposite_lines(x0,x1) right_apart_point(x0,x1) right_convergent_lines(x0,x1) equally_directed_lines(x0,x1) equally_directed_opposite_lines(x0,x1) apart_point_and_line(x0,x1) convergent_lines(x0,x1) ren1(x0,x1,x2) ren2(x0,x1,x2) ren8(x0,x1) divides_points(x0,x1,x2) incident_point_and_line(x1,x2) ren3(x0,x1,x2,x3) before_on_line(x0,x2,x3) ren4(x0,x3,x2,x1) between_on_line(x0,x3,x2,x1) distinct_points(x0,x2) distinct_lines(x1,x2) unequally_directed_lines(x1,x2) ren5(x0,x2) ren6(x1,x2) left_apart_point(x0,x1) ren7(x0,x1) left_convergent_lines(x0,x1) point(x1) line(x1)
% 2.27/1.01
% 2.27/1.01 === Starting SPASS-SCL-FOL A Little Less Naive, considering 88 atoms initially, heuristics mode: resolution_2 ===
% 2.27/1.01
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 88
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 96:1:2:[26.2,40.1]:TopTop: before_on_line(x0,x1,x1) ->
% 2.27/1.01 === Backtracking. Learning clause 97:1:2:[1.2,87.2,15.2,14.2]:TopTop: convergent_lines(x0,x1) ->
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 88
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 92
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 98:1:1:[7.1,44.1]:Top: unequally_directed_lines(x0,x0) ->
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 92
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 156
% 2.27/1.01 === Backtracking. Learning clause 99:2:2:[7.2,51.2]:TopTop: equally_directed_lines(x0,reverse_line(x1)) -> unequally_directed_lines(x0,x1)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 159
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 100:1:2:[7.1,70.1,51.2]:TopTop: -> unequally_directed_lines(parallel_through_point(reverse_line(x0),x1),x0)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 162
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 101:1:0:[26.1,76.1]:: -> distinct_points(skc2,skc3)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 165
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 102:1:0:[26.1,77.1]:: -> distinct_points(skc3,skc2)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 165
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 103:1:3:[34.2,96.1]:TopTopTop: ren4(x0,x1,x1,x2) ->
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 229
% 2.27/1.01 === Backtracking. Learning clause 104:3:5:[26.2,41.1,32.2]:TopTopTopTopTop: ren3(x0,x1,x2,x3) -> distinct_points(x2,x4),distinct_points(x3,x4)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 229
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 105:2:3:[37.3,103.1]:TopTopTop: between_on_line(x0,x1,x2,x2) -> ren3(x0,x1,x2,x2)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 239
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 106:1:1:[1.2,98.1]:Top: unequally_directed_opposite_lines(reverse_line(x0),x0) ->
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 250
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 107:4:2:[58.3,100.1]:TopTop: line(parallel_through_point(reverse_line(x0),x1)),line(x0),unequally_directed_lines(parallel_through_point(reverse_line(x0),x1),reverse_line(x0)) -> point(intersection_point(parallel_through_point(reverse_line(x0),x1),x0))
% 2.27/1.01 === Backtracking. Learning clause 108:3:3:[50.1,100.1,48.1,46.1]:TopTopTop: unequally_directed_lines(parallel_through_point(reverse_line(x0),x1),reverse_line(x0)) -> unequally_directed_lines(x0,x2),unequally_directed_lines(parallel_through_point(reverse_line(x0),x1),x2)
% 2.27/1.01 === Backtracking. Learning clause 109:1:2:[16.1,100.1,97.1,2.2]:TopTop: unequally_directed_lines(parallel_through_point(reverse_line(x0),x1),reverse_line(x0)) ->
% 2.27/1.01 === Conflict found: 87:2:2:[55.0,52.2,55.0,86.3]:TopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,reverse_line(x1)) -> {x0 -> skc1, x1 -> skc2}
% 2.27/1.01 === Backtracking. Learning clause 110:1:2:[87.1,46.2,47.2]:TopTop: ren5(x0,x1) ->
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 252
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 111:2:1:[41.1,101.1]:Top: -> distinct_points(skc2,x0),distinct_points(skc3,x0)
% 2.27/1.01 === Backtracking. Learning clause 112:3:0:[57.3,101.1]:: point(skc2),point(skc3) -> line(line_connecting(skc2,skc3))
% 2.27/1.01 === Backtracking. Learning clause 113:1:0:[69.1,101.1]:: -> equally_directed_lines(line_connecting(skc2,skc3),reverse_line(line_connecting(skc3,skc2)))
% 2.27/1.01 === Backtracking. Learning clause 114:3:3:[51.1,45.1,2.1]:TopTopTop: -> unequally_directed_lines(x0,x1),unequally_directed_lines(x2,x1),unequally_directed_opposite_lines(x0,x2)
% 2.27/1.01 === Backtracking. Learning clause 115:3:4:[37.2,32.1,35.1]:TopTopTopTop: between_on_line(x0,x1,x2,x3) -> before_on_line(x0,x2,x3),before_on_line(x0,x2,x1)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 316
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 317
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 116:3:0:[57.3,102.1]:: point(skc3),point(skc2) -> line(line_connecting(skc3,skc2))
% 2.27/1.01 === Backtracking. Learning clause 117:1:0:[69.1,102.1]:: -> equally_directed_lines(line_connecting(skc3,skc2),reverse_line(line_connecting(skc2,skc3)))
% 2.27/1.01 === Backtracking. Learning clause 118:3:4:[37.3,35.1]:TopTopTopTop: between_on_line(x0,x1,x2,x3) -> ren3(x0,x1,x2,x3),before_on_line(x0,x2,x1)
% 2.27/1.01 === Backtracking. Learning clause 119:1:1:[1.2,87.1,114.3,98.1]:Top: unequally_directed_lines(x0,reverse_line(reverse_line(x0))) ->
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 317
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 120:1:1:[10.1,106.1]:Top: -> equally_directed_opposite_lines(reverse_line(x0),x0)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 319
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 121:2:2:[7.2,49.2]:TopTop: equally_directed_lines(x0,reverse_line(x1)),ren6(x0,x1) ->
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 319
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 123:4:4:[110.0,122.2,50.2,48.2,45.3]:TopTopTopTop: ren6(x0,reverse_line(x1)),unequally_directed_lines(x2,x0) -> ren6(x1,x3),unequally_directed_lines(x2,x1)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 383
% 2.27/1.01 === Conflict found: 114:3:3:[51.1,45.1,2.1]:TopTopTop: -> unequally_directed_lines(x0,x1),unequally_directed_lines(x2,x1),unequally_directed_opposite_lines(x0,x2) {x0 -> skc3, x1 -> skc3, x2 -> skc1}
% 2.27/1.01 === Backtracking. Learning clause 124:2:2:[114.1,98.1,1.1]:TopTop: -> unequally_directed_lines(x0,x1),unequally_directed_lines(x1,reverse_line(x0))
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 383
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 125:1:0:[7.1,113.1,51.2]:: -> unequally_directed_lines(line_connecting(skc2,skc3),line_connecting(skc3,skc2))
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 383
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 126:1:0:[7.1,117.1,51.2]:: -> unequally_directed_lines(line_connecting(skc3,skc2),line_connecting(skc2,skc3))
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 393
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 127:1:1:[51.2,45.1,109.1]:Top: -> unequally_directed_lines(reverse_line(reverse_line(x0)),reverse_line(x0))
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 393
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 457
% 2.27/1.01 === Backtracking. Learning clause 129:1:2:[49.1,128.1,48.2,87.1]:TopTop: ren6(x0,x1) ->
% 2.27/1.01 === Backtracking. Learning clause 130:4:5:[34.2,33.1,37.3]:TopTopTopTopTop: before_on_line(x0,x1,x2),between_on_line(x0,x3,x1,x4) -> ren3(x0,x4,x1,x2),ren3(x0,x3,x1,x4)
% 2.27/1.01 === Clause set with instances from active satisfied. Growing active. New size: 465
% 2.27/1.01 === Restarting.
% 2.27/1.01 === Backtracking. Learning clause 131:4:0:[58.3,125.1]:: line(line_connecting(skc2,skc3)),line(line_connecting(skc3,skc2)),unequally_directed_lines(line_connecting(skc2,skc3),reverse_line(line_connecting(skc3,skc2))) -> point(intersection_point(line_connecting(skc2,skc3),line_connecting(skc3,skc2)))
% 2.27/1.01 === Backtracking. Learning clause 132:1:0:[50.1,125.1,129.1,110.1]:: unequally_directed_lines(line_connecting(skc2,skc3),reverse_line(line_connecting(skc3,skc2))) ->
% 2.27/1.01 === Conflict found: 114:3:3:[51.1,45.1,2.1]:TopTopTop: -> unequally_directed_lines(x0,x1),unequally_directed_lines(x2,x1),unequally_directed_opposite_lines(x0,x2) {x0 -> line_connecting(skc3,skc2), x1 -> skc1, x2 -> line_connecting(skc2,skc3)}
% 2.27/1.01
% 2.27/1.01 SZS status Unsatisfiable
% 2.27/1.01
% 2.27/1.01 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.01
% 2.27/1.01 SPASS-SCL-FOL Statistics:
% 2.27/1.01 Number of learned clauses: 35
% 2.27/1.01 Number of propagations: 7075
% 2.27/1.01 Number of decisions: 1173
% 2.27/1.01 Number of resolutions: 69
% 2.27/1.01 Number of condensations: 0
% 2.27/1.01 Number of sub resolutions: 20
% 2.27/1.01 Number of input literals (deduplicated): 45
% 2.27/1.01 Number of grows: 26
% 2.27/1.01 Number of considered ground atoms: 465
% 2.27/1.01
% 2.27/1.01 Needed: 0:00:00.46
% 2.27/1.01
%------------------------------------------------------------------------------