TSTP Solution File: SWC126+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC126+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:47 EDT 2022
% Result : Theorem 8.45s 2.36s
% Output : CNFRefutation 8.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of clauses : 50 ( 19 unt; 2 nHn; 50 RR)
% Number of literals : 128 ( 23 equ; 83 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_195) ).
cnf(i_0_201,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_201) ).
cnf(i_0_202,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_202) ).
cnf(i_0_200,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_200) ).
cnf(i_0_197,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_197) ).
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-4pmv4p2z/input.p',i_0_149) ).
cnf(i_0_155,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_155) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_154) ).
cnf(i_0_204,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_204) ).
cnf(i_0_82,plain,
( app(esk29_2(X1,X2),cons(X2,esk30_2(X1,X2))) = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_82) ).
cnf(i_0_83,plain,
( ssList(esk30_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_83) ).
cnf(i_0_191,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_191) ).
cnf(i_0_84,plain,
( ssList(esk29_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_84) ).
cnf(i_0_193,negated_conjecture,
( memberP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_193) ).
cnf(i_0_205,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_205) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_53) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_44) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4pmv4p2z/input.p',i_0_41) ).
cnf(c_0_224,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_225,negated_conjecture,
esk50_0 = esk48_0,
i_0_201 ).
cnf(c_0_226,negated_conjecture,
esk49_0 = esk51_0,
i_0_202 ).
cnf(c_0_227,negated_conjecture,
neq(esk49_0,nil),
i_0_200 ).
cnf(c_0_228,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_229,plain,
( segmentP(X1,X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
i_0_149 ).
cnf(c_0_230,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_155 ).
cnf(c_0_231,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_232,negated_conjecture,
cons(esk52_0,nil) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_225]),c_0_226]),c_0_227])]) ).
cnf(c_0_233,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_226]),c_0_227])]) ).
cnf(c_0_234,negated_conjecture,
ssList(esk50_0),
i_0_204 ).
cnf(c_0_235,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_229,c_0_230]) ).
cnf(c_0_236,negated_conjecture,
( app(esk48_0,X1) = cons(esk52_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_233])]) ).
cnf(c_0_237,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_234,c_0_225]) ).
cnf(c_0_238,negated_conjecture,
( segmentP(X1,esk48_0)
| app(X2,cons(esk52_0,X3)) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_237])]) ).
cnf(c_0_239,plain,
( app(esk29_2(X1,X2),cons(X2,esk30_2(X1,X2))) = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
i_0_82 ).
cnf(c_0_240,plain,
( segmentP(X1,esk48_0)
| ~ memberP(X1,esk52_0)
| ~ ssList(esk30_2(X1,esk52_0))
| ~ ssList(esk29_2(X1,esk52_0))
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_233])])]) ).
cnf(c_0_241,plain,
( ssList(esk30_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
i_0_83 ).
cnf(c_0_242,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil)
| ~ segmentP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_243,plain,
( segmentP(X1,esk48_0)
| ~ memberP(X1,esk52_0)
| ~ ssList(esk29_2(X1,esk52_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_233])]) ).
cnf(c_0_244,plain,
( ssList(esk29_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
i_0_84 ).
cnf(c_0_245,negated_conjecture,
( memberP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_246,negated_conjecture,
( ~ segmentP(esk49_0,esk48_0)
| ~ neq(esk48_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_242,c_0_226]),c_0_227])]) ).
cnf(c_0_247,plain,
( segmentP(X1,esk48_0)
| ~ memberP(X1,esk52_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_233])]) ).
cnf(c_0_248,negated_conjecture,
memberP(esk49_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_226]),c_0_226]),c_0_227])]) ).
cnf(c_0_249,negated_conjecture,
ssList(esk49_0),
i_0_205 ).
cnf(c_0_250,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_251,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_252,negated_conjecture,
~ neq(esk48_0,nil),
inference(cn,[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_249])]) ).
cnf(c_0_253,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_254,negated_conjecture,
esk48_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_232]),c_0_233]),c_0_251])]) ).
cnf(c_0_255,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_253]),c_0_251]),c_0_237])]),c_0_254]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC126+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n009.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 02:41:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.45/2.36 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.45/2.36 # Version: 2.1pre011
% 8.45/2.36 # Preprocessing time : 0.012 s
% 8.45/2.36
% 8.45/2.36 # Proof found!
% 8.45/2.36 # SZS status Theorem
% 8.45/2.36 # SZS output start CNFRefutation
% See solution above
% 8.45/2.36 # Proof object total steps : 50
% 8.45/2.36 # Proof object clause steps : 32
% 8.45/2.36 # Proof object formula steps : 18
% 8.45/2.36 # Proof object conjectures : 27
% 8.45/2.36 # Proof object clause conjectures : 18
% 8.45/2.36 # Proof object formula conjectures : 9
% 8.45/2.36 # Proof object initial clauses used : 18
% 8.45/2.36 # Proof object initial formulas used : 18
% 8.45/2.36 # Proof object generating inferences : 9
% 8.45/2.36 # Proof object simplifying inferences : 36
% 8.45/2.36 # Training examples: 0 positive, 0 negative
% 8.45/2.36 # Parsed axioms : 204
% 8.45/2.36 # Removed by relevancy pruning/SinE : 0
% 8.45/2.36 # Initial clauses : 204
% 8.45/2.36 # Removed in clause preprocessing : 0
% 8.45/2.36 # Initial clauses in saturation : 204
% 8.45/2.36 # Processed clauses : 1003
% 8.45/2.36 # ...of these trivial : 13
% 8.45/2.36 # ...subsumed : 434
% 8.45/2.36 # ...remaining for further processing : 556
% 8.45/2.36 # Other redundant clauses eliminated : 224
% 8.45/2.36 # Clauses deleted for lack of memory : 0
% 8.45/2.36 # Backward-subsumed : 19
% 8.45/2.36 # Backward-rewritten : 8
% 8.45/2.36 # Generated clauses : 4814
% 8.45/2.36 # ...of the previous two non-trivial : 4251
% 8.45/2.36 # Contextual simplify-reflections : 438
% 8.45/2.36 # Paramodulations : 4493
% 8.45/2.36 # Factorizations : 0
% 8.45/2.36 # Equation resolutions : 321
% 8.45/2.36 # Propositional unsat checks : 0
% 8.45/2.36 # Propositional unsat check successes : 0
% 8.45/2.36 # Current number of processed clauses : 523
% 8.45/2.36 # Positive orientable unit clauses : 38
% 8.45/2.36 # Positive unorientable unit clauses: 0
% 8.45/2.36 # Negative unit clauses : 15
% 8.45/2.36 # Non-unit-clauses : 470
% 8.45/2.36 # Current number of unprocessed clauses: 3167
% 8.45/2.36 # ...number of literals in the above : 22838
% 8.45/2.36 # Current number of archived formulas : 0
% 8.45/2.36 # Current number of archived clauses : 27
% 8.45/2.36 # Clause-clause subsumption calls (NU) : 69836
% 8.45/2.36 # Rec. Clause-clause subsumption calls : 10488
% 8.45/2.36 # Non-unit clause-clause subsumptions : 698
% 8.45/2.36 # Unit Clause-clause subsumption calls : 1846
% 8.45/2.36 # Rewrite failures with RHS unbound : 0
% 8.45/2.36 # BW rewrite match attempts : 4
% 8.45/2.36 # BW rewrite match successes : 4
% 8.45/2.36 # Condensation attempts : 0
% 8.45/2.36 # Condensation successes : 0
% 8.45/2.36 # Termbank termtop insertions : 92436
% 8.45/2.36
% 8.45/2.36 # -------------------------------------------------
% 8.45/2.36 # User time : 0.117 s
% 8.45/2.36 # System time : 0.006 s
% 8.45/2.36 # Total time : 0.123 s
% 8.45/2.36 # ...preprocessing : 0.012 s
% 8.45/2.36 # ...main loop : 0.110 s
% 8.45/2.36 # Maximum resident set size: 8672 pages
% 8.45/2.36
%------------------------------------------------------------------------------