TSTP Solution File: SWC080+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC080+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:28 EDT 2022
% Result : Theorem 8.54s 2.56s
% Output : CNFRefutation 8.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of clauses : 40 ( 17 unt; 0 nHn; 40 RR)
% Number of literals : 96 ( 11 equ; 61 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 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/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_44) ).
cnf(i_0_199,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_199) ).
cnf(i_0_203,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_203) ).
cnf(i_0_204,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_204) ).
cnf(i_0_202,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_202) ).
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-4n8c417j/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-4n8c417j/input.p',i_0_115) ).
cnf(i_0_206,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_206) ).
cnf(i_0_207,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_207) ).
cnf(i_0_195,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_195) ).
cnf(i_0_191,negated_conjecture,
( frontsegP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_191) ).
cnf(i_0_193,negated_conjecture,
( frontsegP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4n8c417j/input.p',i_0_197) ).
cnf(c_0_223,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_224,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_225,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_226,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(esk51_0,nil) ),
i_0_199 ).
cnf(c_0_227,negated_conjecture,
esk50_0 = esk48_0,
i_0_203 ).
cnf(c_0_228,negated_conjecture,
esk49_0 = esk51_0,
i_0_204 ).
cnf(c_0_229,negated_conjecture,
neq(esk49_0,nil),
i_0_202 ).
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_223,c_0_224]),c_0_225])]) ).
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,
( ~ segmentP(esk50_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_227]),c_0_228]),c_0_229])]) ).
cnf(c_0_234,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_235,negated_conjecture,
ssList(esk50_0),
i_0_206 ).
cnf(c_0_236,negated_conjecture,
( ~ segmentP(esk49_0,X1)
| ~ frontsegP(esk50_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_235])]) ).
cnf(c_0_237,negated_conjecture,
ssList(esk49_0),
i_0_207 ).
cnf(c_0_238,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_239,negated_conjecture,
( frontsegP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_240,negated_conjecture,
( frontsegP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_241,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_242,plain,
( ~ frontsegP(esk50_0,X1)
| ~ frontsegP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_234]),c_0_237])]) ).
cnf(c_0_243,negated_conjecture,
neq(esk52_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_228]),c_0_229])]) ).
cnf(c_0_244,negated_conjecture,
frontsegP(esk50_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_228]),c_0_229])]) ).
cnf(c_0_245,negated_conjecture,
frontsegP(esk49_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_240,c_0_228]),c_0_228]),c_0_229])]) ).
cnf(c_0_246,negated_conjecture,
ssList(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_241,c_0_228]),c_0_229])]) ).
cnf(c_0_247,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_242,c_0_243]),c_0_244]),c_0_245]),c_0_246])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC080+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 09:42:41 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.54/2.56 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.54/2.56 # Version: 2.1pre011
% 8.54/2.56 # Preprocessing time : 0.015 s
% 8.54/2.56
% 8.54/2.56 # Proof found!
% 8.54/2.56 # SZS status Theorem
% 8.54/2.56 # SZS output start CNFRefutation
% See solution above
% 8.54/2.56 # Proof object total steps : 40
% 8.54/2.56 # Proof object clause steps : 25
% 8.54/2.56 # Proof object formula steps : 15
% 8.54/2.56 # Proof object conjectures : 27
% 8.54/2.56 # Proof object clause conjectures : 17
% 8.54/2.56 # Proof object formula conjectures : 10
% 8.54/2.56 # Proof object initial clauses used : 15
% 8.54/2.56 # Proof object initial formulas used : 15
% 8.54/2.56 # Proof object generating inferences : 5
% 8.54/2.56 # Proof object simplifying inferences : 29
% 8.54/2.56 # Training examples: 0 positive, 0 negative
% 8.54/2.56 # Parsed axioms : 206
% 8.54/2.56 # Removed by relevancy pruning/SinE : 0
% 8.54/2.56 # Initial clauses : 206
% 8.54/2.56 # Removed in clause preprocessing : 0
% 8.54/2.56 # Initial clauses in saturation : 206
% 8.54/2.56 # Processed clauses : 381
% 8.54/2.56 # ...of these trivial : 8
% 8.54/2.56 # ...subsumed : 92
% 8.54/2.56 # ...remaining for further processing : 281
% 8.54/2.56 # Other redundant clauses eliminated : 135
% 8.54/2.56 # Clauses deleted for lack of memory : 0
% 8.54/2.56 # Backward-subsumed : 2
% 8.54/2.56 # Backward-rewritten : 0
% 8.54/2.56 # Generated clauses : 1430
% 8.54/2.56 # ...of the previous two non-trivial : 1191
% 8.54/2.56 # Contextual simplify-reflections : 125
% 8.54/2.56 # Paramodulations : 1260
% 8.54/2.56 # Factorizations : 0
% 8.54/2.56 # Equation resolutions : 170
% 8.54/2.56 # Propositional unsat checks : 0
% 8.54/2.56 # Propositional unsat check successes : 0
% 8.54/2.56 # Current number of processed clauses : 273
% 8.54/2.56 # Positive orientable unit clauses : 19
% 8.54/2.56 # Positive unorientable unit clauses: 0
% 8.54/2.56 # Negative unit clauses : 8
% 8.54/2.56 # Non-unit-clauses : 246
% 8.54/2.56 # Current number of unprocessed clauses: 1015
% 8.54/2.56 # ...number of literals in the above : 7654
% 8.54/2.56 # Current number of archived formulas : 0
% 8.54/2.56 # Current number of archived clauses : 2
% 8.54/2.56 # Clause-clause subsumption calls (NU) : 15636
% 8.54/2.56 # Rec. Clause-clause subsumption calls : 3523
% 8.54/2.56 # Non-unit clause-clause subsumptions : 186
% 8.54/2.56 # Unit Clause-clause subsumption calls : 143
% 8.54/2.56 # Rewrite failures with RHS unbound : 0
% 8.54/2.56 # BW rewrite match attempts : 0
% 8.54/2.56 # BW rewrite match successes : 0
% 8.54/2.56 # Condensation attempts : 0
% 8.54/2.56 # Condensation successes : 0
% 8.54/2.56 # Termbank termtop insertions : 33563
% 8.54/2.56
% 8.54/2.56 # -------------------------------------------------
% 8.54/2.56 # User time : 0.045 s
% 8.54/2.56 # System time : 0.003 s
% 8.54/2.56 # Total time : 0.048 s
% 8.54/2.56 # ...preprocessing : 0.015 s
% 8.54/2.56 # ...main loop : 0.034 s
% 8.54/2.56 # Maximum resident set size: 7136 pages
% 8.54/2.56
%------------------------------------------------------------------------------