TSTP Solution File: NUN086+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN086+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 7.32s 2.51s
% Output : CNFRefutation 7.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 52 ( 35 unt; 0 nHn; 19 RR)
% Number of literals : 84 ( 23 equ; 39 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 87 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_8) ).
cnf(i_0_32,plain,
r1(esk15_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_32) ).
cnf(i_0_33,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_33) ).
cnf(i_0_34,plain,
r1(esk16_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_34) ).
cnf(i_0_29,plain,
( X1 = esk14_2(X2,X3)
| ~ r4(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_29) ).
cnf(i_0_40,negated_conjecture,
( X1 != X2
| ~ r1(X2)
| ~ r1(X3)
| ~ r1(X4)
| ~ r2(X4,X5)
| ~ r4(X3,X5,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_40) ).
cnf(i_0_13,plain,
r4(X1,esk8_2(X1,X2),esk6_2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_13) ).
cnf(i_0_22,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_22) ).
cnf(i_0_1,plain,
r3(X1,X2,esk4_2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_1) ).
cnf(i_0_10,plain,
r4(X1,X2,esk9_2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_10) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_26) ).
cnf(i_0_14,plain,
r2(X1,esk8_2(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_14) ).
cnf(i_0_11,plain,
r3(esk9_2(X1,X2),X1,esk6_2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_11) ).
cnf(i_0_25,plain,
r3(X1,esk13_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_25) ).
cnf(i_0_7,plain,
( r1(X1)
| X1 != esk5_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-worzif8g/input.p',i_0_7) ).
cnf(c_0_56,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_57,plain,
r1(esk15_1(X1)),
i_0_32 ).
cnf(c_0_58,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
i_0_33 ).
cnf(c_0_59,plain,
esk15_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
r1(esk16_1(X1)),
i_0_34 ).
cnf(c_0_61,plain,
r4(X1,esk16_1(X1),esk5_0),
inference(rw,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
esk16_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_56,c_0_60]) ).
cnf(c_0_63,plain,
( X1 = esk14_2(X2,X3)
| ~ r4(X2,X3,X1) ),
i_0_29 ).
cnf(c_0_64,plain,
r4(X1,esk5_0,esk5_0),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
( X1 != X2
| ~ r1(X2)
| ~ r1(X3)
| ~ r1(X4)
| ~ r2(X4,X5)
| ~ r4(X3,X5,X1) ),
i_0_40 ).
cnf(c_0_66,plain,
esk14_2(X1,esk5_0) = esk5_0,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( ~ r4(X1,X2,X3)
| ~ r2(X4,X2)
| ~ r1(X4)
| ~ r1(X1)
| ~ r1(X3) ),
inference(er,[status(thm)],[c_0_65]) ).
cnf(c_0_68,plain,
r4(X1,esk8_2(X1,X2),esk6_2(X1,X2)),
i_0_13 ).
cnf(c_0_69,plain,
( X1 = esk11_2(X2,X3)
| ~ r3(X2,X3,X1) ),
i_0_22 ).
cnf(c_0_70,plain,
r3(X1,X2,esk4_2(X1,X2)),
i_0_1 ).
cnf(c_0_71,plain,
( X1 = esk5_0
| ~ r4(X2,esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_66]) ).
cnf(c_0_72,plain,
r4(X1,X2,esk9_2(X1,X2)),
i_0_10 ).
cnf(c_0_73,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_74,plain,
( ~ r2(X1,esk8_2(X2,X3))
| ~ r1(esk6_2(X2,X3))
| ~ r1(X1)
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_75,plain,
r2(X1,esk8_2(X2,X1)),
i_0_14 ).
cnf(c_0_76,plain,
esk11_2(X1,X2) = esk4_2(X1,X2),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_77,plain,
r3(esk9_2(X1,X2),X1,esk6_2(X1,X2)),
i_0_11 ).
cnf(c_0_78,plain,
esk9_2(X1,esk5_0) = esk5_0,
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_79,plain,
r3(X1,esk13_1(X1),X1),
i_0_25 ).
cnf(c_0_80,plain,
esk13_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_56,c_0_73]) ).
cnf(c_0_81,plain,
( ~ r1(esk6_2(X1,X2))
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,plain,
( r1(X1)
| X1 != esk5_0 ),
i_0_7 ).
cnf(c_0_83,plain,
( X1 = esk4_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(rw,[status(thm)],[c_0_69,c_0_76]) ).
cnf(c_0_84,plain,
r3(esk5_0,X1,esk6_2(X1,esk5_0)),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,plain,
r3(X1,esk5_0,X1),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_86,plain,
( esk6_2(X1,X2) != esk5_0
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
esk6_2(X1,esk5_0) = esk4_2(esk5_0,X1),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,plain,
r1(esk5_0),
inference(rw,[status(thm)],[c_0_73,c_0_80]) ).
cnf(c_0_89,plain,
esk11_2(X1,esk5_0) = X1,
inference(spm,[status(thm)],[c_0_69,c_0_85]) ).
cnf(c_0_90,plain,
( esk4_2(esk5_0,X1) != esk5_0
| ~ r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88])]) ).
cnf(c_0_91,plain,
esk4_2(X1,esk5_0) = X1,
inference(rw,[status(thm)],[c_0_89,c_0_76]) ).
cnf(c_0_92,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_88])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUN086+2 : TPTP v8.1.0. Released v7.3.0.
% 0.08/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 2 06:33:18 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.32/2.51 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.32/2.51 # Version: 2.1pre011
% 7.32/2.51 # Preprocessing time : 0.015 s
% 7.32/2.51
% 7.32/2.51 # Proof found!
% 7.32/2.51 # SZS status Theorem
% 7.32/2.51 # SZS output start CNFRefutation
% See solution above
% 7.32/2.51 # Proof object total steps : 52
% 7.32/2.51 # Proof object clause steps : 37
% 7.32/2.51 # Proof object formula steps : 15
% 7.32/2.51 # Proof object conjectures : 3
% 7.32/2.51 # Proof object clause conjectures : 2
% 7.32/2.51 # Proof object formula conjectures : 1
% 7.32/2.51 # Proof object initial clauses used : 15
% 7.32/2.51 # Proof object initial formulas used : 15
% 7.32/2.51 # Proof object generating inferences : 15
% 7.32/2.51 # Proof object simplifying inferences : 11
% 7.32/2.51 # Training examples: 0 positive, 0 negative
% 7.32/2.51 # Parsed axioms : 28
% 7.32/2.51 # Removed by relevancy pruning/SinE : 0
% 7.32/2.51 # Initial clauses : 28
% 7.32/2.51 # Removed in clause preprocessing : 0
% 7.32/2.51 # Initial clauses in saturation : 28
% 7.32/2.51 # Processed clauses : 160
% 7.32/2.51 # ...of these trivial : 1
% 7.32/2.51 # ...subsumed : 43
% 7.32/2.51 # ...remaining for further processing : 116
% 7.32/2.51 # Other redundant clauses eliminated : 7
% 7.32/2.51 # Clauses deleted for lack of memory : 0
% 7.32/2.51 # Backward-subsumed : 1
% 7.32/2.51 # Backward-rewritten : 29
% 7.32/2.51 # Generated clauses : 243
% 7.32/2.51 # ...of the previous two non-trivial : 216
% 7.32/2.51 # Contextual simplify-reflections : 19
% 7.32/2.51 # Paramodulations : 230
% 7.32/2.51 # Factorizations : 0
% 7.32/2.51 # Equation resolutions : 13
% 7.32/2.51 # Propositional unsat checks : 0
% 7.32/2.51 # Propositional unsat check successes : 0
% 7.32/2.51 # Current number of processed clauses : 83
% 7.32/2.51 # Positive orientable unit clauses : 24
% 7.32/2.51 # Positive unorientable unit clauses: 0
% 7.32/2.51 # Negative unit clauses : 4
% 7.32/2.51 # Non-unit-clauses : 55
% 7.32/2.51 # Current number of unprocessed clauses: 61
% 7.32/2.51 # ...number of literals in the above : 173
% 7.32/2.51 # Current number of archived formulas : 0
% 7.32/2.51 # Current number of archived clauses : 30
% 7.32/2.51 # Clause-clause subsumption calls (NU) : 1679
% 7.32/2.51 # Rec. Clause-clause subsumption calls : 911
% 7.32/2.51 # Non-unit clause-clause subsumptions : 55
% 7.32/2.51 # Unit Clause-clause subsumption calls : 156
% 7.32/2.51 # Rewrite failures with RHS unbound : 0
% 7.32/2.51 # BW rewrite match attempts : 34
% 7.32/2.51 # BW rewrite match successes : 19
% 7.32/2.51 # Condensation attempts : 0
% 7.32/2.51 # Condensation successes : 0
% 7.32/2.51 # Termbank termtop insertions : 2877
% 7.32/2.51
% 7.32/2.51 # -------------------------------------------------
% 7.32/2.51 # User time : 0.018 s
% 7.32/2.51 # System time : 0.004 s
% 7.32/2.51 # Total time : 0.022 s
% 7.32/2.51 # ...preprocessing : 0.015 s
% 7.32/2.51 # ...main loop : 0.007 s
% 7.32/2.51 # Maximum resident set size: 7136 pages
% 7.32/2.51
%------------------------------------------------------------------------------