%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC416+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:34 EDT 2022
% Result : Theorem 7.82s 2.41s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 21 unt; 2 nHn; 39 RR)
% Number of literals : 86 ( 27 equ; 53 neg)
% Maximal clause size : 9 ( 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; 6 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( app(cons(esk52_0,nil),esk50_0) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_191) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_199) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_200) ).
cnf(i_0_198,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_198) ).
cnf(i_0_202,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_202) ).
cnf(i_0_193,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_193) ).
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-3_g9zujy/lgb.p',i_0_154) ).
cnf(i_0_195,negated_conjecture,
( esk49_0 != X1
| hd(esk49_0) != X2
| cons(X2,nil) != X3
| app(X3,esk48_0) != X1
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk49_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_195) ).
cnf(i_0_55,plain,
( hd(cons(X1,X2)) = X1
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_55) ).
cnf(i_0_201,negated_conjecture,
ssList(esk51_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_201) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_53) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_44) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3_g9zujy/lgb.p',i_0_43) ).
cnf(c_0_217,negated_conjecture,
( app(cons(esk52_0,nil),esk50_0) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_218,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_219,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_220,negated_conjecture,
neq(esk49_0,nil),
i_0_198 ).
cnf(c_0_221,negated_conjecture,
ssList(esk50_0),
i_0_202 ).
cnf(c_0_222,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_223,negated_conjecture,
app(cons(esk52_0,nil),esk48_0) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_218]),c_0_219]),c_0_219]),c_0_220])]) ).
cnf(c_0_224,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_225,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_221,c_0_218]) ).
cnf(c_0_226,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_219]),c_0_220])]) ).
cnf(c_0_227,negated_conjecture,
( esk49_0 != X1
| hd(esk49_0) != X2
| cons(X2,nil) != X3
| app(X3,esk48_0) != X1
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ neq(nil,esk49_0)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_228,plain,
( hd(cons(X1,X2)) = X1
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_55 ).
cnf(c_0_229,negated_conjecture,
cons(esk52_0,esk48_0) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225]),c_0_226])]) ).
cnf(c_0_230,negated_conjecture,
ssList(esk51_0),
i_0_201 ).
cnf(c_0_231,negated_conjecture,
( app(cons(hd(esk49_0),nil),esk48_0) != esk49_0
| ~ ssList(app(cons(hd(esk49_0),nil),esk48_0))
| ~ ssList(cons(hd(esk49_0),nil))
| ~ ssItem(hd(esk49_0))
| ~ neq(nil,esk49_0) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_227,c_0_219]),c_0_220])])])])]) ).
cnf(c_0_232,plain,
hd(esk49_0) = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_225]),c_0_226])]) ).
cnf(c_0_233,negated_conjecture,
ssList(esk49_0),
inference(rw,[status(thm)],[c_0_230,c_0_219]) ).
cnf(c_0_234,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_235,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ neq(nil,esk49_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_232]),c_0_223]),c_0_232]),c_0_223]),c_0_233]),c_0_232]),c_0_232]),c_0_226])]) ).
cnf(c_0_236,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_237,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_238,plain,
esk49_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_229]),c_0_225]),c_0_226])]) ).
cnf(c_0_239,plain,
~ ssList(cons(esk52_0,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_233]),c_0_237])]),c_0_238]) ).
cnf(c_0_240,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_241,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_237]),c_0_226])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC416+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 12 23:07:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.82/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.41 # No SInE strategy applied
% 7.82/2.41 # Trying AutoSched0 for 150 seconds
% 7.82/2.41 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.82/2.41 # and selection function SelectNewComplexAHP.
% 7.82/2.41 #
% 7.82/2.41 # Preprocessing time : 0.025 s
% 7.82/2.41 # Presaturation interreduction done
% 7.82/2.41
% 7.82/2.41 # Proof found!
% 7.82/2.41 # SZS status Theorem
% 7.82/2.41 # SZS output start CNFRefutation
% See solution above
% 7.82/2.41 # Training examples: 0 positive, 0 negative
% 7.82/2.41
% 7.82/2.41 # -------------------------------------------------
% 7.82/2.41 # User time : 0.032 s
% 7.82/2.41 # System time : 0.006 s
% 7.82/2.41 # Total time : 0.038 s
% 7.82/2.41 # Maximum resident set size: 7128 pages
% 7.82/2.41
%------------------------------------------------------------------------------