%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET189-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 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 : 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:07:33 PM UTC 2026
% Result : Unsatisfiable 1.37s 1.76s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 12 unt; 8 nHn; 24 RR)
% Number of literals : 64 ( 11 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(prove_corollary_to_subclass_property6_1,negated_conjecture,
intersection(complement(y),x) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_subclass_property6_1) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_corollary_to_subclass_property6_2,negated_conjecture,
subclass(y,x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_subclass_property6_2) ).
cnf(prove_corollary_to_subclass_property6_3,negated_conjecture,
x != y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_subclass_property6_3) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(c_0_12,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_13,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_14,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_15,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_16,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_21,negated_conjecture,
intersection(complement(y),x) = null_class,
prove_corollary_to_subclass_property6_1 ).
cnf(c_0_22,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(X1,complement(y))
| ~ member(X1,x) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_24,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_25,negated_conjecture,
( member(X1,y)
| ~ member(X1,x) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]) ).
cnf(c_0_26,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_27,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_28,negated_conjecture,
subclass(y,x),
prove_corollary_to_subclass_property6_2 ).
cnf(c_0_29,negated_conjecture,
x != y,
prove_corollary_to_subclass_property6_3 ).
cnf(c_0_30,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_31,negated_conjecture,
( member(not_subclass_element(x,X1),y)
| subclass(x,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ subclass(x,y),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET189-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.11 % 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.32 % Computer : n004.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:15:32 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 1.37/1.76 % Version : CSE_E---1.7
% 1.37/1.76 % Problem : theBenchmark.p
% 1.37/1.76 % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.76 % SZS output start CNFRefutation
% See solution above
% 1.37/1.77 % Total time : 1.371s
%------------------------------------------------------------------------------