TSTP Solution File: SWC068+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC068+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:24 EDT 2022
% Result : Theorem 6.91s 2.25s
% Output : CNFRefutation 6.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 18 unt; 2 nHn; 37 RR)
% Number of literals : 86 ( 29 equ; 55 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_192,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_192) ).
cnf(i_0_194,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_194) ).
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-4bvguqba/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_44) ).
cnf(i_0_195,negated_conjecture,
app(esk51_0,esk51_0) = esk50_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_195) ).
cnf(i_0_193,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_193) ).
cnf(i_0_198,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_198) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/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-4bvguqba/input.p',i_0_41) ).
cnf(i_0_197,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_197) ).
cnf(i_0_156,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_156) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4bvguqba/input.p',i_0_107) ).
cnf(c_0_212,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_192 ).
cnf(c_0_213,negated_conjecture,
esk49_0 = esk51_0,
i_0_194 ).
cnf(c_0_214,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_215,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_216,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_217,negated_conjecture,
app(esk51_0,esk51_0) = esk50_0,
i_0_195 ).
cnf(c_0_218,negated_conjecture,
esk50_0 = esk48_0,
i_0_193 ).
cnf(c_0_219,negated_conjecture,
ssList(esk49_0),
i_0_198 ).
cnf(c_0_220,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
i_0_191 ).
cnf(c_0_221,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_212,c_0_213]) ).
cnf(c_0_222,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_223,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_214,c_0_215]),c_0_216])]) ).
cnf(c_0_224,negated_conjecture,
app(esk51_0,esk51_0) = esk48_0,
inference(rw,[status(thm)],[c_0_217,c_0_218]) ).
cnf(c_0_225,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_219,c_0_213]) ).
cnf(c_0_226,negated_conjecture,
ssList(esk50_0),
i_0_197 ).
cnf(c_0_227,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
i_0_156 ).
cnf(c_0_228,negated_conjecture,
( esk48_0 != nil
| esk51_0 != nil ),
inference(rw,[status(thm)],[c_0_220,c_0_213]) ).
cnf(c_0_229,negated_conjecture,
( X1 = nil
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_216])]) ).
cnf(c_0_230,negated_conjecture,
( segmentP(X1,esk51_0)
| esk48_0 != X1
| ~ 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,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_226,c_0_218]) ).
cnf(c_0_232,negated_conjecture,
esk51_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_227]),c_0_225])]),c_0_228]) ).
cnf(c_0_233,negated_conjecture,
~ segmentP(esk51_0,esk51_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_225]),c_0_231])]),c_0_232]) ).
cnf(c_0_234,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_235,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_225])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC068+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 12:50:24 EDT 2022
% 0.12/0.34 % 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
% 6.91/2.25 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 6.91/2.25 # Version: 2.1pre011
% 6.91/2.25 # Preprocessing time : 0.012 s
% 6.91/2.25
% 6.91/2.25 # Proof found!
% 6.91/2.25 # SZS status Theorem
% 6.91/2.25 # SZS output start CNFRefutation
% See solution above
% 6.91/2.25 # Proof object total steps : 37
% 6.91/2.25 # Proof object clause steps : 24
% 6.91/2.25 # Proof object formula steps : 13
% 6.91/2.25 # Proof object conjectures : 23
% 6.91/2.25 # Proof object clause conjectures : 16
% 6.91/2.25 # Proof object formula conjectures : 7
% 6.91/2.25 # Proof object initial clauses used : 13
% 6.91/2.25 # Proof object initial formulas used : 13
% 6.91/2.25 # Proof object generating inferences : 6
% 6.91/2.25 # Proof object simplifying inferences : 20
% 6.91/2.25 # Training examples: 0 positive, 0 negative
% 6.91/2.25 # Parsed axioms : 197
% 6.91/2.25 # Removed by relevancy pruning/SinE : 0
% 6.91/2.25 # Initial clauses : 197
% 6.91/2.25 # Removed in clause preprocessing : 0
% 6.91/2.25 # Initial clauses in saturation : 197
% 6.91/2.25 # Processed clauses : 294
% 6.91/2.25 # ...of these trivial : 2
% 6.91/2.25 # ...subsumed : 44
% 6.91/2.25 # ...remaining for further processing : 248
% 6.91/2.25 # Other redundant clauses eliminated : 101
% 6.91/2.25 # Clauses deleted for lack of memory : 0
% 6.91/2.25 # Backward-subsumed : 2
% 6.91/2.25 # Backward-rewritten : 1
% 6.91/2.25 # Generated clauses : 1119
% 6.91/2.25 # ...of the previous two non-trivial : 931
% 6.91/2.25 # Contextual simplify-reflections : 29
% 6.91/2.25 # Paramodulations : 996
% 6.91/2.25 # Factorizations : 0
% 6.91/2.25 # Equation resolutions : 123
% 6.91/2.25 # Propositional unsat checks : 0
% 6.91/2.25 # Propositional unsat check successes : 0
% 6.91/2.25 # Current number of processed clauses : 239
% 6.91/2.25 # Positive orientable unit clauses : 19
% 6.91/2.25 # Positive unorientable unit clauses: 0
% 6.91/2.25 # Negative unit clauses : 11
% 6.91/2.25 # Non-unit-clauses : 209
% 6.91/2.25 # Current number of unprocessed clauses: 834
% 6.91/2.25 # ...number of literals in the above : 6106
% 6.91/2.25 # Current number of archived formulas : 0
% 6.91/2.25 # Current number of archived clauses : 3
% 6.91/2.25 # Clause-clause subsumption calls (NU) : 10553
% 6.91/2.25 # Rec. Clause-clause subsumption calls : 2470
% 6.91/2.25 # Non-unit clause-clause subsumptions : 57
% 6.91/2.25 # Unit Clause-clause subsumption calls : 903
% 6.91/2.25 # Rewrite failures with RHS unbound : 0
% 6.91/2.25 # BW rewrite match attempts : 1
% 6.91/2.25 # BW rewrite match successes : 1
% 6.91/2.25 # Condensation attempts : 0
% 6.91/2.25 # Condensation successes : 0
% 6.91/2.25 # Termbank termtop insertions : 26863
% 6.91/2.25
% 6.91/2.25 # -------------------------------------------------
% 6.91/2.25 # User time : 0.032 s
% 6.91/2.25 # System time : 0.004 s
% 6.91/2.25 # Total time : 0.036 s
% 6.91/2.25 # ...preprocessing : 0.012 s
% 6.91/2.25 # ...main loop : 0.024 s
% 6.91/2.25 # Maximum resident set size: 7136 pages
% 6.91/2.25
%------------------------------------------------------------------------------