↑ Up

CSE_E---1.7.THM-CRf.s

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

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

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

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

fof(c_0_2,negated_conjecture,
    ! [X13,X14] :
      ( ( ~ big_f(X13,esk3_2(X13,X14))
        | ~ big_f(X14,esk3_2(X13,X14))
        | ~ big_f(esk1_0,esk2_0) )
      & ( big_f(X13,esk3_2(X13,X14))
        | big_f(X14,esk3_2(X13,X14))
        | ~ big_f(esk1_0,esk2_0) )
      & ( ~ big_f(X13,esk3_2(X13,X14))
        | big_f(X14,esk3_2(X13,X14))
        | big_f(esk1_0,esk2_0) )
      & ( ~ big_f(X14,esk3_2(X13,X14))
        | big_f(X13,esk3_2(X13,X14))
        | big_f(esk1_0,esk2_0) )
      & ( ~ big_f(esk1_0,esk3_2(X13,X14))
        | ~ big_f(esk2_0,esk3_2(X13,X14)) )
      & ( big_f(esk1_0,esk3_2(X13,X14))
        | big_f(esk2_0,esk3_2(X13,X14)) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

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

cnf(c_0_4,negated_conjecture,
    ( big_f(esk1_0,esk3_2(X1,X2))
    | big_f(esk2_0,esk3_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( big_f(esk2_0,esk3_2(X1,esk1_0))
    | big_f(X1,esk3_2(X1,esk1_0))
    | big_f(esk1_0,esk2_0) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,negated_conjecture,
    ( big_f(X2,esk3_2(X1,X2))
    | big_f(esk1_0,esk2_0)
    | ~ big_f(X1,esk3_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    ( big_f(esk2_0,esk3_2(esk2_0,esk1_0))
    | big_f(esk1_0,esk2_0) ),
    inference(ef,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ big_f(esk1_0,esk3_2(X1,X2))
    | ~ big_f(esk2_0,esk3_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    ( big_f(esk1_0,esk3_2(esk2_0,esk1_0))
    | big_f(esk1_0,esk2_0) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ big_f(X1,esk3_2(X1,X2))
    | ~ big_f(X2,esk3_2(X1,X2))
    | ~ big_f(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_11,negated_conjecture,
    big_f(esk1_0,esk2_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    ( big_f(X1,esk3_2(X1,X2))
    | big_f(X2,esk3_2(X1,X2))
    | ~ big_f(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ big_f(X1,esk3_2(X2,X1))
    | ~ big_f(X2,esk3_2(X2,X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_14,negated_conjecture,
    ( big_f(X1,esk3_2(X1,X2))
    | big_f(X2,esk3_2(X1,X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11])]) ).

cnf(c_0_15,negated_conjecture,
    ( big_f(esk2_0,esk3_2(X1,esk1_0))
    | ~ big_f(X1,esk3_2(X1,esk1_0)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_4]) ).

cnf(c_0_16,negated_conjecture,
    ( big_f(X1,esk3_2(X1,esk1_0))
    | ~ big_f(esk2_0,esk3_2(X1,esk1_0)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    big_f(esk2_0,esk3_2(esk1_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_15,c_0_4]) ).

cnf(c_0_18,negated_conjecture,
    big_f(esk1_0,esk3_2(esk1_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SYN347+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.11  % 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.32  % Computer : n025.cluster.edu
% 0.16/0.32  % Model    : x86_64 x86_64
% 0.16/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32  % Memory   : 8042.1875MB
% 0.16/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32  % CPULimit   : 300
% 0.16/0.32  % WCLimit    : 300
% 0.16/0.32  % DateTime   : Tue May  5 08:29:28 EDT 2026
% 0.16/0.32  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.25/1.71  % Version  : CSE_E---1.7
% 1.25/1.71  % Problem  : theBenchmark.p
% 1.25/1.71  % SZS status Theorem for theBenchmark.p
% 1.25/1.71  % SZS output start CNFRefutation
% See solution above
% 1.25/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------