TSTP Solution File: SEU236+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU236+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n005.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:40 EDT 2023
% Result : Theorem 2.62s 2.77s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 50
% Syntax : Number of formulae : 114 ( 20 unt; 37 typ; 0 def)
% Number of atoms : 208 ( 20 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 204 ( 73 ~; 85 |; 25 &)
% ( 7 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 21 >; 7 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn; 59 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
function: $i > $o ).
tff(decl_25,type,
ordinal: $i > $o ).
tff(decl_26,type,
epsilon_transitive: $i > $o ).
tff(decl_27,type,
epsilon_connected: $i > $o ).
tff(decl_28,type,
relation: $i > $o ).
tff(decl_29,type,
one_to_one: $i > $o ).
tff(decl_30,type,
set_union2: ( $i * $i ) > $i ).
tff(decl_31,type,
ordinal_subset: ( $i * $i ) > $o ).
tff(decl_32,type,
succ: $i > $i ).
tff(decl_33,type,
singleton: $i > $i ).
tff(decl_34,type,
subset: ( $i * $i ) > $o ).
tff(decl_35,type,
element: ( $i * $i ) > $o ).
tff(decl_36,type,
empty_set: $i ).
tff(decl_37,type,
relation_empty_yielding: $i > $o ).
tff(decl_38,type,
relation_non_empty: $i > $o ).
tff(decl_39,type,
powerset: $i > $i ).
tff(decl_40,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_41,type,
esk2_1: $i > $i ).
tff(decl_42,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_43,type,
esk4_1: $i > $i ).
tff(decl_44,type,
esk5_0: $i ).
tff(decl_45,type,
esk6_0: $i ).
tff(decl_46,type,
esk7_0: $i ).
tff(decl_47,type,
esk8_0: $i ).
tff(decl_48,type,
esk9_0: $i ).
tff(decl_49,type,
esk10_0: $i ).
tff(decl_50,type,
esk11_0: $i ).
tff(decl_51,type,
esk12_0: $i ).
tff(decl_52,type,
esk13_0: $i ).
tff(decl_53,type,
esk14_0: $i ).
tff(decl_54,type,
esk15_0: $i ).
tff(decl_55,type,
esk16_0: $i ).
tff(decl_56,type,
esk17_0: $i ).
tff(decl_57,type,
esk18_0: $i ).
tff(decl_58,type,
esk19_0: $i ).
fof(fc3_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc3_ordinal1) ).
fof(t33_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(connectedness_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(t8_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(c_0_13,plain,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_simplification,[status(thm)],[fc3_ordinal1]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
inference(assume_negation,[status(cth)],[t33_ordinal1]) ).
fof(c_0_15,plain,
! [X41] :
( ( ~ empty(succ(X41))
| ~ ordinal(X41) )
& ( epsilon_transitive(succ(X41))
| ~ ordinal(X41) )
& ( epsilon_connected(succ(X41))
| ~ ordinal(X41) )
& ( ordinal(succ(X41))
| ~ ordinal(X41) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_16,plain,
! [X16] : succ(X16) = set_union2(X16,singleton(X16)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_17,plain,
! [X14,X15] :
( ~ ordinal(X14)
| ~ ordinal(X15)
| ordinal_subset(X14,X15)
| ordinal_subset(X15,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_ordinal1])]) ).
fof(c_0_18,negated_conjecture,
( ordinal(esk18_0)
& ordinal(esk19_0)
& ( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(succ(esk18_0),esk19_0) )
& ( in(esk18_0,esk19_0)
| ordinal_subset(succ(esk18_0),esk19_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_19,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
ordinal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X58,X59] :
( ( ~ ordinal_subset(X58,X59)
| subset(X58,X59)
| ~ ordinal(X58)
| ~ ordinal(X59) )
& ( ~ subset(X58,X59)
| ordinal_subset(X58,X59)
| ~ ordinal(X58)
| ~ ordinal(X59) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_24,negated_conjecture,
( in(esk18_0,esk19_0)
| ordinal_subset(succ(esk18_0),esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
ordinal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_27,plain,
! [X7] :
( ( epsilon_transitive(X7)
| ~ ordinal(X7) )
& ( epsilon_connected(X7)
| ~ ordinal(X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
cnf(c_0_28,negated_conjecture,
( ordinal_subset(esk19_0,X1)
| ordinal_subset(X1,esk19_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_29,plain,
! [X24,X25,X26] :
( ( ~ epsilon_transitive(X24)
| ~ in(X25,X24)
| subset(X25,X24) )
& ( in(esk2_1(X26),X26)
| epsilon_transitive(X26) )
& ( ~ subset(esk2_1(X26),X26)
| epsilon_transitive(X26) ) ),
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)],[d2_ordinal1])])])])])]) ).
cnf(c_0_30,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( in(esk18_0,esk19_0)
| ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(rw,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_32,negated_conjecture,
ordinal(set_union2(esk18_0,singleton(esk18_0))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_34,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( ~ in(X19,X18)
| X19 = X17
| X18 != singleton(X17) )
& ( X20 != X17
| in(X20,X18)
| X18 != singleton(X17) )
& ( ~ in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) != X21
| X22 = singleton(X21) )
& ( in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) = X21
| X22 = singleton(X21) ) ),
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)],[d1_tarski])])])])])]) ).
cnf(c_0_35,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| ordinal_subset(esk19_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
fof(c_0_36,plain,
! [X28,X29,X30,X31,X32] :
( ( ~ subset(X28,X29)
| ~ in(X30,X28)
| in(X30,X29) )
& ( in(esk3_2(X31,X32),X31)
| subset(X31,X32) )
& ( ~ in(esk3_2(X31,X32),X32)
| subset(X31,X32) ) ),
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_37,plain,
( subset(X2,X1)
| ~ epsilon_transitive(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| in(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22])]),c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
epsilon_transitive(esk19_0),
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
fof(c_0_40,plain,
! [X63] : in(X63,succ(X63)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
cnf(c_0_41,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( subset(esk19_0,esk18_0)
| ordinal_subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_35]),c_0_26]),c_0_22])]) ).
cnf(c_0_43,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_45,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_48,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_49,negated_conjecture,
( subset(esk19_0,esk18_0)
| subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_42]),c_0_22]),c_0_26])]) ).
cnf(c_0_50,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(X1,esk19_0)
| ~ in(X1,set_union2(esk18_0,singleton(esk18_0))) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[c_0_45,c_0_20]) ).
cnf(c_0_52,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_53,plain,
( esk3_2(singleton(X1),X2) = X1
| subset(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
fof(c_0_54,plain,
! [X4,X5] :
( ~ in(X4,X5)
| ~ in(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])]) ).
cnf(c_0_55,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(X1,esk18_0)
| ~ in(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
fof(c_0_58,plain,
! [X84,X85,X86] :
( ~ subset(X84,X85)
| ~ subset(X86,X85)
| subset(set_union2(X84,X86),X85) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])]) ).
cnf(c_0_59,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(esk18_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| subset(singleton(esk18_0),esk19_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_38]) ).
cnf(c_0_62,plain,
( subset(set_union2(X1,X3),X2)
| ~ subset(X1,X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_63,negated_conjecture,
subset(esk18_0,esk19_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( subset(singleton(esk18_0),esk19_0)
| in(X1,esk19_0)
| ~ in(X1,set_union2(esk18_0,singleton(esk18_0))) ),
inference(spm,[status(thm)],[c_0_43,c_0_61]) ).
fof(c_0_65,plain,
! [X12,X13] : set_union2(X12,X13) = set_union2(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_66,negated_conjecture,
( subset(set_union2(X1,esk18_0),esk19_0)
| ~ subset(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
subset(singleton(esk18_0),esk19_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_51]),c_0_57]) ).
cnf(c_0_68,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_69,negated_conjecture,
subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_70,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(succ(esk18_0),esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_71,negated_conjecture,
( in(X1,esk19_0)
| ~ in(X1,set_union2(esk18_0,singleton(esk18_0))) ),
inference(spm,[status(thm)],[c_0_43,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(rw,[status(thm)],[c_0_70,c_0_20]) ).
cnf(c_0_73,negated_conjecture,
in(esk18_0,esk19_0),
inference(spm,[status(thm)],[c_0_71,c_0_51]) ).
cnf(c_0_74,plain,
( ordinal_subset(X1,X2)
| ~ subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_75,negated_conjecture,
~ ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_69]),c_0_22]),c_0_32])]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU236+3 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 23 16:01:54 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 2.62/2.77 % Version : CSE_E---1.5
% 2.62/2.77 % Problem : theBenchmark.p
% 2.62/2.77 % Proof found
% 2.62/2.77 % SZS status Theorem for theBenchmark.p
% 2.62/2.77 % SZS output start Proof
% See solution above
% 2.62/2.78 % Total time : 2.178000 s
% 2.62/2.78 % SZS output end Proof
% 2.62/2.78 % Total time : 2.182000 s
%------------------------------------------------------------------------------