%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO223+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 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 : 300s
% DateTime : Thu May 7 07:22:08 PM UTC 2026
% Result : Theorem 3.46s 1.33s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO223+1 : TPTP v9.2.1. Released v3.3.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.34 % Computer : n007.cluster.edu
% 0.19/0.34 % Model : x86_64 x86_64
% 0.19/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.34 % Memory : 8042.1875MB
% 0.19/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.34 % CPULimit : 300
% 0.19/0.34 % WCLimit : 300
% 0.19/0.34 % DateTime : Thu May 7 11:55:54 EDT 2026
% 0.19/0.34 % CPUTime :
% 0.19/0.34 SPASS-SCL-FOL version:
% 0.21/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 3.46/1.33 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/1.33 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/1.33 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/1.33 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/1.33 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/1.33 Execution resolution_3 ended with status: unsatisfiable
% 3.46/1.33 Used heuristic: resolution_3
% 3.46/1.33
% 3.46/1.33 Input Clauses:
% 3.46/1.33
% 3.46/1.33 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line unorthogonal_lines ren1 ren2
% 3.46/1.33 Fol Constants: skc1 skc2
% 3.46/1.33 Fol Functions: line_connecting intersection_point parallel_through_point orthogonal_through_point
% 3.46/1.33 Problem Properties:
% 3.46/1.33 This is a full first-order problem without equality.
% 3.46/1.33
% 3.46/1.33 After reduction: Problem Properties:
% 3.46/1.33 This is a full first-order problem without equality.
% 3.46/1.33
% 3.46/1.33
% 3.46/1.33 Reduced Input Clauses:
% 3.46/1.33
% 3.46/1.33 Most General Atoms: distinct_points(x1,x2) convergent_lines(x1,x2) distinct_lines(x2,x3) apart_point_and_line(x2,x0) ren1(x0,x2) ren2(x1,x2) unorthogonal_lines(x1,x3)
% 3.46/1.33
% 3.46/1.33 === Starting SPASS-SCL-FOL A Little Less Naive, considering 33 atoms initially, heuristics mode: resolution_3 ===
% 3.46/1.33
% 3.46/1.33 === Backtracking. Learning clause 28:2:3:[6.3,15.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 3.46/1.33 === Backtracking. Learning clause 29:3:3:[17.2,16.1,15.1,5.3]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> apart_point_and_line(x2,x1),distinct_lines(x0,x1)
% 3.46/1.33 === Backtracking. Learning clause 30:2:2:[17.2,16.1,15.1]:TopTop: distinct_lines(parallel_through_point(x0,x1),x0) -> apart_point_and_line(x1,x0)
% 3.46/1.33 === Backtracking. Learning clause 31:3:3:[17.2,25.1]:TopTopTop: distinct_lines(orthogonal_through_point(x0,x1),x2) -> apart_point_and_line(x1,x2),convergent_lines(orthogonal_through_point(x0,x1),x2)
% 3.46/1.33 === Backtracking. Learning clause 32:3:3:[17.3,25.1]:TopTopTop: distinct_lines(x0,orthogonal_through_point(x1,x2)) -> apart_point_and_line(x2,x0),convergent_lines(x0,orthogonal_through_point(x1,x2))
% 3.46/1.33 === Backtracking. Learning clause 33:4:2:[26.1,27.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)
% 3.46/1.33 === Backtracking. Learning clause 34:2:1:[5.1,27.1]:Top: -> distinct_lines(parallel_through_point(skc2,skc1),x0),distinct_lines(orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1),x0)
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 51
% 3.46/1.33 === Restarting.
% 3.46/1.33 === Backtracking. Learning clause 35:3:1:[26.5,24.1,27.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))
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 54
% 3.46/1.33 === Restarting.
% 3.46/1.33 === Conflict found: 35:3:1:[26.5,24.1,27.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}
% 3.46/1.33 === Backtracking. Learning clause 37:3:1:[16.0,36.1,35.3,23.2,25.1]:Top: convergent_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)) -> ren1(parallel_through_point(skc2,skc1),x0),ren2(orthogonal_through_point(skc2,skc1),x0)
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 60
% 3.46/1.33 === Restarting.
% 3.46/1.33 === Conflict found: 37:3:1:[16.0,36.1,35.3,23.2,25.1]:Top: convergent_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)) -> ren1(parallel_through_point(skc2,skc1),x0),ren2(orthogonal_through_point(skc2,skc1),x0) {x0 -> skc1}
% 3.46/1.33 === Backtracking. Learning clause 38:4:2:[37.1,14.3]:TopTop: convergent_lines(parallel_through_point(skc2,skc1),x0) -> ren1(parallel_through_point(skc2,skc1),x1),ren2(orthogonal_through_point(skc2,skc1),x1),distinct_lines(x0,orthogonal_through_point(skc2,skc1))
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 65
% 3.46/1.33 === Restarting.
% 3.46/1.33 === Conflict found: 38:4:2:[37.1,14.3]:TopTop: convergent_lines(parallel_through_point(skc2,skc1),x0) -> ren1(parallel_through_point(skc2,skc1),x1),ren2(orthogonal_through_point(skc2,skc1),x1),distinct_lines(x0,orthogonal_through_point(skc2,skc1)) {x0 -> skc1, x1 -> skc1}
% 3.46/1.33 === Backtracking. Learning clause 39:4:2:[38.3,21.1,20.1]:TopTop: convergent_lines(parallel_through_point(skc2,skc1),x0) -> distinct_lines(x0,orthogonal_through_point(skc2,skc1)),convergent_lines(orthogonal_through_point(skc2,skc1),x1),unorthogonal_lines(parallel_through_point(skc2,skc1),x1)
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 129
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 193
% 3.46/1.33 === Backtracking. Learning clause 41:3:3:[19.1,40.0,23.3,19.1,20.2]:TopTopTop: ren1(x0,x1) -> ren2(x1,x2),convergent_lines(x0,x2)
% 3.46/1.33 === Conflict found: 33:4:2:[26.1,27.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) {x0 -> skc1, x1 -> orthogonal_through_point(skc2,skc1)}
% 3.46/1.33 === Backtracking. Learning clause 43:2:1:[25.0,42.0,33.1,16.1]:Top: -> unorthogonal_lines(parallel_through_point(skc2,skc1),x0),unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1),x0)
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 257
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 321
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 385
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 449
% 3.46/1.33 === Backtracking. Learning clause 44:4:4:[14.1,18.1,32.1]:TopTopTopTop: -> convergent_lines(x0,orthogonal_through_point(x1,x2)),unorthogonal_lines(x0,x3),apart_point_and_line(x2,x3),convergent_lines(x3,orthogonal_through_point(x1,x2))
% 3.46/1.33 === Backtracking. Learning clause 45:3:3:[23.2,22.2,21.2]:TopTopTop: ren2(x0,x1) -> ren1(x0,x2),ren2(x1,x2)
% 3.46/1.33 === Conflict found: 35:3:1:[26.5,24.1,27.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}
% 3.46/1.33 === Backtracking. Learning clause 46:1:0:[35.2,25.1,16.1]:: -> unorthogonal_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1))
% 3.46/1.33 === Conflict found: 30:2:2:[17.2,16.1,15.1]:TopTop: distinct_lines(parallel_through_point(x0,x1),x0) -> apart_point_and_line(x1,x0) {x0 -> orthogonal_through_point(skc2,skc2), x1 -> skc2}
% 3.46/1.33 === Backtracking. Learning clause 47:1:2:[30.2,25.1]:TopTop: distinct_lines(parallel_through_point(orthogonal_through_point(x0,x1),x1),orthogonal_through_point(x0,x1)) ->
% 3.46/1.33 === Conflict found: 29:3:3:[17.2,16.1,15.1,5.3]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> apart_point_and_line(x2,x1),distinct_lines(x0,x1) {x0 -> skc1, x1 -> skc1, x2 -> intersection_point(skc2,skc1)}
% 3.46/1.33 === Backtracking. Learning clause 48:3:3:[29.2,10.2]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,intersection_point(x2,x1))),convergent_lines(x2,x1) -> distinct_lines(x0,x1)
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 513
% 3.46/1.33 === Clause set with instances from active satisfied. Growing active. New size: 577
% 3.46/1.33 === Conflict found: 45:3:3:[23.2,22.2,21.2]:TopTopTop: ren2(x0,x1) -> ren1(x0,x2),ren2(x1,x2) {x0 -> orthogonal_through_point(skc2,skc1), x1 -> skc2, x2 -> skc2}
% 3.46/1.33 === Backtracking. Learning clause 49:1:0:[45.1,38.3,20.1,24.1,19.1,2.1,21.1,3.1,15.1]:: convergent_lines(parallel_through_point(skc2,skc1),orthogonal_through_point(skc2,skc1)) ->
% 3.46/1.33
% 3.46/1.33 SZS status Unsatisfiable
% 3.46/1.33
% 3.46/1.33 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/1.33
% 3.46/1.33 SPASS-SCL-FOL Statistics:
% 3.46/1.33 Number of learned clauses: 19
% 3.46/1.33 Number of propagations: 1903
% 3.46/1.33 Number of decisions: 301
% 3.46/1.33 Number of resolutions: 46
% 3.46/1.33 Number of condensations: 0
% 3.46/1.33 Number of sub resolutions: 3
% 3.46/1.33 Number of input literals (deduplicated): 19
% 3.46/1.33 Number of grows: 12
% 3.46/1.33 Number of considered ground atoms: 577
% 3.46/1.33
% 3.46/1.33 Needed: 0:00:00.77
% 3.46/1.33
%------------------------------------------------------------------------------