TSTP Solution File: SEU386+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU386+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:34 EDT 2022
% Result : Theorem 0.88s 108.03s
% Output : CNFRefutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 12 unt; 0 def)
% Number of atoms : 298 ( 14 equ)
% Maximal formula atoms : 81 ( 8 avg)
% Number of connectives : 423 ( 161 ~; 192 |; 45 &)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 66 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d18_yellow_6,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ( X3 = lim_points_of_net(X1,X2)
<=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( in(X4,X3)
<=> ! [X5] :
( point_neighbourhood(X5,X1,X4)
=> is_eventually_in(X1,X2,X5) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d18_yellow_6) ).
fof(dt_k11_yellow_6,axiom,
! [X1,X2] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1)
& ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> element(lim_points_of_net(X1,X2),powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',dt_k11_yellow_6) ).
fof(t29_waybel_9,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,lim_points_of_net(X1,X2))
=> is_a_cluster_point_of_netstr(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t29_waybel_9) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',dt_l1_pre_topc) ).
fof(t28_yellow_6,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t28_yellow_6) ).
fof(d9_waybel_9,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( is_a_cluster_point_of_netstr(X1,X2,X3)
<=> ! [X4] :
( point_neighbourhood(X4,X1,X3)
=> is_often_in(X1,X2,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d9_waybel_9) ).
fof(c_0_6,plain,
! [X6,X7,X8,X9,X10,X14] :
( ( ~ in(X9,X8)
| ~ point_neighbourhood(X10,X6,X9)
| is_eventually_in(X6,X7,X10)
| ~ element(X9,the_carrier(X6))
| X8 != lim_points_of_net(X6,X7)
| ~ element(X8,powerset(the_carrier(X6)))
| empty_carrier(X7)
| ~ transitive_relstr(X7)
| ~ directed_relstr(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_str(X6) )
& ( point_neighbourhood(esk8_4(X6,X7,X8,X9),X6,X9)
| in(X9,X8)
| ~ element(X9,the_carrier(X6))
| X8 != lim_points_of_net(X6,X7)
| ~ element(X8,powerset(the_carrier(X6)))
| empty_carrier(X7)
| ~ transitive_relstr(X7)
| ~ directed_relstr(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_str(X6) )
& ( ~ is_eventually_in(X6,X7,esk8_4(X6,X7,X8,X9))
| in(X9,X8)
| ~ element(X9,the_carrier(X6))
| X8 != lim_points_of_net(X6,X7)
| ~ element(X8,powerset(the_carrier(X6)))
| empty_carrier(X7)
| ~ transitive_relstr(X7)
| ~ directed_relstr(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_str(X6) )
& ( element(esk9_3(X6,X7,X8),the_carrier(X6))
| X8 = lim_points_of_net(X6,X7)
| ~ element(X8,powerset(the_carrier(X6)))
| empty_carrier(X7)
| ~ transitive_relstr(X7)
| ~ directed_relstr(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_str(X6) )
& ( point_neighbourhood(esk10_3(X6,X7,X8),X6,esk9_3(X6,X7,X8))
| ~ in(esk9_3(X6,X7,X8),X8)
| X8 = lim_points_of_net(X6,X7)
| ~ element(X8,powerset(the_carrier(X6)))
| empty_carrier(X7)
| ~ transitive_relstr(X7)
| ~ directed_relstr(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_str(X6) )
& ( ~ is_eventually_in(X6,X7,esk10_3(X6,X7,X8))
| ~ in(esk9_3(X6,X7,X8),X8)
| X8 = lim_points_of_net(X6,X7)
| ~ element(X8,powerset(the_carrier(X6)))
| empty_carrier(X7)
| ~ transitive_relstr(X7)
| ~ directed_relstr(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_str(X6) )
& ( in(esk9_3(X6,X7,X8),X8)
| ~ point_neighbourhood(X14,X6,esk9_3(X6,X7,X8))
| is_eventually_in(X6,X7,X14)
| X8 = lim_points_of_net(X6,X7)
| ~ element(X8,powerset(the_carrier(X6)))
| empty_carrier(X7)
| ~ transitive_relstr(X7)
| ~ directed_relstr(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ topological_space(X6)
| ~ top_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)],[d18_yellow_6])])])])])])])]) ).
fof(c_0_7,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ topological_space(X3)
| ~ top_str(X3)
| empty_carrier(X4)
| ~ transitive_relstr(X4)
| ~ directed_relstr(X4)
| ~ net_str(X4,X3)
| element(lim_points_of_net(X3,X4),powerset(the_carrier(X3))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k11_yellow_6])])]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,lim_points_of_net(X1,X2))
=> is_a_cluster_point_of_netstr(X1,X2,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[t29_waybel_9]) ).
cnf(c_0_9,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X5)
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ net_str(X2,X1)
| ~ directed_relstr(X2)
| ~ transitive_relstr(X2)
| ~ element(X3,powerset(the_carrier(X1)))
| X3 != lim_points_of_net(X1,X2)
| ~ element(X4,the_carrier(X1))
| ~ point_neighbourhood(X5,X1,X4)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( element(lim_points_of_net(X1,X2),powerset(the_carrier(X1)))
| empty_carrier(X2)
| empty_carrier(X1)
| ~ net_str(X2,X1)
| ~ directed_relstr(X2)
| ~ transitive_relstr(X2)
| ~ top_str(X1)
| ~ topological_space(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,negated_conjecture,
( ~ empty_carrier(esk1_0)
& topological_space(esk1_0)
& top_str(esk1_0)
& ~ empty_carrier(esk2_0)
& transitive_relstr(esk2_0)
& directed_relstr(esk2_0)
& net_str(esk2_0,esk1_0)
& element(esk3_0,the_carrier(esk1_0))
& in(esk3_0,lim_points_of_net(esk1_0,esk2_0))
& ~ is_a_cluster_point_of_netstr(esk1_0,esk2_0,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_8])])])])])]) ).
fof(c_0_12,plain,
! [X2] :
( ~ top_str(X2)
| one_sorted_str(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])]) ).
fof(c_0_13,lemma,
! [X4,X5,X6] :
( empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty_carrier(X5)
| ~ transitive_relstr(X5)
| ~ directed_relstr(X5)
| ~ net_str(X5,X4)
| ~ is_eventually_in(X4,X5,X6)
| is_often_in(X4,X5,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)],[t28_yellow_6])])])])])]) ).
cnf(c_0_14,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| empty_carrier(X4)
| lim_points_of_net(X1,X4) != lim_points_of_net(X1,X2)
| ~ point_neighbourhood(X3,X1,X5)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ directed_relstr(X2)
| ~ directed_relstr(X4)
| ~ transitive_relstr(X2)
| ~ transitive_relstr(X4)
| ~ element(X5,the_carrier(X1))
| ~ in(X5,lim_points_of_net(X1,X4))
| ~ net_str(X2,X1)
| ~ net_str(X4,X1) ),
inference(pm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
in(esk3_0,lim_points_of_net(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
directed_relstr(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
transitive_relstr(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,lemma,
( is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ directed_relstr(X2)
| ~ transitive_relstr(X2)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
( is_eventually_in(esk1_0,X1,X2)
| empty_carrier(X1)
| lim_points_of_net(esk1_0,esk2_0) != lim_points_of_net(esk1_0,X1)
| ~ point_neighbourhood(X2,esk1_0,esk3_0)
| ~ directed_relstr(X1)
| ~ transitive_relstr(X1)
| ~ net_str(X1,esk1_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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
one_sorted_str(esk1_0),
inference(pm,[status(thm)],[c_0_24,c_0_17]) ).
fof(c_0_28,plain,
! [X5,X6,X7,X8] :
( ( ~ is_a_cluster_point_of_netstr(X5,X6,X7)
| ~ point_neighbourhood(X8,X5,X7)
| is_often_in(X5,X6,X8)
| ~ element(X7,the_carrier(X5))
| empty_carrier(X6)
| ~ net_str(X6,X5)
| empty_carrier(X5)
| ~ topological_space(X5)
| ~ top_str(X5) )
& ( point_neighbourhood(esk4_3(X5,X6,X7),X5,X7)
| is_a_cluster_point_of_netstr(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| empty_carrier(X6)
| ~ net_str(X6,X5)
| empty_carrier(X5)
| ~ topological_space(X5)
| ~ top_str(X5) )
& ( ~ is_often_in(X5,X6,esk4_3(X5,X6,X7))
| is_a_cluster_point_of_netstr(X5,X6,X7)
| ~ element(X7,the_carrier(X5))
| empty_carrier(X6)
| ~ net_str(X6,X5)
| empty_carrier(X5)
| ~ topological_space(X5)
| ~ top_str(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)],[inference(fof_simplification,[status(thm)],[d9_waybel_9])])])])])])])]) ).
cnf(c_0_29,lemma,
( is_often_in(esk1_0,X1,X2)
| empty_carrier(X1)
| lim_points_of_net(esk1_0,esk2_0) != lim_points_of_net(esk1_0,X1)
| ~ point_neighbourhood(X2,esk1_0,esk3_0)
| ~ directed_relstr(X1)
| ~ transitive_relstr(X1)
| ~ net_str(X1,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_22]) ).
cnf(c_0_30,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_a_cluster_point_of_netstr(X1,X2,X3)
| point_neighbourhood(esk4_3(X1,X2,X3),X1,X3)
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ net_str(X2,X1)
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_a_cluster_point_of_netstr(X1,X2,X3)
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ net_str(X2,X1)
| ~ element(X3,the_carrier(X1))
| ~ is_often_in(X1,X2,esk4_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,lemma,
( is_a_cluster_point_of_netstr(esk1_0,X1,esk3_0)
| is_often_in(esk1_0,X2,esk4_3(esk1_0,X1,esk3_0))
| empty_carrier(X2)
| empty_carrier(X1)
| lim_points_of_net(esk1_0,esk2_0) != lim_points_of_net(esk1_0,X2)
| ~ directed_relstr(X2)
| ~ transitive_relstr(X2)
| ~ net_str(X2,esk1_0)
| ~ net_str(X1,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_29,c_0_30]),c_0_16]),c_0_17]),c_0_20])]),c_0_22]) ).
cnf(c_0_33,negated_conjecture,
~ is_a_cluster_point_of_netstr(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,lemma,
( is_a_cluster_point_of_netstr(esk1_0,X1,esk3_0)
| empty_carrier(X1)
| lim_points_of_net(esk1_0,esk2_0) != lim_points_of_net(esk1_0,X1)
| ~ directed_relstr(X1)
| ~ transitive_relstr(X1)
| ~ net_str(X1,esk1_0) ),
inference(sr,[status(thm)],[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_16]),c_0_17]),c_0_20])]),c_0_22]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_33,c_0_34]),c_0_18]),c_0_19]),c_0_21])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU386+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 09:41:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/23.47 eprover: CPU time limit exceeded, terminating
% 0.42/23.48 eprover: CPU time limit exceeded, terminating
% 0.42/23.48 eprover: CPU time limit exceeded, terminating
% 0.42/23.50 eprover: CPU time limit exceeded, terminating
% 0.54/46.49 eprover: CPU time limit exceeded, terminating
% 0.54/46.51 eprover: CPU time limit exceeded, terminating
% 0.54/46.51 eprover: CPU time limit exceeded, terminating
% 0.54/46.52 eprover: CPU time limit exceeded, terminating
% 0.67/69.53 eprover: eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.67/69.53
% 0.67/69.53
% 0.67/69.53 eprover: CPU time limit exceeded, terminating
% 0.79/92.54 eprover: CPU time limit exceeded, terminating
% 0.79/92.55 eprover: CPU time limit exceeded, terminating
% 0.79/92.55 eprover: CPU time limit exceeded, terminating
% 0.79/92.55 eprover: CPU time limit exceeded, terminating
% 0.88/108.03 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.88/108.03
% 0.88/108.03 # Failure: Resource limit exceeded (time)
% 0.88/108.03 # OLD status Res
% 0.88/108.03 # Preprocessing time : 0.218 s
% 0.88/108.03 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.88/108.03
% 0.88/108.03 # Failure: Resource limit exceeded (time)
% 0.88/108.03 # OLD status Res
% 0.88/108.03 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.88/108.03 # Preprocessing time : 0.027 s
% 0.88/108.03 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.88/108.03
% 0.88/108.03 # Failure: Resource limit exceeded (time)
% 0.88/108.03 # OLD status Res
% 0.88/108.03 # Preprocessing time : 0.147 s
% 0.88/108.03 # Running protocol protocol_eprover_f8b0f932169414d689b89e2a8b18d4600533b975 for 23 seconds:
% 0.88/108.03
% 0.88/108.03 # Failure: Resource limit exceeded (time)
% 0.88/108.03 # OLD status Res
% 0.88/108.03 # Preprocessing time : 0.135 s
% 0.88/108.03 # Running protocol protocol_eprover_fc511518e5f98a6b2c7baef820b71b6d1abb3e55 for 23 seconds:
% 0.88/108.03 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,80,1.0)
% 0.88/108.03 # Preprocessing time : 0.051 s
% 0.88/108.03
% 0.88/108.03 # Proof found!
% 0.88/108.03 # SZS status Theorem
% 0.88/108.03 # SZS output start CNFRefutation
% See solution above
% 0.88/108.03 # Proof object total steps : 36
% 0.88/108.03 # Proof object clause steps : 23
% 0.88/108.03 # Proof object formula steps : 13
% 0.88/108.03 # Proof object conjectures : 16
% 0.88/108.03 # Proof object clause conjectures : 13
% 0.88/108.03 # Proof object formula conjectures : 3
% 0.88/108.03 # Proof object initial clauses used : 16
% 0.88/108.03 # Proof object initial formulas used : 6
% 0.88/108.03 # Proof object generating inferences : 7
% 0.88/108.03 # Proof object simplifying inferences : 27
% 0.88/108.03 # Training examples: 0 positive, 0 negative
% 0.88/108.03 # Parsed axioms : 856
% 0.88/108.03 # Removed by relevancy pruning/SinE : 807
% 0.88/108.03 # Initial clauses : 107
% 0.88/108.03 # Removed in clause preprocessing : 0
% 0.88/108.03 # Initial clauses in saturation : 107
% 0.88/108.03 # Processed clauses : 8576
% 0.88/108.03 # ...of these trivial : 9
% 0.88/108.03 # ...subsumed : 970
% 0.88/108.03 # ...remaining for further processing : 7597
% 0.88/108.03 # Other redundant clauses eliminated : 2
% 0.88/108.03 # Clauses deleted for lack of memory : 300895
% 0.88/108.03 # Backward-subsumed : 26
% 0.88/108.03 # Backward-rewritten : 0
% 0.88/108.03 # Generated clauses : 384794
% 0.88/108.03 # ...of the previous two non-trivial : 384683
% 0.88/108.03 # Contextual simplify-reflections : 0
% 0.88/108.03 # Paramodulations : 384347
% 0.88/108.03 # Factorizations : 158
% 0.88/108.03 # Equation resolutions : 271
% 0.88/108.03 # Current number of processed clauses : 7569
% 0.88/108.03 # Positive orientable unit clauses : 22
% 0.88/108.03 # Positive unorientable unit clauses: 0
% 0.88/108.03 # Negative unit clauses : 15
% 0.88/108.03 # Non-unit-clauses : 7532
% 0.88/108.03 # Current number of unprocessed clauses: 74502
% 0.88/108.03 # ...number of literals in the above : 783261
% 0.88/108.03 # Current number of archived formulas : 0
% 0.88/108.03 # Current number of archived clauses : 26
% 0.88/108.03 # Clause-clause subsumption calls (NU) : 9663204
% 0.88/108.03 # Rec. Clause-clause subsumption calls : 140089
% 0.88/108.03 # Non-unit clause-clause subsumptions : 978
% 0.88/108.03 # Unit Clause-clause subsumption calls : 1298
% 0.88/108.03 # Rewrite failures with RHS unbound : 0
% 0.88/108.03 # BW rewrite match attempts : 9
% 0.88/108.03 # BW rewrite match successes : 0
% 0.88/108.03 # Condensation attempts : 0
% 0.88/108.03 # Condensation successes : 0
% 0.88/108.03 # Termbank termtop insertions : 14690527
% 0.88/108.03
% 0.88/108.03 # -------------------------------------------------
% 0.88/108.03 # User time : 14.710 s
% 0.88/108.03 # System time : 0.144 s
% 0.88/108.03 # Total time : 14.854 s
% 0.88/108.03 # Maximum resident set size: 140396 pages
% 0.88/115.57 eprover: CPU time limit exceeded, terminating
% 0.88/115.57 eprover: CPU time limit exceeded, terminating
% 0.88/115.57 eprover: CPU time limit exceeded, terminating
% 0.88/115.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.88/115.59 eprover: No such file or directory
% 0.88/115.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.59 eprover: No such file or directory
% 0.88/115.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.88/115.59 eprover: No such file or directory
% 0.88/115.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.59 eprover: No such file or directory
% 0.88/115.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.59 eprover: No such file or directory
% 0.88/115.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.88/115.59 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.61 eprover: No such file or directory
% 0.88/115.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.88/115.61 eprover: No such file or directory
% 0.88/115.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.61 eprover: No such file or directory
% 0.88/115.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.88/115.61 eprover: No such file or directory
% 0.88/115.61 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.61 eprover: No such file or directory
% 0.88/115.62 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.62 eprover: No such file or directory
% 0.88/115.62 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.62 eprover: No such file or directory
%------------------------------------------------------------------------------