TSTP Solution File: SET018-7 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET018-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n022.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 : Thu Aug 31 14:32:12 EDT 2023
% Result : Unsatisfiable 0.20s 0.66s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 73
% Syntax : Number of formulae : 142 ( 48 unt; 53 typ; 0 def)
% Number of atoms : 141 ( 85 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 85 ( 33 ~; 52 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 67 ( 41 >; 26 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 44 ( 44 usr; 12 con; 0-3 aty)
% Number of variables : 87 ( 24 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
subclass: ( $i * $i ) > $o ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
not_subclass_element: ( $i * $i ) > $i ).
tff(decl_25,type,
universal_class: $i ).
tff(decl_26,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_27,type,
singleton: $i > $i ).
tff(decl_28,type,
ordered_pair: ( $i * $i ) > $i ).
tff(decl_29,type,
cross_product: ( $i * $i ) > $i ).
tff(decl_30,type,
first: $i > $i ).
tff(decl_31,type,
second: $i > $i ).
tff(decl_32,type,
element_relation: $i ).
tff(decl_33,type,
intersection: ( $i * $i ) > $i ).
tff(decl_34,type,
complement: $i > $i ).
tff(decl_35,type,
union: ( $i * $i ) > $i ).
tff(decl_36,type,
symmetric_difference: ( $i * $i ) > $i ).
tff(decl_37,type,
restrict: ( $i * $i * $i ) > $i ).
tff(decl_38,type,
null_class: $i ).
tff(decl_39,type,
domain_of: $i > $i ).
tff(decl_40,type,
rotate: $i > $i ).
tff(decl_41,type,
flip: $i > $i ).
tff(decl_42,type,
inverse: $i > $i ).
tff(decl_43,type,
range_of: $i > $i ).
tff(decl_44,type,
domain: ( $i * $i * $i ) > $i ).
tff(decl_45,type,
range: ( $i * $i * $i ) > $i ).
tff(decl_46,type,
image: ( $i * $i ) > $i ).
tff(decl_47,type,
successor: $i > $i ).
tff(decl_48,type,
successor_relation: $i ).
tff(decl_49,type,
inductive: $i > $o ).
tff(decl_50,type,
omega: $i ).
tff(decl_51,type,
sum_class: $i > $i ).
tff(decl_52,type,
power_class: $i > $i ).
tff(decl_53,type,
compose: ( $i * $i ) > $i ).
tff(decl_54,type,
single_valued_class: $i > $o ).
tff(decl_55,type,
identity_relation: $i ).
tff(decl_56,type,
function: $i > $o ).
tff(decl_57,type,
regular: $i > $i ).
tff(decl_58,type,
apply: ( $i * $i ) > $i ).
tff(decl_59,type,
choice: $i ).
tff(decl_60,type,
one_to_one: $i > $o ).
tff(decl_61,type,
subset_relation: $i ).
tff(decl_62,type,
diagonalise: $i > $i ).
tff(decl_63,type,
cantor: $i > $i ).
tff(decl_64,type,
operation: $i > $o ).
tff(decl_65,type,
compatible: ( $i * $i * $i ) > $o ).
tff(decl_66,type,
homomorphism: ( $i * $i * $i ) > $o ).
tff(decl_67,type,
not_homomorphism1: ( $i * $i * $i ) > $i ).
tff(decl_68,type,
not_homomorphism2: ( $i * $i * $i ) > $i ).
tff(decl_69,type,
member_of: $i > $i ).
tff(decl_70,type,
member_of1: $i > $i ).
tff(decl_71,type,
w: $i ).
tff(decl_72,type,
x: $i ).
tff(decl_73,type,
y: $i ).
tff(decl_74,type,
z: $i ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(unordered_pair_member_of_ordered_pair,axiom,
member(unordered_pair(X1,singleton(X2)),ordered_pair(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_member_of_ordered_pair) ).
cnf(prove_ordered_pair_determines_components2_1,negated_conjecture,
ordered_pair(w,x) = ordered_pair(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_1) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(singleton_member_of_ordered_pair,axiom,
member(singleton(X1),ordered_pair(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_member_of_ordered_pair) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
cnf(only_member_in_singleton,axiom,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',only_member_in_singleton) ).
cnf(corollary_1_to_singletons_are_sets,axiom,
member(singleton(X1),unordered_pair(X2,singleton(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_1_to_singletons_are_sets) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(singleton_is_null_class,axiom,
( member(X1,universal_class)
| singleton(X1) = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_is_null_class) ).
cnf(unordered_pairs_and_singletons,axiom,
unordered_pair(X1,X2) = union(singleton(X1),singleton(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pairs_and_singletons) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(prove_ordered_pair_determines_components2_3,negated_conjecture,
x != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_3) ).
cnf(corollary_to_unordered_pair_axiom1,axiom,
( ~ member(X1,universal_class)
| unordered_pair(X1,X2) != null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_to_unordered_pair_axiom1) ).
cnf(prove_ordered_pair_determines_components2_2,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_2) ).
cnf(corollary_to_unordered_pair_axiom2,axiom,
( ~ member(X1,universal_class)
| unordered_pair(X2,X1) != null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_to_unordered_pair_axiom2) ).
cnf(commutativity_of_unordered_pair,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
cnf(member_of_singleton_is_unique,axiom,
( member_of(singleton(X1)) = X1
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_of_singleton_is_unique) ).
cnf(c_0_20,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_21,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_22,axiom,
member(unordered_pair(X1,singleton(X2)),ordered_pair(X1,X2)),
unordered_pair_member_of_ordered_pair ).
cnf(c_0_23,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_20,c_0_21]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
ordered_pair(w,x) = ordered_pair(y,z),
prove_ordered_pair_determines_components2_1 ).
cnf(c_0_25,plain,
member(unordered_pair(X1,unordered_pair(X2,X2)),unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_21]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))) = unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23]),c_0_23]) ).
cnf(c_0_27,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_28,negated_conjecture,
member(unordered_pair(w,unordered_pair(x,x)),unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
member(singleton(X1),ordered_pair(X1,X2)),
singleton_member_of_ordered_pair ).
cnf(c_0_30,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_31,negated_conjecture,
( unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,unordered_pair(z,z))
| unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_33,plain,
member(unordered_pair(X1,X1),unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_21]),c_0_23]) ).
cnf(c_0_34,negated_conjecture,
( unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y)
| member(unordered_pair(x,x),unordered_pair(y,unordered_pair(z,z))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_35,axiom,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
only_member_in_singleton ).
cnf(c_0_36,axiom,
member(singleton(X1),unordered_pair(X2,singleton(X1))),
corollary_1_to_singletons_are_sets ).
cnf(c_0_37,negated_conjecture,
member(unordered_pair(w,w),unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),
inference(spm,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_38,negated_conjecture,
( unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y)
| unordered_pair(z,z) = unordered_pair(x,x)
| unordered_pair(x,x) = y ),
inference(spm,[status(thm)],[c_0_27,c_0_34]) ).
cnf(c_0_39,plain,
( X1 = X2
| ~ member(X1,unordered_pair(X2,X2)) ),
inference(rw,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_40,plain,
member(unordered_pair(X1,X1),unordered_pair(X2,unordered_pair(X1,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_21]),c_0_21]) ).
cnf(c_0_41,negated_conjecture,
( unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w)
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
cnf(c_0_42,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_43,negated_conjecture,
( unordered_pair(z,z) = unordered_pair(x,x)
| unordered_pair(x,x) = y ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_38]),c_0_32])]),c_0_39]) ).
cnf(c_0_44,axiom,
( member(X1,universal_class)
| singleton(X1) = null_class ),
singleton_is_null_class ).
cnf(c_0_45,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| member(unordered_pair(z,z),unordered_pair(w,w)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,axiom,
unordered_pair(X1,X2) = union(singleton(X1),singleton(X2)),
unordered_pairs_and_singletons ).
cnf(c_0_47,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_48,negated_conjecture,
( unordered_pair(x,x) = y
| member(z,unordered_pair(x,x))
| ~ member(z,universal_class) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(rw,[status(thm)],[c_0_44,c_0_21]) ).
cnf(c_0_50,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| unordered_pair(z,z) = w ),
inference(spm,[status(thm)],[c_0_39,c_0_45]) ).
cnf(c_0_51,plain,
unordered_pair(X1,X2) = complement(intersection(complement(unordered_pair(X1,X1)),complement(unordered_pair(X2,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_21]),c_0_21]),c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( unordered_pair(z,z) = null_class
| unordered_pair(x,x) = y
| member(z,unordered_pair(x,x)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
x != z,
prove_ordered_pair_determines_components2_3 ).
cnf(c_0_54,axiom,
( ~ member(X1,universal_class)
| unordered_pair(X1,X2) != null_class ),
corollary_to_unordered_pair_axiom1 ).
cnf(c_0_55,negated_conjecture,
member(x,universal_class),
prove_ordered_pair_determines_components2_2 ).
cnf(c_0_56,axiom,
( ~ member(X1,universal_class)
| unordered_pair(X2,X1) != null_class ),
corollary_to_unordered_pair_axiom2 ).
cnf(c_0_57,negated_conjecture,
( unordered_pair(z,z) = w
| member(w,unordered_pair(y,y))
| ~ member(w,universal_class) ),
inference(spm,[status(thm)],[c_0_30,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( unordered_pair(z,X1) = unordered_pair(x,X1)
| unordered_pair(x,x) = y ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_43]),c_0_51]) ).
cnf(c_0_59,negated_conjecture,
( unordered_pair(x,x) = y
| unordered_pair(z,z) = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_52]),c_0_53]) ).
cnf(c_0_60,negated_conjecture,
unordered_pair(x,X1) != null_class,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
( unordered_pair(X1,X1) = null_class
| unordered_pair(X2,X1) != null_class ),
inference(spm,[status(thm)],[c_0_56,c_0_49]) ).
cnf(c_0_62,plain,
unordered_pair(X1,unordered_pair(X2,X3)) != null_class,
inference(spm,[status(thm)],[c_0_56,c_0_32]) ).
cnf(c_0_63,negated_conjecture,
( unordered_pair(w,w) = null_class
| unordered_pair(z,z) = w
| member(w,unordered_pair(y,y)) ),
inference(spm,[status(thm)],[c_0_57,c_0_49]) ).
cnf(c_0_64,negated_conjecture,
unordered_pair(x,x) = y,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| unordered_pair(w,w) != null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_41]),c_0_62]) ).
cnf(c_0_66,negated_conjecture,
( unordered_pair(z,z) = w
| unordered_pair(w,w) = null_class
| w = y ),
inference(spm,[status(thm)],[c_0_39,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| member(y,unordered_pair(w,w))
| ~ member(y,universal_class) ),
inference(spm,[status(thm)],[c_0_42,c_0_41]) ).
cnf(c_0_68,negated_conjecture,
member(y,universal_class),
inference(spm,[status(thm)],[c_0_32,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
( unordered_pair(z,z) = w
| unordered_pair(y,y) = null_class
| w = y ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| member(y,unordered_pair(w,w)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_71,negated_conjecture,
( unordered_pair(y,y) = null_class
| w = y
| member(w,universal_class) ),
inference(spm,[status(thm)],[c_0_32,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
unordered_pair(X1,y) != null_class,
inference(spm,[status(thm)],[c_0_62,c_0_64]) ).
cnf(c_0_73,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| w = y ),
inference(spm,[status(thm)],[c_0_39,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( w = y
| member(w,universal_class) ),
inference(sr,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_76,negated_conjecture,
w = y,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_73]),c_0_74]),c_0_39]) ).
cnf(c_0_77,negated_conjecture,
unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))) = unordered_pair(unordered_pair(y,y),unordered_pair(y,y)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_64]),c_0_75]),c_0_76]),c_0_76]),c_0_76]) ).
cnf(c_0_78,negated_conjecture,
member(unordered_pair(y,unordered_pair(z,z)),unordered_pair(unordered_pair(y,y),unordered_pair(y,y))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_77]),c_0_32])]) ).
cnf(c_0_79,negated_conjecture,
unordered_pair(y,unordered_pair(z,z)) = unordered_pair(y,y),
inference(spm,[status(thm)],[c_0_39,c_0_78]) ).
cnf(c_0_80,axiom,
( member_of(singleton(X1)) = X1
| ~ member(X1,universal_class) ),
member_of_singleton_is_unique ).
cnf(c_0_81,negated_conjecture,
member(unordered_pair(z,z),unordered_pair(y,y)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_79]),c_0_32])]) ).
cnf(c_0_82,plain,
( member_of(unordered_pair(X1,X1)) = X1
| ~ member(X1,universal_class) ),
inference(rw,[status(thm)],[c_0_80,c_0_21]) ).
cnf(c_0_83,negated_conjecture,
unordered_pair(z,z) = y,
inference(spm,[status(thm)],[c_0_39,c_0_81]) ).
cnf(c_0_84,negated_conjecture,
member_of(y) = x,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_64]),c_0_55])]) ).
cnf(c_0_85,negated_conjecture,
unordered_pair(X1,x) != null_class,
inference(spm,[status(thm)],[c_0_56,c_0_55]) ).
cnf(c_0_86,negated_conjecture,
~ member(z,universal_class),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_53]) ).
cnf(c_0_87,negated_conjecture,
y != null_class,
inference(spm,[status(thm)],[c_0_85,c_0_64]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_49]),c_0_83]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET018-7 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.16/0.35 % Computer : n022.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Sat Aug 26 12:15:55 EDT 2023
% 0.16/0.35 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.66 % Version : CSE_E---1.5
% 0.20/0.66 % Problem : theBenchmark.p
% 0.20/0.66 % Proof found
% 0.20/0.66 % SZS status Theorem for theBenchmark.p
% 0.20/0.66 % SZS output start Proof
% See solution above
% 0.20/0.67 % Total time : 0.085000 s
% 0.20/0.67 % SZS output end Proof
% 0.20/0.67 % Total time : 0.092000 s
%------------------------------------------------------------------------------