TSTP Solution File: SWV056+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV056+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:45:40 EDT 2022
% Result : Theorem 8.38s 2.41s
% Output : CNFRefutation 8.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 17 unt; 0 nHn; 13 RR)
% Number of literals : 25 ( 15 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 7 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0
| ~ leq(n0,pv25)
| ~ leq(pv25,minus(n5,n1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lljjawxw/lgb.p',i_0_1) ).
cnf(i_0_3,negated_conjecture,
leq(n0,pv25),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lljjawxw/lgb.p',i_0_3) ).
cnf(i_0_127,plain,
minus(plus(X1,n1),n1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lljjawxw/lgb.p',i_0_127) ).
cnf(i_0_146,plain,
plus(n1,X1) = plus(X1,n1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lljjawxw/lgb.p',i_0_146) ).
cnf(i_0_157,plain,
plus(tptp_minus_1,n1) = n0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lljjawxw/lgb.p',i_0_157) ).
cnf(i_0_2,negated_conjecture,
leq(pv25,minus(n5,n1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lljjawxw/lgb.p',i_0_2) ).
cnf(i_0_158,plain,
sum(n0,tptp_minus_1,X1) = n0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lljjawxw/lgb.p',i_0_158) ).
cnf(c_0_166,negated_conjecture,
( sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0
| ~ leq(n0,pv25)
| ~ leq(pv25,minus(n5,n1)) ),
i_0_1 ).
cnf(c_0_167,negated_conjecture,
leq(n0,pv25),
i_0_3 ).
cnf(c_0_168,plain,
minus(plus(X1,n1),n1) = X1,
i_0_127 ).
cnf(c_0_169,plain,
plus(n1,X1) = plus(X1,n1),
i_0_146 ).
cnf(c_0_170,plain,
plus(tptp_minus_1,n1) = n0,
i_0_157 ).
cnf(c_0_171,negated_conjecture,
( sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0
| ~ leq(pv25,minus(n5,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_167])]) ).
cnf(c_0_172,negated_conjecture,
leq(pv25,minus(n5,n1)),
i_0_2 ).
cnf(c_0_173,plain,
minus(plus(n1,X1),n1) = X1,
inference(spm,[status(thm)],[c_0_168,c_0_169]) ).
cnf(c_0_174,plain,
plus(n1,tptp_minus_1) = n0,
inference(rw,[status(thm)],[c_0_170,c_0_169]) ).
cnf(c_0_175,negated_conjecture,
sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_171,c_0_172])]) ).
cnf(c_0_176,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_177,plain,
sum(n0,tptp_minus_1,X1) = n0,
i_0_158 ).
cnf(c_0_178,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_175,c_0_176]),c_0_177])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV056+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 19:22:41 EDT 2022
% 0.13/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
% 8.38/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.38/2.41 # No SInE strategy applied
% 8.38/2.41 # Trying AutoSched0 for 150 seconds
% 8.38/2.41 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S04BN
% 8.38/2.41 # and selection function PSelectComplexExceptUniqMaxHorn.
% 8.38/2.41 #
% 8.38/2.41 # Preprocessing time : 0.024 s
% 8.38/2.41
% 8.38/2.41 # Proof found!
% 8.38/2.41 # SZS status Theorem
% 8.38/2.41 # SZS output start CNFRefutation
% See solution above
% 8.38/2.41 # Training examples: 0 positive, 0 negative
% 8.38/2.41
% 8.38/2.41 # -------------------------------------------------
% 8.38/2.41 # User time : 0.029 s
% 8.38/2.41 # System time : 0.008 s
% 8.38/2.41 # Total time : 0.037 s
% 8.38/2.41 # Maximum resident set size: 7124 pages
% 8.38/2.41
%------------------------------------------------------------------------------