TSTP Solution File: SWC105+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC105+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:13:39 EDT 2022
% Result : Theorem 7.29s 2.46s
% Output : CNFRefutation 7.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 14 unt; 10 nHn; 38 RR)
% Number of literals : 72 ( 30 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_194,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_194) ).
cnf(i_0_200,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_200) ).
cnf(i_0_193,negated_conjecture,
( nil = esk51_0
| rearsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_193) ).
cnf(i_0_191,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk51_0,esk50_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_191) ).
cnf(i_0_197,negated_conjecture,
( nil = esk49_0
| ~ neq(esk48_0,nil)
| ~ rearsegP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_197) ).
cnf(i_0_199,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_199) ).
cnf(i_0_195,negated_conjecture,
( nil != esk48_0
| ~ neq(esk48_0,nil)
| ~ rearsegP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_195) ).
cnf(i_0_204,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_204) ).
cnf(i_0_196,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_196) ).
cnf(i_0_104,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_104) ).
cnf(i_0_103,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_103) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jwnxioxn/lgb.p',i_0_44) ).
cnf(c_0_217,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
i_0_194 ).
cnf(c_0_218,negated_conjecture,
esk49_0 = esk51_0,
i_0_200 ).
cnf(c_0_219,negated_conjecture,
( nil = esk51_0
| rearsegP(esk51_0,esk50_0) ),
i_0_193 ).
cnf(c_0_220,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk51_0,esk50_0) ),
i_0_191 ).
cnf(c_0_221,negated_conjecture,
( nil = esk49_0
| ~ neq(esk48_0,nil)
| ~ rearsegP(esk49_0,esk48_0) ),
i_0_197 ).
cnf(c_0_222,negated_conjecture,
esk50_0 = esk48_0,
i_0_199 ).
cnf(c_0_223,negated_conjecture,
( esk49_0 = nil
| neq(esk50_0,nil) ),
inference(rw,[status(thm)],[c_0_217,c_0_218]) ).
cnf(c_0_224,negated_conjecture,
( esk49_0 = nil
| rearsegP(esk49_0,esk50_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_218]),c_0_218]) ).
cnf(c_0_225,negated_conjecture,
( nil != esk48_0
| ~ neq(esk48_0,nil)
| ~ rearsegP(esk49_0,esk48_0) ),
i_0_195 ).
cnf(c_0_226,negated_conjecture,
( esk50_0 = nil
| rearsegP(esk49_0,esk50_0) ),
inference(rw,[status(thm)],[c_0_220,c_0_218]) ).
cnf(c_0_227,negated_conjecture,
esk49_0 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_222]),c_0_222]),c_0_223]),c_0_224]) ).
cnf(c_0_228,negated_conjecture,
ssList(esk48_0),
i_0_204 ).
cnf(c_0_229,negated_conjecture,
( neq(esk49_0,nil)
| nil != esk48_0 ),
i_0_196 ).
cnf(c_0_230,negated_conjecture,
( esk50_0 != nil
| ~ rearsegP(esk49_0,esk50_0)
| ~ neq(esk50_0,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_222]),c_0_222]),c_0_222]) ).
cnf(c_0_231,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
i_0_104 ).
cnf(c_0_232,negated_conjecture,
( esk50_0 = nil
| rearsegP(nil,esk50_0) ),
inference(rw,[status(thm)],[c_0_226,c_0_227]) ).
cnf(c_0_233,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_228,c_0_222]) ).
cnf(c_0_234,plain,
( rearsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
i_0_103 ).
cnf(c_0_235,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_236,negated_conjecture,
( neq(esk49_0,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_229,c_0_222]) ).
cnf(c_0_237,negated_conjecture,
( esk50_0 != nil
| ~ rearsegP(nil,esk50_0)
| ~ neq(esk50_0,nil) ),
inference(rw,[status(thm)],[c_0_230,c_0_227]) ).
cnf(c_0_238,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_233])]) ).
cnf(c_0_239,plain,
rearsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_234]),c_0_235])]) ).
cnf(c_0_240,negated_conjecture,
( neq(nil,nil)
| esk50_0 != nil ),
inference(rw,[status(thm)],[c_0_236,c_0_227]) ).
cnf(c_0_241,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_238]),c_0_238]),c_0_239]),c_0_238])]) ).
cnf(c_0_242,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_240,c_0_238])]),c_0_241]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC105+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 09:09:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.29/2.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.29/2.46 # No SInE strategy applied
% 7.29/2.46 # Trying AutoSched0 for 150 seconds
% 7.29/2.46 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 7.29/2.46 # and selection function PSelectNewComplexAHP.
% 7.29/2.46 #
% 7.29/2.46 # Preprocessing time : 0.013 s
% 7.29/2.46 # Presaturation interreduction done
% 7.29/2.46
% 7.29/2.46 # Proof found!
% 7.29/2.46 # SZS status Theorem
% 7.29/2.46 # SZS output start CNFRefutation
% See solution above
% 7.29/2.46 # Training examples: 0 positive, 0 negative
% 7.29/2.46
% 7.29/2.46 # -------------------------------------------------
% 7.29/2.46 # User time : 0.016 s
% 7.29/2.46 # System time : 0.004 s
% 7.29/2.46 # Total time : 0.020 s
% 7.29/2.46 # Maximum resident set size: 7128 pages
% 7.29/2.46
%------------------------------------------------------------------------------