%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO210+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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:05 PM UTC 2026
% Result : Theorem 0.40s 0.61s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO210+1 : TPTP v9.2.1. Released v3.3.0.
% 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n004.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:55:48 EDT 2026
% 0.17/0.35 % CPUTime :
% 0.17/0.35 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 Execution resolution_1 ended with status: unsatisfiable
% 0.40/0.61 Used heuristic: resolution_1
% 0.40/0.61
% 0.40/0.61 Input Clauses:
% 0.40/0.61
% 0.40/0.61 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line unorthogonal_lines ren1 ren2
% 0.40/0.61 Fol Constants: skc1 skc2 skc3
% 0.40/0.61 Fol Functions: line_connecting intersection_point parallel_through_point orthogonal_through_point
% 0.40/0.61 Problem Properties:
% 0.40/0.61 This is a full first-order problem without equality.
% 0.40/0.61
% 0.40/0.61 After reduction: Problem Properties:
% 0.40/0.61 This is a full first-order problem without equality.
% 0.40/0.61
% 0.40/0.61
% 0.40/0.61 Reduced Input Clauses:
% 0.40/0.61
% 0.40/0.61 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)
% 0.40/0.61
% 0.40/0.61 === Starting SPASS-SCL-FOL A Little Less Naive, considering 34 atoms initially, heuristics mode: resolution_1 ===
% 0.40/0.61
% 0.40/0.61 === Backtracking. Learning clause 30:3:1:[17.3,27.1]:Top: distinct_lines(x0,skc2) -> apart_point_and_line(skc1,x0),convergent_lines(x0,skc2)
% 0.40/0.61 === Backtracking. Learning clause 31:1:0:[18.2,28.1]:: -> convergent_lines(skc2,skc3)
% 0.40/0.61 === Backtracking. Learning clause 32:2:3:[6.3,15.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 0.40/0.61 === Backtracking. Learning clause 33:1:2:[18.2,24.1]:TopTop: -> convergent_lines(orthogonal_through_point(x0,x1),x0)
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 45
% 0.40/0.61 === Restarting.
% 0.40/0.61 === Conflict found: 32:2:3:[6.3,15.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1) {x0 -> orthogonal_through_point(parallel_through_point(skc1,skc1),skc1), x1 -> skc1, x2 -> skc1}
% 0.40/0.61 === Backtracking. Learning clause 34:1:3:[32.1,33.1]:TopTopTop: -> convergent_lines(orthogonal_through_point(parallel_through_point(x0,x1),x2),x0)
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 47
% 0.40/0.61 === Restarting.
% 0.40/0.61 === Backtracking. Learning clause 35:3:3:[17.2,16.1]:TopTopTop: distinct_lines(parallel_through_point(x0,x1),x2) -> apart_point_and_line(x1,x2),convergent_lines(parallel_through_point(x0,x1),x2)
% 0.40/0.61 === Backtracking. Learning clause 36: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)
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 53
% 0.40/0.61 === Restarting.
% 0.40/0.61 === Backtracking. Learning clause 37:4:2:[26.4,28.1]:TopTop: distinct_lines(skc2,x0) -> apart_point_and_line(x1,skc2),apart_point_and_line(x1,x0),unorthogonal_lines(x0,skc3)
% 0.40/0.61 === Conflict found: 35:3:3:[17.2,16.1]:TopTopTop: distinct_lines(parallel_through_point(x0,x1),x2) -> apart_point_and_line(x1,x2),convergent_lines(parallel_through_point(x0,x1),x2) {x0 -> skc1, x1 -> skc1, x2 -> skc1}
% 0.40/0.61 === Backtracking. Learning clause 38:3:3:[35.3,15.1,5.3]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> apart_point_and_line(x2,x1),distinct_lines(x0,x1)
% 0.40/0.61 === Backtracking. Learning clause 39:2:4:[14.1,34.1]:TopTopTopTop: -> distinct_lines(x0,x1),convergent_lines(orthogonal_through_point(parallel_through_point(x0,x2),x3),x1)
% 0.40/0.61 === Clause set with instances from active satisfied. Growing active. New size: 62
% 0.40/0.61 === Restarting.
% 0.40/0.61 === Conflict found: 35:3:3:[17.2,16.1]:TopTopTop: distinct_lines(parallel_through_point(x0,x1),x2) -> apart_point_and_line(x1,x2),convergent_lines(parallel_through_point(x0,x1),x2) {x0 -> skc1, x1 -> skc1, x2 -> skc1}
% 0.40/0.61 === Backtracking. Learning clause 40:2:2:[35.3,15.1]:TopTop: distinct_lines(parallel_through_point(x0,x1),x0) -> apart_point_and_line(x1,x0)
% 0.40/0.61 === Conflict found: 37:4:2:[26.4,28.1]:TopTop: distinct_lines(skc2,x0) -> apart_point_and_line(x1,skc2),apart_point_and_line(x1,x0),unorthogonal_lines(x0,skc3) {x0 -> orthogonal_through_point(skc3,skc1), x1 -> skc1}
% 0.40/0.61
% 0.40/0.61 SZS status Unsatisfiable
% 0.40/0.61
% 0.40/0.61 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61
% 0.40/0.61 SPASS-SCL-FOL Statistics:
% 0.40/0.61 Number of learned clauses: 11
% 0.40/0.61 Number of propagations: 289
% 0.40/0.61 Number of decisions: 185
% 0.40/0.61 Number of resolutions: 16
% 0.40/0.61 Number of condensations: 0
% 0.40/0.61 Number of sub resolutions: 0
% 0.40/0.61 Number of input literals (deduplicated): 21
% 0.40/0.61 Number of grows: 4
% 0.40/0.61 Number of considered ground atoms: 62
% 0.40/0.61
% 0.40/0.61 Needed: 0:00:00.03
% 0.40/0.61
%------------------------------------------------------------------------------