%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC352+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:09 EDT 2022
% Result : Theorem 7.74s 2.41s
% Output : CNFRefutation 7.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 14 unt; 2 nHn; 23 RR)
% Number of literals : 36 ( 12 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_194,negated_conjecture,
~ frontsegP(esk49_0,esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_kr27nq/input.p',i_0_194) ).
cnf(i_0_195,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_kr27nq/input.p',i_0_195) ).
cnf(i_0_196,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_kr27nq/input.p',i_0_196) ).
cnf(i_0_193,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_kr27nq/input.p',i_0_193) ).
cnf(i_0_199,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_kr27nq/input.p',i_0_199) ).
cnf(i_0_92,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_kr27nq/input.p',i_0_92) ).
cnf(i_0_191,negated_conjecture,
( frontsegP(esk51_0,esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_kr27nq/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-6_kr27nq/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6_kr27nq/input.p',i_0_44) ).
cnf(c_0_209,negated_conjecture,
~ frontsegP(esk49_0,esk48_0),
i_0_194 ).
cnf(c_0_210,negated_conjecture,
esk50_0 = esk48_0,
i_0_195 ).
cnf(c_0_211,negated_conjecture,
esk49_0 = esk51_0,
i_0_196 ).
cnf(c_0_212,negated_conjecture,
~ frontsegP(esk51_0,esk50_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_209,c_0_210]),c_0_211]) ).
cnf(c_0_213,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_193 ).
cnf(c_0_214,negated_conjecture,
ssList(esk49_0),
i_0_199 ).
cnf(c_0_215,negated_conjecture,
( esk51_0 != nil
| ~ frontsegP(esk51_0,nil) ),
inference(spm,[status(thm)],[c_0_212,c_0_213]) ).
cnf(c_0_216,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
i_0_92 ).
cnf(c_0_217,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_214,c_0_211]) ).
cnf(c_0_218,negated_conjecture,
( frontsegP(esk51_0,esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_219,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_220,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_221,plain,
esk51_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_216]),c_0_217])]) ).
cnf(c_0_222,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_220]),c_0_217])]),c_0_212]),c_0_221]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC352+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 : n023.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 : Sat Jun 11 23:11:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.74/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.74/2.41 # Version: 2.1pre011
% 7.74/2.41 # Preprocessing time : 0.014 s
% 7.74/2.41
% 7.74/2.41 # Proof found!
% 7.74/2.41 # SZS status Theorem
% 7.74/2.41 # SZS output start CNFRefutation
% See solution above
% 7.74/2.41 # Proof object total steps : 23
% 7.74/2.41 # Proof object clause steps : 14
% 7.74/2.41 # Proof object formula steps : 9
% 7.74/2.41 # Proof object conjectures : 16
% 7.74/2.41 # Proof object clause conjectures : 10
% 7.74/2.41 # Proof object formula conjectures : 6
% 7.74/2.41 # Proof object initial clauses used : 9
% 7.74/2.41 # Proof object initial formulas used : 9
% 7.74/2.41 # Proof object generating inferences : 3
% 7.74/2.41 # Proof object simplifying inferences : 10
% 7.74/2.41 # Training examples: 0 positive, 0 negative
% 7.74/2.41 # Parsed axioms : 198
% 7.74/2.41 # Removed by relevancy pruning/SinE : 0
% 7.74/2.41 # Initial clauses : 198
% 7.74/2.41 # Removed in clause preprocessing : 0
% 7.74/2.41 # Initial clauses in saturation : 198
% 7.74/2.41 # Processed clauses : 205
% 7.74/2.41 # ...of these trivial : 4
% 7.74/2.41 # ...subsumed : 1
% 7.74/2.41 # ...remaining for further processing : 199
% 7.74/2.41 # Other redundant clauses eliminated : 82
% 7.74/2.41 # Clauses deleted for lack of memory : 0
% 7.74/2.41 # Backward-subsumed : 0
% 7.74/2.41 # Backward-rewritten : 1
% 7.74/2.41 # Generated clauses : 802
% 7.74/2.41 # ...of the previous two non-trivial : 654
% 7.74/2.41 # Contextual simplify-reflections : 2
% 7.74/2.41 # Paramodulations : 704
% 7.74/2.41 # Factorizations : 0
% 7.74/2.41 # Equation resolutions : 98
% 7.74/2.41 # Propositional unsat checks : 0
% 7.74/2.41 # Propositional unsat check successes : 0
% 7.74/2.41 # Current number of processed clauses : 192
% 7.74/2.41 # Positive orientable unit clauses : 14
% 7.74/2.41 # Positive unorientable unit clauses: 0
% 7.74/2.41 # Negative unit clauses : 4
% 7.74/2.41 # Non-unit-clauses : 174
% 7.74/2.41 # Current number of unprocessed clauses: 647
% 7.74/2.41 # ...number of literals in the above : 4859
% 7.74/2.41 # Current number of archived formulas : 0
% 7.74/2.41 # Current number of archived clauses : 1
% 7.74/2.41 # Clause-clause subsumption calls (NU) : 6144
% 7.74/2.41 # Rec. Clause-clause subsumption calls : 1545
% 7.74/2.41 # Non-unit clause-clause subsumptions : 3
% 7.74/2.41 # Unit Clause-clause subsumption calls : 192
% 7.74/2.41 # Rewrite failures with RHS unbound : 0
% 7.74/2.41 # BW rewrite match attempts : 1
% 7.74/2.41 # BW rewrite match successes : 1
% 7.74/2.41 # Condensation attempts : 0
% 7.74/2.41 # Condensation successes : 0
% 7.74/2.41 # Termbank termtop insertions : 21463
% 7.74/2.41
% 7.74/2.41 # -------------------------------------------------
% 7.74/2.41 # User time : 0.028 s
% 7.74/2.41 # System time : 0.003 s
% 7.74/2.41 # Total time : 0.031 s
% 7.74/2.41 # ...preprocessing : 0.014 s
% 7.74/2.41 # ...main loop : 0.017 s
% 7.74/2.41 # Maximum resident set size: 7128 pages
% 7.74/2.41
%------------------------------------------------------------------------------