↑ Up

PyRes---1.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SYN047+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n026.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  9 17:47:10 EDT 2024

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   21 (   6 unt;   0 def)
%            Number of atoms       :  204 (   0 equ)
%            Maximal formula atoms :  114 (   9 avg)
%            Number of connectives :  278 (  95   ~; 129   |;  45   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   37 (   5 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    5 (   4 usr;   5 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel17,conjecture,
    ( ( ( p
        & ( q
         => r ) )
     => s )
  <=> ( ( ~ p
        | q
        | s )
      & ( ~ p
        | ~ r
        | s ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel17) ).

fof(c0,negated_conjecture,
    ~ ( ( ( p
          & ( q
           => r ) )
       => s )
    <=> ( ( ~ p
          | q
          | s )
        & ( ~ p
          | ~ r
          | s ) ) ),
    inference(assume_negation,[status(cth)],[pel17]) ).

fof(c1,negated_conjecture,
    ~ ( ( ( p
          & ( q
           => r ) )
       => s )
    <=> ( ( ~ p
          | q
          | s )
        & ( ~ p
          | ~ r
          | s ) ) ),
    inference(fof_simplification,[status(thm)],[c0]) ).

fof(c2,negated_conjecture,
    ( ( ( p
        & ( ~ q
          | r )
        & ~ s )
      | ( p
        & ~ q
        & ~ s )
      | ( p
        & r
        & ~ s ) )
    & ( ~ p
      | ( q
        & ~ r )
      | s
      | ( ( ~ p
          | q
          | s )
        & ( ~ p
          | ~ r
          | s ) ) ) ),
    inference(fof_nnf,[status(thm)],[c1]) ).

fof(c3,negated_conjecture,
    ( ( p
      | p
      | p )
    & ( p
      | p
      | r )
    & ( p
      | p
      | ~ s )
    & ( p
      | ~ q
      | p )
    & ( p
      | ~ q
      | r )
    & ( p
      | ~ q
      | ~ s )
    & ( p
      | ~ s
      | p )
    & ( p
      | ~ s
      | r )
    & ( p
      | ~ s
      | ~ s )
    & ( ~ q
      | r
      | p
      | p )
    & ( ~ q
      | r
      | p
      | r )
    & ( ~ q
      | r
      | p
      | ~ s )
    & ( ~ q
      | r
      | ~ q
      | p )
    & ( ~ q
      | r
      | ~ q
      | r )
    & ( ~ q
      | r
      | ~ q
      | ~ s )
    & ( ~ q
      | r
      | ~ s
      | p )
    & ( ~ q
      | r
      | ~ s
      | r )
    & ( ~ q
      | r
      | ~ s
      | ~ s )
    & ( ~ s
      | p
      | p )
    & ( ~ s
      | p
      | r )
    & ( ~ s
      | p
      | ~ s )
    & ( ~ s
      | ~ q
      | p )
    & ( ~ s
      | ~ q
      | r )
    & ( ~ s
      | ~ q
      | ~ s )
    & ( ~ s
      | ~ s
      | p )
    & ( ~ s
      | ~ s
      | r )
    & ( ~ s
      | ~ s
      | ~ s )
    & ( ~ p
      | q
      | s
      | ~ p
      | q
      | s )
    & ( ~ p
      | q
      | s
      | ~ p
      | ~ r
      | s )
    & ( ~ p
      | ~ r
      | s
      | ~ p
      | q
      | s )
    & ( ~ p
      | ~ r
      | s
      | ~ p
      | ~ r
      | s ) ),
    inference(distribute,[status(thm)],[c2]) ).

cnf(c30,negated_conjecture,
    ( ~ s
    | ~ s
    | ~ s ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c40,plain,
    ~ s,
    inference(factor,[status(thm)],[c30]) ).

cnf(c4,negated_conjecture,
    ( p
    | p
    | p ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c35,plain,
    p,
    inference(factor,[status(thm)],[c4]) ).

cnf(c17,negated_conjecture,
    ( ~ q
    | r
    | ~ q
    | r ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c42,plain,
    ( ~ q
    | r ),
    inference(factor,[status(thm)],[c17]) ).

cnf(c31,negated_conjecture,
    ( ~ p
    | q
    | s
    | ~ p
    | q
    | s ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c43,plain,
    ( ~ p
    | q
    | s ),
    inference(factor,[status(thm)],[c31]) ).

cnf(c45,plain,
    ( q
    | s ),
    inference(resolution,[status(thm)],[c43,c35]) ).

cnf(c47,plain,
    q,
    inference(resolution,[status(thm)],[c45,c40]) ).

cnf(c48,plain,
    r,
    inference(resolution,[status(thm)],[c47,c42]) ).

cnf(c34,negated_conjecture,
    ( ~ p
    | ~ r
    | s
    | ~ p
    | ~ r
    | s ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c49,plain,
    ( ~ p
    | ~ r
    | s ),
    inference(factor,[status(thm)],[c34]) ).

cnf(c51,plain,
    ( ~ p
    | s ),
    inference(resolution,[status(thm)],[c49,c48]) ).

cnf(c52,plain,
    s,
    inference(resolution,[status(thm)],[c51,c35]) ).

cnf(c53,plain,
    $false,
    inference(resolution,[status(thm)],[c52,c40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN047+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed May  8 20:31:53 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.20/0.52  % Version:  1.5
% 0.20/0.52  % SZS status Theorem
% 0.20/0.52  % SZS output start CNFRefutation
% See solution above
% 0.20/0.52  
% 0.20/0.52  % Initial clauses    : 31
% 0.20/0.52  % Processed clauses  : 20
% 0.20/0.52  % Factors computed   : 10
% 0.20/0.52  % Resolvents computed: 9
% 0.20/0.52  % Tautologies deleted: 0
% 0.20/0.52  % Forward subsumed   : 29
% 0.20/0.52  % Backward subsumed  : 15
% 0.20/0.52  % -------- CPU Time ---------
% 0.20/0.52  % User time          : 0.166 s
% 0.20/0.52  % System time        : 0.012 s
% 0.20/0.52  % Total time         : 0.178 s
%------------------------------------------------------------------------------