↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN981+1 : TPTP v9.2.1. Released v3.1.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 : n007.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:51:11 PM UTC 2026

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

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

fof(c_0_1,negated_conjecture,
    ~ ( ( ! [X1] :
            ( p(X1)
           => q(X1) )
        & ? [X2] :
            ( q(X2)
           => r(X2) ) )
     => ? [X3] :
          ( p(X3)
         => r(X3) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(c_0_2,negated_conjecture,
    ! [X7,X9] :
      ( ( ~ p(X7)
        | q(X7) )
      & ( ~ q(esk1_0)
        | r(esk1_0) )
      & p(X9)
      & ~ r(X9) ),
    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,
    ( q(X1)
    | ~ p(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_5,negated_conjecture,
    ( r(esk1_0)
    | ~ q(esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    q(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).

cnf(c_0_7,negated_conjecture,
    r(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).

cnf(c_0_8,negated_conjecture,
    ~ r(X1),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SYN981+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.11  % 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.13/0.32  % Computer : n007.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Tue May  5 08:50:08 EDT 2026
% 0.13/0.32  % CPUTime    : 
% 0.13/0.33  % 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.271s
%------------------------------------------------------------------------------