TSTP Solution File: SWC004+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC004+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:12:59 EDT 2022
% Result : Theorem 6.91s 2.27s
% Output : CNFRefutation 6.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 16 unt; 2 nHn; 37 RR)
% Number of literals : 80 ( 22 equ; 47 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_204,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_204) ).
cnf(i_0_206,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_206) ).
cnf(i_0_201,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ neq(X3,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_201) ).
cnf(i_0_205,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_205) ).
cnf(i_0_193,negated_conjecture,
( app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_193) ).
cnf(i_0_191,negated_conjecture,
( app(esk53_0,esk54_0) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_191) ).
cnf(i_0_195,negated_conjecture,
( ssList(esk54_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_197) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_44) ).
cnf(i_0_199,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_199) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_43) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84wcbvmh/lgb.p',i_0_53) ).
cnf(c_0_220,negated_conjecture,
neq(esk49_0,nil),
i_0_204 ).
cnf(c_0_221,negated_conjecture,
esk49_0 = esk51_0,
i_0_206 ).
cnf(c_0_222,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ neq(X3,nil)
| ~ neq(esk51_0,nil) ),
i_0_201 ).
cnf(c_0_223,negated_conjecture,
esk50_0 = esk48_0,
i_0_205 ).
cnf(c_0_224,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_220,c_0_221]) ).
cnf(c_0_225,negated_conjecture,
( app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_226,negated_conjecture,
( app(esk53_0,esk54_0) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_227,negated_conjecture,
( ssList(esk54_0)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_228,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_229,negated_conjecture,
( app(app(X1,X2),X3) != esk51_0
| app(X1,X3) != esk50_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ neq(X2,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_223]),c_0_221]),c_0_224])]) ).
cnf(c_0_230,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_224])]) ).
cnf(c_0_231,negated_conjecture,
app(esk53_0,esk54_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_224])]) ).
cnf(c_0_232,negated_conjecture,
ssList(esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_227,c_0_224])]) ).
cnf(c_0_233,negated_conjecture,
ssList(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_224])]) ).
cnf(c_0_234,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ neq(cons(esk52_0,nil),nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231]),c_0_232]),c_0_233])]) ).
cnf(c_0_235,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_236,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_237,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_199 ).
cnf(c_0_238,plain,
( cons(esk52_0,nil) = nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_236])]) ).
cnf(c_0_239,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_240,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_224])]) ).
cnf(c_0_241,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_242,plain,
cons(esk52_0,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240]),c_0_236])]) ).
cnf(c_0_243,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_240]),c_0_236])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC004+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 17:37:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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
% 6.91/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.91/2.27 # No SInE strategy applied
% 6.91/2.27 # Trying AutoSched0 for 150 seconds
% 6.91/2.27 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 6.91/2.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.91/2.27 #
% 6.91/2.27 # Preprocessing time : 0.024 s
% 6.91/2.27
% 6.91/2.27 # Proof found!
% 6.91/2.27 # SZS status Theorem
% 6.91/2.27 # SZS output start CNFRefutation
% See solution above
% 6.91/2.27 # Training examples: 0 positive, 0 negative
% 6.91/2.27
% 6.91/2.27 # -------------------------------------------------
% 6.91/2.27 # User time : 0.028 s
% 6.91/2.27 # System time : 0.005 s
% 6.91/2.27 # Total time : 0.033 s
% 6.91/2.27 # Maximum resident set size: 7124 pages
% 6.91/2.27
%------------------------------------------------------------------------------