TSTP Solution File: SWV398+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV398+1 : TPTP v8.1.0. Released v3.3.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 : Wed Jul 20 18:16:27 EDT 2022
% Result : Theorem 0.26s 5.45s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 53 ( 7 unt; 0 def)
% Number of atoms : 150 ( 36 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 145 ( 48 ~; 74 |; 14 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 147 ( 38 sgn 60 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax48,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(l24_co,conjecture,
! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',l24_co) ).
fof(l34_l35,lemma,
! [X1] :
( ? [X2,X3] :
( pair_in_list(X1,X2,X3)
& strictly_less_than(X2,X3) )
=> ! [X4] :
? [X5,X6] :
( pair_in_list(update_slb(X1,X4),X5,X6)
& strictly_less_than(X5,X6) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',l34_l35) ).
fof(l26_li4142,lemma,
! [X1,X2,X3] :
( check_cpq(triple(X1,X2,X3))
<=> ! [X4,X5] :
( pair_in_list(X2,X4,X5)
=> less_than(X5,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',l26_li4142) ).
fof(ax49,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(ax36,axiom,
! [X1,X2] : check_cpq(triple(X1,create_slb,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax36) ).
fof(c_0_9,plain,
! [X5,X6,X7] :
( X6 = create_slb
| ~ contains_slb(X6,findmin_pqp_res(X5))
| ~ strictly_less_than(findmin_pqp_res(X5),lookup_slb(X6,findmin_pqp_res(X5)))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax48])])])]) ).
fof(c_0_10,plain,
! [X5,X6,X7] :
( X6 = create_slb
| contains_slb(X6,findmin_pqp_res(X5))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),bad) ),
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)],[ax47])])])])]) ).
fof(c_0_11,plain,
! [X3,X4,X3,X4] :
( ( less_than(X3,X4)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X4,X3)
| ~ strictly_less_than(X3,X4) )
& ( ~ less_than(X3,X4)
| less_than(X4,X3)
| strictly_less_than(X3,X4) ) ),
inference(distribute,[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)],[stricly_smaller_definition])])])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( less_than(X3,X4)
| less_than(X4,X3) ),
inference(variable_rename,[status(thm)],[totality]) ).
cnf(c_0_13,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1)))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| contains_slb(X2,findmin_pqp_res(X1))
| X2 = create_slb ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ check_cpq(triple(X1,X2,X3))
=> ~ check_cpq(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l24_co]) ).
cnf(c_0_18,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) ),
inference(csr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,negated_conjecture,
( ~ check_cpq(triple(esk5_0,esk6_0,esk7_0))
& check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_21,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = findmin_cpq_eff(triple(X1,X2,X4))
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_21]) ).
cnf(c_0_24,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = findmin_cpq_eff(triple(X1,X2,X4))
| X2 = create_slb
| contains_slb(X2,findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
fof(c_0_25,lemma,
! [X7,X8,X9,X10] :
( ( pair_in_list(update_slb(X7,X10),esk3_2(X7,X10),esk4_2(X7,X10))
| ~ pair_in_list(X7,X8,X9)
| ~ strictly_less_than(X8,X9) )
& ( strictly_less_than(esk3_2(X7,X10),esk4_2(X7,X10))
| ~ pair_in_list(X7,X8,X9)
| ~ strictly_less_than(X8,X9) ) ),
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)],[l34_l35])])])])])])]) ).
fof(c_0_26,lemma,
! [X6,X7,X8,X9,X10,X6,X7,X8] :
( ( ~ check_cpq(triple(X6,X7,X8))
| ~ pair_in_list(X7,X9,X10)
| less_than(X10,X9) )
& ( pair_in_list(X7,esk1_2(X6,X7),esk2_2(X6,X7))
| check_cpq(triple(X6,X7,X8)) )
& ( ~ less_than(esk2_2(X6,X7),esk1_2(X6,X7))
| check_cpq(triple(X6,X7,X8)) ) ),
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)],[l26_li4142])])])])])])]) ).
fof(c_0_27,plain,
! [X5,X6,X7] :
( X6 = create_slb
| ~ contains_slb(X6,findmin_pqp_res(X5))
| ~ less_than(lookup_slb(X6,findmin_pqp_res(X5)),findmin_pqp_res(X5))
| findmin_cpq_eff(triple(X5,X6,X7)) = triple(X5,update_slb(X6,findmin_pqp_res(X5)),X7) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])])]) ).
cnf(c_0_28,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X1)))
| less_than(lookup_slb(esk6_0,findmin_pqp_res(esk5_0)),findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X1)))
| contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_30,lemma,
( strictly_less_than(esk3_2(X3,X4),esk4_2(X3,X4))
| ~ strictly_less_than(X1,X2)
| ~ pair_in_list(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(X2,esk1_2(X1,X2),esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3)
| X2 = create_slb
| ~ less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1))
| ~ contains_slb(X2,findmin_pqp_res(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad))
| less_than(lookup_slb(esk6_0,findmin_pqp_res(esk5_0)),findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad))
| contains_slb(esk6_0,findmin_pqp_res(esk5_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_14]) ).
cnf(c_0_35,lemma,
( pair_in_list(update_slb(X3,X4),esk3_2(X3,X4),esk4_2(X3,X4))
| ~ strictly_less_than(X1,X2)
| ~ pair_in_list(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,lemma,
( check_cpq(triple(X1,X2,X3))
| strictly_less_than(esk3_2(X2,X4),esk4_2(X2,X4))
| ~ strictly_less_than(esk1_2(X1,X2),esk2_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk2_2(X1,X2),esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,lemma,
( less_than(X1,X2)
| ~ pair_in_list(X3,X2,X1)
| ~ check_cpq(triple(X4,X3,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,negated_conjecture,
( triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),X1) = findmin_cpq_eff(triple(esk5_0,esk6_0,X1))
| esk6_0 = create_slb
| check_cpq(triple(esk5_0,update_slb(esk6_0,findmin_pqp_res(esk5_0)),bad)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_40,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(update_slb(X2,X4),esk3_2(X2,X4),esk4_2(X2,X4))
| ~ strictly_less_than(esk1_2(X1,X2),esk2_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_41,plain,
( ~ strictly_less_than(X1,X2)
| ~ less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,lemma,
( check_cpq(triple(X1,X2,X3))
| strictly_less_than(esk3_2(X2,X4),esk4_2(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_19]),c_0_37]) ).
cnf(c_0_43,lemma,
( esk6_0 = create_slb
| less_than(X1,X2)
| ~ check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X3)))
| ~ pair_in_list(update_slb(esk6_0,findmin_pqp_res(esk5_0)),X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_38]) ).
cnf(c_0_44,lemma,
( check_cpq(triple(X1,X2,X3))
| pair_in_list(update_slb(X2,X4),esk3_2(X2,X4),esk4_2(X2,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_19]),c_0_37]) ).
cnf(c_0_45,lemma,
( check_cpq(triple(X1,X2,X3))
| ~ less_than(esk4_2(X2,X4),esk3_2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,lemma,
( esk6_0 = create_slb
| check_cpq(triple(X1,esk6_0,X2))
| ~ check_cpq(findmin_cpq_eff(triple(esk5_0,esk6_0,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_47,negated_conjecture,
~ check_cpq(triple(esk5_0,esk6_0,esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_48,negated_conjecture,
( esk6_0 = create_slb
| check_cpq(triple(X1,esk6_0,X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_22]) ).
fof(c_0_49,plain,
! [X3,X4] : check_cpq(triple(X3,create_slb,X4)),
inference(variable_rename,[status(thm)],[ax36]) ).
cnf(c_0_50,negated_conjecture,
esk6_0 = create_slb,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
check_cpq(triple(X1,create_slb,X2)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV398+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 17:14:42 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.26/5.45 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.26/5.45 # Preprocessing time : 0.018 s
% 0.26/5.45
% 0.26/5.45 # Proof found!
% 0.26/5.45 # SZS status Theorem
% 0.26/5.45 # SZS output start CNFRefutation
% See solution above
% 0.26/5.45 # Proof object total steps : 53
% 0.26/5.45 # Proof object clause steps : 34
% 0.26/5.45 # Proof object formula steps : 19
% 0.26/5.45 # Proof object conjectures : 13
% 0.26/5.45 # Proof object clause conjectures : 10
% 0.26/5.45 # Proof object formula conjectures : 3
% 0.26/5.45 # Proof object initial clauses used : 14
% 0.26/5.45 # Proof object initial formulas used : 9
% 0.26/5.45 # Proof object generating inferences : 17
% 0.26/5.45 # Proof object simplifying inferences : 10
% 0.26/5.45 # Training examples: 0 positive, 0 negative
% 0.26/5.45 # Parsed axioms : 44
% 0.26/5.45 # Removed by relevancy pruning/SinE : 0
% 0.26/5.45 # Initial clauses : 57
% 0.26/5.45 # Removed in clause preprocessing : 2
% 0.26/5.45 # Initial clauses in saturation : 55
% 0.26/5.45 # Processed clauses : 5747
% 0.26/5.45 # ...of these trivial : 3
% 0.26/5.45 # ...subsumed : 2740
% 0.26/5.45 # ...remaining for further processing : 3004
% 0.26/5.45 # Other redundant clauses eliminated : 3
% 0.26/5.45 # Clauses deleted for lack of memory : 52519
% 0.26/5.45 # Backward-subsumed : 42
% 0.26/5.45 # Backward-rewritten : 76
% 0.26/5.45 # Generated clauses : 183089
% 0.26/5.45 # ...of the previous two non-trivial : 176514
% 0.26/5.45 # Contextual simplify-reflections : 3392
% 0.26/5.45 # Paramodulations : 182572
% 0.26/5.45 # Factorizations : 514
% 0.26/5.45 # Equation resolutions : 4
% 0.26/5.45 # Current number of processed clauses : 2884
% 0.26/5.45 # Positive orientable unit clauses : 33
% 0.26/5.45 # Positive unorientable unit clauses: 0
% 0.26/5.45 # Negative unit clauses : 990
% 0.26/5.45 # Non-unit-clauses : 1861
% 0.26/5.45 # Current number of unprocessed clauses: 114302
% 0.26/5.45 # ...number of literals in the above : 647004
% 0.26/5.45 # Current number of archived formulas : 0
% 0.26/5.45 # Current number of archived clauses : 120
% 0.26/5.45 # Clause-clause subsumption calls (NU) : 1301347
% 0.26/5.45 # Rec. Clause-clause subsumption calls : 237305
% 0.26/5.45 # Non-unit clause-clause subsumptions : 5750
% 0.26/5.45 # Unit Clause-clause subsumption calls : 931362
% 0.26/5.45 # Rewrite failures with RHS unbound : 0
% 0.26/5.45 # BW rewrite match attempts : 178
% 0.26/5.45 # BW rewrite match successes : 2
% 0.26/5.45 # Condensation attempts : 0
% 0.26/5.45 # Condensation successes : 0
% 0.26/5.45 # Termbank termtop insertions : 5891876
% 0.26/5.45
% 0.26/5.45 # -------------------------------------------------
% 0.26/5.45 # User time : 4.587 s
% 0.26/5.45 # System time : 0.106 s
% 0.26/5.45 # Total time : 4.693 s
% 0.26/5.45 # Maximum resident set size: 145364 pages
% 0.26/23.42 eprover: CPU time limit exceeded, terminating
% 0.26/23.42 eprover: CPU time limit exceeded, terminating
% 0.26/23.43 eprover: CPU time limit exceeded, terminating
% 0.26/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.43 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------