TSTP Solution File: SEU141+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU141+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 : n015.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:22:42 EDT 2023
% Result : Theorem 60.46s 60.60s
% Output : CNFRefutation 60.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 24
% Syntax : Number of formulae : 88 ( 17 unt; 15 typ; 0 def)
% Number of atoms : 205 ( 69 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 214 ( 82 ~; 100 |; 23 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 10 >; 11 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 171 ( 15 sgn; 57 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_24,type,
subset: ( $i * $i ) > $o ).
tff(decl_25,type,
set_difference: ( $i * $i ) > $i ).
tff(decl_26,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_27,type,
empty_set: $i ).
tff(decl_28,type,
empty: $i > $o ).
tff(decl_29,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_30,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_31,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_32,type,
esk4_0: $i ).
tff(decl_33,type,
esk5_0: $i ).
tff(decl_34,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk7_0: $i ).
tff(decl_36,type,
esk8_0: $i ).
fof(t4_xboole_0,axiom,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_boole) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(t83_xboole_1,conjecture,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(c_0_9,plain,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t4_xboole_0]) ).
fof(c_0_10,plain,
! [X35,X36] :
( ( ~ disjoint(X35,X36)
| set_intersection2(X35,X36) = empty_set )
& ( set_intersection2(X35,X36) != empty_set
| disjoint(X35,X36) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])]) ).
fof(c_0_11,plain,
! [X43] : set_intersection2(X43,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_12,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( in(X20,X17)
| ~ in(X20,X19)
| X19 != set_intersection2(X17,X18) )
& ( in(X20,X18)
| ~ in(X20,X19)
| X19 != set_intersection2(X17,X18) )
& ( ~ in(X21,X17)
| ~ in(X21,X18)
| in(X21,X19)
| X19 != set_intersection2(X17,X18) )
& ( ~ in(esk2_3(X22,X23,X24),X24)
| ~ in(esk2_3(X22,X23,X24),X22)
| ~ in(esk2_3(X22,X23,X24),X23)
| X24 = set_intersection2(X22,X23) )
& ( in(esk2_3(X22,X23,X24),X22)
| in(esk2_3(X22,X23,X24),X24)
| X24 = set_intersection2(X22,X23) )
& ( in(esk2_3(X22,X23,X24),X23)
| in(esk2_3(X22,X23,X24),X24)
| X24 = set_intersection2(X22,X23) ) ),
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_xboole_0])])])])])]) ).
fof(c_0_13,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_14,plain,
! [X46,X47,X49,X50,X51] :
( ( disjoint(X46,X47)
| in(esk6_2(X46,X47),set_intersection2(X46,X47)) )
& ( ~ in(X51,set_intersection2(X49,X50))
| ~ disjoint(X49,X50) ) ),
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_9])])])])]) ).
cnf(c_0_15,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X26,X27,X28,X29,X30,X31,X32,X33] :
( ( in(X29,X26)
| ~ in(X29,X28)
| X28 != set_difference(X26,X27) )
& ( ~ in(X29,X27)
| ~ in(X29,X28)
| X28 != set_difference(X26,X27) )
& ( ~ in(X30,X26)
| in(X30,X27)
| in(X30,X28)
| X28 != set_difference(X26,X27) )
& ( ~ in(esk3_3(X31,X32,X33),X33)
| ~ in(esk3_3(X31,X32,X33),X31)
| in(esk3_3(X31,X32,X33),X32)
| X33 = set_difference(X31,X32) )
& ( in(esk3_3(X31,X32,X33),X31)
| in(esk3_3(X31,X32,X33),X33)
| X33 = set_difference(X31,X32) )
& ( ~ in(esk3_3(X31,X32,X33),X32)
| in(esk3_3(X31,X32,X33),X33)
| X33 = set_difference(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)],[c_0_13])])])])])]) ).
cnf(c_0_19,plain,
( ~ in(X1,set_intersection2(X2,X3))
| ~ disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
disjoint(X1,empty_set),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( in(esk2_3(X1,X2,X3),X2)
| in(esk2_3(X1,X2,X3),X3)
| X3 = set_intersection2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
~ in(X1,empty_set),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]) ).
fof(c_0_25,negated_conjecture,
~ ! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[t83_xboole_1]) ).
fof(c_0_26,plain,
! [X53,X54] :
( ~ in(X53,X54)
| ~ empty(X54) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
cnf(c_0_27,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),set_intersection2(X4,X3))
| in(esk2_3(X2,X3,X1),X1)
| ~ in(esk2_3(X2,X3,X1),X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( in(esk2_3(X1,X2,X3),X1)
| in(esk2_3(X1,X2,X3),X3)
| X3 = set_intersection2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk2_3(X1,X2,empty_set),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
fof(c_0_31,plain,
! [X7,X8] : set_intersection2(X7,X8) = set_intersection2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_32,negated_conjecture,
( ( ~ disjoint(esk7_0,esk8_0)
| set_difference(esk7_0,esk8_0) != esk7_0 )
& ( disjoint(esk7_0,esk8_0)
| set_difference(esk7_0,esk8_0) = esk7_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
cnf(c_0_33,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),set_intersection2(X2,X3))
| in(esk2_3(X2,X3,X1),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( set_intersection2(X1,X2) = empty_set
| ~ in(esk2_3(X1,X2,empty_set),set_difference(X3,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,negated_conjecture,
( disjoint(esk7_0,esk8_0)
| set_difference(esk7_0,esk8_0) = esk7_0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| ~ empty(set_intersection2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
set_intersection2(X1,set_difference(X2,X1)) = empty_set,
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_24]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( set_difference(esk7_0,esk8_0) = esk7_0
| set_intersection2(esk7_0,esk8_0) = empty_set ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( in(esk3_3(X1,X2,X3),X1)
| in(esk3_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_44,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X3,X2,X1),X1)
| ~ empty(set_intersection2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
set_intersection2(esk7_0,esk8_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_36])]) ).
cnf(c_0_46,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_47,plain,
( set_difference(X1,X2) = X1
| in(esk3_3(X1,X2,X1),X1) ),
inference(ef,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
( in(esk3_3(X1,X2,X3),X2)
| X3 = set_difference(X1,X2)
| ~ in(esk3_3(X1,X2,X3),X3)
| ~ in(esk3_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_49,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( X1 = empty_set
| in(esk2_3(esk8_0,esk7_0,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_51,plain,
( set_difference(X1,X2) = X1
| ~ in(esk3_3(X1,X2,X1),set_difference(X3,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_47]) ).
cnf(c_0_52,plain,
( set_difference(X1,X2) = X1
| in(esk3_3(X1,X2,X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_47]),c_0_47]) ).
cnf(c_0_53,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X4 != set_difference(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_54,plain,
( set_difference(X1,X2) = set_intersection2(X3,X4)
| in(esk2_3(X3,X4,set_difference(X1,X2)),X4)
| in(esk2_3(X3,X4,set_difference(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_22]) ).
cnf(c_0_55,plain,
( X3 = set_intersection2(X1,X2)
| ~ in(esk2_3(X1,X2,X3),X3)
| ~ in(esk2_3(X1,X2,X3),X1)
| ~ in(esk2_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_56,negated_conjecture,
( X1 = empty_set
| ~ in(esk2_3(esk8_0,esk7_0,X1),set_difference(X2,X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_50]) ).
cnf(c_0_57,plain,
set_difference(X1,set_difference(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_59,plain,
( set_difference(X1,X2) = set_intersection2(X3,X1)
| in(esk2_3(X3,X1,set_difference(X1,X2)),X1) ),
inference(ef,[status(thm)],[c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( X1 = empty_set
| ~ in(esk2_3(esk8_0,esk7_0,X1),esk7_0)
| ~ in(esk2_3(esk8_0,esk7_0,X1),esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_50]),c_0_36]),c_0_45])]) ).
cnf(c_0_61,negated_conjecture,
( set_difference(X1,X2) = empty_set
| ~ in(esk2_3(esk8_0,esk7_0,set_difference(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
( set_difference(X1,X2) = set_intersection2(X3,X1)
| in(esk2_3(X3,X1,set_difference(X1,X2)),set_difference(X1,X4))
| in(esk2_3(X3,X1,set_difference(X1,X2)),X4) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( set_difference(esk7_0,X1) = empty_set
| ~ in(esk2_3(esk8_0,esk7_0,set_difference(esk7_0,X1)),esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_59]),c_0_36]),c_0_45])]) ).
cnf(c_0_64,negated_conjecture,
( set_difference(esk7_0,set_difference(esk7_0,X1)) = empty_set
| in(esk2_3(esk8_0,esk7_0,set_difference(esk7_0,set_difference(esk7_0,X1))),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_36]),c_0_45])]) ).
cnf(c_0_65,plain,
( set_difference(X1,X2) = X1
| in(esk3_3(X1,X2,X1),set_difference(X1,X3))
| in(esk3_3(X1,X2,X1),X3) ),
inference(spm,[status(thm)],[c_0_58,c_0_47]) ).
cnf(c_0_66,negated_conjecture,
set_difference(esk7_0,set_difference(esk7_0,esk8_0)) = empty_set,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( ~ disjoint(esk7_0,esk8_0)
| set_difference(esk7_0,esk8_0) != esk7_0 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_68,negated_conjecture,
disjoint(esk7_0,esk8_0),
inference(spm,[status(thm)],[c_0_15,c_0_45]) ).
cnf(c_0_69,plain,
( set_difference(X1,X2) = X1
| ~ in(esk3_3(X1,X2,X1),set_difference(X3,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_52]) ).
cnf(c_0_70,negated_conjecture,
( set_difference(esk7_0,X1) = esk7_0
| in(esk3_3(esk7_0,X1,esk7_0),set_difference(esk7_0,esk8_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_24]) ).
cnf(c_0_71,negated_conjecture,
set_difference(esk7_0,esk8_0) != esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU141+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.34 % Computer : n015.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Wed Aug 23 14:38:35 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.19/0.58 start to proof: theBenchmark
% 60.46/60.60 % Version : CSE_E---1.5
% 60.46/60.60 % Problem : theBenchmark.p
% 60.46/60.60 % Proof found
% 60.46/60.60 % SZS status Theorem for theBenchmark.p
% 60.46/60.60 % SZS output start Proof
% See solution above
% 60.52/60.61 % Total time : 59.944000 s
% 60.52/60.61 % SZS output end Proof
% 60.52/60.61 % Total time : 59.950000 s
%------------------------------------------------------------------------------