%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ITP006+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:34:00 EDT 2022
% Result : Theorem 9.55s 2.65s
% Output : CNFRefutation 9.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of clauses : 50 ( 18 unt; 15 nHn; 44 RR)
% Number of literals : 128 ( 0 equ; 71 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-6 aty)
% Number of variables : 109 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_150,plain,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X4))
| p(ap(X4,ap(X3,esk14_6(X5,X6,X2,X1,X3,X4))))
| ~ epred3_4(X1,X2,X6,X5)
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_150) ).
cnf(i_0_66,negated_conjecture,
mem(esk7_0,arr(esk3_0,bool)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_66) ).
cnf(i_0_68,negated_conjecture,
mem(esk5_0,arr(esk4_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_68) ).
cnf(i_0_63,negated_conjecture,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk4_0,esk3_0),esk5_0),esk7_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_63) ).
cnf(i_0_225,plain,
( p(X1)
| epred5_3(X2,X3,X1)
| ~ p(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_225) ).
cnf(i_0_62,plain,
( epred3_4(X1,X2,X3,X4)
| ~ ne(X2)
| ~ ne(X1)
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_62) ).
cnf(i_0_70,negated_conjecture,
ne(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_70) ).
cnf(i_0_69,negated_conjecture,
ne(esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_69) ).
cnf(i_0_240,plain,
( p(X1)
| p(X2)
| p(X3)
| ~ epred5_3(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_240) ).
cnf(i_0_152,plain,
( ~ mem(X1,X2)
| ~ epred3_4(X2,X3,X4,X5)
| ~ mem(X6,arr(X2,X3))
| ~ mem(X7,arr(X3,bool))
| ~ p(ap(X7,ap(X6,X1)))
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X2,X3),X6),X7)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_152) ).
cnf(i_0_64,negated_conjecture,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk4_0,esk3_0),esk5_0),esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_64) ).
cnf(i_0_67,negated_conjecture,
mem(esk6_0,arr(esk3_0,bool)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_67) ).
cnf(i_0_65,negated_conjecture,
( p(ap(esk6_0,X1))
| ~ mem(X1,esk3_0)
| ~ p(ap(esk7_0,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_65) ).
cnf(i_0_1,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_1) ).
cnf(i_0_151,plain,
( mem(esk14_6(X1,X2,X3,X4,X5,X6),X4)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X4,X3),X5),X6))
| ~ epred3_4(X4,X3,X2,X1)
| ~ mem(X5,arr(X4,X3))
| ~ mem(X6,arr(X3,bool)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gi15b56n/input.p',i_0_151) ).
cnf(c_0_256,plain,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X4))
| p(ap(X4,ap(X3,esk14_6(X5,X6,X2,X1,X3,X4))))
| ~ epred3_4(X1,X2,X6,X5)
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool)) ),
i_0_150 ).
cnf(c_0_257,negated_conjecture,
mem(esk7_0,arr(esk3_0,bool)),
i_0_66 ).
cnf(c_0_258,negated_conjecture,
( p(ap(esk7_0,ap(X1,esk14_6(X2,X3,esk3_0,X4,X1,esk7_0))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X4,esk3_0),X1),esk7_0))
| ~ epred3_4(X4,esk3_0,X3,X2)
| ~ mem(X1,arr(X4,esk3_0)) ),
inference(spm,[status(thm)],[c_0_256,c_0_257]) ).
cnf(c_0_259,negated_conjecture,
mem(esk5_0,arr(esk4_0,esk3_0)),
i_0_68 ).
cnf(c_0_260,negated_conjecture,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk4_0,esk3_0),esk5_0),esk7_0)),
i_0_63 ).
cnf(c_0_261,plain,
( p(X1)
| epred5_3(X2,X3,X1)
| ~ p(X3) ),
i_0_225 ).
cnf(c_0_262,negated_conjecture,
( p(ap(esk7_0,ap(esk5_0,esk14_6(X1,X2,esk3_0,esk4_0,esk5_0,esk7_0))))
| ~ epred3_4(esk4_0,esk3_0,X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_258,c_0_259]),c_0_260]) ).
cnf(c_0_263,plain,
( epred5_3(X1,ap(esk7_0,ap(esk5_0,esk14_6(X2,X3,esk3_0,esk4_0,esk5_0,esk7_0))),X4)
| p(X4)
| ~ epred3_4(esk4_0,esk3_0,X3,X2) ),
inference(spm,[status(thm)],[c_0_261,c_0_262]) ).
cnf(c_0_264,plain,
( epred3_4(X1,X2,X3,X4)
| ~ ne(X2)
| ~ ne(X1)
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool)) ),
i_0_62 ).
cnf(c_0_265,negated_conjecture,
ne(esk3_0),
i_0_70 ).
cnf(c_0_266,negated_conjecture,
ne(esk4_0),
i_0_69 ).
cnf(c_0_267,plain,
( p(X1)
| p(X2)
| p(X3)
| ~ epred5_3(X3,X2,X1) ),
i_0_240 ).
cnf(c_0_268,plain,
( epred5_3(X1,ap(esk7_0,ap(esk5_0,esk14_6(X2,X3,esk3_0,esk4_0,esk5_0,esk7_0))),X4)
| p(X4)
| ~ mem(X2,arr(esk3_0,bool))
| ~ mem(X3,arr(esk4_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_264]),c_0_265]),c_0_266])]) ).
cnf(c_0_269,plain,
( p(X1)
| p(X2)
| ~ epred5_3(X1,X2,X2) ),
inference(ef,[status(thm)],[c_0_267]) ).
cnf(c_0_270,negated_conjecture,
( epred5_3(X1,ap(esk7_0,ap(esk5_0,esk14_6(esk7_0,X2,esk3_0,esk4_0,esk5_0,esk7_0))),X3)
| p(X3)
| ~ mem(X2,arr(esk4_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_268,c_0_257]) ).
cnf(c_0_271,plain,
( p(X1)
| ~ epred5_3(X1,X1,X1) ),
inference(ef,[status(thm)],[c_0_269]) ).
cnf(c_0_272,negated_conjecture,
( epred5_3(X1,ap(esk7_0,ap(esk5_0,esk14_6(esk7_0,esk5_0,esk3_0,esk4_0,esk5_0,esk7_0))),X2)
| p(X2) ),
inference(spm,[status(thm)],[c_0_270,c_0_259]) ).
cnf(c_0_273,plain,
( ~ mem(X1,X2)
| ~ epred3_4(X2,X3,X4,X5)
| ~ mem(X6,arr(X2,X3))
| ~ mem(X7,arr(X3,bool))
| ~ p(ap(X7,ap(X6,X1)))
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X2,X3),X6),X7)) ),
i_0_152 ).
cnf(c_0_274,negated_conjecture,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk4_0,esk3_0),esk5_0),esk6_0)),
i_0_64 ).
cnf(c_0_275,negated_conjecture,
mem(esk6_0,arr(esk3_0,bool)),
i_0_67 ).
cnf(c_0_276,negated_conjecture,
( p(ap(esk6_0,X1))
| ~ mem(X1,esk3_0)
| ~ p(ap(esk7_0,X1)) ),
i_0_65 ).
cnf(c_0_277,plain,
p(ap(esk7_0,ap(esk5_0,esk14_6(esk7_0,esk5_0,esk3_0,esk4_0,esk5_0,esk7_0)))),
inference(spm,[status(thm)],[c_0_271,c_0_272]) ).
cnf(c_0_278,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
i_0_1 ).
cnf(c_0_279,plain,
( mem(esk14_6(X1,X2,X3,X4,X5,X6),X4)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X4,X3),X5),X6))
| ~ epred3_4(X4,X3,X2,X1)
| ~ mem(X5,arr(X4,X3))
| ~ mem(X6,arr(X3,bool)) ),
i_0_151 ).
cnf(c_0_280,negated_conjecture,
( ~ epred3_4(esk4_0,esk3_0,X1,X2)
| ~ mem(X3,esk4_0)
| ~ p(ap(esk6_0,ap(esk5_0,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_273,c_0_274]),c_0_275]),c_0_259])]) ).
cnf(c_0_281,negated_conjecture,
( p(ap(esk6_0,ap(esk5_0,esk14_6(esk7_0,esk5_0,esk3_0,esk4_0,esk5_0,esk7_0))))
| ~ mem(ap(esk5_0,esk14_6(esk7_0,esk5_0,esk3_0,esk4_0,esk5_0,esk7_0)),esk3_0) ),
inference(spm,[status(thm)],[c_0_276,c_0_277]) ).
cnf(c_0_282,negated_conjecture,
( mem(ap(esk5_0,X1),esk3_0)
| ~ mem(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_278,c_0_259]) ).
cnf(c_0_283,negated_conjecture,
( mem(esk14_6(X1,X2,esk3_0,X3,X4,esk7_0),X3)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X3,esk3_0),X4),esk7_0))
| ~ epred3_4(X3,esk3_0,X2,X1)
| ~ mem(X4,arr(X3,esk3_0)) ),
inference(spm,[status(thm)],[c_0_279,c_0_257]) ).
cnf(c_0_284,negated_conjecture,
( ~ epred3_4(esk4_0,esk3_0,X1,X2)
| ~ mem(esk14_6(esk7_0,esk5_0,esk3_0,esk4_0,esk5_0,esk7_0),esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_280,c_0_281]),c_0_282]) ).
cnf(c_0_285,negated_conjecture,
( mem(esk14_6(X1,X2,esk3_0,esk4_0,esk5_0,esk7_0),esk4_0)
| ~ epred3_4(esk4_0,esk3_0,X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_283,c_0_259]),c_0_260]) ).
cnf(c_0_286,negated_conjecture,
( ~ epred3_4(esk4_0,esk3_0,esk5_0,esk7_0)
| ~ epred3_4(esk4_0,esk3_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_284,c_0_285]) ).
cnf(c_0_287,plain,
~ epred3_4(esk4_0,esk3_0,X1,X2),
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_286,c_0_264]),c_0_257]),c_0_259]),c_0_265]),c_0_266])]) ).
cnf(c_0_288,plain,
( ~ mem(X1,arr(esk3_0,bool))
| ~ mem(X2,arr(esk4_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_287,c_0_264]),c_0_265]),c_0_266])]) ).
cnf(c_0_289,negated_conjecture,
~ mem(X1,arr(esk4_0,esk3_0)),
inference(spm,[status(thm)],[c_0_288,c_0_257]) ).
cnf(c_0_290,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_259,c_0_289]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ITP006+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 2 21:06:40 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.55/2.65 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.55/2.65 # Version: 2.1pre011
% 9.55/2.65 # Preprocessing time : 0.020 s
% 9.55/2.65
% 9.55/2.65 # Proof found!
% 9.55/2.65 # SZS status Theorem
% 9.55/2.65 # SZS output start CNFRefutation
% See solution above
% 9.55/2.65 # Proof object total steps : 50
% 9.55/2.65 # Proof object clause steps : 35
% 9.55/2.65 # Proof object formula steps : 15
% 9.55/2.65 # Proof object conjectures : 29
% 9.55/2.65 # Proof object clause conjectures : 21
% 9.55/2.65 # Proof object formula conjectures : 8
% 9.55/2.65 # Proof object initial clauses used : 15
% 9.55/2.65 # Proof object initial formulas used : 15
% 9.55/2.65 # Proof object generating inferences : 19
% 9.55/2.65 # Proof object simplifying inferences : 18
% 9.55/2.65 # Training examples: 0 positive, 0 negative
% 9.55/2.65 # Parsed axioms : 110
% 9.55/2.65 # Removed by relevancy pruning/SinE : 0
% 9.55/2.65 # Initial clauses : 110
% 9.55/2.65 # Removed in clause preprocessing : 0
% 9.55/2.65 # Initial clauses in saturation : 110
% 9.55/2.65 # Processed clauses : 1498
% 9.55/2.65 # ...of these trivial : 9
% 9.55/2.65 # ...subsumed : 529
% 9.55/2.65 # ...remaining for further processing : 960
% 9.55/2.65 # Other redundant clauses eliminated : 3
% 9.55/2.65 # Clauses deleted for lack of memory : 0
% 9.55/2.65 # Backward-subsumed : 31
% 9.55/2.65 # Backward-rewritten : 33
% 9.55/2.65 # Generated clauses : 11288
% 9.55/2.65 # ...of the previous two non-trivial : 9986
% 9.55/2.65 # Contextual simplify-reflections : 419
% 9.55/2.65 # Paramodulations : 11219
% 9.55/2.65 # Factorizations : 64
% 9.55/2.65 # Equation resolutions : 4
% 9.55/2.65 # Propositional unsat checks : 0
% 9.55/2.65 # Propositional unsat check successes : 0
% 9.55/2.65 # Current number of processed clauses : 894
% 9.55/2.65 # Positive orientable unit clauses : 29
% 9.55/2.65 # Positive unorientable unit clauses: 0
% 9.55/2.65 # Negative unit clauses : 5
% 9.55/2.65 # Non-unit-clauses : 860
% 9.55/2.65 # Current number of unprocessed clauses: 8355
% 9.55/2.65 # ...number of literals in the above : 57348
% 9.55/2.65 # Current number of archived formulas : 0
% 9.55/2.65 # Current number of archived clauses : 65
% 9.55/2.65 # Clause-clause subsumption calls (NU) : 153694
% 9.55/2.65 # Rec. Clause-clause subsumption calls : 19780
% 9.55/2.65 # Non-unit clause-clause subsumptions : 811
% 9.55/2.65 # Unit Clause-clause subsumption calls : 1079
% 9.55/2.65 # Rewrite failures with RHS unbound : 0
% 9.55/2.65 # BW rewrite match attempts : 190
% 9.55/2.65 # BW rewrite match successes : 10
% 9.55/2.65 # Condensation attempts : 0
% 9.55/2.65 # Condensation successes : 0
% 9.55/2.65 # Termbank termtop insertions : 343219
% 9.55/2.65
% 9.55/2.65 # -------------------------------------------------
% 9.55/2.65 # User time : 0.365 s
% 9.55/2.65 # System time : 0.013 s
% 9.55/2.65 # Total time : 0.378 s
% 9.55/2.65 # ...preprocessing : 0.020 s
% 9.55/2.65 # ...main loop : 0.358 s
% 9.55/2.65 # Maximum resident set size: 17916 pages
% 9.55/2.65
%------------------------------------------------------------------------------