↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1
% Problem  : GEO189+3 : TPTP v9.2.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n005.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.51s 0.58s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO189+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34  % Computer : n005.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Thu May  7 11:56:16 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.17/0.34  SPASS-SCL-FOL version:
% 0.23/0.44  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.51/0.58  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.58  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.58  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.58  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.58  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.58  Execution resolution_1 ended with status: unsatisfiable
% 0.51/0.58  Used heuristic: resolution_1
% 0.51/0.58  
% 0.51/0.58   Input Clauses:
% 0.51/0.58  
% 0.51/0.58   Predicates: distinct_points distinct_lines convergent_lines apart_point_and_line unorthogonal_lines point line equal_points equal_lines parallel_lines incident_point_and_line orthogonal_lines ren1 ren2 ren3 ren4 
% 0.51/0.58   Fol Constants: skc1 skc2 skc3 
% 0.51/0.58   Fol Functions: line_connecting intersection_point parallel_through_point orthogonal_through_point 
% 0.51/0.58   Problem Properties:
% 0.51/0.58   This is a full first-order problem without equality.
% 0.51/0.58  
% 0.51/0.58   After reduction:  Problem Properties:
% 0.51/0.58   This is a full first-order problem without equality.
% 0.51/0.58  
% 0.51/0.58  
% 0.51/0.58   Reduced Input Clauses:
% 0.51/0.58  
% 0.51/0.58   Most General Atoms: distinct_points(x1,x2) convergent_lines(x1,x2) distinct_lines(x2,x3) ren1(x0,x2) ren2(x1,x2) apart_point_and_line(x2,x0) ren3(x0,x1) ren4(x0,x2) unorthogonal_lines(x2,x1) point(x1) line(x1) equal_points(x0,x1) equal_lines(x0,x1) parallel_lines(x0,x1) incident_point_and_line(x0,x1) orthogonal_lines(x0,x1) 
% 0.51/0.58  
% 0.51/0.58  === Starting SPASS-SCL-FOL A Little Less Naive, considering 34 atoms initially, heuristics mode: resolution_1 ===
% 0.51/0.58  
% 0.51/0.58  === Backtracking. Learning clause 54:2:3:[6.3,16.1,15.2]:TopTopTop: distinct_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 0.51/0.58  === Backtracking. Learning clause 55:2:3:[6.3,16.1]:TopTopTop: convergent_lines(x0,parallel_through_point(x1,x2)) -> convergent_lines(x0,x1)
% 0.51/0.58  === Backtracking. Learning clause 56:1:2:[15.2,16.1]:TopTop: distinct_lines(parallel_through_point(x0,x1),x0) -> 
% 0.51/0.58  === Backtracking. Learning clause 57:1:0:[46.2,53.1]::  -> apart_point_and_line(skc2,line_connecting(skc1,skc3))
% 0.51/0.58  === Backtracking. Learning clause 58:1:0:[45.1,52.1]:: apart_point_and_line(skc3,line_connecting(skc1,skc2)) -> 
% 0.51/0.58  === Clause set with instances from active satisfied. Growing active. New size: 44
% 0.51/0.58  === Restarting.
% 0.51/0.58  === Backtracking. Learning clause 59:2:1:[13.1,57.1]:Top:  -> distinct_lines(line_connecting(skc1,skc3),x0),apart_point_and_line(skc2,x0)
% 0.51/0.58  === Backtracking. Learning clause 61:1:0:[50.0,60.0,12.1,57.1,7.2]::  -> distinct_points(skc2,skc1)
% 0.51/0.58  === Clause set with instances from active satisfied. Growing active. New size: 48
% 0.51/0.58  === Restarting.
% 0.51/0.58  === Backtracking. Learning clause 62:5:2:[11.5,58.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.51/0.58  === Clause set with instances from active satisfied. Growing active. New size: 60
% 0.51/0.58  === Restarting.
% 0.51/0.58  === Backtracking. Learning clause 63:2:3:[13.3,17.1,54.1]:TopTopTop: apart_point_and_line(x0,x1) -> convergent_lines(x1,x2)
% 0.51/0.58  === Conflict found: 62:5:2:[11.5,58.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.51/0.58  === Backtracking. Learning clause 66:4:2:[50.0,64.0,49.0,65.1,62.3,7.2,5.3]:TopTop: distinct_lines(x0,line_connecting(skc1,skc2)) -> apart_point_and_line(skc1,x1),apart_point_and_line(skc3,x1),distinct_lines(x0,x1)
% 0.51/0.58  === Conflict found: 62:5:2:[11.5,58.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.51/0.58  === Backtracking. Learning clause 69:3:1:[50.0,67.0,49.0,68.2,62.3,7.2]:Top: distinct_lines(line_connecting(skc1,skc2),x0) -> apart_point_and_line(skc1,x0),apart_point_and_line(skc3,x0)
% 0.51/0.58  === Clause set with instances from active satisfied. Growing active. New size: 72
% 0.51/0.58  === Restarting.
% 0.51/0.58  === Backtracking. Learning clause 70:5:3:[11.4,8.2,7.2]:TopTopTop: distinct_points(x0,x1),distinct_lines(x2,line_connecting(x1,x0)),distinct_points(x1,x0) -> apart_point_and_line(x0,x2),apart_point_and_line(x1,x2)
% 0.51/0.58  
% 0.51/0.58  SZS status Unsatisfiable
% 0.51/0.58  
% 0.51/0.58  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.58  
% 0.51/0.58  SPASS-SCL-FOL Statistics:
% 0.51/0.58  Number of learned clauses: 12
% 0.51/0.58  Number of propagations: 468
% 0.51/0.58  Number of decisions: 129
% 0.51/0.58  Number of resolutions: 25
% 0.51/0.58  Number of condensations: 0
% 0.51/0.58  Number of sub resolutions: 5
% 0.51/0.58  Number of input literals (deduplicated): 36
% 0.51/0.58  Number of grows: 4
% 0.51/0.58  Number of considered ground atoms: 72
% 0.51/0.58  
% 0.51/0.58   Needed:       0:00:00.04
% 0.51/0.58  
%------------------------------------------------------------------------------