TSTP Solution File: NUN069+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN069+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:55 EDT 2022
% Result : Theorem 8.47s 2.55s
% Output : CNFRefutation 8.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 4 RR)
% Number of literals : 10 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 11 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,negated_conjecture,
( ~ r1(X1)
| ~ r2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gumerbw4/input.p',i_0_40) ).
cnf(i_0_5,plain,
r2(X1,esk3_2(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gumerbw4/input.p',i_0_5) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gumerbw4/input.p',i_0_26) ).
cnf(c_0_44,negated_conjecture,
( ~ r1(X1)
| ~ r2(X1,X2) ),
i_0_40 ).
cnf(c_0_45,plain,
r2(X1,esk3_2(X2,X1)),
i_0_5 ).
cnf(c_0_46,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_47,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[c_0_46,c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN069+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 2 05:00:09 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.46 # 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
% 8.47/2.55 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.47/2.55 # Version: 2.1pre011
% 8.47/2.55 # Preprocessing time : 0.017 s
% 8.47/2.55
% 8.47/2.55 # Proof found!
% 8.47/2.55 # SZS status Theorem
% 8.47/2.55 # SZS output start CNFRefutation
% See solution above
% 8.47/2.55 # Proof object total steps : 8
% 8.47/2.55 # Proof object clause steps : 5
% 8.47/2.55 # Proof object formula steps : 3
% 8.47/2.55 # Proof object conjectures : 3
% 8.47/2.55 # Proof object clause conjectures : 2
% 8.47/2.55 # Proof object formula conjectures : 1
% 8.47/2.55 # Proof object initial clauses used : 3
% 8.47/2.55 # Proof object initial formulas used : 3
% 8.47/2.55 # Proof object generating inferences : 1
% 8.47/2.55 # Proof object simplifying inferences : 1
% 8.47/2.55 # Training examples: 0 positive, 0 negative
% 8.47/2.55 # Parsed axioms : 28
% 8.47/2.55 # Removed by relevancy pruning/SinE : 0
% 8.47/2.55 # Initial clauses : 28
% 8.47/2.55 # Removed in clause preprocessing : 0
% 8.47/2.55 # Initial clauses in saturation : 28
% 8.47/2.55 # Processed clauses : 30
% 8.47/2.55 # ...of these trivial : 0
% 8.47/2.55 # ...subsumed : 0
% 8.47/2.55 # ...remaining for further processing : 30
% 8.47/2.55 # Other redundant clauses eliminated : 2
% 8.47/2.55 # Clauses deleted for lack of memory : 0
% 8.47/2.55 # Backward-subsumed : 0
% 8.47/2.55 # Backward-rewritten : 0
% 8.47/2.55 # Generated clauses : 40
% 8.47/2.55 # ...of the previous two non-trivial : 35
% 8.47/2.55 # Contextual simplify-reflections : 0
% 8.47/2.55 # Paramodulations : 30
% 8.47/2.55 # Factorizations : 0
% 8.47/2.55 # Equation resolutions : 5
% 8.47/2.55 # Propositional unsat checks : 0
% 8.47/2.55 # Propositional unsat check successes : 0
% 8.47/2.55 # Current number of processed clauses : 23
% 8.47/2.55 # Positive orientable unit clauses : 10
% 8.47/2.55 # Positive unorientable unit clauses: 0
% 8.47/2.55 # Negative unit clauses : 1
% 8.47/2.55 # Non-unit-clauses : 12
% 8.47/2.55 # Current number of unprocessed clauses: 23
% 8.47/2.55 # ...number of literals in the above : 29
% 8.47/2.55 # Current number of archived formulas : 0
% 8.47/2.55 # Current number of archived clauses : 5
% 8.47/2.55 # Clause-clause subsumption calls (NU) : 32
% 8.47/2.55 # Rec. Clause-clause subsumption calls : 29
% 8.47/2.55 # Non-unit clause-clause subsumptions : 0
% 8.47/2.55 # Unit Clause-clause subsumption calls : 4
% 8.47/2.55 # Rewrite failures with RHS unbound : 0
% 8.47/2.55 # BW rewrite match attempts : 4
% 8.47/2.55 # BW rewrite match successes : 0
% 8.47/2.55 # Condensation attempts : 0
% 8.47/2.55 # Condensation successes : 0
% 8.47/2.55 # Termbank termtop insertions : 566
% 8.47/2.55
% 8.47/2.55 # -------------------------------------------------
% 8.47/2.55 # User time : 0.015 s
% 8.47/2.55 # System time : 0.003 s
% 8.47/2.55 # Total time : 0.018 s
% 8.47/2.55 # ...preprocessing : 0.017 s
% 8.47/2.55 # ...main loop : 0.001 s
% 8.47/2.55 # Maximum resident set size: 7128 pages
% 8.47/2.55
%------------------------------------------------------------------------------