TSTP Solution File: SWC355+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC355+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:10 EDT 2022
% Result : Theorem 8.50s 2.41s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of clauses : 39 ( 18 unt; 0 nHn; 39 RR)
% Number of literals : 91 ( 17 equ; 57 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_44) ).
cnf(i_0_191,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_191) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_199) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_200) ).
cnf(i_0_198,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_198) ).
cnf(i_0_114,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/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/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_115) ).
cnf(i_0_193,negated_conjecture,
( app(esk50_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_193) ).
cnf(i_0_202,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_202) ).
cnf(i_0_203,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_203) ).
cnf(i_0_113,plain,
( frontsegP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_113) ).
cnf(i_0_195,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_195) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-feyo7f65/input.p',i_0_43) ).
cnf(c_0_219,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_220,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_221,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_222,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_223,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_224,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_225,negated_conjecture,
neq(esk49_0,nil),
i_0_198 ).
cnf(c_0_226,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_219,c_0_220]),c_0_221])]) ).
cnf(c_0_227,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
i_0_114 ).
cnf(c_0_228,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
i_0_115 ).
cnf(c_0_229,negated_conjecture,
( app(esk50_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_230,negated_conjecture,
~ segmentP(esk49_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_223]),c_0_224]),c_0_225])]) ).
cnf(c_0_231,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_226,c_0_227])]),c_0_228]) ).
cnf(c_0_232,negated_conjecture,
ssList(esk50_0),
i_0_202 ).
cnf(c_0_233,negated_conjecture,
ssList(esk49_0),
i_0_203 ).
cnf(c_0_234,plain,
( frontsegP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
i_0_113 ).
cnf(c_0_235,negated_conjecture,
app(esk50_0,cons(esk52_0,nil)) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_224]),c_0_224]),c_0_225])]) ).
cnf(c_0_236,negated_conjecture,
~ frontsegP(esk49_0,esk50_0),
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])]) ).
cnf(c_0_237,negated_conjecture,
( frontsegP(X1,esk50_0)
| esk49_0 != X1
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_232])]) ).
cnf(c_0_238,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_239,negated_conjecture,
~ 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_233])]) ).
cnf(c_0_240,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_241,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_224]),c_0_225])]) ).
cnf(c_0_242,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_241]),c_0_221])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC355+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n027.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 06:41:02 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.40 # ENIGMATIC: Selected SinE mode:
% 0.20/0.41 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.41 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.41 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.50/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.50/2.41 # Version: 2.1pre011
% 8.50/2.41 # Preprocessing time : 0.024 s
% 8.50/2.41
% 8.50/2.41 # Proof found!
% 8.50/2.41 # SZS status Theorem
% 8.50/2.41 # SZS output start CNFRefutation
% See solution above
% 8.50/2.41 # Proof object total steps : 39
% 8.50/2.41 # Proof object clause steps : 24
% 8.50/2.41 # Proof object formula steps : 15
% 8.50/2.41 # Proof object conjectures : 22
% 8.50/2.41 # Proof object clause conjectures : 14
% 8.50/2.41 # Proof object formula conjectures : 8
% 8.50/2.41 # Proof object initial clauses used : 15
% 8.50/2.41 # Proof object initial formulas used : 15
% 8.50/2.41 # Proof object generating inferences : 6
% 8.50/2.41 # Proof object simplifying inferences : 25
% 8.50/2.41 # Training examples: 0 positive, 0 negative
% 8.50/2.41 # Parsed axioms : 202
% 8.50/2.41 # Removed by relevancy pruning/SinE : 0
% 8.50/2.41 # Initial clauses : 202
% 8.50/2.41 # Removed in clause preprocessing : 0
% 8.50/2.41 # Initial clauses in saturation : 202
% 8.50/2.41 # Processed clauses : 727
% 8.50/2.41 # ...of these trivial : 13
% 8.50/2.41 # ...subsumed : 298
% 8.50/2.41 # ...remaining for further processing : 416
% 8.50/2.41 # Other redundant clauses eliminated : 134
% 8.50/2.41 # Clauses deleted for lack of memory : 0
% 8.50/2.41 # Backward-subsumed : 20
% 8.50/2.41 # Backward-rewritten : 1
% 8.50/2.41 # Generated clauses : 2759
% 8.50/2.41 # ...of the previous two non-trivial : 2467
% 8.50/2.41 # Contextual simplify-reflections : 290
% 8.50/2.41 # Paramodulations : 2583
% 8.50/2.41 # Factorizations : 0
% 8.50/2.41 # Equation resolutions : 176
% 8.50/2.41 # Propositional unsat checks : 0
% 8.50/2.41 # Propositional unsat check successes : 0
% 8.50/2.41 # Current number of processed clauses : 389
% 8.50/2.41 # Positive orientable unit clauses : 17
% 8.50/2.41 # Positive unorientable unit clauses: 0
% 8.50/2.41 # Negative unit clauses : 9
% 8.50/2.41 # Non-unit-clauses : 363
% 8.50/2.41 # Current number of unprocessed clauses: 1852
% 8.50/2.41 # ...number of literals in the above : 13417
% 8.50/2.41 # Current number of archived formulas : 0
% 8.50/2.41 # Current number of archived clauses : 21
% 8.50/2.41 # Clause-clause subsumption calls (NU) : 46251
% 8.50/2.41 # Rec. Clause-clause subsumption calls : 8731
% 8.50/2.41 # Non-unit clause-clause subsumptions : 455
% 8.50/2.41 # Unit Clause-clause subsumption calls : 271
% 8.50/2.41 # Rewrite failures with RHS unbound : 0
% 8.50/2.41 # BW rewrite match attempts : 1
% 8.50/2.41 # BW rewrite match successes : 1
% 8.50/2.41 # Condensation attempts : 0
% 8.50/2.41 # Condensation successes : 0
% 8.50/2.41 # Termbank termtop insertions : 57112
% 8.50/2.41
% 8.50/2.41 # -------------------------------------------------
% 8.50/2.41 # User time : 0.104 s
% 8.50/2.41 # System time : 0.009 s
% 8.50/2.41 # Total time : 0.113 s
% 8.50/2.41 # ...preprocessing : 0.024 s
% 8.50/2.41 # ...main loop : 0.089 s
% 8.50/2.41 # Maximum resident set size: 7132 pages
% 8.50/2.41
%------------------------------------------------------------------------------