%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC357+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:15:11 EDT 2022
% Result : Theorem 7.98s 2.45s
% Output : CNFRefutation 7.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of clauses : 36 ( 17 unt; 2 nHn; 36 RR)
% Number of literals : 88 ( 17 equ; 54 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_198) ).
cnf(i_0_105,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_105) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_110) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_44) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_109) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_201) ).
cnf(i_0_149,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_60) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_200) ).
cnf(i_0_114,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_114) ).
cnf(i_0_115,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_115) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = nil
| frontsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pby_wf3s/input.p',i_0_191) ).
cnf(c_0_216,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
i_0_195 ).
cnf(c_0_217,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_218,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_219,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
i_0_105 ).
cnf(c_0_220,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_221,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_222,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_223,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_224,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_225,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_226,negated_conjecture,
~ segmentP(esk51_0,esk50_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_217]),c_0_218]) ).
cnf(c_0_227,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221])]),c_0_222]) ).
cnf(c_0_228,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_229,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_223,c_0_218]) ).
cnf(c_0_230,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_221])]) ).
cnf(c_0_231,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
i_0_114 ).
cnf(c_0_232,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
i_0_115 ).
cnf(c_0_233,negated_conjecture,
( esk50_0 = nil
| frontsegP(esk51_0,esk50_0) ),
i_0_191 ).
cnf(c_0_234,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_228]),c_0_229])]) ).
cnf(c_0_235,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231])]),c_0_232]) ).
cnf(c_0_236,negated_conjecture,
frontsegP(esk51_0,esk50_0),
inference(sr,[status(thm)],[c_0_233,c_0_234]) ).
cnf(c_0_237,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_235]),c_0_236]),c_0_228]),c_0_229])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC357+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n016.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 14:43:14 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
% 7.98/2.45 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.98/2.45 # Version: 2.1pre011
% 7.98/2.45 # Preprocessing time : 0.013 s
% 7.98/2.45
% 7.98/2.45 # Proof found!
% 7.98/2.45 # SZS status Theorem
% 7.98/2.45 # SZS output start CNFRefutation
% See solution above
% 7.98/2.45 # Proof object total steps : 36
% 7.98/2.45 # Proof object clause steps : 22
% 7.98/2.45 # Proof object formula steps : 14
% 7.98/2.45 # Proof object conjectures : 17
% 7.98/2.45 # Proof object clause conjectures : 11
% 7.98/2.45 # Proof object formula conjectures : 6
% 7.98/2.45 # Proof object initial clauses used : 14
% 7.98/2.45 # Proof object initial formulas used : 14
% 7.98/2.45 # Proof object generating inferences : 5
% 7.98/2.45 # Proof object simplifying inferences : 18
% 7.98/2.45 # Training examples: 0 positive, 0 negative
% 7.98/2.45 # Parsed axioms : 200
% 7.98/2.45 # Removed by relevancy pruning/SinE : 0
% 7.98/2.45 # Initial clauses : 200
% 7.98/2.45 # Removed in clause preprocessing : 0
% 7.98/2.45 # Initial clauses in saturation : 200
% 7.98/2.45 # Processed clauses : 314
% 7.98/2.45 # ...of these trivial : 3
% 7.98/2.45 # ...subsumed : 60
% 7.98/2.45 # ...remaining for further processing : 251
% 7.98/2.45 # Other redundant clauses eliminated : 112
% 7.98/2.45 # Clauses deleted for lack of memory : 0
% 7.98/2.45 # Backward-subsumed : 8
% 7.98/2.45 # Backward-rewritten : 1
% 7.98/2.45 # Generated clauses : 1191
% 7.98/2.45 # ...of the previous two non-trivial : 980
% 7.98/2.45 # Contextual simplify-reflections : 75
% 7.98/2.45 # Paramodulations : 1056
% 7.98/2.45 # Factorizations : 0
% 7.98/2.45 # Equation resolutions : 133
% 7.98/2.45 # Propositional unsat checks : 0
% 7.98/2.45 # Propositional unsat check successes : 0
% 7.98/2.45 # Current number of processed clauses : 234
% 7.98/2.45 # Positive orientable unit clauses : 17
% 7.98/2.45 # Positive unorientable unit clauses: 0
% 7.98/2.45 # Negative unit clauses : 5
% 7.98/2.45 # Non-unit-clauses : 212
% 7.98/2.45 # Current number of unprocessed clauses: 858
% 7.98/2.45 # ...number of literals in the above : 6355
% 7.98/2.45 # Current number of archived formulas : 0
% 7.98/2.45 # Current number of archived clauses : 11
% 7.98/2.45 # Clause-clause subsumption calls (NU) : 11353
% 7.98/2.45 # Rec. Clause-clause subsumption calls : 2575
% 7.98/2.45 # Non-unit clause-clause subsumptions : 123
% 7.98/2.45 # Unit Clause-clause subsumption calls : 487
% 7.98/2.45 # Rewrite failures with RHS unbound : 0
% 7.98/2.45 # BW rewrite match attempts : 3
% 7.98/2.45 # BW rewrite match successes : 3
% 7.98/2.45 # Condensation attempts : 0
% 7.98/2.45 # Condensation successes : 0
% 7.98/2.45 # Termbank termtop insertions : 28298
% 7.98/2.45
% 7.98/2.45 # -------------------------------------------------
% 7.98/2.45 # User time : 0.036 s
% 7.98/2.45 # System time : 0.002 s
% 7.98/2.45 # Total time : 0.038 s
% 7.98/2.45 # ...preprocessing : 0.013 s
% 7.98/2.45 # ...main loop : 0.025 s
% 7.98/2.45 # Maximum resident set size: 7136 pages
% 7.98/2.45
%------------------------------------------------------------------------------