TSTP Solution File: NUM639+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM639+4 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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 : Mon Jul 18 08:38:14 EDT 2022
% Result : Theorem 15.19s 3.43s
% Output : CNFRefutation 15.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of clauses : 43 ( 17 unt; 8 nHn; 32 RR)
% Number of literals : 80 ( 14 equ; 33 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 50 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_70,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1)),aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)))
| ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_70) ).
cnf(i_0_330,plain,
scratc1289496631d_n_is = fequal_TPTP_ind,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_330) ).
cnf(i_0_172,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1))
| ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)),aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_172) ).
cnf(i_0_515,plain,
( X1 = X2
| ~ gg_TPTP_ind(X2)
| ~ gg_TPTP_ind(X1)
| ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_515) ).
cnf(i_0_491,plain,
gg_TPTP_ind(aa_TPTP_ind_TPTP_ind(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_491) ).
cnf(i_0_516,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X2))
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_516) ).
cnf(i_0_201,plain,
( pp(aa_TPTP_ind_bool(X1,X2))
| ~ gg_TPTP_ind(X2)
| ~ scratc1829621698_is_of(X2,X3)
| ~ pp(aa_fun171081125l_bool(scratc1153622423all_of(X3),X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_201) ).
cnf(i_0_473,plain,
pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_bu)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_473) ).
cnf(i_0_518,plain,
( X1 = fFalse
| X1 = fTrue
| ~ gg_bool(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_518) ).
cnf(i_0_486,hypothesis,
gg_bool(aa_fun171081125l_bool(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_486) ).
cnf(i_0_198,plain,
( pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),X2))
| ~ pp(aa_TPTP_ind_bool(X2,esk5_2(X1,X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_198) ).
cnf(i_0_199,plain,
( scratc1829621698_is_of(esk5_2(X1,X2),X1)
| pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_199) ).
cnf(i_0_200,plain,
( gg_TPTP_ind(esk5_2(X1,X2))
| pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_200) ).
cnf(i_0_1,negated_conjecture,
~ pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_aa)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_1) ).
cnf(i_0_523,plain,
pp(fTrue),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_523) ).
cnf(i_0_519,plain,
~ pp(fFalse),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ewen__8j/input.p',i_0_519) ).
cnf(c_0_540,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1)),aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)))
| ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1)) ),
i_0_70 ).
cnf(c_0_541,plain,
scratc1289496631d_n_is = fequal_TPTP_ind,
i_0_330 ).
cnf(c_0_542,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1))
| ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1289496631d_n_is,aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)),aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1))) ),
i_0_172 ).
cnf(c_0_543,plain,
( X1 = X2
| ~ gg_TPTP_ind(X2)
| ~ gg_TPTP_ind(X1)
| ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X2)) ),
i_0_515 ).
cnf(c_0_544,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1)),aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)))
| ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1)) ),
inference(rw,[status(thm)],[c_0_540,c_0_541]) ).
cnf(c_0_545,plain,
gg_TPTP_ind(aa_TPTP_ind_TPTP_ind(X1,X2)),
i_0_491 ).
cnf(c_0_546,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X2))
| X1 != X2 ),
i_0_516 ).
cnf(c_0_547,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1))
| ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)),aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1))) ),
inference(rw,[status(thm)],[c_0_542,c_0_541]) ).
cnf(c_0_548,plain,
( aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc932095312bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1884559291d_plus,X1)),scratc214542084nd_n_1) = aa_TPTP_ind_TPTP_ind(scratc236248354rdsucc,X1)
| ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_543,c_0_544]),c_0_545]),c_0_545])]) ).
cnf(c_0_549,plain,
pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X1)),
inference(er,[status(thm)],[c_0_546]) ).
cnf(c_0_550,plain,
( pp(aa_TPTP_ind_bool(X1,X2))
| ~ gg_TPTP_ind(X2)
| ~ scratc1829621698_is_of(X2,X3)
| ~ pp(aa_fun171081125l_bool(scratc1153622423all_of(X3),X1)) ),
i_0_201 ).
cnf(c_0_551,plain,
pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_bu)),
i_0_473 ).
cnf(c_0_552,plain,
( X1 = fFalse
| X1 = fTrue
| ~ gg_bool(X1) ),
i_0_518 ).
cnf(c_0_553,hypothesis,
gg_bool(aa_fun171081125l_bool(X1,X2)),
i_0_486 ).
cnf(c_0_554,plain,
( pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),X2))
| ~ pp(aa_TPTP_ind_bool(X2,esk5_2(X1,X2))) ),
i_0_198 ).
cnf(c_0_555,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1))
| ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_547,c_0_548]),c_0_549])]) ).
cnf(c_0_556,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1))
| ~ scratc1829621698_is_of(X1,aTP_Lamm_a)
| ~ gg_TPTP_ind(X1) ),
inference(spm,[status(thm)],[c_0_550,c_0_551]) ).
cnf(c_0_557,plain,
( scratc1829621698_is_of(esk5_2(X1,X2),X1)
| pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),X2)) ),
i_0_199 ).
cnf(c_0_558,plain,
( gg_TPTP_ind(esk5_2(X1,X2))
| pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),X2)) ),
i_0_200 ).
cnf(c_0_559,negated_conjecture,
~ pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_aa)),
i_0_1 ).
cnf(c_0_560,hypothesis,
( aa_fun171081125l_bool(X1,X2) = fTrue
| aa_fun171081125l_bool(X1,X2) = fFalse ),
inference(spm,[status(thm)],[c_0_552,c_0_553]) ).
cnf(c_0_561,plain,
pp(fTrue),
i_0_523 ).
cnf(c_0_562,plain,
( pp(aa_fun171081125l_bool(scratc1153622423all_of(X1),aTP_Lamm_aa))
| ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,esk5_2(X1,aTP_Lamm_aa))) ),
inference(spm,[status(thm)],[c_0_554,c_0_555]) ).
cnf(c_0_563,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_bu,esk5_2(aTP_Lamm_a,X1)))
| pp(aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_556,c_0_557]),c_0_558]) ).
cnf(c_0_564,negated_conjecture,
aa_fun171081125l_bool(scratc1153622423all_of(aTP_Lamm_a),aTP_Lamm_aa) = fFalse,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_559,c_0_560]),c_0_561])]) ).
cnf(c_0_565,plain,
~ pp(fFalse),
i_0_519 ).
cnf(c_0_566,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_562,c_0_563]),c_0_564]),c_0_565]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM639+4 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 05:08:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox/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
% 15.19/3.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 15.19/3.43 # Version: 2.1pre011
% 15.19/3.43 # Preprocessing time : 0.029 s
% 15.19/3.43
% 15.19/3.43 # Proof found!
% 15.19/3.43 # SZS status Theorem
% 15.19/3.43 # SZS output start CNFRefutation
% See solution above
% 15.19/3.43 # Proof object total steps : 43
% 15.19/3.43 # Proof object clause steps : 27
% 15.19/3.43 # Proof object formula steps : 16
% 15.19/3.43 # Proof object conjectures : 3
% 15.19/3.43 # Proof object clause conjectures : 2
% 15.19/3.43 # Proof object formula conjectures : 1
% 15.19/3.43 # Proof object initial clauses used : 16
% 15.19/3.43 # Proof object initial formulas used : 16
% 15.19/3.43 # Proof object generating inferences : 8
% 15.19/3.43 # Proof object simplifying inferences : 13
% 15.19/3.43 # Training examples: 0 positive, 0 negative
% 15.19/3.43 # Parsed axioms : 505
% 15.19/3.43 # Removed by relevancy pruning/SinE : 0
% 15.19/3.43 # Initial clauses : 505
% 15.19/3.43 # Removed in clause preprocessing : 0
% 15.19/3.43 # Initial clauses in saturation : 505
% 15.19/3.43 # Processed clauses : 3109
% 15.19/3.43 # ...of these trivial : 91
% 15.19/3.43 # ...subsumed : 1024
% 15.19/3.43 # ...remaining for further processing : 1994
% 15.19/3.43 # Other redundant clauses eliminated : 24
% 15.19/3.43 # Clauses deleted for lack of memory : 0
% 15.19/3.43 # Backward-subsumed : 69
% 15.19/3.43 # Backward-rewritten : 71
% 15.19/3.43 # Generated clauses : 26882
% 15.19/3.43 # ...of the previous two non-trivial : 24481
% 15.19/3.43 # Contextual simplify-reflections : 158
% 15.19/3.43 # Paramodulations : 26726
% 15.19/3.43 # Factorizations : 115
% 15.19/3.43 # Equation resolutions : 41
% 15.19/3.43 # Propositional unsat checks : 0
% 15.19/3.43 # Propositional unsat check successes : 0
% 15.19/3.43 # Current number of processed clauses : 1851
% 15.19/3.43 # Positive orientable unit clauses : 353
% 15.19/3.43 # Positive unorientable unit clauses: 15
% 15.19/3.43 # Negative unit clauses : 57
% 15.19/3.43 # Non-unit-clauses : 1426
% 15.19/3.43 # Current number of unprocessed clauses: 20259
% 15.19/3.43 # ...number of literals in the above : 64510
% 15.19/3.43 # Current number of archived formulas : 0
% 15.19/3.43 # Current number of archived clauses : 140
% 15.19/3.43 # Clause-clause subsumption calls (NU) : 334199
% 15.19/3.43 # Rec. Clause-clause subsumption calls : 222611
% 15.19/3.43 # Non-unit clause-clause subsumptions : 581
% 15.19/3.43 # Unit Clause-clause subsumption calls : 64851
% 15.19/3.43 # Rewrite failures with RHS unbound : 0
% 15.19/3.43 # BW rewrite match attempts : 5118
% 15.19/3.43 # BW rewrite match successes : 68
% 15.19/3.43 # Condensation attempts : 0
% 15.19/3.43 # Condensation successes : 0
% 15.19/3.43 # Termbank termtop insertions : 471604
% 15.19/3.43
% 15.19/3.43 # -------------------------------------------------
% 15.19/3.43 # User time : 0.696 s
% 15.19/3.43 # System time : 0.028 s
% 15.19/3.43 # Total time : 0.724 s
% 15.19/3.43 # ...preprocessing : 0.029 s
% 15.19/3.43 # ...main loop : 0.694 s
% 15.19/3.43 # Maximum resident set size: 34272 pages
% 15.19/3.43
%------------------------------------------------------------------------------