TSTP Solution File: SYN392+1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN392+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n004.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  : 600s
% DateTime : Thu Jul 21 06:10:37 EDT 2022

% Result   : Theorem 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   3 unt;   0 def)
%            Number of atoms       :   87 (   0 equ)
%            Maximal formula atoms :   48 (   6 avg)
%            Number of connectives :  115 (  42   ~;  56   |;  13   &)
%                                         (   4 <=>;   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/sandbox2/benchmark/theBenchmark.p',pel14) ).

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

fof(c_0_2,negated_conjecture,
    ( ( p2
      | ~ p2
      | ~ p1
      | ~ p2 )
    & ( ~ p1
      | ~ p2
      | ~ p1
      | ~ p2 )
    & ( p2
      | p1
      | ~ p1
      | ~ p2 )
    & ( ~ p1
      | p1
      | ~ p1
      | ~ p2 )
    & ( p2
      | ~ p2
      | p1
      | p2 )
    & ( ~ p1
      | ~ p2
      | p1
      | p2 )
    & ( p2
      | p1
      | p1
      | p2 )
    & ( ~ p1
      | p1
      | p1
      | p2 )
    & ( p2
      | ~ p1
      | ~ p1
      | p2 )
    & ( ~ p2
      | p1
      | ~ p1
      | p2 )
    & ( p2
      | ~ p1
      | ~ p2
      | p1 )
    & ( ~ p2
      | p1
      | ~ p2
      | p1 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])]) ).

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

cnf(c_0_4,negated_conjecture,
    ( p2
    | p1
    | p1
    | p2 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_6,negated_conjecture,
    ( p2
    | ~ p1 ),
    inference(cn,[status(thm)],[c_0_3]) ).

cnf(c_0_7,negated_conjecture,
    ( p1
    | p2 ),
    inference(cn,[status(thm)],[c_0_4]) ).

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

cnf(c_0_9,negated_conjecture,
    ( ~ p1
    | ~ p2 ),
    inference(cn,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    p2,
    inference(csr,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ( p1
    | ~ p2 ),
    inference(cn,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ~ p1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10])]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN392+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33  % Computer : n004.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 16:55:37 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.36  # No SInE strategy applied
% 0.13/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.36  #
% 0.13/0.36  # Presaturation interreduction done
% 0.13/0.36  
% 0.13/0.36  # Proof found!
% 0.13/0.36  # SZS status Theorem
% 0.13/0.36  # SZS output start CNFRefutation
% See solution above
% 0.13/0.36  # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------