TSTP Solution File: SEU376+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU376+1 : TPTP v8.1.2. Released v3.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 16:25:15 EDT 2023
% Result : Theorem 0.18s 0.63s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 62
% Syntax : Number of formulae : 91 ( 8 unt; 57 typ; 0 def)
% Number of atoms : 274 ( 0 equ)
% Maximal formula atoms : 35 ( 8 avg)
% Number of connectives : 368 ( 128 ~; 158 |; 48 &)
% ( 6 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 80 ( 42 >; 38 *; 0 +; 0 <<)
% Number of predicates : 22 ( 21 usr; 1 prp; 0-3 aty)
% Number of functors : 36 ( 36 usr; 15 con; 0-4 aty)
% Number of variables : 93 ( 0 sgn; 48 !; 6 ?; 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,
relation: $i > $o ).
tff(decl_26,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(decl_27,type,
powerset: $i > $i ).
tff(decl_28,type,
element: ( $i * $i ) > $o ).
tff(decl_29,type,
rel_str: $i > $o ).
tff(decl_30,type,
empty_carrier: $i > $o ).
tff(decl_31,type,
v1_yellow_3: $i > $o ).
tff(decl_32,type,
one_to_one: $i > $o ).
tff(decl_33,type,
one_sorted_str: $i > $o ).
tff(decl_34,type,
net_str: ( $i * $i ) > $o ).
tff(decl_35,type,
is_eventually_in: ( $i * $i * $i ) > $o ).
tff(decl_36,type,
the_carrier: $i > $i ).
tff(decl_37,type,
related: ( $i * $i * $i ) > $o ).
tff(decl_38,type,
apply_netmap: ( $i * $i * $i ) > $i ).
tff(decl_39,type,
is_often_in: ( $i * $i * $i ) > $o ).
tff(decl_40,type,
directed_relstr: $i > $o ).
tff(decl_41,type,
the_mapping: ( $i * $i ) > $i ).
tff(decl_42,type,
apply_on_structs: ( $i * $i * $i * $i ) > $i ).
tff(decl_43,type,
quasi_total: ( $i * $i * $i ) > $o ).
tff(decl_44,type,
relation_of2: ( $i * $i * $i ) > $o ).
tff(decl_45,type,
relation_of2_as_subset: ( $i * $i * $i ) > $o ).
tff(decl_46,type,
empty_set: $i ).
tff(decl_47,type,
relation_empty_yielding: $i > $o ).
tff(decl_48,type,
apply: ( $i * $i ) > $i ).
tff(decl_49,type,
subset: ( $i * $i ) > $o ).
tff(decl_50,type,
transitive_relstr: $i > $o ).
tff(decl_51,type,
esk1_3: ( $i * $i * $i ) > $i ).
tff(decl_52,type,
esk2_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_53,type,
esk3_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_54,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
esk6_1: $i > $i ).
tff(decl_57,type,
esk7_1: $i > $i ).
tff(decl_58,type,
esk8_0: $i ).
tff(decl_59,type,
esk9_0: $i ).
tff(decl_60,type,
esk10_1: $i > $i ).
tff(decl_61,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_62,type,
esk12_1: $i > $i ).
tff(decl_63,type,
esk13_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk14_0: $i ).
tff(decl_65,type,
esk15_0: $i ).
tff(decl_66,type,
esk16_0: $i ).
tff(decl_67,type,
esk17_1: $i > $i ).
tff(decl_68,type,
esk18_0: $i ).
tff(decl_69,type,
esk19_0: $i ).
tff(decl_70,type,
esk20_1: $i > $i ).
tff(decl_71,type,
esk21_0: $i ).
tff(decl_72,type,
esk22_0: $i ).
tff(decl_73,type,
esk23_0: $i ).
tff(decl_74,type,
esk24_0: $i ).
tff(decl_75,type,
esk25_1: $i > $i ).
tff(decl_76,type,
esk26_0: $i ).
tff(decl_77,type,
esk27_0: $i ).
tff(decl_78,type,
esk28_0: $i ).
fof(d12_waybel_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_often_in(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X2))
=> ? [X5] :
( element(X5,the_carrier(X2))
& related(X2,X4,X5)
& in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d12_waybel_0) ).
fof(d5_yellow_6,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& rel_str(X1) )
=> ( directed_relstr(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ? [X4] :
( element(X4,the_carrier(X1))
& related(X1,X2,X4)
& related(X1,X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_yellow_6) ).
fof(d11_waybel_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
<=> ? [X4] :
( element(X4,the_carrier(X2))
& ! [X5] :
( element(X5,the_carrier(X2))
=> ( related(X2,X4,X5)
=> in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d11_waybel_0) ).
fof(dt_l1_waybel_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_waybel_0) ).
fof(t28_yellow_6,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_yellow_6) ).
fof(c_0_5,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_often_in(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X2))
=> ? [X5] :
( element(X5,the_carrier(X2))
& related(X2,X4,X5)
& in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d12_waybel_0]) ).
fof(c_0_6,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& rel_str(X1) )
=> ( directed_relstr(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ? [X4] :
( element(X4,the_carrier(X1))
& related(X1,X2,X4)
& related(X1,X3,X4) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d5_yellow_6]) ).
fof(c_0_7,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
<=> ? [X4] :
( element(X4,the_carrier(X2))
& ! [X5] :
( element(X5,the_carrier(X2))
=> ( related(X2,X4,X5)
=> in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d11_waybel_0]) ).
fof(c_0_8,plain,
! [X24,X25,X26,X27,X29,X31] :
( ( element(esk3_4(X24,X25,X26,X27),the_carrier(X25))
| ~ element(X27,the_carrier(X25))
| ~ is_often_in(X24,X25,X26)
| empty_carrier(X25)
| ~ net_str(X25,X24)
| empty_carrier(X24)
| ~ one_sorted_str(X24) )
& ( related(X25,X27,esk3_4(X24,X25,X26,X27))
| ~ element(X27,the_carrier(X25))
| ~ is_often_in(X24,X25,X26)
| empty_carrier(X25)
| ~ net_str(X25,X24)
| empty_carrier(X24)
| ~ one_sorted_str(X24) )
& ( in(apply_netmap(X24,X25,esk3_4(X24,X25,X26,X27)),X26)
| ~ element(X27,the_carrier(X25))
| ~ is_often_in(X24,X25,X26)
| empty_carrier(X25)
| ~ net_str(X25,X24)
| empty_carrier(X24)
| ~ one_sorted_str(X24) )
& ( element(esk4_3(X24,X25,X29),the_carrier(X25))
| is_often_in(X24,X25,X29)
| empty_carrier(X25)
| ~ net_str(X25,X24)
| empty_carrier(X24)
| ~ one_sorted_str(X24) )
& ( ~ element(X31,the_carrier(X25))
| ~ related(X25,esk4_3(X24,X25,X29),X31)
| ~ in(apply_netmap(X24,X25,X31),X29)
| is_often_in(X24,X25,X29)
| empty_carrier(X25)
| ~ net_str(X25,X24)
| empty_carrier(X24)
| ~ one_sorted_str(X24) ) ),
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_5])])])])])]) ).
fof(c_0_9,plain,
! [X32,X33,X34,X38] :
( ( element(esk5_3(X32,X33,X34),the_carrier(X32))
| ~ element(X34,the_carrier(X32))
| ~ element(X33,the_carrier(X32))
| ~ directed_relstr(X32)
| empty_carrier(X32)
| ~ rel_str(X32) )
& ( related(X32,X33,esk5_3(X32,X33,X34))
| ~ element(X34,the_carrier(X32))
| ~ element(X33,the_carrier(X32))
| ~ directed_relstr(X32)
| empty_carrier(X32)
| ~ rel_str(X32) )
& ( related(X32,X34,esk5_3(X32,X33,X34))
| ~ element(X34,the_carrier(X32))
| ~ element(X33,the_carrier(X32))
| ~ directed_relstr(X32)
| empty_carrier(X32)
| ~ rel_str(X32) )
& ( element(esk6_1(X32),the_carrier(X32))
| directed_relstr(X32)
| empty_carrier(X32)
| ~ rel_str(X32) )
& ( element(esk7_1(X32),the_carrier(X32))
| directed_relstr(X32)
| empty_carrier(X32)
| ~ rel_str(X32) )
& ( ~ element(X38,the_carrier(X32))
| ~ related(X32,esk6_1(X32),X38)
| ~ related(X32,esk7_1(X32),X38)
| directed_relstr(X32)
| empty_carrier(X32)
| ~ rel_str(X32) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_10,plain,
! [X50,X51] :
( ~ one_sorted_str(X50)
| ~ net_str(X51,X50)
| rel_str(X51) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_waybel_0])])]) ).
fof(c_0_11,plain,
! [X16,X17,X18,X20,X21,X22] :
( ( element(esk1_3(X16,X17,X18),the_carrier(X17))
| ~ is_eventually_in(X16,X17,X18)
| empty_carrier(X17)
| ~ net_str(X17,X16)
| empty_carrier(X16)
| ~ one_sorted_str(X16) )
& ( ~ element(X20,the_carrier(X17))
| ~ related(X17,esk1_3(X16,X17,X18),X20)
| in(apply_netmap(X16,X17,X20),X18)
| ~ is_eventually_in(X16,X17,X18)
| empty_carrier(X17)
| ~ net_str(X17,X16)
| empty_carrier(X16)
| ~ one_sorted_str(X16) )
& ( element(esk2_4(X16,X17,X21,X22),the_carrier(X17))
| ~ element(X22,the_carrier(X17))
| is_eventually_in(X16,X17,X21)
| empty_carrier(X17)
| ~ net_str(X17,X16)
| empty_carrier(X16)
| ~ one_sorted_str(X16) )
& ( related(X17,X22,esk2_4(X16,X17,X21,X22))
| ~ element(X22,the_carrier(X17))
| is_eventually_in(X16,X17,X21)
| empty_carrier(X17)
| ~ net_str(X17,X16)
| empty_carrier(X16)
| ~ one_sorted_str(X16) )
& ( ~ in(apply_netmap(X16,X17,esk2_4(X16,X17,X21,X22)),X21)
| ~ element(X22,the_carrier(X17))
| is_eventually_in(X16,X17,X21)
| empty_carrier(X17)
| ~ net_str(X17,X16)
| empty_carrier(X16)
| ~ one_sorted_str(X16) ) ),
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_7])])])])])]) ).
cnf(c_0_12,plain,
( is_often_in(X3,X2,X4)
| empty_carrier(X2)
| empty_carrier(X3)
| ~ element(X1,the_carrier(X2))
| ~ related(X2,esk4_3(X3,X2,X4),X1)
| ~ in(apply_netmap(X3,X2,X1),X4)
| ~ net_str(X2,X3)
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( related(X1,X2,esk5_3(X1,X2,X3))
| empty_carrier(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ directed_relstr(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( element(esk4_3(X1,X2,X3),the_carrier(X2))
| is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( rel_str(X2)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( in(apply_netmap(X3,X2,X1),X4)
| empty_carrier(X2)
| empty_carrier(X3)
| ~ element(X1,the_carrier(X2))
| ~ related(X2,esk1_3(X3,X2,X4),X1)
| ~ is_eventually_in(X3,X2,X4)
| ~ net_str(X2,X3)
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( related(X1,X2,esk5_3(X1,X3,X2))
| empty_carrier(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ directed_relstr(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( element(esk1_3(X1,X2,X3),the_carrier(X2))
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t28_yellow_6])]) ).
cnf(c_0_20,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ directed_relstr(X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk5_3(X2,esk4_3(X1,X2,X3),X4),the_carrier(X2))
| ~ element(X4,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk5_3(X2,esk4_3(X1,X2,X3),X4)),X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]) ).
cnf(c_0_21,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,esk5_3(X2,X3,esk1_3(X1,X2,X4))),X4)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X4)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk5_3(X2,X3,esk1_3(X1,X2,X4)),the_carrier(X2))
| ~ element(X3,the_carrier(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_15]) ).
fof(c_0_22,negated_conjecture,
( ~ empty_carrier(esk26_0)
& one_sorted_str(esk26_0)
& ~ empty_carrier(esk27_0)
& transitive_relstr(esk27_0)
& directed_relstr(esk27_0)
& net_str(esk27_0,esk26_0)
& is_eventually_in(esk26_0,esk27_0,esk28_0)
& ~ is_often_in(esk26_0,esk27_0,esk28_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_23,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk5_3(X2,esk4_3(X1,X2,X3),esk1_3(X1,X2,X3)),the_carrier(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_14]),c_0_18]) ).
cnf(c_0_24,plain,
( element(esk5_3(X1,X2,X3),the_carrier(X1))
| empty_carrier(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ directed_relstr(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
~ is_often_in(esk26_0,esk27_0,esk28_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14]),c_0_18]),c_0_15]) ).
cnf(c_0_27,negated_conjecture,
directed_relstr(esk27_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
is_eventually_in(esk26_0,esk27_0,esk28_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
net_str(esk27_0,esk26_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
one_sorted_str(esk26_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
~ empty_carrier(esk26_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
~ empty_carrier(esk27_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_29]),c_0_30])]),c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU376+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.33 % Computer : n022.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Aug 23 23:52:56 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.55 start to proof: theBenchmark
% 0.18/0.63 % Version : CSE_E---1.5
% 0.18/0.63 % Problem : theBenchmark.p
% 0.18/0.63 % Proof found
% 0.18/0.63 % SZS status Theorem for theBenchmark.p
% 0.18/0.63 % SZS output start Proof
% See solution above
% 0.18/0.63 % Total time : 0.072000 s
% 0.18/0.63 % SZS output end Proof
% 0.18/0.63 % Total time : 0.076000 s
%------------------------------------------------------------------------------