TSTP Solution File: SEU413+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU413+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:04 EDT 2022
% Result : Theorem 8.59s 2.46s
% Output : CNFRefutation 8.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 29 ( 20 unt; 0 nHn; 29 RR)
% Number of literals : 57 ( 0 equ; 30 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_47,plain,
( r2_hidden(X1,u1_struct_0(X2))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X2)
| ~ r2_hidden(X4,u1_struct_0(X2))
| ~ v12_waybel_0(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X3)),X3)
| ~ r2_hidden(k4_tarski(X1,X4),u1_orders_2(k1_latsum_1(X2,X3)))
| ~ m1_subset_1(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X3)),k1_zfmisc_1(u1_struct_0(X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_47) ).
cnf(i_0_4,negated_conjecture,
m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_4) ).
cnf(i_0_8,negated_conjecture,
l1_orders_2(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_8) ).
cnf(i_0_9,negated_conjecture,
l1_orders_2(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_9) ).
cnf(i_0_5,negated_conjecture,
v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_5) ).
cnf(i_0_15,plain,
( r2_hidden(k4_tarski(X1,X2),u1_orders_2(X3))
| ~ l1_orders_2(X3)
| ~ r1_orders_2(X3,X1,X2)
| ~ m1_subset_1(X2,u1_struct_0(X3))
| ~ m1_subset_1(X1,u1_struct_0(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_15) ).
cnf(i_0_3,negated_conjecture,
r1_orders_2(k1_latsum_1(esk1_0,esk2_0),esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
m1_subset_1(esk4_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_6) ).
cnf(i_0_7,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_7) ).
cnf(i_0_2,negated_conjecture,
r2_hidden(esk4_0,u1_struct_0(esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_2) ).
cnf(i_0_18,plain,
( l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_18) ).
cnf(i_0_1,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zx7vj4fs/lgb.p',i_0_1) ).
cnf(c_0_60,plain,
( r2_hidden(X1,u1_struct_0(X2))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X2)
| ~ r2_hidden(X4,u1_struct_0(X2))
| ~ v12_waybel_0(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X3)),X3)
| ~ r2_hidden(k4_tarski(X1,X4),u1_orders_2(k1_latsum_1(X2,X3)))
| ~ m1_subset_1(k3_xboole_0(u1_struct_0(X2),u1_struct_0(X3)),k1_zfmisc_1(u1_struct_0(X3))) ),
i_0_47 ).
cnf(c_0_61,negated_conjecture,
m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))),
i_0_4 ).
cnf(c_0_62,negated_conjecture,
l1_orders_2(esk2_0),
i_0_8 ).
cnf(c_0_63,negated_conjecture,
l1_orders_2(esk1_0),
i_0_9 ).
cnf(c_0_64,negated_conjecture,
v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0),
i_0_5 ).
cnf(c_0_65,plain,
( r2_hidden(k4_tarski(X1,X2),u1_orders_2(X3))
| ~ l1_orders_2(X3)
| ~ r1_orders_2(X3,X1,X2)
| ~ m1_subset_1(X2,u1_struct_0(X3))
| ~ m1_subset_1(X1,u1_struct_0(X3)) ),
i_0_15 ).
cnf(c_0_66,negated_conjecture,
r1_orders_2(k1_latsum_1(esk1_0,esk2_0),esk3_0,esk4_0),
i_0_3 ).
cnf(c_0_67,negated_conjecture,
m1_subset_1(esk4_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
i_0_6 ).
cnf(c_0_68,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
i_0_7 ).
cnf(c_0_69,negated_conjecture,
( r2_hidden(X1,u1_struct_0(esk1_0))
| ~ r2_hidden(k4_tarski(X1,X2),u1_orders_2(k1_latsum_1(esk1_0,esk2_0)))
| ~ r2_hidden(X2,u1_struct_0(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_63]),c_0_64])]) ).
cnf(c_0_70,negated_conjecture,
r2_hidden(esk4_0,u1_struct_0(esk1_0)),
i_0_2 ).
cnf(c_0_71,negated_conjecture,
( r2_hidden(k4_tarski(esk3_0,esk4_0),u1_orders_2(k1_latsum_1(esk1_0,esk2_0)))
| ~ l1_orders_2(k1_latsum_1(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_68])]) ).
cnf(c_0_72,plain,
( l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
i_0_18 ).
cnf(c_0_73,negated_conjecture,
( r2_hidden(X1,u1_struct_0(esk1_0))
| ~ r2_hidden(k4_tarski(X1,esk4_0),u1_orders_2(k1_latsum_1(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,plain,
r2_hidden(k4_tarski(esk3_0,esk4_0),u1_orders_2(k1_latsum_1(esk1_0,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_62]),c_0_63])]) ).
cnf(c_0_75,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(esk1_0)),
i_0_1 ).
cnf(c_0_76,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU413+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 20:51:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 8.59/2.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.59/2.46 # No SInE strategy applied
% 8.59/2.46 # Trying AutoSched0 for 150 seconds
% 8.59/2.46 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S2q
% 8.59/2.46 # and selection function SelectCQArNTNp.
% 8.59/2.46 #
% 8.59/2.46 # Preprocessing time : 0.024 s
% 8.59/2.46 # Presaturation interreduction done
% 8.59/2.46
% 8.59/2.46 # Proof found!
% 8.59/2.46 # SZS status Theorem
% 8.59/2.46 # SZS output start CNFRefutation
% See solution above
% 8.59/2.46 # Training examples: 0 positive, 0 negative
% 8.59/2.46
% 8.59/2.46 # -------------------------------------------------
% 8.59/2.46 # User time : 0.026 s
% 8.59/2.46 # System time : 0.007 s
% 8.59/2.46 # Total time : 0.033 s
% 8.59/2.46 # Maximum resident set size: 7124 pages
% 8.59/2.46
%------------------------------------------------------------------------------