TSTP Solution File: SWC308+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC308+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:53 EDT 2022
% Result : Theorem 8.00s 2.42s
% Output : CNFRefutation 8.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 44 ( 13 unt; 8 nHn; 44 RR)
% Number of literals : 130 ( 50 equ; 84 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
( esk48_0 != X1
| hd(esk49_0) != X2
| tl(esk49_0) != X3
| app(X3,X4) != X1
| cons(X2,nil) != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk49_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_193) ).
cnf(i_0_195,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_195) ).
cnf(i_0_58,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_58) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_41) ).
cnf(i_0_199,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_199) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_44) ).
cnf(i_0_54,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_54) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_56) ).
cnf(i_0_192,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_192) ).
cnf(i_0_196,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_196) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_43) ).
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-nd0y_mqf/lgb.p',i_0_154) ).
cnf(i_0_147,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_147) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_42) ).
cnf(i_0_194,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nd0y_mqf/lgb.p',i_0_194) ).
cnf(c_0_215,negated_conjecture,
( esk48_0 != X1
| hd(esk49_0) != X2
| tl(esk49_0) != X3
| app(X3,X4) != X1
| cons(X2,nil) != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk49_0) ),
i_0_193 ).
cnf(c_0_216,negated_conjecture,
esk50_0 = esk48_0,
i_0_195 ).
cnf(c_0_217,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_58 ).
cnf(c_0_218,negated_conjecture,
( app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| ~ neq(nil,esk49_0)
| ~ ssItem(hd(esk49_0))
| ~ ssList(cons(hd(esk49_0),nil))
| ~ ssList(tl(esk49_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_216])])])])]),c_0_217]) ).
cnf(c_0_219,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_220,negated_conjecture,
ssList(esk49_0),
i_0_199 ).
cnf(c_0_221,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_222,negated_conjecture,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| ~ ssItem(hd(esk49_0))
| ~ ssList(cons(hd(esk49_0),nil))
| ~ ssList(tl(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_220]),c_0_221])]) ).
cnf(c_0_223,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
i_0_54 ).
cnf(c_0_224,plain,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| ~ ssList(cons(hd(esk49_0),nil))
| ~ ssList(tl(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_220])]) ).
cnf(c_0_225,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_226,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_192 ).
cnf(c_0_227,negated_conjecture,
esk49_0 = esk51_0,
i_0_196 ).
cnf(c_0_228,plain,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| ~ ssList(cons(hd(esk49_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_220])]) ).
cnf(c_0_229,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_230,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| app(cons(X2,nil),X1) != esk49_0
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_231,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_232,plain,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0
| ~ ssItem(hd(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_221])]) ).
cnf(c_0_233,plain,
( app(X1,cons(X2,nil)) = esk50_0
| cons(X2,X1) != esk49_0
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_230,c_0_231]) ).
cnf(c_0_234,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
i_0_147 ).
cnf(c_0_235,plain,
( esk49_0 = nil
| app(tl(esk49_0),cons(hd(esk49_0),nil)) != esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_223]),c_0_220])]) ).
cnf(c_0_236,plain,
( esk49_0 = nil
| ~ ssItem(hd(esk49_0))
| ~ ssList(tl(esk49_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_233,c_0_234])]),c_0_220])]),c_0_235]) ).
cnf(c_0_237,plain,
( esk49_0 = nil
| ~ ssList(tl(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_223]),c_0_220])]) ).
cnf(c_0_238,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_239,negated_conjecture,
neq(esk49_0,nil),
i_0_194 ).
cnf(c_0_240,plain,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_225]),c_0_220])]) ).
cnf(c_0_241,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_238]) ).
cnf(c_0_242,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_239,c_0_240]) ).
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_221])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC308+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 07:56:35 EDT 2022
% 0.12/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
% 8.00/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.00/2.42 # No SInE strategy applied
% 8.00/2.42 # Trying AutoSched0 for 150 seconds
% 8.00/2.42 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.00/2.42 # and selection function SelectNewComplexAHP.
% 8.00/2.42 #
% 8.00/2.42 # Preprocessing time : 0.024 s
% 8.00/2.42 # Presaturation interreduction done
% 8.00/2.42
% 8.00/2.42 # Proof found!
% 8.00/2.42 # SZS status Theorem
% 8.00/2.42 # SZS output start CNFRefutation
% See solution above
% 8.00/2.42 # Training examples: 0 positive, 0 negative
% 8.00/2.42
% 8.00/2.42 # -------------------------------------------------
% 8.00/2.42 # User time : 0.038 s
% 8.00/2.42 # System time : 0.004 s
% 8.00/2.42 # Total time : 0.042 s
% 8.00/2.42 # Maximum resident set size: 7128 pages
% 8.00/2.42
%------------------------------------------------------------------------------