TSTP Solution File: SEU387+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU387+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Tue Jul 19 09:19:35 EDT 2022
% Result : Theorem 0.26s 3.47s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 67 ( 29 unt; 0 def)
% Number of atoms : 232 ( 20 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 273 ( 108 ~; 90 |; 64 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 24 ( 22 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 106 ( 35 sgn 62 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_subset) ).
fof(t4_waybel_7,lemma,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_waybel_7) ).
fof(dt_k3_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> element(bottom_of_relstr(X1),the_carrier(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k3_yellow_0) ).
fof(t18_yellow_1,lemma,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t18_yellow_1) ).
fof(dt_k3_yellow_1,axiom,
! [X1] :
( strict_rel_str(boole_POSet(X1))
& rel_str(boole_POSet(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k3_yellow_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d10_xboole_0) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(t2_yellow19,conjecture,
! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_yellow19) ).
fof(t8_waybel_7,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& transitive_relstr(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,X1)
& upper_relstr_subset(X2,X1)
& element(X2,powerset(the_carrier(X1))) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_waybel_7) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_boole) ).
fof(fc1_waybel_1,axiom,
! [X1] :
( ~ empty_carrier(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1))
& with_suprema_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& complete_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& up_complete_relstr(boole_POSet(X1))
& join_complete_relstr(boole_POSet(X1))
& distributive_relstr(boole_POSet(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_waybel_1) ).
fof(c_0_13,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| ~ empty(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
fof(c_0_14,lemma,
! [X2] : the_carrier(boole_POSet(X2)) = powerset(X2),
inference(variable_rename,[status(thm)],[t4_waybel_7]) ).
cnf(c_0_15,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,lemma,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X2] :
( ~ rel_str(X2)
| element(bottom_of_relstr(X2),the_carrier(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_yellow_0])]) ).
fof(c_0_18,lemma,
! [X2] : bottom_of_relstr(boole_POSet(X2)) = empty_set,
inference(variable_rename,[status(thm)],[t18_yellow_1]) ).
fof(c_0_19,plain,
! [X2,X2] :
( strict_rel_str(boole_POSet(X2))
& rel_str(boole_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k3_yellow_1])])]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_21,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk45_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk45_2(X4,X5),X5)
| subset(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)],[d3_tarski])])])])])])]) ).
cnf(c_0_22,plain,
( ~ empty(X1)
| ~ in(X3,X2)
| ~ element(X2,the_carrier(boole_POSet(X1))) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( element(bottom_of_relstr(X1),the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,lemma,
bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
rel_str(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(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)],[d10_xboole_0])])])])]) ).
cnf(c_0_27,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( subset(X1,X2)
| in(esk45_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( ~ empty(X1)
| ~ in(X2,empty_set) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
fof(c_0_30,plain,
empty(esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(c_0_31,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( subset(X1,X2)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( subset(empty_set,X1)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_34,plain,
empty(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_35,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(X1))
& upper_relstr_subset(X2,boole_POSet(X1))
& proper_element(X2,powerset(the_carrier(boole_POSet(X1))))
& element(X2,powerset(the_carrier(boole_POSet(X1)))) )
=> ! [X3] :
~ ( in(X3,X2)
& empty(X3) ) ) ),
inference(assume_negation,[status(cth)],[t2_yellow19]) ).
fof(c_0_36,lemma,
! [X3,X4] :
( ( ~ proper_element(X4,powerset(the_carrier(X3)))
| ~ in(bottom_of_relstr(X3),X4)
| empty(X4)
| ~ filtered_subset(X4,X3)
| ~ upper_relstr_subset(X4,X3)
| ~ element(X4,powerset(the_carrier(X3)))
| empty_carrier(X3)
| ~ reflexive_relstr(X3)
| ~ transitive_relstr(X3)
| ~ antisymmetric_relstr(X3)
| ~ lower_bounded_relstr(X3)
| ~ rel_str(X3) )
& ( in(bottom_of_relstr(X3),X4)
| proper_element(X4,powerset(the_carrier(X3)))
| empty(X4)
| ~ filtered_subset(X4,X3)
| ~ upper_relstr_subset(X4,X3)
| ~ element(X4,powerset(the_carrier(X3)))
| empty_carrier(X3)
| ~ reflexive_relstr(X3)
| ~ transitive_relstr(X3)
| ~ antisymmetric_relstr(X3)
| ~ lower_bounded_relstr(X3)
| ~ rel_str(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[t8_waybel_7])])])])])])]) ).
cnf(c_0_37,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_39,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
fof(c_0_40,negated_conjecture,
( ~ empty(esk1_0)
& ~ empty(esk2_0)
& filtered_subset(esk2_0,boole_POSet(esk1_0))
& upper_relstr_subset(esk2_0,boole_POSet(esk1_0))
& proper_element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0))))
& element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0))))
& in(esk3_0,esk2_0)
& empty(esk3_0) ),
inference(skolemize,[status(esa)],[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)],[c_0_35])])])])])]) ).
cnf(c_0_41,lemma,
( empty_carrier(X1)
| empty(X2)
| ~ rel_str(X1)
| ~ lower_bounded_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ transitive_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ upper_relstr_subset(X2,X1)
| ~ filtered_subset(X2,X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ proper_element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
( empty_set = X1
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
empty(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,lemma,
( empty_carrier(X1)
| empty(X2)
| ~ rel_str(X1)
| ~ reflexive_relstr(X1)
| ~ transitive_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ filtered_subset(X2,X1)
| ~ upper_relstr_subset(X2,X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ element(X2,the_carrier(boole_POSet(the_carrier(X1))))
| ~ proper_element(X2,the_carrier(boole_POSet(the_carrier(X1)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_16]),c_0_16]) ).
cnf(c_0_46,plain,
empty_set = esk6_0,
inference(spm,[status(thm)],[c_0_42,c_0_34]) ).
fof(c_0_47,plain,
! [X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2] :
( ~ empty_carrier(boole_POSet(X2))
& strict_rel_str(boole_POSet(X2))
& reflexive_relstr(boole_POSet(X2))
& transitive_relstr(boole_POSet(X2))
& antisymmetric_relstr(boole_POSet(X2))
& with_suprema_relstr(boole_POSet(X2))
& with_infima_relstr(boole_POSet(X2))
& complete_relstr(boole_POSet(X2))
& lower_bounded_relstr(boole_POSet(X2))
& upper_bounded_relstr(boole_POSet(X2))
& bounded_relstr(boole_POSet(X2))
& up_complete_relstr(boole_POSet(X2))
& join_complete_relstr(boole_POSet(X2))
& distributive_relstr(boole_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_waybel_1])])])]) ).
cnf(c_0_48,negated_conjecture,
( X1 = esk3_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,lemma,
( empty_carrier(X1)
| ~ proper_element(X2,the_carrier(boole_POSet(the_carrier(X1))))
| ~ upper_relstr_subset(X2,X1)
| ~ filtered_subset(X2,X1)
| ~ lower_bounded_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ transitive_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ element(X2,the_carrier(boole_POSet(the_carrier(X1))))
| ~ in(bottom_of_relstr(X1),X2)
| ~ rel_str(X1) ),
inference(csr,[status(thm)],[c_0_45,c_0_27]) ).
cnf(c_0_50,lemma,
bottom_of_relstr(boole_POSet(X1)) = esk6_0,
inference(rw,[status(thm)],[c_0_24,c_0_46]) ).
cnf(c_0_51,plain,
lower_bounded_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,plain,
antisymmetric_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,plain,
transitive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,plain,
reflexive_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
~ empty_carrier(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_57,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_58,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_59,negated_conjecture,
esk3_0 = esk6_0,
inference(spm,[status(thm)],[c_0_48,c_0_34]) ).
cnf(c_0_60,lemma,
( ~ proper_element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(X2)))))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(X2)))))
| ~ in(esk6_0,X1) ),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_53]),c_0_54]),c_0_25])]),c_0_55]) ).
cnf(c_0_61,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_62,negated_conjecture,
proper_element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(esk1_0))))),
inference(rw,[status(thm)],[c_0_56,c_0_16]) ).
cnf(c_0_63,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_64,negated_conjecture,
element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(esk1_0))))),
inference(rw,[status(thm)],[c_0_57,c_0_16]) ).
cnf(c_0_65,negated_conjecture,
in(esk6_0,esk2_0),
inference(rw,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
$false,
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_60,c_0_61]),c_0_62]),c_0_63]),c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU387+2 : TPTP v8.1.0. Released v3.3.0.
% 0.05/0.10 % Command : run_ET %s %d
% 0.09/0.30 % Computer : n011.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Mon Jun 20 11:39:54 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.26/3.47 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/3.47 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/3.47 # Preprocessing time : 0.054 s
% 0.26/3.47
% 0.26/3.47 # Proof found!
% 0.26/3.47 # SZS status Theorem
% 0.26/3.47 # SZS output start CNFRefutation
% See solution above
% 0.26/3.47 # Proof object total steps : 67
% 0.26/3.47 # Proof object clause steps : 40
% 0.26/3.47 # Proof object formula steps : 27
% 0.26/3.47 # Proof object conjectures : 15
% 0.26/3.47 # Proof object clause conjectures : 12
% 0.26/3.47 # Proof object formula conjectures : 3
% 0.26/3.47 # Proof object initial clauses used : 22
% 0.26/3.47 # Proof object initial formulas used : 13
% 0.26/3.47 # Proof object generating inferences : 11
% 0.26/3.47 # Proof object simplifying inferences : 23
% 0.26/3.47 # Training examples: 0 positive, 0 negative
% 0.26/3.47 # Parsed axioms : 860
% 0.26/3.47 # Removed by relevancy pruning/SinE : 759
% 0.26/3.47 # Initial clauses : 380
% 0.26/3.47 # Removed in clause preprocessing : 48
% 0.26/3.47 # Initial clauses in saturation : 332
% 0.26/3.47 # Processed clauses : 14964
% 0.26/3.47 # ...of these trivial : 175
% 0.26/3.47 # ...subsumed : 12456
% 0.26/3.47 # ...remaining for further processing : 2333
% 0.26/3.47 # Other redundant clauses eliminated : 82
% 0.26/3.47 # Clauses deleted for lack of memory : 0
% 0.26/3.47 # Backward-subsumed : 231
% 0.26/3.47 # Backward-rewritten : 38
% 0.26/3.47 # Generated clauses : 46213
% 0.26/3.47 # ...of the previous two non-trivial : 42994
% 0.26/3.47 # Contextual simplify-reflections : 11432
% 0.26/3.47 # Paramodulations : 46051
% 0.26/3.47 # Factorizations : 6
% 0.26/3.47 # Equation resolutions : 156
% 0.26/3.47 # Current number of processed clauses : 2061
% 0.26/3.47 # Positive orientable unit clauses : 160
% 0.26/3.47 # Positive unorientable unit clauses: 0
% 0.26/3.47 # Negative unit clauses : 128
% 0.26/3.47 # Non-unit-clauses : 1773
% 0.26/3.47 # Current number of unprocessed clauses: 23791
% 0.26/3.47 # ...number of literals in the above : 109265
% 0.26/3.47 # Current number of archived formulas : 0
% 0.26/3.47 # Current number of archived clauses : 270
% 0.26/3.47 # Clause-clause subsumption calls (NU) : 2319294
% 0.26/3.47 # Rec. Clause-clause subsumption calls : 1235181
% 0.26/3.47 # Non-unit clause-clause subsumptions : 18804
% 0.26/3.47 # Unit Clause-clause subsumption calls : 10355
% 0.26/3.47 # Rewrite failures with RHS unbound : 0
% 0.26/3.47 # BW rewrite match attempts : 47
% 0.26/3.47 # BW rewrite match successes : 15
% 0.26/3.47 # Condensation attempts : 0
% 0.26/3.47 # Condensation successes : 0
% 0.26/3.47 # Termbank termtop insertions : 602309
% 0.26/3.47
% 0.26/3.47 # -------------------------------------------------
% 0.26/3.47 # User time : 2.600 s
% 0.26/3.47 # System time : 0.023 s
% 0.26/3.47 # Total time : 2.623 s
% 0.26/3.47 # Maximum resident set size: 27296 pages
% 0.26/23.43 eprover: CPU time limit exceeded, terminating
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: CPU time limit exceeded, terminating
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: CPU time limit exceeded, terminating
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.51 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.51 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.51 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.51 eprover: No such file or directory
% 0.26/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.52 eprover: No such file or directory
% 0.26/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.52 eprover: No such file or directory
% 0.26/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.52 eprover: No such file or directory
% 0.26/23.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.53 eprover: No such file or directory
% 0.26/23.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.53 eprover: No such file or directory
% 0.26/23.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.54 eprover: No such file or directory
% 0.26/23.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.54 eprover: No such file or directory
% 0.26/23.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.55 eprover: No such file or directory
% 0.26/23.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.55 eprover: No such file or directory
%------------------------------------------------------------------------------