TSTP Solution File: SWC252+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC252+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:14:33 EDT 2022
% Result : Theorem 7.88s 2.33s
% Output : CNFRefutation 7.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 12 unt; 4 nHn; 30 RR)
% Number of literals : 63 ( 23 equ; 37 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_79) ).
cnf(i_0_200,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_200) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_44) ).
cnf(i_0_201,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_201) ).
cnf(i_0_193,negated_conjecture,
( esk50_0 = nil
| cons(esk53_0,nil) = esk50_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_193) ).
cnf(i_0_203,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_203) ).
cnf(i_0_202,negated_conjecture,
nil != esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_202) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| ssItem(esk53_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_195) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_159) ).
cnf(i_0_206,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_206) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nt5i4pdy/input.p',i_0_60) ).
cnf(c_0_218,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_219,negated_conjecture,
( memberP(X1,esk52_3(X2,X1,X3))
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_200 ).
cnf(c_0_220,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_221,plain,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssItem(esk52_3(X1,nil,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_220])]) ).
cnf(c_0_222,negated_conjecture,
( ssItem(esk52_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_201 ).
cnf(c_0_223,negated_conjecture,
( esk50_0 = nil
| cons(esk53_0,nil) = esk50_0 ),
i_0_193 ).
cnf(c_0_224,negated_conjecture,
esk50_0 = esk48_0,
i_0_203 ).
cnf(c_0_225,negated_conjecture,
nil != esk48_0,
i_0_202 ).
cnf(c_0_226,negated_conjecture,
( esk50_0 = nil
| ssItem(esk53_0) ),
i_0_195 ).
cnf(c_0_227,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk48_0
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_220])]) ).
cnf(c_0_228,negated_conjecture,
cons(esk53_0,nil) = esk48_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_224]),c_0_224]),c_0_225]) ).
cnf(c_0_229,negated_conjecture,
ssItem(esk53_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_224]),c_0_225]) ).
cnf(c_0_230,negated_conjecture,
( app(app(nil,esk48_0),X1) != esk48_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229])]) ).
cnf(c_0_231,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_232,negated_conjecture,
ssList(esk50_0),
i_0_206 ).
cnf(c_0_233,plain,
( app(nil,esk48_0) != esk48_0
| ~ ssList(app(nil,esk48_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_220])]) ).
cnf(c_0_234,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_235,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_232,c_0_224]) ).
cnf(c_0_236,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234]),c_0_235])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC252+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 00:50:14 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/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
% 7.88/2.33 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.88/2.33 # Version: 2.1pre011
% 7.88/2.33 # Preprocessing time : 0.012 s
% 7.88/2.33
% 7.88/2.33 # Proof found!
% 7.88/2.33 # SZS status Theorem
% 7.88/2.33 # SZS output start CNFRefutation
% See solution above
% 7.88/2.33 # Proof object total steps : 30
% 7.88/2.33 # Proof object clause steps : 19
% 7.88/2.33 # Proof object formula steps : 11
% 7.88/2.33 # Proof object conjectures : 19
% 7.88/2.33 # Proof object clause conjectures : 12
% 7.88/2.33 # Proof object formula conjectures : 7
% 7.88/2.33 # Proof object initial clauses used : 11
% 7.88/2.33 # Proof object initial formulas used : 11
% 7.88/2.33 # Proof object generating inferences : 5
% 7.88/2.33 # Proof object simplifying inferences : 16
% 7.88/2.33 # Training examples: 0 positive, 0 negative
% 7.88/2.33 # Parsed axioms : 206
% 7.88/2.33 # Removed by relevancy pruning/SinE : 0
% 7.88/2.33 # Initial clauses : 206
% 7.88/2.33 # Removed in clause preprocessing : 0
% 7.88/2.33 # Initial clauses in saturation : 206
% 7.88/2.33 # Processed clauses : 282
% 7.88/2.33 # ...of these trivial : 12
% 7.88/2.33 # ...subsumed : 20
% 7.88/2.33 # ...remaining for further processing : 250
% 7.88/2.33 # Other redundant clauses eliminated : 25
% 7.88/2.33 # Clauses deleted for lack of memory : 0
% 7.88/2.33 # Backward-subsumed : 1
% 7.88/2.33 # Backward-rewritten : 3
% 7.88/2.33 # Generated clauses : 1708
% 7.88/2.33 # ...of the previous two non-trivial : 1550
% 7.88/2.33 # Contextual simplify-reflections : 11
% 7.88/2.33 # Paramodulations : 1637
% 7.88/2.33 # Factorizations : 30
% 7.88/2.33 # Equation resolutions : 41
% 7.88/2.33 # Propositional unsat checks : 0
% 7.88/2.33 # Propositional unsat check successes : 0
% 7.88/2.33 # Current number of processed clauses : 240
% 7.88/2.33 # Positive orientable unit clauses : 31
% 7.88/2.33 # Positive unorientable unit clauses: 0
% 7.88/2.33 # Negative unit clauses : 3
% 7.88/2.33 # Non-unit-clauses : 206
% 7.88/2.33 # Current number of unprocessed clauses: 1413
% 7.88/2.33 # ...number of literals in the above : 6733
% 7.88/2.33 # Current number of archived formulas : 0
% 7.88/2.33 # Current number of archived clauses : 4
% 7.88/2.33 # Clause-clause subsumption calls (NU) : 6721
% 7.88/2.33 # Rec. Clause-clause subsumption calls : 1718
% 7.88/2.33 # Non-unit clause-clause subsumptions : 26
% 7.88/2.33 # Unit Clause-clause subsumption calls : 419
% 7.88/2.33 # Rewrite failures with RHS unbound : 0
% 7.88/2.33 # BW rewrite match attempts : 3
% 7.88/2.33 # BW rewrite match successes : 3
% 7.88/2.33 # Condensation attempts : 0
% 7.88/2.33 # Condensation successes : 0
% 7.88/2.33 # Termbank termtop insertions : 30456
% 7.88/2.33
% 7.88/2.33 # -------------------------------------------------
% 7.88/2.33 # User time : 0.031 s
% 7.88/2.33 # System time : 0.004 s
% 7.88/2.33 # Total time : 0.035 s
% 7.88/2.33 # ...preprocessing : 0.012 s
% 7.88/2.33 # ...main loop : 0.023 s
% 7.88/2.33 # Maximum resident set size: 7132 pages
% 7.88/2.33
%------------------------------------------------------------------------------