TSTP Solution File: ITP006+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ITP006+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : Sat Jul 16 22:45:46 EDT 2022
% Result : Theorem 0.32s 15.51s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 61 ( 16 unt; 0 def)
% Number of atoms : 427 ( 27 equ)
% Maximal formula atoms : 132 ( 7 avg)
% Number of connectives : 560 ( 194 ~; 198 |; 60 &)
% ( 20 <=>; 88 =>; 0 <=; 0 <~>)
% Maximal formula depth : 54 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 25 ( 25 usr; 7 con; 0-7 aty)
% Number of variables : 203 ( 14 sgn 113 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT,conjecture,
! [X9] :
( ne(X9)
=> ! [X10] :
( ne(X10)
=> ! [X20] :
( mem(X20,arr(X10,X9))
=> ! [X21] :
( mem(X21,arr(X9,bool))
=> ! [X45] :
( mem(X45,arr(X9,bool))
=> ( ! [X46] :
( mem(X46,X9)
=> ( p(ap(X45,X46))
=> p(ap(X21,X46)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X10,X9),X20),X21))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X10,X9),X20),X45)) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).
fof(ap_tp,axiom,
! [X1,X2,X3] :
( mem(X3,arr(X1,X2))
=> ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',ap_tp) ).
fof(boolext,axiom,
! [X5] :
( mem(X5,bool)
=> ! [X6] :
( mem(X6,bool)
=> ( ( p(X5)
<=> p(X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',boolext) ).
fof(ax_false_p,axiom,
~ p(c_2Ebool_2EF),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',ax_false_p) ).
fof(mem_c_2Ebool_2EF,axiom,
mem(c_2Ebool_2EF,bool),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mem_c_2Ebool_2EF) ).
fof(conj_thm_2EquantHeuristics_2EGUESS__REWRITES,axiom,
! [X9] :
( ne(X9)
=> ! [X10] :
( ne(X10)
=> ! [X20] :
( mem(X20,arr(X9,X10))
=> ! [X21] :
( mem(X21,arr(X10,bool))
=> ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X9,X10),X20),X21))
<=> ! [X22] :
( mem(X22,X10)
=> ( p(ap(X21,X22))
=> ? [X23] :
( mem(X23,X9)
& p(ap(X21,ap(X20,X23))) ) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X9,X10),X20),X21))
<=> ! [X24] :
( mem(X24,X10)
=> ( ~ p(ap(X21,X24))
=> ? [X25] :
( mem(X25,X9)
& ~ p(ap(X21,ap(X20,X25))) ) ) ) )
& ! [X26] :
( mem(X26,arr(X9,X10))
=> ! [X27] :
( mem(X27,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X9,X10),X26),X27))
<=> ! [X28] :
( mem(X28,X9)
=> p(ap(X27,ap(X26,X28))) ) ) ) )
& ! [X29] :
( mem(X29,arr(X9,X10))
=> ! [X30] :
( mem(X30,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X10),X29),X30))
<=> ! [X31] :
( mem(X31,X9)
=> ~ p(ap(X30,ap(X29,X31))) ) ) ) )
& ! [X32] :
( mem(X32,arr(X9,X10))
=> ! [X33] :
( mem(X33,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X9,X10),X32),X33))
<=> ! [X34] :
( mem(X34,X10)
=> ( p(ap(X33,X34))
=> ? [X35] :
( mem(X35,X9)
& X34 = ap(X32,X35) ) ) ) ) ) )
& ! [X36] :
( mem(X36,arr(X9,X10))
=> ! [X37] :
( mem(X37,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X9,X10),X36),X37))
<=> ! [X38] :
( mem(X38,X10)
=> ( ~ p(ap(X37,X38))
=> ? [X39] :
( mem(X39,X9)
& X38 = ap(X36,X39) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__REWRITES) ).
fof(mem_c_2EquantHeuristics_2EGUESS__FORALL__POINT,axiom,
! [X9] :
( ne(X9)
=> ! [X10] :
( ne(X10)
=> mem(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X10),arr(arr(X9,X10),arr(arr(X10,bool),bool))) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mem_c_2EquantHeuristics_2EGUESS__FORALL__POINT) ).
fof(c_0_7,negated_conjecture,
~ ! [X9] :
( ne(X9)
=> ! [X10] :
( ne(X10)
=> ! [X20] :
( mem(X20,arr(X10,X9))
=> ! [X21] :
( mem(X21,arr(X9,bool))
=> ! [X45] :
( mem(X45,arr(X9,bool))
=> ( ! [X46] :
( mem(X46,X9)
=> ( p(ap(X45,X46))
=> p(ap(X21,X46)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X10,X9),X20),X21))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X10,X9),X20),X45)) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT]) ).
fof(c_0_8,plain,
! [X21,X20,X10,X9] :
( epred3_4(X9,X10,X20,X21)
<=> ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X9,X10),X20),X21))
<=> ! [X22] :
( mem(X22,X10)
=> ( p(ap(X21,X22))
=> ? [X23] :
( mem(X23,X9)
& p(ap(X21,ap(X20,X23))) ) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X9,X10),X20),X21))
<=> ! [X24] :
( mem(X24,X10)
=> ( ~ p(ap(X21,X24))
=> ? [X25] :
( mem(X25,X9)
& ~ p(ap(X21,ap(X20,X25))) ) ) ) )
& ! [X26] :
( mem(X26,arr(X9,X10))
=> ! [X27] :
( mem(X27,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X9,X10),X26),X27))
<=> ! [X28] :
( mem(X28,X9)
=> p(ap(X27,ap(X26,X28))) ) ) ) )
& ! [X29] :
( mem(X29,arr(X9,X10))
=> ! [X30] :
( mem(X30,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X10),X29),X30))
<=> ! [X31] :
( mem(X31,X9)
=> ~ p(ap(X30,ap(X29,X31))) ) ) ) )
& ! [X32] :
( mem(X32,arr(X9,X10))
=> ! [X33] :
( mem(X33,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X9,X10),X32),X33))
<=> ! [X34] :
( mem(X34,X10)
=> ( p(ap(X33,X34))
=> ? [X35] :
( mem(X35,X9)
& X34 = ap(X32,X35) ) ) ) ) ) )
& ! [X36] :
( mem(X36,arr(X9,X10))
=> ! [X37] :
( mem(X37,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X9,X10),X36),X37))
<=> ! [X38] :
( mem(X38,X10)
=> ( ~ p(ap(X37,X38))
=> ? [X39] :
( mem(X39,X9)
& X38 = ap(X36,X39) ) ) ) ) ) ) ) ),
introduced(definition) ).
fof(c_0_9,plain,
! [X5,X6,X7,X8] :
( ~ mem(X7,arr(X5,X6))
| ~ mem(X8,X5)
| mem(ap(X7,X8),X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X52] :
( ne(esk4_0)
& ne(esk5_0)
& mem(esk6_0,arr(esk5_0,esk4_0))
& mem(esk7_0,arr(esk4_0,bool))
& mem(esk8_0,arr(esk4_0,bool))
& ( ~ mem(X52,esk4_0)
| ~ p(ap(esk8_0,X52))
| p(ap(esk7_0,X52)) )
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk5_0,esk4_0),esk6_0),esk7_0))
& ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk5_0,esk4_0),esk6_0),esk8_0)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
fof(c_0_11,plain,
! [X21,X20,X10,X9] :
( epred3_4(X9,X10,X20,X21)
=> ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X9,X10),X20),X21))
<=> ! [X22] :
( mem(X22,X10)
=> ( p(ap(X21,X22))
=> ? [X23] :
( mem(X23,X9)
& p(ap(X21,ap(X20,X23))) ) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X9,X10),X20),X21))
<=> ! [X24] :
( mem(X24,X10)
=> ( ~ p(ap(X21,X24))
=> ? [X25] :
( mem(X25,X9)
& ~ p(ap(X21,ap(X20,X25))) ) ) ) )
& ! [X26] :
( mem(X26,arr(X9,X10))
=> ! [X27] :
( mem(X27,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X9,X10),X26),X27))
<=> ! [X28] :
( mem(X28,X9)
=> p(ap(X27,ap(X26,X28))) ) ) ) )
& ! [X29] :
( mem(X29,arr(X9,X10))
=> ! [X30] :
( mem(X30,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X10),X29),X30))
<=> ! [X31] :
( mem(X31,X9)
=> ~ p(ap(X30,ap(X29,X31))) ) ) ) )
& ! [X32] :
( mem(X32,arr(X9,X10))
=> ! [X33] :
( mem(X33,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X9,X10),X32),X33))
<=> ! [X34] :
( mem(X34,X10)
=> ( p(ap(X33,X34))
=> ? [X35] :
( mem(X35,X9)
& X34 = ap(X32,X35) ) ) ) ) ) )
& ! [X36] :
( mem(X36,arr(X9,X10))
=> ! [X37] :
( mem(X37,arr(X10,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X9,X10),X36),X37))
<=> ! [X38] :
( mem(X38,X10)
=> ( ~ p(ap(X37,X38))
=> ? [X39] :
( mem(X39,X9)
& X38 = ap(X36,X39) ) ) ) ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X7,X8] :
( ( ~ p(X7)
| ~ p(X8)
| X7 = X8
| ~ mem(X8,bool)
| ~ mem(X7,bool) )
& ( p(X7)
| p(X8)
| X7 = X8
| ~ mem(X8,bool)
| ~ mem(X7,bool) ) ),
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)],[boolext])])])])])]) ).
cnf(c_0_13,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
mem(esk7_0,arr(esk4_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X40,X41,X42,X43,X44,X47,X48,X51,X52,X53,X54,X56,X57,X58,X60,X61,X62,X65,X66,X67,X68,X71] :
( ( mem(esk9_5(X40,X41,X42,X43,X44),X43)
| ~ p(ap(X40,X44))
| ~ mem(X44,X42)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( p(ap(X40,ap(X41,esk9_5(X40,X41,X42,X43,X44))))
| ~ p(ap(X40,X44))
| ~ mem(X44,X42)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( mem(esk10_4(X40,X41,X42,X43),X42)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( p(ap(X40,esk10_4(X40,X41,X42,X43)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ mem(X47,X43)
| ~ p(ap(X40,ap(X41,X47)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( mem(esk11_5(X40,X41,X42,X43,X48),X43)
| p(ap(X40,X48))
| ~ mem(X48,X42)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ p(ap(X40,ap(X41,esk11_5(X40,X41,X42,X43,X48))))
| p(ap(X40,X48))
| ~ mem(X48,X42)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( mem(esk12_4(X40,X41,X42,X43),X42)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ p(ap(X40,esk12_4(X40,X41,X42,X43)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ mem(X51,X43)
| p(ap(X40,ap(X41,X51)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X43,X42),X41),X40))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X43,X42),X52),X53))
| ~ mem(X54,X43)
| p(ap(X53,ap(X52,X54)))
| ~ mem(X53,arr(X42,bool))
| ~ mem(X52,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( mem(esk13_6(X40,X41,X42,X43,X52,X53),X43)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X43,X42),X52),X53))
| ~ mem(X53,arr(X42,bool))
| ~ mem(X52,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ p(ap(X53,ap(X52,esk13_6(X40,X41,X42,X43,X52,X53))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X43,X42),X52),X53))
| ~ mem(X53,arr(X42,bool))
| ~ mem(X52,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X43,X42),X56),X57))
| ~ mem(X58,X43)
| ~ p(ap(X57,ap(X56,X58)))
| ~ mem(X57,arr(X42,bool))
| ~ mem(X56,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( mem(esk14_6(X40,X41,X42,X43,X56,X57),X43)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X43,X42),X56),X57))
| ~ mem(X57,arr(X42,bool))
| ~ mem(X56,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( p(ap(X57,ap(X56,esk14_6(X40,X41,X42,X43,X56,X57))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X43,X42),X56),X57))
| ~ mem(X57,arr(X42,bool))
| ~ mem(X56,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( mem(esk15_7(X40,X41,X42,X43,X60,X61,X62),X43)
| ~ p(ap(X61,X62))
| ~ mem(X62,X42)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X43,X42),X60),X61))
| ~ mem(X61,arr(X42,bool))
| ~ mem(X60,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( X62 = ap(X60,esk15_7(X40,X41,X42,X43,X60,X61,X62))
| ~ p(ap(X61,X62))
| ~ mem(X62,X42)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X43,X42),X60),X61))
| ~ mem(X61,arr(X42,bool))
| ~ mem(X60,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( mem(esk16_6(X40,X41,X42,X43,X60,X61),X42)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X43,X42),X60),X61))
| ~ mem(X61,arr(X42,bool))
| ~ mem(X60,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( p(ap(X61,esk16_6(X40,X41,X42,X43,X60,X61)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X43,X42),X60),X61))
| ~ mem(X61,arr(X42,bool))
| ~ mem(X60,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ mem(X65,X43)
| esk16_6(X40,X41,X42,X43,X60,X61) != ap(X60,X65)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X43,X42),X60),X61))
| ~ mem(X61,arr(X42,bool))
| ~ mem(X60,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( mem(esk17_7(X40,X41,X42,X43,X66,X67,X68),X43)
| p(ap(X67,X68))
| ~ mem(X68,X42)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X43,X42),X66),X67))
| ~ mem(X67,arr(X42,bool))
| ~ mem(X66,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( X68 = ap(X66,esk17_7(X40,X41,X42,X43,X66,X67,X68))
| p(ap(X67,X68))
| ~ mem(X68,X42)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X43,X42),X66),X67))
| ~ mem(X67,arr(X42,bool))
| ~ mem(X66,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( mem(esk18_6(X40,X41,X42,X43,X66,X67),X42)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X43,X42),X66),X67))
| ~ mem(X67,arr(X42,bool))
| ~ mem(X66,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ p(ap(X67,esk18_6(X40,X41,X42,X43,X66,X67)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X43,X42),X66),X67))
| ~ mem(X67,arr(X42,bool))
| ~ mem(X66,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) )
& ( ~ mem(X71,X43)
| esk18_6(X40,X41,X42,X43,X66,X67) != ap(X66,X71)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X43,X42),X66),X67))
| ~ mem(X67,arr(X42,bool))
| ~ mem(X66,arr(X43,X42))
| ~ epred3_4(X43,X42,X41,X40) ) ),
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)],[c_0_11])])])])])])])]) ).
cnf(c_0_16,plain,
( X1 = X2
| p(X2)
| p(X1)
| ~ mem(X1,bool)
| ~ mem(X2,bool) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( mem(ap(esk7_0,X1),bool)
| ~ mem(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_18,plain,
~ p(c_2Ebool_2EF),
inference(fof_simplification,[status(thm)],[ax_false_p]) ).
cnf(c_0_19,plain,
( ~ epred3_4(X1,X2,X3,X4)
| ~ mem(X5,arr(X1,X2))
| ~ mem(X6,arr(X2,bool))
| ~ p(ap(X6,ap(X5,X7)))
| ~ mem(X7,X1)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X5),X6)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk5_0,esk4_0),esk6_0),esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
mem(esk6_0,arr(esk5_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
( X1 = ap(esk7_0,X2)
| p(ap(esk7_0,X2))
| p(X1)
| ~ mem(X1,bool)
| ~ mem(X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
mem(c_2Ebool_2EF,bool),
inference(split_conjunct,[status(thm)],[mem_c_2Ebool_2EF]) ).
cnf(c_0_24,plain,
~ p(c_2Ebool_2EF),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,axiom,
! [X9] :
( ne(X9)
=> ! [X10] :
( ne(X10)
=> ! [X20] :
( mem(X20,arr(X9,X10))
=> ! [X21] :
( mem(X21,arr(X10,bool))
=> epred3_4(X9,X10,X20,X21) ) ) ) ),
inference(apply_def,[status(thm)],[conj_thm_2EquantHeuristics_2EGUESS__REWRITES,c_0_8]) ).
cnf(c_0_26,negated_conjecture,
mem(esk8_0,arr(esk4_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,negated_conjecture,
( ~ epred3_4(esk5_0,esk4_0,X1,X2)
| ~ p(ap(esk7_0,ap(esk6_0,X3)))
| ~ mem(X3,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]),c_0_21])]) ).
cnf(c_0_28,negated_conjecture,
( ap(esk7_0,X1) = c_2Ebool_2EF
| p(ap(esk7_0,X1))
| ~ mem(X1,esk4_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( mem(ap(esk6_0,X1),esk4_0)
| ~ mem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
fof(c_0_30,plain,
! [X22,X23,X24,X25] :
( ~ ne(X22)
| ~ ne(X23)
| ~ mem(X24,arr(X22,X23))
| ~ mem(X25,arr(X23,bool))
| epred3_4(X22,X23,X24,X25) ),
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)],[c_0_25])])])])]) ).
cnf(c_0_31,negated_conjecture,
( mem(ap(esk8_0,X1),bool)
| ~ mem(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( ap(esk7_0,ap(esk6_0,X1)) = c_2Ebool_2EF
| ~ epred3_4(esk5_0,esk4_0,X2,X3)
| ~ mem(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
( epred3_4(X1,X2,X3,X4)
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,X2))
| ~ ne(X2)
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
ne(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
ne(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_36,plain,
! [X11,X12] :
( ~ ne(X11)
| ~ ne(X12)
| mem(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X11,X12),arr(arr(X11,X12),arr(arr(X12,bool),bool))) ),
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)],[mem_c_2EquantHeuristics_2EGUESS__FORALL__POINT])])])])]) ).
cnf(c_0_37,negated_conjecture,
( X1 = ap(esk8_0,X2)
| p(ap(esk8_0,X2))
| p(X1)
| ~ mem(X1,bool)
| ~ mem(X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( ap(esk7_0,ap(esk6_0,X1)) = c_2Ebool_2EF
| ~ mem(X2,arr(esk4_0,bool))
| ~ mem(X3,arr(esk5_0,esk4_0))
| ~ mem(X1,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_39,plain,
( mem(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),arr(arr(X1,X2),arr(arr(X2,bool),bool)))
| ~ ne(X2)
| ~ ne(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( p(ap(esk7_0,X1))
| ~ p(ap(esk8_0,X1))
| ~ mem(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_41,negated_conjecture,
( ap(esk8_0,X1) = c_2Ebool_2EF
| p(ap(esk8_0,X1))
| ~ mem(X1,esk4_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_23]),c_0_24]) ).
cnf(c_0_42,negated_conjecture,
( ap(esk7_0,ap(esk6_0,X1)) = c_2Ebool_2EF
| ~ mem(X2,arr(esk5_0,esk4_0))
| ~ mem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_26]) ).
cnf(c_0_43,negated_conjecture,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk5_0,esk4_0),esk6_0),esk8_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_44,plain,
( X1 = c_2Ebool_2EF
| p(X1)
| ~ mem(X1,bool) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_23]),c_0_24]) ).
cnf(c_0_45,plain,
( mem(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),arr(arr(X2,bool),bool))
| ~ mem(X3,arr(X1,X2))
| ~ ne(X2)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( ap(esk8_0,X1) = c_2Ebool_2EF
| p(ap(esk7_0,X1))
| ~ mem(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( ap(esk7_0,ap(esk6_0,X1)) = c_2Ebool_2EF
| ~ mem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_21]) ).
cnf(c_0_48,plain,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X5),X6))
| mem(esk14_6(X4,X3,X2,X1,X5,X6),X1)
| ~ epred3_4(X1,X2,X3,X4)
| ~ mem(X5,arr(X1,X2))
| ~ mem(X6,arr(X2,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_49,negated_conjecture,
( ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk5_0,esk4_0),esk6_0),esk8_0) = c_2Ebool_2EF
| ~ mem(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk5_0,esk4_0),esk6_0),esk8_0),bool) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
( mem(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X4),bool)
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,X2))
| ~ ne(X2)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_45]) ).
cnf(c_0_51,plain,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X5),X6))
| p(ap(X6,ap(X5,esk14_6(X4,X3,X2,X1,X5,X6))))
| ~ epred3_4(X1,X2,X3,X4)
| ~ mem(X5,arr(X1,X2))
| ~ mem(X6,arr(X2,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_52,negated_conjecture,
( ap(esk8_0,ap(esk6_0,X1)) = c_2Ebool_2EF
| ~ mem(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_24]),c_0_29]) ).
cnf(c_0_53,negated_conjecture,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,esk4_0),X2),esk8_0))
| mem(esk14_6(X3,X4,esk4_0,X1,X2,esk8_0),X1)
| ~ epred3_4(X1,esk4_0,X4,X3)
| ~ mem(X2,arr(X1,esk4_0)) ),
inference(spm,[status(thm)],[c_0_48,c_0_26]) ).
cnf(c_0_54,negated_conjecture,
ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk5_0,esk4_0),esk6_0),esk8_0) = c_2Ebool_2EF,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_26]),c_0_21]),c_0_34]),c_0_35])]) ).
cnf(c_0_55,plain,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),esk6_0),esk8_0))
| ~ epred3_4(X1,X2,X3,X4)
| ~ mem(esk14_6(X4,X3,X2,X1,esk6_0,esk8_0),esk5_0)
| ~ mem(esk8_0,arr(X2,bool))
| ~ mem(esk6_0,arr(X1,X2)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_24]) ).
cnf(c_0_56,negated_conjecture,
( mem(esk14_6(X1,X2,esk4_0,esk5_0,esk6_0,esk8_0),esk5_0)
| ~ epred3_4(esk5_0,esk4_0,X2,X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_21]),c_0_54]),c_0_24]) ).
cnf(c_0_57,negated_conjecture,
~ epred3_4(esk5_0,esk4_0,X1,X2),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_54]),c_0_26]),c_0_21])]),c_0_24]) ).
cnf(c_0_58,negated_conjecture,
( ~ mem(X1,arr(esk4_0,bool))
| ~ mem(X2,arr(esk5_0,esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_59,negated_conjecture,
~ mem(X1,arr(esk5_0,esk4_0)),
inference(spm,[status(thm)],[c_0_58,c_0_26]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_21,c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ITP006+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 2 20:54:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.32/15.51 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.32/15.51 # Preprocessing time : 0.026 s
% 0.32/15.51
% 0.32/15.51 # Proof found!
% 0.32/15.51 # SZS status Theorem
% 0.32/15.51 # SZS output start CNFRefutation
% See solution above
% 0.34/15.51 # Proof object total steps : 61
% 0.34/15.51 # Proof object clause steps : 43
% 0.34/15.51 # Proof object formula steps : 18
% 0.34/15.51 # Proof object conjectures : 33
% 0.34/15.51 # Proof object clause conjectures : 30
% 0.34/15.51 # Proof object formula conjectures : 3
% 0.34/15.51 # Proof object initial clauses used : 17
% 0.34/15.51 # Proof object initial formulas used : 7
% 0.34/15.51 # Proof object generating inferences : 25
% 0.34/15.51 # Proof object simplifying inferences : 29
% 0.34/15.51 # Training examples: 0 positive, 0 negative
% 0.34/15.51 # Parsed axioms : 52
% 0.34/15.51 # Removed by relevancy pruning/SinE : 0
% 0.34/15.51 # Initial clauses : 282
% 0.34/15.51 # Removed in clause preprocessing : 172
% 0.34/15.51 # Initial clauses in saturation : 110
% 0.34/15.51 # Processed clauses : 11952
% 0.34/15.51 # ...of these trivial : 8
% 0.34/15.51 # ...subsumed : 6973
% 0.34/15.51 # ...remaining for further processing : 4971
% 0.34/15.51 # Other redundant clauses eliminated : 3
% 0.34/15.51 # Clauses deleted for lack of memory : 228094
% 0.34/15.51 # Backward-subsumed : 613
% 0.34/15.51 # Backward-rewritten : 162
% 0.34/15.51 # Generated clauses : 353944
% 0.34/15.51 # ...of the previous two non-trivial : 346982
% 0.34/15.51 # Contextual simplify-reflections : 11817
% 0.34/15.51 # Paramodulations : 353731
% 0.34/15.51 # Factorizations : 206
% 0.34/15.51 # Equation resolutions : 6
% 0.34/15.51 # Current number of processed clauses : 4194
% 0.34/15.51 # Positive orientable unit clauses : 25
% 0.34/15.51 # Positive unorientable unit clauses: 0
% 0.34/15.51 # Negative unit clauses : 4
% 0.34/15.51 # Non-unit-clauses : 4165
% 0.34/15.51 # Current number of unprocessed clauses: 79007
% 0.34/15.51 # ...number of literals in the above : 764210
% 0.34/15.51 # Current number of archived formulas : 0
% 0.34/15.51 # Current number of archived clauses : 776
% 0.34/15.51 # Clause-clause subsumption calls (NU) : 5468095
% 0.34/15.51 # Rec. Clause-clause subsumption calls : 130324
% 0.34/15.51 # Non-unit clause-clause subsumptions : 18029
% 0.34/15.51 # Unit Clause-clause subsumption calls : 5635
% 0.34/15.51 # Rewrite failures with RHS unbound : 0
% 0.34/15.51 # BW rewrite match attempts : 16
% 0.34/15.51 # BW rewrite match successes : 15
% 0.34/15.51 # Condensation attempts : 0
% 0.34/15.51 # Condensation successes : 0
% 0.34/15.51 # Termbank termtop insertions : 28684673
% 0.34/15.51
% 0.34/15.51 # -------------------------------------------------
% 0.34/15.51 # User time : 14.823 s
% 0.34/15.51 # System time : 0.137 s
% 0.34/15.51 # Total time : 14.960 s
% 0.34/15.51 # Maximum resident set size: 139372 pages
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.41 eprover: CPU time limit exceeded, terminating
% 0.34/23.42 eprover: CPU time limit exceeded, terminating
% 0.34/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.42 eprover: No such file or directory
% 0.34/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.43 eprover: No such file or directory
% 0.34/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.43 eprover: No such file or directory
% 0.34/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.43 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.44 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.45 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.46 eprover: No such file or directory
% 0.34/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.47 eprover: No such file or directory
% 0.34/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.47 eprover: No such file or directory
% 0.34/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.47 eprover: No such file or directory
% 0.34/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.47 eprover: No such file or directory
% 0.34/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.47 eprover: No such file or directory
% 0.34/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.47 eprover: No such file or directory
% 0.34/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.34/23.48 eprover: No such file or directory
% 0.34/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.48 eprover: No such file or directory
% 0.34/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.48 eprover: No such file or directory
% 0.34/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.34/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------