TSTP Solution File: SWV199+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV199+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 : Wed Jul 20 17:46:10 EDT 2022
% Result : Theorem 7.62s 2.60s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 37 ( 19 unt; 3 nHn; 37 RR)
% Number of literals : 64 ( 34 equ; 33 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_207,plain,
( leq(pv5,n0)
| ~ epred2_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_207) ).
cnf(i_0_141,negated_conjecture,
epred2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_141) ).
cnf(i_0_208,plain,
( leq(n0,pv5)
| ~ epred2_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_208) ).
cnf(i_0_4,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_4) ).
cnf(i_0_137,negated_conjecture,
leq(esk22_0,pv5),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_137) ).
cnf(i_0_136,negated_conjecture,
( esk21_0 != n0
| pv5 != esk22_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_136) ).
cnf(i_0_139,negated_conjecture,
leq(n0,esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_139) ).
cnf(i_0_134,negated_conjecture,
( n2 != esk21_0
| pv5 != esk22_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_134) ).
cnf(i_0_135,negated_conjecture,
( esk21_0 != n1
| pv5 != esk22_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_135) ).
cnf(i_0_6,plain,
( X1 = n0
| X1 = n1
| X1 = n2
| ~ leq(X1,n2)
| ~ leq(n0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_6) ).
cnf(i_0_138,negated_conjecture,
leq(esk21_0,n2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_138) ).
cnf(i_0_140,negated_conjecture,
leq(n0,esk21_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-prirsfkp/lgb.p',i_0_140) ).
cnf(c_0_221,plain,
( leq(pv5,n0)
| ~ epred2_0 ),
i_0_207 ).
cnf(c_0_222,negated_conjecture,
epred2_0,
i_0_141 ).
cnf(c_0_223,plain,
( leq(n0,pv5)
| ~ epred2_0 ),
i_0_208 ).
cnf(c_0_224,plain,
( X1 = n0
| ~ leq(X1,n0)
| ~ leq(n0,X1) ),
i_0_4 ).
cnf(c_0_225,plain,
leq(pv5,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_222])]) ).
cnf(c_0_226,plain,
leq(n0,pv5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_222])]) ).
cnf(c_0_227,negated_conjecture,
leq(esk22_0,pv5),
i_0_137 ).
cnf(c_0_228,plain,
pv5 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_226])]) ).
cnf(c_0_229,negated_conjecture,
( esk21_0 != n0
| pv5 != esk22_0 ),
i_0_136 ).
cnf(c_0_230,negated_conjecture,
leq(esk22_0,n0),
inference(rw,[status(thm)],[c_0_227,c_0_228]) ).
cnf(c_0_231,negated_conjecture,
leq(n0,esk22_0),
i_0_139 ).
cnf(c_0_232,negated_conjecture,
( n2 != esk21_0
| pv5 != esk22_0 ),
i_0_134 ).
cnf(c_0_233,negated_conjecture,
( esk21_0 != n1
| pv5 != esk22_0 ),
i_0_135 ).
cnf(c_0_234,plain,
( X1 = n0
| X1 = n1
| X1 = n2
| ~ leq(X1,n2)
| ~ leq(n0,X1) ),
i_0_6 ).
cnf(c_0_235,negated_conjecture,
leq(esk21_0,n2),
i_0_138 ).
cnf(c_0_236,negated_conjecture,
leq(n0,esk21_0),
i_0_140 ).
cnf(c_0_237,negated_conjecture,
( esk21_0 != n0
| esk22_0 != n0 ),
inference(rw,[status(thm)],[c_0_229,c_0_228]) ).
cnf(c_0_238,plain,
esk22_0 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_230]),c_0_231])]) ).
cnf(c_0_239,negated_conjecture,
( esk21_0 != n2
| esk22_0 != n0 ),
inference(rw,[status(thm)],[c_0_232,c_0_228]) ).
cnf(c_0_240,negated_conjecture,
( esk22_0 != n0
| esk21_0 != n1 ),
inference(rw,[status(thm)],[c_0_233,c_0_228]) ).
cnf(c_0_241,negated_conjecture,
( esk21_0 = n0
| esk21_0 = n2
| esk21_0 = n1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_236])]) ).
cnf(c_0_242,negated_conjecture,
esk21_0 != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_238])]) ).
cnf(c_0_243,negated_conjecture,
esk21_0 != n2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_238])]) ).
cnf(c_0_244,negated_conjecture,
esk21_0 != n1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_240,c_0_238])]) ).
cnf(c_0_245,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_241,c_0_242]),c_0_243]),c_0_244]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV199+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n017.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 : Wed Jun 15 15:38:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/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.62/2.60 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.62/2.60 # No SInE strategy applied
% 7.62/2.60 # Trying AutoSched0 for 150 seconds
% 7.62/2.60 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 7.62/2.60 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.62/2.60 #
% 7.62/2.60 # Preprocessing time : 0.024 s
% 7.62/2.60
% 7.62/2.60 # Proof found!
% 7.62/2.60 # SZS status Theorem
% 7.62/2.60 # SZS output start CNFRefutation
% See solution above
% 7.62/2.60 # Training examples: 0 positive, 0 negative
% 7.62/2.60
% 7.62/2.60 # -------------------------------------------------
% 7.62/2.60 # User time : 0.031 s
% 7.62/2.60 # System time : 0.007 s
% 7.62/2.60 # Total time : 0.038 s
% 7.62/2.60 # Maximum resident set size: 7124 pages
% 7.62/2.60
%------------------------------------------------------------------------------