TSTP Solution File: SWC325+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC325+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:59 EDT 2022
% Result : Theorem 6.85s 2.54s
% Output : CNFRefutation 6.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 35 ( 15 unt; 2 nHn; 35 RR)
% Number of literals : 73 ( 31 equ; 42 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_196,negated_conjecture,
( app(X1,X2) != esk48_0
| app(X2,X1) != esk49_0
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_198) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_197) ).
cnf(i_0_156,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_156) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_44) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_195) ).
cnf(i_0_191,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_191) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_41) ).
cnf(i_0_199,negated_conjecture,
ssList(esk51_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_199) ).
cnf(i_0_193,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_193) ).
cnf(i_0_194,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_194) ).
cnf(i_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_43) ).
cnf(i_0_192,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kjjbh088/lgb.p',i_0_192) ).
cnf(c_0_213,negated_conjecture,
( app(X1,X2) != esk48_0
| app(X2,X1) != esk49_0
| ~ ssList(X1)
| ~ ssList(X2) ),
i_0_196 ).
cnf(c_0_214,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_215,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_216,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
i_0_156 ).
cnf(c_0_217,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_218,negated_conjecture,
( app(X1,X2) != esk51_0
| app(X2,X1) != esk50_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_214]),c_0_215]) ).
cnf(c_0_219,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_216])]),c_0_217])]) ).
cnf(c_0_220,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_195 ).
cnf(c_0_221,negated_conjecture,
( app(esk53_0,cons(esk52_0,nil)) = esk51_0
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_222,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_223,negated_conjecture,
ssList(esk51_0),
i_0_199 ).
cnf(c_0_224,plain,
esk51_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_219]),c_0_217])]),c_0_220]) ).
cnf(c_0_225,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_226,negated_conjecture,
app(esk53_0,cons(esk52_0,nil)) = esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_217]),c_0_223])]),c_0_224]) ).
cnf(c_0_227,negated_conjecture,
ssList(esk53_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_222]),c_0_217]),c_0_223])]),c_0_224]) ).
cnf(c_0_228,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_194 ).
cnf(c_0_229,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) != esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_226]),c_0_227])]) ).
cnf(c_0_230,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_43 ).
cnf(c_0_231,negated_conjecture,
ssItem(esk52_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_222]),c_0_217]),c_0_223])]),c_0_224]) ).
cnf(c_0_232,negated_conjecture,
( app(cons(esk52_0,nil),esk53_0) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_233,plain,
app(cons(esk52_0,nil),esk53_0) != esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_217]),c_0_231])]) ).
cnf(c_0_234,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_222]),c_0_217]),c_0_223])]),c_0_233]),c_0_224]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC325+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n023.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 15:16:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.43 # ENIGMATIC: Selected SinE mode:
% 0.21/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.85/2.54 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.85/2.54 # No SInE strategy applied
% 6.85/2.54 # Trying AutoSched0 for 150 seconds
% 6.85/2.54 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 6.85/2.54 # and selection function SelectNewComplexAHP.
% 6.85/2.54 #
% 6.85/2.54 # Preprocessing time : 0.012 s
% 6.85/2.54 # Presaturation interreduction done
% 6.85/2.54
% 6.85/2.54 # Proof found!
% 6.85/2.54 # SZS status Theorem
% 6.85/2.54 # SZS output start CNFRefutation
% See solution above
% 6.85/2.54 # Training examples: 0 positive, 0 negative
% 6.85/2.54
% 6.85/2.54 # -------------------------------------------------
% 6.85/2.54 # User time : 0.016 s
% 6.85/2.54 # System time : 0.003 s
% 6.85/2.54 # Total time : 0.019 s
% 6.85/2.54 # Maximum resident set size: 7124 pages
% 6.85/2.54
%------------------------------------------------------------------------------