TSTP Solution File: NUN055+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN055+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:51 EDT 2022
% Result : Theorem 7.49s 2.40s
% Output : CNFRefutation 7.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 24 unt; 0 nHn; 21 RR)
% Number of literals : 99 ( 17 equ; 67 neg)
% Maximal clause size : 9 ( 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 : 101 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fqxrn3tm/input.p',i_0_17) ).
cnf(i_0_5,plain,
r2(X1,esk3_2(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fqxrn3tm/input.p',i_0_5) ).
cnf(i_0_40,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r1(X4)
| ~ r1(X5)
| ~ r2(X3,X6)
| ~ r2(X6,X2)
| ~ r2(X5,X7)
| ~ r2(X7,X8)
| ~ r3(X4,X8,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fqxrn3tm/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-fqxrn3tm/input.p',i_0_4) ).
cnf(i_0_22,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fqxrn3tm/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-fqxrn3tm/input.p',i_0_1) ).
cnf(i_0_2,plain,
r2(esk4_2(X1,X2),esk1_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fqxrn3tm/input.p',i_0_2) ).
cnf(i_0_16,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fqxrn3tm/input.p',i_0_16) ).
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fqxrn3tm/input.p',i_0_8) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fqxrn3tm/input.p',i_0_26) ).
cnf(i_0_25,plain,
r3(X1,esk13_1(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fqxrn3tm/input.p',i_0_25) ).
cnf(c_0_52,plain,
( X1 = esk10_1(X2)
| ~ r2(X2,X1) ),
i_0_17 ).
cnf(c_0_53,plain,
r2(X1,esk3_2(X2,X1)),
i_0_5 ).
cnf(c_0_54,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r1(X4)
| ~ r1(X5)
| ~ r2(X3,X6)
| ~ r2(X6,X2)
| ~ r2(X5,X7)
| ~ r2(X7,X8)
| ~ r3(X4,X8,X1) ),
i_0_40 ).
cnf(c_0_55,plain,
r3(X1,esk3_2(X1,X2),esk1_2(X1,X2)),
i_0_4 ).
cnf(c_0_56,plain,
esk3_2(X1,X2) = esk10_1(X2),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
i_0_22 ).
cnf(c_0_58,plain,
r3(X1,X2,esk4_2(X1,X2)),
i_0_1 ).
cnf(c_0_59,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X2)
| ~ r2(X5,X3)
| ~ r2(X6,X4)
| ~ r2(X7,X5)
| ~ r1(X6)
| ~ r1(X1)
| ~ r1(X7) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_60,plain,
r3(X1,esk10_1(X2),esk1_2(X1,X2)),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
esk11_2(X1,X2) = esk4_2(X1,X2),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( ~ r2(X1,esk1_2(X2,X3))
| ~ r2(X4,esk10_1(X3))
| ~ r2(X5,X4)
| ~ r2(X6,X1)
| ~ r1(X5)
| ~ r1(X2)
| ~ r1(X6) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
r2(esk4_2(X1,X2),esk1_2(X1,X2)),
i_0_2 ).
cnf(c_0_64,plain,
( X1 = esk4_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(rw,[status(thm)],[c_0_57,c_0_61]) ).
cnf(c_0_65,plain,
( ~ r2(X1,esk4_2(X2,X3))
| ~ r2(X4,esk10_1(X3))
| ~ r2(X5,X4)
| ~ r1(X5)
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
esk4_2(X1,esk10_1(X2)) = esk1_2(X1,X2),
inference(spm,[status(thm)],[c_0_64,c_0_60]) ).
cnf(c_0_67,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
i_0_16 ).
cnf(c_0_68,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_69,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_70,plain,
( ~ r2(X1,esk10_1(esk10_1(X2)))
| ~ r2(X3,esk1_2(X4,X2))
| ~ r2(X5,X1)
| ~ r1(X5)
| ~ r1(X4)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,plain,
r2(X1,esk10_1(X1)),
inference(er,[status(thm)],[c_0_67]) ).
cnf(c_0_72,plain,
r3(X1,esk13_1(X1),X1),
i_0_25 ).
cnf(c_0_73,plain,
esk13_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_74,plain,
( ~ r2(X1,esk1_2(X2,X3))
| ~ r2(X4,esk10_1(X3))
| ~ r1(X4)
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_75,plain,
r3(X1,esk5_0,X1),
inference(rw,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,plain,
( ~ r2(X1,esk10_1(X2))
| ~ r1(esk4_2(X3,X2))
| ~ r1(X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_74,c_0_63]) ).
cnf(c_0_77,plain,
esk11_2(X1,esk5_0) = X1,
inference(spm,[status(thm)],[c_0_57,c_0_75]) ).
cnf(c_0_78,plain,
( ~ r1(esk4_2(X1,X2))
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_71]) ).
cnf(c_0_79,plain,
esk4_2(X1,esk5_0) = X1,
inference(rw,[status(thm)],[c_0_77,c_0_61]) ).
cnf(c_0_80,plain,
r1(esk5_0),
inference(rw,[status(thm)],[c_0_69,c_0_73]) ).
cnf(c_0_81,plain,
~ r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_82,plain,
$false,
inference(sr,[status(thm)],[c_0_80,c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUN055+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 2 04:45:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.49/2.40 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.49/2.40 # Version: 2.1pre011
% 7.49/2.40 # Preprocessing time : 0.009 s
% 7.49/2.40
% 7.49/2.40 # Proof found!
% 7.49/2.40 # SZS status Theorem
% 7.49/2.40 # SZS output start CNFRefutation
% See solution above
% 7.49/2.40 # Proof object total steps : 42
% 7.49/2.40 # Proof object clause steps : 31
% 7.49/2.40 # Proof object formula steps : 11
% 7.49/2.40 # Proof object conjectures : 4
% 7.49/2.40 # Proof object clause conjectures : 3
% 7.49/2.40 # Proof object formula conjectures : 1
% 7.49/2.40 # Proof object initial clauses used : 11
% 7.49/2.40 # Proof object initial formulas used : 11
% 7.49/2.40 # Proof object generating inferences : 13
% 7.49/2.40 # Proof object simplifying inferences : 9
% 7.49/2.40 # Training examples: 0 positive, 0 negative
% 7.49/2.40 # Parsed axioms : 28
% 7.49/2.40 # Removed by relevancy pruning/SinE : 0
% 7.49/2.40 # Initial clauses : 28
% 7.49/2.40 # Removed in clause preprocessing : 0
% 7.49/2.40 # Initial clauses in saturation : 28
% 7.49/2.40 # Processed clauses : 298
% 7.49/2.40 # ...of these trivial : 1
% 7.49/2.40 # ...subsumed : 84
% 7.49/2.40 # ...remaining for further processing : 213
% 7.49/2.40 # Other redundant clauses eliminated : 11
% 7.49/2.40 # Clauses deleted for lack of memory : 0
% 7.49/2.40 # Backward-subsumed : 7
% 7.49/2.40 # Backward-rewritten : 34
% 7.49/2.40 # Generated clauses : 800
% 7.49/2.40 # ...of the previous two non-trivial : 717
% 7.49/2.40 # Contextual simplify-reflections : 61
% 7.49/2.40 # Paramodulations : 772
% 7.49/2.40 # Factorizations : 0
% 7.49/2.40 # Equation resolutions : 20
% 7.49/2.40 # Propositional unsat checks : 0
% 7.49/2.40 # Propositional unsat check successes : 0
% 7.49/2.40 # Current number of processed clauses : 161
% 7.49/2.40 # Positive orientable unit clauses : 65
% 7.49/2.40 # Positive unorientable unit clauses: 0
% 7.49/2.40 # Negative unit clauses : 5
% 7.49/2.40 # Non-unit-clauses : 91
% 7.49/2.40 # Current number of unprocessed clauses: 304
% 7.49/2.40 # ...number of literals in the above : 1451
% 7.49/2.40 # Current number of archived formulas : 0
% 7.49/2.40 # Current number of archived clauses : 49
% 7.49/2.40 # Clause-clause subsumption calls (NU) : 7627
% 7.49/2.40 # Rec. Clause-clause subsumption calls : 2507
% 7.49/2.40 # Non-unit clause-clause subsumptions : 139
% 7.49/2.40 # Unit Clause-clause subsumption calls : 1611
% 7.49/2.40 # Rewrite failures with RHS unbound : 0
% 7.49/2.40 # BW rewrite match attempts : 173
% 7.49/2.40 # BW rewrite match successes : 24
% 7.49/2.40 # Condensation attempts : 0
% 7.49/2.40 # Condensation successes : 0
% 7.49/2.40 # Termbank termtop insertions : 12157
% 7.49/2.40
% 7.49/2.40 # -------------------------------------------------
% 7.49/2.40 # User time : 0.023 s
% 7.49/2.40 # System time : 0.003 s
% 7.49/2.40 # Total time : 0.026 s
% 7.49/2.40 # ...preprocessing : 0.009 s
% 7.49/2.40 # ...main loop : 0.017 s
% 7.49/2.40 # Maximum resident set size: 7140 pages
% 7.49/2.40
%------------------------------------------------------------------------------