%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET098+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 : 600s
% DateTime : Tue Jul 19 00:49:08 EDT 2022
% Result : Theorem 0.80s 107.97s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 70 ( 19 unt; 0 def)
% Number of atoms : 190 ( 36 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 196 ( 76 ~; 84 |; 28 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 157 ( 23 sgn 57 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(complement,axiom,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( member(X5,universal_class)
& ~ member(X5,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',complement) ).
fof(disjoint_defn,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ! [X3] :
~ ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',disjoint_defn) ).
fof(intersection,axiom,
! [X1,X2,X5] :
( member(X5,intersection(X1,X2))
<=> ( member(X5,X1)
& member(X5,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',intersection) ).
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(class_elements_are_sets,axiom,
! [X1] : subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(corollary_1_to_number_of_elements_in_class,conjecture,
! [X1] :
( X1 = null_class
| ? [X2] : singleton(X2) = X1
| ? [X4] :
( member(X4,X1)
& ? [X7] :
( member(X7,intersection(complement(singleton(X4)),X1))
& member(X7,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',corollary_1_to_number_of_elements_in_class) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X1,X2)
& subclass(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(regularity,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( member(X3,universal_class)
& member(X3,X1)
& disjoint(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(c_0_10,plain,
! [X6,X7,X6,X7] :
( ( member(X7,universal_class)
| ~ member(X7,complement(X6)) )
& ( ~ member(X7,X6)
| ~ member(X7,complement(X6)) )
& ( ~ member(X7,universal_class)
| member(X7,X6)
| member(X7,complement(X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[complement])])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ disjoint(X4,X5)
| ~ member(X6,X4)
| ~ member(X6,X5) )
& ( member(esk5_2(X4,X5),X4)
| disjoint(X4,X5) )
& ( member(esk5_2(X4,X5),X5)
| disjoint(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[disjoint_defn])])])])])])]) ).
fof(c_0_12,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( member(X8,X6)
| ~ member(X8,intersection(X6,X7)) )
& ( member(X8,X7)
| ~ member(X8,intersection(X6,X7)) )
& ( ~ member(X8,X6)
| ~ member(X8,X7)
| member(X8,intersection(X6,X7)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])])]) ).
fof(c_0_13,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subclass(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk1_2(X4,X5),X4)
| subclass(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subclass(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subclass_defn])])])])])])]) ).
fof(c_0_14,plain,
! [X2] : subclass(X2,universal_class),
inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).
cnf(c_0_15,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( disjoint(X1,X2)
| member(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( disjoint(X1,X2)
| member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( disjoint(complement(X1),X2)
| ~ member(esk5_2(complement(X1),X2),X1) ),
inference(pm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( disjoint(X1,intersection(X2,X3))
| member(esk5_2(X1,intersection(X2,X3)),X2) ),
inference(pm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(pm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( subclass(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,plain,
( ~ member(X1,X2)
| ~ member(X1,X3)
| ~ disjoint(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,plain,
disjoint(complement(X1),intersection(X1,X2)),
inference(pm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(esk1_2(X1,intersection(X2,X3)),X3)
| ~ member(esk1_2(X1,intersection(X2,X3)),X2) ),
inference(pm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( member(esk1_2(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(pm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_31,negated_conjecture,
~ ! [X1] :
( X1 = null_class
| ? [X2] : singleton(X2) = X1
| ? [X4] :
( member(X4,X1)
& ? [X7] :
( member(X7,intersection(complement(singleton(X4)),X1))
& member(X7,X1) ) ) ),
inference(assume_negation,[status(cth)],[corollary_1_to_number_of_elements_in_class]) ).
cnf(c_0_32,plain,
( ~ member(X1,intersection(X2,X3))
| ~ member(X1,complement(X2)) ),
inference(pm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_34,plain,
! [X3,X4,X3,X4] :
( ( subclass(X3,X4)
| X3 != X4 )
& ( subclass(X4,X3)
| X3 != X4 )
& ( ~ subclass(X3,X4)
| ~ subclass(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])])]) ).
cnf(c_0_35,plain,
( subclass(X1,intersection(X2,universal_class))
| ~ member(esk1_2(X1,intersection(X2,universal_class)),X2) ),
inference(pm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( member(esk1_2(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(pm,[status(thm)],[c_0_17,c_0_26]) ).
fof(c_0_37,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X4,universal_class)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 = X5
| X4 = X6
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 != X5
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) )
& ( X4 != X6
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])]) ).
fof(c_0_38,negated_conjecture,
! [X9,X10,X11] :
( esk8_0 != null_class
& singleton(X9) != esk8_0
& ( ~ member(X10,esk8_0)
| ~ member(X11,intersection(complement(singleton(X10)),esk8_0))
| ~ member(X11,esk8_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])])]) ).
fof(c_0_39,plain,
! [X2] : singleton(X2) = unordered_pair(X2,X2),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
cnf(c_0_40,plain,
( subclass(intersection(X1,X2),X3)
| ~ member(esk1_2(intersection(X1,X2),X3),complement(X1)) ),
inference(pm,[status(thm)],[c_0_32,c_0_26]) ).
cnf(c_0_41,plain,
( member(esk1_2(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_23,c_0_33]),c_0_30]) ).
cnf(c_0_42,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
subclass(X1,intersection(X1,universal_class)),
inference(pm,[status(thm)],[c_0_35,c_0_26]) ).
cnf(c_0_44,plain,
subclass(intersection(X1,X2),X1),
inference(pm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_45,plain,
( subclass(complement(X1),X2)
| ~ member(esk1_2(complement(X1),X2),X1) ),
inference(pm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_46,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( ~ member(X1,esk8_0)
| ~ member(X1,intersection(complement(singleton(X2)),esk8_0))
| ~ member(X2,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
subclass(intersection(X1,X2),complement(complement(X1))),
inference(pm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,plain,
intersection(X1,universal_class) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_51,plain,
( member(esk1_2(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_45,c_0_33]),c_0_30]) ).
cnf(c_0_52,plain,
( esk1_2(unordered_pair(X1,X2),X3) = X2
| esk1_2(unordered_pair(X1,X2),X3) = X1
| subclass(unordered_pair(X1,X2),X3) ),
inference(pm,[status(thm)],[c_0_46,c_0_26]) ).
cnf(c_0_53,negated_conjecture,
( ~ member(X2,esk8_0)
| ~ member(X1,esk8_0)
| ~ member(X1,intersection(complement(unordered_pair(X2,X2)),esk8_0)) ),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
subclass(X1,complement(complement(X1))),
inference(pm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
subclass(complement(complement(X1)),X1),
inference(pm,[status(thm)],[c_0_23,c_0_51]) ).
cnf(c_0_56,plain,
( esk1_2(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_52])]) ).
cnf(c_0_57,negated_conjecture,
( ~ member(X1,complement(unordered_pair(X2,X2)))
| ~ member(X2,esk8_0)
| ~ member(X1,esk8_0) ),
inference(pm,[status(thm)],[c_0_53,c_0_24]) ).
cnf(c_0_58,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_42,c_0_54]),c_0_55])]) ).
cnf(c_0_59,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(pm,[status(thm)],[c_0_23,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( subclass(X1,unordered_pair(X2,X2))
| ~ member(esk1_2(X1,unordered_pair(X2,X2)),esk8_0)
| ~ member(X2,esk8_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_57,c_0_41]),c_0_58]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
singleton(X1) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_62,plain,
( X1 = unordered_pair(X2,X2)
| ~ member(X2,X1)
| ~ subclass(X1,unordered_pair(X2,X2)) ),
inference(pm,[status(thm)],[c_0_42,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( subclass(esk8_0,unordered_pair(X1,X1))
| ~ member(X1,esk8_0) ),
inference(pm,[status(thm)],[c_0_60,c_0_26]) ).
cnf(c_0_64,negated_conjecture,
unordered_pair(X1,X1) != esk8_0,
inference(rw,[status(thm)],[c_0_61,c_0_48]) ).
fof(c_0_65,plain,
! [X4] :
( ( member(esk6_1(X4),universal_class)
| X4 = null_class )
& ( member(esk6_1(X4),X4)
| X4 = null_class )
& ( disjoint(esk6_1(X4),X4)
| X4 = null_class ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[regularity])])])])])]) ).
cnf(c_0_66,negated_conjecture,
~ member(X1,esk8_0),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_67,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_68,negated_conjecture,
esk8_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET098+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n018.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 : 600
% 0.13/0.34 % DateTime : Sun Jul 10 11:22:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.42 eprover: CPU time limit exceeded, terminating
% 0.34/23.48 eprover: CPU time limit exceeded, terminating
% 0.47/46.42 eprover: CPU time limit exceeded, terminating
% 0.47/46.43 eprover: CPU time limit exceeded, terminating
% 0.47/46.44 eprover: CPU time limit exceeded, terminating
% 0.47/46.51 eprover: CPU time limit exceeded, terminating
% 0.59/69.44 eprover: CPU time limit exceeded, terminating
% 0.59/69.44 eprover: CPU time limit exceeded, terminating
% 0.59/69.46 eprover: CPU time limit exceeded, terminating
% 0.59/69.55 eprover: CPU time limit exceeded, terminating
% 0.71/92.46 eprover: CPU time limit exceeded, terminating
% 0.71/92.47 eprover: CPU time limit exceeded, terminating
% 0.71/92.48 eprover: CPU time limit exceeded, terminating
% 0.71/92.56 eprover: CPU time limit exceeded, terminating
% 0.80/107.97 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.80/107.97
% 0.80/107.97 # Failure: Resource limit exceeded (time)
% 0.80/107.97 # OLD status Res
% 0.80/107.97 # Preprocessing time : 0.019 s
% 0.80/107.97 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.80/107.97
% 0.80/107.97 # Failure: Resource limit exceeded (time)
% 0.80/107.97 # OLD status Res
% 0.80/107.97 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.80/107.97 # Preprocessing time : 0.018 s
% 0.80/107.97 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 0.80/107.97
% 0.80/107.97 # Failure: Resource limit exceeded (time)
% 0.80/107.97 # OLD status Res
% 0.80/107.97 # Preprocessing time : 0.020 s
% 0.80/107.97 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 0.80/107.97
% 0.80/107.97 # Failure: Resource limit exceeded (time)
% 0.80/107.97 # OLD status Res
% 0.80/107.97 # Preprocessing time : 0.011 s
% 0.80/107.97 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 0.80/107.97 # Preprocessing time : 0.010 s
% 0.80/107.97
% 0.80/107.97 # Proof found!
% 0.80/107.97 # SZS status Theorem
% 0.80/107.97 # SZS output start CNFRefutation
% See solution above
% 0.80/107.97 # Proof object total steps : 70
% 0.80/107.97 # Proof object clause steps : 49
% 0.80/107.97 # Proof object formula steps : 21
% 0.80/107.97 # Proof object conjectures : 13
% 0.80/107.97 # Proof object clause conjectures : 10
% 0.80/107.97 # Proof object formula conjectures : 3
% 0.80/107.97 # Proof object initial clauses used : 18
% 0.80/107.97 # Proof object initial formulas used : 10
% 0.80/107.97 # Proof object generating inferences : 29
% 0.80/107.97 # Proof object simplifying inferences : 13
% 0.80/107.97 # Training examples: 0 positive, 0 negative
% 0.80/107.97 # Parsed axioms : 44
% 0.80/107.97 # Removed by relevancy pruning/SinE : 0
% 0.80/107.97 # Initial clauses : 92
% 0.80/107.97 # Removed in clause preprocessing : 8
% 0.80/107.97 # Initial clauses in saturation : 84
% 0.80/107.97 # Processed clauses : 10722
% 0.80/107.97 # ...of these trivial : 70
% 0.80/107.97 # ...subsumed : 6989
% 0.80/107.97 # ...remaining for further processing : 3663
% 0.80/107.97 # Other redundant clauses eliminated : 131
% 0.80/107.97 # Clauses deleted for lack of memory : 630856
% 0.80/107.97 # Backward-subsumed : 133
% 0.80/107.97 # Backward-rewritten : 228
% 0.80/107.97 # Generated clauses : 967678
% 0.80/107.97 # ...of the previous two non-trivial : 784070
% 0.80/107.97 # Contextual simplify-reflections : 2113
% 0.80/107.97 # Paramodulations : 967084
% 0.80/107.97 # Factorizations : 443
% 0.80/107.97 # Equation resolutions : 142
% 0.80/107.97 # Current number of processed clauses : 3294
% 0.80/107.97 # Positive orientable unit clauses : 161
% 0.80/107.97 # Positive unorientable unit clauses: 1
% 0.80/107.97 # Negative unit clauses : 10
% 0.80/107.97 # Non-unit-clauses : 3122
% 0.80/107.97 # Current number of unprocessed clauses: 95431
% 0.80/107.97 # ...number of literals in the above : 363767
% 0.80/107.97 # Current number of archived formulas : 0
% 0.80/107.97 # Current number of archived clauses : 369
% 0.80/107.97 # Clause-clause subsumption calls (NU) : 2779700
% 0.80/107.97 # Rec. Clause-clause subsumption calls : 1090754
% 0.80/107.97 # Non-unit clause-clause subsumptions : 7315
% 0.80/107.97 # Unit Clause-clause subsumption calls : 101355
% 0.80/107.97 # Rewrite failures with RHS unbound : 0
% 0.80/107.97 # BW rewrite match attempts : 1881
% 0.80/107.97 # BW rewrite match successes : 999
% 0.80/107.97 # Condensation attempts : 0
% 0.80/107.97 # Condensation successes : 0
% 0.80/107.97 # Termbank termtop insertions : 28526794
% 0.80/107.97
% 0.80/107.97 # -------------------------------------------------
% 0.80/107.97 # User time : 14.353 s
% 0.80/107.97 # System time : 0.138 s
% 0.80/107.97 # Total time : 14.491 s
% 0.80/107.97 # Maximum resident set size: 148008 pages
% 0.80/115.47 eprover: CPU time limit exceeded, terminating
% 0.80/115.48 eprover: CPU time limit exceeded, terminating
% 0.80/115.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/115.49 eprover: No such file or directory
% 0.80/115.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/115.49 eprover: No such file or directory
% 0.80/115.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/115.50 eprover: No such file or directory
% 0.80/115.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.80/115.50 eprover: No such file or directory
% 0.80/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/115.51 eprover: No such file or directory
% 0.80/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.80/115.51 eprover: No such file or directory
% 0.80/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/115.51 eprover: No such file or directory
% 0.80/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.80/115.51 eprover: No such file or directory
% 0.80/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/115.51 eprover: No such file or directory
% 0.80/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.80/115.52 eprover: No such file or directory
% 0.80/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/115.52 eprover: No such file or directory
% 0.80/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.80/115.52 eprover: No such file or directory
% 0.80/115.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.80/115.53 eprover: No such file or directory
% 0.80/115.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.80/115.53 eprover: No such file or directory
%------------------------------------------------------------------------------