TSTP Solution File: ITP012+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ITP012+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:09 EDT 2022
% Result : Theorem 8.24s 2.32s
% Output : CNFRefutation 8.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 32 ( 14 unt; 2 nHn; 32 RR)
% Number of literals : 82 ( 2 equ; 52 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_1) ).
cnf(i_0_135,plain,
mem(c_2Einteger_2Eint__neg,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_135) ).
cnf(i_0_68,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X3))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__add,X2),X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_68) ).
cnf(i_0_23,plain,
( ap(ap(c_2Einteger_2Eint__add,X1),ap(c_2Einteger_2Eint__neg,X2)) = ap(ap(c_2Einteger_2Eint__sub,X1),X2)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_23) ).
cnf(i_0_69,negated_conjecture,
( p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),esk10_0))
| p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),ap(ap(c_2Einteger_2Eint__sub,esk10_0),esk9_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_69) ).
cnf(i_0_72,negated_conjecture,
mem(esk10_0,ty_2Einteger_2Eint),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_72) ).
cnf(i_0_74,negated_conjecture,
mem(esk8_0,ty_2Einteger_2Eint),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_74) ).
cnf(i_0_73,negated_conjecture,
mem(esk9_0,ty_2Einteger_2Eint),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_73) ).
cnf(i_0_65,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X2)))
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_65) ).
cnf(i_0_71,negated_conjecture,
p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),esk9_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_71) ).
cnf(i_0_70,negated_conjecture,
( ~ p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),esk10_0))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),ap(ap(c_2Einteger_2Eint__sub,esk10_0),esk9_0))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_70) ).
cnf(i_0_67,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__add,X2),X3)))
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X3))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h9irx4kf/input.p',i_0_67) ).
cnf(c_0_148,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
i_0_1 ).
cnf(c_0_149,plain,
mem(c_2Einteger_2Eint__neg,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint)),
i_0_135 ).
cnf(c_0_150,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X3))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__add,X2),X3))) ),
i_0_68 ).
cnf(c_0_151,plain,
( ap(ap(c_2Einteger_2Eint__add,X1),ap(c_2Einteger_2Eint__neg,X2)) = ap(ap(c_2Einteger_2Eint__sub,X1),X2)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint) ),
i_0_23 ).
cnf(c_0_152,plain,
( mem(ap(c_2Einteger_2Eint__neg,X1),ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint) ),
inference(spm,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_153,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__sub,X2),X3)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_152]) ).
cnf(c_0_154,negated_conjecture,
( p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),esk10_0))
| p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),ap(ap(c_2Einteger_2Eint__sub,esk10_0),esk9_0))) ),
i_0_69 ).
cnf(c_0_155,negated_conjecture,
mem(esk10_0,ty_2Einteger_2Eint),
i_0_72 ).
cnf(c_0_156,negated_conjecture,
mem(esk8_0,ty_2Einteger_2Eint),
i_0_74 ).
cnf(c_0_157,negated_conjecture,
mem(esk9_0,ty_2Einteger_2Eint),
i_0_73 ).
cnf(c_0_158,negated_conjecture,
( p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),esk10_0))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),ap(c_2Einteger_2Eint__neg,esk9_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_155]),c_0_156]),c_0_157])]) ).
cnf(c_0_159,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X2)))
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)) ),
i_0_65 ).
cnf(c_0_160,negated_conjecture,
p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),esk9_0)),
i_0_71 ).
cnf(c_0_161,negated_conjecture,
( ~ p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),esk10_0))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),ap(ap(c_2Einteger_2Eint__sub,esk10_0),esk9_0))) ),
i_0_70 ).
cnf(c_0_162,plain,
p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),esk10_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_159]),c_0_157]),c_0_156]),c_0_160])]) ).
cnf(c_0_163,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__add,X2),X3)))
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X3))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)) ),
i_0_67 ).
cnf(c_0_164,negated_conjecture,
~ p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),ap(ap(c_2Einteger_2Eint__sub,esk10_0),esk9_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_161,c_0_162])]) ).
cnf(c_0_165,plain,
( p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__sub,X2),X3)))
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X3)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_151]),c_0_152]) ).
cnf(c_0_166,negated_conjecture,
~ p(ap(ap(c_2Einteger_2Eint__divides,esk8_0),ap(c_2Einteger_2Eint__neg,esk9_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_164,c_0_165]),c_0_155]),c_0_156]),c_0_157]),c_0_162])]) ).
cnf(c_0_167,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_159]),c_0_157]),c_0_156]),c_0_160])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : ITP012+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.02/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.30 % Computer : n024.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Fri Jun 3 02:53:37 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.15/0.40 # ENIGMATIC: Selected SinE mode:
% 0.15/0.41 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.15/0.41 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.15/0.41 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.24/2.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.24/2.32 # Version: 2.1pre011
% 8.24/2.32 # Preprocessing time : 0.023 s
% 8.24/2.32
% 8.24/2.32 # Proof found!
% 8.24/2.32 # SZS status Theorem
% 8.24/2.32 # SZS output start CNFRefutation
% See solution above
% 8.24/2.32 # Proof object total steps : 32
% 8.24/2.32 # Proof object clause steps : 20
% 8.24/2.32 # Proof object formula steps : 12
% 8.24/2.32 # Proof object conjectures : 15
% 8.24/2.32 # Proof object clause conjectures : 9
% 8.24/2.32 # Proof object formula conjectures : 6
% 8.24/2.32 # Proof object initial clauses used : 12
% 8.24/2.32 # Proof object initial formulas used : 12
% 8.24/2.32 # Proof object generating inferences : 7
% 8.24/2.32 # Proof object simplifying inferences : 21
% 8.24/2.32 # Training examples: 0 positive, 0 negative
% 8.24/2.32 # Parsed axioms : 105
% 8.24/2.32 # Removed by relevancy pruning/SinE : 0
% 8.24/2.32 # Initial clauses : 105
% 8.24/2.32 # Removed in clause preprocessing : 0
% 8.24/2.32 # Initial clauses in saturation : 105
% 8.24/2.32 # Processed clauses : 147
% 8.24/2.32 # ...of these trivial : 0
% 8.24/2.32 # ...subsumed : 23
% 8.24/2.32 # ...remaining for further processing : 124
% 8.24/2.32 # Other redundant clauses eliminated : 3
% 8.24/2.32 # Clauses deleted for lack of memory : 0
% 8.24/2.32 # Backward-subsumed : 0
% 8.24/2.32 # Backward-rewritten : 5
% 8.24/2.32 # Generated clauses : 456
% 8.24/2.32 # ...of the previous two non-trivial : 425
% 8.24/2.32 # Contextual simplify-reflections : 44
% 8.24/2.32 # Paramodulations : 451
% 8.24/2.32 # Factorizations : 1
% 8.24/2.32 # Equation resolutions : 4
% 8.24/2.32 # Propositional unsat checks : 0
% 8.24/2.32 # Propositional unsat check successes : 0
% 8.24/2.32 # Current number of processed clauses : 118
% 8.24/2.32 # Positive orientable unit clauses : 19
% 8.24/2.32 # Positive unorientable unit clauses: 0
% 8.24/2.32 # Negative unit clauses : 3
% 8.24/2.32 # Non-unit-clauses : 96
% 8.24/2.32 # Current number of unprocessed clauses: 379
% 8.24/2.32 # ...number of literals in the above : 2428
% 8.24/2.32 # Current number of archived formulas : 0
% 8.24/2.32 # Current number of archived clauses : 5
% 8.24/2.32 # Clause-clause subsumption calls (NU) : 3356
% 8.24/2.32 # Rec. Clause-clause subsumption calls : 625
% 8.24/2.32 # Non-unit clause-clause subsumptions : 66
% 8.24/2.32 # Unit Clause-clause subsumption calls : 22
% 8.24/2.32 # Rewrite failures with RHS unbound : 0
% 8.24/2.32 # BW rewrite match attempts : 1
% 8.24/2.32 # BW rewrite match successes : 1
% 8.24/2.32 # Condensation attempts : 0
% 8.24/2.32 # Condensation successes : 0
% 8.24/2.32 # Termbank termtop insertions : 16763
% 8.24/2.32
% 8.24/2.32 # -------------------------------------------------
% 8.24/2.32 # User time : 0.031 s
% 8.24/2.32 # System time : 0.006 s
% 8.24/2.32 # Total time : 0.037 s
% 8.24/2.32 # ...preprocessing : 0.023 s
% 8.24/2.32 # ...main loop : 0.014 s
% 8.24/2.32 # Maximum resident set size: 7128 pages
% 8.24/2.32
%------------------------------------------------------------------------------