%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET056+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 : n027.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:07:03 PM UTC 2026
% Result : Theorem 1.35s 1.73s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 54 ( 9 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 59 ( 23 ~; 22 |; 11 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 18 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(equality1,conjecture,
! [X1,X2] :
( X1 = X2
| ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| ? [X7] :
( member(X7,X2)
& ~ member(X7,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality1) ).
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(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X1,X2)
& subclass(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( X1 = X2
| ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| ? [X7] :
( member(X7,X2)
& ~ member(X7,X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[equality1])]) ).
fof(c_0_4,plain,
! [X100,X101,X102,X103,X104] :
( ( ~ subclass(X100,X101)
| ~ member(X102,X100)
| member(X102,X101) )
& ( member(esk1_2(X103,X104),X103)
| subclass(X103,X104) )
& ( ~ member(esk1_2(X103,X104),X104)
| subclass(X103,X104) ) ),
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_5,negated_conjecture,
! [X199,X200] :
( esk8_0 != esk9_0
& ( ~ member(X199,esk8_0)
| member(X199,esk9_0) )
& ( ~ member(X200,esk9_0)
| member(X200,esk8_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( member(X1,esk9_0)
| ~ member(X1,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X107,X108] :
( ( subclass(X107,X108)
| X107 != X108 )
& ( subclass(X108,X107)
| X107 != X108 )
& ( ~ subclass(X107,X108)
| ~ subclass(X108,X107)
| X107 = X108 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])]) ).
cnf(c_0_9,negated_conjecture,
( subclass(X1,esk9_0)
| ~ member(esk1_2(X1,esk9_0),esk8_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( member(esk1_2(X1,X2),X1)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( member(X1,esk8_0)
| ~ member(X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
subclass(esk8_0,esk9_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk8_0 != esk9_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( member(esk1_2(esk9_0,X1),esk8_0)
| subclass(esk9_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ subclass(esk9_0,esk8_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET056+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.15/0.32 % Computer : n027.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 02:08:05 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 1.35/1.73 % Version : CSE_E---1.7
% 1.35/1.73 % Problem : theBenchmark.p
% 1.35/1.73 % SZS status Theorem for theBenchmark.p
% 1.35/1.73 % SZS output start CNFRefutation
% See solution above
% 1.35/1.73 % Total time : 1.371s
%------------------------------------------------------------------------------