TSTP Solution File: SWC249+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC249+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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 : Tue Jul 19 20:14:32 EDT 2022
% Result : Theorem 8.35s 2.47s
% Output : CNFRefutation 8.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 36 ( 13 unt; 6 nHn; 36 RR)
% Number of literals : 89 ( 26 equ; 56 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_79) ).
cnf(i_0_194,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_194) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_44) ).
cnf(i_0_195,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_195) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_60) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_154) ).
cnf(i_0_203,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_203) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_200) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_43) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_147) ).
cnf(i_0_197,negated_conjecture,
nil != esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_197) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_54) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k9hp8orh/input.p',i_0_56) ).
cnf(c_0_217,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_218,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_194 ).
cnf(c_0_219,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_220,plain,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssItem(esk52_3(X1,nil,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219])]) ).
cnf(c_0_221,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_195 ).
cnf(c_0_222,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_219])]) ).
cnf(c_0_223,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_224,plain,
( app(cons(X1,nil),X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_222,c_0_223]) ).
cnf(c_0_225,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_226,negated_conjecture,
ssList(esk50_0),
i_0_203 ).
cnf(c_0_227,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_228,plain,
( cons(X1,X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_229,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_230,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_231,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_232,negated_conjecture,
nil != esk48_0,
i_0_197 ).
cnf(c_0_233,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_234,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_235,plain,
( cons(X1,X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_219])]) ).
cnf(c_0_236,negated_conjecture,
cons(hd(esk48_0),tl(esk48_0)) = esk48_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232]) ).
cnf(c_0_237,negated_conjecture,
ssItem(hd(esk48_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_231]),c_0_232]) ).
cnf(c_0_238,negated_conjecture,
ssList(tl(esk48_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_231]),c_0_232]) ).
cnf(c_0_239,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_237]),c_0_238])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC249+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 18:00:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.35/2.47 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.35/2.47 # Version: 2.1pre011
% 8.35/2.47 # Preprocessing time : 0.013 s
% 8.35/2.47
% 8.35/2.47 # Proof found!
% 8.35/2.47 # SZS status Theorem
% 8.35/2.47 # SZS output start CNFRefutation
% See solution above
% 8.35/2.47 # Proof object total steps : 36
% 8.35/2.47 # Proof object clause steps : 23
% 8.35/2.47 # Proof object formula steps : 13
% 8.35/2.47 # Proof object conjectures : 16
% 8.35/2.47 # Proof object clause conjectures : 11
% 8.35/2.47 # Proof object formula conjectures : 5
% 8.35/2.47 # Proof object initial clauses used : 13
% 8.35/2.47 # Proof object initial formulas used : 13
% 8.35/2.47 # Proof object generating inferences : 9
% 8.35/2.47 # Proof object simplifying inferences : 13
% 8.35/2.47 # Training examples: 0 positive, 0 negative
% 8.35/2.47 # Parsed axioms : 203
% 8.35/2.47 # Removed by relevancy pruning/SinE : 0
% 8.35/2.47 # Initial clauses : 203
% 8.35/2.47 # Removed in clause preprocessing : 0
% 8.35/2.47 # Initial clauses in saturation : 203
% 8.35/2.47 # Processed clauses : 325
% 8.35/2.47 # ...of these trivial : 6
% 8.35/2.47 # ...subsumed : 38
% 8.35/2.47 # ...remaining for further processing : 281
% 8.35/2.47 # Other redundant clauses eliminated : 26
% 8.35/2.47 # Clauses deleted for lack of memory : 0
% 8.35/2.47 # Backward-subsumed : 5
% 8.35/2.47 # Backward-rewritten : 5
% 8.35/2.47 # Generated clauses : 2227
% 8.35/2.47 # ...of the previous two non-trivial : 2064
% 8.35/2.47 # Contextual simplify-reflections : 25
% 8.35/2.47 # Paramodulations : 2149
% 8.35/2.47 # Factorizations : 32
% 8.35/2.47 # Equation resolutions : 46
% 8.35/2.47 # Propositional unsat checks : 0
% 8.35/2.47 # Propositional unsat check successes : 0
% 8.35/2.47 # Current number of processed clauses : 265
% 8.35/2.47 # Positive orientable unit clauses : 29
% 8.35/2.47 # Positive unorientable unit clauses: 0
% 8.35/2.47 # Negative unit clauses : 4
% 8.35/2.47 # Non-unit-clauses : 232
% 8.35/2.47 # Current number of unprocessed clauses: 1807
% 8.35/2.47 # ...number of literals in the above : 8308
% 8.35/2.47 # Current number of archived formulas : 0
% 8.35/2.47 # Current number of archived clauses : 10
% 8.35/2.47 # Clause-clause subsumption calls (NU) : 10817
% 8.35/2.47 # Rec. Clause-clause subsumption calls : 2714
% 8.35/2.47 # Non-unit clause-clause subsumptions : 54
% 8.35/2.47 # Unit Clause-clause subsumption calls : 669
% 8.35/2.47 # Rewrite failures with RHS unbound : 0
% 8.35/2.47 # BW rewrite match attempts : 2
% 8.35/2.47 # BW rewrite match successes : 2
% 8.35/2.47 # Condensation attempts : 0
% 8.35/2.47 # Condensation successes : 0
% 8.35/2.47 # Termbank termtop insertions : 38387
% 8.35/2.47
% 8.35/2.47 # -------------------------------------------------
% 8.35/2.47 # User time : 0.041 s
% 8.35/2.47 # System time : 0.003 s
% 8.35/2.47 # Total time : 0.044 s
% 8.35/2.47 # ...preprocessing : 0.013 s
% 8.35/2.47 # ...main loop : 0.031 s
% 8.35/2.47 # Maximum resident set size: 7140 pages
% 8.35/2.47
%------------------------------------------------------------------------------