TSTP Solution File: SWC092+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC092+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:13:33 EDT 2022
% Result : Theorem 8.41s 2.48s
% Output : CNFRefutation 8.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of clauses : 41 ( 21 unt; 2 nHn; 41 RR)
% Number of literals : 89 ( 23 equ; 54 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_197,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_197) ).
cnf(i_0_199,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_199) ).
cnf(i_0_196,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_198) ).
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-67uqzfr4/input.p',i_0_149) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_44) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_42) ).
cnf(i_0_191,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_191) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_41) ).
cnf(i_0_194,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_194) ).
cnf(i_0_195,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_195) ).
cnf(i_0_201,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_201) ).
cnf(i_0_202,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_202) ).
cnf(i_0_107,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-67uqzfr4/input.p',i_0_107) ).
cnf(c_0_218,negated_conjecture,
neq(esk49_0,nil),
i_0_197 ).
cnf(c_0_219,negated_conjecture,
esk49_0 = esk51_0,
i_0_199 ).
cnf(c_0_220,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1) ),
i_0_196 ).
cnf(c_0_221,negated_conjecture,
esk50_0 = esk48_0,
i_0_198 ).
cnf(c_0_222,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_223,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_224,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_225,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_226,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_227,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
i_0_191 ).
cnf(c_0_228,negated_conjecture,
( ~ segmentP(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_221]),c_0_219]) ).
cnf(c_0_229,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
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_222,c_0_223]),c_0_224])]) ).
cnf(c_0_231,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
i_0_194 ).
cnf(c_0_232,negated_conjecture,
ssList(esk52_0),
i_0_195 ).
cnf(c_0_233,negated_conjecture,
ssList(esk50_0),
i_0_201 ).
cnf(c_0_234,negated_conjecture,
ssList(esk49_0),
i_0_202 ).
cnf(c_0_235,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_225]) ).
cnf(c_0_236,negated_conjecture,
( neq(nil,nil)
| esk50_0 != nil ),
inference(spm,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_237,negated_conjecture,
( X1 = nil
| ~ segmentP(esk50_0,X1)
| ~ segmentP(esk51_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_224])]) ).
cnf(c_0_238,negated_conjecture,
( segmentP(X1,esk50_0)
| esk51_0 != X1
| ~ ssList(X1) ),
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_239,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_234,c_0_219]) ).
cnf(c_0_240,plain,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_224])]) ).
cnf(c_0_241,negated_conjecture,
~ segmentP(esk50_0,esk50_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_233]),c_0_239])]),c_0_240]) ).
cnf(c_0_242,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
i_0_107 ).
cnf(c_0_243,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_233])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC092+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 21:21:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.41/2.48 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.41/2.48 # Version: 2.1pre011
% 8.41/2.48 # Preprocessing time : 0.013 s
% 8.41/2.48
% 8.41/2.48 # Proof found!
% 8.41/2.48 # SZS status Theorem
% 8.41/2.48 # SZS output start CNFRefutation
% See solution above
% 8.41/2.48 # Proof object total steps : 41
% 8.41/2.48 # Proof object clause steps : 26
% 8.41/2.48 # Proof object formula steps : 15
% 8.41/2.48 # Proof object conjectures : 25
% 8.41/2.48 # Proof object clause conjectures : 16
% 8.41/2.48 # Proof object formula conjectures : 9
% 8.41/2.48 # Proof object initial clauses used : 15
% 8.41/2.48 # Proof object initial formulas used : 15
% 8.41/2.48 # Proof object generating inferences : 7
% 8.41/2.48 # Proof object simplifying inferences : 20
% 8.41/2.48 # Training examples: 0 positive, 0 negative
% 8.41/2.48 # Parsed axioms : 201
% 8.41/2.48 # Removed by relevancy pruning/SinE : 0
% 8.41/2.48 # Initial clauses : 201
% 8.41/2.48 # Removed in clause preprocessing : 0
% 8.41/2.48 # Initial clauses in saturation : 201
% 8.41/2.48 # Processed clauses : 402
% 8.41/2.48 # ...of these trivial : 13
% 8.41/2.48 # ...subsumed : 90
% 8.41/2.48 # ...remaining for further processing : 299
% 8.41/2.48 # Other redundant clauses eliminated : 99
% 8.41/2.48 # Clauses deleted for lack of memory : 0
% 8.41/2.48 # Backward-subsumed : 13
% 8.41/2.48 # Backward-rewritten : 0
% 8.41/2.48 # Generated clauses : 1403
% 8.41/2.48 # ...of the previous two non-trivial : 1194
% 8.41/2.48 # Contextual simplify-reflections : 80
% 8.41/2.48 # Paramodulations : 1277
% 8.41/2.48 # Factorizations : 0
% 8.41/2.48 # Equation resolutions : 126
% 8.41/2.48 # Propositional unsat checks : 0
% 8.41/2.48 # Propositional unsat check successes : 0
% 8.41/2.48 # Current number of processed clauses : 280
% 8.41/2.48 # Positive orientable unit clauses : 22
% 8.41/2.48 # Positive unorientable unit clauses: 0
% 8.41/2.48 # Negative unit clauses : 9
% 8.41/2.48 # Non-unit-clauses : 249
% 8.41/2.48 # Current number of unprocessed clauses: 985
% 8.41/2.48 # ...number of literals in the above : 7164
% 8.41/2.48 # Current number of archived formulas : 0
% 8.41/2.48 # Current number of archived clauses : 13
% 8.41/2.48 # Clause-clause subsumption calls (NU) : 16466
% 8.41/2.48 # Rec. Clause-clause subsumption calls : 3178
% 8.41/2.48 # Non-unit clause-clause subsumptions : 144
% 8.41/2.48 # Unit Clause-clause subsumption calls : 490
% 8.41/2.48 # Rewrite failures with RHS unbound : 0
% 8.41/2.48 # BW rewrite match attempts : 0
% 8.41/2.48 # BW rewrite match successes : 0
% 8.41/2.48 # Condensation attempts : 0
% 8.41/2.48 # Condensation successes : 0
% 8.41/2.48 # Termbank termtop insertions : 31993
% 8.41/2.48
% 8.41/2.48 # -------------------------------------------------
% 8.41/2.48 # User time : 0.044 s
% 8.41/2.48 # System time : 0.002 s
% 8.41/2.48 # Total time : 0.046 s
% 8.41/2.48 # ...preprocessing : 0.013 s
% 8.41/2.48 # ...main loop : 0.033 s
% 8.41/2.48 # Maximum resident set size: 7132 pages
% 8.41/2.48
%------------------------------------------------------------------------------