↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN413+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 : n001.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:37:03 PM UTC 2026

% Result   : Theorem 1.25s 1.72s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   30 (  13   ~;   8   |;   5   &)
%                                         (   2 <=>;   2  =>;   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    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   22 (   3 sgn  10   !;   4   ?)

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

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] :
        ? [X2] :
        ! [X3] :
          ( f(X3,X2)
        <=> ( f(X3,X1)
            & ~ f(X3,X3) ) )
     => ~ ? [X4] :
          ! [X5] : f(X5,X4) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[kalish256])]) ).

fof(c_0_2,negated_conjecture,
    ! [X11,X13,X14,X16] :
      ( ( f(X13,X11)
        | ~ f(X13,esk1_1(X11)) )
      & ( ~ f(X13,X13)
        | ~ f(X13,esk1_1(X11)) )
      & ( ~ f(X14,X11)
        | f(X14,X14)
        | f(X14,esk1_1(X11)) )
      & f(X16,esk2_0) ),
    inference(distribute,[status(thm)],[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,
    ( f(X1,X1)
    | f(X1,esk1_1(X2))
    | ~ f(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    f(X1,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_6,negated_conjecture,
    ( f(X1,esk1_1(esk2_0))
    | f(X1,X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    f(esk1_1(X1),esk1_1(esk2_0)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    ~ f(esk1_1(X1),esk1_1(X1)),
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_8,c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN413+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.16/0.33  % Computer : n001.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:32:33 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.25/1.72  % Version  : CSE_E---1.7
% 1.25/1.72  % Problem  : theBenchmark.p
% 1.25/1.72  % SZS status Theorem for theBenchmark.p
% 1.25/1.72  % SZS output start CNFRefutation
% See solution above
% 1.25/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------