↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWB003+2 : TPTP v9.2.1. Released v5.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 : n019.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:16:32 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_003_Blank_Nodes_for_Literals,conjecture,
    ? [X1] : iext(uri_ex_p,uri_ex_s,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).

fof(testcase_premise_fullish_003_Blank_Nodes_for_Literals,axiom,
    iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X1] : iext(uri_ex_p,uri_ex_s,X1),
    inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_003_Blank_Nodes_for_Literals]) ).

fof(c_0_3,negated_conjecture,
    ! [X3] : ~ iext(uri_ex_p,uri_ex_s,X3),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).

cnf(c_0_4,plain,
    iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
    inference(split_conjunct,[status(thm)],[testcase_premise_fullish_003_Blank_Nodes_for_Literals]) ).

cnf(c_0_5,negated_conjecture,
    ~ iext(uri_ex_p,uri_ex_s,X1),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWB003+2 : TPTP v9.2.1. Released v5.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.14/0.33  % Computer : n019.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 04:05:44 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.271s
%------------------------------------------------------------------------------