TSTP Solution File: ITP020+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ITP020+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:20 EDT 2022
% Result : Theorem 80.95s 11.72s
% Output : CNFRefutation 80.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 8 unt; 0 nHn; 28 RR)
% Number of literals : 84 ( 0 equ; 61 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_116,plain,
( p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),esk25_4(X2,X1,X3,X4)),X4),X3))
| ~ ne(X2)
| ~ ne(X1)
| ~ mem(X5,arr(X2,X1))
| ~ mem(X4,arr(X1,bool))
| ~ mem(X3,arr(X2,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X2,X1),X5),X3),X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqw60hzg/input.p',i_0_116) ).
cnf(i_0_164,plain,
p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),esk27_0),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqw60hzg/input.p',i_0_164) ).
cnf(i_0_165,plain,
mem(esk27_0,arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqw60hzg/input.p',i_0_165) ).
cnf(i_0_184,plain,
ne(ty_2Enum_2Enum),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqw60hzg/input.p',i_0_184) ).
cnf(i_0_117,plain,
( mem(esk25_4(X1,X2,X3,X4),arr(X2,X1))
| ~ ne(X2)
| ~ ne(X1)
| ~ mem(X5,arr(X1,X2))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),X5),X3),X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqw60hzg/input.p',i_0_117) ).
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-aqw60hzg/input.p',i_0_1) ).
cnf(i_0_182,plain,
( mem(c_2Epred__set_2ECROSS(X1,X2),arr(arr(X1,bool),arr(arr(X2,bool),arr(ty_2Epair_2Eprod(X1,X2),bool))))
| ~ ne(X2)
| ~ ne(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqw60hzg/input.p',i_0_182) ).
cnf(i_0_166,negated_conjecture,
( ~ mem(X1,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X1),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqw60hzg/input.p',i_0_166) ).
cnf(i_0_185,plain,
( ne(ty_2Epair_2Eprod(X1,X2))
| ~ ne(X2)
| ~ ne(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqw60hzg/input.p',i_0_185) ).
cnf(i_0_183,plain,
( mem(c_2Epred__set_2EUNIV(X1),arr(X1,bool))
| ~ ne(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aqw60hzg/input.p',i_0_183) ).
cnf(c_0_196,plain,
( p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),esk25_4(X2,X1,X3,X4)),X4),X3))
| ~ ne(X2)
| ~ ne(X1)
| ~ mem(X5,arr(X2,X1))
| ~ mem(X4,arr(X1,bool))
| ~ mem(X3,arr(X2,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X2,X1),X5),X3),X4)) ),
i_0_116 ).
cnf(c_0_197,plain,
p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),esk27_0),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),
i_0_164 ).
cnf(c_0_198,plain,
mem(esk27_0,arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum)),
i_0_165 ).
cnf(c_0_199,plain,
ne(ty_2Enum_2Enum),
i_0_184 ).
cnf(c_0_200,plain,
( mem(esk25_4(X1,X2,X3,X4),arr(X2,X1))
| ~ ne(X2)
| ~ ne(X1)
| ~ mem(X5,arr(X1,X2))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,bool))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),X5),X3),X4)) ),
i_0_117 ).
cnf(c_0_201,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
i_0_1 ).
cnf(c_0_202,plain,
( mem(c_2Epred__set_2ECROSS(X1,X2),arr(arr(X1,bool),arr(arr(X2,bool),arr(ty_2Epair_2Eprod(X1,X2),bool))))
| ~ ne(X2)
| ~ ne(X1) ),
i_0_182 ).
cnf(c_0_203,negated_conjecture,
( ~ mem(X1,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X1),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)))) ),
i_0_166 ).
cnf(c_0_204,plain,
( p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),esk25_4(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum,ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))))
| ~ mem(ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),bool))
| ~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_196,c_0_197]),c_0_198]),c_0_199])]) ).
cnf(c_0_205,plain,
( mem(esk25_4(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum,ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
| ~ mem(ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),bool))
| ~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_200,c_0_197]),c_0_198]),c_0_199])]) ).
cnf(c_0_206,plain,
( mem(ap(c_2Epred__set_2ECROSS(X1,X2),X3),arr(arr(X2,bool),arr(ty_2Epair_2Eprod(X1,X2),bool)))
| ~ mem(X3,arr(X1,bool))
| ~ ne(X2)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_201,c_0_202]) ).
cnf(c_0_207,negated_conjecture,
( ~ mem(ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),arr(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),bool))
| ~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_203,c_0_204]),c_0_205]) ).
cnf(c_0_208,plain,
( mem(ap(ap(c_2Epred__set_2ECROSS(X1,X2),X3),X4),arr(ty_2Epair_2Eprod(X1,X2),bool))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,bool))
| ~ ne(X2)
| ~ ne(X1) ),
inference(spm,[status(thm)],[c_0_201,c_0_206]) ).
cnf(c_0_209,negated_conjecture,
( ~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool))
| ~ ne(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_208]),c_0_199])]) ).
cnf(c_0_210,plain,
( ne(ty_2Epair_2Eprod(X1,X2))
| ~ ne(X2)
| ~ ne(X1) ),
i_0_185 ).
cnf(c_0_211,plain,
~ mem(c_2Epred__set_2EUNIV(ty_2Enum_2Enum),arr(ty_2Enum_2Enum,bool)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_209,c_0_210]),c_0_199])]) ).
cnf(c_0_212,plain,
( mem(c_2Epred__set_2EUNIV(X1),arr(X1,bool))
| ~ ne(X1) ),
i_0_183 ).
cnf(c_0_213,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_211,c_0_212]),c_0_199])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP020+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jun 3 02:10:27 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 80.95/11.72 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 80.95/11.72 # Version: 2.1pre011
% 80.95/11.72 # Preprocessing time : 0.022 s
% 80.95/11.72
% 80.95/11.72 # Proof found!
% 80.95/11.72 # SZS status Theorem
% 80.95/11.72 # SZS output start CNFRefutation
% See solution above
% 80.95/11.72 # Proof object total steps : 28
% 80.95/11.72 # Proof object clause steps : 18
% 80.95/11.72 # Proof object formula steps : 10
% 80.95/11.72 # Proof object conjectures : 4
% 80.95/11.72 # Proof object clause conjectures : 3
% 80.95/11.72 # Proof object formula conjectures : 1
% 80.95/11.72 # Proof object initial clauses used : 10
% 80.95/11.72 # Proof object initial formulas used : 10
% 80.95/11.72 # Proof object generating inferences : 8
% 80.95/11.72 # Proof object simplifying inferences : 13
% 80.95/11.72 # Training examples: 0 positive, 0 negative
% 80.95/11.72 # Parsed axioms : 130
% 80.95/11.72 # Removed by relevancy pruning/SinE : 0
% 80.95/11.72 # Initial clauses : 130
% 80.95/11.72 # Removed in clause preprocessing : 0
% 80.95/11.72 # Initial clauses in saturation : 130
% 80.95/11.72 # Processed clauses : 5152
% 80.95/11.72 # ...of these trivial : 26
% 80.95/11.72 # ...subsumed : 2365
% 80.95/11.72 # ...remaining for further processing : 2761
% 80.95/11.72 # Other redundant clauses eliminated : 3
% 80.95/11.72 # Clauses deleted for lack of memory : 0
% 80.95/11.72 # Backward-subsumed : 383
% 80.95/11.72 # Backward-rewritten : 113
% 80.95/11.72 # Generated clauses : 243299
% 80.95/11.72 # ...of the previous two non-trivial : 239539
% 80.95/11.72 # Contextual simplify-reflections : 3370
% 80.95/11.72 # Paramodulations : 243194
% 80.95/11.72 # Factorizations : 101
% 80.95/11.72 # Equation resolutions : 4
% 80.95/11.72 # Propositional unsat checks : 0
% 80.95/11.72 # Propositional unsat check successes : 0
% 80.95/11.72 # Current number of processed clauses : 2264
% 80.95/11.72 # Positive orientable unit clauses : 20
% 80.95/11.72 # Positive unorientable unit clauses: 0
% 80.95/11.72 # Negative unit clauses : 3
% 80.95/11.72 # Non-unit-clauses : 2241
% 80.95/11.72 # Current number of unprocessed clauses: 202111
% 80.95/11.72 # ...number of literals in the above : 2149617
% 80.95/11.72 # Current number of archived formulas : 0
% 80.95/11.72 # Current number of archived clauses : 496
% 80.95/11.72 # Clause-clause subsumption calls (NU) : 1459974
% 80.95/11.72 # Rec. Clause-clause subsumption calls : 82483
% 80.95/11.72 # Non-unit clause-clause subsumptions : 5459
% 80.95/11.72 # Unit Clause-clause subsumption calls : 3501
% 80.95/11.72 # Rewrite failures with RHS unbound : 0
% 80.95/11.72 # BW rewrite match attempts : 16
% 80.95/11.72 # BW rewrite match successes : 13
% 80.95/11.72 # Condensation attempts : 0
% 80.95/11.72 # Condensation successes : 0
% 80.95/11.72 # Termbank termtop insertions : 11471715
% 80.95/11.72
% 80.95/11.72 # -------------------------------------------------
% 80.95/11.72 # User time : 8.755 s
% 80.95/11.72 # System time : 0.199 s
% 80.95/11.72 # Total time : 8.954 s
% 80.95/11.72 # ...preprocessing : 0.022 s
% 80.95/11.72 # ...main loop : 8.932 s
% 80.95/11.72 # Maximum resident set size: 264296 pages
% 80.95/11.72
%------------------------------------------------------------------------------