↑ Up

SPASS-SCL---0.1.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS-SCL---0.1.1
% Problem  : LCL181+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 01:09:04 PM UTC 2026

% Result   : Theorem 0.13s 0.36s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   2 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   37 (  16   ~;   9   |;   3   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    3 (   2 usr;   3 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
% FILE RECORD
fof(pel4,conjecture,
    ( ( ~ p
     => q )
  <=> ( ~ q
     => p ) ),
    file('theBenchmark.p',pel4) ).

% NEGATING CONJECTURE
fof(pel4_nc,negated_conjecture,
    ~ ( ( ~ p
       => q )
    <=> ( ~ q
       => p ) ),
    inference(negating_conjecture,[status(cth)],[pel4]) ).

% FOF SIMPLE INFERENCE
fof(pel4_nc_elimTB,negated_conjecture,
    ~ ( ( ~ p
       => q )
    <=> ( ~ q
       => p ) ),
    inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[pel4_nc])]) ).

% FOF SIMPLE INFERENCE
fof(pel4_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
    ( ( ( ~ p
        & ~ q )
      | ( ~ q
        & ~ p ) )
    & ( p
      | q
      | q
      | p ) ),
    inference(elimImpEquivPushNegMiniScope,[status(thm)],[pel4_nc_elimTB]) ).

% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
    ( ~ q
    | ~ q ),
    inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[pel4_nc_elimImpEquivPushNegMiniScope])]) ).

% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
    ( p
    | q
    | q
    | p ),
    inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[pel4_nc_elimImpEquivPushNegMiniScope])]) ).

% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
    ( ~ p
    | ~ p ),
    inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[pel4_nc_elimImpEquivPushNegMiniScope])]) ).

% CNF SPASS RESOLUTION.
cnf(c_6,plain,
    p,
    inference(resolution,[status(thm)],[c_3,c_5]) ).

% CNF SPASS RESOLUTION.
cnf(c_7,plain,
    $false,
    inference(resolution,[status(thm)],[c_3,c_5,c_2,c_6]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL181+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n016.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Fri Sep  4 23:27:28 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36  
% 0.13/0.36  % Input Clauses:
% 0.13/0.36  % 1:2:0:INP:: p,q -> 
% 0.13/0.36  % 2:2:0:INP:: p,p -> 
% 0.13/0.36  % 3:2:0:INP:: q,q -> 
% 0.13/0.36  % 4:2:0:INP:: q,p -> 
% 0.13/0.36  % 5:4:0:INP::  -> p,q,q,p
% 0.13/0.36  
% 0.13/0.36  % Predicates: p q 
% 0.13/0.36  % Fol Constants: a 
% 0.13/0.36  % Fol Functions: 
% 0.13/0.36  % Problem Properties:
% 0.13/0.36  % This is a propositional problem.
% 0.13/0.36  
% 0.13/0.36  
% 0.13/0.36  % Reduced Input Axiom Clauses:
% 0.13/0.36  
% 0.13/0.36  % Reduced Input Conjecture Clauses:
% 0.13/0.36  % 7:0:0:[3.0,5.0,2.0,6.1]::  -> 
% 0.13/0.36  % 2:1:0:INP:: p -> 
% 0.13/0.36  % 3:1:0:INP:: q -> 
% 0.13/0.36  % 4:2:0:INP:: q,p -> 
% 0.13/0.36  
% 0.13/0.36  % SZS status Theorem
% 0.13/0.36  
% 0.13/0.36  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.36  
% 0.13/0.36  % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36  
% 0.13/0.36  % SPASS-SCL-FOL Statistics:
% 0.13/0.36  % Number of learned clauses: 0
% 0.13/0.36  % Number of propagations: 0
% 0.13/0.36  % Number of decisions: 0
% 0.13/0.36  % Number of resolutions: 0
% 0.13/0.36  % Number of condensations: 0
% 0.13/0.36  % Number of sub resolutions: 2
% 0.13/0.36  
% 0.13/0.36  % Needed:       0:00:00.00
% 0.13/0.36  
% 0.13/0.36  % ###
% 0.13/0.36  % ### Pagesize: 8192
% 0.13/0.36  % ### Marksize: 0
% 0.13/0.36  % ### Memory demanded:  69 KBytes
% 0.13/0.36  % ### Memory freed:     69 KBytes
% 0.13/0.36  % ### Memory remaining: 0 Bytes
% 0.13/0.36  % ### Pages allocated:  49 Pages
% 0.13/0.36  % ###
%------------------------------------------------------------------------------