%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO258+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 : n016.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:14 PM UTC 2026
% Result : Theorem 0.39s 0.71s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GEO258+3 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 7 11:57:37 EDT 2026
% 0.15/0.35 % CPUTime :
% 0.15/0.35 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.39/0.71 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.71 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.71 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.71 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.71 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.71 Execution resolution_2 ended with status: unsatisfiable
% 0.39/0.71 Used heuristic: resolution_2
% 0.39/0.71
% 0.39/0.71 Input Clauses:
% 0.39/0.71
% 0.39/0.71 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
% 0.39/0.71 Fol Constants: skc1 skc2 skc3 skc4
% 0.39/0.71 Fol Functions: reverse_line line_connecting intersection_point parallel_through_point
% 0.39/0.71 Problem Properties:
% 0.39/0.71 This is a full first-order problem without equality.
% 0.39/0.71
% 0.39/0.71 After reduction: Problem Properties:
% 0.39/0.71 This is a full first-order problem without equality.
% 0.39/0.71
% 0.39/0.71
% 0.39/0.71 Reduced Input Clauses:
% 0.39/0.71 78:1:2:[53.0,3.1]:TopTop: right_apart_point(x0,x1) ->
% 0.39/0.71 79:1:2:[55.0,5.1]:TopTop: right_convergent_lines(x0,x1) ->
% 0.39/0.71 81:1:2:[53.0,11.1,78.0,80.2]:TopTop: apart_point_and_line(x0,x1) ->
% 0.39/0.71 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) ->
% 0.39/0.71 82:1:3:[53.0,17.1]:TopTopTop: ren1(x0,x1,x2) ->
% 0.39/0.71 83:1:3:[78.0,20.1]:TopTopTop: ren2(x0,x1,x2) ->
% 0.39/0.71 85:1:3:[82.0,23.1,83.0,84.2]:TopTopTop: divides_points(x0,x1,x2) ->
% 0.39/0.71 87:2:2:[55.0,52.2,55.0,86.3]:TopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,reverse_line(x1)) ->
% 0.39/0.71
% 0.39/0.71 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)
% 0.39/0.71
% 0.39/0.71 === Starting SPASS-SCL-FOL A Little Less Naive, considering 88 atoms initially, heuristics mode: resolution_2 ===
% 0.39/0.71
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 88
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Backtracking. Learning clause 96:1:2:[26.2,40.1]:TopTop: before_on_line(x0,x1,x1) ->
% 0.39/0.71 === Backtracking. Learning clause 97:1:2:[1.2,87.2,15.2,14.2]:TopTop: convergent_lines(x0,x1) ->
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 88
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 92
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Backtracking. Learning clause 98:1:1:[7.1,44.1]:Top: unequally_directed_lines(x0,x0) ->
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 92
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 156
% 0.39/0.71 === Backtracking. Learning clause 99: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)
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 160
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Backtracking. Learning clause 100:1:2:[7.1,70.1]:TopTop: unequally_directed_lines(parallel_through_point(x0,x1),x0) ->
% 0.39/0.71 === Conflict found: 99: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) {x0 -> skc1, x1 -> skc1, x2 -> skc1, x3 -> skc3}
% 0.39/0.71 === Backtracking. Learning clause 101:3:4:[99.2,31.1]:TopTopTopTop: between_on_line(x0,x1,x2,x3) -> before_on_line(x0,x2,x1),before_on_line(x0,x1,x2)
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 164
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Conflict found: 101:3:4:[99.2,31.1]:TopTopTopTop: between_on_line(x0,x1,x2,x3) -> before_on_line(x0,x2,x1),before_on_line(x0,x1,x2) {x0 -> skc1, x1 -> skc2, x2 -> skc3, x3 -> skc4}
% 0.39/0.71 === Backtracking. Learning clause 102:2:0:[101.1,76.1]:: -> before_on_line(skc1,skc3,skc2),before_on_line(skc1,skc2,skc3)
% 0.39/0.71 === Backtracking. Learning clause 103:2:0:[37.1,76.1]:: -> ren3(skc1,skc2,skc3,skc4),ren4(skc1,skc4,skc3,skc2)
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 164
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Backtracking. Learning clause 104:1:0:[38.2,77.1]:: ren3(skc1,skc4,skc3,skc2) ->
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 164
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Conflict found: 101:3:4:[99.2,31.1]:TopTopTopTop: between_on_line(x0,x1,x2,x3) -> before_on_line(x0,x2,x1),before_on_line(x0,x1,x2) {x0 -> skc1, x1 -> skc1, x2 -> skc1, x3 -> skc1}
% 0.39/0.71 === Backtracking. Learning clause 105:1:3:[101.2,96.1,38.2]:TopTopTop: ren3(x0,x1,x1,x2) ->
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 228
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 228
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Backtracking. Learning clause 106:1:3:[35.2,96.1]:TopTopTop: ren4(x0,x1,x2,x2) ->
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 236
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Backtracking. Learning clause 107:1:1:[1.2,98.1]:Top: unequally_directed_opposite_lines(reverse_line(x0),x0) ->
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 246
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Backtracking. Learning clause 108:1:2:[1.2,100.1]:TopTop: unequally_directed_opposite_lines(parallel_through_point(reverse_line(x0),x1),x0) ->
% 0.39/0.71 === Clause set with instances from active satisfied. Growing active. New size: 248
% 0.39/0.71 === Restarting.
% 0.39/0.71 === Backtracking. Learning clause 109:2:0:[33.3,104.1]:: before_on_line(skc1,skc4,skc3),before_on_line(skc1,skc3,skc2) ->
% 0.39/0.71 === Backtracking. Learning clause 110:1:0:[32.1,99.2,36.2,39.1,101.3,77.1,109.2,76.1]:: before_on_line(skc1,skc4,skc3) ->
% 0.39/0.71
% 0.39/0.71 SZS status Unsatisfiable
% 0.39/0.71
% 0.39/0.71 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.71
% 0.39/0.71 SPASS-SCL-FOL Statistics:
% 0.39/0.71 Number of learned clauses: 15
% 0.39/0.71 Number of propagations: 1799
% 0.39/0.71 Number of decisions: 561
% 0.39/0.71 Number of resolutions: 31
% 0.39/0.71 Number of condensations: 0
% 0.39/0.71 Number of sub resolutions: 18
% 0.39/0.71 Number of input literals (deduplicated): 45
% 0.39/0.71 Number of grows: 14
% 0.39/0.71 Number of considered ground atoms: 248
% 0.39/0.71
% 0.39/0.71 Needed: 0:00:00.13
% 0.39/0.71
%------------------------------------------------------------------------------