TSTP Solution File: NUN081+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN081+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:57 EDT 2022
% Result : Theorem 7.67s 2.40s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 10 RR)
% Number of literals : 43 ( 0 equ; 29 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-2 aty)
% Number of variables : 46 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_59,negated_conjecture,
( ~ r1(X1)
| ~ id(X2,X3)
| ~ r2(X1,X4)
| ~ r2(X4,X5)
| ~ r2(X5,X3)
| ~ r3(X6,X7,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lza19b22/input.p',i_0_59) ).
cnf(i_0_32,plain,
r3(X1,esk13_1(X1),esk12_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lza19b22/input.p',i_0_32) ).
cnf(i_0_34,plain,
id(esk12_1(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lza19b22/input.p',i_0_34) ).
cnf(i_0_21,plain,
r2(X1,esk8_2(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lza19b22/input.p',i_0_21) ).
cnf(i_0_23,plain,
( r2(X1,X2)
| ~ id(X2,esk10_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lza19b22/input.p',i_0_23) ).
cnf(i_0_43,plain,
id(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lza19b22/input.p',i_0_43) ).
cnf(i_0_33,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lza19b22/input.p',i_0_33) ).
cnf(c_0_67,negated_conjecture,
( ~ r1(X1)
| ~ id(X2,X3)
| ~ r2(X1,X4)
| ~ r2(X4,X5)
| ~ r2(X5,X3)
| ~ r3(X6,X7,X2) ),
i_0_59 ).
cnf(c_0_68,plain,
r3(X1,esk13_1(X1),esk12_1(X1)),
i_0_32 ).
cnf(c_0_69,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r2(X4,X3)
| ~ id(esk12_1(X5),X2)
| ~ r1(X4) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_70,plain,
id(esk12_1(X1),X1),
i_0_34 ).
cnf(c_0_71,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r2(X4,X3)
| ~ r1(X4) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_72,plain,
r2(X1,esk8_2(X2,X1)),
i_0_21 ).
cnf(c_0_73,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,plain,
( r2(X1,X2)
| ~ id(X2,esk10_1(X1)) ),
i_0_23 ).
cnf(c_0_75,plain,
id(X1,X1),
i_0_43 ).
cnf(c_0_76,plain,
( ~ r2(X1,X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_72]) ).
cnf(c_0_77,plain,
r2(X1,esk10_1(X1)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,plain,
r1(esk13_1(X1)),
i_0_33 ).
cnf(c_0_79,plain,
~ r1(X1),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,plain,
$false,
inference(sr,[status(thm)],[c_0_78,c_0_79]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN081+1 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 03:46:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/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.67/2.40 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.67/2.40 # Version: 2.1pre011
% 7.67/2.40 # Preprocessing time : 0.017 s
% 7.67/2.40
% 7.67/2.40 # Proof found!
% 7.67/2.40 # SZS status Theorem
% 7.67/2.40 # SZS output start CNFRefutation
% See solution above
% 7.67/2.40 # Proof object total steps : 21
% 7.67/2.40 # Proof object clause steps : 14
% 7.67/2.40 # Proof object formula steps : 7
% 7.67/2.40 # Proof object conjectures : 3
% 7.67/2.40 # Proof object clause conjectures : 2
% 7.67/2.40 # Proof object formula conjectures : 1
% 7.67/2.40 # Proof object initial clauses used : 7
% 7.67/2.40 # Proof object initial formulas used : 7
% 7.67/2.40 # Proof object generating inferences : 6
% 7.67/2.40 # Proof object simplifying inferences : 1
% 7.67/2.40 # Training examples: 0 positive, 0 negative
% 7.67/2.40 # Parsed axioms : 43
% 7.67/2.40 # Removed by relevancy pruning/SinE : 0
% 7.67/2.40 # Initial clauses : 43
% 7.67/2.40 # Removed in clause preprocessing : 0
% 7.67/2.40 # Initial clauses in saturation : 43
% 7.67/2.40 # Processed clauses : 78
% 7.67/2.40 # ...of these trivial : 1
% 7.67/2.40 # ...subsumed : 2
% 7.67/2.40 # ...remaining for further processing : 75
% 7.67/2.40 # Other redundant clauses eliminated : 0
% 7.67/2.40 # Clauses deleted for lack of memory : 0
% 7.67/2.40 # Backward-subsumed : 4
% 7.67/2.40 # Backward-rewritten : 0
% 7.67/2.40 # Generated clauses : 190
% 7.67/2.40 # ...of the previous two non-trivial : 156
% 7.67/2.40 # Contextual simplify-reflections : 0
% 7.67/2.40 # Paramodulations : 183
% 7.67/2.40 # Factorizations : 0
% 7.67/2.40 # Equation resolutions : 0
% 7.67/2.40 # Propositional unsat checks : 0
% 7.67/2.40 # Propositional unsat check successes : 0
% 7.67/2.40 # Current number of processed clauses : 64
% 7.67/2.40 # Positive orientable unit clauses : 22
% 7.67/2.40 # Positive unorientable unit clauses: 0
% 7.67/2.40 # Negative unit clauses : 8
% 7.67/2.40 # Non-unit-clauses : 34
% 7.67/2.40 # Current number of unprocessed clauses: 89
% 7.67/2.40 # ...number of literals in the above : 220
% 7.67/2.40 # Current number of archived formulas : 0
% 7.67/2.40 # Current number of archived clauses : 11
% 7.67/2.40 # Clause-clause subsumption calls (NU) : 299
% 7.67/2.40 # Rec. Clause-clause subsumption calls : 147
% 7.67/2.40 # Non-unit clause-clause subsumptions : 5
% 7.67/2.40 # Unit Clause-clause subsumption calls : 212
% 7.67/2.40 # Rewrite failures with RHS unbound : 0
% 7.67/2.40 # BW rewrite match attempts : 8
% 7.67/2.40 # BW rewrite match successes : 0
% 7.67/2.40 # Condensation attempts : 0
% 7.67/2.40 # Condensation successes : 0
% 7.67/2.40 # Termbank termtop insertions : 2628
% 7.67/2.40
% 7.67/2.40 # -------------------------------------------------
% 7.67/2.40 # User time : 0.018 s
% 7.67/2.40 # System time : 0.004 s
% 7.67/2.40 # Total time : 0.022 s
% 7.67/2.40 # ...preprocessing : 0.017 s
% 7.67/2.40 # ...main loop : 0.005 s
% 7.67/2.40 # Maximum resident set size: 7140 pages
% 7.67/2.40
%------------------------------------------------------------------------------