↑ Up

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

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

% Result   : Theorem 0.84s 0.69s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GEO188+2 : TPTP v9.2.1. Released v3.3.0.
% 0.11/0.13  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34  % Computer : n027.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:35 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.16/0.34  SPASS-SCL-FOL version:
% 0.20/0.45  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.84/0.69  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.84/0.69  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.84/0.69  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.84/0.69  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.84/0.69  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.84/0.69  Execution resolution_3 ended with status: unsatisfiable
% 0.84/0.69  Used heuristic: resolution_3
% 0.84/0.69  
% 0.84/0.69   Input Clauses:
% 0.84/0.69  
% 0.84/0.69   Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line ren1 ren2 
% 0.84/0.69   Fol Constants: skc1 skc2 skc3 
% 0.84/0.69   Fol Functions: line_connecting intersection_point 
% 0.84/0.69   Problem Properties:
% 0.84/0.69   This is a full first-order problem without equality.
% 0.84/0.69  
% 0.84/0.69   After reduction:  Problem Properties:
% 0.84/0.69   This is a full first-order problem without equality.
% 0.84/0.69  
% 0.84/0.69  
% 0.84/0.69   Reduced Input Clauses:
% 0.84/0.69  
% 0.84/0.69   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.84/0.69  
% 0.84/0.69  === Starting SPASS-SCL-FOL A Little Less Naive, considering 21 atoms initially, heuristics mode: resolution_3 ===
% 0.84/0.69  
% 0.84/0.69  === Backtracking. Learning clause 22:2:1:[15.1,21.1]:Top:  -> distinct_lines(line_connecting(skc3,skc2),x0),apart_point_and_line(skc1,x0)
% 0.84/0.69  === Backtracking. Learning clause 23:2:0:[9.2,21.1]:: distinct_points(skc3,skc2) -> ren1(skc1,skc3,skc2)
% 0.84/0.69  === Backtracking. Learning clause 24:5:2:[13.5,20.1]:TopTop: distinct_points(x0,skc3),distinct_lines(line_connecting(skc1,skc2),x1) -> apart_point_and_line(x0,line_connecting(skc1,skc2)),apart_point_and_line(x0,x1),apart_point_and_line(skc3,x1)
% 0.84/0.69  === Clause set with instances from active satisfied. Growing active. New size: 25
% 0.84/0.69  === Restarting.
% 0.84/0.69  === Conflict found: 24:5:2:[13.5,20.1]:TopTop: distinct_points(x0,skc3),distinct_lines(line_connecting(skc1,skc2),x1) -> apart_point_and_line(x0,line_connecting(skc1,skc2)),apart_point_and_line(x0,x1),apart_point_and_line(skc3,x1) {x0 -> skc1, x1 -> skc1}
% 0.84/0.69  === Backtracking. Learning clause 26:6:3:[17.0,25.1,24.3,9.2,5.3]:TopTopTop: distinct_points(x0,skc3),distinct_lines(x1,line_connecting(skc1,skc2)) -> apart_point_and_line(x0,x2),apart_point_and_line(skc3,x2),ren1(x0,skc1,skc2),distinct_lines(x1,x2)
% 0.84/0.69  === Conflict found: 24:5:2:[13.5,20.1]:TopTop: distinct_points(x0,skc3),distinct_lines(line_connecting(skc1,skc2),x1) -> apart_point_and_line(x0,line_connecting(skc1,skc2)),apart_point_and_line(x0,x1),apart_point_and_line(skc3,x1) {x0 -> skc1, x1 -> skc1}
% 0.84/0.69  === Backtracking. Learning clause 28:5:2:[17.0,27.2,24.3,9.2]:TopTop: distinct_points(x0,skc3),distinct_lines(line_connecting(skc1,skc2),x1) -> apart_point_and_line(x0,x1),apart_point_and_line(skc3,x1),ren1(x0,skc1,skc2)
% 0.84/0.69  === Clause set with instances from active satisfied. Growing active. New size: 29
% 0.84/0.69  === Restarting.
% 0.84/0.69  === Clause set with instances from active satisfied. Growing active. New size: 83
% 0.84/0.69  === Clause set with instances from active satisfied. Growing active. New size: 147
% 0.84/0.69  === Backtracking. Learning clause 29:4:4:[5.1,15.2]:TopTopTopTop: apart_point_and_line(x0,x1) -> distinct_lines(x1,x2),distinct_lines(x3,x2),apart_point_and_line(x0,x3)
% 0.84/0.69  === Clause set with instances from active satisfied. Growing active. New size: 211
% 0.84/0.69  === Backtracking. Learning clause 30:6:3:[14.1,28.3]:TopTopTop: distinct_points(x0,skc3),distinct_lines(line_connecting(skc1,skc2),x1) -> distinct_points(x0,x2),apart_point_and_line(x2,x1),apart_point_and_line(skc3,x1),ren1(x0,skc1,skc2)
% 0.84/0.69  === Clause set with instances from active satisfied. Growing active. New size: 275
% 0.84/0.69  === Backtracking. Learning clause 33:2:0:[17.0,31.1,1.0,32.2,9.3,8.1,13.4,9.2,9.2,7.1,29.3,8.1,1.1,2.1,19.1,20.1,21.1]:: distinct_points(skc3,skc2) -> apart_point_and_line(skc1,line_connecting(skc1,skc2))
% 0.84/0.69  === Backtracking. Learning clause 36:1:0:[17.0,34.0,1.0,35.2,9.3,7.1,33.2]:: distinct_points(skc3,skc2) -> 
% 0.84/0.69  
% 0.84/0.69  SZS status Unsatisfiable
% 0.84/0.69  
% 0.84/0.69  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.84/0.69  
% 0.84/0.69  SPASS-SCL-FOL Statistics:
% 0.84/0.69  Number of learned clauses: 9
% 0.84/0.69  Number of propagations: 396
% 0.84/0.69  Number of decisions: 160
% 0.84/0.69  Number of resolutions: 25
% 0.84/0.69  Number of condensations: 0
% 0.84/0.69  Number of sub resolutions: 6
% 0.84/0.69  Number of input literals (deduplicated): 16
% 0.84/0.69  Number of grows: 6
% 0.84/0.69  Number of considered ground atoms: 275
% 0.84/0.69  
% 0.84/0.69   Needed:       0:00:00.12
% 0.84/0.69  
%------------------------------------------------------------------------------