TSTP Solution File: SEU367+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU367+2 : TPTP v8.1.0. Released v3.3.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 09:19:25 EDT 2022
% Result : Theorem 0.40s 25.60s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 48 ( 11 unt; 0 def)
% Number of atoms : 295 ( 0 equ)
% Maximal formula atoms : 35 ( 6 avg)
% Number of connectives : 390 ( 143 ~; 193 |; 32 &)
% ( 3 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-4 aty)
% Number of variables : 121 ( 5 sgn 45 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_waybel_0,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3,X4] :
( subset(X3,X4)
=> ( ( is_eventually_in(X1,X2,X3)
=> is_eventually_in(X1,X2,X4) )
& ( is_often_in(X1,X2,X3)
=> is_often_in(X1,X2,X4) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t8_waybel_0) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t1_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d3_tarski) ).
fof(d12_waybel_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_often_in(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X2))
=> ? [X5] :
( element(X5,the_carrier(X2))
& related(X2,X4,X5)
& in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d12_waybel_0) ).
fof(d11_waybel_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
<=> ? [X4] :
( element(X4,the_carrier(X2))
& ! [X5] :
( element(X5,the_carrier(X2))
=> ( related(X2,X4,X5)
=> in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d11_waybel_0) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3,X4] :
( subset(X3,X4)
=> ( ( is_eventually_in(X1,X2,X3)
=> is_eventually_in(X1,X2,X4) )
& ( is_often_in(X1,X2,X3)
=> is_often_in(X1,X2,X4) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t8_waybel_0]) ).
fof(c_0_7,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
fof(c_0_8,negated_conjecture,
( ~ empty_carrier(esk1_0)
& one_sorted_str(esk1_0)
& ~ empty_carrier(esk2_0)
& net_str(esk2_0,esk1_0)
& subset(esk3_0,esk4_0)
& ( is_often_in(esk1_0,esk2_0,esk3_0)
| is_eventually_in(esk1_0,esk2_0,esk3_0) )
& ( ~ is_often_in(esk1_0,esk2_0,esk4_0)
| is_eventually_in(esk1_0,esk2_0,esk3_0) )
& ( is_often_in(esk1_0,esk2_0,esk3_0)
| ~ is_eventually_in(esk1_0,esk2_0,esk4_0) )
& ( ~ is_often_in(esk1_0,esk2_0,esk4_0)
| ~ is_eventually_in(esk1_0,esk2_0,esk4_0) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_6])])])])])])]) ).
fof(c_0_9,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk10_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk10_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_10,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X6,X7,X8,X9,X8,X12] :
( ( element(esk5_4(X6,X7,X8,X9),the_carrier(X7))
| ~ element(X9,the_carrier(X7))
| ~ is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( related(X7,X9,esk5_4(X6,X7,X8,X9))
| ~ element(X9,the_carrier(X7))
| ~ is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( in(apply_netmap(X6,X7,esk5_4(X6,X7,X8,X9)),X8)
| ~ element(X9,the_carrier(X7))
| ~ is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( element(esk6_3(X6,X7,X8),the_carrier(X7))
| is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( ~ element(X12,the_carrier(X7))
| ~ related(X7,esk6_3(X6,X7,X8),X12)
| ~ in(apply_netmap(X6,X7,X12),X8)
| is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) ) ),
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)],[inference(fof_simplification,[status(thm)],[d12_waybel_0])])])])])])])]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( subset(X1,esk4_0)
| ~ subset(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ in(apply_netmap(X1,X2,X4),X3)
| ~ related(X2,esk6_3(X1,X2,X3),X4)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| related(X2,X4,esk5_4(X1,X2,X3,X4))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_often_in(X1,X2,X3)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| element(esk6_3(X1,X2,X3),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( in(X1,esk4_0)
| ~ subset(X2,esk3_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,esk5_4(X1,X2,X3,X4)),X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_often_in(X1,X2,X3)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X4)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_often_in(X4,X2,X5)
| ~ net_str(X2,X1)
| ~ net_str(X2,X4)
| ~ one_sorted_str(X1)
| ~ one_sorted_str(X4)
| ~ element(esk5_4(X4,X2,X5,esk6_3(X1,X2,X3)),the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk5_4(X4,X2,X5,esk6_3(X1,X2,X3))),X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X2,X1,esk5_4(X2,X1,X3,X4)),esk4_0)
| ~ is_often_in(X2,X1,X3)
| ~ net_str(X1,X2)
| ~ subset(X3,esk3_0)
| ~ one_sorted_str(X2)
| ~ element(X4,the_carrier(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_22,plain,
! [X6,X7,X8,X10,X8,X11] :
( ( element(esk7_3(X6,X7,X8),the_carrier(X7))
| ~ is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( ~ element(X10,the_carrier(X7))
| ~ related(X7,esk7_3(X6,X7,X8),X10)
| in(apply_netmap(X6,X7,X10),X8)
| ~ is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( element(esk8_4(X6,X7,X8,X11),the_carrier(X7))
| ~ element(X11,the_carrier(X7))
| is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( related(X7,X11,esk8_4(X6,X7,X8,X11))
| ~ element(X11,the_carrier(X7))
| is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( ~ in(apply_netmap(X6,X7,esk8_4(X6,X7,X8,X11)),X8)
| ~ element(X11,the_carrier(X7))
| is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) ) ),
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)],[inference(fof_simplification,[status(thm)],[d11_waybel_0])])])])])])])]) ).
cnf(c_0_23,negated_conjecture,
( is_often_in(X1,X2,esk4_0)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_often_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ subset(X3,esk3_0)
| ~ one_sorted_str(X1)
| ~ element(esk5_4(X1,X2,X3,esk6_3(X1,X2,esk4_0)),the_carrier(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]) ).
cnf(c_0_24,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk5_4(X1,X2,X3,X4),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_often_in(X1,X2,X3)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_26,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk8_4(X1,X2,X3,X4)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( in(X1,esk4_0)
| ~ in(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_28,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,X4),X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3)
| ~ related(X2,esk7_3(X1,X2,X3),X4)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X3)
| related(X2,X4,esk8_4(X1,X2,X3,X4))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk7_3(X1,X2,X3),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( is_often_in(X1,X2,esk4_0)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ is_often_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ subset(X3,esk3_0)
| ~ one_sorted_str(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17]) ).
cnf(c_0_32,negated_conjecture,
( is_often_in(esk1_0,esk2_0,esk3_0)
| ~ is_eventually_in(esk1_0,esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_36,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_37,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_38,negated_conjecture,
( ~ is_eventually_in(esk1_0,esk2_0,esk4_0)
| ~ is_often_in(esk1_0,esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_39,negated_conjecture,
( is_eventually_in(X1,X2,esk4_0)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(X3,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk8_4(X1,X2,esk4_0,X3)),esk3_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_40,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| empty_carrier(X4)
| in(apply_netmap(X4,X2,esk8_4(X1,X2,X3,esk7_3(X4,X2,X5))),X5)
| ~ is_eventually_in(X4,X2,X5)
| ~ net_str(X2,X4)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X4)
| ~ one_sorted_str(X1)
| ~ element(esk8_4(X1,X2,X3,esk7_3(X4,X2,X5)),the_carrier(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_41,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X3)
| element(esk8_4(X1,X2,X3,X4),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_42,negated_conjecture,
( is_eventually_in(esk1_0,esk2_0,esk3_0)
| is_often_in(esk1_0,esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_43,negated_conjecture,
( is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ is_often_in(esk1_0,esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_44,negated_conjecture,
~ is_eventually_in(esk1_0,esk2_0,esk4_0),
inference(csr,[status(thm)],[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(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]),c_0_35])]),c_0_36]),c_0_37]),c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( is_eventually_in(X1,X2,esk4_0)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ is_eventually_in(X1,X2,esk3_0)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_30]) ).
cnf(c_0_46,negated_conjecture,
is_eventually_in(esk1_0,esk2_0,esk3_0),
inference(csr,[status(thm)],[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(spm,[status(thm)],[c_0_31,c_0_42]),c_0_33]),c_0_34]),c_0_35])]),c_0_36]),c_0_37]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_33]),c_0_35])]),c_0_36]),c_0_37]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU367+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n018.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 : Mon Jun 20 13:28:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.40/23.46 eprover: CPU time limit exceeded, terminating
% 0.40/23.47 eprover: CPU time limit exceeded, terminating
% 0.40/23.47 eprover: CPU time limit exceeded, terminating
% 0.40/23.49 eprover: CPU time limit exceeded, terminating
% 0.40/25.60 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.40/25.60
% 0.40/25.60 # Failure: Resource limit exceeded (time)
% 0.40/25.60 # OLD status Res
% 0.40/25.60 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.40/25.60 # Preprocessing time : 0.041 s
% 0.40/25.60 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.40/25.60 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.40/25.60 # Preprocessing time : 0.022 s
% 0.40/25.60
% 0.40/25.60 # Proof found!
% 0.40/25.60 # SZS status Theorem
% 0.40/25.60 # SZS output start CNFRefutation
% See solution above
% 0.40/25.60 # Proof object total steps : 48
% 0.40/25.60 # Proof object clause steps : 35
% 0.40/25.60 # Proof object formula steps : 13
% 0.40/25.60 # Proof object conjectures : 23
% 0.40/25.60 # Proof object clause conjectures : 20
% 0.40/25.60 # Proof object formula conjectures : 3
% 0.40/25.60 # Proof object initial clauses used : 22
% 0.40/25.60 # Proof object initial formulas used : 6
% 0.40/25.60 # Proof object generating inferences : 13
% 0.40/25.60 # Proof object simplifying inferences : 27
% 0.40/25.60 # Training examples: 0 positive, 0 negative
% 0.40/25.60 # Parsed axioms : 714
% 0.40/25.60 # Removed by relevancy pruning/SinE : 696
% 0.40/25.60 # Initial clauses : 45
% 0.40/25.60 # Removed in clause preprocessing : 0
% 0.40/25.60 # Initial clauses in saturation : 45
% 0.40/25.60 # Processed clauses : 4092
% 0.40/25.60 # ...of these trivial : 88
% 0.40/25.60 # ...subsumed : 2261
% 0.40/25.60 # ...remaining for further processing : 1742
% 0.40/25.60 # Other redundant clauses eliminated : 2
% 0.40/25.60 # Clauses deleted for lack of memory : 0
% 0.40/25.60 # Backward-subsumed : 148
% 0.40/25.60 # Backward-rewritten : 2
% 0.40/25.60 # Generated clauses : 24717
% 0.40/25.60 # ...of the previous two non-trivial : 24555
% 0.40/25.60 # Contextual simplify-reflections : 3472
% 0.40/25.60 # Paramodulations : 24408
% 0.40/25.60 # Factorizations : 4
% 0.40/25.60 # Equation resolutions : 305
% 0.40/25.60 # Current number of processed clauses : 1590
% 0.40/25.60 # Positive orientable unit clauses : 15
% 0.40/25.60 # Positive unorientable unit clauses: 0
% 0.40/25.60 # Negative unit clauses : 4
% 0.40/25.60 # Non-unit-clauses : 1571
% 0.40/25.60 # Current number of unprocessed clauses: 18161
% 0.40/25.60 # ...number of literals in the above : 167274
% 0.40/25.60 # Current number of archived formulas : 0
% 0.40/25.60 # Current number of archived clauses : 150
% 0.40/25.60 # Clause-clause subsumption calls (NU) : 1336098
% 0.40/25.60 # Rec. Clause-clause subsumption calls : 198870
% 0.40/25.60 # Non-unit clause-clause subsumptions : 5881
% 0.40/25.60 # Unit Clause-clause subsumption calls : 25
% 0.40/25.60 # Rewrite failures with RHS unbound : 0
% 0.40/25.60 # BW rewrite match attempts : 4
% 0.40/25.60 # BW rewrite match successes : 1
% 0.40/25.60 # Condensation attempts : 0
% 0.40/25.60 # Condensation successes : 0
% 0.40/25.60 # Termbank termtop insertions : 579727
% 0.40/25.60
% 0.40/25.60 # -------------------------------------------------
% 0.40/25.60 # User time : 1.181 s
% 0.40/25.60 # System time : 0.009 s
% 0.40/25.60 # Total time : 1.190 s
% 0.40/25.60 # Maximum resident set size: 24160 pages
% 0.40/46.49 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.40/46.49
% 0.40/46.51 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.52 eprover: No such file or directory
% 0.40/46.53 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.53 eprover: No such file or directory
% 0.40/46.53 eprover: CPU time limit exceeded, terminating
% 0.40/46.53 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.54 eprover: No such file or directory
% 0.40/46.54 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.54 eprover: No such file or directory
% 0.40/46.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.55 eprover: No such file or directory
% 0.40/46.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.55 eprover: No such file or directory
% 0.40/46.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.55 eprover: No such file or directory
% 0.40/46.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.55 eprover: No such file or directory
% 0.40/46.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.55 eprover: No such file or directory
% 0.40/46.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.55 eprover: No such file or directory
% 0.40/46.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.56 eprover: No such file or directory
% 0.40/46.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.56 eprover: No such file or directory
% 0.40/46.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.56 eprover: No such file or directory
% 0.40/46.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.57 eprover: No such file or directory
% 0.40/46.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.57 eprover: No such file or directory
% 0.40/46.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.57 eprover: No such file or directory
% 0.40/46.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.58 eprover: No such file or directory
% 0.40/46.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.58 eprover: No such file or directory
% 0.40/46.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.58 eprover: No such file or directory
% 0.40/46.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.59 eprover: No such file or directory
% 0.40/46.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.59 eprover: No such file or directory
%------------------------------------------------------------------------------