%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO196+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 : 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:02 PM UTC 2026
% Result : Theorem 0.45s 0.60s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO196+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 7 11:55:24 EDT 2026
% 0.15/0.35 % CPUTime :
% 0.15/0.35 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.45/0.60 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.60 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.60 Execution resolution_3 ended with status: unsatisfiable
% 0.45/0.60 Used heuristic: resolution_3
% 0.45/0.60
% 0.45/0.60 Input Clauses:
% 0.45/0.60
% 0.45/0.60 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.60 Fol Constants: skc1 skc2 skc3 skc4
% 0.45/0.60 Fol Functions: line_connecting intersection_point parallel_through_point orthogonal_through_point
% 0.45/0.60 Problem Properties:
% 0.45/0.60 This is a full first-order problem without equality.
% 0.45/0.60
% 0.45/0.60 After reduction: Problem Properties:
% 0.45/0.60 This is a full first-order problem without equality.
% 0.45/0.60
% 0.45/0.60
% 0.45/0.60 Reduced Input Clauses:
% 0.45/0.60
% 0.45/0.60 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.60
% 0.45/0.60 === Starting SPASS-SCL-FOL A Little Less Naive, considering 42 atoms initially, heuristics mode: resolution_3 ===
% 0.45/0.60
% 0.45/0.60 === Backtracking. Learning clause 54:1:0:[14.1,49.1,3.1]:: -> distinct_lines(skc2,skc1)
% 0.45/0.60 === Backtracking. Learning clause 55:2:1:[14.1,50.1]:Top: -> distinct_lines(skc4,x0),convergent_lines(skc3,x0)
% 0.45/0.60 === Backtracking. Learning clause 56:2:3:[6.3,16.1,15.2]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 0.45/0.60 === Backtracking. Learning clause 57:2:3:[6.3,16.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 0.45/0.60 === Backtracking. Learning clause 58:1:2:[15.2,16.1]:TopTop: distinct_lines(parallel_through_point(x0,x1),x0) ->
% 0.45/0.60 === Backtracking. Learning clause 59:1:0:[45.1,51.1]:: apart_point_and_line(intersection_point(skc1,skc2),skc3) ->
% 0.45/0.60 === Backtracking. Learning clause 60:1:0:[45.1,52.1]:: apart_point_and_line(intersection_point(skc1,skc2),skc4) ->
% 0.45/0.60 === Backtracking. Learning clause 61:2:0:[53.2,46.2]:: incident_point_and_line(intersection_point(skc3,skc4),skc1) -> apart_point_and_line(intersection_point(skc3,skc4),skc2)
% 0.45/0.60 === Clause set with instances from active satisfied. Growing active. New size: 57
% 0.45/0.60 === Restarting.
% 0.45/0.60 === Conflict found: 55:2:1:[14.1,50.1]:Top: -> distinct_lines(skc4,x0),convergent_lines(skc3,x0) {x0 -> skc3}
% 0.45/0.60 === Backtracking. Learning clause 62:1:0:[55.2,3.1]:: -> distinct_lines(skc4,skc3)
% 0.45/0.60 === Backtracking. Learning clause 64:5:2:[49.0,63.1,11.4,59.1,9.2,4.3]:TopTop: distinct_lines(skc1,skc3),distinct_points(x0,intersection_point(skc1,skc2)) -> apart_point_and_line(x1,skc1),apart_point_and_line(x1,skc3),distinct_points(x0,x1)
% 0.45/0.60 === Backtracking. Learning clause 66:4:1:[49.0,65.2,11.4,59.1,9.2]:Top: distinct_points(intersection_point(skc1,skc2),x0),distinct_lines(skc1,skc3) -> apart_point_and_line(x0,skc1),apart_point_and_line(x0,skc3)
% 0.45/0.60 === Conflict found: 61:2:0:[53.2,46.2]:: incident_point_and_line(intersection_point(skc3,skc4),skc1) -> apart_point_and_line(intersection_point(skc3,skc4),skc2) {}
% 0.45/0.60 === Backtracking. Learning clause 67:2:0:[61.1,46.2]:: -> apart_point_and_line(intersection_point(skc3,skc4),skc2),apart_point_and_line(intersection_point(skc3,skc4),skc1)
% 0.45/0.60 === Clause set with instances from active satisfied. Growing active. New size: 66
% 0.45/0.60 === Restarting.
% 0.45/0.60 === Conflict found: 67:2:0:[61.1,46.2]:: -> apart_point_and_line(intersection_point(skc3,skc4),skc2),apart_point_and_line(intersection_point(skc3,skc4),skc1) {}
% 0.45/0.60 === Backtracking. Learning clause 68:4:2:[67.1,12.1,12.1]:TopTop: -> distinct_points(intersection_point(skc3,skc4),x0),apart_point_and_line(x0,skc2),distinct_points(intersection_point(skc3,skc4),x1),apart_point_and_line(x1,skc1)
% 0.45/0.60 === Clause set with instances from active satisfied. Growing active. New size: 69
% 0.45/0.60 === Restarting.
% 0.45/0.60 === Clause set with instances from active satisfied. Growing active. New size: 132
% 0.45/0.60 === Backtracking. Learning clause 69:7:5:[11.4,10.2,4.2]:TopTopTopTopTop: distinct_lines(x0,x1),convergent_lines(x2,x1),distinct_points(intersection_point(x2,x1),x3) -> apart_point_and_line(intersection_point(x2,x1),x0),apart_point_and_line(x4,x0),apart_point_and_line(x4,x1),distinct_points(x3,x4)
% 0.45/0.60 === Backtracking. Learning clause 73:5:2:[62.0,70.0,50.0,71.1,12.0,72.4,11.4,9.2,60.1,4.2,10.2,59.1,68.1,64.2]:TopTop: distinct_lines(skc1,skc3) -> apart_point_and_line(x0,skc2),apart_point_and_line(x1,skc1),apart_point_and_line(x1,skc3),distinct_points(x0,x1)
% 0.45/0.60 === Backtracking. Learning clause 74:1:0:[12.3,10.2,73.2,11.1,9.2,9.2,60.1,10.2,59.1,50.1,49.1,62.1]:: distinct_lines(skc1,skc3) ->
% 0.45/0.60 === Backtracking. Learning clause 75:1:0:[10.1,50.1]:: apart_point_and_line(intersection_point(skc3,skc4),skc4) ->
% 0.45/0.60 === Backtracking. Learning clause 76:5:2:[11.2,62.1]:TopTop: distinct_points(x0,x1) -> apart_point_and_line(x0,skc4),apart_point_and_line(x0,skc3),apart_point_and_line(x1,skc4),apart_point_and_line(x1,skc3)
% 0.45/0.60 === Backtracking. Learning clause 78:3:1:[75.0,77.1,9.2,76.3,50.1]:Top: distinct_points(intersection_point(skc3,skc4),x0) -> apart_point_and_line(x0,skc4),apart_point_and_line(x0,skc3)
% 0.45/0.60 === Backtracking. Learning clause 79:2:0:[9.1,49.1,12.3,67.2]:: -> distinct_points(intersection_point(skc3,skc4),intersection_point(skc1,skc2)),apart_point_and_line(intersection_point(skc3,skc4),skc2)
% 0.45/0.60
% 0.45/0.60 SZS status Unsatisfiable
% 0.45/0.60
% 0.45/0.60 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.60
% 0.45/0.60 SPASS-SCL-FOL Statistics:
% 0.45/0.60 Number of learned clauses: 20
% 0.45/0.60 Number of propagations: 522
% 0.45/0.60 Number of decisions: 128
% 0.45/0.60 Number of resolutions: 52
% 0.45/0.60 Number of condensations: 0
% 0.45/0.60 Number of sub resolutions: 6
% 0.45/0.60 Number of input literals (deduplicated): 37
% 0.45/0.60 Number of grows: 4
% 0.45/0.60 Number of considered ground atoms: 132
% 0.45/0.60
% 0.45/0.60 Needed: 0:00:00.04
% 0.45/0.60
%------------------------------------------------------------------------------