%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO223+3 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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:08 PM UTC 2026
% Result : Theorem 1.88s 0.91s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO223+3 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n014.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 11:56:53 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 1.88/0.91 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.88/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.88/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.88/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.88/0.91 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.88/0.91 Execution resolution_3 ended with status: unsatisfiable
% 1.88/0.91 Used heuristic: resolution_3
% 1.88/0.91
% 1.88/0.91 Input Clauses:
% 1.88/0.91
% 1.88/0.91 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line unorthogonal_lines point line equal_points equal_lines parallel_lines incident_point_and_line orthogonal_lines ren1 ren2 ren3 ren4
% 1.88/0.91 Fol Constants: skc1 skc2
% 1.88/0.91 Fol Functions: line_connecting intersection_point parallel_through_point orthogonal_through_point
% 1.88/0.91 Problem Properties:
% 1.88/0.91 This is a full first-order problem without equality.
% 1.88/0.91
% 1.88/0.91 After reduction: Problem Properties:
% 1.88/0.91 This is a full first-order problem without equality.
% 1.88/0.91
% 1.88/0.91
% 1.88/0.91 Reduced Input Clauses:
% 1.88/0.91
% 1.88/0.91 Most General Atoms: distinct_points(x1,x2) convergent_lines(x1,x2) distinct_lines(x2,x3) orthogonal_lines(x0,x1) ren1(x0,x2) ren2(x1,x2) apart_point_and_line(x2,x0) ren3(x0,x1) ren4(x0,x2) unorthogonal_lines(x2,x1) point(x1) line(x1) equal_points(x0,x1) equal_lines(x0,x1) parallel_lines(x0,x1) incident_point_and_line(x0,x1)
% 1.88/0.91
% 1.88/0.91 === Starting SPASS-SCL-FOL A Little Less Naive, considering 32 atoms initially, heuristics mode: resolution_3 ===
% 1.88/0.91
% 1.88/0.91 === Backtracking. Learning clause 50:2:3:[6.3,16.1,15.2]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 1.88/0.91 === Backtracking. Learning clause 51:2:3:[6.3,16.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 1.88/0.91 === Backtracking. Learning clause 52:1:2:[15.2,16.1]:TopTop: distinct_lines(parallel_through_point(x0,x1),x0) ->
% 1.88/0.91 === Backtracking. Learning clause 53:1:0:[42.2,49.1]:: -> distinct_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1))
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 38
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Backtracking. Learning clause 54:4:2:[27.1,53.1]:TopTop: -> apart_point_and_line(x0,parallel_through_point(skc2,skc1)),apart_point_and_line(x0,orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1)),unorthogonal_lines(parallel_through_point(skc2,skc1),x1),unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1),x1)
% 1.88/0.91 === Backtracking. Learning clause 55:2:1:[5.1,53.1]:Top: -> distinct_lines(parallel_through_point(skc2,skc1),x0),distinct_lines(orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1),x0)
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 49
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Backtracking. Learning clause 56:3:1:[27.5,25.1,53.1]:Top: -> apart_point_and_line(x0,parallel_through_point(skc2,skc1)),apart_point_and_line(x0,orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1)),unorthogonal_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 54
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Conflict found: 56:3:1:[27.5,25.1,53.1]:Top: -> apart_point_and_line(x0,parallel_through_point(skc2,skc1)),apart_point_and_line(x0,orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1)),unorthogonal_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)) {x0 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 58:3:1:[17.0,57.3,56.3,33.4,26.1]:Top: ren3(x0,parallel_through_point(skc2,skc1)),ren4(x0,orthogonal_through_point(skc2,skc1)),convergent_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)) ->
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 59
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Conflict found: 58:3:1:[17.0,57.3,56.3,33.4,26.1]:Top: ren3(x0,parallel_through_point(skc2,skc1)),ren4(x0,orthogonal_through_point(skc2,skc1)),convergent_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)) -> {x0 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 59:4:2:[58.3,14.3,31.2,29.2]:TopTop: convergent_lines(parallel_through_point(skc2,skc1),x0) -> distinct_lines(x0,orthogonal_through_point(skc2,skc1)),convergent_lines(x1,orthogonal_through_point(skc2,skc1)),convergent_lines(x1,parallel_through_point(skc2,skc1))
% 1.88/0.91 === Backtracking. Learning clause 60:3:1:[15.2,58.3]:Top: distinct_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)),ren3(x0,parallel_through_point(skc2,skc1)),ren4(x0,orthogonal_through_point(skc2,skc1)) ->
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 66
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Conflict found: 60:3:1:[15.2,58.3]:Top: distinct_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)),ren3(x0,parallel_through_point(skc2,skc1)),ren4(x0,orthogonal_through_point(skc2,skc1)) -> {x0 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 61:4:2:[60.1,5.3,31.2]:TopTop: ren3(x0,parallel_through_point(skc2,skc1)),distinct_lines(x1,parallel_through_point(skc2,skc1)) -> distinct_lines(x1,orthogonal_through_point(skc2,skc1)),convergent_lines(x0,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Conflict found: 56:3:1:[27.5,25.1,53.1]:Top: -> apart_point_and_line(x0,parallel_through_point(skc2,skc1)),apart_point_and_line(x0,orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1)),unorthogonal_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)) {x0 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 63:4:2:[17.0,62.1,56.3,24.2,26.1,6.3]:TopTop: convergent_lines(x0,parallel_through_point(skc2,skc1)) -> ren1(parallel_through_point(skc2,skc1),x1),ren2(orthogonal_through_point(skc2,skc1),x1),convergent_lines(x0,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Conflict found: 59:4:2:[58.3,14.3,31.2,29.2]:TopTop: convergent_lines(parallel_through_point(skc2,skc1),x0) -> distinct_lines(x0,orthogonal_through_point(skc2,skc1)),convergent_lines(x1,orthogonal_through_point(skc2,skc1)),convergent_lines(x1,parallel_through_point(skc2,skc1)) {x0 -> skc1, x1 -> parallel_through_point(orthogonal_through_point(skc2,skc1),skc1)}
% 1.88/0.91 === Backtracking. Learning clause 64:3:2:[59.3,16.1]:TopTop: convergent_lines(parallel_through_point(skc2,skc1),x0) -> distinct_lines(x0,orthogonal_through_point(skc2,skc1)),convergent_lines(parallel_through_point(orthogonal_through_point(skc2,skc1),x1),parallel_through_point(skc2,skc1))
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 77
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Conflict found: 63:4:2:[17.0,62.1,56.3,24.2,26.1,6.3]:TopTop: convergent_lines(x0,parallel_through_point(skc2,skc1)) -> ren1(parallel_through_point(skc2,skc1),x1),ren2(orthogonal_through_point(skc2,skc1),x1),convergent_lines(x0,orthogonal_through_point(skc2,skc1)) {x0 -> skc1, x1 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 65:4:2:[63.3,22.1,21.1]:TopTop: convergent_lines(x0,parallel_through_point(skc2,skc1)) -> convergent_lines(x0,orthogonal_through_point(skc2,skc1)),convergent_lines(orthogonal_through_point(skc2,skc1),x1),unorthogonal_lines(parallel_through_point(skc2,skc1),x1)
% 1.88/0.91 === Backtracking. Learning clause 66:4:2:[30.2,61.1]:TopTop: distinct_lines(x0,parallel_through_point(skc2,skc1)) -> unorthogonal_lines(x1,parallel_through_point(skc2,skc1)),distinct_lines(x0,orthogonal_through_point(skc2,skc1)),convergent_lines(x1,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Conflict found: 51:2:3:[6.3,16.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1) {x0 -> parallel_through_point(orthogonal_through_point(skc2,skc1),skc1), x1 -> skc2, x2 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 67:3:2:[51.1,64.3]:TopTop: convergent_lines(parallel_through_point(skc2,skc1),x0) -> convergent_lines(parallel_through_point(orthogonal_through_point(skc2,skc1),x1),skc2),distinct_lines(x0,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 81
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Backtracking. Learning clause 68:4:3:[6.1,67.2]:TopTopTop: convergent_lines(parallel_through_point(skc2,skc1),x0) -> convergent_lines(parallel_through_point(orthogonal_through_point(skc2,skc1),x1),x2),convergent_lines(skc2,x2),distinct_lines(x0,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Backtracking. Learning clause 69:4:2:[6.2,16.1,68.2,15.2]:TopTop: distinct_lines(parallel_through_point(skc2,skc1),x0) -> convergent_lines(x1,orthogonal_through_point(skc2,skc1)),convergent_lines(skc2,x1),distinct_lines(x0,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Backtracking. Learning clause 70:6:5:[27.1,5.3]:TopTopTopTopTop: distinct_lines(x0,x1) -> apart_point_and_line(x2,x1),apart_point_and_line(x2,x3),unorthogonal_lines(x1,x4),unorthogonal_lines(x3,x4),distinct_lines(x0,x3)
% 1.88/0.91 === Conflict found: 60:3:1:[15.2,58.3]:Top: distinct_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)),ren3(x0,parallel_through_point(skc2,skc1)),ren4(x0,orthogonal_through_point(skc2,skc1)) -> {x0 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 71:4:2:[60.1,5.3]:TopTop: ren3(x0,parallel_through_point(skc2,skc1)),ren4(x0,orthogonal_through_point(skc2,skc1)),distinct_lines(x1,parallel_through_point(skc2,skc1)) -> distinct_lines(x1,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Conflict found: 63:4:2:[17.0,62.1,56.3,24.2,26.1,6.3]:TopTop: convergent_lines(x0,parallel_through_point(skc2,skc1)) -> ren1(parallel_through_point(skc2,skc1),x1),ren2(orthogonal_through_point(skc2,skc1),x1),convergent_lines(x0,orthogonal_through_point(skc2,skc1)) {x0 -> orthogonal_through_point(skc2,skc1), x1 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 72:4:2:[63.4,3.1,15.2,5.3,5.3,2.1]:TopTop: distinct_lines(x0,parallel_through_point(skc2,skc1)) -> ren1(parallel_through_point(skc2,skc1),x1),ren2(orthogonal_through_point(skc2,skc1),x1),distinct_lines(x0,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Backtracking. Learning clause 73:6:4:[14.3,3.1,6.3,69.2,5.3]:TopTopTopTop: distinct_lines(x0,parallel_through_point(skc2,skc1)) -> distinct_lines(x1,orthogonal_through_point(skc2,skc1)),convergent_lines(x2,x1),convergent_lines(skc2,x2),distinct_lines(x3,orthogonal_through_point(skc2,skc1)),distinct_lines(x0,x3)
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 93
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Conflict found: 50:2:3:[6.3,16.1,15.2]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1) {x0 -> parallel_through_point(skc2,skc1), x1 -> orthogonal_through_point(skc2,skc1), x2 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 74:4:5:[50.1,5.3,34.1]:TopTopTopTopTop: distinct_lines(x0,x1) -> distinct_lines(x0,parallel_through_point(x2,x3)),unorthogonal_lines(x4,x1),unorthogonal_lines(x4,x2)
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 98
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Conflict found: 74:4:5:[50.1,5.3,34.1]:TopTopTopTopTop: distinct_lines(x0,x1) -> distinct_lines(x0,parallel_through_point(x2,x3)),unorthogonal_lines(x4,x1),unorthogonal_lines(x4,x2) {x0 -> parallel_through_point(parallel_through_point(skc1,skc1),skc1), x1 -> skc1, x2 -> skc1, x3 -> skc1, x4 -> parallel_through_point(skc2,skc1)}
% 1.88/0.91 === Backtracking. Learning clause 75:3:5:[74.2,52.1]:TopTopTopTopTop: distinct_lines(parallel_through_point(parallel_through_point(x0,x1),x2),x3) -> unorthogonal_lines(x4,x3),unorthogonal_lines(x4,x0)
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 104
% 1.88/0.91 === Restarting.
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 167
% 1.88/0.91 === Backtracking. Learning clause 76:4:4:[14.2,5.1]:TopTopTopTop: convergent_lines(x0,x1) -> convergent_lines(x0,x2),distinct_lines(x1,x3),distinct_lines(x2,x3)
% 1.88/0.91 === Conflict found: 67:3:2:[51.1,64.3]:TopTop: convergent_lines(parallel_through_point(skc2,skc1),x0) -> convergent_lines(parallel_through_point(orthogonal_through_point(skc2,skc1),x1),skc2),distinct_lines(x0,orthogonal_through_point(skc2,skc1)) {x0 -> orthogonal_through_point(skc2,skc1), x1 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 77:2:1:[67.3,2.1]:Top: convergent_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)) -> convergent_lines(parallel_through_point(orthogonal_through_point(skc2,skc1),x0),skc2)
% 1.88/0.91 === Conflict found: 51:2:3:[6.3,16.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1) {x0 -> skc1, x1 -> skc2, x2 -> skc1}
% 1.88/0.91 === Backtracking. Learning clause 78:5:3:[51.2,14.1,29.1,71.1]:TopTopTop: ren4(x0,orthogonal_through_point(skc2,skc1)),distinct_lines(x1,parallel_through_point(skc2,skc1)) -> distinct_lines(skc2,x2),convergent_lines(x0,x2),distinct_lines(x1,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Backtracking. Learning clause 79:4:2:[6.2,3.1,20.2,72.2]:TopTop: distinct_lines(x0,parallel_through_point(skc2,skc1)) -> convergent_lines(x1,parallel_through_point(skc2,skc1)),ren2(orthogonal_through_point(skc2,skc1),x1),distinct_lines(x0,orthogonal_through_point(skc2,skc1))
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 231
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 295
% 1.88/0.91 === Backtracking. Learning clause 80:6:4:[11.4,7.2]:TopTopTopTop: distinct_points(x0,x1),distinct_lines(x2,line_connecting(x0,x3)),distinct_points(x0,x3) -> apart_point_and_line(x0,x2),apart_point_and_line(x1,x2),apart_point_and_line(x1,line_connecting(x0,x3))
% 1.88/0.91 === Backtracking. Learning clause 81:2:2:[4.2,1.1,40.1]:TopTop: -> distinct_points(x0,x1),equal_points(x1,x0)
% 1.88/0.91 === Backtracking. Learning clause 82:1:1:[28.1,76.1,25.1,2.1,74.1,25.1,5.1,2.1,3.1,15.1,77.1]:Top: -> convergent_lines(parallel_through_point(orthogonal_through_point(skc2,skc1),x0),skc2)
% 1.88/0.91 === Clause set with instances from active satisfied. Growing active. New size: 359
% 1.88/0.91 === Conflict found: 79:4:2:[6.2,3.1,20.2,72.2]:TopTop: distinct_lines(x0,parallel_through_point(skc2,skc1)) -> convergent_lines(x1,parallel_through_point(skc2,skc1)),ren2(orthogonal_through_point(skc2,skc1),x1),distinct_lines(x0,orthogonal_through_point(skc2,skc1)) {x0 -> parallel_through_point(parallel_through_point(skc1,skc1),skc1), x1 -> skc2}
% 1.88/0.91 === Backtracking. Learning clause 83:6:5:[79.3,23.1,5.1,50.1,6.1]:TopTopTopTopTop: distinct_lines(x0,parallel_through_point(skc2,skc1)) -> convergent_lines(x1,parallel_through_point(skc2,skc1)),unorthogonal_lines(orthogonal_through_point(skc2,skc1),x1),distinct_lines(x0,parallel_through_point(x2,x3)),convergent_lines(orthogonal_through_point(skc2,skc1),x4),convergent_lines(x2,x4)
% 1.88/0.91 === Conflict found: 79:4:2:[6.2,3.1,20.2,72.2]:TopTop: distinct_lines(x0,parallel_through_point(skc2,skc1)) -> convergent_lines(x1,parallel_through_point(skc2,skc1)),ren2(orthogonal_through_point(skc2,skc1),x1),distinct_lines(x0,orthogonal_through_point(skc2,skc1)) {x0 -> orthogonal_through_point(skc2,skc1), x1 -> skc2}
% 1.88/0.91
% 1.88/0.91 SZS status Unsatisfiable
% 1.88/0.91
% 1.88/0.91 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.88/0.91
% 1.88/0.91 SPASS-SCL-FOL Statistics:
% 1.88/0.91 Number of learned clauses: 32
% 1.88/0.91 Number of propagations: 1667
% 1.88/0.91 Number of decisions: 393
% 1.88/0.91 Number of resolutions: 78
% 1.88/0.91 Number of condensations: 0
% 1.88/0.91 Number of sub resolutions: 2
% 1.88/0.91 Number of input literals (deduplicated): 32
% 1.88/0.91 Number of grows: 14
% 1.88/0.91 Number of considered ground atoms: 359
% 1.88/0.91
% 1.88/0.91 Needed: 0:00:00.37
% 1.88/0.91
%------------------------------------------------------------------------------