TSTP Solution File: SWC029+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC029+1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 20:13:09 EDT 2022
% Result : Theorem 8.08s 2.39s
% Output : CNFRefutation 8.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 45 ( 19 unt; 5 nHn; 45 RR)
% Number of literals : 87 ( 41 equ; 42 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_194,negated_conjecture,
( nil = esk48_0
| nil = esk49_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_194) ).
cnf(i_0_200,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_200) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_201) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_199) ).
cnf(i_0_195,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_195) ).
cnf(i_0_203,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_203) ).
cnf(i_0_204,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_204) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_191) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_41) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_197) ).
cnf(i_0_157,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_157) ).
cnf(i_0_198,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_198) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_43) ).
cnf(i_0_158,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_158) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-24rahi38/input.p',i_0_53) ).
cnf(c_0_220,negated_conjecture,
( nil = esk48_0
| nil = esk49_0 ),
i_0_194 ).
cnf(c_0_221,negated_conjecture,
esk50_0 = esk48_0,
i_0_200 ).
cnf(c_0_222,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_223,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_199 ).
cnf(c_0_224,negated_conjecture,
( esk51_0 = nil
| esk50_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_221]),c_0_222]) ).
cnf(c_0_225,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_226,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[c_0_223,c_0_224]) ).
cnf(c_0_227,negated_conjecture,
ssList(esk50_0),
i_0_203 ).
cnf(c_0_228,negated_conjecture,
ssList(esk49_0),
i_0_204 ).
cnf(c_0_229,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
i_0_191 ).
cnf(c_0_230,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = nil
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_225,c_0_226]) ).
cnf(c_0_231,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_232,negated_conjecture,
ssList(nil),
inference(rw,[status(thm)],[c_0_227,c_0_226]) ).
cnf(c_0_233,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_228,c_0_222]) ).
cnf(c_0_234,negated_conjecture,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_221]),c_0_226]),c_0_222])]) ).
cnf(c_0_235,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_236,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_157 ).
cnf(c_0_237,negated_conjecture,
app(esk53_0,cons(esk52_0,nil)) = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232]),c_0_233])]),c_0_234]) ).
cnf(c_0_238,negated_conjecture,
ssList(esk53_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_231]),c_0_232]),c_0_233])]),c_0_234]) ).
cnf(c_0_239,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_198 ).
cnf(c_0_240,plain,
( esk53_0 = nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_238])]) ).
cnf(c_0_241,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_242,negated_conjecture,
ssItem(esk52_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_231]),c_0_232]),c_0_233])]),c_0_234]) ).
cnf(c_0_243,plain,
esk53_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242]),c_0_232])]) ).
cnf(c_0_244,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_158 ).
cnf(c_0_245,negated_conjecture,
app(nil,cons(esk52_0,nil)) = nil,
inference(rw,[status(thm)],[c_0_237,c_0_243]) ).
cnf(c_0_246,plain,
( cons(esk52_0,nil) = nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_232])]) ).
cnf(c_0_247,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_248,plain,
cons(esk52_0,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_241]),c_0_242]),c_0_232])]) ).
cnf(c_0_249,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_248]),c_0_242]),c_0_232])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC029+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 12 22:40:41 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.08/2.39 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.08/2.39 # Version: 2.1pre011
% 8.08/2.39 # Preprocessing time : 0.014 s
% 8.08/2.39
% 8.08/2.39 # Proof found!
% 8.08/2.39 # SZS status Theorem
% 8.08/2.39 # SZS output start CNFRefutation
% See solution above
% 8.08/2.39 # Proof object total steps : 45
% 8.08/2.39 # Proof object clause steps : 30
% 8.08/2.39 # Proof object formula steps : 15
% 8.08/2.39 # Proof object conjectures : 30
% 8.08/2.39 # Proof object clause conjectures : 20
% 8.08/2.39 # Proof object formula conjectures : 10
% 8.08/2.39 # Proof object initial clauses used : 15
% 8.08/2.39 # Proof object initial formulas used : 15
% 8.08/2.39 # Proof object generating inferences : 8
% 8.08/2.39 # Proof object simplifying inferences : 36
% 8.08/2.39 # Training examples: 0 positive, 0 negative
% 8.08/2.39 # Parsed axioms : 201
% 8.08/2.39 # Removed by relevancy pruning/SinE : 0
% 8.08/2.39 # Initial clauses : 201
% 8.08/2.39 # Removed in clause preprocessing : 0
% 8.08/2.39 # Initial clauses in saturation : 201
% 8.08/2.39 # Processed clauses : 219
% 8.08/2.39 # ...of these trivial : 3
% 8.08/2.39 # ...subsumed : 6
% 8.08/2.39 # ...remaining for further processing : 210
% 8.08/2.39 # Other redundant clauses eliminated : 82
% 8.08/2.39 # Clauses deleted for lack of memory : 0
% 8.08/2.39 # Backward-subsumed : 1
% 8.08/2.39 # Backward-rewritten : 11
% 8.08/2.39 # Generated clauses : 920
% 8.08/2.39 # ...of the previous two non-trivial : 730
% 8.08/2.39 # Contextual simplify-reflections : 7
% 8.08/2.39 # Paramodulations : 821
% 8.08/2.39 # Factorizations : 0
% 8.08/2.39 # Equation resolutions : 99
% 8.08/2.39 # Propositional unsat checks : 0
% 8.08/2.39 # Propositional unsat check successes : 0
% 8.08/2.39 # Current number of processed clauses : 192
% 8.08/2.39 # Positive orientable unit clauses : 17
% 8.08/2.39 # Positive unorientable unit clauses: 0
% 8.08/2.39 # Negative unit clauses : 3
% 8.08/2.39 # Non-unit-clauses : 172
% 8.08/2.39 # Current number of unprocessed clauses: 663
% 8.08/2.39 # ...number of literals in the above : 5037
% 8.08/2.39 # Current number of archived formulas : 0
% 8.08/2.39 # Current number of archived clauses : 12
% 8.08/2.39 # Clause-clause subsumption calls (NU) : 6214
% 8.08/2.39 # Rec. Clause-clause subsumption calls : 1640
% 8.08/2.39 # Non-unit clause-clause subsumptions : 13
% 8.08/2.39 # Unit Clause-clause subsumption calls : 173
% 8.08/2.39 # Rewrite failures with RHS unbound : 0
% 8.08/2.39 # BW rewrite match attempts : 7
% 8.08/2.39 # BW rewrite match successes : 7
% 8.08/2.39 # Condensation attempts : 0
% 8.08/2.39 # Condensation successes : 0
% 8.08/2.39 # Termbank termtop insertions : 23721
% 8.08/2.39
% 8.08/2.39 # -------------------------------------------------
% 8.08/2.39 # User time : 0.028 s
% 8.08/2.39 # System time : 0.004 s
% 8.08/2.39 # Total time : 0.032 s
% 8.08/2.39 # ...preprocessing : 0.014 s
% 8.08/2.39 # ...main loop : 0.018 s
% 8.08/2.39 # Maximum resident set size: 7128 pages
% 8.08/2.39
%------------------------------------------------------------------------------