%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC024+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:07 EDT 2022
% Result : Theorem 7.81s 2.43s
% Output : CNFRefutation 7.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 38 ( 19 unt; 2 nHn; 38 RR)
% Number of literals : 82 ( 19 equ; 50 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_197,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_197) ).
cnf(i_0_199,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_199) ).
cnf(i_0_196,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_198) ).
cnf(i_0_113,plain,
( frontsegP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_113) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_58) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_42) ).
cnf(i_0_191,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/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-idnz1pp0/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_44) ).
cnf(i_0_194,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_194) ).
cnf(i_0_195,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_195) ).
cnf(i_0_201,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_201) ).
cnf(i_0_87,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-idnz1pp0/input.p',i_0_87) ).
cnf(c_0_216,negated_conjecture,
neq(esk49_0,nil),
i_0_197 ).
cnf(c_0_217,negated_conjecture,
esk49_0 = esk51_0,
i_0_199 ).
cnf(c_0_218,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(esk48_0,X1)
| ~ frontsegP(esk49_0,X1) ),
i_0_196 ).
cnf(c_0_219,negated_conjecture,
esk50_0 = esk48_0,
i_0_198 ).
cnf(c_0_220,plain,
( frontsegP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
i_0_113 ).
cnf(c_0_221,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_222,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_223,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_224,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
i_0_191 ).
cnf(c_0_225,negated_conjecture,
( ~ frontsegP(esk50_0,X1)
| ~ frontsegP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_219]),c_0_217]) ).
cnf(c_0_226,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_227,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_228,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_220]),c_0_221]) ).
cnf(c_0_229,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
i_0_194 ).
cnf(c_0_230,negated_conjecture,
ssList(esk52_0),
i_0_195 ).
cnf(c_0_231,negated_conjecture,
ssList(esk50_0),
i_0_201 ).
cnf(c_0_232,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_222]) ).
cnf(c_0_233,negated_conjecture,
( neq(nil,nil)
| esk50_0 != nil ),
inference(spm,[status(thm)],[c_0_223,c_0_224]) ).
cnf(c_0_234,negated_conjecture,
( X1 = nil
| ~ frontsegP(esk50_0,X1)
| ~ frontsegP(esk51_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_227])]) ).
cnf(c_0_235,negated_conjecture,
frontsegP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_230]),c_0_231])]) ).
cnf(c_0_236,plain,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_227])]) ).
cnf(c_0_237,negated_conjecture,
~ frontsegP(esk50_0,esk50_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_231])]),c_0_236]) ).
cnf(c_0_238,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
i_0_87 ).
cnf(c_0_239,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_231])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC024+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 04:14:55 EDT 2022
% 0.13/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.81/2.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.81/2.43 # Version: 2.1pre011
% 7.81/2.43 # Preprocessing time : 0.012 s
% 7.81/2.43
% 7.81/2.43 # Proof found!
% 7.81/2.43 # SZS status Theorem
% 7.81/2.43 # SZS output start CNFRefutation
% See solution above
% 7.81/2.43 # Proof object total steps : 38
% 7.81/2.43 # Proof object clause steps : 24
% 7.81/2.43 # Proof object formula steps : 14
% 7.81/2.43 # Proof object conjectures : 22
% 7.81/2.43 # Proof object clause conjectures : 14
% 7.81/2.43 # Proof object formula conjectures : 8
% 7.81/2.43 # Proof object initial clauses used : 14
% 7.81/2.43 # Proof object initial formulas used : 14
% 7.81/2.43 # Proof object generating inferences : 7
% 7.81/2.43 # Proof object simplifying inferences : 17
% 7.81/2.43 # Training examples: 0 positive, 0 negative
% 7.81/2.43 # Parsed axioms : 201
% 7.81/2.43 # Removed by relevancy pruning/SinE : 0
% 7.81/2.43 # Initial clauses : 201
% 7.81/2.43 # Removed in clause preprocessing : 0
% 7.81/2.43 # Initial clauses in saturation : 201
% 7.81/2.43 # Processed clauses : 246
% 7.81/2.43 # ...of these trivial : 4
% 7.81/2.43 # ...subsumed : 21
% 7.81/2.43 # ...remaining for further processing : 221
% 7.81/2.43 # Other redundant clauses eliminated : 82
% 7.81/2.43 # Clauses deleted for lack of memory : 0
% 7.81/2.43 # Backward-subsumed : 1
% 7.81/2.43 # Backward-rewritten : 0
% 7.81/2.43 # Generated clauses : 952
% 7.81/2.43 # ...of the previous two non-trivial : 796
% 7.81/2.43 # Contextual simplify-reflections : 12
% 7.81/2.43 # Paramodulations : 853
% 7.81/2.43 # Factorizations : 0
% 7.81/2.43 # Equation resolutions : 99
% 7.81/2.43 # Propositional unsat checks : 0
% 7.81/2.43 # Propositional unsat check successes : 0
% 7.81/2.43 # Current number of processed clauses : 214
% 7.81/2.43 # Positive orientable unit clauses : 22
% 7.81/2.43 # Positive unorientable unit clauses: 0
% 7.81/2.43 # Negative unit clauses : 6
% 7.81/2.43 # Non-unit-clauses : 186
% 7.81/2.43 # Current number of unprocessed clauses: 750
% 7.81/2.43 # ...number of literals in the above : 5485
% 7.81/2.43 # Current number of archived formulas : 0
% 7.81/2.43 # Current number of archived clauses : 1
% 7.81/2.43 # Clause-clause subsumption calls (NU) : 7737
% 7.81/2.43 # Rec. Clause-clause subsumption calls : 1842
% 7.81/2.43 # Non-unit clause-clause subsumptions : 23
% 7.81/2.43 # Unit Clause-clause subsumption calls : 71
% 7.81/2.43 # Rewrite failures with RHS unbound : 0
% 7.81/2.43 # BW rewrite match attempts : 0
% 7.81/2.43 # BW rewrite match successes : 0
% 7.81/2.43 # Condensation attempts : 0
% 7.81/2.43 # Condensation successes : 0
% 7.81/2.43 # Termbank termtop insertions : 24160
% 7.81/2.43
% 7.81/2.43 # -------------------------------------------------
% 7.81/2.43 # User time : 0.027 s
% 7.81/2.43 # System time : 0.005 s
% 7.81/2.43 # Total time : 0.032 s
% 7.81/2.43 # ...preprocessing : 0.012 s
% 7.81/2.43 # ...main loop : 0.020 s
% 7.81/2.43 # Maximum resident set size: 7124 pages
% 7.81/2.43
%------------------------------------------------------------------------------