TSTP Solution File: NUN080+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN080+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 6.32s 2.17s
% Output : CNFRefutation 6.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 9 unt; 0 nHn; 12 RR)
% Number of literals : 36 ( 7 equ; 24 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 37 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r2(X3,X4)
| ~ r2(X4,X5)
| ~ r3(X6,X5,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4rsqulb/input.p',i_0_40) ).
cnf(i_0_11,plain,
r3(esk9_2(X1,X2),X1,esk6_2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4rsqulb/input.p',i_0_11) ).
cnf(i_0_16,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4rsqulb/input.p',i_0_16) ).
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4rsqulb/input.p',i_0_8) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m4rsqulb/input.p',i_0_26) ).
cnf(c_0_46,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r2(X3,X4)
| ~ r2(X4,X5)
| ~ r3(X6,X5,X1) ),
i_0_40 ).
cnf(c_0_47,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X2)
| ~ r2(X5,X4)
| ~ r1(X5) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_48,plain,
r3(esk9_2(X1,X2),X1,esk6_2(X1,X2)),
i_0_11 ).
cnf(c_0_49,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
i_0_16 ).
cnf(c_0_50,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_51,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_52,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
r2(X1,esk10_1(X1)),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_54,plain,
esk13_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
( ~ r2(X1,X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,plain,
r1(esk5_0),
inference(rw,[status(thm)],[c_0_51,c_0_54]) ).
cnf(c_0_57,plain,
~ r1(X1),
inference(spm,[status(thm)],[c_0_55,c_0_53]) ).
cnf(c_0_58,plain,
$false,
inference(sr,[status(thm)],[c_0_56,c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUN080+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Thu Jun 2 02:51:31 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.16/0.38 # ENIGMATIC: Selected SinE mode:
% 0.16/0.39 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.39 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.16/0.39 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.16/0.39 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.32/2.17 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.32/2.17 # Version: 2.1pre011
% 6.32/2.17 # Preprocessing time : 0.011 s
% 6.32/2.17
% 6.32/2.17 # Proof found!
% 6.32/2.17 # SZS status Theorem
% 6.32/2.17 # SZS output start CNFRefutation
% See solution above
% 6.32/2.17 # Proof object total steps : 18
% 6.32/2.17 # Proof object clause steps : 13
% 6.32/2.17 # Proof object formula steps : 5
% 6.32/2.17 # Proof object conjectures : 3
% 6.32/2.17 # Proof object clause conjectures : 2
% 6.32/2.17 # Proof object formula conjectures : 1
% 6.32/2.17 # Proof object initial clauses used : 5
% 6.32/2.17 # Proof object initial formulas used : 5
% 6.32/2.17 # Proof object generating inferences : 5
% 6.32/2.17 # Proof object simplifying inferences : 3
% 6.32/2.17 # Training examples: 0 positive, 0 negative
% 6.32/2.17 # Parsed axioms : 28
% 6.32/2.17 # Removed by relevancy pruning/SinE : 0
% 6.32/2.17 # Initial clauses : 28
% 6.32/2.17 # Removed in clause preprocessing : 0
% 6.32/2.17 # Initial clauses in saturation : 28
% 6.32/2.17 # Processed clauses : 49
% 6.32/2.17 # ...of these trivial : 0
% 6.32/2.17 # ...subsumed : 0
% 6.32/2.17 # ...remaining for further processing : 49
% 6.32/2.17 # Other redundant clauses eliminated : 3
% 6.32/2.17 # Clauses deleted for lack of memory : 0
% 6.32/2.17 # Backward-subsumed : 2
% 6.32/2.17 # Backward-rewritten : 5
% 6.32/2.17 # Generated clauses : 68
% 6.32/2.17 # ...of the previous two non-trivial : 68
% 6.32/2.17 # Contextual simplify-reflections : 0
% 6.32/2.17 # Paramodulations : 59
% 6.32/2.17 # Factorizations : 0
% 6.32/2.17 # Equation resolutions : 6
% 6.32/2.17 # Propositional unsat checks : 0
% 6.32/2.17 # Propositional unsat check successes : 0
% 6.32/2.17 # Current number of processed clauses : 36
% 6.32/2.17 # Positive orientable unit clauses : 13
% 6.32/2.17 # Positive unorientable unit clauses: 0
% 6.32/2.17 # Negative unit clauses : 8
% 6.32/2.17 # Non-unit-clauses : 15
% 6.32/2.17 # Current number of unprocessed clauses: 28
% 6.32/2.17 # ...number of literals in the above : 43
% 6.32/2.17 # Current number of archived formulas : 0
% 6.32/2.17 # Current number of archived clauses : 10
% 6.32/2.17 # Clause-clause subsumption calls (NU) : 100
% 6.32/2.17 # Rec. Clause-clause subsumption calls : 67
% 6.32/2.17 # Non-unit clause-clause subsumptions : 2
% 6.32/2.17 # Unit Clause-clause subsumption calls : 88
% 6.32/2.17 # Rewrite failures with RHS unbound : 0
% 6.32/2.17 # BW rewrite match attempts : 7
% 6.32/2.17 # BW rewrite match successes : 3
% 6.32/2.17 # Condensation attempts : 0
% 6.32/2.17 # Condensation successes : 0
% 6.32/2.17 # Termbank termtop insertions : 863
% 6.32/2.17
% 6.32/2.17 # -------------------------------------------------
% 6.32/2.17 # User time : 0.010 s
% 6.32/2.17 # System time : 0.003 s
% 6.32/2.17 # Total time : 0.012 s
% 6.32/2.17 # ...preprocessing : 0.011 s
% 6.32/2.17 # ...main loop : 0.001 s
% 6.32/2.17 # Maximum resident set size: 7128 pages
% 6.32/2.17
%------------------------------------------------------------------------------