%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1 % Problem : GEO195+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 : n018.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.44s 0.58s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : GEO195+2 : TPTP v9.2.1. Released v3.3.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.17/0.35 % Computer : n018.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Thu May 7 11:56:02 EDT 2026 % 0.17/0.35 % CPUTime : % 0.17/0.35 SPASS-SCL-FOL version: % 0.21/0.45 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode] % 0.44/0.58 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.44/0.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.44/0.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.44/0.58 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.44/0.58 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.44/0.58 Execution resolution_1 ended with status: unsatisfiable % 0.44/0.58 Used heuristic: resolution_1 % 0.44/0.58 % 0.44/0.58 Input Clauses: % 0.44/0.58 % 0.44/0.58 Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line ren1 ren2 % 0.44/0.58 Fol Constants: skc1 skc2 skc3 % 0.44/0.58 Fol Functions: line_connecting intersection_point % 0.44/0.58 Problem Properties: % 0.44/0.58 This is a full first-order problem without equality. % 0.44/0.58 % 0.44/0.58 After reduction: Problem Properties: % 0.44/0.58 This is a full first-order problem without equality. % 0.44/0.58 % 0.44/0.58 % 0.44/0.58 Reduced Input Clauses: % 0.44/0.58 % 0.44/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.44/0.58 % 0.44/0.58 === Starting SPASS-SCL-FOL A Little Less Naive, considering 27 atoms initially, heuristics mode: resolution_1 === % 0.44/0.58 % 0.44/0.58 === Backtracking. Learning clause 22:1:0:[16.1,17.1]:: -> distinct_lines(skc1,skc2) % 0.44/0.58 === Backtracking. Learning clause 23:1:0:[16.1,19.1]:: -> distinct_lines(skc1,skc3) % 0.44/0.58 === Backtracking. Learning clause 24:1:0:[16.1,18.1]:: -> distinct_lines(skc3,skc2) % 0.44/0.58 === Backtracking. Learning clause 25:2:1:[14.1,20.1]:Top: -> distinct_points(intersection_point(skc1,skc2),x0),apart_point_and_line(x0,skc3) % 0.44/0.58 === Backtracking. Learning clause 26:5:2:[13.4,21.1]:TopTop: distinct_points(intersection_point(skc2,skc1),x0),distinct_lines(x1,skc3) -> apart_point_and_line(intersection_point(skc2,skc1),x1),apart_point_and_line(x0,x1),apart_point_and_line(x0,skc3) % 0.44/0.58 === Clause set with instances from active satisfied. Growing active. New size: 37 % 0.44/0.58 === Restarting. % 0.44/0.58 === Backtracking. Learning clause 27:6:3:[15.1,15.3,21.1,26.3]:TopTopTop: distinct_points(intersection_point(skc2,skc1),x0),distinct_lines(x1,skc3) -> distinct_lines(x2,skc3),distinct_lines(x1,x2),apart_point_and_line(x0,x1),apart_point_and_line(x0,skc3) % 0.44/0.58 === Clause set with instances from active satisfied. Growing active. New size: 91 % 0.44/0.58 === Backtracking. Learning clause 29:5:2:[23.0,28.1,12.3,1.1,11.2,26.3,4.3]:TopTop: convergent_lines(skc2,skc1),distinct_points(x0,intersection_point(skc2,skc1)) -> apart_point_and_line(x1,skc1),apart_point_and_line(x1,skc3),distinct_points(x0,x1) % 0.44/0.58 === Backtracking. Learning clause 30:2:2:[12.3,1.1,11.2]:TopTop: convergent_lines(x0,x1),apart_point_and_line(intersection_point(x0,x1),x1) -> % 0.44/0.58 === Backtracking. Learning clause 31:3:3:[12.1,6.3,11.2,1.1]:TopTopTop: convergent_lines(x0,x1),apart_point_and_line(intersection_point(x1,x2),x2) -> convergent_lines(x0,x2) % 0.44/0.58 === Backtracking. Learning clause 32:4:4:[12.1,6.3]:TopTopTopTop: ren2(x0,x1,x2),convergent_lines(x3,x1) -> distinct_points(x0,intersection_point(x1,x2)),convergent_lines(x3,x2) % 0.44/0.58 === Clause set with instances from active satisfied. Growing active. New size: 155 % 0.44/0.58 === Backtracking. Learning clause 33:6:4:[13.6,30.2]:TopTopTopTop: distinct_points(x0,intersection_point(x1,x2)),distinct_lines(x3,x2),convergent_lines(x1,x2) -> apart_point_and_line(x0,x3),apart_point_and_line(x0,x2),apart_point_and_line(intersection_point(x1,x2),x3) % 0.44/0.58 % 0.44/0.58 SZS status Unsatisfiable % 0.44/0.58 % 0.44/0.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.44/0.58 % 0.44/0.58 SPASS-SCL-FOL Statistics: % 0.44/0.58 Number of learned clauses: 11 % 0.44/0.58 Number of propagations: 254 % 0.44/0.58 Number of decisions: 66 % 0.44/0.58 Number of resolutions: 33 % 0.44/0.58 Number of condensations: 0 % 0.44/0.58 Number of sub resolutions: 1 % 0.44/0.58 Number of input literals (deduplicated): 16 % 0.44/0.58 Number of grows: 3 % 0.44/0.58 Number of considered ground atoms: 155 % 0.44/0.58 % 0.44/0.58 Needed: 0:00:00.01 % 0.44/0.58 %------------------------------------------------------------------------------