%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS179+1 : TPTP v9.2.1. Bugfixed v5.4.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 : n003.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:36:47 PM UTC 2026
% Result : Theorem 1.27s 1.71s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 35 ( 11 ~; 14 |; 6 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(isa,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> status(X3,X4,X2) )
<=> isa(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',isa) ).
fof(isa_transitive,conjecture,
! [X1,X2,X11] :
( ( isa(X1,X2)
& isa(X2,X11) )
=> isa(X1,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa_transitive) ).
fof(c_0_2,plain,
! [X68,X69,X72,X73,X74,X75] :
( ( status(esk3_2(X68,X69),esk4_2(X68,X69),X68)
| isa(X68,X69) )
& ( ~ status(esk3_2(X68,X69),esk4_2(X68,X69),X69)
| isa(X68,X69) )
& ( ~ isa(X72,X73)
| ~ status(X74,X75,X72)
| status(X74,X75,X73) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[isa])])])])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X11] :
( ( isa(X1,X2)
& isa(X2,X11) )
=> isa(X1,X11) ),
inference(assume_negation,[status(cth)],[isa_transitive]) ).
cnf(c_0_4,plain,
( status(X3,X4,X2)
| ~ isa(X1,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,plain,
( status(esk3_2(X1,X2),esk4_2(X1,X2),X1)
| isa(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_6,negated_conjecture,
( isa(esk29_0,esk30_0)
& isa(esk30_0,esk31_0)
& ~ isa(esk29_0,esk31_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,plain,
( isa(X1,X2)
| status(esk3_2(X1,X2),esk4_2(X1,X2),X3)
| ~ isa(X1,X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
isa(esk29_0,esk30_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( isa(esk29_0,X1)
| status(esk3_2(esk29_0,X1),esk4_2(esk29_0,X1),esk30_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
( isa(esk29_0,X1)
| status(esk3_2(esk29_0,X1),esk4_2(esk29_0,X1),X2)
| ~ isa(esk30_0,X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
isa(esk30_0,esk31_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( isa(X1,X2)
| ~ status(esk3_2(X1,X2),esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( isa(esk29_0,X1)
| status(esk3_2(esk29_0,X1),esk4_2(esk29_0,X1),esk31_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
~ isa(esk29_0,esk31_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS179+1 : TPTP v9.2.1. Bugfixed v5.4.0.
% 0.00/0.12 % 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.14/0.32 % Computer : n003.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 20:39:56 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.27/1.71 % Version : CSE_E---1.7
% 1.27/1.71 % Problem : theBenchmark.p
% 1.27/1.71 % SZS status Theorem for theBenchmark.p
% 1.27/1.71 % SZS output start CNFRefutation
% See solution above
% 1.27/1.71 % Total time : 1.372s
%------------------------------------------------------------------------------