%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO191+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 : n002.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.43s 0.58s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO191+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.16/0.34 % Computer : n002.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:32 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.19/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.43/0.58 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.58 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.58 Execution resolution_1 ended with status: unsatisfiable
% 0.43/0.58 Used heuristic: resolution_1
% 0.43/0.58
% 0.43/0.58 Input Clauses:
% 0.43/0.58
% 0.43/0.58 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line ren1 ren2
% 0.43/0.58 Fol Constants: skc1 skc2 skc3 skc4
% 0.43/0.58 Fol Functions: line_connecting intersection_point
% 0.43/0.58 Problem Properties:
% 0.43/0.58 This is a full first-order problem without equality.
% 0.43/0.58
% 0.43/0.58 After reduction: Problem Properties:
% 0.43/0.58 This is a full first-order problem without equality.
% 0.43/0.58
% 0.43/0.58
% 0.43/0.58 Reduced Input Clauses:
% 0.43/0.58
% 0.43/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.43/0.58
% 0.43/0.58 === Starting SPASS-SCL-FOL A Little Less Naive, considering 26 atoms initially, heuristics mode: resolution_1 ===
% 0.43/0.58
% 0.43/0.58 === Backtracking. Learning clause 22:1:0:[16.1,17.1]:: -> distinct_lines(skc1,skc2)
% 0.43/0.58 === Backtracking. Learning clause 23:1:0:[16.1,18.1]:: -> distinct_lines(skc3,skc4)
% 0.43/0.58 === Backtracking. Learning clause 24:3:1:[19.2,14.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.43/0.58 === Backtracking. Learning clause 25:5:2:[13.3,21.1,20.1,4.3]:TopTop: distinct_lines(skc2,skc1),distinct_points(x0,intersection_point(skc3,skc4)) -> apart_point_and_line(x1,skc2),apart_point_and_line(x1,skc1),distinct_points(x0,x1)
% 0.43/0.58 === Backtracking. Learning clause 26:4:1:[13.3,21.1,20.1]:Top: distinct_points(intersection_point(skc3,skc4),x0),distinct_lines(skc2,skc1) -> apart_point_and_line(x0,skc2),apart_point_and_line(x0,skc1)
% 0.43/0.58 === Clause set with instances from active satisfied. Growing active. New size: 36
% 0.43/0.58 === Restarting.
% 0.43/0.58 === Backtracking. Learning clause 27:2:1:[14.3,21.1]:Top: apart_point_and_line(x0,skc2) -> distinct_points(x0,intersection_point(skc3,skc4))
% 0.43/0.58 === Clause set with instances from active satisfied. Growing active. New size: 37
% 0.43/0.58 === Restarting.
% 0.43/0.58 === Clause set with instances from active satisfied. Growing active. New size: 91
% 0.43/0.58 === Backtracking. Learning clause 28:2:2:[12.2,10.2,1.1]:TopTop: convergent_lines(x0,x1),apart_point_and_line(intersection_point(x0,x1),x0) ->
% 0.43/0.58 === Clause set with instances from active satisfied. Growing active. New size: 155
% 0.43/0.58 === Backtracking. Learning clause 29:5:5:[4.1,14.2,9.1]:TopTopTopTopTop: apart_point_and_line(x0,x1),apart_point_and_line(x2,line_connecting(x3,x4)) -> distinct_points(x0,x4),apart_point_and_line(x3,x1),ren1(x2,x3,x4)
% 0.43/0.58 === Backtracking. Learning clause 30:7:8:[13.3,11.1,4.3,11.1,10.1]:TopTopTopTopTopTopTopTop: distinct_lines(x0,x1),distinct_points(x2,x3) -> apart_point_and_line(x3,x1),ren2(x3,x4,x0),distinct_points(x2,x5),ren2(x5,x6,x1),ren2(x5,x0,x7)
% 0.43/0.58 === Backtracking. Learning clause 31:7:6:[13.4,11.1,14.2]:TopTopTopTopTopTop: distinct_lines(x0,x1),apart_point_and_line(x2,x3) -> apart_point_and_line(x2,x0),apart_point_and_line(x4,x0),apart_point_and_line(x4,x1),ren2(x2,x5,x1),apart_point_and_line(x4,x3)
% 0.43/0.58 === Backtracking. Learning clause 32:7:6:[12.2,11.2,1.1,31.7]:TopTopTopTopTopTop: convergent_lines(x0,x1),distinct_lines(x2,x3),apart_point_and_line(x4,x1) -> apart_point_and_line(x4,x2),apart_point_and_line(intersection_point(x0,x1),x2),apart_point_and_line(intersection_point(x0,x1),x3),ren2(x4,x5,x3)
% 0.43/0.58 === Conflict found: 31:7:6:[13.4,11.1,14.2]:TopTopTopTopTopTop: distinct_lines(x0,x1),apart_point_and_line(x2,x3) -> apart_point_and_line(x2,x0),apart_point_and_line(x4,x0),apart_point_and_line(x4,x1),ren2(x2,x5,x1),apart_point_and_line(x4,x3) {x0 -> skc1, x1 -> skc2, x2 -> intersection_point(skc1,skc2), x3 -> skc3, x4 -> intersection_point(skc3,skc4), x5 -> skc1}
% 0.43/0.58
% 0.43/0.58 SZS status Unsatisfiable
% 0.43/0.58
% 0.43/0.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.58
% 0.43/0.58 SPASS-SCL-FOL Statistics:
% 0.43/0.58 Number of learned clauses: 11
% 0.43/0.58 Number of propagations: 269
% 0.43/0.58 Number of decisions: 99
% 0.43/0.58 Number of resolutions: 33
% 0.43/0.58 Number of condensations: 0
% 0.43/0.58 Number of sub resolutions: 0
% 0.43/0.58 Number of input literals (deduplicated): 17
% 0.43/0.58 Number of grows: 4
% 0.43/0.58 Number of considered ground atoms: 155
% 0.43/0.58
% 0.43/0.58 Needed: 0:00:00.03
% 0.43/0.58
%------------------------------------------------------------------------------