TSTP Solution File: NUN066+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN066+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:54 EDT 2022
% Result : Theorem 4.52s 2.25s
% Output : CNFRefutation 4.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of clauses : 59 ( 10 unt; 31 nHn; 26 RR)
% Number of literals : 117 ( 50 equ; 33 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 76 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_8) ).
cnf(i_0_47,negated_conjecture,
( r1(esk23_1(X1))
| r1(esk24_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_47) ).
cnf(i_0_45,negated_conjecture,
( r1(esk24_1(X1))
| r2(esk23_1(X1),esk22_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_45) ).
cnf(i_0_39,plain,
( X1 != X2
| ~ r1(X1)
| ~ r2(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_39) ).
cnf(i_0_16,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_16) ).
cnf(i_0_19,plain,
( X1 = X2
| X3 != X4
| ~ r2(X2,X4)
| ~ r2(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_19) ).
cnf(i_0_43,negated_conjecture,
( r1(esk24_1(X1))
| r2(esk22_1(X1),esk21_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_43) ).
cnf(i_0_41,negated_conjecture,
( esk21_1(X1) = X1
| r1(esk24_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_41) ).
cnf(i_0_17,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_17) ).
cnf(i_0_7,plain,
( r1(X1)
| X1 != esk5_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_7) ).
cnf(i_0_42,negated_conjecture,
( esk24_1(X1) = X1
| r2(esk22_1(X1),esk21_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_42) ).
cnf(i_0_40,negated_conjecture,
( esk21_1(X1) = X1
| esk24_1(X1) = X1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_40) ).
cnf(i_0_44,negated_conjecture,
( esk24_1(X1) = X1
| r2(esk23_1(X1),esk22_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_44) ).
cnf(i_0_46,negated_conjecture,
( esk24_1(X1) = X1
| r1(esk23_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vqcnvvkc/input.p',i_0_46) ).
cnf(c_0_62,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_63,negated_conjecture,
( r1(esk23_1(X1))
| r1(esk24_1(X1)) ),
i_0_47 ).
cnf(c_0_64,negated_conjecture,
( r1(esk24_1(X1))
| r2(esk23_1(X1),esk22_1(X1)) ),
i_0_45 ).
cnf(c_0_65,negated_conjecture,
( esk23_1(X1) = esk5_0
| r1(esk24_1(X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
( X1 != X2
| ~ r1(X1)
| ~ r2(X3,X2) ),
i_0_39 ).
cnf(c_0_67,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
i_0_16 ).
cnf(c_0_68,plain,
( X1 = X2
| X3 != X4
| ~ r2(X2,X4)
| ~ r2(X1,X3) ),
i_0_19 ).
cnf(c_0_69,negated_conjecture,
( r1(esk24_1(X1))
| r2(esk22_1(X1),esk21_1(X1)) ),
i_0_43 ).
cnf(c_0_70,negated_conjecture,
( esk21_1(X1) = X1
| r1(esk24_1(X1)) ),
i_0_41 ).
cnf(c_0_71,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
i_0_17 ).
cnf(c_0_72,negated_conjecture,
( r2(esk5_0,esk22_1(X1))
| r1(esk24_1(X1)) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_73,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_66]) ).
cnf(c_0_74,plain,
r2(X1,esk10_1(X1)),
inference(er,[status(thm)],[c_0_67]) ).
cnf(c_0_75,plain,
( X1 = X2
| ~ r2(X2,X3)
| ~ r2(X1,X3) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_76,negated_conjecture,
( r2(esk22_1(X1),X1)
| r1(esk24_1(X1)) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_77,plain,
( esk22_1(X1) = esk10_1(esk5_0)
| r1(esk24_1(X1)) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_78,plain,
~ r1(esk10_1(X1)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_79,plain,
( r1(X1)
| X1 != esk5_0 ),
i_0_7 ).
cnf(c_0_80,plain,
( X1 = esk5_0
| r1(esk24_1(X2))
| ~ r2(X1,esk22_1(X2)) ),
inference(spm,[status(thm)],[c_0_75,c_0_72]) ).
cnf(c_0_81,negated_conjecture,
( r2(esk10_1(esk5_0),X1)
| r1(esk24_1(X1)) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_82,plain,
esk10_1(X1) != esk5_0,
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_83,negated_conjecture,
( r1(esk24_1(esk22_1(X1)))
| r1(esk24_1(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_84,negated_conjecture,
( esk24_1(X1) = X1
| r2(esk22_1(X1),esk21_1(X1)) ),
i_0_42 ).
cnf(c_0_85,negated_conjecture,
( esk21_1(X1) = X1
| esk24_1(X1) = X1 ),
i_0_40 ).
cnf(c_0_86,plain,
( r1(esk24_1(esk10_1(esk5_0)))
| r1(esk24_1(X1)) ),
inference(spm,[status(thm)],[c_0_83,c_0_77]) ).
cnf(c_0_87,negated_conjecture,
( esk24_1(X1) = X1
| r2(esk23_1(X1),esk22_1(X1)) ),
i_0_44 ).
cnf(c_0_88,negated_conjecture,
( esk24_1(X1) = X1
| r2(esk22_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_89,plain,
r1(esk24_1(esk10_1(esk5_0))),
inference(ef,[status(thm)],[c_0_86]) ).
cnf(c_0_90,negated_conjecture,
( esk24_1(X1) = X1
| ~ r1(esk22_1(X1)) ),
inference(spm,[status(thm)],[c_0_73,c_0_87]) ).
cnf(c_0_91,plain,
( esk24_1(X1) = X1
| X2 = esk22_1(X1)
| ~ r2(X2,X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_88]) ).
cnf(c_0_92,negated_conjecture,
( r2(esk23_1(X1),esk10_1(esk5_0))
| r1(esk24_1(X1)) ),
inference(spm,[status(thm)],[c_0_64,c_0_77]) ).
cnf(c_0_93,plain,
esk24_1(esk10_1(esk5_0)) = esk5_0,
inference(spm,[status(thm)],[c_0_62,c_0_89]) ).
cnf(c_0_94,plain,
( esk24_1(X1) = X1
| esk22_1(X1) != esk5_0 ),
inference(spm,[status(thm)],[c_0_90,c_0_79]) ).
cnf(c_0_95,negated_conjecture,
( esk23_1(X1) = esk22_1(esk10_1(esk5_0))
| r1(esk24_1(X1)) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_82]) ).
cnf(c_0_96,plain,
r1(esk24_1(X1)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_93]),c_0_82]),c_0_65]) ).
cnf(c_0_97,plain,
esk24_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_62,c_0_96]) ).
cnf(c_0_98,negated_conjecture,
( esk24_1(X1) = X1
| r1(esk23_1(X1)) ),
i_0_46 ).
cnf(c_0_99,plain,
( X1 = X2
| ~ r2(X1,esk10_1(X2)) ),
inference(spm,[status(thm)],[c_0_75,c_0_74]) ).
cnf(c_0_100,negated_conjecture,
( esk5_0 = X1
| r2(esk22_1(X1),X1) ),
inference(rw,[status(thm)],[c_0_88,c_0_97]) ).
cnf(c_0_101,plain,
( esk23_1(X1) = esk5_0
| esk24_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_62,c_0_98]) ).
cnf(c_0_102,plain,
( esk5_0 = X1
| esk22_1(X1) != esk5_0 ),
inference(rw,[status(thm)],[c_0_94,c_0_97]) ).
cnf(c_0_103,plain,
esk22_1(esk10_1(X1)) = X1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_82]) ).
cnf(c_0_104,plain,
( esk23_1(X1) = esk5_0
| esk5_0 = X1 ),
inference(rw,[status(thm)],[c_0_101,c_0_97]) ).
cnf(c_0_105,plain,
X1 != esk5_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_82]) ).
cnf(c_0_106,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_104,c_0_105]),c_0_105]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN066+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 2 11:04:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.52/2.25 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 4.52/2.25 # Version: 2.1pre011
% 4.52/2.25 # Preprocessing time : 0.009 s
% 4.52/2.25
% 4.52/2.25 # Proof found!
% 4.52/2.25 # SZS status Theorem
% 4.52/2.25 # SZS output start CNFRefutation
% See solution above
% 4.52/2.25 # Proof object total steps : 59
% 4.52/2.25 # Proof object clause steps : 45
% 4.52/2.25 # Proof object formula steps : 14
% 4.52/2.25 # Proof object conjectures : 26
% 4.52/2.25 # Proof object clause conjectures : 18
% 4.52/2.25 # Proof object formula conjectures : 8
% 4.52/2.25 # Proof object initial clauses used : 14
% 4.52/2.25 # Proof object initial formulas used : 14
% 4.52/2.25 # Proof object generating inferences : 25
% 4.52/2.25 # Proof object simplifying inferences : 15
% 4.52/2.25 # Training examples: 0 positive, 0 negative
% 4.52/2.25 # Parsed axioms : 35
% 4.52/2.25 # Removed by relevancy pruning/SinE : 0
% 4.52/2.25 # Initial clauses : 35
% 4.52/2.25 # Removed in clause preprocessing : 0
% 4.52/2.25 # Initial clauses in saturation : 35
% 4.52/2.25 # Processed clauses : 498
% 4.52/2.25 # ...of these trivial : 6
% 4.52/2.25 # ...subsumed : 259
% 4.52/2.25 # ...remaining for further processing : 233
% 4.52/2.25 # Other redundant clauses eliminated : 66
% 4.52/2.25 # Clauses deleted for lack of memory : 0
% 4.52/2.25 # Backward-subsumed : 8
% 4.52/2.25 # Backward-rewritten : 137
% 4.52/2.25 # Generated clauses : 3639
% 4.52/2.25 # ...of the previous two non-trivial : 2915
% 4.52/2.25 # Contextual simplify-reflections : 120
% 4.52/2.25 # Paramodulations : 3530
% 4.52/2.25 # Factorizations : 6
% 4.52/2.25 # Equation resolutions : 91
% 4.52/2.25 # Propositional unsat checks : 0
% 4.52/2.25 # Propositional unsat check successes : 0
% 4.52/2.25 # Current number of processed clauses : 74
% 4.52/2.25 # Positive orientable unit clauses : 19
% 4.52/2.25 # Positive unorientable unit clauses: 0
% 4.52/2.25 # Negative unit clauses : 5
% 4.52/2.25 # Non-unit-clauses : 50
% 4.52/2.25 # Current number of unprocessed clauses: 91
% 4.52/2.25 # ...number of literals in the above : 218
% 4.52/2.25 # Current number of archived formulas : 0
% 4.52/2.25 # Current number of archived clauses : 157
% 4.52/2.25 # Clause-clause subsumption calls (NU) : 11314
% 4.52/2.25 # Rec. Clause-clause subsumption calls : 9737
% 4.52/2.25 # Non-unit clause-clause subsumptions : 328
% 4.52/2.25 # Unit Clause-clause subsumption calls : 401
% 4.52/2.25 # Rewrite failures with RHS unbound : 0
% 4.52/2.25 # BW rewrite match attempts : 55
% 4.52/2.25 # BW rewrite match successes : 38
% 4.52/2.25 # Condensation attempts : 0
% 4.52/2.25 # Condensation successes : 0
% 4.52/2.25 # Termbank termtop insertions : 35781
% 4.52/2.25
% 4.52/2.25 # -------------------------------------------------
% 4.52/2.25 # User time : 0.047 s
% 4.52/2.25 # System time : 0.003 s
% 4.52/2.25 # Total time : 0.050 s
% 4.52/2.25 # ...preprocessing : 0.009 s
% 4.52/2.25 # ...main loop : 0.041 s
% 4.52/2.25 # Maximum resident set size: 7136 pages
% 4.52/2.25
%------------------------------------------------------------------------------