%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO191+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 : n013.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:00 PM UTC 2026
% Result : Theorem 0.30s 0.59s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO191+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.16/0.34 % Computer : n013.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 11:56:12 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.23/0.45 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.30/0.59 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.30/0.59 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.30/0.59 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.30/0.59 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.30/0.59 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.30/0.59 Execution resolution_1 ended with status: unsatisfiable
% 0.30/0.59 Used heuristic: resolution_1
% 0.30/0.59
% 0.30/0.59 Input Clauses:
% 0.30/0.59
% 0.30/0.59 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.30/0.59 Fol Constants: skc1 skc2 skc3 skc4
% 0.30/0.59 Fol Functions: line_connecting intersection_point parallel_through_point orthogonal_through_point
% 0.30/0.59 Problem Properties:
% 0.30/0.59 This is a full first-order problem without equality.
% 0.30/0.59
% 0.30/0.59 After reduction: Problem Properties:
% 0.30/0.59 This is a full first-order problem without equality.
% 0.30/0.59
% 0.30/0.59
% 0.30/0.59 Reduced Input Clauses:
% 0.30/0.59
% 0.30/0.59 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.30/0.59
% 0.30/0.59 === Starting SPASS-SCL-FOL A Little Less Naive, considering 47 atoms initially, heuristics mode: resolution_1 ===
% 0.30/0.59
% 0.30/0.59 === Backtracking. Learning clause 54:2:1:[14.1,50.1]:Top: -> distinct_lines(skc4,x0),convergent_lines(skc3,x0)
% 0.30/0.59 === Backtracking. Learning clause 55:2:3:[6.3,16.1,15.2]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 0.30/0.59 === Backtracking. Learning clause 56:2:3:[6.3,16.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 0.30/0.59 === Backtracking. Learning clause 57:1:2:[15.2,16.1]:TopTop: distinct_lines(parallel_through_point(x0,x1),x0) ->
% 0.30/0.59 === Backtracking. Learning clause 58:3:1:[51.2,12.1]:Top: -> apart_point_and_line(intersection_point(skc1,skc2),skc3),distinct_points(intersection_point(skc1,skc2),x0),apart_point_and_line(x0,skc4)
% 0.30/0.59 === Backtracking. Learning clause 59:5:2:[11.4,53.1,52.1,4.3]:TopTop: distinct_lines(skc1,skc2),distinct_points(x0,intersection_point(skc3,skc4)) -> apart_point_and_line(x1,skc1),apart_point_and_line(x1,skc2),distinct_points(x0,x1)
% 0.30/0.59 === Backtracking. Learning clause 60:4:1:[11.4,53.1,52.1]:Top: distinct_points(intersection_point(skc3,skc4),x0),distinct_lines(skc1,skc2) -> apart_point_and_line(x0,skc1),apart_point_and_line(x0,skc2)
% 0.30/0.59 === Clause set with instances from active satisfied. Growing active. New size: 62
% 0.30/0.59 === Restarting.
% 0.30/0.59 === Backtracking. Learning clause 61:1:0:[14.1,49.1,3.1]:: -> distinct_lines(skc2,skc1)
% 0.30/0.59 === Conflict found: 54:2:1:[14.1,50.1]:Top: -> distinct_lines(skc4,x0),convergent_lines(skc3,x0) {x0 -> skc3}
% 0.30/0.59 === Backtracking. Learning clause 62:1:0:[54.2,3.1]:: -> distinct_lines(skc4,skc3)
% 0.30/0.59 === Backtracking. Learning clause 63:2:3:[5.3,57.1]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> distinct_lines(x0,x1)
% 0.30/0.59 === Backtracking. Learning clause 64:3:3:[12.3,10.2]:TopTopTop: apart_point_and_line(x0,x1),convergent_lines(x2,x1) -> distinct_points(x0,intersection_point(x2,x1))
% 0.30/0.59 === Backtracking. Learning clause 65:3:1:[51.2,13.1]:Top: -> apart_point_and_line(intersection_point(skc1,skc2),skc3),distinct_lines(skc4,x0),apart_point_and_line(intersection_point(skc1,skc2),x0)
% 0.30/0.59 === Backtracking. Learning clause 66:2:1:[12.3,53.1]:Top: apart_point_and_line(x0,skc2) -> distinct_points(x0,intersection_point(skc3,skc4))
% 0.30/0.59 === Clause set with instances from active satisfied. Growing active. New size: 74
% 0.30/0.59 === Restarting.
% 0.30/0.59 === Backtracking. Learning clause 67:2:3:[13.3,17.1,63.1]:TopTopTop: apart_point_and_line(x0,x1) -> distinct_lines(x1,x2)
% 0.30/0.59 === Backtracking. Learning clause 68:3:3:[12.3,9.2]:TopTopTop: apart_point_and_line(x0,x1),convergent_lines(x1,x2) -> distinct_points(x0,intersection_point(x1,x2))
% 0.30/0.59 === Backtracking. Learning clause 71:3:1:[61.0,69.0,50.0,70.2,11.1,68.3,53.1,52.1]:Top: apart_point_and_line(x0,skc3) -> apart_point_and_line(x0,skc2),apart_point_and_line(x0,skc1)
% 0.30/0.59
% 0.30/0.59 SZS status Unsatisfiable
% 0.30/0.59
% 0.30/0.59 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.30/0.59
% 0.30/0.59 SPASS-SCL-FOL Statistics:
% 0.30/0.59 Number of learned clauses: 16
% 0.30/0.59 Number of propagations: 464
% 0.30/0.59 Number of decisions: 175
% 0.30/0.59 Number of resolutions: 35
% 0.30/0.59 Number of condensations: 0
% 0.30/0.59 Number of sub resolutions: 2
% 0.30/0.59 Number of input literals (deduplicated): 37
% 0.30/0.59 Number of grows: 2
% 0.30/0.59 Number of considered ground atoms: 74
% 0.30/0.59
% 0.30/0.59 Needed: 0:00:00.04
% 0.30/0.59
%------------------------------------------------------------------------------