TSTP Solution File: SWC217+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC217+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:21 EDT 2022
% Result : Theorem 7.82s 2.50s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 18 unt; 2 nHn; 26 RR)
% Number of literals : 40 ( 12 equ; 18 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_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_198) ).
cnf(i_0_192,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_192) ).
cnf(i_0_193,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_193) ).
cnf(i_0_195,negated_conjecture,
~ neq(esk48_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_197) ).
cnf(i_0_53,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_53) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_44) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_41) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ycx6xetz/lgb.p',i_0_200) ).
cnf(c_0_211,negated_conjecture,
neq(esk49_0,nil),
i_0_196 ).
cnf(c_0_212,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_213,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_214,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_211,c_0_212]) ).
cnf(c_0_215,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_216,negated_conjecture,
~ neq(esk48_0,nil),
i_0_195 ).
cnf(c_0_217,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_218,plain,
( cons(X1,X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_53 ).
cnf(c_0_219,negated_conjecture,
cons(esk52_0,nil) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_214])]) ).
cnf(c_0_220,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_221,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_214])]) ).
cnf(c_0_222,negated_conjecture,
~ neq(esk50_0,nil),
inference(rw,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_223,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_224,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_225,negated_conjecture,
esk50_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_220]),c_0_221])]) ).
cnf(c_0_226,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_220]),c_0_224])]),c_0_225]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC217+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 11 23:18:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.82/2.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.50 # No SInE strategy applied
% 7.82/2.50 # Trying AutoSched0 for 150 seconds
% 7.82/2.50 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.82/2.50 # and selection function SelectNewComplexAHP.
% 7.82/2.50 #
% 7.82/2.50 # Preprocessing time : 0.021 s
% 7.82/2.50 # Presaturation interreduction done
% 7.82/2.50
% 7.82/2.50 # Proof found!
% 7.82/2.50 # SZS status Theorem
% 7.82/2.50 # SZS output start CNFRefutation
% See solution above
% 7.82/2.50 # Training examples: 0 positive, 0 negative
% 7.82/2.50
% 7.82/2.50 # -------------------------------------------------
% 7.82/2.50 # User time : 0.024 s
% 7.82/2.50 # System time : 0.005 s
% 7.82/2.50 # Total time : 0.029 s
% 7.82/2.50 # Maximum resident set size: 7124 pages
% 7.82/2.50
%------------------------------------------------------------------------------