TSTP Solution File: NUN088+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN088+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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.30s 2.46s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 15 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 7 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_49,plain,
( ~ r1(X1)
| ~ id(X1,X2)
| ~ r2(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5ki9k_ls/input.p',i_0_49) ).
cnf(i_0_59,negated_conjecture,
r2(esk23_0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5ki9k_ls/input.p',i_0_59) ).
cnf(i_0_61,negated_conjecture,
r1(esk22_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5ki9k_ls/input.p',i_0_61) ).
cnf(i_0_62,negated_conjecture,
id(esk22_0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5ki9k_ls/input.p',i_0_62) ).
cnf(c_0_67,plain,
( ~ r1(X1)
| ~ id(X1,X2)
| ~ r2(X3,X2) ),
i_0_49 ).
cnf(c_0_68,negated_conjecture,
r2(esk23_0,esk21_0),
i_0_59 ).
cnf(c_0_69,negated_conjecture,
( ~ id(X1,esk21_0)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_70,negated_conjecture,
r1(esk22_0),
i_0_61 ).
cnf(c_0_71,negated_conjecture,
id(esk22_0,esk21_0),
i_0_62 ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUN088+1 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n029.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 03:31:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.30/2.46 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.30/2.46 # Version: 2.1pre011
% 7.30/2.46 # Preprocessing time : 0.013 s
% 7.30/2.46
% 7.30/2.46 # Proof found!
% 7.30/2.46 # SZS status Theorem
% 7.30/2.46 # SZS output start CNFRefutation
% See solution above
% 7.30/2.46 # Proof object total steps : 10
% 7.30/2.46 # Proof object clause steps : 6
% 7.30/2.46 # Proof object formula steps : 4
% 7.30/2.46 # Proof object conjectures : 8
% 7.30/2.46 # Proof object clause conjectures : 5
% 7.30/2.46 # Proof object formula conjectures : 3
% 7.30/2.46 # Proof object initial clauses used : 4
% 7.30/2.46 # Proof object initial formulas used : 4
% 7.30/2.46 # Proof object generating inferences : 2
% 7.30/2.46 # Proof object simplifying inferences : 2
% 7.30/2.46 # Training examples: 0 positive, 0 negative
% 7.30/2.46 # Parsed axioms : 46
% 7.30/2.46 # Removed by relevancy pruning/SinE : 0
% 7.30/2.46 # Initial clauses : 46
% 7.30/2.46 # Removed in clause preprocessing : 0
% 7.30/2.46 # Initial clauses in saturation : 46
% 7.30/2.46 # Processed clauses : 49
% 7.30/2.46 # ...of these trivial : 0
% 7.30/2.46 # ...subsumed : 0
% 7.30/2.46 # ...remaining for further processing : 49
% 7.30/2.46 # Other redundant clauses eliminated : 0
% 7.30/2.46 # Clauses deleted for lack of memory : 0
% 7.30/2.46 # Backward-subsumed : 0
% 7.30/2.46 # Backward-rewritten : 0
% 7.30/2.46 # Generated clauses : 127
% 7.30/2.46 # ...of the previous two non-trivial : 113
% 7.30/2.46 # Contextual simplify-reflections : 0
% 7.30/2.46 # Paramodulations : 127
% 7.30/2.46 # Factorizations : 0
% 7.30/2.46 # Equation resolutions : 0
% 7.30/2.46 # Propositional unsat checks : 0
% 7.30/2.46 # Propositional unsat check successes : 0
% 7.30/2.46 # Current number of processed clauses : 49
% 7.30/2.46 # Positive orientable unit clauses : 24
% 7.30/2.46 # Positive unorientable unit clauses: 0
% 7.30/2.46 # Negative unit clauses : 0
% 7.30/2.46 # Non-unit-clauses : 25
% 7.30/2.46 # Current number of unprocessed clauses: 105
% 7.30/2.46 # ...number of literals in the above : 279
% 7.30/2.46 # Current number of archived formulas : 0
% 7.30/2.46 # Current number of archived clauses : 0
% 7.30/2.46 # Clause-clause subsumption calls (NU) : 180
% 7.30/2.46 # Rec. Clause-clause subsumption calls : 83
% 7.30/2.46 # Non-unit clause-clause subsumptions : 0
% 7.30/2.46 # Unit Clause-clause subsumption calls : 39
% 7.30/2.46 # Rewrite failures with RHS unbound : 0
% 7.30/2.46 # BW rewrite match attempts : 8
% 7.30/2.46 # BW rewrite match successes : 0
% 7.30/2.46 # Condensation attempts : 0
% 7.30/2.46 # Condensation successes : 0
% 7.30/2.46 # Termbank termtop insertions : 1971
% 7.30/2.46
% 7.30/2.46 # -------------------------------------------------
% 7.30/2.46 # User time : 0.009 s
% 7.30/2.46 # System time : 0.006 s
% 7.30/2.46 # Total time : 0.015 s
% 7.30/2.46 # ...preprocessing : 0.013 s
% 7.30/2.46 # ...main loop : 0.002 s
% 7.30/2.46 # Maximum resident set size: 7132 pages
% 7.30/2.46
%------------------------------------------------------------------------------