TSTP Solution File: NUN084+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN084+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 16:24:58 EDT 2022
% Result : Theorem 4.83s 2.25s
% Output : CNFRefutation 4.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of clauses : 77 ( 56 unt; 0 nHn; 25 RR)
% Number of literals : 109 ( 36 equ; 40 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 1 con; 0-2 aty)
% Number of variables : 142 ( 32 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_8) ).
cnf(i_0_32,plain,
r1(esk15_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_32) ).
cnf(i_0_33,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_33) ).
cnf(i_0_34,plain,
r1(esk16_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_34) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_26) ).
cnf(i_0_25,plain,
r3(X1,esk13_1(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_25) ).
cnf(i_0_29,plain,
( X1 = esk14_2(X2,X3)
| ~ r4(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_29) ).
cnf(i_0_10,plain,
r4(X1,X2,esk9_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_10) ).
cnf(i_0_17,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_17) ).
cnf(i_0_14,plain,
r2(X1,esk8_2(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_14) ).
cnf(i_0_22,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_22) ).
cnf(i_0_1,plain,
r3(X1,X2,esk4_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_1) ).
cnf(i_0_13,plain,
r4(X1,esk8_2(X1,X2),esk6_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_13) ).
cnf(i_0_5,plain,
r2(X1,esk3_2(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_5) ).
cnf(i_0_2,plain,
r2(esk4_2(X1,X2),esk1_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_2) ).
cnf(i_0_40,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r2(X3,X4)
| ~ r2(X4,X2)
| ~ r4(X5,X6,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_40) ).
cnf(i_0_11,plain,
r3(esk9_2(X1,X2),X1,esk6_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_11) ).
cnf(i_0_4,plain,
r3(X1,esk3_2(X1,X2),esk1_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_4) ).
cnf(i_0_16,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z4xnnask/input.p',i_0_16) ).
cnf(c_0_60,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_61,plain,
r1(esk15_1(X1)),
i_0_32 ).
cnf(c_0_62,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
i_0_33 ).
cnf(c_0_63,plain,
esk15_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
r1(esk16_1(X1)),
i_0_34 ).
cnf(c_0_65,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_66,plain,
r4(X1,esk16_1(X1),esk5_0),
inference(rw,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
esk16_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_60,c_0_64]) ).
cnf(c_0_68,plain,
r3(X1,esk13_1(X1),X1),
i_0_25 ).
cnf(c_0_69,plain,
esk13_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_60,c_0_65]) ).
cnf(c_0_70,plain,
( X1 = esk14_2(X2,X3)
| ~ r4(X2,X3,X1) ),
i_0_29 ).
cnf(c_0_71,plain,
r4(X1,X2,esk9_2(X1,X2)),
i_0_10 ).
cnf(c_0_72,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
i_0_17 ).
cnf(c_0_73,plain,
r2(X1,esk8_2(X2,X1)),
i_0_14 ).
cnf(c_0_74,plain,
r4(X1,esk5_0,esk5_0),
inference(rw,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_75,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
i_0_22 ).
cnf(c_0_76,plain,
r3(X1,esk5_0,X1),
inference(rw,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_77,plain,
r3(X1,X2,esk4_2(X1,X2)),
i_0_1 ).
cnf(c_0_78,plain,
esk14_2(X1,X2) = esk9_2(X1,X2),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_79,plain,
r4(X1,esk8_2(X1,X2),esk6_2(X1,X2)),
i_0_13 ).
cnf(c_0_80,plain,
esk8_2(X1,X2) = esk10_1(X2),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_81,plain,
esk14_2(X1,esk5_0) = esk5_0,
inference(spm,[status(thm)],[c_0_70,c_0_74]) ).
cnf(c_0_82,plain,
r2(X1,esk3_2(X2,X1)),
i_0_5 ).
cnf(c_0_83,plain,
r2(esk4_2(X1,X2),esk1_2(X1,X2)),
i_0_2 ).
cnf(c_0_84,plain,
esk11_2(X1,esk5_0) = X1,
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_85,plain,
esk11_2(X1,X2) = esk4_2(X1,X2),
inference(spm,[status(thm)],[c_0_75,c_0_77]) ).
cnf(c_0_86,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r2(X3,X4)
| ~ r2(X4,X2)
| ~ r4(X5,X6,X1) ),
i_0_40 ).
cnf(c_0_87,plain,
( X1 = esk9_2(X2,X3)
| ~ r4(X2,X3,X1) ),
inference(rw,[status(thm)],[c_0_70,c_0_78]) ).
cnf(c_0_88,plain,
r4(X1,esk10_1(X2),esk6_2(X1,X2)),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_89,plain,
r3(esk9_2(X1,X2),X1,esk6_2(X1,X2)),
i_0_11 ).
cnf(c_0_90,plain,
esk9_2(X1,esk5_0) = esk5_0,
inference(rw,[status(thm)],[c_0_81,c_0_78]) ).
cnf(c_0_91,plain,
r3(X1,esk3_2(X1,X2),esk1_2(X1,X2)),
i_0_4 ).
cnf(c_0_92,plain,
esk3_2(X1,X2) = esk10_1(X2),
inference(spm,[status(thm)],[c_0_72,c_0_82]) ).
cnf(c_0_93,plain,
esk10_1(esk4_2(X1,X2)) = esk1_2(X1,X2),
inference(spm,[status(thm)],[c_0_72,c_0_83]) ).
cnf(c_0_94,plain,
esk4_2(X1,esk5_0) = X1,
inference(rw,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_95,negated_conjecture,
( ~ r4(X1,X2,X3)
| ~ r2(X4,X3)
| ~ r2(X5,X4)
| ~ r1(X5) ),
inference(er,[status(thm)],[c_0_86]) ).
cnf(c_0_96,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
i_0_16 ).
cnf(c_0_97,plain,
esk9_2(X1,esk10_1(X2)) = esk6_2(X1,X2),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_98,plain,
( X1 = esk4_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(rw,[status(thm)],[c_0_75,c_0_85]) ).
cnf(c_0_99,plain,
r3(esk5_0,X1,esk6_2(X1,esk5_0)),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_100,plain,
r3(X1,esk10_1(X2),esk1_2(X1,X2)),
inference(rw,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_101,plain,
esk1_2(X1,esk5_0) = esk10_1(X1),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_102,plain,
( ~ r2(X1,esk6_2(X2,X3))
| ~ r2(X4,X1)
| ~ r1(X4) ),
inference(spm,[status(thm)],[c_0_95,c_0_79]) ).
cnf(c_0_103,plain,
( r2(esk4_2(X1,X2),X3)
| X3 != esk1_2(X1,X2) ),
inference(spm,[status(thm)],[c_0_96,c_0_93]) ).
cnf(c_0_104,plain,
r3(esk6_2(X1,X2),X1,esk6_2(X1,esk10_1(X2))),
inference(spm,[status(thm)],[c_0_89,c_0_97]) ).
cnf(c_0_105,plain,
esk6_2(X1,esk5_0) = esk4_2(esk5_0,X1),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_106,plain,
r3(X1,esk10_1(esk5_0),esk10_1(X1)),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_107,plain,
( esk6_2(X1,X2) != esk1_2(X3,X4)
| ~ r2(X5,esk4_2(X3,X4))
| ~ r1(X5) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_108,plain,
r3(esk4_2(esk5_0,X1),X1,esk6_2(X1,esk10_1(esk5_0))),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_109,plain,
esk4_2(X1,esk10_1(esk5_0)) = esk10_1(X1),
inference(spm,[status(thm)],[c_0_98,c_0_106]) ).
cnf(c_0_110,plain,
( esk6_2(X1,X2) != esk10_1(X3)
| ~ r2(X4,X3)
| ~ r1(X4) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_94]),c_0_101]) ).
cnf(c_0_111,plain,
r2(X1,esk10_1(X1)),
inference(er,[status(thm)],[c_0_96]) ).
cnf(c_0_112,plain,
r3(esk10_1(esk5_0),esk10_1(esk5_0),esk6_2(esk10_1(esk5_0),esk10_1(esk5_0))),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_113,plain,
( esk6_2(X1,X2) != esk10_1(esk10_1(X3))
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_114,plain,
esk6_2(esk10_1(esk5_0),esk10_1(esk5_0)) = esk10_1(esk10_1(esk5_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_112]),c_0_109]) ).
cnf(c_0_115,plain,
( esk10_1(esk10_1(esk5_0)) != esk10_1(esk10_1(X1))
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_116,plain,
r1(esk5_0),
inference(rw,[status(thm)],[c_0_65,c_0_69]) ).
cnf(c_0_117,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_115]),c_0_116])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN084+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n020.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 : Thu Jun 2 05:26:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.83/2.25 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 4.83/2.25 # Version: 2.1pre011
% 4.83/2.25 # Preprocessing time : 0.010 s
% 4.83/2.25
% 4.83/2.25 # Proof found!
% 4.83/2.25 # SZS status Theorem
% 4.83/2.25 # SZS output start CNFRefutation
% See solution above
% 4.83/2.25 # Proof object total steps : 77
% 4.83/2.25 # Proof object clause steps : 58
% 4.83/2.25 # Proof object formula steps : 19
% 4.83/2.25 # Proof object conjectures : 3
% 4.83/2.25 # Proof object clause conjectures : 2
% 4.83/2.25 # Proof object formula conjectures : 1
% 4.83/2.25 # Proof object initial clauses used : 19
% 4.83/2.25 # Proof object initial formulas used : 19
% 4.83/2.25 # Proof object generating inferences : 28
% 4.83/2.25 # Proof object simplifying inferences : 15
% 4.83/2.25 # Training examples: 0 positive, 0 negative
% 4.83/2.25 # Parsed axioms : 28
% 4.83/2.25 # Removed by relevancy pruning/SinE : 0
% 4.83/2.25 # Initial clauses : 28
% 4.83/2.25 # Removed in clause preprocessing : 0
% 4.83/2.25 # Initial clauses in saturation : 28
% 4.83/2.25 # Processed clauses : 373
% 4.83/2.25 # ...of these trivial : 0
% 4.83/2.25 # ...subsumed : 144
% 4.83/2.25 # ...remaining for further processing : 229
% 4.83/2.25 # Other redundant clauses eliminated : 11
% 4.83/2.25 # Clauses deleted for lack of memory : 0
% 4.83/2.25 # Backward-subsumed : 4
% 4.83/2.25 # Backward-rewritten : 40
% 4.83/2.25 # Generated clauses : 886
% 4.83/2.25 # ...of the previous two non-trivial : 768
% 4.83/2.25 # Contextual simplify-reflections : 42
% 4.83/2.25 # Paramodulations : 861
% 4.83/2.25 # Factorizations : 0
% 4.83/2.25 # Equation resolutions : 25
% 4.83/2.25 # Propositional unsat checks : 0
% 4.83/2.25 # Propositional unsat check successes : 0
% 4.83/2.25 # Current number of processed clauses : 182
% 4.83/2.25 # Positive orientable unit clauses : 60
% 4.83/2.25 # Positive unorientable unit clauses: 0
% 4.83/2.25 # Negative unit clauses : 5
% 4.83/2.25 # Non-unit-clauses : 117
% 4.83/2.25 # Current number of unprocessed clauses: 385
% 4.83/2.25 # ...number of literals in the above : 1157
% 4.83/2.25 # Current number of archived formulas : 0
% 4.83/2.25 # Current number of archived clauses : 44
% 4.83/2.25 # Clause-clause subsumption calls (NU) : 6644
% 4.83/2.25 # Rec. Clause-clause subsumption calls : 4614
% 4.83/2.25 # Non-unit clause-clause subsumptions : 161
% 4.83/2.25 # Unit Clause-clause subsumption calls : 1246
% 4.83/2.25 # Rewrite failures with RHS unbound : 0
% 4.83/2.25 # BW rewrite match attempts : 118
% 4.83/2.25 # BW rewrite match successes : 30
% 4.83/2.25 # Condensation attempts : 0
% 4.83/2.25 # Condensation successes : 0
% 4.83/2.25 # Termbank termtop insertions : 9401
% 4.83/2.25
% 4.83/2.25 # -------------------------------------------------
% 4.83/2.25 # User time : 0.022 s
% 4.83/2.25 # System time : 0.002 s
% 4.83/2.25 # Total time : 0.024 s
% 4.83/2.25 # ...preprocessing : 0.010 s
% 4.83/2.25 # ...main loop : 0.014 s
% 4.83/2.25 # Maximum resident set size: 7132 pages
% 4.83/2.25
%------------------------------------------------------------------------------