TSTP Solution File: SWC219+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC219+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:22 EDT 2022
% Result : Theorem 8.27s 2.59s
% Output : CNFRefutation 8.27s
% 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 : 65 ( 24 equ; 38 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 : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| cons(esk53_0,nil) = esk50_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_195) ).
cnf(i_0_205,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_205) ).
cnf(i_0_204,negated_conjecture,
nil != esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_204) ).
cnf(i_0_197,negated_conjecture,
( esk50_0 = nil
| ssItem(esk53_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_197) ).
cnf(i_0_79,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_79) ).
cnf(i_0_201,negated_conjecture,
( memberP(X1,esk52_3(X2,X3,X1))
| app(app(X3,cons(X2,nil)),X1) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_201) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_44) ).
cnf(i_0_154,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_154) ).
cnf(i_0_203,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/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_203) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_60) ).
cnf(i_0_210,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2xhv4fqk/lgb.p',i_0_210) ).
cnf(c_0_222,negated_conjecture,
( esk50_0 = nil
| cons(esk53_0,nil) = esk50_0 ),
i_0_195 ).
cnf(c_0_223,negated_conjecture,
esk50_0 = esk48_0,
i_0_205 ).
cnf(c_0_224,negated_conjecture,
nil != esk48_0,
i_0_204 ).
cnf(c_0_225,negated_conjecture,
( esk50_0 = nil
| ssItem(esk53_0) ),
i_0_197 ).
cnf(c_0_226,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
i_0_79 ).
cnf(c_0_227,negated_conjecture,
( memberP(X1,esk52_3(X2,X3,X1))
| app(app(X3,cons(X2,nil)),X1) != esk48_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
i_0_201 ).
cnf(c_0_228,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_229,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_154 ).
cnf(c_0_230,negated_conjecture,
cons(esk53_0,nil) = esk48_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_223]),c_0_223]),c_0_224]) ).
cnf(c_0_231,negated_conjecture,
ssItem(esk53_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_223]),c_0_224]) ).
cnf(c_0_232,plain,
( app(app(X1,cons(X2,nil)),nil) != esk48_0
| ~ ssItem(esk52_3(X2,X1,nil))
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_228])]) ).
cnf(c_0_233,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_203 ).
cnf(c_0_234,negated_conjecture,
( cons(esk53_0,X1) = app(esk48_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231])]) ).
cnf(c_0_235,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != esk48_0
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_228])]) ).
cnf(c_0_236,negated_conjecture,
app(esk48_0,nil) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_234]),c_0_228])]) ).
cnf(c_0_237,negated_conjecture,
( app(app(X1,esk48_0),nil) != esk48_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_234]),c_0_236]),c_0_231]),c_0_228])]) ).
cnf(c_0_238,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_239,negated_conjecture,
ssList(esk48_0),
i_0_210 ).
cnf(c_0_240,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_236]),c_0_228]),c_0_239])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC219+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 21:10:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.27/2.59 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.27/2.59 # No SInE strategy applied
% 8.27/2.59 # Trying AutoSched0 for 150 seconds
% 8.27/2.59 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
% 8.27/2.59 # and selection function PSelectComplexExceptUniqMaxHorn.
% 8.27/2.59 #
% 8.27/2.59 # Preprocessing time : 0.025 s
% 8.27/2.59
% 8.27/2.59 # Proof found!
% 8.27/2.59 # SZS status Theorem
% 8.27/2.59 # SZS output start CNFRefutation
% See solution above
% 8.27/2.59 # Training examples: 0 positive, 0 negative
% 8.27/2.59
% 8.27/2.59 # -------------------------------------------------
% 8.27/2.59 # User time : 0.036 s
% 8.27/2.59 # System time : 0.005 s
% 8.27/2.59 # Total time : 0.041 s
% 8.27/2.59 # Maximum resident set size: 7124 pages
% 8.27/2.59
%------------------------------------------------------------------------------