↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN061+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 : n024.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:35:57 PM UTC 2026

% Result   : Theorem 1.10s 1.61s
% Output   : CNFRefutation 1.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   3 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   35 (  17   ~;  10   |;   6   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   14 (   0 sgn   5   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel31,conjecture,
    ? [X1] :
      ( big_i(X1)
      & big_j(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31) ).

fof(pel31_3,axiom,
    ! [X1] :
      ( ~ big_h(X1)
     => big_j(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_3) ).

fof(pel31_1,axiom,
    ~ ? [X1] :
        ( big_f(X1)
        & ( big_g(X1)
          | big_h(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_1) ).

fof(pel31_2,axiom,
    ? [X1] :
      ( big_i(X1)
      & big_f(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel31_2) ).

fof(c_0_4,negated_conjecture,
    ~ ? [X1] :
        ( big_i(X1)
        & big_j(X1) ),
    inference(assume_negation,[status(cth)],[pel31]) ).

fof(c_0_5,plain,
    ! [X1] :
      ( ~ big_h(X1)
     => big_j(X1) ),
    inference(fof_simplification,[status(thm)],[pel31_3]) ).

fof(c_0_6,negated_conjecture,
    ! [X9] :
      ( ~ big_i(X9)
      | ~ big_j(X9) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

fof(c_0_7,plain,
    ! [X8] :
      ( big_h(X8)
      | big_j(X8) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

fof(c_0_8,plain,
    ! [X6] :
      ( ( ~ big_g(X6)
        | ~ big_f(X6) )
      & ( ~ big_h(X6)
        | ~ big_f(X6) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel31_1])])]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ big_i(X1)
    | ~ big_j(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( big_h(X1)
    | big_j(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ big_h(X1)
    | ~ big_f(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ( big_h(X1)
    | ~ big_i(X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

fof(c_0_13,plain,
    ( big_i(esk1_0)
    & big_f(esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel31_2])]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ big_i(X1)
    | ~ big_f(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    big_i(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_16,plain,
    big_f(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : SYN061+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.06  % 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.07/0.24  % Computer : n024.cluster.edu
% 0.07/0.24  % Model    : x86_64 x86_64
% 0.07/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.24  % Memory   : 8042.1875MB
% 0.07/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.24  % CPULimit   : 300
% 0.07/0.24  % WCLimit    : 300
% 0.07/0.24  % DateTime   : Tue May  5 03:09:56 EDT 2026
% 0.07/0.24  % CPUTime    : 
% 0.07/0.25  % start to proof: theBenchmark
% 1.10/1.61  % Version  : CSE_E---1.7
% 1.10/1.61  % Problem  : theBenchmark.p
% 1.10/1.61  % SZS status Theorem for theBenchmark.p
% 1.10/1.61  % SZS output start CNFRefutation
% See solution above
% 1.10/1.61  % Total time : 1.361s
%------------------------------------------------------------------------------