TSTP Solution File: SEU048+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU048+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:16:35 EDT 2022
% Result : Theorem 0.65s 90.83s
% Output : CNFRefutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 6 unt; 0 def)
% Number of atoms : 284 ( 44 equ)
% Maximal formula atoms : 79 ( 6 avg)
% Number of connectives : 420 ( 178 ~; 200 |; 28 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 77 ( 7 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t99_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( one_to_one(X2)
=> one_to_one(relation_rng_restriction(X1,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t99_funct_1) ).
fof(t85_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( X2 = relation_rng_restriction(X1,X3)
<=> ( ! [X4] :
( in(X4,relation_dom(X2))
<=> ( in(X4,relation_dom(X3))
& in(apply(X3,X4),X1) ) )
& ! [X4] :
( in(X4,relation_dom(X2))
=> apply(X2,X4) = apply(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t85_funct_1) ).
fof(d8_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
<=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
& in(X3,relation_dom(X1))
& apply(X1,X2) = apply(X1,X3) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d8_funct_1) ).
fof(fc5_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( relation(relation_rng_restriction(X1,X2))
& function(relation_rng_restriction(X1,X2)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc5_funct_1) ).
fof(dt_k8_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> relation(relation_rng_restriction(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k8_relat_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( one_to_one(X2)
=> one_to_one(relation_rng_restriction(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[t99_funct_1]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X8,X8,X9] :
( ( in(X8,relation_dom(X7))
| ~ in(X8,relation_dom(X6))
| X6 != relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( in(apply(X7,X8),X5)
| ~ in(X8,relation_dom(X6))
| X6 != relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( ~ in(X8,relation_dom(X7))
| ~ in(apply(X7,X8),X5)
| in(X8,relation_dom(X6))
| X6 != relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( ~ in(X9,relation_dom(X6))
| apply(X6,X9) = apply(X7,X9)
| X6 != relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( in(esk15_3(X5,X6,X7),relation_dom(X6))
| ~ in(esk14_3(X5,X6,X7),relation_dom(X6))
| ~ in(esk14_3(X5,X6,X7),relation_dom(X7))
| ~ in(apply(X7,esk14_3(X5,X6,X7)),X5)
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( apply(X6,esk15_3(X5,X6,X7)) != apply(X7,esk15_3(X5,X6,X7))
| ~ in(esk14_3(X5,X6,X7),relation_dom(X6))
| ~ in(esk14_3(X5,X6,X7),relation_dom(X7))
| ~ in(apply(X7,esk14_3(X5,X6,X7)),X5)
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( in(esk15_3(X5,X6,X7),relation_dom(X6))
| in(esk14_3(X5,X6,X7),relation_dom(X7))
| in(esk14_3(X5,X6,X7),relation_dom(X6))
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( apply(X6,esk15_3(X5,X6,X7)) != apply(X7,esk15_3(X5,X6,X7))
| in(esk14_3(X5,X6,X7),relation_dom(X7))
| in(esk14_3(X5,X6,X7),relation_dom(X6))
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( in(esk15_3(X5,X6,X7),relation_dom(X6))
| in(apply(X7,esk14_3(X5,X6,X7)),X5)
| in(esk14_3(X5,X6,X7),relation_dom(X6))
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(X6) )
& ( apply(X6,esk15_3(X5,X6,X7)) != apply(X7,esk15_3(X5,X6,X7))
| in(apply(X7,esk14_3(X5,X6,X7)),X5)
| in(esk14_3(X5,X6,X7),relation_dom(X6))
| X6 = relation_rng_restriction(X5,X7)
| ~ relation(X7)
| ~ function(X7)
| ~ relation(X6)
| ~ function(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)],[t85_funct_1])])])])])])]) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ( ~ one_to_one(X4)
| ~ in(X5,relation_dom(X4))
| ~ in(X6,relation_dom(X4))
| apply(X4,X5) != apply(X4,X6)
| X5 = X6
| ~ relation(X4)
| ~ function(X4) )
& ( in(esk1_1(X4),relation_dom(X4))
| one_to_one(X4)
| ~ relation(X4)
| ~ function(X4) )
& ( in(esk2_1(X4),relation_dom(X4))
| one_to_one(X4)
| ~ relation(X4)
| ~ function(X4) )
& ( apply(X4,esk1_1(X4)) = apply(X4,esk2_1(X4))
| one_to_one(X4)
| ~ relation(X4)
| ~ function(X4) )
& ( esk1_1(X4) != esk2_1(X4)
| one_to_one(X4)
| ~ relation(X4)
| ~ function(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)],[d8_funct_1])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( relation(esk17_0)
& function(esk17_0)
& one_to_one(esk17_0)
& ~ one_to_one(relation_rng_restriction(esk16_0,esk17_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( apply(X1,X4) = apply(X2,X4)
| ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| X1 != relation_rng_restriction(X3,X2)
| ~ in(X4,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X2 = X3
| ~ function(X1)
| ~ relation(X1)
| apply(X1,X2) != apply(X1,X3)
| ~ in(X3,relation_dom(X1))
| ~ in(X2,relation_dom(X1))
| ~ one_to_one(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
one_to_one(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
relation(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
function(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( one_to_one(X1)
| apply(X1,esk1_1(X1)) = apply(X1,esk2_1(X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( apply(relation_rng_restriction(X1,X2),X3) = apply(X2,X3)
| ~ relation(relation_rng_restriction(X1,X2))
| ~ relation(X2)
| ~ function(relation_rng_restriction(X1,X2))
| ~ function(X2)
| ~ in(X3,relation_dom(relation_rng_restriction(X1,X2))) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| apply(esk17_0,X1) != apply(esk17_0,X2)
| ~ in(X2,relation_dom(esk17_0))
| ~ in(X1,relation_dom(esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_17,plain,
( apply(X1,esk2_1(relation_rng_restriction(X2,X1))) = apply(relation_rng_restriction(X2,X1),esk1_1(relation_rng_restriction(X2,X1)))
| one_to_one(relation_rng_restriction(X2,X1))
| ~ relation(relation_rng_restriction(X2,X1))
| ~ relation(X1)
| ~ function(relation_rng_restriction(X2,X1))
| ~ function(X1)
| ~ in(esk2_1(relation_rng_restriction(X2,X1)),relation_dom(relation_rng_restriction(X2,X1))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( in(X4,relation_dom(X2))
| ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| X1 != relation_rng_restriction(X3,X2)
| ~ in(X4,relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
( esk2_1(relation_rng_restriction(X1,esk17_0)) = X2
| one_to_one(relation_rng_restriction(X1,esk17_0))
| apply(relation_rng_restriction(X1,esk17_0),esk1_1(relation_rng_restriction(X1,esk17_0))) != apply(esk17_0,X2)
| ~ relation(relation_rng_restriction(X1,esk17_0))
| ~ function(relation_rng_restriction(X1,esk17_0))
| ~ in(esk2_1(relation_rng_restriction(X1,esk17_0)),relation_dom(relation_rng_restriction(X1,esk17_0)))
| ~ in(esk2_1(relation_rng_restriction(X1,esk17_0)),relation_dom(esk17_0))
| ~ in(X2,relation_dom(esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12]),c_0_13])]) ).
cnf(c_0_21,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X2))
| X1 != relation_rng_restriction(X3,X2)
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X2)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( esk2_1(relation_rng_restriction(X1,esk17_0)) = X2
| one_to_one(relation_rng_restriction(X1,esk17_0))
| apply(relation_rng_restriction(X1,esk17_0),esk1_1(relation_rng_restriction(X1,esk17_0))) != apply(esk17_0,X2)
| ~ relation(relation_rng_restriction(X1,esk17_0))
| ~ function(relation_rng_restriction(X1,esk17_0))
| ~ in(esk2_1(relation_rng_restriction(X1,esk17_0)),relation_dom(esk17_0))
| ~ in(X2,relation_dom(esk17_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_23,plain,
( one_to_one(relation_rng_restriction(X1,X2))
| in(esk2_1(relation_rng_restriction(X1,X2)),relation_dom(X2))
| ~ relation(relation_rng_restriction(X1,X2))
| ~ relation(X2)
| ~ function(relation_rng_restriction(X1,X2))
| ~ function(X2) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( esk2_1(relation_rng_restriction(X1,esk17_0)) = X2
| one_to_one(relation_rng_restriction(X1,esk17_0))
| apply(relation_rng_restriction(X1,esk17_0),esk1_1(relation_rng_restriction(X1,esk17_0))) != apply(esk17_0,X2)
| ~ relation(relation_rng_restriction(X1,esk17_0))
| ~ function(relation_rng_restriction(X1,esk17_0))
| ~ in(X2,relation_dom(esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12]),c_0_13])]) ).
cnf(c_0_25,negated_conjecture,
( esk2_1(relation_rng_restriction(X1,esk17_0)) = X2
| one_to_one(relation_rng_restriction(X1,esk17_0))
| apply(esk17_0,esk1_1(relation_rng_restriction(X1,esk17_0))) != apply(esk17_0,X2)
| ~ relation(relation_rng_restriction(X1,esk17_0))
| ~ function(relation_rng_restriction(X1,esk17_0))
| ~ in(esk1_1(relation_rng_restriction(X1,esk17_0)),relation_dom(relation_rng_restriction(X1,esk17_0)))
| ~ in(X2,relation_dom(esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_12]),c_0_13])]) ).
cnf(c_0_26,plain,
( one_to_one(X1)
| ~ function(X1)
| ~ relation(X1)
| esk1_1(X1) != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
( esk2_1(relation_rng_restriction(X1,esk17_0)) = esk1_1(relation_rng_restriction(X1,esk17_0))
| one_to_one(relation_rng_restriction(X1,esk17_0))
| ~ relation(relation_rng_restriction(X1,esk17_0))
| ~ function(relation_rng_restriction(X1,esk17_0))
| ~ in(esk1_1(relation_rng_restriction(X1,esk17_0)),relation_dom(relation_rng_restriction(X1,esk17_0)))
| ~ in(esk1_1(relation_rng_restriction(X1,esk17_0)),relation_dom(esk17_0)) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
( one_to_one(X1)
| in(esk1_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,negated_conjecture,
( one_to_one(relation_rng_restriction(X1,esk17_0))
| ~ relation(relation_rng_restriction(X1,esk17_0))
| ~ function(relation_rng_restriction(X1,esk17_0))
| ~ in(esk1_1(relation_rng_restriction(X1,esk17_0)),relation_dom(relation_rng_restriction(X1,esk17_0)))
| ~ in(esk1_1(relation_rng_restriction(X1,esk17_0)),relation_dom(esk17_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( one_to_one(X1)
| in(esk1_1(X1),relation_dom(X2))
| X1 != relation_rng_restriction(X3,X2)
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X2)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( one_to_one(relation_rng_restriction(X1,esk17_0))
| ~ relation(relation_rng_restriction(X1,esk17_0))
| ~ function(relation_rng_restriction(X1,esk17_0))
| ~ in(esk1_1(relation_rng_restriction(X1,esk17_0)),relation_dom(esk17_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_32,plain,
( one_to_one(relation_rng_restriction(X1,X2))
| in(esk1_1(relation_rng_restriction(X1,X2)),relation_dom(X2))
| ~ relation(relation_rng_restriction(X1,X2))
| ~ relation(X2)
| ~ function(relation_rng_restriction(X1,X2))
| ~ function(X2) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ one_to_one(relation_rng_restriction(esk16_0,esk17_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
( one_to_one(relation_rng_restriction(X1,esk17_0))
| ~ relation(relation_rng_restriction(X1,esk17_0))
| ~ function(relation_rng_restriction(X1,esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_12]),c_0_13])]) ).
fof(c_0_35,plain,
! [X3,X4] :
( ( relation(relation_rng_restriction(X3,X4))
| ~ relation(X4)
| ~ function(X4) )
& ( function(relation_rng_restriction(X3,X4))
| ~ relation(X4)
| ~ function(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc5_funct_1])])]) ).
cnf(c_0_36,negated_conjecture,
( ~ relation(relation_rng_restriction(esk16_0,esk17_0))
| ~ function(relation_rng_restriction(esk16_0,esk17_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( function(relation_rng_restriction(X2,X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_38,plain,
! [X3,X4] :
( ~ relation(X4)
| relation(relation_rng_restriction(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relat_1])]) ).
cnf(c_0_39,negated_conjecture,
~ relation(relation_rng_restriction(esk16_0,esk17_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_12]),c_0_13])]) ).
cnf(c_0_40,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU048+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n029.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 : Sun Jun 19 07:56:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.32/23.40 eprover: CPU time limit exceeded, terminating
% 0.32/23.40 eprover: CPU time limit exceeded, terminating
% 0.32/23.40 eprover: CPU time limit exceeded, terminating
% 0.32/23.41 eprover: CPU time limit exceeded, terminating
% 0.43/46.43 eprover: CPU time limit exceeded, terminating
% 0.43/46.44 eprover: CPU time limit exceeded, terminating
% 0.43/46.44 eprover: CPU time limit exceeded, terminating
% 0.43/46.46 eprover: CPU time limit exceeded, terminating
% 0.55/69.46 eprover: CPU time limit exceeded, terminating
% 0.55/69.47 eprover: CPU time limit exceeded, terminating
% 0.55/69.49 eprover: CPU time limit exceeded, terminating
% 0.62/85.12 eprover: CPU time limit exceeded, terminating
% 0.65/90.83 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.65/90.83 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.65/90.83 # Preprocessing time : 0.015 s
% 0.65/90.83
% 0.65/90.83 # Failure: Out of unprocessed clauses!
% 0.65/90.83 # OLD status GaveUp
% 0.65/90.83 # Parsed axioms : 35
% 0.65/90.83 # Removed by relevancy pruning/SinE : 21
% 0.65/90.83 # Initial clauses : 27
% 0.65/90.83 # Removed in clause preprocessing : 2
% 0.65/90.83 # Initial clauses in saturation : 25
% 0.65/90.83 # Processed clauses : 35
% 0.65/90.83 # ...of these trivial : 0
% 0.65/90.83 # ...subsumed : 3
% 0.65/90.83 # ...remaining for further processing : 32
% 0.65/90.83 # Other redundant clauses eliminated : 0
% 0.65/90.83 # Clauses deleted for lack of memory : 0
% 0.65/90.83 # Backward-subsumed : 0
% 0.65/90.83 # Backward-rewritten : 7
% 0.65/90.83 # Generated clauses : 10
% 0.65/90.83 # ...of the previous two non-trivial : 11
% 0.65/90.83 # Contextual simplify-reflections : 3
% 0.65/90.83 # Paramodulations : 10
% 0.65/90.83 # Factorizations : 0
% 0.65/90.83 # Equation resolutions : 0
% 0.65/90.83 # Current number of processed clauses : 25
% 0.65/90.83 # Positive orientable unit clauses : 14
% 0.65/90.83 # Positive unorientable unit clauses: 0
% 0.65/90.83 # Negative unit clauses : 4
% 0.65/90.83 # Non-unit-clauses : 7
% 0.65/90.83 # Current number of unprocessed clauses: 0
% 0.65/90.83 # ...number of literals in the above : 0
% 0.65/90.83 # Current number of archived formulas : 0
% 0.65/90.83 # Current number of archived clauses : 7
% 0.65/90.83 # Clause-clause subsumption calls (NU) : 12
% 0.65/90.83 # Rec. Clause-clause subsumption calls : 12
% 0.65/90.83 # Non-unit clause-clause subsumptions : 6
% 0.65/90.83 # Unit Clause-clause subsumption calls : 2
% 0.65/90.83 # Rewrite failures with RHS unbound : 0
% 0.65/90.83 # BW rewrite match attempts : 2
% 0.65/90.83 # BW rewrite match successes : 2
% 0.65/90.83 # Condensation attempts : 0
% 0.65/90.83 # Condensation successes : 0
% 0.65/90.83 # Termbank termtop insertions : 1184
% 0.65/90.83
% 0.65/90.83 # -------------------------------------------------
% 0.65/90.83 # User time : 0.013 s
% 0.65/90.83 # System time : 0.003 s
% 0.65/90.83 # Total time : 0.016 s
% 0.65/90.83 # Maximum resident set size: 2696 pages
% 0.65/90.83 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.65/90.83
% 0.65/90.83 # Failure: Resource limit exceeded (time)
% 0.65/90.83 # OLD status Res
% 0.65/90.83 # Preprocessing time : 0.017 s
% 0.65/90.83 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.65/90.83
% 0.65/90.83 # Failure: Resource limit exceeded (time)
% 0.65/90.83 # OLD status Res
% 0.65/90.83 # Preprocessing time : 0.009 s
% 0.65/90.83 # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 0.65/90.83 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 0.65/90.83 # Preprocessing time : 0.008 s
% 0.65/90.83
% 0.65/90.83 # Failure: Out of unprocessed clauses!
% 0.65/90.83 # OLD status GaveUp
% 0.65/90.83 # Parsed axioms : 35
% 0.65/90.83 # Removed by relevancy pruning/SinE : 21
% 0.65/90.83 # Initial clauses : 27
% 0.65/90.83 # Removed in clause preprocessing : 2
% 0.65/90.83 # Initial clauses in saturation : 25
% 0.65/90.83 # Processed clauses : 36
% 0.65/90.83 # ...of these trivial : 0
% 0.65/90.83 # ...subsumed : 3
% 0.65/90.83 # ...remaining for further processing : 33
% 0.65/90.83 # Other redundant clauses eliminated : 0
% 0.65/90.83 # Clauses deleted for lack of memory : 0
% 0.65/90.83 # Backward-subsumed : 0
% 0.65/90.83 # Backward-rewritten : 8
% 0.65/90.83 # Generated clauses : 13
% 0.65/90.83 # ...of the previous two non-trivial : 15
% 0.65/90.83 # Contextual simplify-reflections : 3
% 0.65/90.83 # Paramodulations : 13
% 0.65/90.83 # Factorizations : 0
% 0.65/90.83 # Equation resolutions : 0
% 0.65/90.83 # Current number of processed clauses : 25
% 0.65/90.83 # Positive orientable unit clauses : 14
% 0.65/90.83 # Positive unorientable unit clauses: 0
% 0.65/90.83 # Negative unit clauses : 4
% 0.65/90.83 # Non-unit-clauses : 7
% 0.65/90.83 # Current number of unprocessed clauses: 0
% 0.65/90.83 # ...number of literals in the above : 0
% 0.65/90.83 # Current number of archived formulas : 0
% 0.65/90.83 # Current number of archived clauses : 8
% 0.65/90.83 # Clause-clause subsumption calls (NU) : 12
% 0.65/90.83 # Rec. Clause-clause subsumption calls : 12
% 0.65/90.83 # Non-unit clause-clause subsumptions : 6
% 0.65/90.83 # Unit Clause-clause subsumption calls : 2
% 0.65/90.83 # Rewrite failures with RHS unbound : 0
% 0.65/90.83 # BW rewrite match attempts : 2
% 0.65/90.83 # BW rewrite match successes : 2
% 0.65/90.83 # Condensation attempts : 0
% 0.65/90.83 # Condensation successes : 0
% 0.65/90.83 # Termbank termtop insertions : 1199
% 0.65/90.83
% 0.65/90.83 # -------------------------------------------------
% 0.65/90.83 # User time : 0.007 s
% 0.65/90.83 # System time : 0.001 s
% 0.65/90.83 # Total time : 0.008 s
% 0.65/90.83 # Maximum resident set size: 2700 pages
% 0.65/90.83 # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 0.65/90.83 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 0.65/90.83 # Preprocessing time : 0.008 s
% 0.65/90.83
% 0.65/90.83 # Failure: Out of unprocessed clauses!
% 0.65/90.83 # OLD status GaveUp
% 0.65/90.83 # Parsed axioms : 35
% 0.65/90.83 # Removed by relevancy pruning/SinE : 21
% 0.65/90.83 # Initial clauses : 27
% 0.65/90.83 # Removed in clause preprocessing : 2
% 0.65/90.83 # Initial clauses in saturation : 25
% 0.65/90.83 # Processed clauses : 3473
% 0.65/90.83 # ...of these trivial : 2
% 0.65/90.83 # ...subsumed : 5
% 0.65/90.83 # ...remaining for further processing : 3466
% 0.65/90.83 # Other redundant clauses eliminated : 0
% 0.65/90.83 # Clauses deleted for lack of memory : 5093
% 0.65/90.83 # Backward-subsumed : 1
% 0.65/90.83 # Backward-rewritten : 56
% 0.65/90.83 # Generated clauses : 8613
% 0.65/90.83 # ...of the previous two non-trivial : 8616
% 0.65/90.83 # Contextual simplify-reflections : 0
% 0.65/90.83 # Paramodulations : 8613
% 0.65/90.83 # Factorizations : 0
% 0.65/90.83 # Equation resolutions : 0
% 0.65/90.83 # Current number of processed clauses : 3409
% 0.65/90.83 # Positive orientable unit clauses : 3157
% 0.65/90.83 # Positive unorientable unit clauses: 0
% 0.65/90.83 # Negative unit clauses : 3
% 0.65/90.83 # Non-unit-clauses : 249
% 0.65/90.83 # Current number of unprocessed clauses: 0
% 0.65/90.83 # ...number of literals in the above : 0
% 0.65/90.83 # Current number of archived formulas : 0
% 0.65/90.83 # Current number of archived clauses : 57
% 0.65/90.83 # Clause-clause subsumption calls (NU) : 5791
% 0.65/90.83 # Rec. Clause-clause subsumption calls : 5789
% 0.65/90.83 # Non-unit clause-clause subsumptions : 5
% 0.65/90.83 # Unit Clause-clause subsumption calls : 4
% 0.65/90.83 # Rewrite failures with RHS unbound : 0
% 0.65/90.83 # BW rewrite match attempts : 4044827
% 0.65/90.83 # BW rewrite match successes : 3
% 0.65/90.83 # Condensation attempts : 0
% 0.65/90.83 # Condensation successes : 0
% 0.65/90.83 # Termbank termtop insertions : 6527140
% 0.65/90.83
% 0.65/90.83 # -------------------------------------------------
% 0.65/90.83 # User time : 15.361 s
% 0.65/90.83 # System time : 0.241 s
% 0.65/90.83 # Total time : 15.602 s
% 0.65/90.83 # Maximum resident set size: 355140 pages
% 0.65/90.83 # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 0.65/90.83 # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 0.65/90.83 # Preprocessing time : 0.008 s
% 0.65/90.83
% 0.65/90.83 # Failure: Out of unprocessed clauses!
% 0.65/90.83 # OLD status GaveUp
% 0.65/90.83 # Parsed axioms : 35
% 0.65/90.83 # Removed by relevancy pruning/SinE : 21
% 0.65/90.83 # Initial clauses : 27
% 0.65/90.83 # Removed in clause preprocessing : 2
% 0.65/90.83 # Initial clauses in saturation : 25
% 0.65/90.83 # Processed clauses : 36
% 0.65/90.83 # ...of these trivial : 0
% 0.65/90.83 # ...subsumed : 3
% 0.65/90.83 # ...remaining for further processing : 33
% 0.65/90.83 # Other redundant clauses eliminated : 0
% 0.65/90.83 # Clauses deleted for lack of memory : 0
% 0.65/90.83 # Backward-subsumed : 1
% 0.65/90.83 # Backward-rewritten : 7
% 0.65/90.83 # Generated clauses : 15
% 0.65/90.83 # ...of the previous two non-trivial : 16
% 0.65/90.83 # Contextual simplify-reflections : 0
% 0.65/90.83 # Paramodulations : 15
% 0.65/90.83 # Factorizations : 0
% 0.65/90.83 # Equation resolutions : 0
% 0.65/90.83 # Current number of processed clauses : 25
% 0.65/90.83 # Positive orientable unit clauses : 14
% 0.65/90.83 # Positive unorientable unit clauses: 0
% 0.65/90.83 # Negative unit clauses : 3
% 0.65/90.83 # Non-unit-clauses : 8
% 0.65/90.83 # Current number of unprocessed clauses: 0
% 0.65/90.83 # ...number of literals in the above : 0
% 0.65/90.83 # Current number of archived formulas : 0
% 0.65/90.83 # Current number of archived clauses : 8
% 0.65/90.83 # Clause-clause subsumption calls (NU) : 12
% 0.65/90.83 # Rec. Clause-clause subsumption calls : 10
% 0.65/90.83 # Non-unit clause-clause subsumptions : 4
% 0.65/90.83 # Unit Clause-clause subsumption calls : 3
% 0.65/90.83 # Rewrite failures with RHS unbound : 0
% 0.65/90.83 # BW rewrite match attempts : 2
% 0.65/90.83 # BW rewrite match successes : 2
% 0.65/90.83 # Condensation attempts : 0
% 0.65/90.83 # Condensation successes : 0
% 0.65/90.83 # Termbank termtop insertions : 1232
% 0.65/90.83
% 0.65/90.83 # -------------------------------------------------
% 0.65/90.83 # User time : 0.007 s
% 0.65/90.83 # System time : 0.002 s
% 0.65/90.83 # Total time : 0.009 s
% 0.65/90.83 # Maximum resident set size: 2964 pages
% 0.65/90.83 # Running protocol protocol_eprover_b1d72019af42f5b571a6c0b233a5b6d1de064075 for 23 seconds:
% 0.65/90.83 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,500,1.0)
% 0.65/90.83 # Preprocessing time : 0.008 s
% 0.65/90.83
% 0.65/90.83 # Failure: Out of unprocessed clauses!
% 0.65/90.83 # OLD status GaveUp
% 0.65/90.83 # Parsed axioms : 35
% 0.65/90.83 # Removed by relevancy pruning/SinE : 21
% 0.65/90.83 # Initial clauses : 27
% 0.65/90.83 # Removed in clause preprocessing : 2
% 0.65/90.83 # Initial clauses in saturation : 25
% 0.65/90.83 # Processed clauses : 32
% 0.65/90.83 # ...of these trivial : 0
% 0.65/90.83 # ...subsumed : 2
% 0.65/90.83 # ...remaining for further processing : 30
% 0.65/90.83 # Other redundant clauses eliminated : 0
% 0.65/90.83 # Clauses deleted for lack of memory : 0
% 0.65/90.83 # Backward-subsumed : 0
% 0.65/90.83 # Backward-rewritten : 5
% 0.65/90.83 # Generated clauses : 7
% 0.65/90.83 # ...of the previous two non-trivial : 9
% 0.65/90.83 # Contextual simplify-reflections : 3
% 0.65/90.83 # Paramodulations : 7
% 0.65/90.83 # Factorizations : 0
% 0.65/90.83 # Equation resolutions : 0
% 0.65/90.83 # Current number of processed clauses : 25
% 0.65/90.83 # Positive orientable unit clauses : 14
% 0.65/90.83 # Positive unorientable unit clauses: 0
% 0.65/90.83 # Negative unit clauses : 4
% 0.65/90.83 # Non-unit-clauses : 7
% 0.65/90.83 # Current number of unprocessed clauses: 0
% 0.65/90.83 # ...number of literals in the above : 0
% 0.65/90.83 # Current number of archived formulas : 0
% 0.65/90.83 # Current number of archived clauses : 5
% 0.65/90.83 # Clause-clause subsumption calls (NU) : 11
% 0.65/90.83 # Rec. Clause-clause subsumption calls : 11
% 0.65/90.83 # Non-unit clause-clause subsumptions : 5
% 0.65/90.83 # Unit Clause-clause subsumption calls : 2
% 0.65/90.83 # Rewrite failures with RHS unbound : 0
% 0.65/90.83 # BW rewrite match attempts : 2
% 0.65/90.83 # BW rewrite match successes : 2
% 0.65/90.83 # Condensation attempts : 0
% 0.65/90.83 # Condensation successes : 0
% 0.65/90.83 # Termbank termtop insertions : 1160
% 0.65/90.83
% 0.65/90.83 # -------------------------------------------------
% 0.65/90.83 # User time : 0.007 s
% 0.65/90.83 # System time : 0.001 s
% 0.65/90.83 # Total time : 0.008 s
% 0.65/90.83 # Maximum resident set size: 2700 pages
% 0.65/90.83 # Running protocol protocol_eprover_e96ef4641ae500918cdd95fcfce21e29f2ac5eec for 23 seconds:
% 0.65/90.83
% 0.65/90.83 # Failure: Resource limit exceeded (time)
% 0.65/90.83 # OLD status Res
% 0.65/90.83 # SinE strategy is GSinE(CountFormulas,,6.0,,03,100,1.0)
% 0.65/90.83 # Preprocessing time : 0.009 s
% 0.65/90.83 # Running protocol protocol_eprover_1f734394cb6ce69b36c9826f6782d3567d6ecd6c for 23 seconds:
% 0.65/90.83 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,20000,1.0)
% 0.65/90.83 # Preprocessing time : 0.008 s
% 0.65/90.83
% 0.65/90.83 # Failure: Out of unprocessed clauses!
% 0.65/90.83 # OLD status GaveUp
% 0.65/90.83 # Parsed axioms : 35
% 0.65/90.83 # Removed by relevancy pruning/SinE : 21
% 0.65/90.83 # Initial clauses : 27
% 0.65/90.83 # Removed in clause preprocessing : 2
% 0.65/90.83 # Initial clauses in saturation : 25
% 0.65/90.83 # Processed clauses : 36
% 0.65/90.83 # ...of these trivial : 0
% 0.65/90.83 # ...subsumed : 3
% 0.65/90.83 # ...remaining for further processing : 33
% 0.65/90.83 # Other redundant clauses eliminated : 0
% 0.65/90.83 # Clauses deleted for lack of memory : 0
% 0.65/90.83 # Backward-subsumed : 1
% 0.65/90.83 # Backward-rewritten : 7
% 0.65/90.83 # Generated clauses : 12
% 0.65/90.83 # ...of the previous two non-trivial : 13
% 0.65/90.83 # Contextual simplify-reflections : 0
% 0.65/90.83 # Paramodulations : 12
% 0.65/90.83 # Factorizations : 0
% 0.65/90.83 # Equation resolutions : 0
% 0.65/90.83 # Current number of processed clauses : 25
% 0.65/90.83 # Positive orientable unit clauses : 14
% 0.65/90.83 # Positive unorientable unit clauses: 0
% 0.65/90.83 # Negative unit clauses : 3
% 0.65/90.83 # Non-unit-clauses : 8
% 0.65/90.83 # Current number of unprocessed clauses: 0
% 0.65/90.83 # ...number of literals in the above : 0
% 0.65/90.83 # Current number of archived formulas : 0
% 0.65/90.83 # Current number of archived clauses : 8
% 0.65/90.83 # Clause-clause subsumption calls (NU) : 12
% 0.65/90.83 # Rec. Clause-clause subsumption calls : 10
% 0.65/90.83 # Non-unit clause-clause subsumptions : 4
% 0.65/90.83 # Unit Clause-clause subsumption calls : 2
% 0.65/90.83 # Rewrite failures with RHS unbound : 0
% 0.65/90.83 # BW rewrite match attempts : 2
% 0.65/90.83 # BW rewrite match successes : 2
% 0.65/90.83 # Condensation attempts : 0
% 0.65/90.83 # Condensation successes : 0
% 0.65/90.83 # Termbank termtop insertions : 1220
% 0.65/90.83
% 0.65/90.83 # -------------------------------------------------
% 0.65/90.83 # User time : 0.007 s
% 0.65/90.83 # System time : 0.001 s
% 0.65/90.83 # Total time : 0.009 s
% 0.65/90.83 # Maximum resident set size: 2732 pages
% 0.65/90.83 # Running protocol protocol_eprover_e9eb28a402764e1f99b41605245cd0a359f475fb for 23 seconds:
% 0.65/90.83 # Preprocessing time : 0.009 s
% 0.65/90.83
% 0.65/90.83 # Proof found!
% 0.65/90.83 # SZS status Theorem
% 0.65/90.83 # SZS output start CNFRefutation
% See solution above
% 0.65/90.83 # Proof object total steps : 42
% 0.65/90.83 # Proof object clause steps : 31
% 0.65/90.83 # Proof object formula steps : 11
% 0.65/90.83 # Proof object conjectures : 19
% 0.65/90.83 # Proof object clause conjectures : 16
% 0.65/90.83 # Proof object formula conjectures : 3
% 0.65/90.83 # Proof object initial clauses used : 13
% 0.65/90.83 # Proof object initial formulas used : 5
% 0.65/90.83 # Proof object generating inferences : 18
% 0.65/90.83 # Proof object simplifying inferences : 20
% 0.65/90.83 # Training examples: 0 positive, 0 negative
% 0.65/90.83 # Parsed axioms : 35
% 0.65/90.83 # Removed by relevancy pruning/SinE : 0
% 0.65/90.83 # Initial clauses : 69
% 0.65/90.83 # Removed in clause preprocessing : 2
% 0.65/90.83 # Initial clauses in saturation : 67
% 0.65/90.83 # Processed clauses : 10296
% 0.65/90.83 # ...of these trivial : 196
% 0.65/90.83 # ...subsumed : 8121
% 0.65/90.83 # ...remaining for further processing : 1979
% 0.65/90.83 # Other redundant clauses eliminated : 1119
% 0.65/90.83 # Clauses deleted for lack of memory : 101810
% 0.65/90.83 # Backward-subsumed : 192
% 0.65/90.83 # Backward-rewritten : 262
% 0.65/90.83 # Generated clauses : 202406
% 0.65/90.83 # ...of the previous two non-trivial : 183116
% 0.65/90.83 # Contextual simplify-reflections : 0
% 0.65/90.83 # Paramodulations : 200485
% 0.65/90.83 # Factorizations : 0
% 0.65/90.83 # Equation resolutions : 1234
% 0.65/90.83 # Current number of processed clauses : 1296
% 0.65/90.83 # Positive orientable unit clauses : 257
% 0.65/90.83 # Positive unorientable unit clauses: 0
% 0.65/90.83 # Negative unit clauses : 242
% 0.65/90.83 # Non-unit-clauses : 797
% 0.65/90.83 # Current number of unprocessed clauses: 51154
% 0.65/90.83 # ...number of literals in the above : 657091
% 0.65/90.83 # Current number of archived formulas : 0
% 0.65/90.83 # Current number of archived clauses : 454
% 0.65/90.83 # Clause-clause subsumption calls (NU) : 561471
% 0.65/90.83 # Rec. Clause-clause subsumption calls : 35766
% 0.65/90.83 # Non-unit clause-clause subsumptions : 8009
% 0.65/90.83 # Unit Clause-clause subsumption calls : 172119
% 0.65/90.83 # Rewrite failures with RHS unbound : 0
% 0.65/90.83 # BW rewrite match attempts : 238
% 0.65/90.83 # BW rewrite match successes : 234
% 0.65/90.83 # Condensation attempts : 0
% 0.65/90.83 # Condensation successes : 0
% 0.65/90.83 # Termbank termtop insertions : 8641154
% 0.65/90.83
% 0.65/90.83 # -------------------------------------------------
% 0.65/90.83 # User time : 5.197 s
% 0.65/90.83 # System time : 0.096 s
% 0.65/90.83 # Total time : 5.293 s
% 0.65/90.83 # Maximum resident set size: 131232 pages
% 0.65/92.50 eprover: CPU time limit exceeded, terminating
% 0.65/92.50 eprover: CPU time limit exceeded, terminating
% 0.65/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.51 eprover: No such file or directory
% 0.65/92.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.51 eprover: No such file or directory
% 0.65/92.52 eprover: CPU time limit exceeded, terminating
% 0.65/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.52 eprover: No such file or directory
% 0.65/92.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.52 eprover: No such file or directory
% 0.65/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.53 eprover: No such file or directory
% 0.65/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.53 eprover: No such file or directory
% 0.65/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.53 eprover: No such file or directory
% 0.65/92.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.53 eprover: No such file or directory
% 0.65/92.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.54 eprover: No such file or directory
% 0.65/92.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.54 eprover: No such file or directory
% 0.65/92.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.54 eprover: No such file or directory
% 0.65/92.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.54 eprover: No such file or directory
% 0.65/92.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.55 eprover: No such file or directory
% 0.65/92.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.55 eprover: No such file or directory
% 0.65/92.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.55 eprover: No such file or directory
% 0.65/92.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.56 eprover: No such file or directory
% 0.65/92.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.65/92.56 eprover: No such file or directory
%------------------------------------------------------------------------------