TSTP Solution File: SWV161+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV161+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:03 EDT 2022
% Result : Theorem 7.81s 2.39s
% Output : CNFRefutation 7.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 12 unt; 3 nHn; 19 RR)
% Number of literals : 30 ( 10 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h5km8xm/lgb.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
| ~ leq(n0,X1)
| ~ leq(X1,minus(pv10,n1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h5km8xm/lgb.p',i_0_4) ).
cnf(i_0_3,negated_conjecture,
leq(n0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h5km8xm/lgb.p',i_0_3) ).
cnf(i_0_47,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h5km8xm/lgb.p',i_0_47) ).
cnf(i_0_2,negated_conjecture,
leq(esk1_0,pv10),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h5km8xm/lgb.p',i_0_2) ).
cnf(i_0_48,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h5km8xm/lgb.p',i_0_48) ).
cnf(i_0_7,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8h5km8xm/lgb.p',i_0_7) ).
cnf(c_0_56,negated_conjecture,
sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1,
i_0_1 ).
cnf(c_0_57,negated_conjecture,
( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
| ~ leq(n0,X1)
| ~ leq(X1,minus(pv10,n1)) ),
i_0_4 ).
cnf(c_0_58,negated_conjecture,
leq(n0,esk1_0),
i_0_3 ).
cnf(c_0_59,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
i_0_47 ).
cnf(c_0_60,negated_conjecture,
leq(esk1_0,pv10),
i_0_2 ).
cnf(c_0_61,negated_conjecture,
~ leq(esk1_0,minus(pv10,n1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).
cnf(c_0_62,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
i_0_48 ).
cnf(c_0_63,negated_conjecture,
( esk1_0 = pv10
| gt(pv10,esk1_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,plain,
~ gt(pv10,esk1_0),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
esk1_0 = pv10,
inference(sr,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_66,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
i_0_7 ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_65]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV161+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n014.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 : Thu Jun 16 05:43:52 EDT 2022
% 0.19/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.81/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.81/2.39 # No SInE strategy applied
% 7.81/2.39 # Trying AutoSched0 for 150 seconds
% 7.81/2.39 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.81/2.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.81/2.39 #
% 7.81/2.39 # Preprocessing time : 0.023 s
% 7.81/2.39 # Presaturation interreduction done
% 7.81/2.39
% 7.81/2.39 # Proof found!
% 7.81/2.39 # SZS status Theorem
% 7.81/2.39 # SZS output start CNFRefutation
% See solution above
% 7.81/2.39 # Training examples: 0 positive, 0 negative
% 7.81/2.39
% 7.81/2.39 # -------------------------------------------------
% 7.81/2.39 # User time : 0.027 s
% 7.81/2.39 # System time : 0.006 s
% 7.81/2.39 # Total time : 0.032 s
% 7.81/2.39 # Maximum resident set size: 7124 pages
% 7.81/2.39
%------------------------------------------------------------------------------