TSTP Solution File: NUN085+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN085+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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.70s 2.18s
% Output : CNFRefutation 4.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of clauses : 62 ( 46 unt; 0 nHn; 43 RR)
% Number of literals : 80 ( 30 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_8) ).
cnf(i_0_45,negated_conjecture,
r1(esk23_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_45) ).
cnf(i_0_40,negated_conjecture,
r1(esk25_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_40) ).
cnf(i_0_43,negated_conjecture,
r1(esk24_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_43) ).
cnf(i_0_22,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/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-qn1saryg/input.p',i_0_1) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_26) ).
cnf(i_0_42,negated_conjecture,
r2(esk24_0,esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_42) ).
cnf(i_0_25,plain,
r3(X1,esk13_1(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_25) ).
cnf(i_0_17,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_17) ).
cnf(i_0_44,negated_conjecture,
r3(esk23_0,esk22_0,esk21_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_44) ).
cnf(i_0_41,negated_conjecture,
esk25_0 = esk21_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_41) ).
cnf(i_0_39,plain,
( X1 != X2
| ~ r1(X1)
| ~ r2(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_39) ).
cnf(i_0_5,plain,
r2(X1,esk3_2(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/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-qn1saryg/input.p',i_0_2) ).
cnf(i_0_7,plain,
( r1(X1)
| X1 != esk5_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_7) ).
cnf(i_0_4,plain,
r3(X1,esk3_2(X1,X2),esk1_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qn1saryg/input.p',i_0_4) ).
cnf(c_0_63,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_64,negated_conjecture,
r1(esk23_0),
i_0_45 ).
cnf(c_0_65,negated_conjecture,
esk5_0 = esk23_0,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_66,plain,
( X1 = esk23_0
| ~ r1(X1) ),
inference(rw,[status(thm)],[c_0_63,c_0_65]) ).
cnf(c_0_67,negated_conjecture,
r1(esk25_0),
i_0_40 ).
cnf(c_0_68,negated_conjecture,
esk23_0 = esk25_0,
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_69,negated_conjecture,
r1(esk24_0),
i_0_43 ).
cnf(c_0_70,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
i_0_22 ).
cnf(c_0_71,plain,
r3(X1,X2,esk4_2(X1,X2)),
i_0_1 ).
cnf(c_0_72,plain,
( X1 = esk25_0
| ~ r1(X1) ),
inference(rw,[status(thm)],[c_0_66,c_0_68]) ).
cnf(c_0_73,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_74,negated_conjecture,
r2(esk24_0,esk22_0),
i_0_42 ).
cnf(c_0_75,negated_conjecture,
esk24_0 = esk23_0,
inference(spm,[status(thm)],[c_0_66,c_0_69]) ).
cnf(c_0_76,plain,
esk11_2(X1,X2) = esk4_2(X1,X2),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_77,plain,
r3(X1,esk13_1(X1),X1),
i_0_25 ).
cnf(c_0_78,plain,
esk13_1(X1) = esk25_0,
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_79,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
i_0_17 ).
cnf(c_0_80,negated_conjecture,
r2(esk25_0,esk22_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_68]) ).
cnf(c_0_81,plain,
( X1 = esk4_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(rw,[status(thm)],[c_0_70,c_0_76]) ).
cnf(c_0_82,plain,
r3(X1,esk25_0,X1),
inference(rw,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_83,negated_conjecture,
r3(esk23_0,esk22_0,esk21_0),
i_0_44 ).
cnf(c_0_84,negated_conjecture,
esk25_0 = esk21_0,
i_0_41 ).
cnf(c_0_85,plain,
( X1 != X2
| ~ r1(X1)
| ~ r2(X3,X2) ),
i_0_39 ).
cnf(c_0_86,plain,
r2(X1,esk3_2(X2,X1)),
i_0_5 ).
cnf(c_0_87,plain,
esk10_1(esk25_0) = esk22_0,
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_88,plain,
r2(esk4_2(X1,X2),esk1_2(X1,X2)),
i_0_2 ).
cnf(c_0_89,plain,
esk4_2(X1,esk25_0) = X1,
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_90,negated_conjecture,
r3(esk23_0,esk22_0,esk25_0),
inference(rw,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_91,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_85]) ).
cnf(c_0_92,plain,
( r1(X1)
| X1 != esk5_0 ),
i_0_7 ).
cnf(c_0_93,plain,
r3(X1,esk3_2(X1,X2),esk1_2(X1,X2)),
i_0_4 ).
cnf(c_0_94,plain,
esk3_2(X1,X2) = esk10_1(X2),
inference(spm,[status(thm)],[c_0_79,c_0_86]) ).
cnf(c_0_95,plain,
( X1 = esk22_0
| ~ r2(esk25_0,X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_87]) ).
cnf(c_0_96,plain,
r2(X1,esk1_2(X1,esk25_0)),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_97,negated_conjecture,
r3(esk25_0,esk22_0,esk25_0),
inference(rw,[status(thm)],[c_0_90,c_0_68]) ).
cnf(c_0_98,negated_conjecture,
~ r1(esk22_0),
inference(spm,[status(thm)],[c_0_91,c_0_74]) ).
cnf(c_0_99,plain,
( r1(X1)
| X1 != esk23_0 ),
inference(rw,[status(thm)],[c_0_92,c_0_65]) ).
cnf(c_0_100,plain,
r3(X1,esk10_1(X2),esk1_2(X1,X2)),
inference(rw,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_101,plain,
esk1_2(esk25_0,esk25_0) = esk22_0,
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_102,plain,
esk11_2(esk25_0,esk22_0) = esk25_0,
inference(spm,[status(thm)],[c_0_70,c_0_97]) ).
cnf(c_0_103,negated_conjecture,
esk22_0 != esk23_0,
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_104,plain,
r3(esk25_0,esk22_0,esk22_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_87]) ).
cnf(c_0_105,plain,
esk4_2(esk25_0,esk22_0) = esk25_0,
inference(rw,[status(thm)],[c_0_102,c_0_76]) ).
cnf(c_0_106,negated_conjecture,
esk22_0 != esk25_0,
inference(rw,[status(thm)],[c_0_103,c_0_68]) ).
cnf(c_0_107,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_104]),c_0_105]),c_0_106]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUN085+2 : TPTP v8.1.0. Released v7.3.0.
% 0.00/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Thu Jun 2 07:16:02 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.13/0.37 # ENIGMATIC: Selected SinE mode:
% 0.13/0.37 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.13/0.37 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.13/0.37 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.70/2.18 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 4.70/2.18 # Version: 2.1pre011
% 4.70/2.18 # Preprocessing time : 0.010 s
% 4.70/2.18
% 4.70/2.18 # Proof found!
% 4.70/2.18 # SZS status Theorem
% 4.70/2.18 # SZS output start CNFRefutation
% See solution above
% 4.70/2.18 # Proof object total steps : 62
% 4.70/2.18 # Proof object clause steps : 45
% 4.70/2.18 # Proof object formula steps : 17
% 4.70/2.18 # Proof object conjectures : 21
% 4.70/2.18 # Proof object clause conjectures : 15
% 4.70/2.18 # Proof object formula conjectures : 6
% 4.70/2.18 # Proof object initial clauses used : 17
% 4.70/2.18 # Proof object initial formulas used : 17
% 4.70/2.18 # Proof object generating inferences : 16
% 4.70/2.18 # Proof object simplifying inferences : 16
% 4.70/2.18 # Training examples: 0 positive, 0 negative
% 4.70/2.18 # Parsed axioms : 33
% 4.70/2.18 # Removed by relevancy pruning/SinE : 0
% 4.70/2.18 # Initial clauses : 33
% 4.70/2.18 # Removed in clause preprocessing : 0
% 4.70/2.18 # Initial clauses in saturation : 33
% 4.70/2.18 # Processed clauses : 223
% 4.70/2.18 # ...of these trivial : 2
% 4.70/2.18 # ...subsumed : 74
% 4.70/2.18 # ...remaining for further processing : 147
% 4.70/2.18 # Other redundant clauses eliminated : 10
% 4.70/2.18 # Clauses deleted for lack of memory : 0
% 4.70/2.18 # Backward-subsumed : 0
% 4.70/2.18 # Backward-rewritten : 36
% 4.70/2.18 # Generated clauses : 424
% 4.70/2.18 # ...of the previous two non-trivial : 361
% 4.70/2.18 # Contextual simplify-reflections : 29
% 4.70/2.18 # Paramodulations : 405
% 4.70/2.18 # Factorizations : 1
% 4.70/2.18 # Equation resolutions : 18
% 4.70/2.18 # Propositional unsat checks : 0
% 4.70/2.18 # Propositional unsat check successes : 0
% 4.70/2.18 # Current number of processed clauses : 109
% 4.70/2.18 # Positive orientable unit clauses : 43
% 4.70/2.18 # Positive unorientable unit clauses: 0
% 4.70/2.18 # Negative unit clauses : 7
% 4.70/2.18 # Non-unit-clauses : 59
% 4.70/2.18 # Current number of unprocessed clauses: 120
% 4.70/2.18 # ...number of literals in the above : 287
% 4.70/2.18 # Current number of archived formulas : 0
% 4.70/2.18 # Current number of archived clauses : 36
% 4.70/2.18 # Clause-clause subsumption calls (NU) : 1199
% 4.70/2.18 # Rec. Clause-clause subsumption calls : 1042
% 4.70/2.18 # Non-unit clause-clause subsumptions : 73
% 4.70/2.18 # Unit Clause-clause subsumption calls : 217
% 4.70/2.18 # Rewrite failures with RHS unbound : 0
% 4.70/2.18 # BW rewrite match attempts : 45
% 4.70/2.18 # BW rewrite match successes : 22
% 4.70/2.18 # Condensation attempts : 0
% 4.70/2.18 # Condensation successes : 0
% 4.70/2.18 # Termbank termtop insertions : 3625
% 4.70/2.18
% 4.70/2.18 # -------------------------------------------------
% 4.70/2.18 # User time : 0.014 s
% 4.70/2.18 # System time : 0.002 s
% 4.70/2.18 # Total time : 0.016 s
% 4.70/2.18 # ...preprocessing : 0.010 s
% 4.70/2.18 # ...main loop : 0.006 s
% 4.70/2.18 # Maximum resident set size: 7140 pages
% 4.70/2.18
%------------------------------------------------------------------------------