↑ Up

CSE_E---1.7.THM-CRf.s

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

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

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

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

fof(i_0_2,negated_conjecture,
    ! [X13,X14,X15,X16] :
      ( ( ~ big_r(X13,X13)
        | big_r(X13,X14) )
      & ( ~ big_r(X13,X14)
        | big_r(X13,X13) )
      & ( ~ big_r(X15,X15)
        | big_r(X16,X15) )
      & ( ~ big_r(X16,X15)
        | big_r(X15,X15) )
      & big_r(esk1_0,esk1_0)
      & ~ big_r(esk2_0,esk2_0) ),
    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_r(X1,X1)
    | ~ big_r(X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

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

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

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

cnf(i_0_7,negated_conjecture,
    ~ big_r(esk2_0,esk2_0),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_8,negated_conjecture,
    big_r(esk1_0,esk1_0),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_9,plain,
    ~ big_r(esk2_0,X1),
    inference(scs_inference,[],[i_0_7,i_0_3]) ).

cnf(i_0_10,plain,
    ( big_r(X1,X1)
    | ~ big_r(X1,X2) ),
    inference(rename_variables,[],[i_0_3]) ).

cnf(i_0_11,plain,
    big_r(esk1_0,X1),
    inference(scs_inference,[],[i_0_7,i_0_8,i_0_3,i_0_4]) ).

cnf(i_0_12,plain,
    ( ~ big_r(X1,X1)
    | big_r(X1,X2) ),
    inference(rename_variables,[],[i_0_4]) ).

cnf(i_0_13,plain,
    $false,
    inference(scs_inference,[],[i_0_7,i_0_8,i_0_3,i_0_4,i_0_5]),
    [proof] ).

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