TSTP Solution File: SEU408+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU408+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:41:59 EDT 2022
% Result : Theorem 13.82s 4.38s
% Output : CNFRefutation 13.82s
% 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_565,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-in13jenn/lgb.p',i_0_565) ).
cnf(i_0_1853,negated_conjecture,
r2_hidden(esk270_0,u1_struct_0(esk269_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-in13jenn/lgb.p',i_0_1853) ).
cnf(i_0_528,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-in13jenn/lgb.p',i_0_528) ).
cnf(i_0_846,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-in13jenn/lgb.p',i_0_846) ).
cnf(i_0_847,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-in13jenn/lgb.p',i_0_847) ).
cnf(i_0_1854,negated_conjecture,
l1_orders_2(esk269_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-in13jenn/lgb.p',i_0_1854) ).
cnf(i_0_2495,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-in13jenn/lgb.p',i_0_2495) ).
cnf(i_0_1852,negated_conjecture,
~ m1_subset_1(esk270_0,u1_struct_0(k1_latsum_1(esk268_0,esk269_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-in13jenn/lgb.p',i_0_1852) ).
cnf(i_0_1860,negated_conjecture,
l1_orders_2(esk268_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-in13jenn/lgb.p',i_0_1860) ).
cnf(c_0_2505,plain,
( r2_hidden(X1,X2)
| X2 != k3_tarski(k2_relat_1(k10_finseq_1(X3,X4)))
| ~ r2_hidden(X1,X4) ),
i_0_565 ).
cnf(c_0_2506,plain,
( r2_hidden(X1,k3_tarski(k2_relat_1(k10_finseq_1(X2,X3))))
| ~ r2_hidden(X1,X3) ),
inference(er,[status(thm)],[c_0_2505]) ).
cnf(c_0_2507,negated_conjecture,
r2_hidden(esk270_0,u1_struct_0(esk269_0)),
i_0_1853 ).
cnf(c_0_2508,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_528 ).
cnf(c_0_2509,plain,
( l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
i_0_846 ).
cnf(c_0_2510,plain,
( v1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
i_0_847 ).
cnf(c_0_2511,negated_conjecture,
r2_hidden(esk270_0,k3_tarski(k2_relat_1(k10_finseq_1(X1,u1_struct_0(esk269_0))))),
inference(spm,[status(thm)],[c_0_2506,c_0_2507]) ).
cnf(c_0_2512,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_2508]),c_0_2509]),c_0_2510]) ).
cnf(c_0_2513,negated_conjecture,
l1_orders_2(esk269_0),
i_0_1854 ).
cnf(c_0_2514,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
i_0_2495 ).
cnf(c_0_2515,plain,
( r2_hidden(esk270_0,u1_struct_0(k1_latsum_1(X1,esk269_0)))
| ~ l1_orders_2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2511,c_0_2512]),c_0_2513])]) ).
cnf(c_0_2516,negated_conjecture,
~ m1_subset_1(esk270_0,u1_struct_0(k1_latsum_1(esk268_0,esk269_0))),
i_0_1852 ).
cnf(c_0_2517,plain,
( m1_subset_1(esk270_0,u1_struct_0(k1_latsum_1(X1,esk269_0)))
| ~ l1_orders_2(X1) ),
inference(spm,[status(thm)],[c_0_2514,c_0_2515]) ).
cnf(c_0_2518,negated_conjecture,
l1_orders_2(esk268_0),
i_0_1860 ).
cnf(c_0_2519,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2516,c_0_2517]),c_0_2518])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU408+2 : TPTP v8.1.0. Released v3.4.0.
% 0.14/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 20 09:29:39 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.44/0.64 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.44/0.64 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.44/0.64 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.44/0.64 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.82/4.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.82/4.38 # No SInE strategy applied
% 13.82/4.38 # Trying AutoSched0 for 150 seconds
% 13.82/4.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 13.82/4.38 # and selection function SelectCQIPrecWNTNp.
% 13.82/4.38 #
% 13.82/4.38 # Preprocessing time : 0.032 s
% 13.82/4.38 # Presaturation interreduction done
% 13.82/4.38
% 13.82/4.38 # Proof found!
% 13.82/4.38 # SZS status Theorem
% 13.82/4.38 # SZS output start CNFRefutation
% See solution above
% 13.82/4.38 # Training examples: 0 positive, 0 negative
% 13.82/4.38
% 13.82/4.38 # -------------------------------------------------
% 13.82/4.38 # User time : 0.465 s
% 13.82/4.38 # System time : 0.023 s
% 13.82/4.38 # Total time : 0.487 s
% 13.82/4.38 # Maximum resident set size: 7124 pages
% 13.82/4.38
%------------------------------------------------------------------------------