TSTP Solution File: NUN089+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN089+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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.33s 2.28s
% Output : CNFRefutation 7.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 11 RR)
% Number of literals : 16 ( 4 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 8 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_39,plain,
( X1 != X2
| ~ r1(X1)
| ~ r2(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3l5oosr1/input.p',i_0_39) ).
cnf(i_0_42,negated_conjecture,
r2(esk22_0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3l5oosr1/input.p',i_0_42) ).
cnf(i_0_41,negated_conjecture,
esk24_0 = esk21_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3l5oosr1/input.p',i_0_41) ).
cnf(i_0_40,negated_conjecture,
r1(esk24_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3l5oosr1/input.p',i_0_40) ).
cnf(c_0_47,plain,
( X1 != X2
| ~ r1(X1)
| ~ r2(X3,X2) ),
i_0_39 ).
cnf(c_0_48,negated_conjecture,
r2(esk22_0,esk21_0),
i_0_42 ).
cnf(c_0_49,negated_conjecture,
esk24_0 = esk21_0,
i_0_41 ).
cnf(c_0_50,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
r2(esk22_0,esk24_0),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
r1(esk24_0),
i_0_40 ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN089+2 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 04:19:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.33/2.28 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.33/2.28 # Version: 2.1pre011
% 7.33/2.28 # Preprocessing time : 0.009 s
% 7.33/2.28
% 7.33/2.28 # Proof found!
% 7.33/2.28 # SZS status Theorem
% 7.33/2.28 # SZS output start CNFRefutation
% See solution above
% 7.33/2.28 # Proof object total steps : 11
% 7.33/2.28 # Proof object clause steps : 7
% 7.33/2.28 # Proof object formula steps : 4
% 7.33/2.28 # Proof object conjectures : 8
% 7.33/2.28 # Proof object clause conjectures : 5
% 7.33/2.28 # Proof object formula conjectures : 3
% 7.33/2.28 # Proof object initial clauses used : 4
% 7.33/2.28 # Proof object initial formulas used : 4
% 7.33/2.28 # Proof object generating inferences : 1
% 7.33/2.28 # Proof object simplifying inferences : 4
% 7.33/2.28 # Training examples: 0 positive, 0 negative
% 7.33/2.28 # Parsed axioms : 32
% 7.33/2.28 # Removed by relevancy pruning/SinE : 0
% 7.33/2.28 # Initial clauses : 32
% 7.33/2.28 # Removed in clause preprocessing : 0
% 7.33/2.28 # Initial clauses in saturation : 32
% 7.33/2.28 # Processed clauses : 33
% 7.33/2.28 # ...of these trivial : 0
% 7.33/2.28 # ...subsumed : 0
% 7.33/2.28 # ...remaining for further processing : 33
% 7.33/2.28 # Other redundant clauses eliminated : 2
% 7.33/2.28 # Clauses deleted for lack of memory : 0
% 7.33/2.28 # Backward-subsumed : 0
% 7.33/2.28 # Backward-rewritten : 0
% 7.33/2.28 # Generated clauses : 35
% 7.33/2.28 # ...of the previous two non-trivial : 30
% 7.33/2.28 # Contextual simplify-reflections : 0
% 7.33/2.28 # Paramodulations : 30
% 7.33/2.28 # Factorizations : 0
% 7.33/2.28 # Equation resolutions : 5
% 7.33/2.28 # Propositional unsat checks : 0
% 7.33/2.28 # Propositional unsat check successes : 0
% 7.33/2.28 # Current number of processed clauses : 31
% 7.33/2.28 # Positive orientable unit clauses : 18
% 7.33/2.28 # Positive unorientable unit clauses: 0
% 7.33/2.28 # Negative unit clauses : 0
% 7.33/2.28 # Non-unit-clauses : 13
% 7.33/2.28 # Current number of unprocessed clauses: 26
% 7.33/2.28 # ...number of literals in the above : 34
% 7.33/2.28 # Current number of archived formulas : 0
% 7.33/2.28 # Current number of archived clauses : 0
% 7.33/2.28 # Clause-clause subsumption calls (NU) : 13
% 7.33/2.28 # Rec. Clause-clause subsumption calls : 13
% 7.33/2.28 # Non-unit clause-clause subsumptions : 0
% 7.33/2.28 # Unit Clause-clause subsumption calls : 6
% 7.33/2.28 # Rewrite failures with RHS unbound : 0
% 7.33/2.28 # BW rewrite match attempts : 2
% 7.33/2.28 # BW rewrite match successes : 0
% 7.33/2.28 # Condensation attempts : 0
% 7.33/2.28 # Condensation successes : 0
% 7.33/2.28 # Termbank termtop insertions : 583
% 7.33/2.28
% 7.33/2.28 # -------------------------------------------------
% 7.33/2.28 # User time : 0.010 s
% 7.33/2.28 # System time : 0.000 s
% 7.33/2.28 # Total time : 0.010 s
% 7.33/2.28 # ...preprocessing : 0.009 s
% 7.33/2.28 # ...main loop : 0.001 s
% 7.33/2.28 # Maximum resident set size: 7128 pages
% 7.33/2.28
%------------------------------------------------------------------------------