TSTP Solution File: SET037-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET037-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n026.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:25 EDT 2023
% Result : Unsatisfiable 2.06s 2.29s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 101
% Syntax : Number of formulae : 160 ( 26 unt; 75 typ; 0 def)
% Number of atoms : 181 ( 54 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 183 ( 87 ~; 96 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 122 ( 66 >; 56 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-5 aty)
% Number of functors : 62 ( 62 usr; 9 con; 0-5 aty)
% Number of variables : 124 ( 9 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
member: ( $i * $i ) > $o ).
tff(decl_23,type,
little_set: $i > $o ).
tff(decl_24,type,
f1: ( $i * $i ) > $i ).
tff(decl_25,type,
non_ordered_pair: ( $i * $i ) > $i ).
tff(decl_26,type,
singleton_set: $i > $i ).
tff(decl_27,type,
ordered_pair: ( $i * $i ) > $i ).
tff(decl_28,type,
ordered_pair_predicate: $i > $o ).
tff(decl_29,type,
f2: $i > $i ).
tff(decl_30,type,
f3: $i > $i ).
tff(decl_31,type,
first: $i > $i ).
tff(decl_32,type,
f4: ( $i * $i ) > $i ).
tff(decl_33,type,
f5: ( $i * $i ) > $i ).
tff(decl_34,type,
second: $i > $i ).
tff(decl_35,type,
f6: ( $i * $i ) > $i ).
tff(decl_36,type,
f7: ( $i * $i ) > $i ).
tff(decl_37,type,
estin: $i ).
tff(decl_38,type,
intersection: ( $i * $i ) > $i ).
tff(decl_39,type,
complement: $i > $i ).
tff(decl_40,type,
union: ( $i * $i ) > $i ).
tff(decl_41,type,
domain_of: $i > $i ).
tff(decl_42,type,
f8: ( $i * $i ) > $i ).
tff(decl_43,type,
cross_product: ( $i * $i ) > $i ).
tff(decl_44,type,
converse: $i > $i ).
tff(decl_45,type,
rotate_right: $i > $i ).
tff(decl_46,type,
f9: ( $i * $i ) > $i ).
tff(decl_47,type,
f10: ( $i * $i ) > $i ).
tff(decl_48,type,
f11: ( $i * $i ) > $i ).
tff(decl_49,type,
flip_range_of: $i > $i ).
tff(decl_50,type,
f12: ( $i * $i ) > $i ).
tff(decl_51,type,
f13: ( $i * $i ) > $i ).
tff(decl_52,type,
f14: ( $i * $i ) > $i ).
tff(decl_53,type,
successor: $i > $i ).
tff(decl_54,type,
empty_set: $i ).
tff(decl_55,type,
universal_set: $i ).
tff(decl_56,type,
infinity: $i ).
tff(decl_57,type,
sigma: $i > $i ).
tff(decl_58,type,
f16: ( $i * $i ) > $i ).
tff(decl_59,type,
subset: ( $i * $i ) > $o ).
tff(decl_60,type,
f17: ( $i * $i ) > $i ).
tff(decl_61,type,
proper_subset: ( $i * $i ) > $o ).
tff(decl_62,type,
powerset: $i > $i ).
tff(decl_63,type,
relation: $i > $o ).
tff(decl_64,type,
f18: $i > $i ).
tff(decl_65,type,
single_valued_set: $i > $o ).
tff(decl_66,type,
f19: $i > $i ).
tff(decl_67,type,
f20: $i > $i ).
tff(decl_68,type,
f21: $i > $i ).
tff(decl_69,type,
function: $i > $o ).
tff(decl_70,type,
image: ( $i * $i ) > $i ).
tff(decl_71,type,
f22: ( $i * $i * $i ) > $i ).
tff(decl_72,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_73,type,
f23: ( $i * $i ) > $i ).
tff(decl_74,type,
f24: $i > $i ).
tff(decl_75,type,
f25: $i ).
tff(decl_76,type,
f26: $i > $i ).
tff(decl_77,type,
range_of: $i > $i ).
tff(decl_78,type,
f27: ( $i * $i ) > $i ).
tff(decl_79,type,
identity_relation: $i ).
tff(decl_80,type,
restrict: ( $i * $i ) > $i ).
tff(decl_81,type,
one_to_one_function: $i > $o ).
tff(decl_82,type,
apply: ( $i * $i ) > $i ).
tff(decl_83,type,
f28: ( $i * $i * $i ) > $i ).
tff(decl_84,type,
apply_to_two_arguments: ( $i * $i * $i ) > $i ).
tff(decl_85,type,
maps: ( $i * $i * $i ) > $o ).
tff(decl_86,type,
closed: ( $i * $i ) > $o ).
tff(decl_87,type,
compose: ( $i * $i ) > $i ).
tff(decl_88,type,
f29: ( $i * $i * $i ) > $i ).
tff(decl_89,type,
f30: ( $i * $i * $i ) > $i ).
tff(decl_90,type,
f31: ( $i * $i * $i ) > $i ).
tff(decl_91,type,
homomorphism: ( $i * $i * $i * $i * $i ) > $o ).
tff(decl_92,type,
f32: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_93,type,
f33: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_94,type,
a_function: $i ).
tff(decl_95,type,
a: $i ).
tff(decl_96,type,
b: $i ).
cnf(ordered_pair,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',singleton_set) ).
cnf(apply_for_functions1,axiom,
( apply(X3,X1) = X2
| ~ little_set(X1)
| ~ little_set(X2)
| ~ function(X3)
| ~ member(ordered_pair(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',apply_for_functions1) ).
cnf(ordered_pair_predicate3,axiom,
( X1 = ordered_pair(f2(X1),f3(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate3) ).
cnf(ordered_pair_predicate1,axiom,
( little_set(f2(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate1) ).
cnf(ordered_pair_predicate2,axiom,
( little_set(f3(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate2) ).
cnf(domain2,axiom,
( member(f8(X1,X2),X2)
| ~ member(X1,domain_of(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',domain2) ).
cnf(member_of_function_domain,hypothesis,
member(a,domain_of(a_function)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_of_function_domain) ).
cnf(domain1,axiom,
( ordered_pair_predicate(f8(X1,X2))
| ~ member(X1,domain_of(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',domain1) ).
cnf(property_of_first,axiom,
( first(ordered_pair(X1,X2)) = X1
| ~ little_set(X1)
| ~ little_set(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_first) ).
cnf(property_of_second,axiom,
( second(ordered_pair(X1,X2)) = X2
| ~ little_set(X1)
| ~ little_set(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_second) ).
cnf(a_function,hypothesis,
function(a_function),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_function) ).
cnf(domain3,axiom,
( X1 = first(f8(X1,X2))
| ~ member(X1,domain_of(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',domain3) ).
cnf(image_and_substitution5,axiom,
( member(X1,image(X2,X3))
| ~ little_set(X1)
| ~ ordered_pair_predicate(X4)
| ~ member(X4,X3)
| ~ member(first(X4),X2)
| second(X4) != X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',image_and_substitution5) ).
cnf(second_component_is_small,axiom,
( little_set(second(X1))
| ~ ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',second_component_is_small) ).
cnf(applying_the_function,hypothesis,
apply(a_function,a) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',applying_the_function) ).
cnf(non_ordered_pair1,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,non_ordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair1) ).
cnf(regularity1,axiom,
( X1 = empty_set
| member(f24(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',regularity1) ).
cnf(disjoint1,axiom,
( ~ disjoint(X1,X2)
| ~ member(X3,X1)
| ~ member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',disjoint1) ).
cnf(regularity2,axiom,
( X1 = empty_set
| disjoint(f24(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',regularity2) ).
cnf(image_and_apply2,axiom,
subset(image(singleton_set(X1),X2),apply(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',image_and_apply2) ).
cnf(subset1,axiom,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',subset1) ).
cnf(non_ordered_pair2,axiom,
( member(X1,non_ordered_pair(X2,X3))
| ~ little_set(X1)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair2) ).
cnf(function_values_are_small,axiom,
( little_set(apply(X1,X2))
| ~ function(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',function_values_are_small) ).
cnf(empty_set,axiom,
~ member(X1,empty_set),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',empty_set) ).
cnf(a2,axiom,
( little_set(X1)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',a2) ).
cnf(c_0_26,axiom,
ordered_pair(X1,X2) = non_ordered_pair(singleton_set(X1),non_ordered_pair(X1,X2)),
ordered_pair ).
cnf(c_0_27,axiom,
singleton_set(X1) = non_ordered_pair(X1,X1),
singleton_set ).
cnf(c_0_28,axiom,
( apply(X3,X1) = X2
| ~ little_set(X1)
| ~ little_set(X2)
| ~ function(X3)
| ~ member(ordered_pair(X1,X2),X3) ),
apply_for_functions1 ).
cnf(c_0_29,plain,
ordered_pair(X1,X2) = non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
( X1 = ordered_pair(f2(X1),f3(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate3 ).
cnf(c_0_31,plain,
( apply(X3,X1) = X2
| ~ little_set(X2)
| ~ little_set(X1)
| ~ function(X3)
| ~ member(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2)),X3) ),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( X1 = non_ordered_pair(non_ordered_pair(f2(X1),f2(X1)),non_ordered_pair(f2(X1),f3(X1)))
| ~ ordered_pair_predicate(X1) ),
inference(rw,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_33,axiom,
( little_set(f2(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate1 ).
cnf(c_0_34,axiom,
( little_set(f3(X1))
| ~ ordered_pair_predicate(X1) ),
ordered_pair_predicate2 ).
cnf(c_0_35,axiom,
( member(f8(X1,X2),X2)
| ~ member(X1,domain_of(X2)) ),
domain2 ).
cnf(c_0_36,hypothesis,
member(a,domain_of(a_function)),
member_of_function_domain ).
cnf(c_0_37,axiom,
( ordered_pair_predicate(f8(X1,X2))
| ~ member(X1,domain_of(X2)) ),
domain1 ).
cnf(c_0_38,axiom,
( first(ordered_pair(X1,X2)) = X1
| ~ little_set(X1)
| ~ little_set(X2) ),
property_of_first ).
cnf(c_0_39,axiom,
( second(ordered_pair(X1,X2)) = X2
| ~ little_set(X1)
| ~ little_set(X2) ),
property_of_second ).
cnf(c_0_40,plain,
( apply(X1,f2(X2)) = f3(X2)
| ~ function(X1)
| ~ ordered_pair_predicate(X2)
| ~ member(X2,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_41,hypothesis,
member(f8(a,a_function),a_function),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,hypothesis,
function(a_function),
a_function ).
cnf(c_0_43,hypothesis,
ordered_pair_predicate(f8(a,a_function)),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_44,plain,
( first(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2))) = X1
| ~ little_set(X2)
| ~ little_set(X1) ),
inference(rw,[status(thm)],[c_0_38,c_0_29]) ).
cnf(c_0_45,axiom,
( X1 = first(f8(X1,X2))
| ~ member(X1,domain_of(X2)) ),
domain3 ).
cnf(c_0_46,axiom,
( member(X1,image(X2,X3))
| ~ little_set(X1)
| ~ ordered_pair_predicate(X4)
| ~ member(X4,X3)
| ~ member(first(X4),X2)
| second(X4) != X1 ),
image_and_substitution5 ).
cnf(c_0_47,axiom,
( little_set(second(X1))
| ~ ordered_pair_predicate(X1) ),
second_component_is_small ).
cnf(c_0_48,plain,
( second(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2))) = X2
| ~ little_set(X2)
| ~ little_set(X1) ),
inference(rw,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_49,hypothesis,
apply(a_function,f2(f8(a,a_function))) = f3(f8(a,a_function)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_50,plain,
( f2(X1) = first(X1)
| ~ ordered_pair_predicate(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_51,hypothesis,
first(f8(a,a_function)) = a,
inference(spm,[status(thm)],[c_0_45,c_0_36]) ).
cnf(c_0_52,hypothesis,
apply(a_function,a) = b,
applying_the_function ).
cnf(c_0_53,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,non_ordered_pair(X2,X3)) ),
non_ordered_pair1 ).
cnf(c_0_54,axiom,
( X1 = empty_set
| member(f24(X1),X1) ),
regularity1 ).
cnf(c_0_55,plain,
( member(second(X1),image(X2,X3))
| ~ ordered_pair_predicate(X1)
| ~ member(first(X1),X2)
| ~ member(X1,X3) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_47]) ).
cnf(c_0_56,plain,
( f3(X1) = second(X1)
| ~ ordered_pair_predicate(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_57,hypothesis,
f3(f8(a,a_function)) = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_43])]) ).
cnf(c_0_58,plain,
( f24(non_ordered_pair(X1,X2)) = X1
| f24(non_ordered_pair(X1,X2)) = X2
| non_ordered_pair(X1,X2) = empty_set ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,axiom,
( ~ disjoint(X1,X2)
| ~ member(X3,X1)
| ~ member(X3,X2) ),
disjoint1 ).
cnf(c_0_60,axiom,
( X1 = empty_set
| disjoint(f24(X1),X1) ),
regularity2 ).
cnf(c_0_61,axiom,
subset(image(singleton_set(X1),X2),apply(X2,X1)),
image_and_apply2 ).
cnf(c_0_62,hypothesis,
( member(second(f8(a,a_function)),image(X1,a_function))
| ~ member(a,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_41]),c_0_43]),c_0_51])]) ).
cnf(c_0_63,hypothesis,
second(f8(a,a_function)) = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_43])]) ).
cnf(c_0_64,plain,
( f24(non_ordered_pair(X1,X1)) = X1
| non_ordered_pair(X1,X1) = empty_set ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_58])]) ).
cnf(c_0_65,plain,
( X1 = empty_set
| ~ member(X2,f24(X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,axiom,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
subset1 ).
cnf(c_0_67,plain,
subset(image(non_ordered_pair(X1,X1),X2),apply(X2,X1)),
inference(rw,[status(thm)],[c_0_61,c_0_27]) ).
cnf(c_0_68,hypothesis,
( member(b,image(X1,a_function))
| ~ member(a,X1) ),
inference(rw,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
( non_ordered_pair(X1,X1) = empty_set
| member(X1,non_ordered_pair(X1,X1)) ),
inference(spm,[status(thm)],[c_0_54,c_0_64]) ).
cnf(c_0_70,plain,
( X1 = empty_set
| ~ member(f24(X1),f24(X1)) ),
inference(spm,[status(thm)],[c_0_65,c_0_54]) ).
cnf(c_0_71,plain,
( member(X1,apply(X2,X3))
| ~ member(X1,image(non_ordered_pair(X3,X3),X2)) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,hypothesis,
( non_ordered_pair(a,a) = empty_set
| member(b,image(non_ordered_pair(a,a),a_function)) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,axiom,
( member(X1,non_ordered_pair(X2,X3))
| ~ little_set(X1)
| X1 != X2 ),
non_ordered_pair2 ).
cnf(c_0_74,plain,
( non_ordered_pair(X1,X1) = empty_set
| ~ member(X1,X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_64]) ).
cnf(c_0_75,hypothesis,
( non_ordered_pair(a,a) = empty_set
| member(b,b) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_52]) ).
cnf(c_0_76,axiom,
( little_set(apply(X1,X2))
| ~ function(X1) ),
function_values_are_small ).
cnf(c_0_77,plain,
( member(X1,non_ordered_pair(X1,X2))
| ~ little_set(X1) ),
inference(er,[status(thm)],[c_0_73]) ).
cnf(c_0_78,hypothesis,
( non_ordered_pair(a,a) = empty_set
| non_ordered_pair(b,b) = empty_set ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,hypothesis,
little_set(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_52]),c_0_42])]) ).
cnf(c_0_80,axiom,
~ member(X1,empty_set),
empty_set ).
cnf(c_0_81,axiom,
( little_set(X1)
| ~ member(X1,X2) ),
a2 ).
cnf(c_0_82,hypothesis,
non_ordered_pair(a,a) = empty_set,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]),c_0_80]) ).
cnf(c_0_83,hypothesis,
little_set(a),
inference(spm,[status(thm)],[c_0_81,c_0_36]) ).
cnf(c_0_84,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_82]),c_0_83])]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET037-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 09:02:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.58 start to proof: theBenchmark
% 2.06/2.29 % Version : CSE_E---1.5
% 2.06/2.29 % Problem : theBenchmark.p
% 2.06/2.29 % Proof found
% 2.06/2.29 % SZS status Theorem for theBenchmark.p
% 2.06/2.29 % SZS output start Proof
% See solution above
% 2.06/2.29 % Total time : 1.695000 s
% 2.06/2.29 % SZS output end Proof
% 2.06/2.29 % Total time : 1.700000 s
%------------------------------------------------------------------------------