%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO177+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 : n014.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:57 PM UTC 2026
% Result : Theorem 0.29s 0.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO177+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.33 % Computer : n014.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Thu May 7 11:56:07 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 SPASS-SCL-FOL version:
% 0.19/0.39 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.29/0.51 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.29/0.51 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.29/0.51 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.29/0.51 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.29/0.51 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.29/0.51 Execution resolution_1 ended with status: unsatisfiable
% 0.29/0.51 Used heuristic: resolution_1
% 0.29/0.51
% 0.29/0.51 Input Clauses:
% 0.29/0.51
% 0.29/0.51 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line
% 0.29/0.51 Fol Constants: skc1 skc2 skc3 skc4
% 0.29/0.51 Fol Functions: line_connecting intersection_point
% 0.29/0.51 Problem Properties:
% 0.29/0.51 This is a full first-order problem without equality.
% 0.29/0.51
% 0.29/0.51 After reduction: Problem Properties:
% 0.29/0.51 This is a full first-order problem without equality.
% 0.29/0.51
% 0.29/0.51
% 0.29/0.51 Reduced Input Clauses:
% 0.29/0.51
% 0.29/0.51 Most General Atoms: distinct_points(x1,x2) convergent_lines(x1,x2) distinct_lines(x2,x3) apart_point_and_line(x2,x1)
% 0.29/0.51
% 0.29/0.51 === Starting SPASS-SCL-FOL A Little Less Naive, considering 26 atoms initially, heuristics mode: resolution_1 ===
% 0.29/0.51
% 0.29/0.51 === Backtracking. Learning clause 20:4:2:[17.2,13.1,13.1]:TopTop: -> distinct_lines(line_connecting(skc3,skc4),x0),apart_point_and_line(skc2,x0),distinct_lines(line_connecting(skc3,skc4),x1),apart_point_and_line(skc1,x1)
% 0.29/0.51 === Backtracking. Learning clause 21:3:1:[17.2,12.1]:Top: -> apart_point_and_line(skc1,line_connecting(skc3,skc4)),distinct_points(skc2,x0),apart_point_and_line(x0,line_connecting(skc3,skc4))
% 0.29/0.51 === Backtracking. Learning clause 22:5:2:[11.5,18.1]:TopTop: distinct_points(x0,skc3),distinct_lines(line_connecting(skc1,skc2),x1) -> apart_point_and_line(x0,line_connecting(skc1,skc2)),apart_point_and_line(x0,x1),apart_point_and_line(skc3,x1)
% 0.29/0.51 === Clause set with instances from active satisfied. Growing active. New size: 50
% 0.29/0.51 === Restarting.
% 0.29/0.51 === Backtracking. Learning clause 23:2:2:[4.2,1.1]:TopTop: distinct_points(x0,x1) -> distinct_points(x1,x0)
% 0.29/0.51 === Backtracking. Learning clause 24:2:1:[4.3,23.1,16.1,23.1]:Top: -> distinct_points(x0,skc4),distinct_points(x0,skc3)
% 0.29/0.51 === Backtracking. Learning clause 25:4:3:[11.5,8.2,7.2]:TopTopTop: distinct_lines(line_connecting(x0,x1),x2),distinct_points(x0,x1) -> apart_point_and_line(x0,x2),apart_point_and_line(x1,x2)
% 0.29/0.51 === Backtracking. Learning clause 26:2:1:[13.3,19.1]:Top: apart_point_and_line(skc4,x0) -> distinct_lines(x0,line_connecting(skc1,skc2))
% 0.29/0.51 === Backtracking. Learning clause 28:4:2:[15.0,27.0,5.3,25.1,26.2]:TopTop: apart_point_and_line(skc4,x0) -> distinct_lines(x0,x1),apart_point_and_line(skc1,x1),apart_point_and_line(skc2,x1)
% 0.29/0.51 === Conflict found: 25:4:3:[11.5,8.2,7.2]:TopTopTop: distinct_lines(line_connecting(x0,x1),x2),distinct_points(x0,x1) -> apart_point_and_line(x0,x2),apart_point_and_line(x1,x2) {x0 -> skc3, x1 -> skc4, x2 -> skc1}
% 0.29/0.51 === Backtracking. Learning clause 32:5:3:[16.0,29.0,13.0,30.1,13.0,31.2,25.1,20.1,28.1,12.1]:TopTopTop: -> distinct_lines(x0,x1),apart_point_and_line(skc1,x1),apart_point_and_line(skc2,x1),distinct_points(skc3,x2),apart_point_and_line(x2,x0)
% 0.29/0.51 === Conflict found: 21:3:1:[17.2,12.1]:Top: -> apart_point_and_line(skc1,line_connecting(skc3,skc4)),distinct_points(skc2,x0),apart_point_and_line(x0,line_connecting(skc3,skc4)) {x0 -> skc4}
% 0.29/0.51 === Backtracking. Learning clause 34:2:0:[16.0,33.0,21.3,8.2]:: -> apart_point_and_line(skc1,line_connecting(skc3,skc4)),distinct_points(skc2,skc4)
% 0.29/0.51 === Backtracking. Learning clause 35:2:0:[12.3,7.2,34.1,16.1]:: -> distinct_points(skc1,skc3),distinct_points(skc2,skc4)
% 0.29/0.51 === Conflict found: 21:3:1:[17.2,12.1]:Top: -> apart_point_and_line(skc1,line_connecting(skc3,skc4)),distinct_points(skc2,x0),apart_point_and_line(x0,line_connecting(skc3,skc4)) {x0 -> intersection_point(line_connecting(skc3,skc4),skc1)}
% 0.29/0.51 === Backtracking. Learning clause 36:3:1:[21.3,9.2]:Top: convergent_lines(line_connecting(skc3,skc4),x0) -> apart_point_and_line(skc1,line_connecting(skc3,skc4)),distinct_points(skc2,intersection_point(line_connecting(skc3,skc4),x0))
% 0.29/0.51 === Clause set with instances from active satisfied. Growing active. New size: 58
% 0.29/0.51 === Restarting.
% 0.29/0.51 === Backtracking. Learning clause 37:3:3:[13.3,8.2]:TopTopTop: apart_point_and_line(x0,x1),distinct_points(x2,x0) -> distinct_lines(x1,line_connecting(x2,x0))
% 0.29/0.51 === Conflict found: 32:5:3:[16.0,29.0,13.0,30.1,13.0,31.2,25.1,20.1,28.1,12.1]:TopTopTop: -> distinct_lines(x0,x1),apart_point_and_line(skc1,x1),apart_point_and_line(skc2,x1),distinct_points(skc3,x2),apart_point_and_line(x2,x0) {x0 -> line_connecting(skc1,skc2), x1 -> line_connecting(skc1,skc2), x2 -> skc3}
% 0.29/0.51
% 0.29/0.51 SZS status Unsatisfiable
% 0.29/0.51
% 0.29/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.29/0.51
% 0.29/0.51 SPASS-SCL-FOL Statistics:
% 0.29/0.51 Number of learned clauses: 13
% 0.29/0.51 Number of propagations: 197
% 0.29/0.51 Number of decisions: 139
% 0.29/0.51 Number of resolutions: 28
% 0.29/0.51 Number of condensations: 0
% 0.29/0.51 Number of sub resolutions: 5
% 0.29/0.51 Number of input literals (deduplicated): 17
% 0.29/0.51 Number of grows: 2
% 0.29/0.51 Number of considered ground atoms: 58
% 0.29/0.51
% 0.29/0.51 Needed: 0:00:00.03
% 0.29/0.51
%------------------------------------------------------------------------------