TSTP Solution File: SWC348+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC348+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:08 EDT 2022
% Result : Theorem 7.64s 2.52s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of clauses : 46 ( 19 unt; 5 nHn; 46 RR)
% Number of literals : 101 ( 21 equ; 53 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_44) ).
cnf(i_0_198,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_198) ).
cnf(i_0_195,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_195) ).
cnf(i_0_106,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_106) ).
cnf(i_0_193,negated_conjecture,
segmentP(esk51_0,esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_197) ).
cnf(i_0_105,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_105) ).
cnf(i_0_110,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_110) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_109) ).
cnf(i_0_128,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_128) ).
cnf(i_0_99,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_99) ).
cnf(i_0_100,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_100) ).
cnf(i_0_192,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_192) ).
cnf(i_0_191,negated_conjecture,
( ~ strictorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_191) ).
cnf(i_0_194,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_194) ).
cnf(i_0_129,plain,
strictorderedP(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1lzh3k5/input.p',i_0_129) ).
cnf(c_0_216,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_217,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_218,negated_conjecture,
ssList(esk49_0),
i_0_198 ).
cnf(c_0_219,negated_conjecture,
esk49_0 = esk51_0,
i_0_195 ).
cnf(c_0_220,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_221,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_222,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
i_0_106 ).
cnf(c_0_223,negated_conjecture,
segmentP(esk51_0,esk50_0),
i_0_193 ).
cnf(c_0_224,negated_conjecture,
ssList(esk50_0),
i_0_197 ).
cnf(c_0_225,plain,
( segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3) ),
i_0_105 ).
cnf(c_0_226,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_110 ).
cnf(c_0_227,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_228,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_128 ).
cnf(c_0_229,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_99 ).
cnf(c_0_230,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_100 ).
cnf(c_0_231,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_232,negated_conjecture,
( esk51_0 = nil
| neq(esk51_0,nil) ),
inference(spm,[status(thm)],[c_0_220,c_0_221]) ).
cnf(c_0_233,negated_conjecture,
( ~ strictorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_234,negated_conjecture,
esk50_0 = esk48_0,
i_0_194 ).
cnf(c_0_235,negated_conjecture,
( esk51_0 = esk50_0
| ~ segmentP(esk50_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_221]),c_0_224])]) ).
cnf(c_0_236,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_217])]),c_0_227]) ).
cnf(c_0_237,plain,
( strictorderedP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_230]) ).
cnf(c_0_238,negated_conjecture,
( esk51_0 = nil
| singletonP(esk50_0) ),
inference(spm,[status(thm)],[c_0_231,c_0_232]) ).
cnf(c_0_239,negated_conjecture,
~ strictorderedP(esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_234]),c_0_234]),c_0_219]),c_0_223])]) ).
cnf(c_0_240,negated_conjecture,
( esk51_0 = esk50_0
| esk51_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_221]),c_0_224])]) ).
cnf(c_0_241,plain,
esk51_0 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_224])]),c_0_239]) ).
cnf(c_0_242,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_240,c_0_241]),c_0_241])]) ).
cnf(c_0_243,plain,
strictorderedP(nil),
i_0_129 ).
cnf(c_0_244,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_242]),c_0_243])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC348+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n012.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 : Sat Jun 11 20:39:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.64/2.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.64/2.52 # Version: 2.1pre011
% 7.64/2.52 # Preprocessing time : 0.014 s
% 7.64/2.52
% 7.64/2.52 # Proof found!
% 7.64/2.52 # SZS status Theorem
% 7.64/2.52 # SZS output start CNFRefutation
% See solution above
% 7.64/2.52 # Proof object total steps : 46
% 7.64/2.52 # Proof object clause steps : 29
% 7.64/2.52 # Proof object formula steps : 17
% 7.64/2.52 # Proof object conjectures : 22
% 7.64/2.52 # Proof object clause conjectures : 15
% 7.64/2.52 # Proof object formula conjectures : 7
% 7.64/2.52 # Proof object initial clauses used : 17
% 7.64/2.52 # Proof object initial formulas used : 17
% 7.64/2.52 # Proof object generating inferences : 8
% 7.64/2.52 # Proof object simplifying inferences : 25
% 7.64/2.52 # Training examples: 0 positive, 0 negative
% 7.64/2.52 # Parsed axioms : 197
% 7.64/2.52 # Removed by relevancy pruning/SinE : 0
% 7.64/2.52 # Initial clauses : 197
% 7.64/2.52 # Removed in clause preprocessing : 0
% 7.64/2.52 # Initial clauses in saturation : 197
% 7.64/2.52 # Processed clauses : 261
% 7.64/2.52 # ...of these trivial : 2
% 7.64/2.52 # ...subsumed : 11
% 7.64/2.52 # ...remaining for further processing : 248
% 7.64/2.52 # Other redundant clauses eliminated : 25
% 7.64/2.52 # Clauses deleted for lack of memory : 0
% 7.64/2.52 # Backward-subsumed : 1
% 7.64/2.52 # Backward-rewritten : 44
% 7.64/2.52 # Generated clauses : 1938
% 7.64/2.52 # ...of the previous two non-trivial : 1807
% 7.64/2.52 # Contextual simplify-reflections : 30
% 7.64/2.52 # Paramodulations : 1865
% 7.64/2.52 # Factorizations : 30
% 7.64/2.52 # Equation resolutions : 43
% 7.64/2.52 # Propositional unsat checks : 0
% 7.64/2.52 # Propositional unsat check successes : 0
% 7.64/2.52 # Current number of processed clauses : 197
% 7.64/2.52 # Positive orientable unit clauses : 12
% 7.64/2.52 # Positive unorientable unit clauses: 0
% 7.64/2.52 # Negative unit clauses : 2
% 7.64/2.52 # Non-unit-clauses : 183
% 7.64/2.52 # Current number of unprocessed clauses: 873
% 7.64/2.52 # ...number of literals in the above : 5194
% 7.64/2.52 # Current number of archived formulas : 0
% 7.64/2.52 # Current number of archived clauses : 45
% 7.64/2.52 # Clause-clause subsumption calls (NU) : 8972
% 7.64/2.52 # Rec. Clause-clause subsumption calls : 2204
% 7.64/2.52 # Non-unit clause-clause subsumptions : 41
% 7.64/2.52 # Unit Clause-clause subsumption calls : 194
% 7.64/2.52 # Rewrite failures with RHS unbound : 0
% 7.64/2.52 # BW rewrite match attempts : 3
% 7.64/2.52 # BW rewrite match successes : 3
% 7.64/2.52 # Condensation attempts : 0
% 7.64/2.52 # Condensation successes : 0
% 7.64/2.52 # Termbank termtop insertions : 33118
% 7.64/2.52
% 7.64/2.52 # -------------------------------------------------
% 7.64/2.52 # User time : 0.040 s
% 7.64/2.52 # System time : 0.002 s
% 7.64/2.52 # Total time : 0.042 s
% 7.64/2.52 # ...preprocessing : 0.014 s
% 7.64/2.52 # ...main loop : 0.028 s
% 7.64/2.52 # Maximum resident set size: 7136 pages
% 7.64/2.52
%------------------------------------------------------------------------------