TSTP Solution File: SWV153+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV153+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:02 EDT 2022
% Result : Theorem 7.91s 2.42s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 14 unt; 2 nHn; 21 RR)
% Number of literals : 33 ( 12 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-3 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_51,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qz7m7wqx/lgb.p',i_0_51) ).
cnf(i_0_3,negated_conjecture,
leq(esk1_0,pv12),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qz7m7wqx/lgb.p',i_0_3) ).
cnf(i_0_2,negated_conjecture,
esk1_0 != pv12,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qz7m7wqx/lgb.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) != a_select3(q,pv10,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qz7m7wqx/lgb.p',i_0_1) ).
cnf(i_0_11,negated_conjecture,
sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) = pv70,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qz7m7wqx/lgb.p',i_0_11) ).
cnf(i_0_6,negated_conjecture,
( divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) = a_select3(q,pv10,X1)
| ~ leq(n0,X1)
| ~ leq(X1,minus(pv12,n1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qz7m7wqx/lgb.p',i_0_6) ).
cnf(i_0_52,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qz7m7wqx/lgb.p',i_0_52) ).
cnf(i_0_4,negated_conjecture,
leq(n0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qz7m7wqx/lgb.p',i_0_4) ).
cnf(c_0_61,plain,
( X1 = X2
| gt(X2,X1)
| ~ leq(X1,X2) ),
i_0_51 ).
cnf(c_0_62,negated_conjecture,
leq(esk1_0,pv12),
i_0_3 ).
cnf(c_0_63,negated_conjecture,
esk1_0 != pv12,
i_0_2 ).
cnf(c_0_64,negated_conjecture,
divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) != a_select3(q,pv10,esk1_0),
i_0_1 ).
cnf(c_0_65,negated_conjecture,
sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) = pv70,
i_0_11 ).
cnf(c_0_66,negated_conjecture,
( divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) = a_select3(q,pv10,X1)
| ~ leq(n0,X1)
| ~ leq(X1,minus(pv12,n1)) ),
i_0_6 ).
cnf(c_0_67,plain,
( leq(X1,minus(X2,n1))
| ~ gt(X2,X1) ),
i_0_52 ).
cnf(c_0_68,negated_conjecture,
gt(pv12,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_69,negated_conjecture,
divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),pv70) != a_select3(q,pv10,esk1_0),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
( divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),pv70) = a_select3(q,pv10,X1)
| ~ leq(X1,minus(pv12,n1))
| ~ leq(n0,X1) ),
inference(rw,[status(thm)],[c_0_66,c_0_65]) ).
cnf(c_0_71,plain,
leq(esk1_0,minus(pv12,n1)),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
leq(n0,esk1_0),
i_0_4 ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV153+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.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 04:46:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.91/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.91/2.42 # No SInE strategy applied
% 7.91/2.42 # Trying AutoSched0 for 150 seconds
% 7.91/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.91/2.42 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.91/2.42 #
% 7.91/2.42 # Preprocessing time : 0.023 s
% 7.91/2.42 # Presaturation interreduction done
% 7.91/2.42
% 7.91/2.42 # Proof found!
% 7.91/2.42 # SZS status Theorem
% 7.91/2.42 # SZS output start CNFRefutation
% See solution above
% 7.91/2.42 # Training examples: 0 positive, 0 negative
% 7.91/2.42
% 7.91/2.42 # -------------------------------------------------
% 7.91/2.42 # User time : 0.029 s
% 7.91/2.42 # System time : 0.006 s
% 7.91/2.42 # Total time : 0.035 s
% 7.91/2.42 # Maximum resident set size: 7128 pages
% 7.91/2.42
%------------------------------------------------------------------------------