TSTP Solution File: NUN087+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN087+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:59 EDT 2022
% Result : Theorem 7.65s 2.42s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 15 unt; 0 nHn; 7 RR)
% Number of literals : 30 ( 7 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 23 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g2o8wigz/input.p',i_0_8) ).
cnf(i_0_32,plain,
r1(esk15_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g2o8wigz/input.p',i_0_32) ).
cnf(i_0_33,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g2o8wigz/input.p',i_0_33) ).
cnf(i_0_34,plain,
r1(esk16_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g2o8wigz/input.p',i_0_34) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g2o8wigz/input.p',i_0_26) ).
cnf(i_0_40,negated_conjecture,
( X1 != X2
| ~ r1(X2)
| ~ r1(X3)
| ~ r4(X3,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g2o8wigz/input.p',i_0_40) ).
cnf(c_0_47,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_48,plain,
r1(esk15_1(X1)),
i_0_32 ).
cnf(c_0_49,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
i_0_33 ).
cnf(c_0_50,plain,
esk15_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
r1(esk16_1(X1)),
i_0_34 ).
cnf(c_0_52,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_53,negated_conjecture,
( X1 != X2
| ~ r1(X2)
| ~ r1(X3)
| ~ r4(X3,X3,X1) ),
i_0_40 ).
cnf(c_0_54,plain,
r4(X1,esk16_1(X1),esk5_0),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
esk16_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_47,c_0_51]) ).
cnf(c_0_56,plain,
esk13_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_47,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( ~ r4(X1,X1,X2)
| ~ r1(X1)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_58,plain,
r4(X1,esk5_0,esk5_0),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
r1(esk5_0),
inference(rw,[status(thm)],[c_0_52,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN087+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 2 06:22:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.65/2.42 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.65/2.42 # Version: 2.1pre011
% 7.65/2.42 # Preprocessing time : 0.018 s
% 7.65/2.42
% 7.65/2.42 # Proof found!
% 7.65/2.42 # SZS status Theorem
% 7.65/2.42 # SZS output start CNFRefutation
% See solution above
% 7.65/2.42 # Proof object total steps : 20
% 7.65/2.42 # Proof object clause steps : 14
% 7.65/2.42 # Proof object formula steps : 6
% 7.65/2.42 # Proof object conjectures : 4
% 7.65/2.42 # Proof object clause conjectures : 3
% 7.65/2.42 # Proof object formula conjectures : 1
% 7.65/2.42 # Proof object initial clauses used : 6
% 7.65/2.42 # Proof object initial formulas used : 6
% 7.65/2.42 # Proof object generating inferences : 4
% 7.65/2.42 # Proof object simplifying inferences : 6
% 7.65/2.42 # Training examples: 0 positive, 0 negative
% 7.65/2.42 # Parsed axioms : 28
% 7.65/2.42 # Removed by relevancy pruning/SinE : 0
% 7.65/2.42 # Initial clauses : 28
% 7.65/2.42 # Removed in clause preprocessing : 0
% 7.65/2.42 # Initial clauses in saturation : 28
% 7.65/2.42 # Processed clauses : 49
% 7.65/2.42 # ...of these trivial : 0
% 7.65/2.42 # ...subsumed : 0
% 7.65/2.42 # ...remaining for further processing : 49
% 7.65/2.42 # Other redundant clauses eliminated : 3
% 7.65/2.42 # Clauses deleted for lack of memory : 0
% 7.65/2.42 # Backward-subsumed : 0
% 7.65/2.42 # Backward-rewritten : 6
% 7.65/2.42 # Generated clauses : 51
% 7.65/2.42 # ...of the previous two non-trivial : 52
% 7.65/2.42 # Contextual simplify-reflections : 0
% 7.65/2.42 # Paramodulations : 45
% 7.65/2.42 # Factorizations : 0
% 7.65/2.42 # Equation resolutions : 6
% 7.65/2.42 # Propositional unsat checks : 0
% 7.65/2.42 # Propositional unsat check successes : 0
% 7.65/2.42 # Current number of processed clauses : 40
% 7.65/2.42 # Positive orientable unit clauses : 14
% 7.65/2.42 # Positive unorientable unit clauses: 0
% 7.65/2.42 # Negative unit clauses : 6
% 7.65/2.42 # Non-unit-clauses : 20
% 7.65/2.42 # Current number of unprocessed clauses: 27
% 7.65/2.42 # ...number of literals in the above : 49
% 7.65/2.42 # Current number of archived formulas : 0
% 7.65/2.42 # Current number of archived clauses : 6
% 7.65/2.42 # Clause-clause subsumption calls (NU) : 76
% 7.65/2.42 # Rec. Clause-clause subsumption calls : 62
% 7.65/2.42 # Non-unit clause-clause subsumptions : 0
% 7.65/2.42 # Unit Clause-clause subsumption calls : 69
% 7.65/2.42 # Rewrite failures with RHS unbound : 0
% 7.65/2.42 # BW rewrite match attempts : 11
% 7.65/2.42 # BW rewrite match successes : 3
% 7.65/2.42 # Condensation attempts : 0
% 7.65/2.42 # Condensation successes : 0
% 7.65/2.42 # Termbank termtop insertions : 773
% 7.65/2.42
% 7.65/2.42 # -------------------------------------------------
% 7.65/2.42 # User time : 0.013 s
% 7.65/2.42 # System time : 0.007 s
% 7.65/2.42 # Total time : 0.020 s
% 7.65/2.42 # ...preprocessing : 0.018 s
% 7.65/2.42 # ...main loop : 0.002 s
% 7.65/2.42 # Maximum resident set size: 7132 pages
% 7.65/2.42
%------------------------------------------------------------------------------