TSTP Solution File: SEU394+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU394+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:38 EDT 2022
% Result : Theorem 0.31s 1.50s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 29 unt; 0 def)
% Number of atoms : 167 ( 23 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 185 ( 77 ~; 66 |; 29 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 68 ( 5 sgn 38 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_yellow19,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t15_yellow19) ).
fof(t2_yellow19,lemma,
! [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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_yellow19) ).
fof(t4_waybel_7,lemma,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_waybel_7) ).
fof(t14_yellow19,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> set_difference(X2,singleton(empty_set)) = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t14_yellow19) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_pre_topc) ).
fof(d1_struct_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( empty_carrier(X1)
<=> empty(the_carrier(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_struct_0) ).
fof(t65_zfmisc_1,lemma,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t65_zfmisc_1) ).
fof(t4_boole,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_boole) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',existence_m1_subset_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(assume_negation,[status(cth)],[t15_yellow19]) ).
fof(c_0_12,lemma,
! [X4,X5,X6] :
( empty(X4)
| empty(X5)
| ~ filtered_subset(X5,boole_POSet(X4))
| ~ upper_relstr_subset(X5,boole_POSet(X4))
| ~ proper_element(X5,powerset(the_carrier(boole_POSet(X4))))
| ~ element(X5,powerset(the_carrier(boole_POSet(X4))))
| ~ in(X6,X5)
| ~ empty(X6) ),
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)],[t2_yellow19])])])])])]) ).
fof(c_0_13,lemma,
! [X2] : the_carrier(boole_POSet(X2)) = powerset(X2),
inference(variable_rename,[status(thm)],[t4_waybel_7]) ).
fof(c_0_14,negated_conjecture,
( ~ empty_carrier(esk1_0)
& one_sorted_str(esk1_0)
& ~ empty(esk2_0)
& filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& esk2_0 != filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_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_11])])])])])]) ).
fof(c_0_15,lemma,
! [X3,X4] :
( empty_carrier(X3)
| ~ one_sorted_str(X3)
| empty(X4)
| ~ filtered_subset(X4,boole_POSet(cast_as_carrier_subset(X3)))
| ~ upper_relstr_subset(X4,boole_POSet(cast_as_carrier_subset(X3)))
| ~ element(X4,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X3)))))
| set_difference(X4,singleton(empty_set)) = filter_of_net_str(X3,net_of_bool_filter(X3,cast_as_carrier_subset(X3),X4)) ),
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)],[t14_yellow19])])])])])]) ).
cnf(c_0_16,lemma,
( empty(X2)
| empty(X3)
| ~ empty(X1)
| ~ in(X1,X2)
| ~ element(X2,powerset(the_carrier(boole_POSet(X3))))
| ~ proper_element(X2,powerset(the_carrier(boole_POSet(X3))))
| ~ upper_relstr_subset(X2,boole_POSet(X3))
| ~ filtered_subset(X2,boole_POSet(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,lemma,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
cnf(c_0_19,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X2] :
( ~ one_sorted_str(X2)
| cast_as_carrier_subset(X2) = the_carrier(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).
cnf(c_0_21,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X2] :
( ( ~ empty_carrier(X2)
| empty(the_carrier(X2))
| ~ one_sorted_str(X2) )
& ( ~ empty(the_carrier(X2))
| empty_carrier(X2)
| ~ one_sorted_str(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_struct_0])])]) ).
fof(c_0_23,lemma,
! [X3,X4,X3,X4] :
( ( set_difference(X3,singleton(X4)) != X3
| ~ in(X4,X3) )
& ( in(X4,X3)
| set_difference(X3,singleton(X4)) = X3 ) ),
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)],[t65_zfmisc_1])])])])]) ).
fof(c_0_24,plain,
! [X2] : set_difference(empty_set,X2) = empty_set,
inference(variable_rename,[status(thm)],[t4_boole]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_26,plain,
! [X3] : element(esk10_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_27,lemma,
( set_difference(X1,singleton(empty_set)) = filter_of_net_str(X2,net_of_bool_filter(X2,cast_as_carrier_subset(X2),X1))
| empty(X1)
| empty_carrier(X2)
| ~ element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X2)))))
| ~ upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X2)))
| ~ filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X2)))
| ~ one_sorted_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,lemma,
( empty(X3)
| empty(X2)
| ~ empty(X1)
| ~ in(X1,X2)
| ~ filtered_subset(X2,boole_POSet(X3))
| ~ upper_relstr_subset(X2,boole_POSet(X3))
| ~ element(X2,the_carrier(boole_POSet(the_carrier(boole_POSet(X3)))))
| ~ proper_element(X2,the_carrier(boole_POSet(the_carrier(boole_POSet(X3))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_29,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,negated_conjecture,
proper_element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))),
inference(rw,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_31,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_34,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_35,negated_conjecture,
element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))),
inference(rw,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_36,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_37,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_38,lemma,
( ~ in(X1,X2)
| set_difference(X2,singleton(X1)) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_39,plain,
set_difference(empty_set,X1) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_40,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_41,plain,
element(esk10_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_42,negated_conjecture,
esk2_0 != filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,lemma,
( set_difference(X1,singleton(empty_set)) = filter_of_net_str(X2,net_of_bool_filter(X2,cast_as_carrier_subset(X2),X1))
| empty_carrier(X2)
| empty(X1)
| ~ one_sorted_str(X2)
| ~ filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X2)))
| ~ upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X2)))
| ~ element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(cast_as_carrier_subset(X2)))))) ),
inference(rw,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_44,negated_conjecture,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,lemma,
( empty(X1)
| ~ proper_element(X2,the_carrier(boole_POSet(the_carrier(boole_POSet(X1)))))
| ~ upper_relstr_subset(X2,boole_POSet(X1))
| ~ filtered_subset(X2,boole_POSet(X1))
| ~ empty(X3)
| ~ element(X2,the_carrier(boole_POSet(the_carrier(boole_POSet(X1)))))
| ~ in(X3,X2) ),
inference(csr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_46,negated_conjecture,
proper_element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(the_carrier(esk1_0)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_47,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(the_carrier(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_32])]) ).
cnf(c_0_48,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(the_carrier(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_32])]) ).
cnf(c_0_49,negated_conjecture,
element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(the_carrier(esk1_0)))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_32])]) ).
cnf(c_0_50,negated_conjecture,
~ empty(the_carrier(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_32]),c_0_37]) ).
cnf(c_0_51,lemma,
~ in(X1,empty_set),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_52,plain,
( empty(X1)
| in(esk10_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_53,negated_conjecture,
set_difference(esk2_0,singleton(empty_set)) != esk2_0,
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_42,c_0_43]),c_0_33]),c_0_34]),c_0_35]),c_0_32])]),c_0_44]),c_0_37]) ).
cnf(c_0_54,lemma,
( set_difference(X1,singleton(X2)) = X1
| in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_55,lemma,
( ~ empty(X1)
| ~ in(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_49])]),c_0_50]) ).
cnf(c_0_56,lemma,
empty(empty_set),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,lemma,
in(empty_set,esk2_0),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU394+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n016.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 Jun 19 16:24:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.31/1.50 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.31/1.50 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.31/1.50 # Preprocessing time : 0.055 s
% 0.31/1.50
% 0.31/1.50 # Proof found!
% 0.31/1.50 # SZS status Theorem
% 0.31/1.50 # SZS output start CNFRefutation
% See solution above
% 0.31/1.50 # Proof object total steps : 59
% 0.31/1.50 # Proof object clause steps : 36
% 0.31/1.50 # Proof object formula steps : 23
% 0.31/1.50 # Proof object conjectures : 19
% 0.31/1.50 # Proof object clause conjectures : 16
% 0.31/1.50 # Proof object formula conjectures : 3
% 0.31/1.50 # Proof object initial clauses used : 19
% 0.31/1.50 # Proof object initial formulas used : 11
% 0.31/1.50 # Proof object generating inferences : 12
% 0.31/1.50 # Proof object simplifying inferences : 29
% 0.31/1.50 # Training examples: 0 positive, 0 negative
% 0.31/1.50 # Parsed axioms : 916
% 0.31/1.50 # Removed by relevancy pruning/SinE : 815
% 0.31/1.50 # Initial clauses : 361
% 0.31/1.50 # Removed in clause preprocessing : 2
% 0.31/1.50 # Initial clauses in saturation : 359
% 0.31/1.50 # Processed clauses : 567
% 0.31/1.50 # ...of these trivial : 16
% 0.31/1.50 # ...subsumed : 96
% 0.31/1.50 # ...remaining for further processing : 455
% 0.31/1.50 # Other redundant clauses eliminated : 29
% 0.31/1.50 # Clauses deleted for lack of memory : 0
% 0.31/1.50 # Backward-subsumed : 1
% 0.31/1.50 # Backward-rewritten : 23
% 0.31/1.50 # Generated clauses : 1857
% 0.31/1.50 # ...of the previous two non-trivial : 1749
% 0.31/1.50 # Contextual simplify-reflections : 29
% 0.31/1.50 # Paramodulations : 1801
% 0.31/1.50 # Factorizations : 4
% 0.31/1.50 # Equation resolutions : 52
% 0.31/1.50 # Current number of processed clauses : 415
% 0.31/1.50 # Positive orientable unit clauses : 74
% 0.31/1.50 # Positive unorientable unit clauses: 0
% 0.31/1.50 # Negative unit clauses : 32
% 0.31/1.50 # Non-unit-clauses : 309
% 0.31/1.50 # Current number of unprocessed clauses: 1439
% 0.31/1.50 # ...number of literals in the above : 6156
% 0.31/1.50 # Current number of archived formulas : 0
% 0.31/1.50 # Current number of archived clauses : 26
% 0.31/1.50 # Clause-clause subsumption calls (NU) : 19888
% 0.31/1.50 # Rec. Clause-clause subsumption calls : 4247
% 0.31/1.50 # Non-unit clause-clause subsumptions : 81
% 0.31/1.50 # Unit Clause-clause subsumption calls : 3001
% 0.31/1.50 # Rewrite failures with RHS unbound : 0
% 0.31/1.50 # BW rewrite match attempts : 78
% 0.31/1.50 # BW rewrite match successes : 10
% 0.31/1.50 # Condensation attempts : 0
% 0.31/1.50 # Condensation successes : 0
% 0.31/1.50 # Termbank termtop insertions : 70502
% 0.31/1.50
% 0.31/1.50 # -------------------------------------------------
% 0.31/1.50 # User time : 0.107 s
% 0.31/1.50 # System time : 0.007 s
% 0.31/1.50 # Total time : 0.114 s
% 0.31/1.50 # Maximum resident set size: 7936 pages
% 0.31/23.50 eprover: CPU time limit exceeded, terminating
% 0.31/23.52 eprover: CPU time limit exceeded, terminating
% 0.31/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.52 eprover: No such file or directory
% 0.31/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.52 eprover: No such file or directory
% 0.31/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.53 eprover: No such file or directory
% 0.31/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.53 eprover: No such file or directory
% 0.31/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.54 eprover: No such file or directory
% 0.31/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.54 eprover: No such file or directory
% 0.31/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.54 eprover: No such file or directory
% 0.31/23.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.55 eprover: No such file or directory
% 0.31/23.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.55 eprover: No such file or directory
% 0.31/23.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.55 eprover: No such file or directory
% 0.31/23.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.55 eprover: No such file or directory
% 0.31/23.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.55 eprover: No such file or directory
% 0.31/23.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.56 eprover: No such file or directory
% 0.31/23.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.56 eprover: No such file or directory
% 0.31/23.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.56 eprover: No such file or directory
% 0.31/23.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.56 eprover: No such file or directory
% 0.31/23.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.57 eprover: No such file or directory
% 0.31/23.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.31/23.57 eprover: No such file or directory
% 0.31/23.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.57 eprover: No such file or directory
% 0.31/23.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.58 eprover: No such file or directory
% 0.31/23.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.58 eprover: No such file or directory
% 0.31/23.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/23.59 eprover: No such file or directory
%------------------------------------------------------------------------------