TSTP Solution File: SWC415+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC415+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:15:33 EDT 2022
% Result : Theorem 7.50s 2.32s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 13 unt; 7 nHn; 29 RR)
% Number of literals : 69 ( 23 equ; 40 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( esk48_0 != X1
| tl(esk49_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk49_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_191) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_198) ).
cnf(i_0_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_196) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_41) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_201) ).
cnf(i_0_193,negated_conjecture,
( esk50_0 = X1
| tl(esk51_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_197) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_44) ).
cnf(i_0_56,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_56) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wr43u07m/lgb.p',i_0_42) ).
cnf(c_0_212,negated_conjecture,
( esk48_0 != X1
| tl(esk49_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk49_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_213,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_214,negated_conjecture,
neq(esk49_0,nil),
i_0_196 ).
cnf(c_0_215,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_216,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_217,negated_conjecture,
( esk50_0 = X1
| tl(esk51_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk51_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_218,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_219,negated_conjecture,
( tl(esk49_0) != esk48_0
| ~ neq(nil,esk49_0)
| ~ ssList(tl(esk49_0)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_213]),c_0_214])])]) ).
cnf(c_0_220,negated_conjecture,
( X1 = esk49_0
| neq(X1,esk49_0)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_221,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_222,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
i_0_56 ).
cnf(c_0_223,negated_conjecture,
( ~ neq(nil,esk49_0)
| ~ ssList(tl(esk49_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_218]),c_0_213]),c_0_213]),c_0_214]),c_0_213])])]),c_0_219]) ).
cnf(c_0_224,plain,
( esk49_0 = nil
| neq(nil,esk49_0) ),
inference(spm,[status(thm)],[c_0_220,c_0_221]) ).
cnf(c_0_225,negated_conjecture,
( esk49_0 = nil
| ssList(tl(esk49_0)) ),
inference(spm,[status(thm)],[c_0_222,c_0_216]) ).
cnf(c_0_226,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_227,negated_conjecture,
esk49_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225]) ).
cnf(c_0_228,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_226]) ).
cnf(c_0_229,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_214,c_0_227]) ).
cnf(c_0_230,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_228,c_0_229]),c_0_221])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC415+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sun Jun 12 05:15:42 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.39 # ENIGMATIC: Selected SinE mode:
% 0.15/0.40 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.15/0.40 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.15/0.40 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.50/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.50/2.32 # No SInE strategy applied
% 7.50/2.32 # Trying AutoSched0 for 150 seconds
% 7.50/2.32 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S085I
% 7.50/2.32 # and selection function SelectCQArNp.
% 7.50/2.32 #
% 7.50/2.32 # Preprocessing time : 0.015 s
% 7.50/2.32 # Presaturation interreduction done
% 7.50/2.32
% 7.50/2.32 # Proof found!
% 7.50/2.32 # SZS status Theorem
% 7.50/2.32 # SZS output start CNFRefutation
% See solution above
% 7.50/2.32 # Training examples: 0 positive, 0 negative
% 7.50/2.32
% 7.50/2.32 # -------------------------------------------------
% 7.50/2.32 # User time : 0.019 s
% 7.50/2.32 # System time : 0.006 s
% 7.50/2.32 # Total time : 0.025 s
% 7.50/2.32 # Maximum resident set size: 7120 pages
% 7.50/2.32
%------------------------------------------------------------------------------