TSTP Solution File: SWV069+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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.45s 2.36s
% Output : CNFRefutation 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 24 ( 0 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oj_1t4pr/lgb.p',i_0_1) ).
cnf(i_0_135,plain,
leq(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oj_1t4pr/lgb.p',i_0_135) ).
cnf(i_0_3,negated_conjecture,
leq(n0,pv10),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oj_1t4pr/lgb.p',i_0_3) ).
cnf(i_0_2,negated_conjecture,
leq(pv10,minus(n135300,n1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oj_1t4pr/lgb.p',i_0_2) ).
cnf(i_0_44,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oj_1t4pr/lgb.p',i_0_44) ).
cnf(i_0_34,plain,
gt(n5,n0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oj_1t4pr/lgb.p',i_0_34) ).
cnf(c_0_142,negated_conjecture,
( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) ),
i_0_1 ).
cnf(c_0_143,plain,
leq(X1,X1),
i_0_135 ).
cnf(c_0_144,negated_conjecture,
leq(n0,pv10),
i_0_3 ).
cnf(c_0_145,negated_conjecture,
( ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_143]),c_0_144])]) ).
cnf(c_0_146,negated_conjecture,
leq(pv10,minus(n135300,n1)),
i_0_2 ).
cnf(c_0_147,negated_conjecture,
~ leq(n0,minus(n5,n1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_145,c_0_146])]) ).
cnf(c_0_148,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
i_0_44 ).
cnf(c_0_149,plain,
gt(n5,n0),
i_0_34 ).
cnf(c_0_150,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_149])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n024.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jun 15 19:45:20 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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.45/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.45/2.36 # No SInE strategy applied
% 7.45/2.36 # Trying AutoSched0 for 150 seconds
% 7.45/2.36 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 7.45/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.45/2.36 #
% 7.45/2.36 # Preprocessing time : 0.024 s
% 7.45/2.36
% 7.45/2.36 # Proof found!
% 7.45/2.36 # SZS status Theorem
% 7.45/2.36 # SZS output start CNFRefutation
% See solution above
% 7.45/2.36 # Training examples: 0 positive, 0 negative
% 7.45/2.36
% 7.45/2.36 # -------------------------------------------------
% 7.45/2.36 # User time : 0.029 s
% 7.45/2.36 # System time : 0.004 s
% 7.45/2.36 # Total time : 0.033 s
% 7.45/2.36 # Maximum resident set size: 7124 pages
% 7.45/2.36
%------------------------------------------------------------------------------