↑ Up

CSE_E---1.7.THM-CRf.s

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

% Result   : Theorem 1.24s 1.72s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   4 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   31 (  10   ~;   8   |;   3   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   37 (  10 sgn  16   !;   6   ?)

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

fof(c_0_1,negated_conjecture,
    ~ ? [X1,X2] :
        ( ( ? [X3] : big_f(X1,X3)
         => ! [X3] : big_g(X1,X3) )
       => ( ! [X3] :
              ( big_g(X3,X3)
             => big_f(X3,X2) )
         => ( big_f(X1,X2)
          <=> ! [X3] : big_g(X1,X3) ) ) ),
    inference(assume_negation,[status(cth)],[church_46_3_2]) ).

fof(c_0_2,negated_conjecture,
    ! [X10,X11,X12,X13,X14,X15,X16,X18,X19,X20] :
      ( ( ~ big_f(X10,X11)
        | big_g(X10,X12) )
      & ( ~ big_g(X14,X14)
        | big_f(X14,X13) )
      & ( ~ big_f(X15,X16)
        | ~ big_g(X15,esk1_1(X15)) )
      & ( big_f(X18,X19)
        | big_g(X18,X20) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( big_f(X1,X2)
    | ~ big_g(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( big_f(X1,X2)
    | big_g(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_g(X1,esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    big_f(X1,X2),
    inference(csr,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( big_g(X1,X3)
    | ~ big_f(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ~ big_g(X1,esk1_1(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).

cnf(c_0_9,negated_conjecture,
    big_g(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6])]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN321+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.15/0.33  % Computer : n022.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:27:36 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.24/1.72  % Version  : CSE_E---1.7
% 1.24/1.72  % Problem  : theBenchmark.p
% 1.24/1.72  % SZS status Theorem for theBenchmark.p
% 1.24/1.72  % SZS output start CNFRefutation
% See solution above
% 1.24/1.72  % Total time : 1.373s
%------------------------------------------------------------------------------