TSTP Solution File: NUN076+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN076+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:56 EDT 2022
% Result : Theorem 8.46s 2.55s
% Output : CNFRefutation 8.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 54 ( 21 unt; 8 nHn; 27 RR)
% Number of literals : 116 ( 0 equ; 63 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-1 aty)
% Number of variables : 95 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_49,plain,
( ~ r1(X1)
| ~ id(X1,X2)
| ~ r2(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_49) ).
cnf(i_0_44,plain,
( r1(esk18_1(X1))
| r2(esk19_1(X1),esk20_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_44) ).
cnf(i_0_45,plain,
( r1(esk18_1(X1))
| id(X1,esk20_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_45) ).
cnf(i_0_46,plain,
( id(X1,esk18_1(X1))
| r2(esk19_1(X1),esk20_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_46) ).
cnf(i_0_17,plain,
( id(X1,esk5_0)
| ~ r1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_17) ).
cnf(i_0_47,plain,
( id(X1,esk18_1(X1))
| id(X1,esk20_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_47) ).
cnf(i_0_50,plain,
( id(X1,X2)
| ~ id(X3,X2)
| ~ id(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_50) ).
cnf(i_0_59,negated_conjecture,
( ~ r1(X1)
| ~ id(X2,X3)
| ~ id(X4,X3)
| ~ r2(X1,X5)
| ~ r2(X5,X6)
| ~ r3(X7,X8,X2)
| ~ r4(X6,X7,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_59) ).
cnf(i_0_41,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_41) ).
cnf(i_0_52,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_52) ).
cnf(i_0_40,plain,
id(esk15_1(X1),esk17_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_40) ).
cnf(i_0_39,plain,
r1(esk17_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_39) ).
cnf(i_0_32,plain,
r3(X1,esk13_1(X1),esk12_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_32) ).
cnf(i_0_34,plain,
id(esk12_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_34) ).
cnf(i_0_42,plain,
r1(esk16_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_42) ).
cnf(i_0_23,plain,
( r2(X1,X2)
| ~ id(X2,esk10_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_23) ).
cnf(i_0_43,plain,
id(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_43) ).
cnf(i_0_33,plain,
r1(esk13_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7myd_nv5/input.p',i_0_33) ).
cnf(c_0_78,plain,
( ~ r1(X1)
| ~ id(X1,X2)
| ~ r2(X3,X2) ),
i_0_49 ).
cnf(c_0_79,plain,
( r1(esk18_1(X1))
| r2(esk19_1(X1),esk20_1(X1)) ),
i_0_44 ).
cnf(c_0_80,plain,
( r1(esk18_1(X1))
| ~ id(X2,esk20_1(X1))
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_81,plain,
( r1(esk18_1(X1))
| id(X1,esk20_1(X1)) ),
i_0_45 ).
cnf(c_0_82,plain,
( id(X1,esk18_1(X1))
| r2(esk19_1(X1),esk20_1(X1)) ),
i_0_46 ).
cnf(c_0_83,plain,
( id(X1,esk5_0)
| ~ r1(X1) ),
i_0_17 ).
cnf(c_0_84,plain,
( r1(esk18_1(X1))
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,plain,
( id(X1,esk18_1(X1))
| ~ id(X2,esk20_1(X1))
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_78,c_0_82]) ).
cnf(c_0_86,plain,
( id(X1,esk18_1(X1))
| id(X1,esk20_1(X1)) ),
i_0_47 ).
cnf(c_0_87,plain,
( id(X1,X2)
| ~ id(X3,X2)
| ~ id(X1,X3) ),
i_0_50 ).
cnf(c_0_88,plain,
( id(esk18_1(X1),esk5_0)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_89,plain,
( id(X1,esk18_1(X1))
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,negated_conjecture,
( ~ r1(X1)
| ~ id(X2,X3)
| ~ id(X4,X3)
| ~ r2(X1,X5)
| ~ r2(X5,X6)
| ~ r3(X7,X8,X2)
| ~ r4(X6,X7,X4) ),
i_0_59 ).
cnf(c_0_91,plain,
r4(X1,esk16_1(X1),esk15_1(X1)),
i_0_41 ).
cnf(c_0_92,plain,
( id(X1,esk5_0)
| ~ id(X1,esk18_1(X2))
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_93,plain,
( id(X1,esk18_1(X2))
| ~ id(X1,X2)
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_87,c_0_89]) ).
cnf(c_0_94,plain,
( r1(X1)
| ~ r1(X2)
| ~ id(X1,X2) ),
i_0_52 ).
cnf(c_0_95,plain,
id(esk15_1(X1),esk17_1(X1)),
i_0_40 ).
cnf(c_0_96,plain,
r1(esk17_1(X1)),
i_0_39 ).
cnf(c_0_97,negated_conjecture,
( ~ r3(esk16_1(X1),X2,X3)
| ~ r2(X4,X1)
| ~ r2(X5,X4)
| ~ id(esk15_1(X1),X6)
| ~ id(X3,X6)
| ~ r1(X5) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_98,plain,
r3(X1,esk13_1(X1),esk12_1(X1)),
i_0_32 ).
cnf(c_0_99,plain,
( id(X1,esk5_0)
| ~ id(X1,X2)
| ~ r1(X2) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_100,plain,
id(esk12_1(X1),X1),
i_0_34 ).
cnf(c_0_101,plain,
r1(esk15_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96])]) ).
cnf(c_0_102,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ id(esk12_1(esk16_1(X2)),X4)
| ~ id(esk15_1(X2),X4)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_103,plain,
( id(esk12_1(X1),esk5_0)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_104,plain,
id(esk15_1(X1),esk5_0),
inference(spm,[status(thm)],[c_0_83,c_0_101]) ).
cnf(c_0_105,plain,
r1(esk16_1(X1)),
i_0_42 ).
cnf(c_0_106,plain,
( r2(X1,X2)
| ~ id(X2,esk10_1(X1)) ),
i_0_23 ).
cnf(c_0_107,plain,
id(X1,X1),
i_0_43 ).
cnf(c_0_108,plain,
( ~ r2(X1,X2)
| ~ r2(X3,X1)
| ~ r1(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),c_0_105])]) ).
cnf(c_0_109,plain,
r2(X1,esk10_1(X1)),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_110,plain,
( ~ r2(X1,X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_111,plain,
r1(esk13_1(X1)),
i_0_33 ).
cnf(c_0_112,plain,
~ r1(X1),
inference(spm,[status(thm)],[c_0_110,c_0_109]) ).
cnf(c_0_113,plain,
$false,
inference(sr,[status(thm)],[c_0_111,c_0_112]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUN076+1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 2 08:53:23 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.46/2.55 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.46/2.55 # Version: 2.1pre011
% 8.46/2.55 # Preprocessing time : 0.017 s
% 8.46/2.55
% 8.46/2.55 # Proof found!
% 8.46/2.55 # SZS status Theorem
% 8.46/2.55 # SZS output start CNFRefutation
% See solution above
% 8.46/2.55 # Proof object total steps : 54
% 8.46/2.55 # Proof object clause steps : 36
% 8.46/2.55 # Proof object formula steps : 18
% 8.46/2.55 # Proof object conjectures : 3
% 8.46/2.55 # Proof object clause conjectures : 2
% 8.46/2.55 # Proof object formula conjectures : 1
% 8.46/2.55 # Proof object initial clauses used : 18
% 8.46/2.55 # Proof object initial formulas used : 18
% 8.46/2.55 # Proof object generating inferences : 17
% 8.46/2.55 # Proof object simplifying inferences : 6
% 8.46/2.55 # Training examples: 0 positive, 0 negative
% 8.46/2.55 # Parsed axioms : 43
% 8.46/2.55 # Removed by relevancy pruning/SinE : 0
% 8.46/2.55 # Initial clauses : 43
% 8.46/2.55 # Removed in clause preprocessing : 0
% 8.46/2.55 # Initial clauses in saturation : 43
% 8.46/2.55 # Processed clauses : 369
% 8.46/2.55 # ...of these trivial : 15
% 8.46/2.55 # ...subsumed : 105
% 8.46/2.55 # ...remaining for further processing : 249
% 8.46/2.55 # Other redundant clauses eliminated : 0
% 8.46/2.55 # Clauses deleted for lack of memory : 0
% 8.46/2.55 # Backward-subsumed : 8
% 8.46/2.55 # Backward-rewritten : 0
% 8.46/2.55 # Generated clauses : 1532
% 8.46/2.55 # ...of the previous two non-trivial : 1185
% 8.46/2.55 # Contextual simplify-reflections : 26
% 8.46/2.55 # Paramodulations : 1505
% 8.46/2.55 # Factorizations : 0
% 8.46/2.55 # Equation resolutions : 0
% 8.46/2.55 # Propositional unsat checks : 0
% 8.46/2.55 # Propositional unsat check successes : 0
% 8.46/2.55 # Current number of processed clauses : 214
% 8.46/2.55 # Positive orientable unit clauses : 64
% 8.46/2.55 # Positive unorientable unit clauses: 0
% 8.46/2.55 # Negative unit clauses : 22
% 8.46/2.55 # Non-unit-clauses : 128
% 8.46/2.55 # Current number of unprocessed clauses: 707
% 8.46/2.55 # ...number of literals in the above : 2162
% 8.46/2.55 # Current number of archived formulas : 0
% 8.46/2.55 # Current number of archived clauses : 35
% 8.46/2.55 # Clause-clause subsumption calls (NU) : 4682
% 8.46/2.55 # Rec. Clause-clause subsumption calls : 2862
% 8.46/2.55 # Non-unit clause-clause subsumptions : 92
% 8.46/2.55 # Unit Clause-clause subsumption calls : 949
% 8.46/2.55 # Rewrite failures with RHS unbound : 0
% 8.46/2.55 # BW rewrite match attempts : 232
% 8.46/2.55 # BW rewrite match successes : 0
% 8.46/2.55 # Condensation attempts : 0
% 8.46/2.55 # Condensation successes : 0
% 8.46/2.55 # Termbank termtop insertions : 18918
% 8.46/2.55
% 8.46/2.55 # -------------------------------------------------
% 8.46/2.55 # User time : 0.048 s
% 8.46/2.55 # System time : 0.005 s
% 8.46/2.55 # Total time : 0.053 s
% 8.46/2.55 # ...preprocessing : 0.017 s
% 8.46/2.55 # ...main loop : 0.036 s
% 8.46/2.55 # Maximum resident set size: 7136 pages
% 8.46/2.55
%------------------------------------------------------------------------------