↑ Up

SPASS-SCL---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : GEO215+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 : n006.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:06 PM UTC 2026

% Result   : Theorem 1.46s 0.82s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO215+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.18/0.34  % Computer : n006.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Thu May  7 11:55:47 EDT 2026
% 0.18/0.34  % CPUTime  : 
% 0.18/0.34  SPASS-SCL-FOL version:
% 0.20/0.43  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 1.46/0.82  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.46/0.82  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.46/0.82  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.46/0.82  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.46/0.82  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.46/0.82  Execution lmodel_grow ended with status: unsatisfiable
% 1.46/0.82  Used heuristic: lmodel_grow
% 1.46/0.82  
% 1.46/0.82   Input Clauses:
% 1.46/0.82  
% 1.46/0.82   Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line unorthogonal_lines ren1 ren2 ren3 ren4 
% 1.46/0.82   Fol Constants: skc1 skc2 skc3 
% 1.46/0.82   Fol Functions: line_connecting intersection_point parallel_through_point orthogonal_through_point 
% 1.46/0.82   Problem Properties:
% 1.46/0.82   This is a full first-order problem without equality.
% 1.46/0.82  
% 1.46/0.82   After reduction:  Problem Properties:
% 1.46/0.82   This is a full first-order problem without equality.
% 1.46/0.82  
% 1.46/0.82  
% 1.46/0.82   Reduced Input Clauses:
% 1.46/0.82  
% 1.46/0.82   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) 
% 1.46/0.82  
% 1.46/0.82  === Starting SPASS-SCL-FOL A Little Less Naive, considering 57 atoms initially, heuristics mode: lmodel_grow ===
% 1.46/0.82  
% 1.46/0.82  === Clause set with instances from active satisfied. Growing active. New size: 73
% 1.46/0.82  === Backtracking. Learning clause 32:4:3:[25.3,22.1]:TopTopTop: convergent_lines(x0,x1),unorthogonal_lines(x0,x1) -> ren4(x1,x2),unorthogonal_lines(x0,x2)
% 1.46/0.82  === Clause set with instances from active satisfied. Growing active. New size: 99
% 1.46/0.82  === Conflict found: 32:4:3:[25.3,22.1]:TopTopTop: convergent_lines(x0,x1),unorthogonal_lines(x0,x1) -> ren4(x1,x2),unorthogonal_lines(x0,x2) {x0 -> skc1, x1 -> skc2, x2 -> skc3}
% 1.46/0.82  === Backtracking. Learning clause 34:3:3:[23.1,33.0,32.3,24.1,24.2]:TopTopTop: ren4(x0,x1) -> unorthogonal_lines(x0,x2),unorthogonal_lines(x1,x2)
% 1.46/0.82  === Conflict found: 34:3:3:[23.1,33.0,32.3,24.1,24.2]:TopTopTop: ren4(x0,x1) -> unorthogonal_lines(x0,x2),unorthogonal_lines(x1,x2) {x0 -> skc2, x1 -> skc1, x2 -> skc3}
% 1.46/0.82  === Backtracking. Learning clause 36:2:1:[23.1,35.0,34.2,31.1,25.4,30.1,24.2]:Top: ren4(x0,skc2) -> ren3(x0,skc1)
% 1.46/0.82  === Backtracking. Learning clause 37:3:1:[25.1,29.1,22.1]:Top: unorthogonal_lines(skc1,skc2) -> ren4(skc2,x0),unorthogonal_lines(skc1,x0)
% 1.46/0.82  === Clause set with instances from active satisfied. Growing active. New size: 122
% 1.46/0.82  === Backtracking. Learning clause 39:3:3:[22.1,38.1,21.2,32.1]:TopTopTop: ren3(x0,x1) -> ren4(x1,x2),unorthogonal_lines(x0,x2)
% 1.46/0.82  === Backtracking. Learning clause 40:3:1:[25.1,29.1]:Top: unorthogonal_lines(skc1,skc2) -> ren3(skc1,x0),ren4(skc2,x0)
% 1.46/0.82  === Clause set with instances from active satisfied. Growing active. New size: 144
% 1.46/0.82  === Backtracking. Learning clause 42:3:3:[23.1,41.0,25.3,21.1,24.2]:TopTopTop: ren4(x0,x1) -> ren4(x1,x2),convergent_lines(x0,x2)
% 1.46/0.82  === Backtracking. Learning clause 43:5:4:[25.4,42.1]:TopTopTopTop: convergent_lines(x0,x1),unorthogonal_lines(x0,x1) -> ren3(x0,x2),ren4(x2,x3),convergent_lines(x1,x3)
% 1.46/0.82  === Clause set with instances from active satisfied. Growing active. New size: 169
% 1.46/0.82  === Clause set with instances from active satisfied. Growing active. New size: 186
% 1.46/0.82  === Clause set with instances from active satisfied. Growing active. New size: 211
% 1.46/0.82  === Backtracking. Learning clause 44:6:5:[15.2,28.1]:TopTopTopTopTop: apart_point_and_line(x0,x1) -> apart_point_and_line(x0,x2),apart_point_and_line(x3,x1),apart_point_and_line(x3,x2),unorthogonal_lines(x1,x4),unorthogonal_lines(x2,x4)
% 1.46/0.82  === Backtracking. Learning clause 45:1:0:[24.1,37.2,31.1,30.1]:: unorthogonal_lines(skc1,skc2) -> 
% 1.46/0.82  === Clause set with instances from active satisfied. Growing active. New size: 235
% 1.46/0.82  === Backtracking. Learning clause 46:3:3:[16.1,6.2]:TopTopTop: convergent_lines(x0,x1) -> distinct_lines(x0,x2),convergent_lines(x1,x2)
% 1.46/0.82  === Clause set with instances from active satisfied. Growing active. New size: 267
% 1.46/0.82  === Backtracking. Learning clause 47:8:7:[14.2,4.1,44.2]:TopTopTopTopTopTopTop: apart_point_and_line(x0,x1) -> apart_point_and_line(x2,x3),distinct_points(x0,x4),distinct_points(x2,x4),apart_point_and_line(x5,x1),apart_point_and_line(x5,x3),unorthogonal_lines(x1,x6),unorthogonal_lines(x3,x6)
% 1.46/0.82  === Backtracking. Learning clause 49:4:4:[16.1,48.0,28.3,11.1,10.1,12.2]:TopTopTopTop: convergent_lines(x0,x1) -> unorthogonal_lines(x0,x2),unorthogonal_lines(x1,x2),distinct_points(x3,intersection_point(x0,x1))
% 1.46/0.82  === Conflict found: 43:5:4:[25.4,42.1]:TopTopTopTop: convergent_lines(x0,x1),unorthogonal_lines(x0,x1) -> ren3(x0,x2),ren4(x2,x3),convergent_lines(x1,x3) {x0 -> skc3, x1 -> skc2, x2 -> skc3, x3 -> skc2}
% 1.46/0.82  
% 1.46/0.82  SZS status Unsatisfiable
% 1.46/0.82  
% 1.46/0.82  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.46/0.82  
% 1.46/0.82  SPASS-SCL-FOL Statistics:
% 1.46/0.82  Number of learned clauses: 13
% 1.46/0.82  Number of propagations: 1021
% 1.46/0.82  Number of decisions: 204
% 1.46/0.82  Number of resolutions: 38
% 1.46/0.82  Number of condensations: 0
% 1.46/0.82  Number of sub resolutions: 5
% 1.46/0.82  Number of input literals (deduplicated): 21
% 1.46/0.82  Number of grows: 9
% 1.46/0.82  Number of considered ground atoms: 267
% 1.46/0.82  
% 1.46/0.82   Needed:       0:00:00.26
% 1.46/0.82  
%------------------------------------------------------------------------------