↑ Up

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

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

% Result   : Theorem 0.48s 0.57s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GEO233+3 : TPTP v9.2.1. Released v4.0.0.
% 0.11/0.12  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.33  % Computer : n031.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit : 300
% 0.16/0.33  % WCLimit  : 300
% 0.16/0.33  % DateTime : Thu May  7 11:58:41 EDT 2026
% 0.16/0.33  % CPUTime  : 
% 0.16/0.33  SPASS-SCL-FOL version:
% 0.16/0.42  SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.48/0.57  Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57  Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57  Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57  Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57  Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57  Execution resolution_2 ended with status: unsatisfiable
% 0.48/0.57  Used heuristic: resolution_2
% 0.48/0.57  
% 0.48/0.57   Input Clauses:
% 0.48/0.57  
% 0.48/0.57   Predicates: unequally_directed_opposite_lines unequally_directed_lines right_apart_point left_apart_point right_convergent_lines left_convergent_lines equally_directed_lines equally_directed_opposite_lines apart_point_and_line convergent_lines divides_points before_on_line distinct_points incident_point_and_line between_on_line distinct_lines point line ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 
% 0.48/0.57   Fol Constants: skc1 
% 0.48/0.57   Fol Functions: reverse_line line_connecting intersection_point parallel_through_point 
% 0.48/0.57   Problem Properties:
% 0.48/0.57   This is a full first-order problem without equality.
% 0.48/0.57  
% 0.48/0.57   After reduction:  Problem Properties:
% 0.48/0.57   This is a full first-order problem without equality.
% 0.48/0.57  
% 0.48/0.57  
% 0.48/0.57   Reduced Input Clauses:
% 0.48/0.57  77:1:2:[53.0,3.1]:TopTop: right_apart_point(x0,x1) -> 
% 0.48/0.57  78:1:2:[55.0,5.1]:TopTop: right_convergent_lines(x0,x1) -> 
% 0.48/0.57  94:2:4:[53.0,71.2,53.0,87.3,53.0,88.4,53.0,89.5,53.0,90.6,53.0,91.7,53.0,92.8,53.0,93.9]:TopTopTopTop: distinct_points(x0,x1),distinct_lines(x2,x3) -> 
% 0.48/0.57  80:1:2:[53.0,11.1,77.0,79.2]:TopTop: apart_point_and_line(x0,x1) -> 
% 0.48/0.57  81:1:3:[53.0,17.1]:TopTopTop: ren1(x0,x1,x2) -> 
% 0.48/0.57  82:1:3:[77.0,20.1]:TopTopTop: ren2(x0,x1,x2) -> 
% 0.48/0.57  84:1:3:[81.0,23.1,82.0,83.2]:TopTopTop: divides_points(x0,x1,x2) -> 
% 0.48/0.57  86:2:2:[55.0,52.2,55.0,85.3]:TopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,reverse_line(x1)) -> 
% 0.48/0.57  
% 0.48/0.57   Most General Atoms: unequally_directed_opposite_lines(x0,x1) right_apart_point(x0,x1) right_convergent_lines(x0,x1) equally_directed_lines(x0,x1) equally_directed_opposite_lines(x0,x1) apart_point_and_line(x0,x1) convergent_lines(x0,x1) ren1(x0,x1,x2) ren2(x0,x1,x2) ren8(x0,x1) divides_points(x0,x1,x2) ren7(x0,x1) incident_point_and_line(x1,x2) ren3(x0,x1,x2,x3) before_on_line(x0,x2,x3) ren4(x0,x3,x2,x1) between_on_line(x0,x3,x2,x1) distinct_points(x0,x2) distinct_lines(x1,x2) unequally_directed_lines(x1,x2) ren5(x0,x2) ren6(x1,x2) left_apart_point(x0,x1) left_convergent_lines(x0,x1) point(x1) line(x1) 
% 0.48/0.57  
% 0.48/0.57  === Starting SPASS-SCL-FOL A Little Less Naive, considering 87 atoms initially, heuristics mode: resolution_2 ===
% 0.48/0.57  
% 0.48/0.57  === Clause set with instances from active satisfied. Growing active. New size: 87
% 0.48/0.57  === Restarting.
% 0.48/0.57  === Backtracking. Learning clause 95:1:2:[26.2,40.1]:TopTop: before_on_line(x0,x1,x1) -> 
% 0.48/0.57  === Clause set with instances from active satisfied. Growing active. New size: 87
% 0.48/0.57  === Restarting.
% 0.48/0.57  === Clause set with instances from active satisfied. Growing active. New size: 91
% 0.48/0.57  === Restarting.
% 0.48/0.57  === Backtracking. Learning clause 96:1:1:[7.1,44.1]:Top: unequally_directed_lines(x0,x0) -> 
% 0.48/0.57  === Clause set with instances from active satisfied. Growing active. New size: 91
% 0.48/0.57  === Restarting.
% 0.48/0.57  === Backtracking. Learning clause 97:1:3:[31.2,95.1]:TopTopTop: ren3(x0,x1,x1,x2) -> 
% 0.48/0.57  === Clause set with instances from active satisfied. Growing active. New size: 155
% 0.48/0.57  === Backtracking. Learning clause 98:2:2:[7.2,51.2]:TopTop: equally_directed_lines(x0,reverse_line(x1)) -> unequally_directed_lines(x0,x1)
% 0.48/0.57  === Clause set with instances from active satisfied. Growing active. New size: 158
% 0.48/0.57  === Restarting.
% 0.48/0.57  === Backtracking. Learning clause 99:1:2:[7.1,70.1,51.2]:TopTop:  -> unequally_directed_lines(parallel_through_point(reverse_line(x0),x1),x0)
% 0.48/0.57  === Clause set with instances from active satisfied. Growing active. New size: 158
% 0.48/0.57  === Restarting.
% 0.48/0.57  === Backtracking. Learning clause 100:1:0:[8.2,76.1]::  -> unequally_directed_lines(reverse_line(reverse_line(skc1)),skc1)
% 0.48/0.57  === Clause set with instances from active satisfied. Growing active. New size: 159
% 0.48/0.57  === Restarting.
% 0.48/0.57  === Backtracking. Learning clause 101:2:2:[45.2,96.1]:TopTop: unequally_directed_lines(x0,x1) -> unequally_directed_lines(x1,x0)
% 0.48/0.57  === Backtracking. Learning clause 102:1:1:[14.2,96.1]:Top: convergent_lines(x0,x0) -> 
% 0.48/0.57  === Conflict found: 86:2:2:[55.0,52.2,55.0,85.3]:TopTop: unequally_directed_lines(x0,x1),unequally_directed_lines(x0,reverse_line(x1)) ->  {x0 -> skc1, x1 -> reverse_line(skc1)}
% 0.48/0.57  
% 0.48/0.57  SZS status Unsatisfiable
% 0.48/0.57  
% 0.48/0.57  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.57  
% 0.48/0.57  SPASS-SCL-FOL Statistics:
% 0.48/0.57  Number of learned clauses: 8
% 0.48/0.57  Number of propagations: 771
% 0.48/0.57  Number of decisions: 224
% 0.48/0.57  Number of resolutions: 14
% 0.48/0.57  Number of condensations: 0
% 0.48/0.57  Number of sub resolutions: 18
% 0.48/0.57  Number of input literals (deduplicated): 44
% 0.48/0.57  Number of grows: 8
% 0.48/0.57  Number of considered ground atoms: 159
% 0.48/0.57  
% 0.48/0.57   Needed:       0:00:00.04
% 0.48/0.57  
%------------------------------------------------------------------------------