%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO255+1 : TPTP v9.2.1. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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 0.52s 0.59s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO255+1 : TPTP v9.2.1. Bugfixed v6.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.33 % Computer : n001.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Thu May 7 11:57:49 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.33 SPASS-SCL-FOL version:
% 0.18/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.52/0.59 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.59 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.59 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.59 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.59 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.59 Execution resolution_1 ended with status: unsatisfiable
% 0.52/0.59 Used heuristic: resolution_1
% 0.52/0.59
% 0.52/0.59 Input Clauses:
% 0.52/0.59
% 0.52/0.59 Predicates: apart_point_and_line left_apart_point convergent_lines unequally_directed_lines divides_points before_on_line distinct_points between_on_line distinct_lines line left_convergent_lines point ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 ren9 ren10
% 0.52/0.59 Fol Constants: skc1 skc2 skc3
% 0.52/0.59 Fol Functions: reverse_line line_connecting intersection_point parallel_through_point
% 0.52/0.59 Problem Properties:
% 0.52/0.59 This is a full first-order problem without equality.
% 0.52/0.59
% 0.52/0.59 After reduction: Problem Properties:
% 0.52/0.59 This is a full first-order problem without equality.
% 0.52/0.59
% 0.52/0.59
% 0.52/0.59 Reduced Input Clauses:
% 0.52/0.59 77:1:2:[49.0,1.1,49.0,76.2]:TopTop: apart_point_and_line(x0,x1) ->
% 0.52/0.59 78:1:3:[49.0,7.1]:TopTopTop: ren1(x0,x1,x2) ->
% 0.52/0.59 79:1:3:[49.0,10.1]:TopTopTop: ren2(x0,x1,x2) ->
% 0.52/0.59 97:2:4:[49.0,67.2,49.0,90.3,49.0,91.4,49.0,92.5,49.0,93.6,49.0,94.7,49.0,95.8,49.0,96.9]:TopTopTopTop: distinct_points(x0,x1),distinct_lines(x2,x3) ->
% 0.52/0.59 81:1:3:[78.0,13.1,79.0,80.2]:TopTopTop: divides_points(x0,x1,x2) ->
% 0.52/0.59 83:1:2:[49.0,16.1,49.0,82.2]:TopTop: ren3(x0,x1) ->
% 0.52/0.59 85:1:2:[49.0,19.1,49.0,84.2]:TopTop: ren4(x0,x1) ->
% 0.52/0.59 87:3:3:[83.0,26.1,85.0,86.2]:TopTopTop: distinct_points(x0,x1) -> unequally_directed_lines(x2,line_connecting(x0,x1)),before_on_line(x2,x0,x1)
% 0.52/0.59 89:2:2:[51.0,48.2,51.0,88.3]:TopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,reverse_line(x1)) ->
% 0.52/0.59
% 0.52/0.59 Most General Atoms: apart_point_and_line(x0,x1) convergent_lines(x0,x1) ren1(x0,x1,x2) ren2(x0,x1,x2) divides_points(x0,x1,x2) ren10(x0,x1) ren3(x1,x0) ren4(x2,x0) ren5(x0,x1,x2,x3) before_on_line(x0,x2,x3) ren6(x0,x3,x2,x1) between_on_line(x0,x3,x2,x1) distinct_points(x0,x2) distinct_lines(x1,x2) unequally_directed_lines(x1,x2) ren7(x0,x2) ren8(x1,x2) line(x1) left_apart_point(x0,x1) ren9(x0,x1) left_convergent_lines(x0,x1) point(x1)
% 0.52/0.59
% 0.52/0.59 === Starting SPASS-SCL-FOL A Little Less Naive, considering 52 atoms initially, heuristics mode: resolution_1 ===
% 0.52/0.59
% 0.52/0.59 === Backtracking. Learning clause 98:1:0:[22.1,75.1]:: -> distinct_points(skc3,skc2)
% 0.52/0.59 === Backtracking. Learning clause 99:1:1:[45.2,40.1]:Top: ren8(reverse_line(x0),x0) ->
% 0.52/0.59 === Backtracking. Learning clause 100:1:1:[43.2,40.1]:Top: ren7(reverse_line(x0),x0) ->
% 0.52/0.59 === Backtracking. Learning clause 101:1:1:[5.2,40.1]:Top: convergent_lines(reverse_line(x0),x0) ->
% 0.52/0.59 === Backtracking. Learning clause 102:2:3:[41.3,66.1]:TopTopTop: unequally_directed_lines(x0,parallel_through_point(x1,x2)) -> unequally_directed_lines(x0,x1)
% 0.52/0.59 === Backtracking. Learning clause 103:1:2:[4.2,66.1]:TopTop: convergent_lines(parallel_through_point(x0,x1),x0) ->
% 0.52/0.59 === Backtracking. Learning clause 104:3:4:[33.3,30.1,27.1]:TopTopTopTop: between_on_line(x0,x1,x2,x3) -> before_on_line(x0,x3,x2),before_on_line(x0,x1,x2)
% 0.52/0.59 === Conflict found: 89:2:2:[51.0,48.2,51.0,88.3]:TopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,reverse_line(x1)) -> {x0 -> skc1, x1 -> line_connecting(skc1,skc1)}
% 0.52/0.59 === Backtracking. Learning clause 105:1:2:[89.2,5.2,4.2]:TopTop: convergent_lines(x0,x1) ->
% 0.52/0.59 === Backtracking. Learning clause 106:3:2:[47.4,66.1]:TopTop: line(parallel_through_point(reverse_line(x0),x1)),line(x0) -> unequally_directed_lines(parallel_through_point(reverse_line(x0),x1),x0)
% 0.52/0.59 === Backtracking. Learning clause 107:1:2:[43.2,66.1]:TopTop: ren7(parallel_through_point(reverse_line(x0),x1),x0) ->
% 0.52/0.59 === Backtracking. Learning clause 108:1:2:[45.2,66.1]:TopTop: ren8(parallel_through_point(reverse_line(x0),x1),x0) ->
% 0.52/0.59 === Backtracking. Learning clause 109:4:4:[41.2,65.1,6.2,41.3]:TopTopTopTop: unequally_directed_lines(x0,line_connecting(x1,x2)),unequally_directed_lines(x3,line_connecting(x2,x1)) -> convergent_lines(x0,line_connecting(x1,x2)),unequally_directed_lines(x3,x0)
% 0.52/0.59 === Backtracking. Learning clause 110:2:2:[41.2,40.1]:TopTop: unequally_directed_lines(x0,x1) -> unequally_directed_lines(x1,x0)
% 0.52/0.59 === Backtracking. Learning clause 111:1:1:[47.4,65.1,40.1]:Top: line(line_connecting(x0,x0)) ->
% 0.52/0.59 === Clause set with instances from active satisfied. Growing active. New size: 73
% 0.52/0.59 === Restarting.
% 0.52/0.59 === Clause set with instances from active satisfied. Growing active. New size: 137
% 0.52/0.59 === Clause set with instances from active satisfied. Growing active. New size: 201
% 0.52/0.59 === Backtracking. Learning clause 112:6:5:[46.2,41.2,41.2,44.1]:TopTopTopTopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,x2) -> ren7(x0,x3),unequally_directed_lines(x1,reverse_line(x4)),unequally_directed_lines(x2,x4),unequally_directed_lines(x4,x3)
% 0.52/0.59 === Conflict found: 112:6:5:[46.2,41.2,41.2,44.1]:TopTopTopTopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,x2) -> ren7(x0,x3),unequally_directed_lines(x1,reverse_line(x4)),unequally_directed_lines(x2,x4),unequally_directed_lines(x4,x3) {x0 -> reverse_line(skc1), x1 -> skc1, x2 -> skc1, x3 -> skc1, x4 -> line_connecting(skc1,skc1)}
% 0.52/0.59 === Backtracking. Learning clause 113:8:7:[112.5,41.1,41.1]:TopTopTopTopTopTopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,x2) -> ren7(x0,x3),unequally_directed_lines(x1,reverse_line(x4)),unequally_directed_lines(x2,x5),unequally_directed_lines(x4,x5),unequally_directed_lines(x4,x6),unequally_directed_lines(x3,x6)
% 0.52/0.59 === Conflict found: 113:8:7:[112.5,41.1,41.1]:TopTopTopTopTopTopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,x2) -> ren7(x0,x3),unequally_directed_lines(x1,reverse_line(x4)),unequally_directed_lines(x2,x5),unequally_directed_lines(x4,x5),unequally_directed_lines(x4,x6),unequally_directed_lines(x3,x6) {x0 -> skc1, x1 -> line_connecting(skc1,skc1), x2 -> line_connecting(skc1,skc1), x3 -> skc1, x4 -> line_connecting(skc1,skc1), x5 -> line_connecting(skc1,skc1), x6 -> reverse_line(line_connecting(skc1,skc1))}
% 0.52/0.59 === Backtracking. Learning clause 114:8:7:[113.4,65.1,40.1,110.2,113.6]:TopTopTopTopTopTopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,x2) -> ren7(x3,x4),unequally_directed_lines(x4,reverse_line(line_connecting(x5,x5))),ren7(x0,x6),unequally_directed_lines(x1,reverse_line(line_connecting(x5,x5))),unequally_directed_lines(x2,x3),unequally_directed_lines(x6,x3)
% 0.52/0.59 === Conflict found: 113:8:7:[112.5,41.1,41.1]:TopTopTopTopTopTopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,x2) -> ren7(x0,x3),unequally_directed_lines(x1,reverse_line(x4)),unequally_directed_lines(x2,x5),unequally_directed_lines(x4,x5),unequally_directed_lines(x4,x6),unequally_directed_lines(x3,x6) {x0 -> reverse_line(skc1), x1 -> line_connecting(skc1,skc1), x2 -> skc1, x3 -> skc1, x4 -> line_connecting(skc1,skc1), x5 -> skc1, x6 -> line_connecting(skc1,skc1)}
% 0.52/0.59
% 0.52/0.59 SZS status Unsatisfiable
% 0.52/0.59
% 0.52/0.59 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.59
% 0.52/0.59 SPASS-SCL-FOL Statistics:
% 0.52/0.59 Number of learned clauses: 17
% 0.52/0.59 Number of propagations: 595
% 0.52/0.59 Number of decisions: 102
% 0.52/0.59 Number of resolutions: 40
% 0.52/0.59 Number of condensations: 0
% 0.52/0.59 Number of sub resolutions: 22
% 0.52/0.59 Number of input literals (deduplicated): 43
% 0.52/0.59 Number of grows: 3
% 0.52/0.59 Number of considered ground atoms: 201
% 0.52/0.59
% 0.52/0.59 Needed: 0:00:00.05
% 0.52/0.59
%------------------------------------------------------------------------------