TSTP Solution File: NUM641+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM641+4 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:16 EDT 2022
% Result : Theorem 14.20s 3.31s
% Output : CNFRefutation 14.20s
% 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_93,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1083610823d_n_is,aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc1549486784bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1715799339d_plus,scratc45782132nd_n_1)),X1)),aa_TPTP_ind_TPTP_ind(scratc912327602rdsucc,X1)))
| ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_93) ).
cnf(i_0_336,plain,
scratc1083610823d_n_is = fequal_TPTP_ind,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_336) ).
cnf(i_0_196,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1))
| ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1083610823d_n_is,aa_TPTP_ind_TPTP_ind(scratc912327602rdsucc,X1)),aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc1549486784bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1715799339d_plus,scratc45782132nd_n_1)),X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_196) ).
cnf(i_0_523,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-4hnw56le/input.p',i_0_523) ).
cnf(i_0_499,plain,
gg_TPTP_ind(aa_TPTP_ind_TPTP_ind(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_499) ).
cnf(i_0_524,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X2))
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_524) ).
cnf(i_0_207,plain,
( pp(aa_TPTP_ind_bool(X1,X2))
| ~ gg_TPTP_ind(X2)
| ~ scratc1451164978_is_of(X2,X3)
| ~ pp(aa_fun171081125l_bool(scratc1829701671all_of(X3),X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_207) ).
cnf(i_0_482,plain,
pp(aa_fun171081125l_bool(scratc1829701671all_of(aTP_Lamm_a),aTP_Lamm_bu)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_482) ).
cnf(i_0_526,plain,
( X1 = fFalse
| X1 = fTrue
| ~ gg_bool(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_526) ).
cnf(i_0_494,hypothesis,
gg_bool(aa_fun171081125l_bool(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_494) ).
cnf(i_0_204,plain,
( pp(aa_fun171081125l_bool(scratc1829701671all_of(X1),X2))
| ~ pp(aa_TPTP_ind_bool(X2,esk5_2(X1,X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_204) ).
cnf(i_0_205,plain,
( scratc1451164978_is_of(esk5_2(X1,X2),X1)
| pp(aa_fun171081125l_bool(scratc1829701671all_of(X1),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_205) ).
cnf(i_0_206,plain,
( gg_TPTP_ind(esk5_2(X1,X2))
| pp(aa_fun171081125l_bool(scratc1829701671all_of(X1),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_206) ).
cnf(i_0_1,negated_conjecture,
~ pp(aa_fun171081125l_bool(scratc1829701671all_of(aTP_Lamm_a),aTP_Lamm_aa)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_1) ).
cnf(i_0_531,plain,
pp(fTrue),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_531) ).
cnf(i_0_527,plain,
~ pp(fFalse),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hnw56le/input.p',i_0_527) ).
cnf(c_0_548,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1083610823d_n_is,aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc1549486784bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1715799339d_plus,scratc45782132nd_n_1)),X1)),aa_TPTP_ind_TPTP_ind(scratc912327602rdsucc,X1)))
| ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1)) ),
i_0_93 ).
cnf(c_0_549,plain,
scratc1083610823d_n_is = fequal_TPTP_ind,
i_0_336 ).
cnf(c_0_550,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_aa,X1))
| ~ pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(scratc1083610823d_n_is,aa_TPTP_ind_TPTP_ind(scratc912327602rdsucc,X1)),aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc1549486784bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1715799339d_plus,scratc45782132nd_n_1)),X1))) ),
i_0_196 ).
cnf(c_0_551,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_523 ).
cnf(c_0_552,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc1549486784bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1715799339d_plus,scratc45782132nd_n_1)),X1)),aa_TPTP_ind_TPTP_ind(scratc912327602rdsucc,X1)))
| ~ pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1)) ),
inference(rw,[status(thm)],[c_0_548,c_0_549]) ).
cnf(c_0_553,plain,
gg_TPTP_ind(aa_TPTP_ind_TPTP_ind(X1,X2)),
i_0_499 ).
cnf(c_0_554,plain,
( pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X2))
| X1 != X2 ),
i_0_524 ).
cnf(c_0_555,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(scratc912327602rdsucc,X1)),aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc1549486784bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1715799339d_plus,scratc45782132nd_n_1)),X1))) ),
inference(rw,[status(thm)],[c_0_550,c_0_549]) ).
cnf(c_0_556,plain,
( aa_TPTP_ind_TPTP_ind(aa_TPT1424761345TP_ind(scratc1549486784bnd_ap,aa_TPTP_ind_TPTP_ind(scratc1715799339d_plus,scratc45782132nd_n_1)),X1) = aa_TPTP_ind_TPTP_ind(scratc912327602rdsucc,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_551,c_0_552]),c_0_553]),c_0_553])]) ).
cnf(c_0_557,plain,
pp(aa_TPTP_ind_bool(aa_TPT43085870d_bool(fequal_TPTP_ind,X1),X1)),
inference(er,[status(thm)],[c_0_554]) ).
cnf(c_0_558,plain,
( pp(aa_TPTP_ind_bool(X1,X2))
| ~ gg_TPTP_ind(X2)
| ~ scratc1451164978_is_of(X2,X3)
| ~ pp(aa_fun171081125l_bool(scratc1829701671all_of(X3),X1)) ),
i_0_207 ).
cnf(c_0_559,plain,
pp(aa_fun171081125l_bool(scratc1829701671all_of(aTP_Lamm_a),aTP_Lamm_bu)),
i_0_482 ).
cnf(c_0_560,plain,
( X1 = fFalse
| X1 = fTrue
| ~ gg_bool(X1) ),
i_0_526 ).
cnf(c_0_561,hypothesis,
gg_bool(aa_fun171081125l_bool(X1,X2)),
i_0_494 ).
cnf(c_0_562,plain,
( pp(aa_fun171081125l_bool(scratc1829701671all_of(X1),X2))
| ~ pp(aa_TPTP_ind_bool(X2,esk5_2(X1,X2))) ),
i_0_204 ).
cnf(c_0_563,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_555,c_0_556]),c_0_557])]) ).
cnf(c_0_564,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_bu,X1))
| ~ scratc1451164978_is_of(X1,aTP_Lamm_a)
| ~ gg_TPTP_ind(X1) ),
inference(spm,[status(thm)],[c_0_558,c_0_559]) ).
cnf(c_0_565,plain,
( scratc1451164978_is_of(esk5_2(X1,X2),X1)
| pp(aa_fun171081125l_bool(scratc1829701671all_of(X1),X2)) ),
i_0_205 ).
cnf(c_0_566,plain,
( gg_TPTP_ind(esk5_2(X1,X2))
| pp(aa_fun171081125l_bool(scratc1829701671all_of(X1),X2)) ),
i_0_206 ).
cnf(c_0_567,negated_conjecture,
~ pp(aa_fun171081125l_bool(scratc1829701671all_of(aTP_Lamm_a),aTP_Lamm_aa)),
i_0_1 ).
cnf(c_0_568,hypothesis,
( aa_fun171081125l_bool(X1,X2) = fTrue
| aa_fun171081125l_bool(X1,X2) = fFalse ),
inference(spm,[status(thm)],[c_0_560,c_0_561]) ).
cnf(c_0_569,plain,
pp(fTrue),
i_0_531 ).
cnf(c_0_570,plain,
( pp(aa_fun171081125l_bool(scratc1829701671all_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_562,c_0_563]) ).
cnf(c_0_571,plain,
( pp(aa_TPTP_ind_bool(aTP_Lamm_bu,esk5_2(aTP_Lamm_a,X1)))
| pp(aa_fun171081125l_bool(scratc1829701671all_of(aTP_Lamm_a),X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_564,c_0_565]),c_0_566]) ).
cnf(c_0_572,negated_conjecture,
aa_fun171081125l_bool(scratc1829701671all_of(aTP_Lamm_a),aTP_Lamm_aa) = fFalse,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_567,c_0_568]),c_0_569])]) ).
cnf(c_0_573,plain,
~ pp(fFalse),
i_0_527 ).
cnf(c_0_574,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_570,c_0_571]),c_0_572]),c_0_573]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM641+4 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 5 19:23:24 EDT 2022
% 0.13/0.33 % 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
% 14.20/3.31 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 14.20/3.31 # Version: 2.1pre011
% 14.20/3.31 # Preprocessing time : 0.043 s
% 14.20/3.31
% 14.20/3.31 # Proof found!
% 14.20/3.31 # SZS status Theorem
% 14.20/3.31 # SZS output start CNFRefutation
% See solution above
% 14.20/3.31 # Proof object total steps : 43
% 14.20/3.31 # Proof object clause steps : 27
% 14.20/3.31 # Proof object formula steps : 16
% 14.20/3.31 # Proof object conjectures : 3
% 14.20/3.31 # Proof object clause conjectures : 2
% 14.20/3.31 # Proof object formula conjectures : 1
% 14.20/3.31 # Proof object initial clauses used : 16
% 14.20/3.31 # Proof object initial formulas used : 16
% 14.20/3.31 # Proof object generating inferences : 8
% 14.20/3.31 # Proof object simplifying inferences : 13
% 14.20/3.31 # Training examples: 0 positive, 0 negative
% 14.20/3.31 # Parsed axioms : 513
% 14.20/3.31 # Removed by relevancy pruning/SinE : 0
% 14.20/3.31 # Initial clauses : 513
% 14.20/3.31 # Removed in clause preprocessing : 0
% 14.20/3.31 # Initial clauses in saturation : 513
% 14.20/3.31 # Processed clauses : 3349
% 14.20/3.31 # ...of these trivial : 102
% 14.20/3.31 # ...subsumed : 1128
% 14.20/3.31 # ...remaining for further processing : 2119
% 14.20/3.31 # Other redundant clauses eliminated : 24
% 14.20/3.31 # Clauses deleted for lack of memory : 0
% 14.20/3.31 # Backward-subsumed : 64
% 14.20/3.31 # Backward-rewritten : 74
% 14.20/3.31 # Generated clauses : 29401
% 14.20/3.31 # ...of the previous two non-trivial : 26870
% 14.20/3.31 # Contextual simplify-reflections : 176
% 14.20/3.31 # Paramodulations : 29240
% 14.20/3.31 # Factorizations : 117
% 14.20/3.31 # Equation resolutions : 44
% 14.20/3.31 # Propositional unsat checks : 0
% 14.20/3.31 # Propositional unsat check successes : 0
% 14.20/3.31 # Current number of processed clauses : 1978
% 14.20/3.31 # Positive orientable unit clauses : 370
% 14.20/3.31 # Positive unorientable unit clauses: 16
% 14.20/3.31 # Negative unit clauses : 53
% 14.20/3.31 # Non-unit-clauses : 1539
% 14.20/3.31 # Current number of unprocessed clauses: 22028
% 14.20/3.31 # ...number of literals in the above : 71236
% 14.20/3.31 # Current number of archived formulas : 0
% 14.20/3.31 # Current number of archived clauses : 138
% 14.20/3.31 # Clause-clause subsumption calls (NU) : 315984
% 14.20/3.31 # Rec. Clause-clause subsumption calls : 216926
% 14.20/3.31 # Non-unit clause-clause subsumptions : 618
% 14.20/3.31 # Unit Clause-clause subsumption calls : 51666
% 14.20/3.31 # Rewrite failures with RHS unbound : 0
% 14.20/3.31 # BW rewrite match attempts : 5613
% 14.20/3.31 # BW rewrite match successes : 78
% 14.20/3.31 # Condensation attempts : 0
% 14.20/3.31 # Condensation successes : 0
% 14.20/3.31 # Termbank termtop insertions : 527625
% 14.20/3.31
% 14.20/3.31 # -------------------------------------------------
% 14.20/3.31 # User time : 0.733 s
% 14.20/3.31 # System time : 0.024 s
% 14.20/3.31 # Total time : 0.757 s
% 14.20/3.31 # ...preprocessing : 0.043 s
% 14.20/3.31 # ...main loop : 0.713 s
% 14.20/3.31 # Maximum resident set size: 37176 pages
% 14.20/3.31
%------------------------------------------------------------------------------