TSTP Solution File: NUN060+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN060+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:53 EDT 2022
% Result : Theorem 5.21s 2.35s
% Output : CNFRefutation 5.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 9 unt; 0 nHn; 14 RR)
% Number of literals : 51 ( 7 equ; 39 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 52 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r2(X3,X4)
| ~ r2(X4,X5)
| ~ r2(X5,X6)
| ~ r2(X6,X7)
| ~ r3(X8,X7,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sjnvsv82/input.p',i_0_40) ).
cnf(i_0_11,plain,
r3(esk9_2(X1,X2),X1,esk6_2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sjnvsv82/input.p',i_0_11) ).
cnf(i_0_16,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sjnvsv82/input.p',i_0_16) ).
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sjnvsv82/input.p',i_0_8) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sjnvsv82/input.p',i_0_26) ).
cnf(c_0_46,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r2(X3,X4)
| ~ r2(X4,X5)
| ~ r2(X5,X6)
| ~ r2(X6,X7)
| ~ r3(X8,X7,X1) ),
i_0_40 ).
cnf(c_0_47,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X2)
| ~ r2(X5,X4)
| ~ r2(X6,X5)
| ~ r2(X7,X6)
| ~ r1(X7) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_48,plain,
r3(esk9_2(X1,X2),X1,esk6_2(X1,X2)),
i_0_11 ).
cnf(c_0_49,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
i_0_16 ).
cnf(c_0_50,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r2(X4,X3)
| ~ r2(X5,X4)
| ~ r1(X5) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
r2(X1,esk10_1(X1)),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_52,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r2(X4,X3)
| ~ r1(X4) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_54,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_55,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_56,plain,
esk13_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( ~ r2(X1,X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_51]) ).
cnf(c_0_58,plain,
r1(esk5_0),
inference(rw,[status(thm)],[c_0_54,c_0_56]) ).
cnf(c_0_59,plain,
~ r1(X1),
inference(spm,[status(thm)],[c_0_57,c_0_51]) ).
cnf(c_0_60,plain,
$false,
inference(sr,[status(thm)],[c_0_58,c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUN060+2 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n024.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 10:01:37 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
% 5.21/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 5.21/2.35 # Version: 2.1pre011
% 5.21/2.35 # Preprocessing time : 0.018 s
% 5.21/2.35
% 5.21/2.35 # Proof found!
% 5.21/2.35 # SZS status Theorem
% 5.21/2.35 # SZS output start CNFRefutation
% See solution above
% 5.21/2.35 # Proof object total steps : 20
% 5.21/2.35 # Proof object clause steps : 15
% 5.21/2.35 # Proof object formula steps : 5
% 5.21/2.35 # Proof object conjectures : 3
% 5.21/2.35 # Proof object clause conjectures : 2
% 5.21/2.35 # Proof object formula conjectures : 1
% 5.21/2.35 # Proof object initial clauses used : 5
% 5.21/2.35 # Proof object initial formulas used : 5
% 5.21/2.35 # Proof object generating inferences : 7
% 5.21/2.35 # Proof object simplifying inferences : 3
% 5.21/2.35 # Training examples: 0 positive, 0 negative
% 5.21/2.35 # Parsed axioms : 28
% 5.21/2.35 # Removed by relevancy pruning/SinE : 0
% 5.21/2.35 # Initial clauses : 28
% 5.21/2.35 # Removed in clause preprocessing : 0
% 5.21/2.35 # Initial clauses in saturation : 28
% 5.21/2.35 # Processed clauses : 55
% 5.21/2.35 # ...of these trivial : 0
% 5.21/2.35 # ...subsumed : 0
% 5.21/2.35 # ...remaining for further processing : 55
% 5.21/2.35 # Other redundant clauses eliminated : 4
% 5.21/2.35 # Clauses deleted for lack of memory : 0
% 5.21/2.35 # Backward-subsumed : 4
% 5.21/2.35 # Backward-rewritten : 5
% 5.21/2.35 # Generated clauses : 87
% 5.21/2.35 # ...of the previous two non-trivial : 84
% 5.21/2.35 # Contextual simplify-reflections : 0
% 5.21/2.35 # Paramodulations : 77
% 5.21/2.35 # Factorizations : 0
% 5.21/2.35 # Equation resolutions : 7
% 5.21/2.35 # Propositional unsat checks : 0
% 5.21/2.35 # Propositional unsat check successes : 0
% 5.21/2.35 # Current number of processed clauses : 40
% 5.21/2.35 # Positive orientable unit clauses : 16
% 5.21/2.35 # Positive unorientable unit clauses: 0
% 5.21/2.35 # Negative unit clauses : 8
% 5.21/2.35 # Non-unit-clauses : 16
% 5.21/2.35 # Current number of unprocessed clauses: 29
% 5.21/2.35 # ...number of literals in the above : 49
% 5.21/2.35 # Current number of archived formulas : 0
% 5.21/2.35 # Current number of archived clauses : 12
% 5.21/2.35 # Clause-clause subsumption calls (NU) : 195
% 5.21/2.35 # Rec. Clause-clause subsumption calls : 91
% 5.21/2.35 # Non-unit clause-clause subsumptions : 4
% 5.21/2.35 # Unit Clause-clause subsumption calls : 97
% 5.21/2.35 # Rewrite failures with RHS unbound : 0
% 5.21/2.35 # BW rewrite match attempts : 13
% 5.21/2.35 # BW rewrite match successes : 3
% 5.21/2.35 # Condensation attempts : 0
% 5.21/2.35 # Condensation successes : 0
% 5.21/2.35 # Termbank termtop insertions : 1108
% 5.21/2.35
% 5.21/2.35 # -------------------------------------------------
% 5.21/2.35 # User time : 0.014 s
% 5.21/2.35 # System time : 0.007 s
% 5.21/2.35 # Total time : 0.021 s
% 5.21/2.35 # ...preprocessing : 0.018 s
% 5.21/2.35 # ...main loop : 0.002 s
% 5.21/2.35 # Maximum resident set size: 7128 pages
% 5.21/2.35
%------------------------------------------------------------------------------