%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO196+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 : n003.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:01 PM UTC 2026
% Result : Theorem 0.53s 0.56s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO196+2 : TPTP v9.2.1. Released v3.3.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n003.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:55:57 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.53/0.56 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.56 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.56 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.56 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.56 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.56 Execution resolution_3 ended with status: unsatisfiable
% 0.53/0.56 Used heuristic: resolution_3
% 0.53/0.56
% 0.53/0.56 Input Clauses:
% 0.53/0.56
% 0.53/0.56 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line ren1 ren2
% 0.53/0.56 Fol Constants: skc1 skc2 skc3 skc4
% 0.53/0.56 Fol Functions: line_connecting intersection_point
% 0.53/0.56 Problem Properties:
% 0.53/0.56 This is a full first-order problem without equality.
% 0.53/0.56
% 0.53/0.56 After reduction: Problem Properties:
% 0.53/0.56 This is a full first-order problem without equality.
% 0.53/0.56
% 0.53/0.56
% 0.53/0.56 Reduced Input Clauses:
% 0.53/0.56
% 0.53/0.56 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.53/0.56
% 0.53/0.56 === Starting SPASS-SCL-FOL A Little Less Naive, considering 30 atoms initially, heuristics mode: resolution_3 ===
% 0.53/0.56
% 0.53/0.56 === Backtracking. Learning clause 22:1:0:[16.1,17.1]:: -> distinct_lines(skc1,skc2)
% 0.53/0.56 === Backtracking. Learning clause 23:1:0:[16.1,18.1]:: -> distinct_lines(skc3,skc4)
% 0.53/0.56 === Backtracking. Learning clause 24:5:2:[13.4,19.1]:TopTop: distinct_points(intersection_point(skc1,skc2),x0),distinct_lines(x1,skc3) -> apart_point_and_line(intersection_point(skc1,skc2),x1),apart_point_and_line(x0,x1),apart_point_and_line(x0,skc3)
% 0.53/0.56 === Backtracking. Learning clause 26:4:2:[23.0,25.0,13.4,20.1,19.1,4.3]:TopTop: distinct_points(x0,intersection_point(skc1,skc2)) -> apart_point_and_line(x1,skc3),apart_point_and_line(x1,skc4),distinct_points(x0,x1)
% 0.53/0.56 === Backtracking. Learning clause 28:3:1:[23.0,27.1,13.4,20.1,19.1]:Top: distinct_points(intersection_point(skc1,skc2),x0) -> apart_point_and_line(x0,skc3),apart_point_and_line(x0,skc4)
% 0.53/0.56 === Backtracking. Learning clause 29:4:2:[21.2,14.1,14.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.53/0.56 === Clause set with instances from active satisfied. Growing active. New size: 44
% 0.53/0.56 === Restarting.
% 0.53/0.56 === Backtracking. Learning clause 31:4:2:[17.0,30.0,12.3,26.1]:TopTop: ren2(x0,skc1,skc2) -> apart_point_and_line(x1,skc3),apart_point_and_line(x1,skc4),distinct_points(x0,x1)
% 0.53/0.56 === Clause set with instances from active satisfied. Growing active. New size: 98
% 0.53/0.56 === Backtracking. Learning clause 32:6:4:[10.1,13.4,12.2,1.1]:TopTopTopTop: distinct_points(intersection_point(x0,x1),x2),distinct_lines(x3,x0),convergent_lines(x0,x1) -> apart_point_and_line(intersection_point(x0,x1),x3),apart_point_and_line(x2,x3),apart_point_and_line(x2,x0)
% 0.53/0.56 === Backtracking. Learning clause 34:5:1:[18.0,33.1,11.1,32.4,12.2,1.1,29.1]:Top: distinct_lines(skc4,skc3) -> apart_point_and_line(x0,skc4),apart_point_and_line(x0,skc3),apart_point_and_line(x0,skc2),apart_point_and_line(x0,skc1)
% 0.53/0.56 === Backtracking. Learning clause 38:6:2:[17.0,35.2,14.0,36.3,14.0,37.5,14.1,34.2,4.1,32.1,20.1,19.1]:TopTop: distinct_lines(skc4,skc3),distinct_lines(skc3,skc1) -> apart_point_and_line(x0,skc2),distinct_points(x0,x1),apart_point_and_line(x1,skc3),apart_point_and_line(x1,skc1)
% 0.53/0.56 === Backtracking. Learning clause 39:8:3:[11.2,31.1,38.3]:TopTopTop: distinct_lines(skc4,skc3),distinct_lines(skc3,skc1) -> apart_point_and_line(x0,skc3),apart_point_and_line(x0,skc4),distinct_points(x1,x0),distinct_points(x1,x2),apart_point_and_line(x2,skc3),apart_point_and_line(x2,skc1)
% 0.53/0.56 === Backtracking. Learning clause 40:2:1:[10.2,31.1,39.8,10.1,11.1,12.2,1.1,18.1,5.3,23.1,2.1,5.3]:Top: distinct_lines(x0,skc3) -> distinct_lines(x0,skc1)
% 0.53/0.56 === Backtracking. Learning clause 41:2:1:[12.1,18.1]:Top: ren2(x0,skc3,skc4) -> distinct_points(x0,intersection_point(skc3,skc4))
% 0.53/0.56 === Backtracking. Learning clause 42:6:5:[11.1,29.2,31.1,10.1,11.1]:TopTopTopTopTop: -> distinct_points(intersection_point(skc3,skc4),x0),distinct_points(intersection_point(skc3,skc4),x1),apart_point_and_line(x1,skc1),distinct_points(x0,x2),ren2(x2,skc3,x3),ren2(x2,x4,skc4)
% 0.53/0.56 === Conflict found: 31:4:2:[17.0,30.0,12.3,26.1]:TopTop: ren2(x0,skc1,skc2) -> apart_point_and_line(x1,skc3),apart_point_and_line(x1,skc4),distinct_points(x0,x1) {x0 -> intersection_point(skc3,skc4), x1 -> intersection_point(skc3,skc4)}
% 0.53/0.56
% 0.53/0.56 SZS status Unsatisfiable
% 0.53/0.56
% 0.53/0.56 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.53/0.56
% 0.53/0.56 SPASS-SCL-FOL Statistics:
% 0.53/0.56 Number of learned clauses: 14
% 0.53/0.56 Number of propagations: 188
% 0.53/0.56 Number of decisions: 56
% 0.53/0.56 Number of resolutions: 47
% 0.53/0.56 Number of condensations: 0
% 0.53/0.56 Number of sub resolutions: 7
% 0.53/0.56 Number of input literals (deduplicated): 17
% 0.53/0.56 Number of grows: 2
% 0.53/0.56 Number of considered ground atoms: 98
% 0.53/0.56
% 0.53/0.56 Needed: 0:00:00.02
% 0.53/0.56
%------------------------------------------------------------------------------