↑ Up

CSE_E---1.7.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(x2110,conjecture,
    ( ( ? [X1] : big_r(X1)
      & ! [X2] :
          ( big_r(X2)
         => ? [X3] : big_q(X2,X3) )
      & ! [X1,X2] :
          ( big_q(X1,X2)
         => big_q(X1,X1) ) )
   => ? [X1,X2] :
        ( big_q(X1,X2)
        & big_r(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2110) ).

fof(i_0_1,negated_conjecture,
    ~ ( ( ? [X1] : big_r(X1)
        & ! [X2] :
            ( big_r(X2)
           => ? [X3] : big_q(X2,X3) )
        & ! [X1,X2] :
            ( big_q(X1,X2)
           => big_q(X1,X1) ) )
     => ? [X1,X2] :
          ( big_q(X1,X2)
          & big_r(X2) ) ),
    inference(assume_negation,[status(cth)],[x2110]) ).

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

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

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

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

cnf(i_0_7,plain,
    ~ big_q(X1,esk1_0),
    inference(scs_inference,[],[i_0_6,i_0_4]) ).

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

cnf(i_0_9,plain,
    ~ big_q(esk1_0,X1),
    inference(scs_inference,[],[i_0_6,i_0_4,i_0_3]) ).

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

cnf(i_0_11,plain,
    $false,
    inference(scs_inference,[],[i_0_6,i_0_4,i_0_3,i_0_5]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN359+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.16/0.33  % Computer : n013.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:29:56 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 0.25/1.62  % Version  : CSE_E---1.7
% 0.25/1.62  % Problem  : theBenchmark.p
% 0.25/1.62  % SZS status Theorem for theBenchmark.p
% 0.25/1.62  % SZS output start CNFRefutation
% See solution above
% 0.25/1.64  % Total time : 1.272s
%------------------------------------------------------------------------------