TSTP Solution File: SWC039+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC039+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:13 EDT 2022
% Result : Theorem 7.52s 2.45s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 22 unt; 7 nHn; 39 RR)
% Number of literals : 73 ( 33 equ; 30 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_207,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_207) ).
cnf(i_0_208,negated_conjecture,
esk49_0 = nil,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_208) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| app(app(esk53_0,esk50_0),esk54_0) = esk51_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_195) ).
cnf(i_0_205,negated_conjecture,
esk48_0 != nil,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_205) ).
cnf(i_0_206,negated_conjecture,
esk48_0 = esk50_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_206) ).
cnf(i_0_199,negated_conjecture,
( esk50_0 = nil
| ssList(esk54_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_199) ).
cnf(i_0_158,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_158) ).
cnf(i_0_212,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_212) ).
cnf(i_0_201,negated_conjecture,
( esk50_0 = nil
| ssList(esk53_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_201) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_58) ).
cnf(i_0_211,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_211) ).
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-5rkkz3kl/input.p',i_0_149) ).
cnf(i_0_111,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rkkz3kl/input.p',i_0_111) ).
cnf(c_0_226,negated_conjecture,
esk49_0 = esk51_0,
i_0_207 ).
cnf(c_0_227,negated_conjecture,
esk49_0 = nil,
i_0_208 ).
cnf(c_0_228,negated_conjecture,
( esk50_0 = nil
| app(app(esk53_0,esk50_0),esk54_0) = esk51_0 ),
i_0_195 ).
cnf(c_0_229,negated_conjecture,
esk51_0 = nil,
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_230,negated_conjecture,
esk48_0 != nil,
i_0_205 ).
cnf(c_0_231,negated_conjecture,
esk48_0 = esk50_0,
i_0_206 ).
cnf(c_0_232,negated_conjecture,
( app(app(esk53_0,esk50_0),esk54_0) = nil
| esk50_0 = nil ),
inference(rw,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_233,negated_conjecture,
esk50_0 != nil,
inference(rw,[status(thm)],[c_0_230,c_0_231]) ).
cnf(c_0_234,negated_conjecture,
( esk50_0 = nil
| ssList(esk54_0) ),
i_0_199 ).
cnf(c_0_235,plain,
( nil = X1
| app(X2,X1) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_158 ).
cnf(c_0_236,negated_conjecture,
app(app(esk53_0,esk50_0),esk54_0) = nil,
inference(sr,[status(thm)],[c_0_232,c_0_233]) ).
cnf(c_0_237,negated_conjecture,
ssList(esk54_0),
inference(sr,[status(thm)],[c_0_234,c_0_233]) ).
cnf(c_0_238,negated_conjecture,
ssList(esk48_0),
i_0_212 ).
cnf(c_0_239,negated_conjecture,
( esk50_0 = nil
| ssList(esk53_0) ),
i_0_201 ).
cnf(c_0_240,plain,
( esk54_0 = nil
| ~ ssList(app(esk53_0,esk50_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_237])]) ).
cnf(c_0_241,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_242,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_238,c_0_231]) ).
cnf(c_0_243,negated_conjecture,
ssList(esk53_0),
inference(sr,[status(thm)],[c_0_239,c_0_233]) ).
cnf(c_0_244,plain,
esk54_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242]),c_0_243])]) ).
cnf(c_0_245,negated_conjecture,
ssList(esk49_0),
i_0_211 ).
cnf(c_0_246,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_247,negated_conjecture,
app(app(esk53_0,esk50_0),nil) = nil,
inference(rw,[status(thm)],[c_0_236,c_0_244]) ).
cnf(c_0_248,negated_conjecture,
ssList(nil),
inference(rw,[status(thm)],[c_0_245,c_0_227]) ).
cnf(c_0_249,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
i_0_111 ).
cnf(c_0_250,plain,
( segmentP(X1,esk50_0)
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_247]),c_0_248]),c_0_243]),c_0_242])]) ).
cnf(c_0_251,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_242]),c_0_248])]),c_0_233]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC039+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 12 17:01:28 EDT 2022
% 0.14/0.34 % 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.52/2.45 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.52/2.45 # Version: 2.1pre011
% 7.52/2.45 # Preprocessing time : 0.013 s
% 7.52/2.45
% 7.52/2.45 # Proof found!
% 7.52/2.45 # SZS status Theorem
% 7.52/2.45 # SZS output start CNFRefutation
% See solution above
% 7.52/2.45 # Proof object total steps : 39
% 7.52/2.45 # Proof object clause steps : 26
% 7.52/2.45 # Proof object formula steps : 13
% 7.52/2.45 # Proof object conjectures : 27
% 7.52/2.45 # Proof object clause conjectures : 18
% 7.52/2.45 # Proof object formula conjectures : 9
% 7.52/2.45 # Proof object initial clauses used : 13
% 7.52/2.45 # Proof object initial formulas used : 13
% 7.52/2.45 # Proof object generating inferences : 4
% 7.52/2.45 # Proof object simplifying inferences : 22
% 7.52/2.45 # Training examples: 0 positive, 0 negative
% 7.52/2.45 # Parsed axioms : 210
% 7.52/2.45 # Removed by relevancy pruning/SinE : 0
% 7.52/2.45 # Initial clauses : 210
% 7.52/2.45 # Removed in clause preprocessing : 0
% 7.52/2.45 # Initial clauses in saturation : 210
% 7.52/2.45 # Processed clauses : 262
% 7.52/2.45 # ...of these trivial : 13
% 7.52/2.45 # ...subsumed : 18
% 7.52/2.45 # ...remaining for further processing : 231
% 7.52/2.45 # Other redundant clauses eliminated : 84
% 7.52/2.45 # Clauses deleted for lack of memory : 0
% 7.52/2.45 # Backward-subsumed : 0
% 7.52/2.45 # Backward-rewritten : 5
% 7.52/2.45 # Generated clauses : 1075
% 7.52/2.45 # ...of the previous two non-trivial : 904
% 7.52/2.45 # Contextual simplify-reflections : 13
% 7.52/2.45 # Paramodulations : 968
% 7.52/2.45 # Factorizations : 0
% 7.52/2.45 # Equation resolutions : 102
% 7.52/2.45 # Propositional unsat checks : 0
% 7.52/2.45 # Propositional unsat check successes : 0
% 7.52/2.45 # Current number of processed clauses : 215
% 7.52/2.45 # Positive orientable unit clauses : 29
% 7.52/2.45 # Positive unorientable unit clauses: 0
% 7.52/2.45 # Negative unit clauses : 3
% 7.52/2.45 # Non-unit-clauses : 183
% 7.52/2.45 # Current number of unprocessed clauses: 771
% 7.52/2.45 # ...number of literals in the above : 5590
% 7.52/2.45 # Current number of archived formulas : 0
% 7.52/2.45 # Current number of archived clauses : 10
% 7.52/2.45 # Clause-clause subsumption calls (NU) : 9043
% 7.52/2.45 # Rec. Clause-clause subsumption calls : 2089
% 7.52/2.45 # Non-unit clause-clause subsumptions : 26
% 7.52/2.45 # Unit Clause-clause subsumption calls : 412
% 7.52/2.45 # Rewrite failures with RHS unbound : 0
% 7.52/2.45 # BW rewrite match attempts : 2
% 7.52/2.45 # BW rewrite match successes : 2
% 7.52/2.45 # Condensation attempts : 0
% 7.52/2.45 # Condensation successes : 0
% 7.52/2.45 # Termbank termtop insertions : 25857
% 7.52/2.45
% 7.52/2.45 # -------------------------------------------------
% 7.52/2.45 # User time : 0.030 s
% 7.52/2.45 # System time : 0.005 s
% 7.52/2.45 # Total time : 0.035 s
% 7.52/2.45 # ...preprocessing : 0.013 s
% 7.52/2.45 # ...main loop : 0.022 s
% 7.52/2.45 # Maximum resident set size: 7136 pages
% 7.52/2.45
%------------------------------------------------------------------------------