TSTP Solution File: TOP023+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : TOP023+4 : TPTP v8.1.0. Released v3.4.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 : Thu Jul 21 21:25:28 EDT 2022
% Result : Theorem 3.05s 218.26s
% Output : CNFRefutation 3.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 56 ( 23 unt; 0 def)
% Number of atoms : 211 ( 45 equ)
% Maximal formula atoms : 31 ( 3 avg)
% Number of connectives : 262 ( 107 ~; 110 |; 22 &)
% ( 1 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 74 ( 4 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t1_tsp_2,conjecture,
! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( l1_pre_topc(X2)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X2)))
=> ( ( g1_pre_topc(u1_struct_0(X1),u1_pre_topc(X1)) = g1_pre_topc(u1_struct_0(X2),u1_pre_topc(X2))
& X3 = X4
& v1_tsp_2(X3,X1) )
=> v1_tsp_2(X4,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t1_tsp_2) ).
fof(dt_u1_pre_topc,axiom,
! [X1] :
( l1_pre_topc(X1)
=> m1_subset_1(u1_pre_topc(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',dt_u1_pre_topc) ).
fof(free_g1_pre_topc,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ! [X3,X4] :
( g1_pre_topc(X1,X2) = g1_pre_topc(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',free_g1_pre_topc) ).
fof(t5_tsp_1,axiom,
! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( l1_pre_topc(X2)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X2)))
=> ( ( g1_pre_topc(u1_struct_0(X1),u1_pre_topc(X1)) = g1_pre_topc(u1_struct_0(X2),u1_pre_topc(X2))
& X3 = X4
& v1_tsp_1(X3,X1) )
=> v1_tsp_1(X4,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+406.ax',t5_tsp_1) ).
fof(d4_tsp_2,axiom,
! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_tsp_2(X2,X1)
<=> ( v1_tsp_1(X2,X1)
& ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ( ( v1_tsp_1(X3,X1)
& r1_tarski(X2,X3) )
=> X2 = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d4_tsp_2) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( l1_pre_topc(X2)
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X2)))
=> ( ( g1_pre_topc(u1_struct_0(X1),u1_pre_topc(X1)) = g1_pre_topc(u1_struct_0(X2),u1_pre_topc(X2))
& X3 = X4
& v1_tsp_2(X3,X1) )
=> v1_tsp_2(X4,X2) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t1_tsp_2]) ).
fof(c_0_6,plain,
! [X2] :
( ~ l1_pre_topc(X2)
| m1_subset_1(u1_pre_topc(X2),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X2)))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_u1_pre_topc])]) ).
fof(c_0_7,negated_conjecture,
( l1_pre_topc(esk1_0)
& l1_pre_topc(esk2_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& m1_subset_1(esk4_0,k1_zfmisc_1(u1_struct_0(esk2_0)))
& g1_pre_topc(u1_struct_0(esk1_0),u1_pre_topc(esk1_0)) = g1_pre_topc(u1_struct_0(esk2_0),u1_pre_topc(esk2_0))
& esk3_0 = esk4_0
& v1_tsp_2(esk3_0,esk1_0)
& ~ v1_tsp_2(esk4_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,plain,
! [X5,X6,X7,X8] :
( ( X5 = X7
| g1_pre_topc(X5,X6) != g1_pre_topc(X7,X8)
| ~ m1_subset_1(X6,k1_zfmisc_1(k1_zfmisc_1(X5))) )
& ( X6 = X8
| g1_pre_topc(X5,X6) != g1_pre_topc(X7,X8)
| ~ m1_subset_1(X6,k1_zfmisc_1(k1_zfmisc_1(X5))) ) ),
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)],[free_g1_pre_topc])])])])])]) ).
cnf(c_0_9,plain,
( m1_subset_1(u1_pre_topc(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
l1_pre_topc(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X2 = X3
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2)))
| g1_pre_topc(X2,X1) != g1_pre_topc(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
m1_subset_1(u1_pre_topc(esk2_0),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(esk2_0)))),
inference(pm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
g1_pre_topc(u1_struct_0(esk1_0),u1_pre_topc(esk1_0)) = g1_pre_topc(u1_struct_0(esk2_0),u1_pre_topc(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X5,X6,X7,X8] :
( ~ l1_pre_topc(X5)
| ~ l1_pre_topc(X6)
| ~ m1_subset_1(X7,k1_zfmisc_1(u1_struct_0(X5)))
| ~ m1_subset_1(X8,k1_zfmisc_1(u1_struct_0(X6)))
| g1_pre_topc(u1_struct_0(X5),u1_pre_topc(X5)) != g1_pre_topc(u1_struct_0(X6),u1_pre_topc(X6))
| X7 != X8
| ~ v1_tsp_1(X7,X5)
| v1_tsp_1(X8,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)],[t5_tsp_1])])])])]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ( v1_tsp_1(X5,X4)
| ~ v1_tsp_2(X5,X4)
| ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
| ~ l1_pre_topc(X4) )
& ( ~ m1_subset_1(X6,k1_zfmisc_1(u1_struct_0(X4)))
| ~ v1_tsp_1(X6,X4)
| ~ r1_tarski(X5,X6)
| X5 = X6
| ~ v1_tsp_2(X5,X4)
| ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
| ~ l1_pre_topc(X4) )
& ( m1_subset_1(esk5_2(X4,X5),k1_zfmisc_1(u1_struct_0(X4)))
| ~ v1_tsp_1(X5,X4)
| v1_tsp_2(X5,X4)
| ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
| ~ l1_pre_topc(X4) )
& ( v1_tsp_1(esk5_2(X4,X5),X4)
| ~ v1_tsp_1(X5,X4)
| v1_tsp_2(X5,X4)
| ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
| ~ l1_pre_topc(X4) )
& ( r1_tarski(X5,esk5_2(X4,X5))
| ~ v1_tsp_1(X5,X4)
| v1_tsp_2(X5,X4)
| ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
| ~ l1_pre_topc(X4) )
& ( X5 != esk5_2(X4,X5)
| ~ v1_tsp_1(X5,X4)
| v1_tsp_2(X5,X4)
| ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X4)))
| ~ l1_pre_topc(X4) ) ),
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)],[d4_tsp_2])])])])])])]) ).
cnf(c_0_16,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( u1_struct_0(esk2_0) = X1
| g1_pre_topc(u1_struct_0(esk1_0),u1_pre_topc(esk1_0)) != g1_pre_topc(X1,X2) ),
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_18,plain,
( v1_tsp_1(X1,X2)
| ~ v1_tsp_1(X3,X4)
| X3 != X1
| g1_pre_topc(u1_struct_0(X4),u1_pre_topc(X4)) != g1_pre_topc(u1_struct_0(X2),u1_pre_topc(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X4)))
| ~ l1_pre_topc(X2)
| ~ l1_pre_topc(X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( v1_tsp_1(X2,X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
v1_tsp_2(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( X1 = X4
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2)))
| g1_pre_topc(X2,X1) != g1_pre_topc(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
m1_subset_1(u1_pre_topc(esk1_0),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(esk1_0)))),
inference(pm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
u1_struct_0(esk2_0) = u1_struct_0(esk1_0),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( v1_tsp_1(X1,X2)
| g1_pre_topc(u1_struct_0(X2),u1_pre_topc(X2)) != g1_pre_topc(u1_struct_0(X3),u1_pre_topc(X3))
| ~ v1_tsp_1(X1,X3)
| ~ l1_pre_topc(X3)
| ~ l1_pre_topc(X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X3)))
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2))) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
v1_tsp_1(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_16])]) ).
cnf(c_0_27,negated_conjecture,
( u1_pre_topc(esk1_0) = X1
| g1_pre_topc(u1_struct_0(esk1_0),u1_pre_topc(esk1_0)) != g1_pre_topc(X2,X1) ),
inference(pm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
g1_pre_topc(u1_struct_0(esk1_0),u1_pre_topc(esk2_0)) = g1_pre_topc(u1_struct_0(esk1_0),u1_pre_topc(esk1_0)),
inference(rw,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_29,plain,
( v1_tsp_2(X2,X1)
| m1_subset_1(esk5_2(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,negated_conjecture,
( v1_tsp_1(esk3_0,X1)
| g1_pre_topc(u1_struct_0(X1),u1_pre_topc(X1)) != g1_pre_topc(u1_struct_0(esk1_0),u1_pre_topc(esk1_0))
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_25,c_0_20]),c_0_26]),c_0_16])]) ).
cnf(c_0_31,negated_conjecture,
~ v1_tsp_2(esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,negated_conjecture,
esk3_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,plain,
( v1_tsp_2(X2,X1)
| v1_tsp_1(esk5_2(X1,X2),X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_34,negated_conjecture,
u1_pre_topc(esk2_0) = u1_pre_topc(esk1_0),
inference(pm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( v1_tsp_2(X1,esk2_0)
| m1_subset_1(esk5_2(esk2_0,X1),k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_tsp_1(X1,esk2_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_29,c_0_24]),c_0_24]),c_0_10])]) ).
cnf(c_0_36,negated_conjecture,
v1_tsp_1(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_30,c_0_24]),c_0_20]),c_0_24]),c_0_28]),c_0_10])]) ).
cnf(c_0_37,negated_conjecture,
~ v1_tsp_2(esk3_0,esk2_0),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( v1_tsp_2(X1,esk2_0)
| v1_tsp_1(esk5_2(esk2_0,X1),esk2_0)
| ~ v1_tsp_1(X1,esk2_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_33,c_0_24]),c_0_10])]) ).
cnf(c_0_39,negated_conjecture,
( v1_tsp_1(X1,X2)
| g1_pre_topc(u1_struct_0(X2),u1_pre_topc(X2)) != g1_pre_topc(u1_struct_0(esk1_0),u1_pre_topc(esk1_0))
| ~ v1_tsp_1(X1,esk2_0)
| ~ l1_pre_topc(X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2))) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_25,c_0_24]),c_0_24]),c_0_10])]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
m1_subset_1(esk5_2(esk2_0,esk3_0),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_35,c_0_20]),c_0_36])]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
v1_tsp_1(esk5_2(esk2_0,esk3_0),esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_38,c_0_20]),c_0_36])]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(u1_struct_0(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_43,plain,
( X2 = X3
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_2(X2,X1)
| ~ r1_tarski(X2,X3)
| ~ v1_tsp_1(X3,X1)
| ~ m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_44,negated_conjecture,
( v1_tsp_1(esk5_2(esk2_0,esk3_0),X1)
| g1_pre_topc(u1_struct_0(X1),u1_pre_topc(X1)) != g1_pre_topc(u1_struct_0(esk1_0),u1_pre_topc(esk1_0))
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(esk5_2(esk2_0,esk3_0),k1_zfmisc_1(u1_struct_0(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_45,plain,
( v1_tsp_2(X2,X1)
| r1_tarski(X2,esk5_2(X1,X2))
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_46,plain,
( v1_tsp_2(X2,X1)
| ~ l1_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_1(X2,X1)
| X2 != esk5_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_47,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk2_0))),
inference(rw,[status(thm)],[c_0_42,c_0_32]) ).
cnf(c_0_48,negated_conjecture,
( X1 = esk5_2(esk2_0,esk3_0)
| ~ v1_tsp_2(X1,esk1_0)
| ~ v1_tsp_1(esk5_2(esk2_0,esk3_0),esk1_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ r1_tarski(X1,esk5_2(esk2_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_43,c_0_40]),c_0_16])]) ).
cnf(c_0_49,negated_conjecture,
v1_tsp_1(esk5_2(esk2_0,esk3_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_44,c_0_40]),c_0_16])]) ).
cnf(c_0_50,negated_conjecture,
( v1_tsp_2(X1,esk2_0)
| r1_tarski(X1,esk5_2(esk2_0,X1))
| ~ v1_tsp_1(X1,esk2_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_45,c_0_24]),c_0_10])]) ).
cnf(c_0_51,negated_conjecture,
( esk5_2(esk2_0,esk3_0) != esk3_0
| ~ v1_tsp_1(esk3_0,esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_46,c_0_47]),c_0_10])]),c_0_37]) ).
cnf(c_0_52,negated_conjecture,
( X1 = esk5_2(esk2_0,esk3_0)
| ~ v1_tsp_2(X1,esk1_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ r1_tarski(X1,esk5_2(esk2_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_53,negated_conjecture,
r1_tarski(esk3_0,esk5_2(esk2_0,esk3_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_50,c_0_20]),c_0_36])]),c_0_37]) ).
cnf(c_0_54,negated_conjecture,
esk5_2(esk2_0,esk3_0) != esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_36])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_52,c_0_20]),c_0_21]),c_0_53])]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : TOP023+4 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 10:45:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.07/25.13 eprover: CPU time limit exceeded, terminating
% 2.14/38.23 eprover: CPU time limit exceeded, terminating
% 2.15/38.63 eprover: CPU time limit exceeded, terminating
% 2.15/39.25 eprover: CPU time limit exceeded, terminating
% 2.27/62.27 eprover: CPU time limit exceeded, terminating
% 2.33/75.28 eprover: CPU time limit exceeded, terminating
% 2.41/88.92 eprover: CPU time limit exceeded, terminating
% 2.45/98.30 eprover: CPU time limit exceeded, terminating
% 2.46/99.05 eprover: CPU time limit exceeded, terminating
% 2.49/102.89 eprover: CPU time limit exceeded, terminating
% 2.58/121.32 eprover: CPU time limit exceeded, terminating
% 2.59/125.02 eprover: CPU time limit exceeded, terminating
% 2.60/125.90 eprover: CPU time limit exceeded, terminating
% 2.66/135.75 eprover: CPU time limit exceeded, terminating
% 2.70/144.35 eprover: CPU time limit exceeded, terminating
% 2.72/148.04 eprover: CPU time limit exceeded, terminating
% 2.77/158.78 eprover: CPU time limit exceeded, terminating
% 2.79/162.32 eprover: CPU time limit exceeded, terminating
% 2.81/167.43 eprover: CPU time limit exceeded, terminating
% 2.82/171.07 eprover: CPU time limit exceeded, terminating
% 2.91/190.51 eprover: CPU time limit exceeded, terminating
% 2.99/204.97 eprover: CPU time limit exceeded, terminating
% 3.04/213.43 eprover: CPU time limit exceeded, terminating
% 3.05/218.26 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 3.05/218.26 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 3.05/218.26 # Preprocessing time : 1.287 s
% 3.05/218.26
% 3.05/218.26 # Failure: Out of unprocessed clauses!
% 3.05/218.26 # OLD status GaveUp
% 3.05/218.26 # Parsed axioms : 34380
% 3.05/218.26 # Removed by relevancy pruning/SinE : 33892
% 3.05/218.26 # Initial clauses : 1041
% 3.05/218.26 # Removed in clause preprocessing : 36
% 3.05/218.26 # Initial clauses in saturation : 1005
% 3.05/218.26 # Processed clauses : 1136
% 3.05/218.26 # ...of these trivial : 9
% 3.05/218.26 # ...subsumed : 82
% 3.05/218.26 # ...remaining for further processing : 1045
% 3.05/218.26 # Other redundant clauses eliminated : 68
% 3.05/218.26 # Clauses deleted for lack of memory : 10953
% 3.05/218.26 # Backward-subsumed : 0
% 3.05/218.26 # Backward-rewritten : 6
% 3.05/218.26 # Generated clauses : 11795
% 3.05/218.26 # ...of the previous two non-trivial : 11323
% 3.05/218.26 # Contextual simplify-reflections : 253
% 3.05/218.26 # Paramodulations : 11687
% 3.05/218.26 # Factorizations : 9
% 3.05/218.26 # Equation resolutions : 99
% 3.05/218.26 # Current number of processed clauses : 1013
% 3.05/218.26 # Positive orientable unit clauses : 163
% 3.05/218.26 # Positive unorientable unit clauses: 6
% 3.05/218.26 # Negative unit clauses : 35
% 3.05/218.26 # Non-unit-clauses : 809
% 3.05/218.26 # Current number of unprocessed clauses: 0
% 3.05/218.26 # ...number of literals in the above : 0
% 3.05/218.26 # Current number of archived formulas : 0
% 3.05/218.26 # Current number of archived clauses : 7
% 3.05/218.26 # Clause-clause subsumption calls (NU) : 346772
% 3.05/218.26 # Rec. Clause-clause subsumption calls : 20878
% 3.05/218.26 # Non-unit clause-clause subsumptions : 332
% 3.05/218.26 # Unit Clause-clause subsumption calls : 3881
% 3.05/218.26 # Rewrite failures with RHS unbound : 4
% 3.05/218.26 # BW rewrite match attempts : 417
% 3.05/218.26 # BW rewrite match successes : 13
% 3.05/218.26 # Condensation attempts : 0
% 3.05/218.26 # Condensation successes : 0
% 3.05/218.26 # Termbank termtop insertions : 135321704
% 3.05/218.26
% 3.05/218.26 # -------------------------------------------------
% 3.05/218.26 # User time : 13.786 s
% 3.05/218.26 # System time : 0.294 s
% 3.05/218.26 # Total time : 14.080 s
% 3.05/218.26 # Maximum resident set size: 544384 pages
% 3.05/218.26 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 3.05/218.26
% 3.05/218.26 # Failure: Resource limit exceeded (time)
% 3.05/218.26 # OLD status Res
% 3.05/218.26 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 3.05/218.26 # Preprocessing time : 1.233 s
% 3.05/218.26 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 3.05/218.26
% 3.05/218.26 # Failure: Resource limit exceeded (time)
% 3.05/218.26 # OLD status Res
% 3.05/218.26 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 3.05/218.26 # Preprocessing time : 1.413 s
% 3.05/218.26 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 3.05/218.26 # Preprocessing time : 8.856 s
% 3.05/218.26
% 3.05/218.26 # Failure: Out of unprocessed clauses!
% 3.05/218.26 # OLD status GaveUp
% 3.05/218.26 # Parsed axioms : 34380
% 3.05/218.26 # Removed by relevancy pruning/SinE : 0
% 3.05/218.26 # Initial clauses : 103140
% 3.05/218.26 # Removed in clause preprocessing : 9071
% 3.05/218.26 # Initial clauses in saturation : 94069
% 3.05/218.26 # Processed clauses : 16
% 3.05/218.26 # ...of these trivial : 0
% 3.05/218.26 # ...subsumed : 1
% 3.05/218.26 # ...remaining for further processing : 15
% 3.05/218.26 # Other redundant clauses eliminated : 0
% 3.05/218.26 # Clauses deleted for lack of memory : 94053
% 3.05/218.26 # Backward-subsumed : 0
% 3.05/218.26 # Backward-rewritten : 0
% 3.05/218.26 # Generated clauses : 0
% 3.05/218.26 # ...of the previous two non-trivial : 0
% 3.05/218.26 # Contextual simplify-reflections : 0
% 3.05/218.26 # Paramodulations : 0
% 3.05/218.26 # Factorizations : 0
% 3.05/218.26 # Equation resolutions : 0
% 3.05/218.26 # Current number of processed clauses : 15
% 3.05/218.26 # Positive orientable unit clauses : 13
% 3.05/218.26 # Positive unorientable unit clauses: 0
% 3.05/218.26 # Negative unit clauses : 2
% 3.05/218.26 # Non-unit-clauses : 0
% 3.05/218.26 # Current number of unprocessed clauses: 0
% 3.05/218.26 # ...number of literals in the above : 0
% 3.05/218.26 # Current number of archived formulas : 0
% 3.05/218.26 # Current number of archived clauses : 0
% 3.05/218.26 # Clause-clause subsumption calls (NU) : 0
% 3.05/218.26 # Rec. Clause-clause subsumption calls : 0
% 3.05/218.26 # Non-unit clause-clause subsumptions : 0
% 3.05/218.26 # Unit Clause-clause subsumption calls : 0
% 3.05/218.26 # Rewrite failures with RHS unbound : 0
% 3.05/218.26 # BW rewrite match attempts : 1
% 3.05/218.26 # BW rewrite match successes : 0
% 3.05/218.26 # Condensation attempts : 0
% 3.05/218.26 # Condensation successes : 0
% 3.05/218.26 # Termbank termtop insertions : 10322091
% 3.05/218.26
% 3.05/218.26 # -------------------------------------------------
% 3.05/218.26 # User time : 13.450 s
% 3.05/218.26 # System time : 0.279 s
% 3.05/218.26 # Total time : 13.729 s
% 3.05/218.26 # Maximum resident set size: 395124 pages
% 3.05/218.26 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 3.05/218.26
% 3.05/218.26 # Failure: Resource limit exceeded (time)
% 3.05/218.26 # OLD status Res
% 3.05/218.26 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 3.05/218.26 # Preprocessing time : 1.129 s
% 3.05/218.26 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 3.05/218.26 # Preprocessing time : 8.850 s
% 3.05/218.26
% 3.05/218.26 # Failure: Out of unprocessed clauses!
% 3.05/218.26 # OLD status GaveUp
% 3.05/218.26 # Parsed axioms : 34380
% 3.05/218.26 # Removed by relevancy pruning/SinE : 0
% 3.05/218.26 # Initial clauses : 103140
% 3.05/218.26 # Removed in clause preprocessing : 9071
% 3.05/218.26 # Initial clauses in saturation : 94069
% 3.05/218.26 # Processed clauses : 16
% 3.05/218.26 # ...of these trivial : 0
% 3.05/218.26 # ...subsumed : 0
% 3.05/218.26 # ...remaining for further processing : 16
% 3.05/218.26 # Other redundant clauses eliminated : 0
% 3.05/218.26 # Clauses deleted for lack of memory : 94053
% 3.05/218.26 # Backward-subsumed : 0
% 3.05/218.26 # Backward-rewritten : 0
% 3.05/218.26 # Generated clauses : 0
% 3.05/218.26 # ...of the previous two non-trivial : 0
% 3.05/218.26 # Contextual simplify-reflections : 0
% 3.05/218.26 # Paramodulations : 0
% 3.05/218.26 # Factorizations : 0
% 3.05/218.26 # Equation resolutions : 0
% 3.05/218.26 # Current number of processed clauses : 16
% 3.05/218.26 # Positive orientable unit clauses : 5
% 3.05/218.26 # Positive unorientable unit clauses: 0
% 3.05/218.26 # Negative unit clauses : 11
% 3.05/218.26 # Non-unit-clauses : 0
% 3.05/218.26 # Current number of unprocessed clauses: 0
% 3.05/218.26 # ...number of literals in the above : 0
% 3.05/218.26 # Current number of archived formulas : 0
% 3.05/218.26 # Current number of archived clauses : 0
% 3.05/218.26 # Clause-clause subsumption calls (NU) : 0
% 3.05/218.26 # Rec. Clause-clause subsumption calls : 0
% 3.05/218.26 # Non-unit clause-clause subsumptions : 0
% 3.05/218.26 # Unit Clause-clause subsumption calls : 7
% 3.05/218.26 # Rewrite failures with RHS unbound : 0
% 3.05/218.26 # BW rewrite match attempts : 0
% 3.05/218.26 # BW rewrite match successes : 0
% 3.05/218.26 # Condensation attempts : 0
% 3.05/218.26 # Condensation successes : 0
% 3.05/218.26 # Termbank termtop insertions : 10322087
% 3.05/218.26
% 3.05/218.26 # -------------------------------------------------
% 3.05/218.26 # User time : 13.267 s
% 3.05/218.26 # System time : 0.369 s
% 3.05/218.26 # Total time : 13.636 s
% 3.05/218.26 # Maximum resident set size: 549048 pages
% 3.05/218.26 # Running protocol protocol_eprover_e6b386026570787d4ac06e541c4634c5e3f09cc5 for 23 seconds:
% 3.05/218.26
% 3.05/218.26 # Failure: Resource limit exceeded (time)
% 3.05/218.26 # OLD status Res
% 3.05/218.26 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,100,1.0)
% 3.05/218.26 # Preprocessing time : 1.259 s
% 3.05/218.26 # Running protocol protocol_eprover_2e85aeff02a0bd3743f362014f6604d7fba54d74 for 23 seconds:
% 3.05/218.26
% 3.05/218.26 # Failure: Resource limit exceeded (time)
% 3.05/218.26 # OLD status Res
% 3.05/218.26 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 3.05/218.26 # Preprocessing time : 1.159 s
% 3.05/218.26 # Running protocol protocol_eprover_334d43c175335e554899225728a5c2ebd420f86b for 23 seconds:
% 3.05/218.26 # Preprocessing time : 12.720 s
% 3.05/218.26
% 3.05/218.26 # Failure: Out of unprocessed clauses!
% 3.05/218.26 # OLD status GaveUp
% 3.05/218.26 # Parsed axioms : 34380
% 3.05/218.26 # Removed by relevancy pruning/SinE : 0
% 3.05/218.26 # Initial clauses : 103140
% 3.05/218.26 # Removed in clause preprocessing : 9071
% 3.05/218.26 # Initial clauses in saturation : 94069
% 3.05/218.26 # Processed clauses : 16
% 3.05/218.26 # ...of these trivial : 1
% 3.05/218.26 # ...subsumed : 0
% 3.05/218.26 # ...remaining for further processing : 15
% 3.05/218.26 # Other redundant clauses eliminated : 0
% 3.05/218.26 # Clauses deleted for lack of memory : 94058
% 3.05/218.26 # Backward-subsumed : 0
% 3.05/218.26 # Backward-rewritten : 0
% 3.05/218.26 # Generated clauses : 7
% 3.05/218.26 # ...of the previous two non-trivial : 5
% 3.05/218.26 # Contextual simplify-reflections : 0
% 3.05/218.26 # Paramodulations : 5
% 3.05/218.26 # Factorizations : 0
% 3.05/218.26 # Equation resolutions : 2
% 3.05/218.26 # Current number of processed clauses : 15
% 3.05/218.26 # Positive orientable unit clauses : 11
% 3.05/218.26 # Positive unorientable unit clauses: 0
% 3.05/218.26 # Negative unit clauses : 1
% 3.05/218.26 # Non-unit-clauses : 3
% 3.05/218.26 # Current number of unprocessed clauses: 0
% 3.05/218.26 # ...number of literals in the above : 0
% 3.05/218.26 # Current number of archived formulas : 0
% 3.05/218.26 # Current number of archived clauses : 0
% 3.05/218.26 # Clause-clause subsumption calls (NU) : 4
% 3.05/218.26 # Rec. Clause-clause subsumption calls : 4
% 3.05/218.26 # Non-unit clause-clause subsumptions : 0
% 3.05/218.26 # Unit Clause-clause subsumption calls : 18
% 3.05/218.26 # Rewrite failures with RHS unbound : 0
% 3.05/218.26 # BW rewrite match attempts : 0
% 3.05/218.26 # BW rewrite match successes : 0
% 3.05/218.26 # Condensation attempts : 0
% 3.05/218.26 # Condensation successes : 0
% 3.05/218.26 # Termbank termtop insertions : 10322187
% 3.05/218.26
% 3.05/218.26 # -------------------------------------------------
% 3.05/218.26 # User time : 19.105 s
% 3.05/218.26 # System time : 0.450 s
% 3.05/218.26 # Total time : 19.555 s
% 3.05/218.26 # Maximum resident set size: 409376 pages
% 3.05/218.26 # Running protocol protocol_eprover_13918ce26d63c8fe682016bfda2032977bcbf85b for 23 seconds:
% 3.05/218.26 # Preprocessing time : 11.804 s
% 3.05/218.26
% 3.05/218.26 # Failure: Out of unprocessed clauses!
% 3.05/218.26 # OLD status GaveUp
% 3.05/218.26 # Parsed axioms : 34380
% 3.05/218.26 # Removed by relevancy pruning/SinE : 0
% 3.05/218.26 # Initial clauses : 103140
% 3.05/218.26 # Removed in clause preprocessing : 9071
% 3.05/218.26 # Initial clauses in saturation : 94069
% 3.05/218.26 # Processed clauses : 16
% 3.05/218.26 # ...of these trivial : 1
% 3.05/218.26 # ...subsumed : 0
% 3.05/218.26 # ...remaining for further processing : 15
% 3.05/218.26 # Other redundant clauses eliminated : 0
% 3.05/218.26 # Clauses deleted for lack of memory : 94058
% 3.05/218.26 # Backward-subsumed : 0
% 3.05/218.26 # Backward-rewritten : 1
% 3.05/218.26 # Generated clauses : 6
% 3.05/218.26 # ...of the previous two non-trivial : 5
% 3.05/218.26 # Contextual simplify-reflections : 0
% 3.05/218.26 # Paramodulations : 4
% 3.05/218.26 # Factorizations : 0
% 3.05/218.26 # Equation resolutions : 2
% 3.05/218.26 # Current number of processed clauses : 14
% 3.05/218.26 # Positive orientable unit clauses : 7
% 3.05/218.26 # Positive unorientable unit clauses: 0
% 3.05/218.26 # Negative unit clauses : 1
% 3.05/218.26 # Non-unit-clauses : 6
% 3.05/218.26 # Current number of unprocessed clauses: 0
% 3.05/218.26 # ...number of literals in the above : 0
% 3.05/218.26 # Current number of archived formulas : 0
% 3.05/218.26 # Current number of archived clauses : 1
% 3.05/218.26 # Clause-clause subsumption calls (NU) : 7
% 3.05/218.26 # Rec. Clause-clause subsumption calls : 3
% 3.05/218.26 # Non-unit clause-clause subsumptions : 0
% 3.05/218.26 # Unit Clause-clause subsumption calls : 5
% 3.05/218.26 # Rewrite failures with RHS unbound : 0
% 3.05/218.26 # BW rewrite match attempts : 2
% 3.05/218.26 # BW rewrite match successes : 1
% 3.05/218.26 # Condensation attempts : 0
% 3.05/218.26 # Condensation successes : 0
% 3.05/218.26 # Termbank termtop insertions : 10322204
% 3.05/218.26
% 3.05/218.26 # -------------------------------------------------
% 3.05/218.26 # User time : 16.074 s
% 3.05/218.26 # System time : 0.417 s
% 3.05/218.26 # Total time : 16.491 s
% 3.05/218.26 # Maximum resident set size: 409200 pages
% 3.05/218.26 # Running protocol protocol_eprover_374255c1532cc4daa30b60038971be8183a2c553 for 23 seconds:
% 3.05/218.26 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,03,100,1.0)
% 3.05/218.26 # Preprocessing time : 1.236 s
% 3.05/218.26
% 3.05/218.26 # Proof found!
% 3.05/218.26 # SZS status Theorem
% 3.05/218.26 # SZS output start CNFRefutation
% See solution above
% 3.05/218.26 # Proof object total steps : 56
% 3.05/218.26 # Proof object clause steps : 45
% 3.05/218.26 # Proof object formula steps : 11
% 3.05/218.26 # Proof object conjectures : 37
% 3.05/218.26 # Proof object clause conjectures : 34
% 3.05/218.26 # Proof object formula conjectures : 3
% 3.05/218.26 # Proof object initial clauses used : 18
% 3.05/218.26 # Proof object initial formulas used : 5
% 3.05/218.26 # Proof object generating inferences : 21
% 3.05/218.26 # Proof object simplifying inferences : 53
% 3.05/218.26 # Training examples: 0 positive, 0 negative
% 3.05/218.26 # Parsed axioms : 34380
% 3.05/218.26 # Removed by relevancy pruning/SinE : 34279
% 3.05/218.26 # Initial clauses : 275
% 3.05/218.26 # Removed in clause preprocessing : 14
% 3.05/218.26 # Initial clauses in saturation : 261
% 3.05/218.26 # Processed clauses : 21195
% 3.05/218.26 # ...of these trivial : 166
% 3.05/218.26 # ...subsumed : 7241
% 3.05/218.26 # ...remaining for further processing : 13788
% 3.05/218.26 # Other redundant clauses eliminated : 85
% 3.05/218.26 # Clauses deleted for lack of memory : 344751
% 3.05/218.26 # Backward-subsumed : 167
% 3.05/218.26 # Backward-rewritten : 1934
% 3.05/218.26 # Generated clauses : 528970
% 3.05/218.26 # ...of the previous two non-trivial : 513126
% 3.05/218.26 # Contextual simplify-reflections : 0
% 3.05/218.26 # Paramodulations : 528166
% 3.05/218.26 # Factorizations : 30
% 3.05/218.26 # Equation resolutions : 755
% 3.05/218.26 # Current number of processed clauses : 11669
% 3.05/218.26 # Positive orientable unit clauses : 1046
% 3.05/218.26 # Positive unorientable unit clauses: 0
% 3.05/218.26 # Negative unit clauses : 262
% 3.05/218.26 # Non-unit-clauses : 10361
% 3.05/218.26 # Current number of unprocessed clauses: 112557
% 3.05/218.26 # ...number of literals in the above : 431596
% 3.05/218.26 # Current number of archived formulas : 0
% 3.05/218.26 # Current number of archived clauses : 2108
% 3.05/218.26 # Clause-clause subsumption calls (NU) : 5949293
% 3.05/218.26 # Rec. Clause-clause subsumption calls : 1065886
% 3.05/218.26 # Non-unit clause-clause subsumptions : 4967
% 3.05/218.26 # Unit Clause-clause subsumption calls : 1372018
% 3.05/218.26 # Rewrite failures with RHS unbound : 0
% 3.05/218.26 # BW rewrite match attempts : 8788
% 3.05/218.26 # BW rewrite match successes : 229
% 3.05/218.26 # Condensation attempts : 0
% 3.05/218.26 # Condensation successes : 0
% 3.05/218.26 # Termbank termtop insertions : 13812746
% 3.05/218.26
% 3.05/218.26 # -------------------------------------------------
% 3.05/218.26 # User time : 22.377 s
% 3.05/218.26 # System time : 0.199 s
% 3.05/218.26 # Total time : 22.576 s
% 3.05/218.26 # Maximum resident set size: 237604 pages
% 3.05/226.29 eprover: CPU time limit exceeded, terminating
% 3.05/226.30 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.05/226.30 eprover: No such file or directory
% 3.05/227.98 eprover: CPU time limit exceeded, terminating
%------------------------------------------------------------------------------