%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO181+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 : n020.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:21:58 PM UTC 2026
% Result : Theorem 0.45s 0.71s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.16 % Problem : GEO181+3 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.17 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.39 % Computer : n020.cluster.edu
% 0.19/0.39 % Model : x86_64 x86_64
% 0.19/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.39 % Memory : 8042.1875MB
% 0.19/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.39 % CPULimit : 300
% 0.19/0.39 % WCLimit : 300
% 0.19/0.39 % DateTime : Thu May 7 11:55:51 EDT 2026
% 0.19/0.39 % CPUTime :
% 0.19/0.39 SPASS-SCL-FOL version:
% 0.29/0.49 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.45/0.71 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.71 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.71 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.71 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.71 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.71 Execution resolution_1 ended with status: unsatisfiable
% 0.45/0.71 Used heuristic: resolution_1
% 0.45/0.71
% 0.45/0.71 Input Clauses:
% 0.45/0.71
% 0.45/0.71 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
% 0.45/0.71 Fol Constants: skc1 skc2 skc3
% 0.45/0.71 Fol Functions: line_connecting intersection_point parallel_through_point orthogonal_through_point
% 0.45/0.71 Problem Properties:
% 0.45/0.71 This is a full first-order problem without equality.
% 0.45/0.71
% 0.45/0.71 After reduction: Problem Properties:
% 0.45/0.71 This is a full first-order problem without equality.
% 0.45/0.71
% 0.45/0.71
% 0.45/0.71 Reduced Input Clauses:
% 0.45/0.71
% 0.45/0.71 Most General Atoms: distinct_points(x1,x2) convergent_lines(x1,x2) distinct_lines(x2,x3) 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) orthogonal_lines(x0,x1)
% 0.45/0.71
% 0.45/0.71 === Starting SPASS-SCL-FOL A Little Less Naive, considering 42 atoms initially, heuristics mode: resolution_1 ===
% 0.45/0.71
% 0.45/0.71 === Backtracking. Learning clause 52:2:3:[6.3,16.1,15.2]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 0.45/0.71 === Backtracking. Learning clause 53:2:3:[6.3,16.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 0.45/0.71 === Backtracking. Learning clause 54:1:2:[15.2,16.1]:TopTop: distinct_lines(parallel_through_point(x0,x1),x0) ->
% 0.45/0.71 === Backtracking. Learning clause 55:5:2:[11.5,51.1]:TopTop: distinct_points(x0,skc2),distinct_lines(line_connecting(skc1,skc3),x1) -> apart_point_and_line(x0,line_connecting(skc1,skc3)),apart_point_and_line(x0,x1),apart_point_and_line(skc2,x1)
% 0.45/0.71 === Backtracking. Learning clause 57:1:0:[49.0,56.0,12.1,50.1,7.2]:: -> distinct_points(skc3,skc1)
% 0.45/0.71 === Backtracking. Learning clause 58:2:1:[13.1,50.1]:Top: -> distinct_lines(line_connecting(skc1,skc2),x0),apart_point_and_line(skc3,x0)
% 0.45/0.71 === Clause set with instances from active satisfied. Growing active. New size: 58
% 0.45/0.71 === Restarting.
% 0.45/0.71 === Backtracking. Learning clause 59:4:4:[12.1,12.3]:TopTopTopTop: apart_point_and_line(x0,x1) -> distinct_points(x2,x3),apart_point_and_line(x3,x1),distinct_points(x0,x2)
% 0.45/0.71 === Backtracking. Learning clause 60:2:3:[13.3,17.1,52.1]:TopTopTop: apart_point_and_line(x0,x1) -> convergent_lines(x1,x2)
% 0.45/0.71 === Conflict found: 59:4:4:[12.1,12.3]:TopTopTopTop: apart_point_and_line(x0,x1) -> distinct_points(x2,x3),apart_point_and_line(x3,x1),distinct_points(x0,x2) {x0 -> skc1, x1 -> line_connecting(skc1,skc3), x2 -> skc3, x3 -> skc2}
% 0.45/0.71 === Backtracking. Learning clause 62:6:4:[59.0,61.4,59.3,51.1,55.3,5.3]:TopTopTopTop: distinct_points(x0,skc2),distinct_lines(x1,line_connecting(skc1,skc3)) -> distinct_points(x2,skc2),distinct_points(x0,x2),apart_point_and_line(skc2,x3),distinct_lines(x1,x3)
% 0.45/0.71 === Conflict found: 59:4:4:[12.1,12.3]:TopTopTopTop: apart_point_and_line(x0,x1) -> distinct_points(x2,x3),apart_point_and_line(x3,x1),distinct_points(x0,x2) {x0 -> skc1, x1 -> line_connecting(skc1,skc3), x2 -> skc3, x3 -> skc2}
% 0.45/0.71 === Backtracking. Learning clause 64:5:3:[59.0,63.4,59.3,51.1,55.3]:TopTopTop: distinct_points(x0,skc2),distinct_lines(line_connecting(skc1,skc3),x1) -> distinct_points(x2,skc2),distinct_points(x0,x2),apart_point_and_line(skc2,x1)
% 0.45/0.71 === Backtracking. Learning clause 65:1:2:[28.2,25.1]:TopTop: -> convergent_lines(orthogonal_through_point(x0,x1),x0)
% 0.45/0.71 === Clause set with instances from active satisfied. Growing active. New size: 69
% 0.45/0.71 === Restarting.
% 0.45/0.71 === Conflict found: 55:5:2:[11.5,51.1]:TopTop: distinct_points(x0,skc2),distinct_lines(line_connecting(skc1,skc3),x1) -> apart_point_and_line(x0,line_connecting(skc1,skc3)),apart_point_and_line(x0,x1),apart_point_and_line(skc2,x1) {x0 -> skc1, x1 -> skc1}
% 0.45/0.71 === Backtracking. Learning clause 67:5:2:[49.0,66.0,55.3,7.2,5.3]:TopTop: distinct_points(skc1,skc3),distinct_lines(x0,line_connecting(skc1,skc3)) -> apart_point_and_line(skc1,x1),apart_point_and_line(skc2,x1),distinct_lines(x0,x1)
% 0.45/0.71 === Conflict found: 55:5:2:[11.5,51.1]:TopTop: distinct_points(x0,skc2),distinct_lines(line_connecting(skc1,skc3),x1) -> apart_point_and_line(x0,line_connecting(skc1,skc3)),apart_point_and_line(x0,x1),apart_point_and_line(skc2,x1) {x0 -> skc1, x1 -> skc1}
% 0.45/0.71 === Backtracking. Learning clause 69:4:1:[49.0,68.0,55.3,7.2]:Top: distinct_lines(line_connecting(skc1,skc3),x0),distinct_points(skc1,skc3) -> apart_point_and_line(skc1,x0),apart_point_and_line(skc2,x0)
% 0.45/0.71 === Backtracking. Learning clause 70:5:3:[11.4,8.2,7.2]:TopTopTop: distinct_points(x0,x1),distinct_lines(x2,line_connecting(x1,x0)),distinct_points(x1,x0) -> apart_point_and_line(x0,x2),apart_point_and_line(x1,x2)
% 0.45/0.71
% 0.45/0.71 SZS status Unsatisfiable
% 0.45/0.71
% 0.45/0.71 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.71
% 0.45/0.71 SPASS-SCL-FOL Statistics:
% 0.45/0.71 Number of learned clauses: 14
% 0.45/0.71 Number of propagations: 437
% 0.45/0.71 Number of decisions: 140
% 0.45/0.71 Number of resolutions: 32
% 0.45/0.71 Number of condensations: 0
% 0.45/0.71 Number of sub resolutions: 5
% 0.45/0.71 Number of input literals (deduplicated): 34
% 0.45/0.71 Number of grows: 2
% 0.45/0.71 Number of considered ground atoms: 69
% 0.45/0.71
% 0.45/0.71 Needed: 0:00:00.05
% 0.45/0.71
%------------------------------------------------------------------------------