TSTP Solution File: SWV067+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV067+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:45:43 EDT 2022
% Result : Theorem 7.99s 2.56s
% Output : CNFRefutation 7.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 13 unt; 0 nHn; 23 RR)
% Number of literals : 47 ( 0 equ; 28 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
( ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1))
| ~ gt(a_select3(q,pv10,pv63),pv78) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmdlbbx3/lgb.p',i_0_3) ).
cnf(i_0_8,negated_conjecture,
leq(n0,pv10),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmdlbbx3/lgb.p',i_0_8) ).
cnf(i_0_6,negated_conjecture,
leq(pv10,minus(n135300,n1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmdlbbx3/lgb.p',i_0_6) ).
cnf(i_0_5,negated_conjecture,
leq(pv63,minus(n5,n1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmdlbbx3/lgb.p',i_0_5) ).
cnf(i_0_2,negated_conjecture,
( gt(a_select3(q,pv10,pv63),pv78)
| ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmdlbbx3/lgb.p',i_0_2) ).
cnf(i_0_174,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmdlbbx3/lgb.p',i_0_174) ).
cnf(i_0_7,negated_conjecture,
leq(n1,pv63),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmdlbbx3/lgb.p',i_0_7) ).
cnf(i_0_47,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmdlbbx3/lgb.p',i_0_47) ).
cnf(i_0_18,plain,
gt(n1,n0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mmdlbbx3/lgb.p',i_0_18) ).
cnf(c_0_184,negated_conjecture,
( ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1))
| ~ gt(a_select3(q,pv10,pv63),pv78) ),
i_0_3 ).
cnf(c_0_185,negated_conjecture,
leq(n0,pv10),
i_0_8 ).
cnf(c_0_186,negated_conjecture,
leq(pv10,minus(n135300,n1)),
i_0_6 ).
cnf(c_0_187,negated_conjecture,
leq(pv63,minus(n5,n1)),
i_0_5 ).
cnf(c_0_188,negated_conjecture,
( gt(a_select3(q,pv10,pv63),pv78)
| ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1)) ),
i_0_2 ).
cnf(c_0_189,negated_conjecture,
( ~ gt(a_select3(q,pv10,pv63),pv78)
| ~ leq(n0,pv63) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_184,c_0_185]),c_0_186]),c_0_187])]) ).
cnf(c_0_190,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
i_0_174 ).
cnf(c_0_191,negated_conjecture,
leq(n1,pv63),
i_0_7 ).
cnf(c_0_192,plain,
( leq(X1,X2)
| ~ gt(X2,X1) ),
i_0_47 ).
cnf(c_0_193,plain,
gt(n1,n0),
i_0_18 ).
cnf(c_0_194,negated_conjecture,
~ leq(n0,pv63),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_188,c_0_185]),c_0_186]),c_0_187])]),c_0_189]) ).
cnf(c_0_195,negated_conjecture,
( leq(X1,pv63)
| ~ leq(X1,n1) ),
inference(spm,[status(thm)],[c_0_190,c_0_191]) ).
cnf(c_0_196,plain,
leq(n0,n1),
inference(spm,[status(thm)],[c_0_192,c_0_193]) ).
cnf(c_0_197,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_194,c_0_195]),c_0_196])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV067+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 : Tue Jun 14 21:48:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.99/2.56 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.99/2.56 # No SInE strategy applied
% 7.99/2.56 # Trying AutoSched0 for 150 seconds
% 7.99/2.56 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 7.99/2.56 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.99/2.56 #
% 7.99/2.56 # Preprocessing time : 0.025 s
% 7.99/2.56
% 7.99/2.56 # Proof found!
% 7.99/2.56 # SZS status Theorem
% 7.99/2.56 # SZS output start CNFRefutation
% See solution above
% 7.99/2.56 # Training examples: 0 positive, 0 negative
% 7.99/2.56
% 7.99/2.56 # -------------------------------------------------
% 7.99/2.56 # User time : 0.026 s
% 7.99/2.56 # System time : 0.010 s
% 7.99/2.56 # Total time : 0.036 s
% 7.99/2.56 # Maximum resident set size: 7120 pages
% 7.99/2.56
%------------------------------------------------------------------------------