↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MSC011+1 : TPTP v9.2.1. Released v3.2.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 : 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 04:48:56 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(d_cons,axiom,
    ! [X1] :
      ( ( drunk(X1)
        & not_drunk(X1) )
     => goal ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_cons) ).

fof(neg_phi,axiom,
    ! [X1] :
      ( drunk(X1)
      & neg_psi ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neg_phi) ).

fof(goal_to_be_proved,conjecture,
    goal,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).

fof(neg_psi_ax,axiom,
    ( neg_psi
   => ? [X1] : not_drunk(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neg_psi_ax) ).

fof(c_0_4,plain,
    ! [X5] :
      ( ~ drunk(X5)
      | ~ not_drunk(X5)
      | goal ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d_cons])]) ).

fof(c_0_5,plain,
    ! [X6] :
      ( drunk(X6)
      & neg_psi ),
    inference(variable_rename,[status(thm)],[neg_phi]) ).

cnf(c_0_6,plain,
    ( goal
    | ~ drunk(X1)
    | ~ not_drunk(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    drunk(X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,negated_conjecture,
    ~ goal,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goal_to_be_proved])]) ).

fof(c_0_9,plain,
    ( ~ neg_psi
    | not_drunk(esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[neg_psi_ax])])]) ).

cnf(c_0_10,plain,
    ( goal
    | ~ not_drunk(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

cnf(c_0_11,negated_conjecture,
    ~ goal,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( not_drunk(esk1_0)
    | ~ neg_psi ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    neg_psi,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,plain,
    ~ not_drunk(X1),
    inference(sr,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MSC011+1 : TPTP v9.2.1. Released v3.2.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.32  % Computer : n007.cluster.edu
% 0.16/0.32  % Model    : x86_64 x86_64
% 0.16/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32  % Memory   : 8042.1875MB
% 0.16/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32  % CPULimit   : 300
% 0.16/0.32  % WCLimit    : 300
% 0.16/0.32  % DateTime   : Mon May  4 23:35:38 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/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.271s
%------------------------------------------------------------------------------