TSTP Solution File: NUN070+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN070+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:55 EDT 2022
% Result : Theorem 8.06s 2.42s
% Output : CNFRefutation 8.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 11 unt; 0 nHn; 9 RR)
% Number of literals : 41 ( 0 equ; 29 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-1 aty)
% Number of variables : 35 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_59,negated_conjecture,
( ~ r1(X1)
| ~ r1(X2)
| ~ r1(X3)
| ~ id(X4,X5)
| ~ r2(X1,X5)
| ~ r2(X2,X6)
| ~ r3(X6,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_2g3k_7/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-6_2g3k_7/input.p',i_0_32) ).
cnf(i_0_33,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_2g3k_7/input.p',i_0_33) ).
cnf(i_0_34,plain,
id(esk12_1(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_2g3k_7/input.p',i_0_34) ).
cnf(i_0_23,plain,
( r2(X1,X2)
| ~ id(X2,esk10_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_2g3k_7/input.p',i_0_23) ).
cnf(i_0_43,plain,
id(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_2g3k_7/input.p',i_0_43) ).
cnf(c_0_66,negated_conjecture,
( ~ r1(X1)
| ~ r1(X2)
| ~ r1(X3)
| ~ id(X4,X5)
| ~ r2(X1,X5)
| ~ r2(X2,X6)
| ~ r3(X6,X3,X4) ),
i_0_59 ).
cnf(c_0_67,plain,
r3(X1,esk13_1(X1),esk12_1(X1)),
i_0_32 ).
cnf(c_0_68,plain,
r1(esk13_1(X1)),
i_0_33 ).
cnf(c_0_69,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X3,X4)
| ~ id(esk12_1(X2),X4)
| ~ r1(X1)
| ~ r1(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,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)
| ~ id(X2,esk10_1(X1)) ),
i_0_23 ).
cnf(c_0_72,plain,
id(X1,X1),
i_0_43 ).
cnf(c_0_73,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X2)
| ~ r1(X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,plain,
r2(X1,esk10_1(X1)),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,plain,
( ~ r2(X1,esk10_1(X2))
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_76,plain,
~ r1(X1),
inference(spm,[status(thm)],[c_0_75,c_0_74]) ).
cnf(c_0_77,plain,
$false,
inference(sr,[status(thm)],[c_0_68,c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN070+1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 2 09:11:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.06/2.42 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.06/2.42 # Version: 2.1pre011
% 8.06/2.42 # Preprocessing time : 0.018 s
% 8.06/2.42
% 8.06/2.42 # Proof found!
% 8.06/2.42 # SZS status Theorem
% 8.06/2.42 # SZS output start CNFRefutation
% See solution above
% 8.06/2.42 # Proof object total steps : 18
% 8.06/2.42 # Proof object clause steps : 12
% 8.06/2.42 # Proof object formula steps : 6
% 8.06/2.42 # Proof object conjectures : 3
% 8.06/2.42 # Proof object clause conjectures : 2
% 8.06/2.42 # Proof object formula conjectures : 1
% 8.06/2.42 # Proof object initial clauses used : 6
% 8.06/2.42 # Proof object initial formulas used : 6
% 8.06/2.42 # Proof object generating inferences : 5
% 8.06/2.42 # Proof object simplifying inferences : 3
% 8.06/2.42 # Training examples: 0 positive, 0 negative
% 8.06/2.42 # Parsed axioms : 43
% 8.06/2.42 # Removed by relevancy pruning/SinE : 0
% 8.06/2.42 # Initial clauses : 43
% 8.06/2.42 # Removed in clause preprocessing : 0
% 8.06/2.42 # Initial clauses in saturation : 43
% 8.06/2.42 # Processed clauses : 126
% 8.06/2.42 # ...of these trivial : 1
% 8.06/2.42 # ...subsumed : 19
% 8.06/2.42 # ...remaining for further processing : 106
% 8.06/2.42 # Other redundant clauses eliminated : 0
% 8.06/2.42 # Clauses deleted for lack of memory : 0
% 8.06/2.42 # Backward-subsumed : 0
% 8.06/2.42 # Backward-rewritten : 0
% 8.06/2.42 # Generated clauses : 319
% 8.06/2.42 # ...of the previous two non-trivial : 267
% 8.06/2.42 # Contextual simplify-reflections : 3
% 8.06/2.42 # Paramodulations : 311
% 8.06/2.42 # Factorizations : 0
% 8.06/2.42 # Equation resolutions : 0
% 8.06/2.42 # Propositional unsat checks : 0
% 8.06/2.42 # Propositional unsat check successes : 0
% 8.06/2.42 # Current number of processed clauses : 98
% 8.06/2.42 # Positive orientable unit clauses : 29
% 8.06/2.42 # Positive unorientable unit clauses: 0
% 8.06/2.42 # Negative unit clauses : 17
% 8.06/2.42 # Non-unit-clauses : 52
% 8.06/2.42 # Current number of unprocessed clauses: 156
% 8.06/2.42 # ...number of literals in the above : 493
% 8.06/2.42 # Current number of archived formulas : 0
% 8.06/2.42 # Current number of archived clauses : 8
% 8.06/2.42 # Clause-clause subsumption calls (NU) : 682
% 8.06/2.42 # Rec. Clause-clause subsumption calls : 366
% 8.06/2.42 # Non-unit clause-clause subsumptions : 11
% 8.06/2.42 # Unit Clause-clause subsumption calls : 556
% 8.06/2.42 # Rewrite failures with RHS unbound : 0
% 8.06/2.42 # BW rewrite match attempts : 23
% 8.06/2.42 # BW rewrite match successes : 0
% 8.06/2.42 # Condensation attempts : 0
% 8.06/2.42 # Condensation successes : 0
% 8.06/2.42 # Termbank termtop insertions : 4084
% 8.06/2.42
% 8.06/2.42 # -------------------------------------------------
% 8.06/2.42 # User time : 0.022 s
% 8.06/2.42 # System time : 0.004 s
% 8.06/2.42 # Total time : 0.026 s
% 8.06/2.42 # ...preprocessing : 0.018 s
% 8.06/2.42 # ...main loop : 0.009 s
% 8.06/2.42 # Maximum resident set size: 7136 pages
% 8.06/2.42
%------------------------------------------------------------------------------