%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET021-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 : n010.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:54 PM UTC 2026
% Result : Unsatisfiable 222.53s 182.22s
% Output : CNFRefutation 223.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of clauses : 65 ( 19 unt; 14 nHn; 44 RR)
% Number of literals : 126 ( 38 equ; 51 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 131 ( 28 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
cnf(prove_unique_1st_and_2nd_in_pair_of_sets2_1,negated_conjecture,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets2_1) ).
cnf(cartesian_product2,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
cnf(cartesian_product3,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product3) ).
cnf(cartesian_product1,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(prove_unique_1st_and_2nd_in_pair_of_sets2_2,negated_conjecture,
second(ordered_pair(u,v)) != v,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_sets2_2) ).
cnf(c_0_18,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_19,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_20,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_21,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_22,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_23,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_24,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_25,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_26,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_28,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_29,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
cartesian_product4 ).
cnf(c_0_31,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_32,negated_conjecture,
member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
prove_unique_1st_and_2nd_in_pair_of_sets2_1 ).
cnf(c_0_33,plain,
( regular(intersection(X1,unordered_pair(X2,X3))) = X2
| regular(intersection(X1,unordered_pair(X2,X3))) = X3
| intersection(X1,unordered_pair(X2,X3)) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( regular(intersection(unordered_pair(X1,X2),X3)) = X1
| regular(intersection(unordered_pair(X1,X2),X3)) = X2
| intersection(unordered_pair(X1,X2),X3) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_35,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_36,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_37,axiom,
( member(X2,X4)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product2 ).
cnf(c_0_38,plain,
( unordered_pair(unordered_pair(first(X1),first(X1)),unordered_pair(first(X1),unordered_pair(second(X1),second(X1)))) = X1
| ~ member(X1,cross_product(X2,X3)) ),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),cross_product(universal_class,universal_class)),
inference(rw,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_40,plain,
( regular(intersection(X1,unordered_pair(X2,X2))) = X2
| intersection(X1,unordered_pair(X2,X2)) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_33])]) ).
cnf(c_0_41,plain,
( regular(intersection(unordered_pair(X1,X1),X2)) = X1
| intersection(unordered_pair(X1,X1),X2) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_34])]) ).
cnf(c_0_42,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( member(X2,X4)
| ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4)) ),
inference(rw,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_44,negated_conjecture,
unordered_pair(unordered_pair(first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))),unordered_pair(first(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),unordered_pair(second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))))) = unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,axiom,
( member(ordered_pair(X1,X3),cross_product(X2,X4))
| ~ member(X1,X2)
| ~ member(X3,X4) ),
cartesian_product3 ).
cnf(c_0_46,axiom,
( member(X1,X3)
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
cartesian_product1 ).
cnf(c_0_47,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_48,plain,
( intersection(unordered_pair(X1,X1),unordered_pair(X2,X2)) = null_class
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_42]),c_0_29]) ).
cnf(c_0_50,negated_conjecture,
( member(second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),X1)
| ~ member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))),cross_product(X2,X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
( member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X3,X3))),cross_product(X2,X4))
| ~ member(X3,X4)
| ~ member(X1,X2) ),
inference(rw,[status(thm)],[c_0_45,c_0_31]) ).
cnf(c_0_52,plain,
( member(X1,X3)
| ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4)) ),
inference(rw,[status(thm)],[c_0_46,c_0_31]) ).
cnf(c_0_53,plain,
( X1 = X2
| ~ member(X3,unordered_pair(X2,X2))
| ~ member(X3,unordered_pair(X1,X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_54,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_55,negated_conjecture,
( member(second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),X1)
| ~ member(v,X1)
| ~ member(u,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_57,negated_conjecture,
member(u,universal_class),
inference(spm,[status(thm)],[c_0_52,c_0_39]) ).
cnf(c_0_58,plain,
( X1 = X2
| ~ member(X2,unordered_pair(X1,X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_29]) ).
cnf(c_0_59,negated_conjecture,
( member(second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))),X1)
| ~ member(v,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),c_0_55]) ).
cnf(c_0_60,negated_conjecture,
second(ordered_pair(u,v)) != v,
prove_unique_1st_and_2nd_in_pair_of_sets2_2 ).
cnf(c_0_61,negated_conjecture,
( X1 = second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v))))
| ~ member(v,unordered_pair(X1,X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
member(v,universal_class),
inference(spm,[status(thm)],[c_0_43,c_0_39]) ).
cnf(c_0_63,negated_conjecture,
second(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(v,v)))) != v,
inference(rw,[status(thm)],[c_0_60,c_0_31]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_54]),c_0_62])]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET021-6 : TPTP v9.2.1. Bugfixed v2.1.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.16/0.33 % Computer : n010.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 02:05:21 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 222.53/182.22 % Version : CSE_E---1.7
% 222.53/182.22 % Problem : theBenchmark.p
% 222.53/182.22 % SZS status Unsatisfiable for theBenchmark.p
% 222.53/182.22 % SZS output start CNFRefutation
% See solution above
% 223.83/183.52 % Total time : 127.158s
%------------------------------------------------------------------------------