TSTP Solution File: SWC207+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC207+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:17 EDT 2022
% Result : Theorem 7.65s 2.32s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 32 ( 20 unt; 10 nHn; 32 RR)
% Number of literals : 50 ( 22 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_199,negated_conjecture,
~ neq(esk48_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_199) ).
cnf(i_0_201,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_201) ).
cnf(i_0_206,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_206) ).
cnf(i_0_196,negated_conjecture,
( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_196) ).
cnf(i_0_202,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_202) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_44) ).
cnf(i_0_198,negated_conjecture,
( nil = esk51_0
| ssItem(esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_198) ).
cnf(i_0_45,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_45) ).
cnf(i_0_200,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0k0ihk8z/lgb.p',i_0_200) ).
cnf(c_0_217,negated_conjecture,
~ neq(esk48_0,nil),
i_0_199 ).
cnf(c_0_218,negated_conjecture,
esk50_0 = esk48_0,
i_0_201 ).
cnf(c_0_219,negated_conjecture,
ssList(esk48_0),
i_0_206 ).
cnf(c_0_220,negated_conjecture,
( nil = esk51_0
| cons(esk52_0,nil) = esk50_0 ),
i_0_196 ).
cnf(c_0_221,negated_conjecture,
esk49_0 = esk51_0,
i_0_202 ).
cnf(c_0_222,negated_conjecture,
~ neq(esk50_0,nil),
inference(rw,[status(thm)],[c_0_217,c_0_218]) ).
cnf(c_0_223,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_224,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_225,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_219,c_0_218]) ).
cnf(c_0_226,negated_conjecture,
( nil = esk51_0
| ssItem(esk52_0) ),
i_0_198 ).
cnf(c_0_227,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| nil = esk49_0 ),
inference(rw,[status(thm)],[c_0_220,c_0_221]) ).
cnf(c_0_228,negated_conjecture,
nil = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_224]),c_0_225])]) ).
cnf(c_0_229,negated_conjecture,
( nil = esk49_0
| ssItem(esk52_0) ),
inference(rw,[status(thm)],[c_0_226,c_0_221]) ).
cnf(c_0_230,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_45 ).
cnf(c_0_231,negated_conjecture,
( cons(esk52_0,esk50_0) = esk50_0
| esk50_0 = esk49_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_227,c_0_228]),c_0_228]) ).
cnf(c_0_232,negated_conjecture,
( esk50_0 = esk49_0
| ssItem(esk52_0) ),
inference(rw,[status(thm)],[c_0_229,c_0_228]) ).
cnf(c_0_233,negated_conjecture,
neq(esk49_0,nil),
i_0_200 ).
cnf(c_0_234,negated_conjecture,
~ neq(esk50_0,esk50_0),
inference(rw,[status(thm)],[c_0_222,c_0_228]) ).
cnf(c_0_235,plain,
esk50_0 = esk49_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_225])]),c_0_232]) ).
cnf(c_0_236,negated_conjecture,
neq(esk49_0,esk50_0),
inference(rw,[status(thm)],[c_0_233,c_0_228]) ).
cnf(c_0_237,negated_conjecture,
~ neq(esk49_0,esk49_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_235]),c_0_235]) ).
cnf(c_0_238,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_235]),c_0_237]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC207+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jun 11 22:53:59 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.65/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.65/2.32 # No SInE strategy applied
% 7.65/2.32 # Trying AutoSched0 for 150 seconds
% 7.65/2.32 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.65/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.65/2.32 #
% 7.65/2.32 # Preprocessing time : 0.024 s
% 7.65/2.32
% 7.65/2.32 # Proof found!
% 7.65/2.32 # SZS status Theorem
% 7.65/2.32 # SZS output start CNFRefutation
% See solution above
% 7.65/2.32 # Training examples: 0 positive, 0 negative
% 7.65/2.32
% 7.65/2.32 # -------------------------------------------------
% 7.65/2.32 # User time : 0.030 s
% 7.65/2.32 # System time : 0.002 s
% 7.65/2.32 # Total time : 0.032 s
% 7.65/2.32 # Maximum resident set size: 7124 pages
% 7.65/2.32
%------------------------------------------------------------------------------