↑ Up

CSE_E---1.7.THM-CRf.s

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

% Computer : n014.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:36:57 PM UTC 2026

% Result   : Theorem 0.25s 1.62s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   2 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   44 (  17   ~;  17   |;   4   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   17 (   8 sgn   5   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(x2124,conjecture,
    ( ? [X1] :
        ( big_p(X1)
       => big_q(X1) )
  <=> ( ! [X1] : big_p(X1)
     => ? [X1] : big_q(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2124) ).

fof(i_0_1,negated_conjecture,
    ~ ( ? [X1] :
          ( big_p(X1)
         => big_q(X1) )
    <=> ( ! [X1] : big_p(X1)
       => ? [X1] : big_q(X1) ) ),
    inference(assume_negation,[status(cth)],[x2124]) ).

fof(i_0_2,negated_conjecture,
    ! [X5,X6,X7] :
      ( ( big_p(X6)
        | big_p(X5) )
      & ( ~ big_q(X7)
        | big_p(X5) )
      & ( big_p(X6)
        | ~ big_q(X5) )
      & ( ~ big_q(X7)
        | ~ big_q(X5) )
      & ( ~ big_p(esk1_0)
        | big_q(esk1_0)
        | ~ big_p(esk2_0)
        | big_q(esk3_0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])])]) ).

cnf(i_0_3,negated_conjecture,
    ( big_q(esk1_0)
    | big_q(esk3_0)
    | ~ big_p(esk1_0)
    | ~ big_p(esk2_0) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_4,negated_conjecture,
    ( ~ big_q(X1)
    | ~ big_q(X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_5,negated_conjecture,
    ( big_p(X1)
    | ~ big_q(X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_6,negated_conjecture,
    ( big_p(X2)
    | ~ big_q(X1) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_7,negated_conjecture,
    ( big_p(X1)
    | big_p(X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_8,plain,
    ( big_q(esk3_0)
    | ~ big_p(esk1_0)
    | ~ big_p(esk2_0) ),
    inference(scs_inference,[],[i_0_4,i_0_3]) ).

cnf(i_0_9,plain,
    ( big_q(esk3_0)
    | ~ big_p(esk2_0) ),
    inference(scs_inference,[],[i_0_7,i_0_8]) ).

cnf(i_0_10,plain,
    ~ big_p(esk2_0),
    inference(scs_inference,[],[i_0_9,i_0_4]) ).

cnf(i_0_11,plain,
    $false,
    inference(scs_inference,[],[i_0_10,i_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN373+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33  % Computer : n014.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 08:31:06 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 0.25/1.62  % Version  : CSE_E---1.7
% 0.25/1.62  % Problem  : theBenchmark.p
% 0.25/1.62  % SZS status Theorem for theBenchmark.p
% 0.25/1.62  % SZS output start CNFRefutation
% See solution above
% 0.25/1.64  % Total time : 1.271s
%------------------------------------------------------------------------------