%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NLP260+1 : TPTP v9.2.1. Bugfixed v4.0.1.
% 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 : n023.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 65.58s 56.06s
% Output : CNFRefutation 65.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 8 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 5 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom1,axiom,
! [X1,X2,X3] :
( ( hypernym(X1,X2)
& hypernym(X2,X3) )
=> hypernym(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1) ).
fof(kb340304,axiom,
hypernym(n10126424,n9855630),
file('/export/starexec/sandbox/benchmark/Axioms/NLP001+0.ax',kb340304) ).
fof(hypernym_transitiviy_1,conjecture,
hypernym(n9986904,n9855630),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hypernym_transitiviy_1) ).
fof(kb1049,axiom,
hypernym(n9986904,n10126424),
file('/export/starexec/sandbox/benchmark/Axioms/NLP001+0.ax',kb1049) ).
fof(c_0_4,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_5,plain,
( hypernym(X1,X3)
| ~ hypernym(X1,X2)
| ~ hypernym(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,plain,
hypernym(n10126424,n9855630),
inference(split_conjunct,[status(thm)],[kb340304]) ).
fof(c_0_7,negated_conjecture,
~ hypernym(n9986904,n9855630),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hypernym_transitiviy_1])]) ).
cnf(c_0_8,plain,
( hypernym(X1,n9855630)
| ~ hypernym(X1,n10126424) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
~ hypernym(n9986904,n9855630),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
hypernym(n9986904,n10126424),
inference(split_conjunct,[status(thm)],[kb1049]) ).
cnf(c_0_11,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_8,c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.30 % Problem : NLP260+1 : TPTP v9.2.1. Bugfixed v4.0.1.
% 0.12/0.30 % 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.15/0.52 % Computer : n023.cluster.edu
% 0.15/0.52 % Model : x86_64 x86_64
% 0.15/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.52 % Memory : 8042.1875MB
% 0.15/0.52 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.52 % CPULimit : 300
% 0.15/0.52 % WCLimit : 300
% 0.15/0.52 % DateTime : Tue May 5 00:04:26 EDT 2026
% 0.15/0.52 % CPUTime :
% 0.15/0.53 % start to proof: theBenchmark
% 65.58/56.06 % Version : CSE_E---1.7
% 65.58/56.06 % Problem : theBenchmark.p
% 65.58/56.06 % SZS status Theorem for theBenchmark.p
% 65.58/56.06 % SZS output start CNFRefutation
% See solution above
% 65.58/56.07 % Total time : 55.167s
%------------------------------------------------------------------------------