TSTP Solution File: SEU174+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU174+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n011.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 16:23:04 EDT 2023
% Result : Theorem 0.15s 0.63s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 66
% Syntax : Number of formulae : 120 ( 30 unt; 50 typ; 0 def)
% Number of atoms : 175 ( 51 equ)
% Maximal formula atoms : 26 ( 2 avg)
% Number of connectives : 178 ( 73 ~; 60 |; 26 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 93 ( 45 >; 48 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 43 ( 43 usr; 5 con; 0-4 aty)
% Number of variables : 121 ( 9 sgn; 75 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
proper_subset: ( $i * $i ) > $o ).
tff(decl_24,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_25,type,
set_union2: ( $i * $i ) > $i ).
tff(decl_26,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_27,type,
subset: ( $i * $i ) > $o ).
tff(decl_28,type,
singleton: $i > $i ).
tff(decl_29,type,
empty_set: $i ).
tff(decl_30,type,
powerset: $i > $i ).
tff(decl_31,type,
empty: $i > $o ).
tff(decl_32,type,
element: ( $i * $i ) > $o ).
tff(decl_33,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(decl_34,type,
ordered_pair: ( $i * $i ) > $i ).
tff(decl_35,type,
union: $i > $i ).
tff(decl_36,type,
set_difference: ( $i * $i ) > $i ).
tff(decl_37,type,
subset_complement: ( $i * $i ) > $i ).
tff(decl_38,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_39,type,
complements_of_subsets: ( $i * $i ) > $i ).
tff(decl_40,type,
are_equipotent: ( $i * $i ) > $o ).
tff(decl_41,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_42,type,
esk2_1: $i > $i ).
tff(decl_43,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_44,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_45,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_46,type,
esk6_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_47,type,
esk7_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_48,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_49,type,
esk9_3: ( $i * $i * $i ) > $i ).
tff(decl_50,type,
esk10_3: ( $i * $i * $i ) > $i ).
tff(decl_51,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_52,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_53,type,
esk13_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk14_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk15_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk16_3: ( $i * $i * $i ) > $i ).
tff(decl_57,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_58,type,
esk18_1: $i > $i ).
tff(decl_59,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_60,type,
esk20_1: $i > $i ).
tff(decl_61,type,
esk21_0: $i ).
tff(decl_62,type,
esk22_1: $i > $i ).
tff(decl_63,type,
esk23_0: $i ).
tff(decl_64,type,
esk24_1: $i > $i ).
tff(decl_65,type,
esk25_2: ( $i * $i ) > $i ).
tff(decl_66,type,
esk26_2: ( $i * $i ) > $i ).
tff(decl_67,type,
esk27_0: $i ).
tff(decl_68,type,
esk28_0: $i ).
tff(decl_69,type,
esk29_2: ( $i * $i ) > $i ).
tff(decl_70,type,
esk30_1: $i > $i ).
tff(decl_71,type,
esk31_2: ( $i * $i ) > $i ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(t46_setfam_1,conjecture,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( X2 != empty_set
& complements_of_subsets(X1,X2) = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_setfam_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(involutiveness_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k7_setfam_1) ).
fof(d8_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ! [X3] :
( element(X3,powerset(powerset(X1)))
=> ( X3 = complements_of_subsets(X1,X2)
<=> ! [X4] :
( element(X4,powerset(X1))
=> ( in(X4,X3)
<=> in(subset_complement(X1,X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_setfam_1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(dt_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(complements_of_subsets(X1,X2),powerset(powerset(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_setfam_1) ).
fof(l71_subset_1,lemma,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l71_subset_1) ).
fof(t3_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_boole) ).
fof(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_boole) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(t83_xboole_1,lemma,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(c_0_16,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( X2 != empty_set
& complements_of_subsets(X1,X2) = empty_set ) ),
inference(assume_negation,[status(cth)],[t46_setfam_1]) ).
fof(c_0_18,plain,
! [X26,X27,X28] :
( ( X26 != empty_set
| ~ in(X27,X26) )
& ( in(esk2_1(X28),X28)
| X28 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])]) ).
fof(c_0_19,plain,
! [X295] :
( ~ empty(X295)
| X295 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_20,plain,
empty(esk21_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_21,plain,
! [X139,X140] :
( ~ element(X140,powerset(powerset(X139)))
| complements_of_subsets(X139,complements_of_subsets(X139,X140)) = X140 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k7_setfam_1])]) ).
fof(c_0_22,negated_conjecture,
( element(esk28_0,powerset(powerset(esk27_0)))
& esk28_0 != empty_set
& complements_of_subsets(esk27_0,esk28_0) = empty_set ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_23,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
empty(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X115,X116,X117,X118] :
( ( ~ in(X118,X117)
| in(subset_complement(X115,X118),X116)
| ~ element(X118,powerset(X115))
| X117 != complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) )
& ( ~ in(subset_complement(X115,X118),X116)
| in(X118,X117)
| ~ element(X118,powerset(X115))
| X117 != complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) )
& ( element(esk17_3(X115,X116,X117),powerset(X115))
| X117 = complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) )
& ( ~ in(esk17_3(X115,X116,X117),X117)
| ~ in(subset_complement(X115,esk17_3(X115,X116,X117)),X116)
| X117 = complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) )
& ( in(esk17_3(X115,X116,X117),X117)
| in(subset_complement(X115,esk17_3(X115,X116,X117)),X116)
| X117 = complements_of_subsets(X115,X116)
| ~ element(X117,powerset(powerset(X115)))
| ~ element(X116,powerset(powerset(X115))) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_setfam_1])])])])]) ).
fof(c_0_27,plain,
! [X269,X270,X271] :
( ~ in(X269,X270)
| ~ element(X270,powerset(X271))
| element(X269,X271) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_28,plain,
! [X124,X125] :
( ~ element(X125,powerset(powerset(X124)))
| element(complements_of_subsets(X124,X125),powerset(powerset(X124))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_setfam_1])]) ).
cnf(c_0_29,plain,
( complements_of_subsets(X2,complements_of_subsets(X2,X1)) = X1
| ~ element(X1,powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
complements_of_subsets(esk27_0,esk28_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
element(esk28_0,powerset(powerset(esk27_0))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
empty_set = esk21_0,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_34,lemma,
! [X167,X168] :
( ( in(esk19_2(X167,X168),X167)
| element(X167,powerset(X168)) )
& ( ~ in(esk19_2(X167,X168),X168)
| element(X167,powerset(X168)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l71_subset_1])])])]) ).
cnf(c_0_35,plain,
( in(subset_complement(X3,X1),X4)
| ~ in(X1,X2)
| ~ element(X1,powerset(X3))
| X2 != complements_of_subsets(X3,X4)
| ~ element(X2,powerset(powerset(X3)))
| ~ element(X4,powerset(powerset(X3))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( element(complements_of_subsets(X2,X1),powerset(powerset(X2)))
| ~ element(X1,powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
complements_of_subsets(esk27_0,empty_set) = esk28_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_39,plain,
~ in(X1,esk21_0),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,lemma,
( in(esk19_2(X1,X2),X1)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_41,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t3_xboole_0]) ).
fof(c_0_42,plain,
! [X218] : set_intersection2(X218,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_43,lemma,
! [X266,X267] : set_difference(X266,set_difference(X266,X267)) = set_intersection2(X266,X267),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
cnf(c_0_44,plain,
( in(subset_complement(X1,X2),X3)
| ~ element(X3,powerset(powerset(X1)))
| ~ in(X2,complements_of_subsets(X1,X3)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[c_0_35,c_0_36])]),c_0_37]) ).
cnf(c_0_45,negated_conjecture,
complements_of_subsets(esk27_0,esk21_0) = esk28_0,
inference(rw,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_46,lemma,
element(esk21_0,powerset(X1)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_47,lemma,
! [X248,X249,X251,X252,X253] :
( ( in(esk26_2(X248,X249),X248)
| disjoint(X248,X249) )
& ( in(esk26_2(X248,X249),X249)
| disjoint(X248,X249) )
& ( ~ in(X253,X251)
| ~ in(X253,X252)
| ~ disjoint(X251,X252) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])])])]) ).
cnf(c_0_48,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_50,plain,
! [X245] : set_difference(X245,empty_set) = X245,
inference(variable_rename,[status(thm)],[t3_boole]) ).
fof(c_0_51,lemma,
! [X216,X217] :
( ~ subset(X216,X217)
| set_intersection2(X216,X217) = X216 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
fof(c_0_52,lemma,
! [X302,X303] :
( ( ~ disjoint(X302,X303)
| set_difference(X302,X303) = X302 )
& ( set_difference(X302,X303) != X302
| disjoint(X302,X303) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])]) ).
cnf(c_0_53,negated_conjecture,
~ in(X1,esk28_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),c_0_39]) ).
cnf(c_0_54,lemma,
( in(esk26_2(X1,X2),X1)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
set_difference(X1,set_difference(X1,empty_set)) = empty_set,
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
fof(c_0_57,plain,
! [X74,X75,X76,X77,X78] :
( ( ~ subset(X74,X75)
| ~ in(X76,X74)
| in(X76,X75) )
& ( in(esk11_2(X77,X78),X77)
| subset(X77,X78) )
& ( ~ in(esk11_2(X77,X78),X78)
| subset(X77,X78) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
cnf(c_0_58,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,lemma,
disjoint(esk28_0,X1),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,plain,
set_difference(X1,X1) = empty_set,
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
( in(esk11_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_63,negated_conjecture,
esk28_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_64,lemma,
( set_difference(X1,set_difference(X1,X2)) = X1
| ~ subset(X1,X2) ),
inference(rw,[status(thm)],[c_0_58,c_0_49]) ).
cnf(c_0_65,lemma,
set_difference(esk28_0,X1) = esk28_0,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
set_difference(X1,X1) = esk21_0,
inference(rw,[status(thm)],[c_0_61,c_0_33]) ).
cnf(c_0_67,negated_conjecture,
subset(esk28_0,X1),
inference(spm,[status(thm)],[c_0_53,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
esk28_0 != esk21_0,
inference(rw,[status(thm)],[c_0_63,c_0_33]) ).
cnf(c_0_69,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67])]),c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU174+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.31 % Computer : n011.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Wed Aug 23 19:44:22 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.53 start to proof: theBenchmark
% 0.15/0.62 % Version : CSE_E---1.5
% 0.15/0.62 % Problem : theBenchmark.p
% 0.15/0.62 % Proof found
% 0.15/0.63 % SZS status Theorem for theBenchmark.p
% 0.15/0.63 % SZS output start Proof
% See solution above
% 0.15/0.63 % Total time : 0.081000 s
% 0.15/0.63 % SZS output end Proof
% 0.15/0.63 % Total time : 0.085000 s
%------------------------------------------------------------------------------