↑ Up

PyRes---1.5.THM-Ref.s

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

% Computer : n002.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:48:07 EDT 2024

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   4 unt;   0 def)
%            Number of atoms       :  110 (   0 equ)
%            Maximal formula atoms :   48 (   6 avg)
%            Number of connectives :  146 (  53   ~;  67   |;  20   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 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 : 
%------------------------------------------------------------------------------
fof(pel14,conjecture,
    ( ( p1
    <=> p2 )
  <=> ( ( p2
        | ~ p1 )
      & ( ~ p2
        | p1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel14) ).

fof(c0,negated_conjecture,
    ~ ( ( p1
      <=> p2 )
    <=> ( ( p2
          | ~ p1 )
        & ( ~ p2
          | p1 ) ) ),
    inference(assume_negation,[status(cth)],[pel14]) ).

fof(c1,negated_conjecture,
    ~ ( ( p1
      <=> p2 )
    <=> ( ( p2
          | ~ p1 )
        & ( ~ p2
          | p1 ) ) ),
    inference(fof_simplification,[status(thm)],[c0]) ).

fof(c2,negated_conjecture,
    ( ( ( ( ~ p1
          | ~ p2 )
        & ( p1
          | p2 ) )
      | ( ~ p2
        & p1 )
      | ( p2
        & ~ p1 ) )
    & ( ( ( ~ p1
          | p2 )
        & ( ~ p2
          | p1 ) )
      | ( ( p2
          | ~ p1 )
        & ( ~ p2
          | p1 ) ) ) ),
    inference(fof_nnf,[status(thm)],[c1]) ).

fof(c3,negated_conjecture,
    ( ( ~ p1
      | ~ p2
      | ~ p2
      | p2 )
    & ( ~ p1
      | ~ p2
      | ~ p2
      | ~ p1 )
    & ( ~ p1
      | ~ p2
      | p1
      | p2 )
    & ( ~ p1
      | ~ p2
      | p1
      | ~ p1 )
    & ( p1
      | p2
      | ~ p2
      | p2 )
    & ( p1
      | p2
      | ~ p2
      | ~ p1 )
    & ( p1
      | p2
      | p1
      | p2 )
    & ( p1
      | p2
      | p1
      | ~ p1 )
    & ( ~ p1
      | p2
      | p2
      | ~ p1 )
    & ( ~ p1
      | p2
      | ~ p2
      | p1 )
    & ( ~ p2
      | p1
      | p2
      | ~ p1 )
    & ( ~ p2
      | p1
      | ~ p2
      | p1 ) ),
    inference(distribute,[status(thm)],[c2]) ).

cnf(c5,negated_conjecture,
    ( ~ p1
    | ~ p2
    | ~ p2
    | ~ p1 ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c16,plain,
    ( ~ p1
    | ~ p2 ),
    inference(factor,[status(thm)],[c5]) ).

cnf(c10,negated_conjecture,
    ( p1
    | p2
    | p1
    | p2 ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c17,plain,
    ( p1
    | p2 ),
    inference(factor,[status(thm)],[c10]) ).

cnf(c12,negated_conjecture,
    ( ~ p1
    | p2
    | p2
    | ~ p1 ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c22,plain,
    ( ~ p1
    | p2 ),
    inference(factor,[status(thm)],[c12]) ).

cnf(c24,plain,
    p2,
    inference(resolution,[status(thm)],[c22,c17]) ).

cnf(c25,plain,
    ~ p1,
    inference(resolution,[status(thm)],[c24,c16]) ).

cnf(c15,negated_conjecture,
    ( ~ p2
    | p1
    | ~ p2
    | p1 ),
    inference(split_conjunct,[status(thm)],[c3]) ).

cnf(c26,plain,
    ( ~ p2
    | p1 ),
    inference(factor,[status(thm)],[c15]) ).

cnf(c28,plain,
    p1,
    inference(resolution,[status(thm)],[c26,c24]) ).

cnf(c29,plain,
    $false,
    inference(resolution,[status(thm)],[c28,c25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN392+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.34  % Computer : n002.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed May  8 19:58:23 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.19/0.52  % Version:  1.5
% 0.19/0.52  % SZS status Theorem
% 0.19/0.52  % SZS output start CNFRefutation
% See solution above
% 0.19/0.52  
% 0.19/0.52  % Initial clauses    : 12
% 0.19/0.52  % Processed clauses  : 11
% 0.19/0.52  % Factors computed   : 5
% 0.19/0.52  % Resolvents computed: 9
% 0.19/0.52  % Tautologies deleted: 11
% 0.19/0.52  % Forward subsumed   : 3
% 0.19/0.52  % Backward subsumed  : 8
% 0.19/0.52  % -------- CPU Time ---------
% 0.19/0.52  % User time          : 0.161 s
% 0.19/0.52  % System time        : 0.013 s
% 0.19/0.52  % Total time         : 0.174 s
%------------------------------------------------------------------------------