%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC229+1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 20:14:25 EDT 2022
% Result : Theorem 8.26s 2.47s
% Output : CNFRefutation 8.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of clauses : 53 ( 20 unt; 3 nHn; 53 RR)
% Number of literals : 120 ( 29 equ; 75 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_79) ).
cnf(i_0_195,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-hw69huho/input.p',i_0_195) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_44) ).
cnf(i_0_196,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-hw69huho/input.p',i_0_196) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_159) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_60) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_43) ).
cnf(i_0_191,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_191) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_199) ).
cnf(i_0_203,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_203) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_200) ).
cnf(i_0_198,negated_conjecture,
segmentP(esk51_0,esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_198) ).
cnf(i_0_202,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_202) ).
cnf(i_0_99,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_99) ).
cnf(i_0_100,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_100) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_41) ).
cnf(i_0_106,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_106) ).
cnf(i_0_197,negated_conjecture,
nil != esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_197) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hw69huho/input.p',i_0_109) ).
cnf(c_0_223,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_224,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_195 ).
cnf(c_0_225,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_226,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_223,c_0_224]),c_0_225])]) ).
cnf(c_0_227,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_196 ).
cnf(c_0_228,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_226,c_0_227]),c_0_225])]) ).
cnf(c_0_229,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_230,plain,
( app(nil,cons(X1,nil)) != esk48_0
| ~ ssItem(X1)
| ~ ssList(app(nil,cons(X1,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_225])]) ).
cnf(c_0_231,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_232,plain,
( cons(X1,nil) != esk48_0
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_230,c_0_231]) ).
cnf(c_0_233,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_234,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_235,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_236,negated_conjecture,
ssList(esk49_0),
i_0_203 ).
cnf(c_0_237,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_238,negated_conjecture,
segmentP(esk51_0,esk50_0),
i_0_198 ).
cnf(c_0_239,negated_conjecture,
ssList(esk50_0),
i_0_202 ).
cnf(c_0_240,plain,
( cons(X1,nil) != esk48_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_225])]) ).
cnf(c_0_241,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_99 ).
cnf(c_0_242,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_100 ).
cnf(c_0_243,negated_conjecture,
( singletonP(esk48_0)
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_234,c_0_235]) ).
cnf(c_0_244,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_245,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_236,c_0_237]) ).
cnf(c_0_246,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
i_0_106 ).
cnf(c_0_247,negated_conjecture,
segmentP(esk51_0,esk48_0),
inference(rw,[status(thm)],[c_0_238,c_0_235]) ).
cnf(c_0_248,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_239,c_0_235]) ).
cnf(c_0_249,plain,
( X1 != esk48_0
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242]) ).
cnf(c_0_250,negated_conjecture,
( esk51_0 = nil
| singletonP(esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_225]),c_0_245])]) ).
cnf(c_0_251,negated_conjecture,
( esk51_0 = esk48_0
| ~ segmentP(esk48_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_247]),c_0_245]),c_0_248])]) ).
cnf(c_0_252,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_248])]) ).
cnf(c_0_253,negated_conjecture,
nil != esk48_0,
i_0_197 ).
cnf(c_0_254,negated_conjecture,
~ segmentP(esk48_0,nil),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_251,c_0_252]),c_0_252]),c_0_253]) ).
cnf(c_0_255,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_256,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_255]),c_0_248])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC229+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 : Sun Jun 12 18:03:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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
% 8.26/2.47 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.26/2.47 # Version: 2.1pre011
% 8.26/2.47 # Preprocessing time : 0.015 s
% 8.26/2.47
% 8.26/2.47 # Proof found!
% 8.26/2.47 # SZS status Theorem
% 8.26/2.47 # SZS output start CNFRefutation
% See solution above
% 8.26/2.47 # Proof object total steps : 53
% 8.26/2.47 # Proof object clause steps : 34
% 8.26/2.47 # Proof object formula steps : 19
% 8.26/2.47 # Proof object conjectures : 27
% 8.26/2.47 # Proof object clause conjectures : 18
% 8.26/2.47 # Proof object formula conjectures : 9
% 8.26/2.47 # Proof object initial clauses used : 19
% 8.26/2.47 # Proof object initial formulas used : 19
% 8.26/2.47 # Proof object generating inferences : 10
% 8.26/2.47 # Proof object simplifying inferences : 26
% 8.26/2.47 # Training examples: 0 positive, 0 negative
% 8.26/2.47 # Parsed axioms : 202
% 8.26/2.47 # Removed by relevancy pruning/SinE : 0
% 8.26/2.47 # Initial clauses : 202
% 8.26/2.47 # Removed in clause preprocessing : 0
% 8.26/2.47 # Initial clauses in saturation : 202
% 8.26/2.47 # Processed clauses : 248
% 8.26/2.47 # ...of these trivial : 2
% 8.26/2.47 # ...subsumed : 21
% 8.26/2.47 # ...remaining for further processing : 225
% 8.26/2.47 # Other redundant clauses eliminated : 84
% 8.26/2.47 # Clauses deleted for lack of memory : 0
% 8.26/2.47 # Backward-subsumed : 4
% 8.26/2.47 # Backward-rewritten : 6
% 8.26/2.47 # Generated clauses : 908
% 8.26/2.47 # ...of the previous two non-trivial : 754
% 8.26/2.47 # Contextual simplify-reflections : 22
% 8.26/2.47 # Paramodulations : 806
% 8.26/2.47 # Factorizations : 0
% 8.26/2.47 # Equation resolutions : 102
% 8.26/2.47 # Propositional unsat checks : 0
% 8.26/2.47 # Propositional unsat check successes : 0
% 8.26/2.47 # Current number of processed clauses : 209
% 8.26/2.47 # Positive orientable unit clauses : 13
% 8.26/2.47 # Positive unorientable unit clauses: 0
% 8.26/2.47 # Negative unit clauses : 4
% 8.26/2.47 # Non-unit-clauses : 192
% 8.26/2.47 # Current number of unprocessed clauses: 705
% 8.26/2.47 # ...number of literals in the above : 5313
% 8.26/2.47 # Current number of archived formulas : 0
% 8.26/2.47 # Current number of archived clauses : 10
% 8.26/2.47 # Clause-clause subsumption calls (NU) : 8342
% 8.26/2.47 # Rec. Clause-clause subsumption calls : 2006
% 8.26/2.47 # Non-unit clause-clause subsumptions : 46
% 8.26/2.47 # Unit Clause-clause subsumption calls : 66
% 8.26/2.47 # Rewrite failures with RHS unbound : 0
% 8.26/2.47 # BW rewrite match attempts : 1
% 8.26/2.47 # BW rewrite match successes : 1
% 8.26/2.47 # Condensation attempts : 0
% 8.26/2.47 # Condensation successes : 0
% 8.26/2.47 # Termbank termtop insertions : 23673
% 8.26/2.47
% 8.26/2.47 # -------------------------------------------------
% 8.26/2.47 # User time : 0.035 s
% 8.26/2.47 # System time : 0.002 s
% 8.26/2.47 # Total time : 0.037 s
% 8.26/2.47 # ...preprocessing : 0.015 s
% 8.26/2.47 # ...main loop : 0.022 s
% 8.26/2.47 # Maximum resident set size: 7124 pages
% 8.26/2.47
%------------------------------------------------------------------------------