%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN070+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:55 EDT 2022
% Result : Theorem 7.23s 2.35s
% Output : CNFRefutation 7.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 10 unt; 0 nHn; 12 RR)
% Number of literals : 45 ( 7 equ; 32 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 36 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( X1 = esk5_0
| ~ r1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la7mqkrv/input.p',i_0_8) ).
cnf(i_0_26,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la7mqkrv/input.p',i_0_26) ).
cnf(i_0_40,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r1(X4)
| ~ r1(X5)
| ~ r2(X3,X2)
| ~ r2(X4,X6)
| ~ r3(X6,X5,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la7mqkrv/input.p',i_0_40) ).
cnf(i_0_25,plain,
r3(X1,esk13_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la7mqkrv/input.p',i_0_25) ).
cnf(i_0_16,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la7mqkrv/input.p',i_0_16) ).
cnf(c_0_46,plain,
( X1 = esk5_0
| ~ r1(X1) ),
i_0_8 ).
cnf(c_0_47,plain,
r1(esk13_1(X1)),
i_0_26 ).
cnf(c_0_48,negated_conjecture,
( X1 != X2
| ~ r1(X3)
| ~ r1(X4)
| ~ r1(X5)
| ~ r2(X3,X2)
| ~ r2(X4,X6)
| ~ r3(X6,X5,X1) ),
i_0_40 ).
cnf(c_0_49,plain,
r3(X1,esk13_1(X1),X1),
i_0_25 ).
cnf(c_0_50,plain,
esk13_1(X1) = esk5_0,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r2(X4,X1)
| ~ r2(X5,X3)
| ~ r1(X2)
| ~ r1(X4)
| ~ r1(X5) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_52,plain,
r3(X1,esk5_0,X1),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
r1(esk5_0),
inference(rw,[status(thm)],[c_0_47,c_0_50]) ).
cnf(c_0_54,plain,
( r2(X1,X2)
| X2 != esk10_1(X1) ),
i_0_16 ).
cnf(c_0_55,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X3,X2)
| ~ r1(X1)
| ~ r1(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_56,plain,
r2(X1,esk10_1(X1)),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_57,plain,
( ~ r2(X1,esk10_1(X2))
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,plain,
~ r1(X1),
inference(spm,[status(thm)],[c_0_57,c_0_56]) ).
cnf(c_0_59,plain,
$false,
inference(sr,[status(thm)],[c_0_53,c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN070+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/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 09:53:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # 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.23/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.23/2.35 # Version: 2.1pre011
% 7.23/2.35 # Preprocessing time : 0.019 s
% 7.23/2.35
% 7.23/2.35 # Proof found!
% 7.23/2.35 # SZS status Theorem
% 7.23/2.35 # SZS output start CNFRefutation
% See solution above
% 7.23/2.35 # Proof object total steps : 19
% 7.23/2.35 # Proof object clause steps : 14
% 7.23/2.35 # Proof object formula steps : 5
% 7.23/2.35 # Proof object conjectures : 4
% 7.23/2.35 # Proof object clause conjectures : 3
% 7.23/2.35 # Proof object formula conjectures : 1
% 7.23/2.35 # Proof object initial clauses used : 5
% 7.23/2.35 # Proof object initial formulas used : 5
% 7.23/2.35 # Proof object generating inferences : 5
% 7.23/2.35 # Proof object simplifying inferences : 6
% 7.23/2.35 # Training examples: 0 positive, 0 negative
% 7.23/2.35 # Parsed axioms : 28
% 7.23/2.35 # Removed by relevancy pruning/SinE : 0
% 7.23/2.35 # Initial clauses : 28
% 7.23/2.35 # Removed in clause preprocessing : 0
% 7.23/2.35 # Initial clauses in saturation : 28
% 7.23/2.35 # Processed clauses : 54
% 7.23/2.35 # ...of these trivial : 0
% 7.23/2.35 # ...subsumed : 0
% 7.23/2.35 # ...remaining for further processing : 54
% 7.23/2.35 # Other redundant clauses eliminated : 4
% 7.23/2.35 # Clauses deleted for lack of memory : 0
% 7.23/2.35 # Backward-subsumed : 0
% 7.23/2.35 # Backward-rewritten : 5
% 7.23/2.35 # Generated clauses : 72
% 7.23/2.35 # ...of the previous two non-trivial : 68
% 7.23/2.35 # Contextual simplify-reflections : 0
% 7.23/2.35 # Paramodulations : 62
% 7.23/2.35 # Factorizations : 0
% 7.23/2.35 # Equation resolutions : 7
% 7.23/2.35 # Propositional unsat checks : 0
% 7.23/2.35 # Propositional unsat check successes : 0
% 7.23/2.35 # Current number of processed clauses : 43
% 7.23/2.35 # Positive orientable unit clauses : 16
% 7.23/2.35 # Positive unorientable unit clauses: 0
% 7.23/2.35 # Negative unit clauses : 8
% 7.23/2.35 # Non-unit-clauses : 19
% 7.23/2.35 # Current number of unprocessed clauses: 32
% 7.23/2.35 # ...number of literals in the above : 75
% 7.23/2.35 # Current number of archived formulas : 0
% 7.23/2.35 # Current number of archived clauses : 8
% 7.23/2.35 # Clause-clause subsumption calls (NU) : 153
% 7.23/2.35 # Rec. Clause-clause subsumption calls : 80
% 7.23/2.35 # Non-unit clause-clause subsumptions : 0
% 7.23/2.35 # Unit Clause-clause subsumption calls : 100
% 7.23/2.35 # Rewrite failures with RHS unbound : 0
% 7.23/2.35 # BW rewrite match attempts : 13
% 7.23/2.35 # BW rewrite match successes : 3
% 7.23/2.35 # Condensation attempts : 0
% 7.23/2.35 # Condensation successes : 0
% 7.23/2.35 # Termbank termtop insertions : 991
% 7.23/2.35
% 7.23/2.35 # -------------------------------------------------
% 7.23/2.35 # User time : 0.016 s
% 7.23/2.35 # System time : 0.006 s
% 7.23/2.35 # Total time : 0.022 s
% 7.23/2.35 # ...preprocessing : 0.019 s
% 7.23/2.35 # ...main loop : 0.003 s
% 7.23/2.35 # Maximum resident set size: 7128 pages
% 7.23/2.35
%------------------------------------------------------------------------------