↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN082+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 : n001.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:05 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel60,conjecture,
    ! [X1] :
      ( big_f(X1,f(X1))
    <=> ? [X2] :
          ( ! [X3] :
              ( big_f(X3,X2)
             => big_f(X3,f(X1)) )
          & big_f(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel60) ).

fof(i_0_1,negated_conjecture,
    ~ ! [X1] :
        ( big_f(X1,f(X1))
      <=> ? [X2] :
            ( ! [X3] :
                ( big_f(X3,X2)
               => big_f(X3,f(X1)) )
            & big_f(X1,X2) ) ),
    inference(assume_negation,[status(cth)],[pel60]) ).

fof(i_0_2,negated_conjecture,
    ! [X8,X11] :
      ( ( big_f(esk2_1(X8),X8)
        | ~ big_f(esk1_0,X8)
        | ~ big_f(esk1_0,f(esk1_0)) )
      & ( ~ big_f(esk2_1(X8),f(esk1_0))
        | ~ big_f(esk1_0,X8)
        | ~ big_f(esk1_0,f(esk1_0)) )
      & ( ~ big_f(X11,esk3_0)
        | big_f(X11,f(esk1_0))
        | big_f(esk1_0,f(esk1_0)) )
      & ( big_f(esk1_0,esk3_0)
        | big_f(esk1_0,f(esk1_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_f(esk2_1(X1),f(esk1_0))
    | ~ big_f(esk1_0,X1)
    | ~ big_f(esk1_0,f(esk1_0)) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_4,negated_conjecture,
    ( big_f(esk2_1(X1),X1)
    | ~ big_f(esk1_0,X1)
    | ~ big_f(esk1_0,f(esk1_0)) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_5,negated_conjecture,
    ( big_f(X1,f(esk1_0))
    | big_f(esk1_0,f(esk1_0))
    | ~ big_f(X1,esk3_0) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_6,negated_conjecture,
    ( big_f(esk1_0,esk3_0)
    | big_f(esk1_0,f(esk1_0)) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_7,plain,
    big_f(esk1_0,f(esk1_0)),
    inference(scs_inference,[],[i_0_6,i_0_5]) ).

cnf(i_0_8,plain,
    ( ~ big_f(esk1_0,X1)
    | ~ big_f(esk2_1(X1),f(esk1_0)) ),
    inference(scs_inference,[],[i_0_7,i_0_3]) ).

cnf(i_0_9,plain,
    ( ~ big_f(esk1_0,X1)
    | big_f(esk2_1(X1),X1) ),
    inference(scs_inference,[],[i_0_7,i_0_4]) ).

cnf(i_0_10,plain,
    ~ big_f(esk2_1(f(esk1_0)),f(esk1_0)),
    inference(scs_inference,[],[i_0_7,i_0_8]) ).

cnf(i_0_11,plain,
    ( ~ big_f(esk1_0,X1)
    | ~ big_f(esk2_1(X1),f(esk1_0)) ),
    inference(rename_variables,[],[i_0_8]) ).

cnf(i_0_12,plain,
    $false,
    inference(scs_inference,[],[i_0_7,i_0_8,i_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN082+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.12  % 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.16/0.33  % Computer : n001.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 08:13:33 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 0.26/1.61  % Version  : CSE_E---1.7
% 0.26/1.61  % Problem  : theBenchmark.p
% 0.26/1.61  % SZS status Theorem for theBenchmark.p
% 0.26/1.61  % SZS output start CNFRefutation
% See solution above
% 0.26/1.63  % Total time : 1.270s
%------------------------------------------------------------------------------