%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO203+2 : 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 : n015.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:03 PM UTC 2026
% Result : Theorem 1.73s 0.87s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO203+2 : TPTP v9.2.1. Released v3.3.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n015.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 11:56:17 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 1.73/0.87 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.73/0.87 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.73/0.87 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.73/0.87 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.73/0.87 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.73/0.87 Execution resolution_2 ended with status: unsatisfiable
% 1.73/0.87 Used heuristic: resolution_2
% 1.73/0.87
% 1.73/0.87 Input Clauses:
% 1.73/0.87
% 1.73/0.87 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line ren1 ren2
% 1.73/0.87 Fol Constants: skc1 skc2 skc3
% 1.73/0.87 Fol Functions: line_connecting intersection_point
% 1.73/0.87 Problem Properties:
% 1.73/0.87 This is a full first-order problem without equality.
% 1.73/0.87
% 1.73/0.87 After reduction: Problem Properties:
% 1.73/0.87 This is a full first-order problem without equality.
% 1.73/0.87
% 1.73/0.87
% 1.73/0.87 Reduced Input Clauses:
% 1.73/0.87
% 1.73/0.87 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)
% 1.73/0.87
% 1.73/0.87 === Starting SPASS-SCL-FOL A Little Less Naive, considering 48 atoms initially, heuristics mode: resolution_2 ===
% 1.73/0.87
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 53
% 1.73/0.87 === Restarting.
% 1.73/0.87 === Backtracking. Learning clause 21:2:2:[4.2,1.1]:TopTop: distinct_points(x0,x1) -> distinct_points(x1,x0)
% 1.73/0.87 === Backtracking. Learning clause 22:1:2:[8.2,1.1]:TopTop: ren1(x0,x1,x0) ->
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 53
% 1.73/0.87 === Restarting.
% 1.73/0.87 === Backtracking. Learning clause 23:3:3:[12.2,10.2]:TopTopTop: convergent_lines(x0,x1),apart_point_and_line(x2,x0) -> distinct_points(x2,intersection_point(x0,x1))
% 1.73/0.87 === Conflict found: 23:3:3:[12.2,10.2]:TopTopTop: convergent_lines(x0,x1),apart_point_and_line(x2,x0) -> distinct_points(x2,intersection_point(x0,x1)) {x0 -> skc1, x1 -> skc2, x2 -> skc1}
% 1.73/0.87 === Backtracking. Learning clause 24:2:1:[23.1,17.1]:Top: apart_point_and_line(x0,skc1) -> distinct_points(x0,intersection_point(skc1,skc2))
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 53
% 1.73/0.87 === Restarting.
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 53
% 1.73/0.87 === Restarting.
% 1.73/0.87 === Backtracking. Learning clause 25:2:1:[12.1,18.1]:Top: ren2(x0,skc1,skc3) -> distinct_points(x0,intersection_point(skc1,skc3))
% 1.73/0.87 === Backtracking. Learning clause 26:2:1:[6.1,18.1]:Top: -> convergent_lines(skc1,x0),convergent_lines(skc3,x0)
% 1.73/0.87 === Backtracking. Learning clause 27:1:0:[16.1,18.1]:: -> distinct_lines(skc1,skc3)
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 117
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 121
% 1.73/0.87 === Restarting.
% 1.73/0.87 === Backtracking. Learning clause 28:2:1:[9.1,19.1]:Top: apart_point_and_line(x0,line_connecting(intersection_point(skc1,skc2),intersection_point(skc1,skc3))) -> ren1(x0,intersection_point(skc1,skc2),intersection_point(skc1,skc3))
% 1.73/0.87 === Backtracking. Learning clause 29:2:1:[4.1,19.1]:Top: -> distinct_points(intersection_point(skc1,skc2),x0),distinct_points(intersection_point(skc1,skc3),x0)
% 1.73/0.87 === Conflict found: 21:2:2:[4.2,1.1]:TopTop: distinct_points(x0,x1) -> distinct_points(x1,x0) {x0 -> intersection_point(skc1,skc2), x1 -> intersection_point(skc1,skc3)}
% 1.73/0.87 === Backtracking. Learning clause 30:1:0:[21.1,19.1]:: -> distinct_points(intersection_point(skc1,skc3),intersection_point(skc1,skc2))
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 121
% 1.73/0.87 === Restarting.
% 1.73/0.87 === Backtracking. Learning clause 31:5:5:[14.3,14.1,4.1]:TopTopTopTopTop: apart_point_and_line(x0,x1) -> distinct_points(x2,x3),apart_point_and_line(x3,x1),distinct_points(x0,x4),distinct_points(x2,x4)
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 123
% 1.73/0.87 === Restarting.
% 1.73/0.87 === Conflict found: 28:2:1:[9.1,19.1]:Top: apart_point_and_line(x0,line_connecting(intersection_point(skc1,skc2),intersection_point(skc1,skc3))) -> ren1(x0,intersection_point(skc1,skc2),intersection_point(skc1,skc3)) {x0 -> intersection_point(skc1,skc3)}
% 1.73/0.87 === Backtracking. Learning clause 32:1:0:[28.2,22.1]:: apart_point_and_line(intersection_point(skc1,skc3),line_connecting(intersection_point(skc1,skc2),intersection_point(skc1,skc3))) ->
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 123
% 1.73/0.87 === Restarting.
% 1.73/0.87 === Backtracking. Learning clause 33:2:1:[5.1,27.1]:Top: -> distinct_lines(skc1,x0),distinct_lines(skc3,x0)
% 1.73/0.87 === Backtracking. Learning clause 34:3:3:[4.3,21.1,21.1]:TopTopTop: distinct_points(x0,x1) -> distinct_points(x2,x1),distinct_points(x2,x0)
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 187
% 1.73/0.87 === Conflict found: 23:3:3:[12.2,10.2]:TopTopTop: convergent_lines(x0,x1),apart_point_and_line(x2,x0) -> distinct_points(x2,intersection_point(x0,x1)) {x0 -> skc1, x1 -> skc3, x2 -> intersection_point(skc1,skc3)}
% 1.73/0.87 === Backtracking. Learning clause 35:6:5:[23.3,1.1,13.6,10.1]:TopTopTopTopTop: convergent_lines(x0,x1),distinct_points(x2,intersection_point(x0,x1)),distinct_lines(x3,x0) -> apart_point_and_line(x2,x3),apart_point_and_line(intersection_point(x0,x1),x3),ren2(x2,x0,x4)
% 1.73/0.87 === Clause set with instances from active satisfied. Growing active. New size: 190
% 1.73/0.87 === Restarting.
% 1.73/0.87 === Conflict found: 29:2:1:[4.1,19.1]:Top: -> distinct_points(intersection_point(skc1,skc2),x0),distinct_points(intersection_point(skc1,skc3),x0) {x0 -> skc1}
% 1.73/0.87 === Backtracking. Learning clause 36:2:1:[29.1,21.1,21.1]:Top: -> distinct_points(x0,intersection_point(skc1,skc2)),distinct_points(x0,intersection_point(skc1,skc3))
% 1.73/0.87 === Conflict found: 35:6:5:[23.3,1.1,13.6,10.1]:TopTopTopTopTop: convergent_lines(x0,x1),distinct_points(x2,intersection_point(x0,x1)),distinct_lines(x3,x0) -> apart_point_and_line(x2,x3),apart_point_and_line(intersection_point(x0,x1),x3),ren2(x2,x0,x4) {x0 -> skc1, x1 -> skc3, x2 -> skc1, x3 -> line_connecting(intersection_point(skc1,skc2),intersection_point(skc1,skc3)), x4 -> skc2}
% 1.73/0.87 === Backtracking. Learning clause 37:1:1:[35.4,28.1,20.1,12.2,17.1,7.1,32.1,18.1,36.2]:Top: -> distinct_points(x0,intersection_point(skc1,skc2))
% 1.73/0.87 === Conflict found: 37:1:1:[35.4,28.1,20.1,12.2,17.1,7.1,32.1,18.1,36.2]:Top: -> distinct_points(x0,intersection_point(skc1,skc2)) {x0 -> intersection_point(skc1,skc2)}
% 1.73/0.87
% 1.73/0.87 SZS status Unsatisfiable
% 1.73/0.87
% 1.73/0.87 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.73/0.87
% 1.73/0.87 SPASS-SCL-FOL Statistics:
% 1.73/0.87 Number of learned clauses: 17
% 1.73/0.87 Number of propagations: 1005
% 1.73/0.87 Number of decisions: 337
% 1.73/0.87 Number of resolutions: 30
% 1.73/0.87 Number of condensations: 0
% 1.73/0.87 Number of sub resolutions: 0
% 1.73/0.87 Number of input literals (deduplicated): 15
% 1.73/0.87 Number of grows: 11
% 1.73/0.87 Number of considered ground atoms: 190
% 1.73/0.87
% 1.73/0.87 Needed: 0:00:00.31
% 1.73/0.87
%------------------------------------------------------------------------------