↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : NLP261+1 : TPTP v9.2.1. Bugfixed v4.0.1.
% 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 : n015.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:52:08 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(axiom1,axiom,
    ! [X1,X2,X3] :
      ( ( hypernym(X1,X2)
        & hypernym(X2,X3) )
     => hypernym(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom1) ).

fof(kb340304,axiom,
    hypernym(n10126424,n9855630),
    file('/export/starexec/sandbox2/benchmark/Axioms/NLP001+0.ax',kb340304) ).

fof(kb886122,axiom,
    hypernym(n9855630,n10560637),
    file('/export/starexec/sandbox2/benchmark/Axioms/NLP001+0.ax',kb886122) ).

fof(hypernym_transitiviy_1,conjecture,
    hypernym(n9986904,n10560637),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hypernym_transitiviy_1) ).

fof(kb1049,axiom,
    hypernym(n9986904,n10126424),
    file('/export/starexec/sandbox2/benchmark/Axioms/NLP001+0.ax',kb1049) ).

fof(c_0_5,plain,
    ! [X11,X12,X13] :
      ( ~ hypernym(X11,X12)
      | ~ hypernym(X12,X13)
      | hypernym(X11,X13) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom1])]) ).

cnf(c_0_6,plain,
    ( hypernym(X1,X3)
    | ~ hypernym(X1,X2)
    | ~ hypernym(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_7,plain,
    hypernym(n10126424,n9855630),
    inference(split_conjunct,[status(thm)],[kb340304]) ).

cnf(c_0_8,plain,
    hypernym(n9855630,n10560637),
    inference(split_conjunct,[status(thm)],[kb886122]) ).

fof(c_0_9,negated_conjecture,
    ~ hypernym(n9986904,n10560637),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hypernym_transitiviy_1])]) ).

cnf(c_0_10,plain,
    ( hypernym(X1,n9855630)
    | ~ hypernym(X1,n10126424) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,plain,
    ( hypernym(X1,n10560637)
    | ~ hypernym(X1,n9855630) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ~ hypernym(n9986904,n10560637),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    hypernym(n9986904,n10126424),
    inference(split_conjunct,[status(thm)],[kb1049]) ).

cnf(c_0_14,plain,
    $false,
    inference(cdclpropres,[status(thm)],[c_0_10,c_0_11,c_0_12,c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NLP261+1 : TPTP v9.2.1. Bugfixed v4.0.1.
% 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.15/0.33  % Computer : n015.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 00:04:02 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 69.83/60.00  % Version  : CSE_E---1.7
% 69.83/60.00  % Problem  : theBenchmark.p
% 69.83/60.00  % SZS status Theorem for theBenchmark.p
% 69.83/60.00  % SZS output start CNFRefutation
% See solution above
% 69.83/60.00  % Total time : 59.297s
%------------------------------------------------------------------------------