%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET507-6 : TPTP v9.2.1. Bugfixed v2.1.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 : n024.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:56 PM UTC 2026
% Result : Unsatisfiable 1.11s 1.79s
% Output : CNFRefutation 1.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 44 ( 20 unt; 5 nHn; 28 RR)
% Number of literals : 77 ( 22 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 56 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_universal_class_not_subclass_of_null_class_1,negated_conjecture,
subclass(universal_class,null_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_universal_class_not_subclass_of_null_class_1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(image,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',image) ).
cnf(range_of,axiom,
domain_of(inverse(X1)) = range_of(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',range_of) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(inductive1,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',inductive1) ).
cnf(inductive3,axiom,
( inductive(X1)
| ~ member(null_class,X1)
| ~ subclass(image(successor_relation,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',inductive3) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',inverse) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(omega_is_inductive1,axiom,
inductive(omega),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',omega_is_inductive1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(c_0_14,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_15,negated_conjecture,
subclass(universal_class,null_class),
prove_universal_class_not_subclass_of_null_class_1 ).
cnf(c_0_16,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_17,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
image ).
cnf(c_0_18,axiom,
domain_of(inverse(X1)) = range_of(X1),
range_of ).
cnf(c_0_19,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_20,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_21,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
inductive1 ).
cnf(c_0_22,negated_conjecture,
null_class = universal_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_23,axiom,
( inductive(X1)
| ~ member(null_class,X1)
| ~ subclass(image(successor_relation,X1),X1) ),
inductive3 ).
cnf(c_0_24,plain,
domain_of(inverse(intersection(X1,cross_product(X2,universal_class)))) = image(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_26,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_27,plain,
( member(universal_class,X1)
| ~ inductive(X1) ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_29,plain,
( inductive(X1)
| ~ member(null_class,X1)
| ~ subclass(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(X1,universal_class)),universal_class)))),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,plain,
( member(universal_class,universal_class)
| ~ inductive(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,axiom,
inductive(omega),
omega_is_inductive1 ).
cnf(c_0_32,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_33,plain,
( intersection(X1,regular(X1)) = universal_class
| X1 = universal_class ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_22]),c_0_22]) ).
cnf(c_0_34,plain,
( inductive(X1)
| ~ member(universal_class,X1)
| ~ subclass(domain_of(domain_of(flip(cross_product(intersection(successor_relation,cross_product(X1,universal_class)),universal_class)))),X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_35,plain,
member(universal_class,universal_class),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( X1 = universal_class
| member(X2,X1)
| ~ member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
inductive(universal_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_16]),c_0_35])]) ).
cnf(c_0_38,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_39,plain,
( X1 = universal_class
| member(universal_class,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_27]),c_0_37])]) ).
cnf(c_0_40,plain,
( complement(X1) = universal_class
| ~ member(universal_class,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
( ~ inductive(complement(X1))
| ~ member(universal_class,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_42,plain,
complement(universal_class) = universal_class,
inference(spm,[status(thm)],[c_0_40,c_0_35]) ).
cnf(c_0_43,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_37]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.17 % Problem : SET507-6 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.01/0.17 % 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.06/0.39 % Computer : n024.cluster.edu
% 0.06/0.39 % Model : x86_64 x86_64
% 0.06/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.39 % Memory : 8042.1875MB
% 0.06/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.39 % CPULimit : 300
% 0.06/0.39 % WCLimit : 300
% 0.06/0.39 % DateTime : Mon May 4 21:25:42 EDT 2026
% 0.06/0.39 % CPUTime :
% 0.06/0.40 % start to proof: theBenchmark
% 1.11/1.79 % Version : CSE_E---1.7
% 1.11/1.79 % Problem : theBenchmark.p
% 1.11/1.79 % SZS status Unsatisfiable for theBenchmark.p
% 1.11/1.79 % SZS output start CNFRefutation
% See solution above
% 1.11/1.80 % Total time : 1.379s
%------------------------------------------------------------------------------