↑ Up

CSE_E---1.7.THM-CRf.s

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

% Result   : Theorem 0.27s 1.62s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   69 (   0 equ)
%            Maximal formula atoms :   22 (   3 avg)
%            Number of connectives :   73 (  22   ~;  26   |;  11   &)
%                                         (   4 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-4 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   39 (   6 sgn   8   !;   4   ?)

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

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

fof(i_0_2,negated_conjecture,
    ! [X13,X14] :
      ( big_f(esk1_0,X14,esk1_0,esk3_2(X13,X14))
      & ( ~ big_f(esk1_0,X13,esk1_0,X14)
        | big_f(X13,esk2_0,X13,X14) )
      & ( ~ big_f(X13,esk2_0,X13,X14)
        | big_f(esk1_0,X13,esk1_0,X14) )
      & big_f(esk1_0,X13,esk1_0,X14)
      & ( big_f(esk1_0,esk3_2(X13,X14),X13,esk3_2(X13,X14))
        | big_f(esk1_0,X14,X13,X14) )
      & ( ~ big_f(esk1_0,X13,esk1_0,X14)
        | ~ big_f(esk1_0,X14,X13,X14)
        | big_f(esk1_0,X14,X13,X14) )
      & ( big_f(esk1_0,X13,esk1_0,X14)
        | big_f(esk1_0,X14,X13,X14)
        | big_f(esk1_0,X14,X13,X14) )
      & ( big_f(esk1_0,esk3_2(X13,X14),X13,esk3_2(X13,X14))
        | ~ big_f(esk1_0,esk3_2(X13,X14),X13,esk3_2(X13,X14)) )
      & ( ~ big_f(esk1_0,X13,esk1_0,X14)
        | ~ big_f(esk1_0,X14,X13,X14)
        | ~ big_f(esk1_0,esk3_2(X13,X14),X13,esk3_2(X13,X14)) )
      & ( big_f(esk1_0,X13,esk1_0,X14)
        | big_f(esk1_0,X14,X13,X14)
        | ~ big_f(esk1_0,esk3_2(X13,X14),X13,esk3_2(X13,X14)) ) ),
    inference(distribute,[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(esk1_0,X1,esk1_0,X2)
    | big_f(esk1_0,X2,X1,X2)
    | big_f(esk1_0,X2,X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]) ).

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

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

cnf(i_0_6,negated_conjecture,
    ( big_f(esk1_0,X1,esk1_0,X2)
    | ~ big_f(X1,esk2_0,X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_7,negated_conjecture,
    ( big_f(X1,esk2_0,X1,X2)
    | ~ big_f(esk1_0,X1,esk1_0,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_8,negated_conjecture,
    ( big_f(esk1_0,esk3_2(X1,X2),X1,esk3_2(X1,X2))
    | big_f(esk1_0,X2,X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_9,negated_conjecture,
    ( big_f(esk1_0,X2,X1,X2)
    | big_f(esk1_0,X1,esk1_0,X2) ),
    inference(cn,[status(thm)],[i_0_3]),
    [final] ).

cnf(i_0_10,negated_conjecture,
    big_f(esk1_0,X1,esk1_0,esk3_2(X2,X1)),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_11,negated_conjecture,
    big_f(esk1_0,X1,esk1_0,X2),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_12,plain,
    big_f(X1,esk2_0,X1,X2),
    inference(scs_inference,[],[i_0_11,i_0_7]) ).

cnf(i_0_13,plain,
    ( ~ big_f(esk1_0,X1,esk1_0,X2)
    | big_f(X1,esk2_0,X1,X2) ),
    inference(rename_variables,[],[i_0_7]) ).

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

cnf(i_0_15,plain,
    big_f(esk1_0,X1,esk1_0,X2),
    inference(rename_variables,[],[i_0_11]) ).

cnf(i_0_16,plain,
    ( ~ big_f(esk1_0,esk3_2(X1,X2),X1,esk3_2(X1,X2))
    | ~ big_f(esk1_0,X1,esk1_0,X2)
    | ~ big_f(esk1_0,X2,X1,X2) ),
    inference(rename_variables,[],[i_0_4]) ).

cnf(i_0_17,plain,
    $false,
    inference(scs_inference,[],[i_0_11,i_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN351+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 : n005.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:29:00 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 0.27/1.62  % Version  : CSE_E---1.7
% 0.27/1.62  % Problem  : theBenchmark.p
% 0.27/1.62  % SZS status Theorem for theBenchmark.p
% 0.27/1.62  % SZS output start CNFRefutation
% See solution above
% 0.27/1.64  % Total time : 1.271s
%------------------------------------------------------------------------------