TSTP Solution File: TOP037+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : TOP037+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:32 EDT 2022
% Result : Theorem 2.91s 199.67s
% Output : CNFRefutation 2.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 18 unt; 0 def)
% Number of atoms : 259 ( 30 equ)
% Maximal formula atoms : 63 ( 5 avg)
% Number of connectives : 346 ( 132 ~; 151 |; 42 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-4 aty)
% Number of variables : 62 ( 1 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t30_tsp_2,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_tsp_2(X2,X1)
& m2_tsp_1(X2,X1) )
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> k4_pre_topc(X1,X2,k4_tsp_2(X1,X2),X3) = k4_pre_topc(X1,X2,k4_tsp_2(X1,X2),k3_tex_4(X1,X3)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t30_tsp_2) ).
fof(redefinition_m2_tsp_1,axiom,
! [X1] :
( l1_pre_topc(X1)
=> ! [X2] :
( m2_tsp_1(X2,X1)
<=> m1_pre_topc(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+406.ax',redefinition_m2_tsp_1) ).
fof(dt_k4_tsp_2,axiom,
! [X1,X2] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1)
& ~ v3_struct_0(X2)
& v2_tsp_2(X2,X1)
& m1_pre_topc(X2,X1) )
=> ( v1_funct_1(k4_tsp_2(X1,X2))
& v1_funct_2(k4_tsp_2(X1,X2),u1_struct_0(X1),u1_struct_0(X2))
& v5_pre_topc(k4_tsp_2(X1,X2),X1,X2)
& m2_relset_1(k4_tsp_2(X1,X2),u1_struct_0(X1),u1_struct_0(X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_k4_tsp_2) ).
fof(d12_tsp_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_tsp_2(X2,X1)
& m2_tsp_1(X2,X1) )
=> ! [X3] :
( ( v1_funct_1(X3)
& v1_funct_2(X3,u1_struct_0(X1),u1_struct_0(X2))
& v5_pre_topc(X3,X1,X2)
& m2_relset_1(X3,u1_struct_0(X1),u1_struct_0(X2)) )
=> ( X3 = k4_tsp_2(X1,X2)
<=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X1)))
=> ( X4 = u1_struct_0(X2)
=> ! [X5] :
( m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X1)))
=> k5_subset_1(u1_struct_0(X1),X4,k3_tex_4(X1,X5)) = k4_pre_topc(X1,X2,X3,X5) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d12_tsp_2) ).
fof(dt_k3_tex_4,axiom,
! [X1,X2] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) )
=> m1_subset_1(k3_tex_4(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+405.ax',dt_k3_tex_4) ).
fof(t35_tex_4,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> k3_tex_4(X1,X2) = k3_tex_4(X1,k3_tex_4(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+405.ax',t35_tex_4) ).
fof(l19_tsp_2,axiom,
! [X1] :
( ( ~ v3_struct_0(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( m2_tsp_1(X2,X1)
=> m1_subset_1(u1_struct_0(X2),k1_zfmisc_1(u1_struct_0(X1))) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',l19_tsp_2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_pre_topc(X1)
& l1_pre_topc(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_tsp_2(X2,X1)
& m2_tsp_1(X2,X1) )
=> ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> k4_pre_topc(X1,X2,k4_tsp_2(X1,X2),X3) = k4_pre_topc(X1,X2,k4_tsp_2(X1,X2),k3_tex_4(X1,X3)) ) ) ),
inference(assume_negation,[status(cth)],[t30_tsp_2]) ).
fof(c_0_8,plain,
! [X3,X4,X4] :
( ( ~ m2_tsp_1(X4,X3)
| m1_pre_topc(X4,X3)
| ~ l1_pre_topc(X3) )
& ( ~ m1_pre_topc(X4,X3)
| m2_tsp_1(X4,X3)
| ~ l1_pre_topc(X3) ) ),
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)],[redefinition_m2_tsp_1])])])])])]) ).
fof(c_0_9,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_pre_topc(esk1_0)
& l1_pre_topc(esk1_0)
& ~ v3_struct_0(esk2_0)
& v2_tsp_2(esk2_0,esk1_0)
& m2_tsp_1(esk2_0,esk1_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0)))
& k4_pre_topc(esk1_0,esk2_0,k4_tsp_2(esk1_0,esk2_0),esk3_0) != k4_pre_topc(esk1_0,esk2_0,k4_tsp_2(esk1_0,esk2_0),k3_tex_4(esk1_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_7])])])])])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ( v1_funct_1(k4_tsp_2(X3,X4))
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3)
| v3_struct_0(X4)
| ~ v2_tsp_2(X4,X3)
| ~ m1_pre_topc(X4,X3) )
& ( v1_funct_2(k4_tsp_2(X3,X4),u1_struct_0(X3),u1_struct_0(X4))
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3)
| v3_struct_0(X4)
| ~ v2_tsp_2(X4,X3)
| ~ m1_pre_topc(X4,X3) )
& ( v5_pre_topc(k4_tsp_2(X3,X4),X3,X4)
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3)
| v3_struct_0(X4)
| ~ v2_tsp_2(X4,X3)
| ~ m1_pre_topc(X4,X3) )
& ( m2_relset_1(k4_tsp_2(X3,X4),u1_struct_0(X3),u1_struct_0(X4))
| v3_struct_0(X3)
| ~ v2_pre_topc(X3)
| ~ l1_pre_topc(X3)
| v3_struct_0(X4)
| ~ v2_tsp_2(X4,X3)
| ~ m1_pre_topc(X4,X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k4_tsp_2])])])]) ).
cnf(c_0_11,plain,
( m1_pre_topc(X2,X1)
| ~ l1_pre_topc(X1)
| ~ m2_tsp_1(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
m2_tsp_1(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X6,X7,X8,X9,X10] :
( ( X8 != k4_tsp_2(X6,X7)
| ~ m1_subset_1(X9,k1_zfmisc_1(u1_struct_0(X6)))
| X9 != u1_struct_0(X7)
| ~ m1_subset_1(X10,k1_zfmisc_1(u1_struct_0(X6)))
| k5_subset_1(u1_struct_0(X6),X9,k3_tex_4(X6,X10)) = k4_pre_topc(X6,X7,X8,X10)
| ~ v1_funct_1(X8)
| ~ v1_funct_2(X8,u1_struct_0(X6),u1_struct_0(X7))
| ~ v5_pre_topc(X8,X6,X7)
| ~ m2_relset_1(X8,u1_struct_0(X6),u1_struct_0(X7))
| v3_struct_0(X7)
| ~ v2_tsp_2(X7,X6)
| ~ m2_tsp_1(X7,X6)
| v3_struct_0(X6)
| ~ v2_pre_topc(X6)
| ~ l1_pre_topc(X6) )
& ( m1_subset_1(esk14_3(X6,X7,X8),k1_zfmisc_1(u1_struct_0(X6)))
| X8 = k4_tsp_2(X6,X7)
| ~ v1_funct_1(X8)
| ~ v1_funct_2(X8,u1_struct_0(X6),u1_struct_0(X7))
| ~ v5_pre_topc(X8,X6,X7)
| ~ m2_relset_1(X8,u1_struct_0(X6),u1_struct_0(X7))
| v3_struct_0(X7)
| ~ v2_tsp_2(X7,X6)
| ~ m2_tsp_1(X7,X6)
| v3_struct_0(X6)
| ~ v2_pre_topc(X6)
| ~ l1_pre_topc(X6) )
& ( esk14_3(X6,X7,X8) = u1_struct_0(X7)
| X8 = k4_tsp_2(X6,X7)
| ~ v1_funct_1(X8)
| ~ v1_funct_2(X8,u1_struct_0(X6),u1_struct_0(X7))
| ~ v5_pre_topc(X8,X6,X7)
| ~ m2_relset_1(X8,u1_struct_0(X6),u1_struct_0(X7))
| v3_struct_0(X7)
| ~ v2_tsp_2(X7,X6)
| ~ m2_tsp_1(X7,X6)
| v3_struct_0(X6)
| ~ v2_pre_topc(X6)
| ~ l1_pre_topc(X6) )
& ( m1_subset_1(esk15_3(X6,X7,X8),k1_zfmisc_1(u1_struct_0(X6)))
| X8 = k4_tsp_2(X6,X7)
| ~ v1_funct_1(X8)
| ~ v1_funct_2(X8,u1_struct_0(X6),u1_struct_0(X7))
| ~ v5_pre_topc(X8,X6,X7)
| ~ m2_relset_1(X8,u1_struct_0(X6),u1_struct_0(X7))
| v3_struct_0(X7)
| ~ v2_tsp_2(X7,X6)
| ~ m2_tsp_1(X7,X6)
| v3_struct_0(X6)
| ~ v2_pre_topc(X6)
| ~ l1_pre_topc(X6) )
& ( k5_subset_1(u1_struct_0(X6),esk14_3(X6,X7,X8),k3_tex_4(X6,esk15_3(X6,X7,X8))) != k4_pre_topc(X6,X7,X8,esk15_3(X6,X7,X8))
| X8 = k4_tsp_2(X6,X7)
| ~ v1_funct_1(X8)
| ~ v1_funct_2(X8,u1_struct_0(X6),u1_struct_0(X7))
| ~ v5_pre_topc(X8,X6,X7)
| ~ m2_relset_1(X8,u1_struct_0(X6),u1_struct_0(X7))
| v3_struct_0(X7)
| ~ v2_tsp_2(X7,X6)
| ~ m2_tsp_1(X7,X6)
| v3_struct_0(X6)
| ~ v2_pre_topc(X6)
| ~ l1_pre_topc(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_tsp_2])])])])])])])]) ).
cnf(c_0_15,plain,
( v3_struct_0(X1)
| v3_struct_0(X2)
| v1_funct_2(k4_tsp_2(X2,X1),u1_struct_0(X2),u1_struct_0(X1))
| ~ m1_pre_topc(X1,X2)
| ~ v2_tsp_2(X1,X2)
| ~ l1_pre_topc(X2)
| ~ v2_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
v2_tsp_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
~ v3_struct_0(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
m1_pre_topc(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_21,plain,
( v3_struct_0(X1)
| v3_struct_0(X2)
| v5_pre_topc(k4_tsp_2(X2,X1),X2,X1)
| ~ m1_pre_topc(X1,X2)
| ~ v2_tsp_2(X1,X2)
| ~ l1_pre_topc(X2)
| ~ v2_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( v3_struct_0(X1)
| v3_struct_0(X2)
| m2_relset_1(k4_tsp_2(X2,X1),u1_struct_0(X2),u1_struct_0(X1))
| ~ m1_pre_topc(X1,X2)
| ~ v2_tsp_2(X1,X2)
| ~ l1_pre_topc(X2)
| ~ v2_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
( v3_struct_0(X1)
| v3_struct_0(X2)
| v1_funct_1(k4_tsp_2(X2,X1))
| ~ m1_pre_topc(X1,X2)
| ~ v2_tsp_2(X1,X2)
| ~ l1_pre_topc(X2)
| ~ v2_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_24,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ l1_pre_topc(X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| m1_subset_1(k3_tex_4(X3,X4),k1_zfmisc_1(u1_struct_0(X3))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k3_tex_4])])]) ).
fof(c_0_25,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ l1_pre_topc(X3)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X3)))
| k3_tex_4(X3,X4) = k3_tex_4(X3,k3_tex_4(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t35_tex_4])])])])])]) ).
cnf(c_0_26,plain,
( v3_struct_0(X1)
| v3_struct_0(X2)
| k5_subset_1(u1_struct_0(X1),X4,k3_tex_4(X1,X5)) = k4_pre_topc(X1,X2,X3,X5)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m2_tsp_1(X2,X1)
| ~ v2_tsp_2(X2,X1)
| ~ m2_relset_1(X3,u1_struct_0(X1),u1_struct_0(X2))
| ~ v5_pre_topc(X3,X1,X2)
| ~ v1_funct_2(X3,u1_struct_0(X1),u1_struct_0(X2))
| ~ v1_funct_1(X3)
| ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(X1)))
| X4 != u1_struct_0(X2)
| ~ m1_subset_1(X4,k1_zfmisc_1(u1_struct_0(X1)))
| X3 != k4_tsp_2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,negated_conjecture,
v1_funct_2(k4_tsp_2(esk1_0,esk2_0),u1_struct_0(esk1_0),u1_struct_0(esk2_0)),
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(pm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_13])]),c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_28,negated_conjecture,
v5_pre_topc(k4_tsp_2(esk1_0,esk2_0),esk1_0,esk2_0),
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(pm,[status(thm)],[c_0_21,c_0_16]),c_0_17]),c_0_13])]),c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_29,negated_conjecture,
m2_relset_1(k4_tsp_2(esk1_0,esk2_0),u1_struct_0(esk1_0),u1_struct_0(esk2_0)),
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(pm,[status(thm)],[c_0_22,c_0_16]),c_0_17]),c_0_13])]),c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_30,negated_conjecture,
v1_funct_1(k4_tsp_2(esk1_0,esk2_0)),
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(pm,[status(thm)],[c_0_23,c_0_16]),c_0_17]),c_0_13])]),c_0_18]),c_0_19]),c_0_20])]) ).
fof(c_0_31,plain,
! [X3,X4] :
( v3_struct_0(X3)
| ~ l1_pre_topc(X3)
| ~ m2_tsp_1(X4,X3)
| m1_subset_1(u1_struct_0(X4),k1_zfmisc_1(u1_struct_0(X3))) ),
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)],[l19_tsp_2])])])])])]) ).
cnf(c_0_32,plain,
( m1_subset_1(k3_tex_4(X1,X2),k1_zfmisc_1(u1_struct_0(X1)))
| v3_struct_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,plain,
( k3_tex_4(X1,X2) = k3_tex_4(X1,k3_tex_4(X1,X2))
| v3_struct_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,negated_conjecture,
( k5_subset_1(u1_struct_0(esk1_0),X1,k3_tex_4(esk1_0,X2)) = k4_pre_topc(esk1_0,esk2_0,k4_tsp_2(esk1_0,esk2_0),X2)
| X1 != u1_struct_0(esk2_0)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(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(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_26,c_0_27]),c_0_16]),c_0_12]),c_0_28]),c_0_17]),c_0_13]),c_0_29]),c_0_30])]),c_0_19]),c_0_18]) ).
cnf(c_0_36,plain,
( m1_subset_1(u1_struct_0(X1),k1_zfmisc_1(u1_struct_0(X2)))
| v3_struct_0(X2)
| ~ m2_tsp_1(X1,X2)
| ~ l1_pre_topc(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
m1_subset_1(k3_tex_4(esk1_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_32,c_0_33]),c_0_13])]),c_0_18]) ).
cnf(c_0_38,negated_conjecture,
k3_tex_4(esk1_0,k3_tex_4(esk1_0,esk3_0)) = k3_tex_4(esk1_0,esk3_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_33]),c_0_13])]),c_0_18]) ).
cnf(c_0_39,negated_conjecture,
( k5_subset_1(u1_struct_0(esk1_0),X1,k3_tex_4(esk1_0,esk3_0)) = k4_pre_topc(esk1_0,esk2_0,k4_tsp_2(esk1_0,esk2_0),esk3_0)
| X1 != u1_struct_0(esk2_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(pm,[status(thm)],[c_0_35,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
m1_subset_1(u1_struct_0(esk2_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_36,c_0_12]),c_0_13])]),c_0_18]) ).
cnf(c_0_41,negated_conjecture,
( k5_subset_1(u1_struct_0(esk1_0),X1,k3_tex_4(esk1_0,esk3_0)) = k4_pre_topc(esk1_0,esk2_0,k4_tsp_2(esk1_0,esk2_0),k3_tex_4(esk1_0,esk3_0))
| X1 != u1_struct_0(esk2_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_35,c_0_37]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
k5_subset_1(u1_struct_0(esk1_0),u1_struct_0(esk2_0),k3_tex_4(esk1_0,esk3_0)) = k4_pre_topc(esk1_0,esk2_0,k4_tsp_2(esk1_0,esk2_0),esk3_0),
inference(pm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
k4_pre_topc(esk1_0,esk2_0,k4_tsp_2(esk1_0,esk2_0),esk3_0) != k4_pre_topc(esk1_0,esk2_0,k4_tsp_2(esk1_0,esk2_0),k3_tex_4(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_41,c_0_40]),c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : TOP037+4 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n024.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 : Sun May 29 15:17:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.95/25.01 eprover: CPU time limit exceeded, terminating
% 1.95/25.02 eprover: CPU time limit exceeded, terminating
% 2.01/39.20 eprover: CPU time limit exceeded, terminating
% 2.03/40.47 eprover: CPU time limit exceeded, terminating
% 2.06/48.06 eprover: CPU time limit exceeded, terminating
% 2.19/71.11 eprover: CPU time limit exceeded, terminating
% 2.27/84.01 eprover: CPU time limit exceeded, terminating
% 2.33/94.61 eprover: CPU time limit exceeded, terminating
% 2.39/107.03 eprover: CPU time limit exceeded, terminating
% 2.40/108.50 eprover: CPU time limit exceeded, terminating
% 2.41/109.51 eprover: CPU time limit exceeded, terminating
% 2.52/130.06 eprover: CPU time limit exceeded, terminating
% 2.52/131.24 eprover: CPU time limit exceeded, terminating
% 2.55/132.53 eprover: CPU time limit exceeded, terminating
% 2.61/145.69 eprover: CPU time limit exceeded, terminating
% 2.66/153.08 eprover: CPU time limit exceeded, terminating
% 2.66/154.27 eprover: CPU time limit exceeded, terminating
% 2.75/168.71 eprover: CPU time limit exceeded, terminating
% 2.75/169.92 eprover: CPU time limit exceeded, terminating
% 2.78/176.12 eprover: CPU time limit exceeded, terminating
% 2.79/177.29 eprover: CPU time limit exceeded, terminating
% 2.91/199.15 eprover: CPU time limit exceeded, terminating
% 2.91/199.67 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 2.91/199.67
% 2.91/199.67 # Failure: Resource limit exceeded (time)
% 2.91/199.67 # OLD status Res
% 2.91/199.67 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 2.91/199.67 # Preprocessing time : 1.295 s
% 2.91/199.67 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 2.91/199.67
% 2.91/199.67 # Failure: Resource limit exceeded (time)
% 2.91/199.67 # OLD status Res
% 2.91/199.67 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 2.91/199.67 # Preprocessing time : 1.962 s
% 2.91/199.67 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 2.91/199.67
% 2.91/199.67 # Failure: Resource limit exceeded (time)
% 2.91/199.67 # OLD status Res
% 2.91/199.67 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 2.91/199.67 # Preprocessing time : 2.083 s
% 2.91/199.67 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 2.91/199.67 # Preprocessing time : 9.213 s
% 2.91/199.67
% 2.91/199.67 # Failure: Out of unprocessed clauses!
% 2.91/199.67 # OLD status GaveUp
% 2.91/199.67 # Parsed axioms : 34434
% 2.91/199.67 # Removed by relevancy pruning/SinE : 0
% 2.91/199.67 # Initial clauses : 103280
% 2.91/199.67 # Removed in clause preprocessing : 9085
% 2.91/199.67 # Initial clauses in saturation : 94195
% 2.91/199.67 # Processed clauses : 16
% 2.91/199.67 # ...of these trivial : 0
% 2.91/199.67 # ...subsumed : 4
% 2.91/199.67 # ...remaining for further processing : 12
% 2.91/199.67 # Other redundant clauses eliminated : 0
% 2.91/199.67 # Clauses deleted for lack of memory : 94179
% 2.91/199.67 # Backward-subsumed : 0
% 2.91/199.67 # Backward-rewritten : 0
% 2.91/199.67 # Generated clauses : 0
% 2.91/199.67 # ...of the previous two non-trivial : 0
% 2.91/199.67 # Contextual simplify-reflections : 0
% 2.91/199.67 # Paramodulations : 0
% 2.91/199.67 # Factorizations : 0
% 2.91/199.67 # Equation resolutions : 0
% 2.91/199.67 # Current number of processed clauses : 12
% 2.91/199.67 # Positive orientable unit clauses : 6
% 2.91/199.67 # Positive unorientable unit clauses: 0
% 2.91/199.67 # Negative unit clauses : 6
% 2.91/199.67 # Non-unit-clauses : 0
% 2.91/199.67 # Current number of unprocessed clauses: 0
% 2.91/199.67 # ...number of literals in the above : 0
% 2.91/199.67 # Current number of archived formulas : 0
% 2.91/199.67 # Current number of archived clauses : 0
% 2.91/199.67 # Clause-clause subsumption calls (NU) : 0
% 2.91/199.67 # Rec. Clause-clause subsumption calls : 0
% 2.91/199.67 # Non-unit clause-clause subsumptions : 0
% 2.91/199.67 # Unit Clause-clause subsumption calls : 2
% 2.91/199.67 # Rewrite failures with RHS unbound : 0
% 2.91/199.67 # BW rewrite match attempts : 0
% 2.91/199.67 # BW rewrite match successes : 0
% 2.91/199.67 # Condensation attempts : 0
% 2.91/199.67 # Condensation successes : 0
% 2.91/199.67 # Termbank termtop insertions : 10340883
% 2.91/199.67
% 2.91/199.67 # -------------------------------------------------
% 2.91/199.67 # User time : 14.044 s
% 2.91/199.67 # System time : 0.285 s
% 2.91/199.67 # Total time : 14.329 s
% 2.91/199.67 # Maximum resident set size: 395564 pages
% 2.91/199.67 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 2.91/199.67
% 2.91/199.67 # Failure: Resource limit exceeded (time)
% 2.91/199.67 # OLD status Res
% 2.91/199.67 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 2.91/199.67 # Preprocessing time : 1.397 s
% 2.91/199.67 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 2.91/199.67 # Preprocessing time : 9.101 s
% 2.91/199.67
% 2.91/199.67 # Failure: Out of unprocessed clauses!
% 2.91/199.67 # OLD status GaveUp
% 2.91/199.67 # Parsed axioms : 34434
% 2.91/199.67 # Removed by relevancy pruning/SinE : 0
% 2.91/199.67 # Initial clauses : 103280
% 2.91/199.67 # Removed in clause preprocessing : 9085
% 2.91/199.67 # Initial clauses in saturation : 94195
% 2.91/199.67 # Processed clauses : 16
% 2.91/199.67 # ...of these trivial : 0
% 2.91/199.67 # ...subsumed : 0
% 2.91/199.67 # ...remaining for further processing : 16
% 2.91/199.67 # Other redundant clauses eliminated : 0
% 2.91/199.67 # Clauses deleted for lack of memory : 94179
% 2.91/199.67 # Backward-subsumed : 0
% 2.91/199.67 # Backward-rewritten : 0
% 2.91/199.67 # Generated clauses : 0
% 2.91/199.67 # ...of the previous two non-trivial : 0
% 2.91/199.67 # Contextual simplify-reflections : 0
% 2.91/199.67 # Paramodulations : 0
% 2.91/199.67 # Factorizations : 0
% 2.91/199.67 # Equation resolutions : 0
% 2.91/199.67 # Current number of processed clauses : 16
% 2.91/199.67 # Positive orientable unit clauses : 4
% 2.91/199.67 # Positive unorientable unit clauses: 0
% 2.91/199.67 # Negative unit clauses : 12
% 2.91/199.67 # Non-unit-clauses : 0
% 2.91/199.67 # Current number of unprocessed clauses: 0
% 2.91/199.67 # ...number of literals in the above : 0
% 2.91/199.67 # Current number of archived formulas : 0
% 2.91/199.67 # Current number of archived clauses : 0
% 2.91/199.67 # Clause-clause subsumption calls (NU) : 0
% 2.91/199.67 # Rec. Clause-clause subsumption calls : 0
% 2.91/199.67 # Non-unit clause-clause subsumptions : 0
% 2.91/199.67 # Unit Clause-clause subsumption calls : 8
% 2.91/199.67 # Rewrite failures with RHS unbound : 0
% 2.91/199.67 # BW rewrite match attempts : 0
% 2.91/199.67 # BW rewrite match successes : 0
% 2.91/199.67 # Condensation attempts : 0
% 2.91/199.67 # Condensation successes : 0
% 2.91/199.67 # Termbank termtop insertions : 10340886
% 2.91/199.67
% 2.91/199.67 # -------------------------------------------------
% 2.91/199.67 # User time : 13.774 s
% 2.91/199.67 # System time : 0.341 s
% 2.91/199.67 # Total time : 14.115 s
% 2.91/199.67 # Maximum resident set size: 549808 pages
% 2.91/199.67 # Running protocol protocol_eprover_e6b386026570787d4ac06e541c4634c5e3f09cc5 for 23 seconds:
% 2.91/199.67
% 2.91/199.67 # Failure: Resource limit exceeded (time)
% 2.91/199.67 # OLD status Res
% 2.91/199.67 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,02,100,1.0)
% 2.91/199.67 # Preprocessing time : 1.279 s
% 2.91/199.67 # Running protocol protocol_eprover_2e85aeff02a0bd3743f362014f6604d7fba54d74 for 23 seconds:
% 2.91/199.67
% 2.91/199.67 # Failure: Resource limit exceeded (time)
% 2.91/199.67 # OLD status Res
% 2.91/199.67 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 2.91/199.67 # Preprocessing time : 1.272 s
% 2.91/199.67 # Running protocol protocol_eprover_334d43c175335e554899225728a5c2ebd420f86b for 23 seconds:
% 2.91/199.67 # Preprocessing time : 9.136 s
% 2.91/199.67
% 2.91/199.67 # Failure: Out of unprocessed clauses!
% 2.91/199.67 # OLD status GaveUp
% 2.91/199.67 # Parsed axioms : 34434
% 2.91/199.67 # Removed by relevancy pruning/SinE : 0
% 2.91/199.67 # Initial clauses : 103280
% 2.91/199.67 # Removed in clause preprocessing : 9085
% 2.91/199.67 # Initial clauses in saturation : 94195
% 2.91/199.67 # Processed clauses : 16
% 2.91/199.67 # ...of these trivial : 1
% 2.91/199.67 # ...subsumed : 0
% 2.91/199.67 # ...remaining for further processing : 15
% 2.91/199.67 # Other redundant clauses eliminated : 0
% 2.91/199.67 # Clauses deleted for lack of memory : 94181
% 2.91/199.67 # Backward-subsumed : 0
% 2.91/199.67 # Backward-rewritten : 0
% 2.91/199.67 # Generated clauses : 2
% 2.91/199.67 # ...of the previous two non-trivial : 2
% 2.91/199.67 # Contextual simplify-reflections : 0
% 2.91/199.67 # Paramodulations : 2
% 2.91/199.67 # Factorizations : 0
% 2.91/199.67 # Equation resolutions : 0
% 2.91/199.67 # Current number of processed clauses : 15
% 2.91/199.67 # Positive orientable unit clauses : 9
% 2.91/199.67 # Positive unorientable unit clauses: 0
% 2.91/199.67 # Negative unit clauses : 3
% 2.91/199.67 # Non-unit-clauses : 3
% 2.91/199.67 # Current number of unprocessed clauses: 0
% 2.91/199.67 # ...number of literals in the above : 0
% 2.91/199.67 # Current number of archived formulas : 0
% 2.91/199.67 # Current number of archived clauses : 0
% 2.91/199.67 # Clause-clause subsumption calls (NU) : 2
% 2.91/199.67 # Rec. Clause-clause subsumption calls : 2
% 2.91/199.67 # Non-unit clause-clause subsumptions : 0
% 2.91/199.67 # Unit Clause-clause subsumption calls : 21
% 2.91/199.67 # Rewrite failures with RHS unbound : 0
% 2.91/199.67 # BW rewrite match attempts : 0
% 2.91/199.67 # BW rewrite match successes : 0
% 2.91/199.67 # Condensation attempts : 0
% 2.91/199.67 # Condensation successes : 0
% 2.91/199.67 # Termbank termtop insertions : 10340959
% 2.91/199.67
% 2.91/199.67 # -------------------------------------------------
% 2.91/199.67 # User time : 14.002 s
% 2.91/199.67 # System time : 0.319 s
% 2.91/199.67 # Total time : 14.321 s
% 2.91/199.67 # Maximum resident set size: 410176 pages
% 2.91/199.67 # Running protocol protocol_eprover_13918ce26d63c8fe682016bfda2032977bcbf85b for 23 seconds:
% 2.91/199.67 # Preprocessing time : 8.700 s
% 2.91/199.67
% 2.91/199.67 # Failure: Out of unprocessed clauses!
% 2.91/199.67 # OLD status GaveUp
% 2.91/199.67 # Parsed axioms : 34434
% 2.91/199.67 # Removed by relevancy pruning/SinE : 0
% 2.91/199.67 # Initial clauses : 103280
% 2.91/199.67 # Removed in clause preprocessing : 9085
% 2.91/199.67 # Initial clauses in saturation : 94195
% 2.91/199.67 # Processed clauses : 16
% 2.91/199.67 # ...of these trivial : 1
% 2.91/199.67 # ...subsumed : 0
% 2.91/199.67 # ...remaining for further processing : 15
% 2.91/199.67 # Other redundant clauses eliminated : 0
% 2.91/199.67 # Clauses deleted for lack of memory : 94182
% 2.91/199.67 # Backward-subsumed : 0
% 2.91/199.67 # Backward-rewritten : 0
% 2.91/199.67 # Generated clauses : 4
% 2.91/199.67 # ...of the previous two non-trivial : 3
% 2.91/199.67 # Contextual simplify-reflections : 0
% 2.91/199.67 # Paramodulations : 4
% 2.91/199.67 # Factorizations : 0
% 2.91/199.67 # Equation resolutions : 0
% 2.91/199.67 # Current number of processed clauses : 15
% 2.91/199.67 # Positive orientable unit clauses : 6
% 2.91/199.67 # Positive unorientable unit clauses: 0
% 2.91/199.67 # Negative unit clauses : 3
% 2.91/199.67 # Non-unit-clauses : 6
% 2.91/199.67 # Current number of unprocessed clauses: 0
% 2.91/199.67 # ...number of literals in the above : 0
% 2.91/199.67 # Current number of archived formulas : 0
% 2.91/199.67 # Current number of archived clauses : 0
% 2.91/199.67 # Clause-clause subsumption calls (NU) : 8
% 2.91/199.67 # Rec. Clause-clause subsumption calls : 4
% 2.91/199.67 # Non-unit clause-clause subsumptions : 0
% 2.91/199.67 # Unit Clause-clause subsumption calls : 9
% 2.91/199.67 # Rewrite failures with RHS unbound : 0
% 2.91/199.67 # BW rewrite match attempts : 0
% 2.91/199.67 # BW rewrite match successes : 0
% 2.91/199.67 # Condensation attempts : 0
% 2.91/199.67 # Condensation successes : 0
% 2.91/199.67 # Termbank termtop insertions : 10341023
% 2.91/199.67
% 2.91/199.67 # -------------------------------------------------
% 2.91/199.67 # User time : 13.536 s
% 2.91/199.67 # System time : 0.297 s
% 2.91/199.67 # Total time : 13.833 s
% 2.91/199.67 # Maximum resident set size: 410252 pages
% 2.91/199.67 # Running protocol protocol_eprover_374255c1532cc4daa30b60038971be8183a2c553 for 23 seconds:
% 2.91/199.67 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,03,100,1.0)
% 2.91/199.67 # Preprocessing time : 1.214 s
% 2.91/199.67
% 2.91/199.67 # Proof found!
% 2.91/199.67 # SZS status Theorem
% 2.91/199.67 # SZS output start CNFRefutation
% See solution above
% 2.91/199.67 # Proof object total steps : 45
% 2.91/199.67 # Proof object clause steps : 30
% 2.91/199.67 # Proof object formula steps : 15
% 2.91/199.67 # Proof object conjectures : 24
% 2.91/199.67 # Proof object clause conjectures : 21
% 2.91/199.67 # Proof object formula conjectures : 3
% 2.91/199.67 # Proof object initial clauses used : 17
% 2.91/199.67 # Proof object initial formulas used : 7
% 2.91/199.67 # Proof object generating inferences : 13
% 2.91/199.67 # Proof object simplifying inferences : 52
% 2.91/199.67 # Training examples: 0 positive, 0 negative
% 2.91/199.67 # Parsed axioms : 34434
% 2.91/199.67 # Removed by relevancy pruning/SinE : 34333
% 2.91/199.67 # Initial clauses : 274
% 2.91/199.67 # Removed in clause preprocessing : 4
% 2.91/199.67 # Initial clauses in saturation : 270
% 2.91/199.67 # Processed clauses : 2574
% 2.91/199.67 # ...of these trivial : 42
% 2.91/199.67 # ...subsumed : 129
% 2.91/199.67 # ...remaining for further processing : 2402
% 2.91/199.67 # Other redundant clauses eliminated : 6
% 2.91/199.67 # Clauses deleted for lack of memory : 0
% 2.91/199.67 # Backward-subsumed : 21
% 2.91/199.67 # Backward-rewritten : 47
% 2.91/199.67 # Generated clauses : 18165
% 2.91/199.67 # ...of the previous two non-trivial : 17597
% 2.91/199.67 # Contextual simplify-reflections : 0
% 2.91/199.67 # Paramodulations : 18139
% 2.91/199.67 # Factorizations : 0
% 2.91/199.67 # Equation resolutions : 26
% 2.91/199.67 # Current number of processed clauses : 2328
% 2.91/199.67 # Positive orientable unit clauses : 346
% 2.91/199.67 # Positive unorientable unit clauses: 0
% 2.91/199.67 # Negative unit clauses : 5
% 2.91/199.67 # Non-unit-clauses : 1977
% 2.91/199.67 # Current number of unprocessed clauses: 15017
% 2.91/199.67 # ...number of literals in the above : 72237
% 2.91/199.67 # Current number of archived formulas : 0
% 2.91/199.67 # Current number of archived clauses : 68
% 2.91/199.67 # Clause-clause subsumption calls (NU) : 66382
% 2.91/199.67 # Rec. Clause-clause subsumption calls : 17187
% 2.91/199.67 # Non-unit clause-clause subsumptions : 150
% 2.91/199.67 # Unit Clause-clause subsumption calls : 13479
% 2.91/199.67 # Rewrite failures with RHS unbound : 0
% 2.91/199.67 # BW rewrite match attempts : 777
% 2.91/199.67 # BW rewrite match successes : 8
% 2.91/199.67 # Condensation attempts : 0
% 2.91/199.67 # Condensation successes : 0
% 2.91/199.67 # Termbank termtop insertions : 1470886
% 2.91/199.67
% 2.91/199.67 # -------------------------------------------------
% 2.91/199.67 # User time : 1.795 s
% 2.91/199.67 # System time : 0.048 s
% 2.91/199.67 # Total time : 1.843 s
% 2.91/199.67 # Maximum resident set size: 101624 pages
% 2.91/207.20 eprover: CPU time limit exceeded, terminating
% 2.91/207.22 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.91/207.22 eprover: No such file or directory
% 2.91/212.89 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.91/212.89 eprover: No such file or directory
% 2.91/212.89 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.91/212.89 eprover: No such file or directory
% 2.91/214.69 eprover: CPU time limit exceeded, terminating
% 2.91/214.72 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 2.91/214.72 eprover: No such file or directory
%------------------------------------------------------------------------------