↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN392+1 : TPTP v9.2.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n013.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 : Tue May  5 05:37:00 PM UTC 2026

% Result   : Theorem 0.25s 1.63s
% Output   : CNFRefutation 0.25s
% 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(fof_simplification,[status(thm)],[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)],[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.11/0.13  % Problem    : SYN392+1 : TPTP v9.2.1. Released v2.0.0.
% 0.11/0.13  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.34  % Computer : n013.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue May  5 08:30:56 EDT 2026
% 0.14/0.34  % CPUTime    : 
% 0.14/0.35  % start to proof: theBenchmark
% 0.25/1.63  % Version  : CSE_E---1.7
% 0.25/1.63  % Problem  : theBenchmark.p
% 0.25/1.63  % SZS status Theorem for theBenchmark.p
% 0.25/1.63  % SZS output start CNFRefutation
% See solution above
% 0.25/1.63  % Total time : 1.271s
%------------------------------------------------------------------------------