↑ Up

CSE_E---1.7.THM-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(kalish244,conjecture,
    ( ~ ? [X1] : f(X1)
   => ! [X2] :
        ( f(X2)
       => g(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish244) ).

fof(c_0_1,negated_conjecture,
    ~ ( ~ ? [X1] : f(X1)
     => ! [X2] :
          ( f(X2)
         => g(X2) ) ),
    inference(assume_negation,[status(cth)],[kalish244]) ).

fof(c_0_2,negated_conjecture,
    ! [X5] :
      ( ~ f(X5)
      & f(esk1_0)
      & ~ g(esk1_0) ),
    inference(shift_quantors,[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,
    f(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_5,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_3,c_0_4]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN408+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.14/0.33  % Computer : n025.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Tue May  5 08:31:28 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 0.25/1.61  % Version  : CSE_E---1.7
% 0.25/1.61  % Problem  : theBenchmark.p
% 0.25/1.61  % SZS status Theorem for theBenchmark.p
% 0.25/1.61  % SZS output start CNFRefutation
% See solution above
% 0.25/1.61  % Total time : 1.272s
%------------------------------------------------------------------------------