TSTP Solution File: SEU311+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU311+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:18:53 EDT 2022
% Result : Theorem 1.47s 163.64s
% Output : CNFRefutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 15 unt; 0 def)
% Number of atoms : 146 ( 4 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 160 ( 63 ~; 64 |; 19 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 6 sgn 38 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s3_subset_1__e2_37_1_1__pre_topc,conjecture,
! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(powerset(the_carrier(X1)))) )
=> ? [X3] :
( element(X3,powerset(powerset(the_carrier(X1))))
& ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( in(X4,X3)
<=> in(set_difference(cast_as_carrier_subset(X1),X4),X2) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',s3_subset_1__e2_37_1_1__pre_topc) ).
fof(s1_xboole_0__e2_37_1_1__pre_topc__1,lemma,
! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(powerset(the_carrier(X1)))) )
=> ? [X3] :
! [X4] :
( in(X4,X3)
<=> ( in(X4,powerset(the_carrier(X1)))
& in(set_difference(cast_as_carrier_subset(X1),X4),X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',s1_xboole_0__e2_37_1_1__pre_topc__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(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_l1_pre_topc) ).
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',d3_pre_topc) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t3_subset) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t2_subset) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fc1_subset_1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( ( topological_space(X1)
& top_str(X1)
& element(X2,powerset(powerset(the_carrier(X1)))) )
=> ? [X3] :
( element(X3,powerset(powerset(the_carrier(X1))))
& ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( in(X4,X3)
<=> in(set_difference(cast_as_carrier_subset(X1),X4),X2) ) ) ) ),
inference(assume_negation,[status(cth)],[s3_subset_1__e2_37_1_1__pre_topc]) ).
fof(c_0_9,lemma,
! [X5,X6,X8,X8] :
( ( in(X8,powerset(the_carrier(X5)))
| ~ in(X8,esk17_2(X5,X6))
| ~ topological_space(X5)
| ~ top_str(X5)
| ~ element(X6,powerset(powerset(the_carrier(X5)))) )
& ( in(set_difference(cast_as_carrier_subset(X5),X8),X6)
| ~ in(X8,esk17_2(X5,X6))
| ~ topological_space(X5)
| ~ top_str(X5)
| ~ element(X6,powerset(powerset(the_carrier(X5)))) )
& ( ~ in(X8,powerset(the_carrier(X5)))
| ~ in(set_difference(cast_as_carrier_subset(X5),X8),X6)
| in(X8,esk17_2(X5,X6))
| ~ topological_space(X5)
| ~ top_str(X5)
| ~ element(X6,powerset(powerset(the_carrier(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)],[s1_xboole_0__e2_37_1_1__pre_topc__1])])])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X7] :
( topological_space(esk1_0)
& top_str(esk1_0)
& element(esk2_0,powerset(powerset(the_carrier(esk1_0))))
& ( element(esk3_1(X7),powerset(the_carrier(esk1_0)))
| ~ element(X7,powerset(powerset(the_carrier(esk1_0)))) )
& ( ~ in(esk3_1(X7),X7)
| ~ in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X7)),esk2_0)
| ~ element(X7,powerset(powerset(the_carrier(esk1_0)))) )
& ( in(esk3_1(X7),X7)
| in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X7)),esk2_0)
| ~ element(X7,powerset(powerset(the_carrier(esk1_0)))) ) ),
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)],[c_0_8])])])])])])]) ).
cnf(c_0_11,lemma,
( in(X3,powerset(the_carrier(X2)))
| ~ element(X1,powerset(powerset(the_carrier(X2))))
| ~ top_str(X2)
| ~ topological_space(X2)
| ~ in(X3,esk17_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
element(esk2_0,powerset(powerset(the_carrier(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk18_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk18_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])])])])])])]) ).
fof(c_0_16,plain,
! [X2] :
( ~ top_str(X2)
| one_sorted_str(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])]) ).
cnf(c_0_17,negated_conjecture,
( in(X1,powerset(the_carrier(esk1_0)))
| ~ in(X1,esk17_2(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| in(esk18_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,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_20,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X3,X4,X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
cnf(c_0_22,plain,
( subset(X1,X2)
| ~ in(esk18_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( subset(esk17_2(esk1_0,esk2_0),X1)
| in(esk18_2(esk17_2(esk1_0,esk2_0),X1),powerset(the_carrier(esk1_0))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
one_sorted_str(esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_26,lemma,
( in(set_difference(cast_as_carrier_subset(X2),X3),X1)
| ~ element(X1,powerset(powerset(the_carrier(X2))))
| ~ top_str(X2)
| ~ topological_space(X2)
| ~ in(X3,esk17_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
subset(esk17_2(esk1_0,esk2_0),powerset(the_carrier(esk1_0))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X1)),esk2_0)
| in(esk3_1(X1),X1)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
cast_as_carrier_subset(esk1_0) = the_carrier(esk1_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( in(set_difference(cast_as_carrier_subset(esk1_0),X1),esk2_0)
| ~ in(X1,esk17_2(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_12]),c_0_13]),c_0_14])]) ).
fof(c_0_32,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_33,negated_conjecture,
( element(esk3_1(X1),powerset(the_carrier(esk1_0)))
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
element(esk17_2(esk1_0,esk2_0),powerset(powerset(the_carrier(esk1_0)))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_35,plain,
! [X2] : ~ empty(powerset(X2)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_subset_1])]) ).
cnf(c_0_36,negated_conjecture,
( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
| ~ in(set_difference(cast_as_carrier_subset(esk1_0),esk3_1(X1)),esk2_0)
| ~ in(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,negated_conjecture,
( in(set_difference(the_carrier(esk1_0),esk3_1(X1)),esk2_0)
| in(esk3_1(X1),X1)
| ~ element(X1,powerset(powerset(the_carrier(esk1_0)))) ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( in(set_difference(the_carrier(esk1_0),X1),esk2_0)
| ~ in(X1,esk17_2(esk1_0,esk2_0)) ),
inference(rw,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_39,lemma,
( in(X3,esk17_2(X2,X1))
| ~ element(X1,powerset(powerset(the_carrier(X2))))
| ~ top_str(X2)
| ~ topological_space(X2)
| ~ in(set_difference(cast_as_carrier_subset(X2),X3),X1)
| ~ in(X3,powerset(the_carrier(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_40,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
element(esk3_1(esk17_2(esk1_0,esk2_0)),powerset(the_carrier(esk1_0))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( ~ element(X1,powerset(powerset(the_carrier(esk1_0))))
| ~ in(set_difference(the_carrier(esk1_0),esk3_1(X1)),esk2_0)
| ~ in(esk3_1(X1),X1) ),
inference(rw,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_44,negated_conjecture,
in(set_difference(the_carrier(esk1_0),esk3_1(esk17_2(esk1_0,esk2_0))),esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( in(X1,esk17_2(esk1_0,esk2_0))
| ~ in(set_difference(the_carrier(esk1_0),X1),esk2_0)
| ~ in(X1,powerset(the_carrier(esk1_0))) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_12]),c_0_13]),c_0_14])]),c_0_30]) ).
cnf(c_0_46,negated_conjecture,
in(esk3_1(esk17_2(esk1_0,esk2_0)),powerset(the_carrier(esk1_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
~ in(esk3_1(esk17_2(esk1_0,esk2_0)),esk17_2(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_34])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_44]),c_0_46])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU311+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.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 : Mon Jun 20 08:30:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.44/23.45 eprover: CPU time limit exceeded, terminating
% 0.44/23.45 eprover: CPU time limit exceeded, terminating
% 0.44/23.46 eprover: CPU time limit exceeded, terminating
% 0.44/23.46 eprover: CPU time limit exceeded, terminating
% 0.61/46.46 eprover: CPU time limit exceeded, terminating
% 0.61/46.47 eprover: CPU time limit exceeded, terminating
% 0.61/46.48 eprover: CPU time limit exceeded, terminating
% 0.61/46.48 eprover: CPU time limit exceeded, terminating
% 0.78/69.49 eprover: CPU time limit exceeded, terminating
% 0.78/69.50 eprover: CPU time limit exceeded, terminating
% 0.78/69.50 eprover: CPU time limit exceeded, terminating
% 0.78/69.50 eprover: CPU time limit exceeded, terminating
% 0.96/92.51 eprover: CPU time limit exceeded, terminating
% 0.96/92.52 eprover: CPU time limit exceeded, terminating
% 0.96/92.54 eprover: CPU time limit exceeded, terminating
% 0.96/92.55 eprover: CPU time limit exceeded, terminating
% 1.13/115.53 eprover: CPU time limit exceeded, terminating
% 1.13/115.54 eprover: CPU time limit exceeded, terminating
% 1.13/115.55 eprover: CPU time limit exceeded, terminating
% 1.13/115.58 eprover: CPU time limit exceeded, terminating
% 1.30/138.56 eprover: CPU time limit exceeded, terminating
% 1.30/138.57 eprover: CPU time limit exceeded, terminating
% 1.30/138.59 eprover: CPU time limit exceeded, terminating
% 1.30/138.59 eprover: CPU time limit exceeded, terminating
% 1.45/161.59 eprover: CPU time limit exceeded, terminating
% 1.45/161.60 eprover: CPU time limit exceeded, terminating
% 1.45/161.61 eprover: CPU time limit exceeded, terminating
% 1.45/161.61 eprover: CPU time limit exceeded, terminating
% 1.47/163.64 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 1.47/163.64
% 1.47/163.64 # Failure: Resource limit exceeded (time)
% 1.47/163.64 # OLD status Res
% 1.47/163.64 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 1.47/163.64 # Preprocessing time : 0.037 s
% 1.47/163.64 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 1.47/163.64
% 1.47/163.64 # Failure: Resource limit exceeded (time)
% 1.47/163.64 # OLD status Res
% 1.47/163.64 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 1.47/163.64 # Preprocessing time : 0.018 s
% 1.47/163.64 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 1.47/163.64
% 1.47/163.64 # Failure: Resource limit exceeded (time)
% 1.47/163.64 # OLD status Res
% 1.47/163.64 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 1.47/163.64 # Preprocessing time : 0.031 s
% 1.47/163.64 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 1.47/163.64
% 1.47/163.64 # Failure: Resource limit exceeded (time)
% 1.47/163.64 # OLD status Res
% 1.47/163.64 # Preprocessing time : 0.133 s
% 1.47/163.64 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 1.47/163.64
% 1.47/163.64 # Failure: Resource limit exceeded (time)
% 1.47/163.64 # OLD status Res
% 1.47/163.64 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 1.47/163.64 # Preprocessing time : 0.046 s
% 1.47/163.64 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 1.47/163.64
% 1.47/163.64 # Failure: Resource limit exceeded (time)
% 1.47/163.64 # OLD status Res
% 1.47/163.64 # Preprocessing time : 0.139 s
% 1.47/163.64 # Running protocol protocol_eprover_e6b386026570787d4ac06e541c4634c5e3f09cc5 for 23 seconds:
% 1.47/163.64
% 1.47/163.64 # Failure: Resource limit exceeded (time)
% 1.47/163.64 # OLD status Res
% 1.47/163.64 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,100,1.0)
% 1.47/163.64 # Preprocessing time : 0.025 s
% 1.47/163.64 # Running protocol protocol_eprover_2e85aeff02a0bd3743f362014f6604d7fba54d74 for 23 seconds:
% 1.47/163.64 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 1.47/163.64 # Preprocessing time : 0.019 s
% 1.47/163.64
% 1.47/163.64 # Proof found!
% 1.47/163.64 # SZS status Theorem
% 1.47/163.64 # SZS output start CNFRefutation
% See solution above
% 1.47/163.64 # Proof object total steps : 49
% 1.47/163.64 # Proof object clause steps : 32
% 1.47/163.64 # Proof object formula steps : 17
% 1.47/163.64 # Proof object conjectures : 25
% 1.47/163.64 # Proof object clause conjectures : 22
% 1.47/163.64 # Proof object formula conjectures : 3
% 1.47/163.64 # Proof object initial clauses used : 16
% 1.47/163.64 # Proof object initial formulas used : 8
% 1.47/163.64 # Proof object generating inferences : 13
% 1.47/163.64 # Proof object simplifying inferences : 20
% 1.47/163.64 # Training examples: 0 positive, 0 negative
% 1.47/163.64 # Parsed axioms : 502
% 1.47/163.64 # Removed by relevancy pruning/SinE : 421
% 1.47/163.64 # Initial clauses : 225
% 1.47/163.64 # Removed in clause preprocessing : 1
% 1.47/163.64 # Initial clauses in saturation : 224
% 1.47/163.64 # Processed clauses : 3851
% 1.47/163.64 # ...of these trivial : 60
% 1.47/163.64 # ...subsumed : 1018
% 1.47/163.64 # ...remaining for further processing : 2772
% 1.47/163.64 # Other redundant clauses eliminated : 50
% 1.47/163.64 # Clauses deleted for lack of memory : 0
% 1.47/163.64 # Backward-subsumed : 49
% 1.47/163.64 # Backward-rewritten : 183
% 1.47/163.64 # Generated clauses : 80535
% 1.47/163.64 # ...of the previous two non-trivial : 78104
% 1.47/163.64 # Contextual simplify-reflections : 229
% 1.47/163.64 # Paramodulations : 80186
% 1.47/163.64 # Factorizations : 92
% 1.47/163.64 # Equation resolutions : 243
% 1.47/163.64 # Current number of processed clauses : 2518
% 1.47/163.64 # Positive orientable unit clauses : 470
% 1.47/163.64 # Positive unorientable unit clauses: 5
% 1.47/163.64 # Negative unit clauses : 261
% 1.47/163.64 # Non-unit-clauses : 1782
% 1.47/163.64 # Current number of unprocessed clauses: 71141
% 1.47/163.64 # ...number of literals in the above : 283045
% 1.47/163.64 # Current number of archived formulas : 0
% 1.47/163.64 # Current number of archived clauses : 247
% 1.47/163.64 # Clause-clause subsumption calls (NU) : 487574
% 1.47/163.64 # Rec. Clause-clause subsumption calls : 269191
% 1.47/163.64 # Non-unit clause-clause subsumptions : 751
% 1.47/163.64 # Unit Clause-clause subsumption calls : 79814
% 1.47/163.64 # Rewrite failures with RHS unbound : 16
% 1.47/163.64 # BW rewrite match attempts : 1156
% 1.47/163.64 # BW rewrite match successes : 70
% 1.47/163.64 # Condensation attempts : 0
% 1.47/163.64 # Condensation successes : 0
% 1.47/163.64 # Termbank termtop insertions : 2423918
% 1.47/163.64
% 1.47/163.64 # -------------------------------------------------
% 1.47/163.64 # User time : 1.057 s
% 1.47/163.64 # System time : 0.026 s
% 1.47/163.64 # Total time : 1.083 s
% 1.47/163.64 # Maximum resident set size: 68988 pages
% 1.47/184.61 eprover: CPU time limit exceeded, terminating
% 1.47/184.63 eprover: CPU time limit exceeded, terminating
% 1.47/184.63 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.47/184.63 eprover: No such file or directory
% 1.47/184.63 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.47/184.63 eprover: No such file or directory
% 1.47/184.64 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.47/184.64 eprover: No such file or directory
% 1.47/184.64 eprover: CPU time limit exceeded, terminating
% 1.47/184.64 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.47/184.64 eprover: No such file or directory
% 1.47/184.64 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.47/184.64 eprover: No such file or directory
% 1.47/184.65 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.47/184.65 eprover: No such file or directory
% 1.47/184.65 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.47/184.65 eprover: No such file or directory
% 1.47/184.65 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.47/184.65 eprover: No such file or directory
% 1.47/184.66 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.47/184.66 eprover: No such file or directory
% 1.47/184.66 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.47/184.66 eprover: No such file or directory
% 1.47/184.66 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.47/184.66 eprover: No such file or directory
% 1.47/184.67 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.47/184.67 eprover: No such file or directory
%------------------------------------------------------------------------------