TSTP Solution File: ITP006+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP006+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : 300s
% DateTime : Sat May 4 08:06:15 EDT 2024
% Result : Theorem 2.81s 0.82s
% Output : CNFRefutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 4
% Syntax : Number of formulae : 54 ( 11 unt; 0 def)
% Number of atoms : 415 ( 10 equ)
% Maximal formula atoms : 132 ( 7 avg)
% Number of connectives : 574 ( 213 ~; 200 |; 59 &)
% ( 19 <=>; 83 =>; 0 <=; 0 <~>)
% Maximal formula depth : 54 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 24 ( 24 usr; 6 con; 0-7 aty)
% Number of variables : 225 ( 31 sgn 105 !; 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/tmp/tmp.LVTA1lYPBt/E---3.1_21479.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).
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/tmp/tmp.LVTA1lYPBt/E---3.1_21479.p',conj_thm_2EquantHeuristics_2EGUESS__REWRITES) ).
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/tmp/tmp.LVTA1lYPBt/E---3.1_21479.p',ap_tp) ).
fof(c_0_3,plain,
! [X21,X20,X10,X9] :
( epred4_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_4,plain,
! [X21,X20,X10,X9] :
( epred4_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_3]) ).
fof(c_0_5,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_6,plain,
! [X124,X125,X126,X127,X128,X131,X132,X135,X136,X137,X138,X140,X141,X142,X144,X145,X146,X149,X150,X151,X152,X155] :
( ( mem(esk7_5(X124,X125,X126,X127,X128),X127)
| ~ p(ap(X124,X128))
| ~ mem(X128,X126)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( p(ap(X124,ap(X125,esk7_5(X124,X125,X126,X127,X128))))
| ~ p(ap(X124,X128))
| ~ mem(X128,X126)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( mem(esk8_4(X124,X125,X126,X127),X126)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( p(ap(X124,esk8_4(X124,X125,X126,X127)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ mem(X131,X127)
| ~ p(ap(X124,ap(X125,X131)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( mem(esk9_5(X124,X125,X126,X127,X132),X127)
| p(ap(X124,X132))
| ~ mem(X132,X126)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ p(ap(X124,ap(X125,esk9_5(X124,X125,X126,X127,X132))))
| p(ap(X124,X132))
| ~ mem(X132,X126)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( mem(esk10_4(X124,X125,X126,X127),X126)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ p(ap(X124,esk10_4(X124,X125,X126,X127)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ mem(X135,X127)
| p(ap(X124,ap(X125,X135)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X127,X126),X125),X124))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X127,X126),X136),X137))
| ~ mem(X138,X127)
| p(ap(X137,ap(X136,X138)))
| ~ mem(X137,arr(X126,bool))
| ~ mem(X136,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( mem(esk11_6(X124,X125,X126,X127,X136,X137),X127)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X127,X126),X136),X137))
| ~ mem(X137,arr(X126,bool))
| ~ mem(X136,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ p(ap(X137,ap(X136,esk11_6(X124,X125,X126,X127,X136,X137))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X127,X126),X136),X137))
| ~ mem(X137,arr(X126,bool))
| ~ mem(X136,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X127,X126),X140),X141))
| ~ mem(X142,X127)
| ~ p(ap(X141,ap(X140,X142)))
| ~ mem(X141,arr(X126,bool))
| ~ mem(X140,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( mem(esk12_6(X124,X125,X126,X127,X140,X141),X127)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X127,X126),X140),X141))
| ~ mem(X141,arr(X126,bool))
| ~ mem(X140,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( p(ap(X141,ap(X140,esk12_6(X124,X125,X126,X127,X140,X141))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X127,X126),X140),X141))
| ~ mem(X141,arr(X126,bool))
| ~ mem(X140,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( mem(esk13_7(X124,X125,X126,X127,X144,X145,X146),X127)
| ~ p(ap(X145,X146))
| ~ mem(X146,X126)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X127,X126),X144),X145))
| ~ mem(X145,arr(X126,bool))
| ~ mem(X144,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( X146 = ap(X144,esk13_7(X124,X125,X126,X127,X144,X145,X146))
| ~ p(ap(X145,X146))
| ~ mem(X146,X126)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X127,X126),X144),X145))
| ~ mem(X145,arr(X126,bool))
| ~ mem(X144,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( mem(esk14_6(X124,X125,X126,X127,X144,X145),X126)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X127,X126),X144),X145))
| ~ mem(X145,arr(X126,bool))
| ~ mem(X144,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( p(ap(X145,esk14_6(X124,X125,X126,X127,X144,X145)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X127,X126),X144),X145))
| ~ mem(X145,arr(X126,bool))
| ~ mem(X144,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ mem(X149,X127)
| esk14_6(X124,X125,X126,X127,X144,X145) != ap(X144,X149)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X127,X126),X144),X145))
| ~ mem(X145,arr(X126,bool))
| ~ mem(X144,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( mem(esk15_7(X124,X125,X126,X127,X150,X151,X152),X127)
| p(ap(X151,X152))
| ~ mem(X152,X126)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X127,X126),X150),X151))
| ~ mem(X151,arr(X126,bool))
| ~ mem(X150,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( X152 = ap(X150,esk15_7(X124,X125,X126,X127,X150,X151,X152))
| p(ap(X151,X152))
| ~ mem(X152,X126)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X127,X126),X150),X151))
| ~ mem(X151,arr(X126,bool))
| ~ mem(X150,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( mem(esk16_6(X124,X125,X126,X127,X150,X151),X126)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X127,X126),X150),X151))
| ~ mem(X151,arr(X126,bool))
| ~ mem(X150,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ p(ap(X151,esk16_6(X124,X125,X126,X127,X150,X151)))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X127,X126),X150),X151))
| ~ mem(X151,arr(X126,bool))
| ~ mem(X150,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) )
& ( ~ mem(X155,X127)
| esk16_6(X124,X125,X126,X127,X150,X151) != ap(X150,X155)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X127,X126),X150),X151))
| ~ mem(X151,arr(X126,bool))
| ~ mem(X150,arr(X127,X126))
| ~ epred4_4(X127,X126,X125,X124) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X52] :
( ne(esk1_0)
& ne(esk2_0)
& mem(esk3_0,arr(esk2_0,esk1_0))
& mem(esk4_0,arr(esk1_0,bool))
& mem(esk5_0,arr(esk1_0,bool))
& ( ~ mem(X52,esk1_0)
| ~ p(ap(esk5_0,X52))
| p(ap(esk4_0,X52)) )
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk2_0,esk1_0),esk3_0),esk4_0))
& ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk2_0,esk1_0),esk3_0),esk5_0)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_8,plain,
( p(ap(X1,ap(X2,esk12_6(X3,X4,X5,X6,X2,X1))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X6,X5),X2),X1))
| ~ mem(X1,arr(X5,bool))
| ~ mem(X2,arr(X6,X5))
| ~ epred4_4(X6,X5,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
mem(esk5_0,arr(esk1_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( p(ap(esk5_0,ap(X1,esk12_6(X2,X3,esk1_0,X4,X1,esk5_0))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X4,esk1_0),X1),esk5_0))
| ~ epred4_4(X4,esk1_0,X3,X2)
| ~ mem(X1,arr(X4,esk1_0)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
mem(esk3_0,arr(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk2_0,esk1_0),esk3_0),esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( mem(esk12_6(X1,X2,X3,X4,X5,X6),X4)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X4,X3),X5),X6))
| ~ mem(X6,arr(X3,bool))
| ~ mem(X5,arr(X4,X3))
| ~ epred4_4(X4,X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X2,X5),X4),X3))
| ~ mem(X1,X2)
| ~ p(ap(X3,ap(X4,X1)))
| ~ epred4_4(X2,X5,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( p(ap(esk5_0,ap(esk3_0,esk12_6(X1,X2,esk1_0,esk2_0,esk3_0,esk5_0))))
| ~ epred4_4(esk2_0,esk1_0,X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,esk1_0),X2),esk5_0))
| mem(esk12_6(X3,X4,esk1_0,X1,X2,esk5_0),X1)
| ~ epred4_4(X1,esk1_0,X4,X3)
| ~ mem(X2,arr(X1,esk1_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
fof(c_0_17,plain,
! [X9] :
( ne(X9)
=> ! [X10] :
( ne(X10)
=> ! [X20] :
( mem(X20,arr(X9,X10))
=> ! [X21] :
( mem(X21,arr(X10,bool))
=> epred4_4(X9,X10,X20,X21) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[conj_thm_2EquantHeuristics_2EGUESS__REWRITES]),c_0_3]) ).
cnf(c_0_18,plain,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X1,X2),esk3_0),esk5_0))
| ~ epred4_4(X1,X2,esk3_0,esk5_0)
| ~ epred4_4(esk2_0,esk1_0,X3,X4)
| ~ mem(esk12_6(X4,X3,esk1_0,esk2_0,esk3_0,esk5_0),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( mem(esk12_6(X1,X2,esk1_0,esk2_0,esk3_0,esk5_0),esk2_0)
| ~ epred4_4(esk2_0,esk1_0,X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_12]) ).
fof(c_0_20,plain,
! [X96,X97,X98,X99] :
( ~ ne(X96)
| ~ ne(X97)
| ~ mem(X98,arr(X96,X97))
| ~ mem(X99,arr(X97,bool))
| epred4_4(X96,X97,X98,X99) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_21,negated_conjecture,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(esk2_0,X1),esk3_0),esk5_0))
| ~ epred4_4(esk2_0,X1,esk3_0,esk5_0)
| ~ epred4_4(esk2_0,esk1_0,X2,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( epred4_4(X1,X2,X3,X4)
| ~ ne(X1)
| ~ ne(X2)
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
ne(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(esk2_0,X1),esk3_0),esk5_0))
| ~ epred4_4(esk2_0,esk1_0,X2,X3)
| ~ mem(esk5_0,arr(X1,bool))
| ~ mem(esk3_0,arr(esk2_0,X1))
| ~ ne(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
ne(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_26,plain,
! [X85,X86,X87,X88] :
( ~ mem(X87,arr(X85,X86))
| ~ mem(X88,X85)
| mem(ap(X87,X88),X86) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
cnf(c_0_27,negated_conjecture,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(esk2_0,esk1_0),esk3_0),esk5_0))
| ~ epred4_4(esk2_0,esk1_0,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_9]),c_0_11]),c_0_25])]) ).
cnf(c_0_28,plain,
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X4))
| ~ mem(X5,X1)
| ~ p(ap(X4,ap(X3,X5)))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,X2))
| ~ epred4_4(X1,X2,X6,X7) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,negated_conjecture,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk2_0,esk1_0),esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,negated_conjecture,
mem(esk4_0,arr(esk1_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_31,negated_conjecture,
( p(ap(esk4_0,X1))
| ~ mem(X1,esk1_0)
| ~ p(ap(esk5_0,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,plain,
( p(ap(X1,ap(X2,esk7_5(X1,X2,X3,X4,X5))))
| ~ p(ap(X1,X5))
| ~ mem(X5,X3)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X4,X3),X2),X1))
| ~ epred4_4(X4,X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_33,plain,
( mem(ap(X1,X4),X3)
| ~ mem(X1,arr(X2,X3))
| ~ mem(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,negated_conjecture,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(esk2_0,esk1_0),esk3_0),esk5_0))
| ~ mem(X1,arr(esk1_0,bool))
| ~ mem(X2,arr(esk2_0,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_25]),c_0_23])]) ).
cnf(c_0_35,negated_conjecture,
( ~ epred4_4(esk2_0,esk1_0,X1,X2)
| ~ p(ap(esk4_0,ap(esk3_0,X3)))
| ~ mem(X3,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_11])]) ).
cnf(c_0_36,negated_conjecture,
( p(ap(esk4_0,ap(X1,esk7_5(esk5_0,X1,X2,X3,X4))))
| ~ epred4_4(X3,X2,X1,esk5_0)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X3,X2),X1),esk5_0))
| ~ p(ap(esk5_0,X4))
| ~ mem(ap(X1,esk7_5(esk5_0,X1,X2,X3,X4)),esk1_0)
| ~ mem(X4,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( mem(ap(esk3_0,X1),esk1_0)
| ~ mem(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_11]) ).
cnf(c_0_38,negated_conjecture,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(esk2_0,esk1_0),esk3_0),esk5_0))
| ~ mem(X1,arr(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_9]) ).
cnf(c_0_39,negated_conjecture,
( ~ epred4_4(esk2_0,esk1_0,X1,X2)
| ~ epred4_4(X3,X4,esk3_0,esk5_0)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X3,X4),esk3_0),esk5_0))
| ~ p(ap(esk5_0,X5))
| ~ mem(esk7_5(esk5_0,esk3_0,X4,X3,X5),esk2_0)
| ~ mem(X5,X4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(esk2_0,esk1_0),esk3_0),esk5_0)),
inference(spm,[status(thm)],[c_0_38,c_0_11]) ).
cnf(c_0_41,negated_conjecture,
( ~ epred4_4(esk2_0,esk1_0,esk3_0,esk5_0)
| ~ epred4_4(esk2_0,esk1_0,X1,X2)
| ~ p(ap(esk5_0,X3))
| ~ mem(esk7_5(esk5_0,esk3_0,esk1_0,esk2_0,X3),esk2_0)
| ~ mem(X3,esk1_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( ~ epred4_4(esk2_0,esk1_0,X1,X2)
| ~ p(ap(esk5_0,X3))
| ~ mem(esk7_5(esk5_0,esk3_0,esk1_0,esk2_0,X3),esk2_0)
| ~ mem(X3,esk1_0) ),
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_41,c_0_22]),c_0_9]),c_0_11]),c_0_25]),c_0_23])]) ).
cnf(c_0_43,plain,
( mem(esk7_5(X1,X2,X3,X4,X5),X4)
| ~ p(ap(X1,X5))
| ~ mem(X5,X3)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X4,X3),X2),X1))
| ~ epred4_4(X4,X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_44,plain,
( ~ epred4_4(esk2_0,esk1_0,esk3_0,esk5_0)
| ~ epred4_4(esk2_0,esk1_0,X1,X2)
| ~ p(ap(esk5_0,X3))
| ~ mem(X3,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_40])]) ).
cnf(c_0_45,plain,
( ~ epred4_4(esk2_0,esk1_0,X1,X2)
| ~ p(ap(esk5_0,X3))
| ~ mem(X3,esk1_0) ),
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_44,c_0_22]),c_0_9]),c_0_11]),c_0_25]),c_0_23])]) ).
cnf(c_0_46,plain,
( ~ p(ap(esk5_0,X1))
| ~ mem(X2,arr(esk1_0,bool))
| ~ mem(X3,arr(esk2_0,esk1_0))
| ~ mem(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_22]),c_0_25]),c_0_23])]) ).
cnf(c_0_47,negated_conjecture,
( ~ p(ap(esk5_0,X1))
| ~ mem(X2,arr(esk2_0,esk1_0))
| ~ mem(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_9]) ).
cnf(c_0_48,negated_conjecture,
( ~ p(ap(esk5_0,X1))
| ~ mem(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_11]) ).
cnf(c_0_49,negated_conjecture,
( ~ epred4_4(esk2_0,esk1_0,X1,X2)
| ~ mem(ap(esk3_0,esk12_6(X2,X1,esk1_0,esk2_0,esk3_0,esk5_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_15]) ).
cnf(c_0_50,negated_conjecture,
~ epred4_4(esk2_0,esk1_0,X1,X2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_37]),c_0_19]) ).
cnf(c_0_51,negated_conjecture,
( ~ mem(X1,arr(esk1_0,bool))
| ~ mem(X2,arr(esk2_0,esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_22]),c_0_25]),c_0_23])]) ).
cnf(c_0_52,negated_conjecture,
~ mem(X1,arr(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_51,c_0_9]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : ITP006+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.09/0.14 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n018.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Fri May 3 12:31:46 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.LVTA1lYPBt/E---3.1_21479.p
% 2.81/0.82 # Version: 3.1.0
% 2.81/0.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.81/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.81/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.81/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.81/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.81/0.82 # Starting sh5l with 300s (1) cores
% 2.81/0.82 # new_bool_1 with pid 21559 completed with status 0
% 2.81/0.82 # Result found by new_bool_1
% 2.81/0.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.81/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.81/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.81/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.81/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.81/0.82 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.81/0.82 # Search class: FGHSF-FFMM33-MFFFFFNN
% 2.81/0.82 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.81/0.82 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 2.81/0.82 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 21563 completed with status 0
% 2.81/0.82 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.81/0.82 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.81/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.81/0.82 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.81/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.81/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.81/0.82 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.81/0.82 # Search class: FGHSF-FFMM33-MFFFFFNN
% 2.81/0.82 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.81/0.82 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 2.81/0.82 # Preprocessing time : 0.002 s
% 2.81/0.82 # Presaturation interreduction done
% 2.81/0.82
% 2.81/0.82 # Proof found!
% 2.81/0.82 # SZS status Theorem
% 2.81/0.82 # SZS output start CNFRefutation
% See solution above
% 2.81/0.82 # Parsed axioms : 52
% 2.81/0.82 # Removed by relevancy pruning/SinE : 22
% 2.81/0.82 # Initial clauses : 288
% 2.81/0.82 # Removed in clause preprocessing : 213
% 2.81/0.82 # Initial clauses in saturation : 75
% 2.81/0.82 # Processed clauses : 1281
% 2.81/0.82 # ...of these trivial : 1
% 2.81/0.82 # ...subsumed : 346
% 2.81/0.82 # ...remaining for further processing : 934
% 2.81/0.82 # Other redundant clauses eliminated : 4
% 2.81/0.82 # Clauses deleted for lack of memory : 0
% 2.81/0.82 # Backward-subsumed : 229
% 2.81/0.82 # Backward-rewritten : 182
% 2.81/0.82 # Generated clauses : 6024
% 2.81/0.82 # ...of the previous two non-redundant : 5677
% 2.81/0.82 # ...aggressively subsumed : 0
% 2.81/0.82 # Contextual simplify-reflections : 90
% 2.81/0.82 # Paramodulations : 6015
% 2.81/0.82 # Factorizations : 3
% 2.81/0.82 # NegExts : 0
% 2.81/0.82 # Equation resolutions : 5
% 2.81/0.82 # Disequality decompositions : 0
% 2.81/0.82 # Total rewrite steps : 548
% 2.81/0.82 # ...of those cached : 536
% 2.81/0.82 # Propositional unsat checks : 0
% 2.81/0.82 # Propositional check models : 0
% 2.81/0.82 # Propositional check unsatisfiable : 0
% 2.81/0.82 # Propositional clauses : 0
% 2.81/0.82 # Propositional clauses after purity: 0
% 2.81/0.82 # Propositional unsat core size : 0
% 2.81/0.82 # Propositional preprocessing time : 0.000
% 2.81/0.82 # Propositional encoding time : 0.000
% 2.81/0.82 # Propositional solver time : 0.000
% 2.81/0.82 # Success case prop preproc time : 0.000
% 2.81/0.82 # Success case prop encoding time : 0.000
% 2.81/0.82 # Success case prop solver time : 0.000
% 2.81/0.82 # Current number of processed clauses : 465
% 2.81/0.82 # Positive orientable unit clauses : 12
% 2.81/0.82 # Positive unorientable unit clauses: 0
% 2.81/0.82 # Negative unit clauses : 3
% 2.81/0.82 # Non-unit-clauses : 450
% 2.81/0.82 # Current number of unprocessed clauses: 4325
% 2.81/0.82 # ...number of literals in the above : 31205
% 2.81/0.82 # Current number of archived formulas : 0
% 2.81/0.82 # Current number of archived clauses : 469
% 2.81/0.82 # Clause-clause subsumption calls (NU) : 130229
% 2.81/0.82 # Rec. Clause-clause subsumption calls : 8046
% 2.81/0.82 # Non-unit clause-clause subsumptions : 587
% 2.81/0.82 # Unit Clause-clause subsumption calls : 1263
% 2.81/0.82 # Rewrite failures with RHS unbound : 0
% 2.81/0.82 # BW rewrite match attempts : 81
% 2.81/0.82 # BW rewrite match successes : 6
% 2.81/0.82 # Condensation attempts : 0
% 2.81/0.82 # Condensation successes : 0
% 2.81/0.82 # Termbank termtop insertions : 334685
% 2.81/0.82 # Search garbage collected termcells : 4262
% 2.81/0.82
% 2.81/0.82 # -------------------------------------------------
% 2.81/0.82 # User time : 0.344 s
% 2.81/0.82 # System time : 0.004 s
% 2.81/0.82 # Total time : 0.348 s
% 2.81/0.82 # Maximum resident set size: 2544 pages
% 2.81/0.82
% 2.81/0.82 # -------------------------------------------------
% 2.81/0.82 # User time : 0.347 s
% 2.81/0.82 # System time : 0.006 s
% 2.81/0.82 # Total time : 0.352 s
% 2.81/0.82 # Maximum resident set size: 1812 pages
% 2.81/0.82 % E---3.1 exiting
% 2.81/0.82 % E exiting
%------------------------------------------------------------------------------