TSTP Solution File: NUN056+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN056+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:52 EDT 2022
% Result : Theorem 8.56s 2.45s
% Output : CNFRefutation 8.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of clauses : 47 ( 27 unt; 0 nHn; 23 RR)
% Number of literals : 123 ( 19 equ; 87 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 121 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-045i1rzy/input.p',i_0_8) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-045i1rzy/input.p',i_0_26) ).
cnf(i_0_25,plain,
r3(X1,esk13_1(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-045i1rzy/input.p',i_0_25) ).
cnf(i_0_22,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-045i1rzy/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-045i1rzy/input.p',i_0_1) ).
cnf(i_0_17,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-045i1rzy/input.p',i_0_17) ).
cnf(i_0_5,plain,
r2(X1,esk3_2(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-045i1rzy/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-045i1rzy/input.p',i_0_2) ).
cnf(i_0_40,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r1(X4)
| ~ r1(X5)
| ~ r2(X3,X6)
| ~ r2(X6,X7)
| ~ r2(X4,X8)
| ~ r2(X5,X9)
| ~ r2(X9,X10)
| ~ r2(X10,X2)
| ~ r3(X8,X7,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-045i1rzy/input.p',i_0_40) ).
cnf(i_0_4,plain,
r3(X1,esk3_2(X1,X2),esk1_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-045i1rzy/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-045i1rzy/input.p',i_0_16) ).
cnf(c_0_52,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_53,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_54,plain,
r3(X1,esk13_1(X1),X1),
i_0_25 ).
cnf(c_0_55,plain,
esk13_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
i_0_22 ).
cnf(c_0_57,plain,
r3(X1,esk5_0,X1),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
esk11_2(X1,esk5_0) = X1,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,plain,
( X1 = X2
| ~ r3(X2,esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_58]) ).
cnf(c_0_60,plain,
r3(X1,X2,esk4_2(X1,X2)),
i_0_1 ).
cnf(c_0_61,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
i_0_17 ).
cnf(c_0_62,plain,
r2(X1,esk3_2(X2,X1)),
i_0_5 ).
cnf(c_0_63,plain,
r2(esk4_2(X1,X2),esk1_2(X1,X2)),
i_0_2 ).
cnf(c_0_64,plain,
esk4_2(X1,esk5_0) = X1,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r1(X4)
| ~ r1(X5)
| ~ r2(X3,X6)
| ~ r2(X6,X7)
| ~ r2(X4,X8)
| ~ r2(X5,X9)
| ~ r2(X9,X10)
| ~ r2(X10,X2)
| ~ r3(X8,X7,X1) ),
i_0_40 ).
cnf(c_0_66,plain,
r3(X1,esk3_2(X1,X2),esk1_2(X1,X2)),
i_0_4 ).
cnf(c_0_67,plain,
esk3_2(X1,X2) = esk10_1(X2),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,plain,
r2(X1,esk1_2(X1,esk5_0)),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X3)
| ~ r2(X5,X4)
| ~ r2(X6,X2)
| ~ r2(X7,X5)
| ~ r2(X8,X1)
| ~ r2(X9,X6)
| ~ r1(X7)
| ~ r1(X8)
| ~ r1(X9) ),
inference(er,[status(thm)],[c_0_65]) ).
cnf(c_0_70,plain,
r3(X1,esk10_1(X2),esk1_2(X1,X2)),
inference(rw,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,plain,
esk11_2(X1,X2) = esk4_2(X1,X2),
inference(spm,[status(thm)],[c_0_56,c_0_60]) ).
cnf(c_0_72,plain,
esk1_2(X1,esk5_0) = esk10_1(X1),
inference(spm,[status(thm)],[c_0_61,c_0_68]) ).
cnf(c_0_73,negated_conjecture,
( ~ r2(X1,esk1_2(X2,X3))
| ~ r2(X4,esk10_1(X3))
| ~ r2(X5,X1)
| ~ r2(X6,X5)
| ~ r2(X7,X2)
| ~ r2(X8,X4)
| ~ r1(X6)
| ~ r1(X7)
| ~ r1(X8) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,plain,
( X1 = esk4_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(rw,[status(thm)],[c_0_56,c_0_71]) ).
cnf(c_0_75,plain,
r3(X1,esk10_1(esk5_0),esk10_1(X1)),
inference(spm,[status(thm)],[c_0_70,c_0_72]) ).
cnf(c_0_76,plain,
( ~ r2(X1,esk4_2(X2,X3))
| ~ r2(X4,esk10_1(X3))
| ~ r2(X5,X1)
| ~ r2(X6,X2)
| ~ r2(X7,X4)
| ~ r1(X5)
| ~ r1(X6)
| ~ r1(X7) ),
inference(spm,[status(thm)],[c_0_73,c_0_63]) ).
cnf(c_0_77,plain,
esk4_2(X1,esk10_1(esk5_0)) = esk10_1(X1),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
i_0_16 ).
cnf(c_0_79,plain,
( ~ r2(X1,esk10_1(esk10_1(esk5_0)))
| ~ r2(X2,esk10_1(X3))
| ~ r2(X4,X2)
| ~ r2(X5,X3)
| ~ r2(X6,X1)
| ~ r1(X4)
| ~ r1(X5)
| ~ r1(X6) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,plain,
r2(X1,esk10_1(X1)),
inference(er,[status(thm)],[c_0_78]) ).
cnf(c_0_81,plain,
( ~ r2(X1,esk10_1(esk5_0))
| ~ r2(X2,esk10_1(X3))
| ~ r2(X4,X2)
| ~ r2(X5,X3)
| ~ r1(X4)
| ~ r1(X5)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_82,plain,
r1(esk5_0),
inference(rw,[status(thm)],[c_0_53,c_0_55]) ).
cnf(c_0_83,plain,
( ~ r2(X1,esk10_1(X2))
| ~ r2(X3,X1)
| ~ r2(X4,X2)
| ~ r1(X3)
| ~ r1(X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_80]),c_0_82])]) ).
cnf(c_0_84,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X2)
| ~ r1(X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_83,c_0_80]) ).
cnf(c_0_85,plain,
( ~ r2(X1,esk10_1(X2))
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_80]) ).
cnf(c_0_86,plain,
~ r1(X1),
inference(spm,[status(thm)],[c_0_85,c_0_80]) ).
cnf(c_0_87,plain,
$false,
inference(sr,[status(thm)],[c_0_82,c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUN056+2 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n019.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 03:06:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.56/2.45 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.56/2.45 # Version: 2.1pre011
% 8.56/2.45 # Preprocessing time : 0.017 s
% 8.56/2.45
% 8.56/2.45 # Proof found!
% 8.56/2.45 # SZS status Theorem
% 8.56/2.45 # SZS output start CNFRefutation
% See solution above
% 8.56/2.45 # Proof object total steps : 47
% 8.56/2.45 # Proof object clause steps : 36
% 8.56/2.45 # Proof object formula steps : 11
% 8.56/2.45 # Proof object conjectures : 4
% 8.56/2.45 # Proof object clause conjectures : 3
% 8.56/2.45 # Proof object formula conjectures : 1
% 8.56/2.45 # Proof object initial clauses used : 11
% 8.56/2.45 # Proof object initial formulas used : 11
% 8.56/2.45 # Proof object generating inferences : 19
% 8.56/2.45 # Proof object simplifying inferences : 8
% 8.56/2.45 # Training examples: 0 positive, 0 negative
% 8.56/2.45 # Parsed axioms : 28
% 8.56/2.45 # Removed by relevancy pruning/SinE : 0
% 8.56/2.45 # Initial clauses : 28
% 8.56/2.45 # Removed in clause preprocessing : 0
% 8.56/2.45 # Initial clauses in saturation : 28
% 8.56/2.45 # Processed clauses : 205
% 8.56/2.45 # ...of these trivial : 0
% 8.56/2.45 # ...subsumed : 46
% 8.56/2.45 # ...remaining for further processing : 159
% 8.56/2.45 # Other redundant clauses eliminated : 9
% 8.56/2.45 # Clauses deleted for lack of memory : 0
% 8.56/2.45 # Backward-subsumed : 3
% 8.56/2.45 # Backward-rewritten : 25
% 8.56/2.45 # Generated clauses : 427
% 8.56/2.45 # ...of the previous two non-trivial : 349
% 8.56/2.45 # Contextual simplify-reflections : 26
% 8.56/2.45 # Paramodulations : 405
% 8.56/2.45 # Factorizations : 0
% 8.56/2.45 # Equation resolutions : 16
% 8.56/2.45 # Propositional unsat checks : 0
% 8.56/2.45 # Propositional unsat check successes : 0
% 8.56/2.45 # Current number of processed clauses : 122
% 8.56/2.45 # Positive orientable unit clauses : 47
% 8.56/2.45 # Positive unorientable unit clauses: 0
% 8.56/2.45 # Negative unit clauses : 5
% 8.56/2.45 # Non-unit-clauses : 70
% 8.56/2.45 # Current number of unprocessed clauses: 95
% 8.56/2.45 # ...number of literals in the above : 378
% 8.56/2.45 # Current number of archived formulas : 0
% 8.56/2.45 # Current number of archived clauses : 34
% 8.56/2.45 # Clause-clause subsumption calls (NU) : 5952
% 8.56/2.45 # Rec. Clause-clause subsumption calls : 1711
% 8.56/2.45 # Non-unit clause-clause subsumptions : 64
% 8.56/2.45 # Unit Clause-clause subsumption calls : 649
% 8.56/2.45 # Rewrite failures with RHS unbound : 0
% 8.56/2.45 # BW rewrite match attempts : 79
% 8.56/2.45 # BW rewrite match successes : 16
% 8.56/2.45 # Condensation attempts : 0
% 8.56/2.45 # Condensation successes : 0
% 8.56/2.45 # Termbank termtop insertions : 6347
% 8.56/2.45
% 8.56/2.45 # -------------------------------------------------
% 8.56/2.45 # User time : 0.028 s
% 8.56/2.45 # System time : 0.007 s
% 8.56/2.45 # Total time : 0.035 s
% 8.56/2.45 # ...preprocessing : 0.017 s
% 8.56/2.45 # ...main loop : 0.018 s
% 8.56/2.45 # Maximum resident set size: 7136 pages
% 8.56/2.45
%------------------------------------------------------------------------------