TSTP Solution File: NUN088+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN088+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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 8.10s 2.48s
% Output : CNFRefutation 8.10s
% 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/sandbox2/tmp/enigma-theBenchmark.p-fw0_1k1b/input.p',i_0_39) ).
cnf(i_0_40,negated_conjecture,
r2(esk23_0,esk21_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fw0_1k1b/input.p',i_0_40) ).
cnf(i_0_42,negated_conjecture,
esk22_0 = esk21_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fw0_1k1b/input.p',i_0_42) ).
cnf(i_0_43,negated_conjecture,
r1(esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fw0_1k1b/input.p',i_0_43) ).
cnf(c_0_48,plain,
( X1 != X2
| ~ r1(X1)
| ~ r2(X3,X2) ),
i_0_39 ).
cnf(c_0_49,negated_conjecture,
r2(esk23_0,esk21_0),
i_0_40 ).
cnf(c_0_50,negated_conjecture,
esk22_0 = esk21_0,
i_0_42 ).
cnf(c_0_51,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_52,negated_conjecture,
r2(esk23_0,esk22_0),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
r1(esk22_0),
i_0_43 ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUN088+2 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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 05:32:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.41 # ENIGMATIC: Selected SinE mode:
% 0.19/0.42 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.42 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.42 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.42 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.10/2.48 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.10/2.48 # Version: 2.1pre011
% 8.10/2.48 # Preprocessing time : 0.016 s
% 8.10/2.48
% 8.10/2.48 # Proof found!
% 8.10/2.48 # SZS status Theorem
% 8.10/2.48 # SZS output start CNFRefutation
% See solution above
% 8.10/2.48 # Proof object total steps : 11
% 8.10/2.48 # Proof object clause steps : 7
% 8.10/2.48 # Proof object formula steps : 4
% 8.10/2.48 # Proof object conjectures : 8
% 8.10/2.48 # Proof object clause conjectures : 5
% 8.10/2.48 # Proof object formula conjectures : 3
% 8.10/2.48 # Proof object initial clauses used : 4
% 8.10/2.48 # Proof object initial formulas used : 4
% 8.10/2.48 # Proof object generating inferences : 1
% 8.10/2.48 # Proof object simplifying inferences : 4
% 8.10/2.48 # Training examples: 0 positive, 0 negative
% 8.10/2.48 # Parsed axioms : 31
% 8.10/2.48 # Removed by relevancy pruning/SinE : 0
% 8.10/2.48 # Initial clauses : 31
% 8.10/2.48 # Removed in clause preprocessing : 0
% 8.10/2.48 # Initial clauses in saturation : 31
% 8.10/2.48 # Processed clauses : 33
% 8.10/2.48 # ...of these trivial : 0
% 8.10/2.48 # ...subsumed : 0
% 8.10/2.48 # ...remaining for further processing : 33
% 8.10/2.48 # Other redundant clauses eliminated : 2
% 8.10/2.48 # Clauses deleted for lack of memory : 0
% 8.10/2.48 # Backward-subsumed : 0
% 8.10/2.48 # Backward-rewritten : 2
% 8.10/2.48 # Generated clauses : 33
% 8.10/2.48 # ...of the previous two non-trivial : 31
% 8.10/2.48 # Contextual simplify-reflections : 0
% 8.10/2.48 # Paramodulations : 28
% 8.10/2.48 # Factorizations : 0
% 8.10/2.48 # Equation resolutions : 5
% 8.10/2.48 # Propositional unsat checks : 0
% 8.10/2.48 # Propositional unsat check successes : 0
% 8.10/2.48 # Current number of processed clauses : 29
% 8.10/2.48 # Positive orientable unit clauses : 18
% 8.10/2.48 # Positive unorientable unit clauses: 0
% 8.10/2.48 # Negative unit clauses : 0
% 8.10/2.48 # Non-unit-clauses : 11
% 8.10/2.48 # Current number of unprocessed clauses: 21
% 8.10/2.48 # ...number of literals in the above : 30
% 8.10/2.48 # Current number of archived formulas : 0
% 8.10/2.48 # Current number of archived clauses : 2
% 8.10/2.48 # Clause-clause subsumption calls (NU) : 16
% 8.10/2.48 # Rec. Clause-clause subsumption calls : 16
% 8.10/2.48 # Non-unit clause-clause subsumptions : 0
% 8.10/2.48 # Unit Clause-clause subsumption calls : 6
% 8.10/2.48 # Rewrite failures with RHS unbound : 0
% 8.10/2.48 # BW rewrite match attempts : 3
% 8.10/2.48 # BW rewrite match successes : 1
% 8.10/2.48 # Condensation attempts : 0
% 8.10/2.48 # Condensation successes : 0
% 8.10/2.48 # Termbank termtop insertions : 567
% 8.10/2.48
% 8.10/2.48 # -------------------------------------------------
% 8.10/2.48 # User time : 0.012 s
% 8.10/2.48 # System time : 0.005 s
% 8.10/2.48 # Total time : 0.017 s
% 8.10/2.48 # ...preprocessing : 0.016 s
% 8.10/2.48 # ...main loop : 0.001 s
% 8.10/2.48 # Maximum resident set size: 7128 pages
% 8.10/2.48
%------------------------------------------------------------------------------