%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO181+2 : 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 : n029.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.51s 0.58s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO181+2 : 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.33 % Computer : n029.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Thu May 7 11:55:45 EDT 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.33 SPASS-SCL-FOL version:
% 0.20/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.51/0.58 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.58 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.58 Execution resolution_3 ended with status: unsatisfiable
% 0.51/0.58 Used heuristic: resolution_3
% 0.51/0.58
% 0.51/0.58 Input Clauses:
% 0.51/0.58
% 0.51/0.58 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line ren1 ren2
% 0.51/0.58 Fol Constants: skc1 skc2 skc3
% 0.51/0.58 Fol Functions: line_connecting intersection_point
% 0.51/0.58 Problem Properties:
% 0.51/0.58 This is a full first-order problem without equality.
% 0.51/0.58
% 0.51/0.58 After reduction: Problem Properties:
% 0.51/0.58 This is a full first-order problem without equality.
% 0.51/0.58
% 0.51/0.58
% 0.51/0.58 Reduced Input Clauses:
% 0.51/0.58
% 0.51/0.58 Most General Atoms: distinct_points(x1,x2) convergent_lines(x1,x2) ren1(x2,x0,x1) ren2(x2,x0,x1) distinct_lines(x2,x3) apart_point_and_line(x2,x1)
% 0.51/0.58
% 0.51/0.58 === Starting SPASS-SCL-FOL A Little Less Naive, considering 23 atoms initially, heuristics mode: resolution_3 ===
% 0.51/0.58
% 0.51/0.58 === Backtracking. Learning clause 20:5:2:[13.5,19.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.51/0.58 === Backtracking. Learning clause 21:3:2:[14.1,18.1,15.1]:TopTop: -> distinct_points(skc3,x0),distinct_lines(line_connecting(skc1,skc2),x1),apart_point_and_line(x0,x1)
% 0.51/0.58 === Backtracking. Learning clause 22:2:1:[14.1,18.1]:Top: -> distinct_points(skc3,x0),apart_point_and_line(x0,line_connecting(skc1,skc2))
% 0.51/0.58 === Backtracking. Learning clause 24:1:0:[17.0,23.0,9.2,18.1,7.1]:: -> distinct_points(skc3,skc1)
% 0.51/0.58 === Backtracking. Learning clause 25:2:1:[15.1,18.1]:Top: -> distinct_lines(line_connecting(skc1,skc2),x0),apart_point_and_line(skc3,x0)
% 0.51/0.58 === Backtracking. Learning clause 27:1:0:[17.0,26.0,9.2,18.1]:: -> ren1(skc3,skc1,skc2)
% 0.51/0.58 === Clause set with instances from active satisfied. Growing active. New size: 29
% 0.51/0.58 === Restarting.
% 0.51/0.58 === Backtracking. Learning clause 28:1:0:[8.1,27.1]:: -> distinct_points(skc3,skc2)
% 0.51/0.58 === Conflict found: 20:5:2:[13.5,19.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.51/0.58 === Backtracking. Learning clause 29:7:3:[20.3,9.2,5.3]:TopTopTop: distinct_points(x0,skc2),distinct_points(skc1,skc3),distinct_lines(x1,line_connecting(skc1,skc3)) -> apart_point_and_line(x0,x2),apart_point_and_line(skc2,x2),ren1(x0,skc1,skc3),distinct_lines(x1,x2)
% 0.51/0.58 === Conflict found: 20:5:2:[13.5,19.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.51/0.58 === Backtracking. Learning clause 30:6:2:[20.3,9.2]:TopTop: distinct_points(x0,skc2),distinct_lines(line_connecting(skc1,skc3),x1),distinct_points(skc1,skc3) -> apart_point_and_line(x0,x1),apart_point_and_line(skc2,x1),ren1(x0,skc1,skc3)
% 0.51/0.58 === Clause set with instances from active satisfied. Growing active. New size: 34
% 0.51/0.58 === Restarting.
% 0.51/0.58 === Clause set with instances from active satisfied. Growing active. New size: 98
% 0.51/0.58 === Backtracking. Learning clause 32:6:3:[17.0,31.1,9.2,13.5,8.1,9.2,25.1,7.1]:TopTopTop: distinct_points(x0,x1) -> apart_point_and_line(x0,x2),apart_point_and_line(x1,x2),distinct_points(x1,skc2),apart_point_and_line(skc3,x2),distinct_points(x0,skc1)
% 0.51/0.58 === Clause set with instances from active satisfied. Growing active. New size: 162
% 0.51/0.58 === Backtracking. Learning clause 33:4:4:[5.1,15.2]:TopTopTopTop: apart_point_and_line(x0,x1) -> distinct_lines(x1,x2),distinct_lines(x3,x2),apart_point_and_line(x0,x3)
% 0.51/0.58 === Backtracking. Learning clause 34:7:4:[13.6,33.1,19.1]:TopTopTopTop: 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),distinct_lines(x1,x2),distinct_lines(x3,x2),apart_point_and_line(skc2,x3)
% 0.51/0.58 === Backtracking. Learning clause 35:9:5:[9.2,33.4,8.1,1.1,34.2]:TopTopTopTopTop: distinct_points(skc1,skc3),apart_point_and_line(skc3,x0),distinct_points(x1,skc2) -> distinct_lines(x0,x2),apart_point_and_line(x1,line_connecting(skc1,skc3)),apart_point_and_line(x1,x2),distinct_lines(x2,x3),distinct_lines(x4,x3),apart_point_and_line(skc2,x4)
% 0.51/0.58 === Backtracking. Learning clause 37:4:1:[1.0,36.3,8.2,1.1,9.3,32.5,19.1]:Top: distinct_points(skc1,skc3),distinct_points(x0,skc2) -> apart_point_and_line(x0,line_connecting(skc1,skc3)),distinct_points(x0,skc1)
% 0.51/0.58 === Backtracking. Learning clause 38:3:1:[9.3,7.1,37.3]:Top: distinct_points(skc1,skc3),distinct_points(x0,skc2) -> distinct_points(x0,skc1)
% 0.51/0.58
% 0.51/0.58 SZS status Unsatisfiable
% 0.51/0.58
% 0.51/0.58 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.58
% 0.51/0.58 SPASS-SCL-FOL Statistics:
% 0.51/0.58 Number of learned clauses: 15
% 0.51/0.58 Number of propagations: 365
% 0.51/0.58 Number of decisions: 104
% 0.51/0.58 Number of resolutions: 35
% 0.51/0.58 Number of condensations: 0
% 0.51/0.58 Number of sub resolutions: 4
% 0.51/0.58 Number of input literals (deduplicated): 14
% 0.51/0.58 Number of grows: 4
% 0.51/0.58 Number of considered ground atoms: 162
% 0.51/0.58
% 0.51/0.58 Needed: 0:00:00.03
% 0.51/0.58
%------------------------------------------------------------------------------