TSTP Solution File: SEU375+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU375+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:29 EDT 2022
% Result : Theorem 0.40s 24.57s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 61 ( 26 unt; 0 def)
% Number of atoms : 217 ( 14 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 257 ( 101 ~; 86 |; 34 &)
% ( 2 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 88 ( 1 sgn 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_yellow_6,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( ( ~ empty_carrier(X3)
& full_subnetstr(X3,X1,X2)
& subnetstr(X3,X1,X2) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( X4 = X6
& X5 = X7
& related(X2,X4,X5) )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t21_yellow_6) ).
fof(t61_yellow_0,lemma,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( ( full_subrelstr(X2,X1)
& subrelstr(X2,X1) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( X5 = X3
& X6 = X4
& related(X1,X3,X4)
& in(X5,the_carrier(X2))
& in(X6,the_carrier(X2)) )
=> related(X2,X5,X6) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t61_yellow_0) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t1_subset) ).
fof(dt_l1_waybel_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',dt_l1_waybel_0) ).
fof(d9_yellow_6,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> ( full_subnetstr(X3,X1,X2)
<=> ( full_subrelstr(X3,X2)
& subrelstr(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d9_yellow_6) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t2_subset) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t7_boole) ).
fof(d1_struct_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( empty_carrier(X1)
<=> empty(the_carrier(X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d1_struct_0) ).
fof(dt_m1_yellow_6,axiom,
! [X1,X2] :
( ( one_sorted_str(X1)
& net_str(X2,X1) )
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> net_str(X3,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',dt_m1_yellow_6) ).
fof(dt_l1_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',dt_l1_orders_2) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( ( ~ empty_carrier(X3)
& full_subnetstr(X3,X1,X2)
& subnetstr(X3,X1,X2) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( X4 = X6
& X5 = X7
& related(X2,X4,X5) )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t21_yellow_6]) ).
fof(c_0_11,lemma,
! [X7,X8,X9,X10,X11,X12] :
( ~ rel_str(X7)
| ~ full_subrelstr(X8,X7)
| ~ subrelstr(X8,X7)
| ~ element(X9,the_carrier(X7))
| ~ element(X10,the_carrier(X7))
| ~ element(X11,the_carrier(X8))
| ~ element(X12,the_carrier(X8))
| X11 != X9
| X12 != X10
| ~ related(X7,X9,X10)
| ~ in(X11,the_carrier(X8))
| ~ in(X12,the_carrier(X8))
| related(X8,X11,X12) ),
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)],[t61_yellow_0])])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ in(X3,X4)
| element(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_13,negated_conjecture,
( one_sorted_str(esk1_0)
& ~ empty_carrier(esk2_0)
& net_str(esk2_0,esk1_0)
& ~ empty_carrier(esk3_0)
& full_subnetstr(esk3_0,esk1_0,esk2_0)
& subnetstr(esk3_0,esk1_0,esk2_0)
& element(esk4_0,the_carrier(esk2_0))
& element(esk5_0,the_carrier(esk2_0))
& element(esk6_0,the_carrier(esk3_0))
& element(esk7_0,the_carrier(esk3_0))
& esk4_0 = esk6_0
& esk5_0 = esk7_0
& related(esk2_0,esk4_0,esk5_0)
& ~ related(esk3_0,esk6_0,esk7_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_10])])])])])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ one_sorted_str(X3)
| ~ net_str(X4,X3)
| rel_str(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)],[dt_l1_waybel_0])])])])]) ).
cnf(c_0_15,lemma,
( related(X1,X2,X3)
| ~ in(X3,the_carrier(X1))
| ~ in(X2,the_carrier(X1))
| ~ related(X4,X5,X6)
| X3 != X6
| X2 != X5
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ element(X6,the_carrier(X4))
| ~ element(X5,the_carrier(X4))
| ~ subrelstr(X1,X4)
| ~ full_subrelstr(X1,X4)
| ~ rel_str(X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
related(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
element(esk5_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( rel_str(X1)
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( ( full_subrelstr(X6,X5)
| ~ full_subnetstr(X6,X4,X5)
| ~ subnetstr(X6,X4,X5)
| ~ net_str(X5,X4)
| ~ one_sorted_str(X4) )
& ( subrelstr(X6,X5)
| ~ full_subnetstr(X6,X4,X5)
| ~ subnetstr(X6,X4,X5)
| ~ net_str(X5,X4)
| ~ one_sorted_str(X4) )
& ( ~ full_subrelstr(X6,X5)
| ~ subrelstr(X6,X5)
| full_subnetstr(X6,X4,X5)
| ~ subnetstr(X6,X4,X5)
| ~ net_str(X5,X4)
| ~ one_sorted_str(X4) ) ),
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)],[d9_yellow_6])])])])])]) ).
cnf(c_0_24,negated_conjecture,
~ related(esk3_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
esk4_0 = esk6_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,lemma,
( related(X1,X2,X3)
| ~ full_subrelstr(X1,X4)
| ~ subrelstr(X1,X4)
| ~ related(X4,X2,X3)
| ~ element(X3,the_carrier(X4))
| ~ element(X2,the_carrier(X4))
| ~ in(X3,the_carrier(X1))
| ~ in(X2,the_carrier(X1))
| ~ rel_str(X4) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_15,c_0_16]),c_0_16])])]) ).
cnf(c_0_27,negated_conjecture,
related(esk2_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_28,negated_conjecture,
element(esk7_0,the_carrier(esk2_0)),
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
element(esk4_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,negated_conjecture,
rel_str(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_31,plain,
( full_subrelstr(X3,X2)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ subnetstr(X3,X1,X2)
| ~ full_subnetstr(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
full_subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,negated_conjecture,
subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,plain,
( subrelstr(X3,X2)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ subnetstr(X3,X1,X2)
| ~ full_subnetstr(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,negated_conjecture,
~ related(esk3_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( related(X1,esk4_0,esk7_0)
| ~ full_subrelstr(X1,esk2_0)
| ~ subrelstr(X1,esk2_0)
| ~ in(esk7_0,the_carrier(X1))
| ~ in(esk4_0,the_carrier(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]),c_0_30])]) ).
cnf(c_0_37,negated_conjecture,
full_subrelstr(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_21]),c_0_22])]) ).
cnf(c_0_38,negated_conjecture,
subrelstr(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_32]),c_0_33]),c_0_21]),c_0_22])]) ).
fof(c_0_39,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_40,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_41,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])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ in(esk7_0,the_carrier(esk3_0))
| ~ in(esk4_0,the_carrier(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_43,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
element(esk7_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_45,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,negated_conjecture,
element(esk6_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_47,plain,
! [X4,X5,X6] :
( ~ one_sorted_str(X4)
| ~ net_str(X5,X4)
| ~ subnetstr(X6,X4,X5)
| net_str(X6,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)],[dt_m1_yellow_6])])])])]) ).
cnf(c_0_48,negated_conjecture,
~ empty_carrier(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_49,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_50,negated_conjecture,
~ in(esk4_0,the_carrier(esk3_0)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_51,negated_conjecture,
element(esk4_0,the_carrier(esk3_0)),
inference(rw,[status(thm)],[c_0_46,c_0_25]) ).
cnf(c_0_52,plain,
( net_str(X1,X2)
| ~ subnetstr(X1,X2,X3)
| ~ net_str(X3,X2)
| ~ one_sorted_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( ~ one_sorted_str(esk3_0)
| ~ empty(the_carrier(esk3_0)) ),
inference(pm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
empty(the_carrier(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_50,c_0_43]),c_0_51])]) ).
fof(c_0_55,plain,
! [X2] :
( ~ rel_str(X2)
| one_sorted_str(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])]) ).
cnf(c_0_56,negated_conjecture,
net_str(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_52,c_0_33]),c_0_21]),c_0_22])]) ).
cnf(c_0_57,negated_conjecture,
~ one_sorted_str(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_58,plain,
( one_sorted_str(X1)
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,negated_conjecture,
rel_str(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_20,c_0_56]),c_0_22])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU375+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 17:29:00 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.39/23.46 eprover: CPU time limit exceeded, terminating
% 0.39/23.46 eprover: CPU time limit exceeded, terminating
% 0.39/23.46 eprover: CPU time limit exceeded, terminating
% 0.39/23.46 eprover: CPU time limit exceeded, terminating
% 0.40/24.57 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.40/24.57
% 0.40/24.57 # Failure: Resource limit exceeded (time)
% 0.40/24.57 # OLD status Res
% 0.40/24.57 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.40/24.57 # Preprocessing time : 0.043 s
% 0.40/24.57 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.40/24.57 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.40/24.57 # Preprocessing time : 0.022 s
% 0.40/24.57
% 0.40/24.57 # Failure: Out of unprocessed clauses!
% 0.40/24.57 # OLD status GaveUp
% 0.40/24.57 # Parsed axioms : 769
% 0.40/24.57 # Removed by relevancy pruning/SinE : 752
% 0.40/24.57 # Initial clauses : 35
% 0.40/24.57 # Removed in clause preprocessing : 0
% 0.40/24.57 # Initial clauses in saturation : 35
% 0.40/24.57 # Processed clauses : 55
% 0.40/24.57 # ...of these trivial : 0
% 0.40/24.57 # ...subsumed : 1
% 0.40/24.57 # ...remaining for further processing : 54
% 0.40/24.57 # Other redundant clauses eliminated : 2
% 0.40/24.57 # Clauses deleted for lack of memory : 0
% 0.40/24.57 # Backward-subsumed : 0
% 0.40/24.57 # Backward-rewritten : 0
% 0.40/24.57 # Generated clauses : 23
% 0.40/24.57 # ...of the previous two non-trivial : 20
% 0.40/24.57 # Contextual simplify-reflections : 0
% 0.40/24.57 # Paramodulations : 22
% 0.40/24.57 # Factorizations : 0
% 0.40/24.57 # Equation resolutions : 2
% 0.40/24.57 # Current number of processed clauses : 53
% 0.40/24.57 # Positive orientable unit clauses : 22
% 0.40/24.57 # Positive unorientable unit clauses: 0
% 0.40/24.57 # Negative unit clauses : 4
% 0.40/24.57 # Non-unit-clauses : 27
% 0.40/24.57 # Current number of unprocessed clauses: 0
% 0.40/24.57 # ...number of literals in the above : 0
% 0.40/24.57 # Current number of archived formulas : 0
% 0.40/24.57 # Current number of archived clauses : 0
% 0.40/24.57 # Clause-clause subsumption calls (NU) : 182
% 0.40/24.57 # Rec. Clause-clause subsumption calls : 69
% 0.40/24.57 # Non-unit clause-clause subsumptions : 1
% 0.40/24.57 # Unit Clause-clause subsumption calls : 11
% 0.40/24.57 # Rewrite failures with RHS unbound : 0
% 0.40/24.57 # BW rewrite match attempts : 0
% 0.40/24.57 # BW rewrite match successes : 0
% 0.40/24.57 # Condensation attempts : 0
% 0.40/24.57 # Condensation successes : 0
% 0.40/24.57 # Termbank termtop insertions : 17328
% 0.40/24.57
% 0.40/24.57 # -------------------------------------------------
% 0.40/24.57 # User time : 0.019 s
% 0.40/24.57 # System time : 0.004 s
% 0.40/24.57 # Total time : 0.023 s
% 0.40/24.57 # Maximum resident set size: 4716 pages
% 0.40/24.57 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.40/24.57 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.40/24.57 # Preprocessing time : 0.022 s
% 0.40/24.57
% 0.40/24.57 # Proof found!
% 0.40/24.57 # SZS status Theorem
% 0.40/24.57 # SZS output start CNFRefutation
% See solution above
% 0.40/24.57 # Proof object total steps : 61
% 0.40/24.57 # Proof object clause steps : 40
% 0.40/24.57 # Proof object formula steps : 21
% 0.40/24.57 # Proof object conjectures : 32
% 0.40/24.57 # Proof object clause conjectures : 29
% 0.40/24.57 # Proof object formula conjectures : 3
% 0.40/24.57 # Proof object initial clauses used : 23
% 0.40/24.57 # Proof object initial formulas used : 10
% 0.40/24.57 # Proof object generating inferences : 11
% 0.40/24.57 # Proof object simplifying inferences : 40
% 0.40/24.57 # Training examples: 0 positive, 0 negative
% 0.40/24.57 # Parsed axioms : 769
% 0.40/24.57 # Removed by relevancy pruning/SinE : 710
% 0.40/24.57 # Initial clauses : 106
% 0.40/24.57 # Removed in clause preprocessing : 0
% 0.40/24.57 # Initial clauses in saturation : 106
% 0.40/24.57 # Processed clauses : 1405
% 0.40/24.57 # ...of these trivial : 2
% 0.40/24.57 # ...subsumed : 701
% 0.40/24.57 # ...remaining for further processing : 702
% 0.40/24.57 # Other redundant clauses eliminated : 8
% 0.40/24.57 # Clauses deleted for lack of memory : 0
% 0.40/24.57 # Backward-subsumed : 53
% 0.40/24.57 # Backward-rewritten : 34
% 0.40/24.57 # Generated clauses : 8412
% 0.40/24.57 # ...of the previous two non-trivial : 8175
% 0.40/24.57 # Contextual simplify-reflections : 305
% 0.40/24.57 # Paramodulations : 8360
% 0.40/24.57 # Factorizations : 26
% 0.40/24.57 # Equation resolutions : 29
% 0.40/24.57 # Current number of processed clauses : 610
% 0.40/24.57 # Positive orientable unit clauses : 42
% 0.40/24.57 # Positive unorientable unit clauses: 0
% 0.40/24.57 # Negative unit clauses : 30
% 0.40/24.57 # Non-unit-clauses : 538
% 0.40/24.57 # Current number of unprocessed clauses: 6520
% 0.40/24.57 # ...number of literals in the above : 22551
% 0.40/24.57 # Current number of archived formulas : 0
% 0.40/24.57 # Current number of archived clauses : 87
% 0.40/24.57 # Clause-clause subsumption calls (NU) : 56015
% 0.40/24.57 # Rec. Clause-clause subsumption calls : 38116
% 0.40/24.57 # Non-unit clause-clause subsumptions : 1009
% 0.40/24.57 # Unit Clause-clause subsumption calls : 2893
% 0.40/24.57 # Rewrite failures with RHS unbound : 0
% 0.40/24.57 # BW rewrite match attempts : 25
% 0.40/24.57 # BW rewrite match successes : 7
% 0.40/24.57 # Condensation attempts : 0
% 0.40/24.57 # Condensation successes : 0
% 0.40/24.57 # Termbank termtop insertions : 94043
% 0.40/24.57
% 0.40/24.57 # -------------------------------------------------
% 0.40/24.57 # User time : 0.112 s
% 0.40/24.57 # System time : 0.008 s
% 0.40/24.57 # Total time : 0.120 s
% 0.40/24.57 # Maximum resident set size: 10740 pages
% 0.40/46.47 eprover: CPU time limit exceeded, terminating
% 0.40/46.48 eprover: CPU time limit exceeded, terminating
% 0.40/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.49 eprover: No such file or directory
% 0.40/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.49 eprover: No such file or directory
% 0.40/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.49 eprover: No such file or directory
% 0.40/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.50 eprover: No such file or directory
% 0.40/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.50 eprover: No such file or directory
% 0.40/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.50 eprover: No such file or directory
% 0.40/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.50 eprover: No such file or directory
% 0.40/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.51 eprover: No such file or directory
% 0.40/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.51 eprover: No such file or directory
% 0.40/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.51 eprover: No such file or directory
% 0.40/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.52 eprover: No such file or directory
% 0.40/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.52 eprover: No such file or directory
% 0.40/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.52 eprover: No such file or directory
% 0.40/46.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.52 eprover: No such file or directory
% 0.40/46.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.53 eprover: No such file or directory
% 0.40/46.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.53 eprover: No such file or directory
% 0.40/46.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.53 eprover: No such file or directory
% 0.40/46.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.53 eprover: No such file or directory
% 0.40/46.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.54 eprover: No such file or directory
% 0.40/46.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.40/46.54 eprover: No such file or directory
%------------------------------------------------------------------------------