%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : GEO223+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 : 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:08 PM UTC 2026
% Result : Theorem 21.77s 4.88s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO223+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 : 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:56:27 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 21.77/4.88 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.77/4.88 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.77/4.88 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.77/4.88 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.77/4.88 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.77/4.88 Execution resolution_1 ended with status: unsatisfiable
% 21.77/4.88 Used heuristic: resolution_1
% 21.77/4.88
% 21.77/4.88 Input Clauses:
% 21.77/4.88
% 21.77/4.88 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line unorthogonal_lines ren1 ren2 ren3 ren4
% 21.77/4.88 Fol Constants: skc1 skc2
% 21.77/4.88 Fol Functions: line_connecting intersection_point parallel_through_point orthogonal_through_point
% 21.77/4.88 Problem Properties:
% 21.77/4.88 This is a full first-order problem without equality.
% 21.77/4.88
% 21.77/4.88 After reduction: Problem Properties:
% 21.77/4.88 This is a full first-order problem without equality.
% 21.77/4.88
% 21.77/4.88
% 21.77/4.88 Reduced Input Clauses:
% 21.77/4.88
% 21.77/4.88 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,x0) ren3(x0,x2) ren4(x1,x2) unorthogonal_lines(x1,x3)
% 21.77/4.88
% 21.77/4.88 === Starting SPASS-SCL-FOL A Little Less Naive, considering 33 atoms initially, heuristics mode: resolution_1 ===
% 21.77/4.88
% 21.77/4.88 === Backtracking. Learning clause 30:2:3:[6.3,17.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 21.77/4.88 === Backtracking. Learning clause 31:3:3:[19.2,18.1,17.1,5.3]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> apart_point_and_line(x2,x1),distinct_lines(x0,x1)
% 21.77/4.88 === Backtracking. Learning clause 32:2:2:[19.2,18.1,17.1]:TopTop: distinct_lines(parallel_through_point(x0,x1),x0) -> apart_point_and_line(x1,x0)
% 21.77/4.88 === Backtracking. Learning clause 33:3:3:[19.2,27.1]:TopTopTop: distinct_lines(orthogonal_through_point(x0,x1),x2) -> apart_point_and_line(x1,x2),convergent_lines(orthogonal_through_point(x0,x1),x2)
% 21.77/4.88 === Backtracking. Learning clause 34:3:3:[19.3,27.1]:TopTopTop: distinct_lines(x0,orthogonal_through_point(x1,x2)) -> apart_point_and_line(x2,x0),convergent_lines(x0,orthogonal_through_point(x1,x2))
% 21.77/4.88 === Backtracking. Learning clause 35:4:2:[28.1,29.1]:TopTop: -> apart_point_and_line(x0,parallel_through_point(skc2,skc1)),apart_point_and_line(x0,orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1)),unorthogonal_lines(parallel_through_point(skc2,skc1),x1),unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1),x1)
% 21.77/4.88 === Backtracking. Learning clause 36:2:1:[5.1,29.1]:Top: -> distinct_lines(parallel_through_point(skc2,skc1),x0),distinct_lines(orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1),x0)
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 45
% 21.77/4.88 === Restarting.
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 109
% 21.77/4.88 === Backtracking. Learning clause 37:2:2:[20.1,16.1]:TopTop: -> unorthogonal_lines(x0,x1),distinct_lines(x0,x1)
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 173
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 237
% 21.77/4.88 === Backtracking. Learning clause 38:2:3:[15.3,18.1]:TopTopTop: apart_point_and_line(x0,x1) -> distinct_lines(x1,parallel_through_point(x2,x0))
% 21.77/4.88 === Backtracking. Learning clause 39:4:5:[19.3,10.1,11.1]:TopTopTopTopTop: distinct_lines(x0,x1) -> convergent_lines(x0,x1),ren2(x2,x1,x3),ren2(x2,x4,x0)
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 301
% 21.77/4.88 === Backtracking. Learning clause 40:7:5:[13.4,9.2,37.2]:TopTopTopTopTop: distinct_points(x0,x1),distinct_points(x2,x3) -> apart_point_and_line(x0,x4),apart_point_and_line(x1,x4),apart_point_and_line(x1,line_connecting(x2,x3)),ren1(x0,x2,x3),unorthogonal_lines(x4,line_connecting(x2,x3))
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 365
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 429
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 493
% 21.77/4.88 === Backtracking. Learning clause 41:8:6:[25.4,24.1,28.5,34.3]:TopTopTopTopTopTop: distinct_lines(x0,x1),distinct_lines(x1,orthogonal_through_point(x2,x3)) -> ren3(x1,x4),unorthogonal_lines(orthogonal_through_point(x2,x3),x4),apart_point_and_line(x5,x0),apart_point_and_line(x5,x1),unorthogonal_lines(x0,orthogonal_through_point(x2,x3)),apart_point_and_line(x3,x1)
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 557
% 21.77/4.88 === Backtracking. Learning clause 42:4:3:[25.4,23.1]:TopTopTop: convergent_lines(x0,x1),unorthogonal_lines(x0,x1) -> ren3(x0,x2),convergent_lines(x1,x2)
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 621
% 21.77/4.88 === Clause set with instances from active satisfied. Growing active. New size: 685
% 21.77/4.88 === Backtracking. Learning clause 43:4:3:[25.3,21.1]:TopTopTop: convergent_lines(x0,x1),unorthogonal_lines(x0,x1) -> ren4(x1,x2),convergent_lines(x0,x2)
% 21.77/4.88 === Backtracking. Learning clause 44:6:5:[24.2,25.2,43.3,6.3,22.2,25.3,43.4]:TopTopTopTopTop: convergent_lines(x0,x1),unorthogonal_lines(x0,x1) -> ren3(x2,x3),ren4(x4,x3),convergent_lines(x0,x4),ren4(x1,x2)
% 21.77/4.88 === Backtracking. Learning clause 45:1:2:[24.2,26.1]:TopTop: ren4(orthogonal_through_point(x0,x1),x0) ->
% 21.77/4.88 === Backtracking. Learning clause 46:2:3:[21.2,30.1]:TopTopTop: ren3(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 21.77/4.88 === Backtracking. Learning clause 47:3:3:[5.3,31.1,5.3,37.2,2.1]:TopTopTop: -> distinct_lines(x0,parallel_through_point(x1,x2)),apart_point_and_line(x2,x1),unorthogonal_lines(x1,x0)
% 21.77/4.88 === Backtracking. Learning clause 48:12:8:[21.1,44.3,25.1,24.1,44.2,6.3,22.1,20.1]:TopTopTopTopTopTopTopTop: convergent_lines(x0,x1),unorthogonal_lines(x0,x1),unorthogonal_lines(x2,x3) -> ren4(x4,x3),convergent_lines(x0,x4),ren4(x3,x5),ren4(x6,x5),convergent_lines(x1,x6),ren4(x2,x2),convergent_lines(x7,x2),unorthogonal_lines(x2,x5),unorthogonal_lines(x7,x1)
% 21.77/4.88 === Backtracking. Learning clause 49:2:2:[6.2,3.1]:TopTop: convergent_lines(x0,x1) -> convergent_lines(x1,x0)
% 21.77/4.88 === Conflict found: 48:12:8:[21.1,44.3,25.1,24.1,44.2,6.3,22.1,20.1]:TopTopTopTopTopTopTopTop: convergent_lines(x0,x1),unorthogonal_lines(x0,x1),unorthogonal_lines(x2,x3) -> ren4(x4,x3),convergent_lines(x0,x4),ren4(x3,x5),ren4(x6,x5),convergent_lines(x1,x6),ren4(x2,x2),convergent_lines(x7,x2),unorthogonal_lines(x2,x5),unorthogonal_lines(x7,x1) {x0 -> orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1), x1 -> skc2, x2 -> orthogonal_through_point(skc2,skc1), x3 -> orthogonal_through_point(skc2,skc1), x4 -> orthogonal_through_point(orthogonal_through_point(skc2,skc1),skc1), x5 -> skc2, x6 -> skc2, x7 -> orthogonal_through_point(skc2,skc1)}
% 21.77/4.88
% 21.77/4.88 SZS status Unsatisfiable
% 21.77/4.88
% 21.77/4.88 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 21.77/4.88
% 21.77/4.88 SPASS-SCL-FOL Statistics:
% 21.77/4.88 Number of learned clauses: 20
% 21.77/4.88 Number of propagations: 3738
% 21.77/4.88 Number of decisions: 353
% 21.77/4.88 Number of resolutions: 62
% 21.77/4.88 Number of condensations: 1
% 21.77/4.88 Number of sub resolutions: 0
% 21.77/4.88 Number of input literals (deduplicated): 19
% 21.77/4.88 Number of grows: 11
% 21.77/4.88 Number of considered ground atoms: 685
% 21.77/4.88
% 21.77/4.88 Needed: 0:00:04.35
% 21.77/4.88
%------------------------------------------------------------------------------