TSTP Solution File: SWV191+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV191+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:09 EDT 2022
% Result : Theorem 7.77s 2.44s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 15 unt; 0 nHn; 18 RR)
% Number of literals : 27 ( 5 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_32,plain,
~ gt(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypup30io/lgb.p',i_0_32) ).
cnf(i_0_41,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypup30io/lgb.p',i_0_41) ).
cnf(i_0_176,plain,
plus(n1,X1) = plus(X1,n1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypup30io/lgb.p',i_0_176) ).
cnf(i_0_187,plain,
plus(tptp_minus_1,n1) = n0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypup30io/lgb.p',i_0_187) ).
cnf(i_0_192,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypup30io/lgb.p',i_0_192) ).
cnf(i_0_127,negated_conjecture,
leq(esk22_0,tptp_minus_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypup30io/lgb.p',i_0_127) ).
cnf(i_0_129,negated_conjecture,
leq(n0,esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypup30io/lgb.p',i_0_129) ).
cnf(c_0_200,plain,
~ gt(X1,X1),
i_0_32 ).
cnf(c_0_201,plain,
( gt(plus(X1,n1),X2)
| ~ leq(X2,X1) ),
i_0_41 ).
cnf(c_0_202,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_200,c_0_201]) ).
cnf(c_0_203,plain,
plus(n1,X1) = plus(X1,n1),
i_0_176 ).
cnf(c_0_204,plain,
plus(tptp_minus_1,n1) = n0,
i_0_187 ).
cnf(c_0_205,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
i_0_192 ).
cnf(c_0_206,negated_conjecture,
leq(esk22_0,tptp_minus_1),
i_0_127 ).
cnf(c_0_207,plain,
~ leq(plus(n1,X1),X1),
inference(spm,[status(thm)],[c_0_202,c_0_203]) ).
cnf(c_0_208,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[c_0_204,c_0_203]) ).
cnf(c_0_209,negated_conjecture,
( leq(X1,tptp_minus_1)
| ~ leq(X1,esk22_0) ),
inference(spm,[status(thm)],[c_0_205,c_0_206]) ).
cnf(c_0_210,negated_conjecture,
leq(n0,esk22_0),
i_0_129 ).
cnf(c_0_211,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_207,c_0_208]) ).
cnf(c_0_212,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_209,c_0_210]),c_0_211]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV191+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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 : Wed Jun 15 10:07:26 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.77/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.77/2.44 # No SInE strategy applied
% 7.77/2.44 # Trying AutoSched0 for 150 seconds
% 7.77/2.44 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.77/2.44 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.77/2.44 #
% 7.77/2.44 # Preprocessing time : 0.016 s
% 7.77/2.44 # Presaturation interreduction done
% 7.77/2.44
% 7.77/2.44 # Proof found!
% 7.77/2.44 # SZS status Theorem
% 7.77/2.44 # SZS output start CNFRefutation
% See solution above
% 7.77/2.44 # Training examples: 0 positive, 0 negative
% 7.77/2.44
% 7.77/2.44 # -------------------------------------------------
% 7.77/2.44 # User time : 0.021 s
% 7.77/2.44 # System time : 0.004 s
% 7.77/2.44 # Total time : 0.025 s
% 7.77/2.44 # Maximum resident set size: 7120 pages
% 7.77/2.44
%------------------------------------------------------------------------------