TSTP Solution File: SEU408+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU408+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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 : Tue Jul 19 08:42:00 EDT 2022
% Result : Theorem 17.92s 5.65s
% Output : CNFRefutation 17.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 10 unt; 0 nHn; 22 RR)
% Number of literals : 53 ( 7 equ; 31 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_710,plain,
( r2_hidden(X1,X2)
| X2 != k3_tarski(k2_relat_1(k10_finseq_1(X3,X4)))
| ~ r2_hidden(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w_kos2ep/lgb.p',i_0_710) ).
cnf(i_0_2606,negated_conjecture,
r2_hidden(esk357_0,u1_struct_0(esk356_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w_kos2ep/lgb.p',i_0_2606) ).
cnf(i_0_667,plain,
( u1_struct_0(X1) = k3_tarski(k2_relat_1(k10_finseq_1(u1_struct_0(X2),u1_struct_0(X3))))
| X1 != k1_latsum_1(X2,X3)
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| ~ v1_orders_2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w_kos2ep/lgb.p',i_0_667) ).
cnf(i_0_1012,plain,
( l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w_kos2ep/lgb.p',i_0_1012) ).
cnf(i_0_1013,plain,
( v1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w_kos2ep/lgb.p',i_0_1013) ).
cnf(i_0_2607,negated_conjecture,
l1_orders_2(esk356_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w_kos2ep/lgb.p',i_0_2607) ).
cnf(i_0_3371,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w_kos2ep/lgb.p',i_0_3371) ).
cnf(i_0_2605,negated_conjecture,
~ m1_subset_1(esk357_0,u1_struct_0(k1_latsum_1(esk355_0,esk356_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w_kos2ep/lgb.p',i_0_2605) ).
cnf(i_0_2613,negated_conjecture,
l1_orders_2(esk355_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w_kos2ep/lgb.p',i_0_2613) ).
cnf(c_0_3381,plain,
( r2_hidden(X1,X2)
| X2 != k3_tarski(k2_relat_1(k10_finseq_1(X3,X4)))
| ~ r2_hidden(X1,X4) ),
i_0_710 ).
cnf(c_0_3382,plain,
( r2_hidden(X1,k3_tarski(k2_relat_1(k10_finseq_1(X2,X3))))
| ~ r2_hidden(X1,X3) ),
inference(er,[status(thm)],[c_0_3381]) ).
cnf(c_0_3383,negated_conjecture,
r2_hidden(esk357_0,u1_struct_0(esk356_0)),
i_0_2606 ).
cnf(c_0_3384,plain,
( u1_struct_0(X1) = k3_tarski(k2_relat_1(k10_finseq_1(u1_struct_0(X2),u1_struct_0(X3))))
| X1 != k1_latsum_1(X2,X3)
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| ~ v1_orders_2(X1) ),
i_0_667 ).
cnf(c_0_3385,plain,
( l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
i_0_1012 ).
cnf(c_0_3386,plain,
( v1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
i_0_1013 ).
cnf(c_0_3387,negated_conjecture,
r2_hidden(esk357_0,k3_tarski(k2_relat_1(k10_finseq_1(X1,u1_struct_0(esk356_0))))),
inference(spm,[status(thm)],[c_0_3382,c_0_3383]) ).
cnf(c_0_3388,plain,
( k3_tarski(k2_relat_1(k10_finseq_1(u1_struct_0(X1),u1_struct_0(X2)))) = u1_struct_0(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_3384]),c_0_3385]),c_0_3386]) ).
cnf(c_0_3389,negated_conjecture,
l1_orders_2(esk356_0),
i_0_2607 ).
cnf(c_0_3390,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
i_0_3371 ).
cnf(c_0_3391,plain,
( r2_hidden(esk357_0,u1_struct_0(k1_latsum_1(X1,esk356_0)))
| ~ l1_orders_2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3387,c_0_3388]),c_0_3389])]) ).
cnf(c_0_3392,negated_conjecture,
~ m1_subset_1(esk357_0,u1_struct_0(k1_latsum_1(esk355_0,esk356_0))),
i_0_2605 ).
cnf(c_0_3393,plain,
( m1_subset_1(esk357_0,u1_struct_0(k1_latsum_1(X1,esk356_0)))
| ~ l1_orders_2(X1) ),
inference(spm,[status(thm)],[c_0_3390,c_0_3391]) ).
cnf(c_0_3394,negated_conjecture,
l1_orders_2(esk355_0),
i_0_2613 ).
cnf(c_0_3395,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3392,c_0_3393]),c_0_3394])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU408+3 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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 : Sun Jun 19 10:13:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.90/1.12 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.90/1.12 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.90/1.12 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.90/1.12 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 17.92/5.65 # ENIGMATIC: Solved by autoschedule-lgb:
% 17.92/5.65 # No SInE strategy applied
% 17.92/5.65 # Trying AutoSched0 for 149 seconds
% 17.92/5.65 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 17.92/5.65 # and selection function SelectCQIPrecWNTNp.
% 17.92/5.65 #
% 17.92/5.65 # Preprocessing time : 0.033 s
% 17.92/5.65 # Presaturation interreduction done
% 17.92/5.65
% 17.92/5.65 # Proof found!
% 17.92/5.65 # SZS status Theorem
% 17.92/5.65 # SZS output start CNFRefutation
% See solution above
% 17.92/5.65 # Training examples: 0 positive, 0 negative
% 17.92/5.65
% 17.92/5.65 # -------------------------------------------------
% 17.92/5.65 # User time : 1.005 s
% 17.92/5.65 # System time : 0.044 s
% 17.92/5.65 # Total time : 1.049 s
% 17.92/5.65 # Maximum resident set size: 7124 pages
% 17.92/5.65
%------------------------------------------------------------------------------