%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET027+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 : n004.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:06:56 PM UTC 2026
% Result : Theorem 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 35 ( 13 ~; 12 |; 6 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(transitivity,conjecture,
! [X1,X2,X5] :
( ( subclass(X1,X2)
& subclass(X2,X5) )
=> subclass(X1,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X5] :
( ( subclass(X1,X2)
& subclass(X2,X5) )
=> subclass(X1,X5) ),
inference(assume_negation,[status(cth)],[transitivity]) ).
fof(c_0_3,plain,
! [X99,X100,X101,X102,X103] :
( ( ~ subclass(X99,X100)
| ~ member(X101,X99)
| member(X101,X100) )
& ( member(esk1_2(X102,X103),X102)
| subclass(X102,X103) )
& ( ~ member(esk1_2(X102,X103),X103)
| subclass(X102,X103) ) ),
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)],[subclass_defn])])])])])]) ).
fof(c_0_4,negated_conjecture,
( subclass(esk8_0,esk9_0)
& subclass(esk9_0,esk10_0)
& ~ subclass(esk8_0,esk10_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
subclass(esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( member(X1,esk10_0)
| ~ member(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
subclass(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( subclass(X1,esk10_0)
| ~ member(esk1_2(X1,esk10_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( member(X1,esk9_0)
| ~ member(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( subclass(X1,esk10_0)
| ~ member(esk1_2(X1,esk10_0),esk8_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
( member(esk1_2(X1,X2),X1)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
~ subclass(esk8_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
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.11 % Problem : SET027+1 : TPTP v9.2.1. Bugfixed v5.4.0.
% 0.00/0.11 % 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 : n004.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 : Tue May 5 02:04:47 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.28/1.72 % Version : CSE_E---1.7
% 1.28/1.72 % Problem : theBenchmark.p
% 1.28/1.72 % SZS status Theorem for theBenchmark.p
% 1.28/1.72 % SZS output start CNFRefutation
% See solution above
% 1.28/1.72 % Total time : 1.370s
%------------------------------------------------------------------------------