TSTP Solution File: SEU408+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU408+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 16.40s 7.10s
% Output : CNFRefutation 16.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 48 ( 18 unt; 4 nHn; 41 RR)
% Number of literals : 98 ( 15 equ; 59 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 84 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_851,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X2 != k4_xboole_0(X4,X3)
| ~ r2_hidden(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_851) ).
cnf(i_0_3035,negated_conjecture,
r2_hidden(esk369_0,u1_struct_0(esk368_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_3035) ).
cnf(i_0_666,plain,
( X1 != k1_xboole_0
| ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_666) ).
cnf(i_0_936,plain,
( k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k1_xboole_0
| ~ r1_xboole_0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_936) ).
cnf(i_0_2857,plain,
( r1_xboole_0(X1,X2)
| ~ r1_xboole_0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_2857) ).
cnf(i_0_6328,plain,
r1_xboole_0(k4_xboole_0(X1,X2),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_6328) ).
cnf(i_0_852,plain,
( X1 != k4_xboole_0(X2,X3)
| ~ r2_hidden(X4,X1)
| ~ r2_hidden(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_852) ).
cnf(i_0_6438,plain,
( k4_xboole_0(k3_tarski(k2_tarski(X1,X2)),X2) = X1
| ~ r1_xboole_0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_6438) ).
cnf(i_0_6213,plain,
( r1_xboole_0(X1,X2)
| ~ r1_xboole_0(X1,k3_tarski(k2_tarski(X3,X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_6213) ).
cnf(i_0_710,plain,
( u1_struct_0(X1) = k3_tarski(k2_tarski(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/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_710) ).
cnf(i_0_980,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-6ugvmj_e/lgb.p',i_0_980) ).
cnf(i_0_981,plain,
( v1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_981) ).
cnf(i_0_3036,negated_conjecture,
l1_orders_2(esk368_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_3036) ).
cnf(i_0_3034,negated_conjecture,
~ m1_subset_1(esk369_0,u1_struct_0(k1_latsum_1(esk367_0,esk368_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_3034) ).
cnf(i_0_3853,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_3853) ).
cnf(i_0_3042,negated_conjecture,
l1_orders_2(esk367_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6ugvmj_e/lgb.p',i_0_3042) ).
cnf(c_0_6455,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X2 != k4_xboole_0(X4,X3)
| ~ r2_hidden(X1,X4) ),
i_0_851 ).
cnf(c_0_6456,plain,
( r2_hidden(X1,k4_xboole_0(X2,X3))
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,X2) ),
inference(er,[status(thm)],[c_0_6455]) ).
cnf(c_0_6457,negated_conjecture,
r2_hidden(esk369_0,u1_struct_0(esk368_0)),
i_0_3035 ).
cnf(c_0_6458,plain,
( X1 != k1_xboole_0
| ~ r2_hidden(X2,X1) ),
i_0_666 ).
cnf(c_0_6459,negated_conjecture,
( r2_hidden(esk369_0,k4_xboole_0(u1_struct_0(esk368_0),X1))
| r2_hidden(esk369_0,X1) ),
inference(spm,[status(thm)],[c_0_6456,c_0_6457]) ).
cnf(c_0_6460,plain,
( k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k1_xboole_0
| ~ r1_xboole_0(X1,X2) ),
i_0_936 ).
cnf(c_0_6461,plain,
~ r2_hidden(X1,k1_xboole_0),
inference(er,[status(thm)],[c_0_6458]) ).
cnf(c_0_6462,plain,
( r1_xboole_0(X1,X2)
| ~ r1_xboole_0(X2,X1) ),
i_0_2857 ).
cnf(c_0_6463,plain,
r1_xboole_0(k4_xboole_0(X1,X2),X2),
i_0_6328 ).
cnf(c_0_6464,plain,
( X1 != k4_xboole_0(X2,X3)
| ~ r2_hidden(X4,X1)
| ~ r2_hidden(X4,X3) ),
i_0_852 ).
cnf(c_0_6465,plain,
( r2_hidden(esk369_0,k4_xboole_0(u1_struct_0(esk368_0),X1))
| ~ r1_xboole_0(u1_struct_0(esk368_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6459,c_0_6460]),c_0_6461]) ).
cnf(c_0_6466,plain,
r1_xboole_0(X1,k4_xboole_0(X2,X1)),
inference(spm,[status(thm)],[c_0_6462,c_0_6463]) ).
cnf(c_0_6467,plain,
( ~ r2_hidden(X1,k4_xboole_0(X2,X3))
| ~ r2_hidden(X1,X3) ),
inference(er,[status(thm)],[c_0_6464]) ).
cnf(c_0_6468,plain,
r2_hidden(esk369_0,k4_xboole_0(u1_struct_0(esk368_0),k4_xboole_0(X1,u1_struct_0(esk368_0)))),
inference(spm,[status(thm)],[c_0_6465,c_0_6466]) ).
cnf(c_0_6469,plain,
~ r2_hidden(esk369_0,k4_xboole_0(X1,u1_struct_0(esk368_0))),
inference(spm,[status(thm)],[c_0_6467,c_0_6468]) ).
cnf(c_0_6470,plain,
( k4_xboole_0(k3_tarski(k2_tarski(X1,X2)),X2) = X1
| ~ r1_xboole_0(X1,X2) ),
i_0_6438 ).
cnf(c_0_6471,plain,
( r1_xboole_0(X1,X2)
| ~ r1_xboole_0(X1,k3_tarski(k2_tarski(X3,X2))) ),
i_0_6213 ).
cnf(c_0_6472,plain,
( ~ r1_xboole_0(X1,u1_struct_0(esk368_0))
| ~ r2_hidden(esk369_0,X1) ),
inference(spm,[status(thm)],[c_0_6469,c_0_6470]) ).
cnf(c_0_6473,plain,
r1_xboole_0(k4_xboole_0(X1,k3_tarski(k2_tarski(X2,X3))),X3),
inference(spm,[status(thm)],[c_0_6471,c_0_6463]) ).
cnf(c_0_6474,plain,
( u1_struct_0(X1) = k3_tarski(k2_tarski(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_710 ).
cnf(c_0_6475,plain,
( l1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
i_0_980 ).
cnf(c_0_6476,plain,
( v1_orders_2(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
i_0_981 ).
cnf(c_0_6477,plain,
~ r2_hidden(esk369_0,k4_xboole_0(X1,k3_tarski(k2_tarski(X2,u1_struct_0(esk368_0))))),
inference(spm,[status(thm)],[c_0_6472,c_0_6473]) ).
cnf(c_0_6478,plain,
( k3_tarski(k2_tarski(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_6474]),c_0_6475]),c_0_6476]) ).
cnf(c_0_6479,negated_conjecture,
l1_orders_2(esk368_0),
i_0_3036 ).
cnf(c_0_6480,negated_conjecture,
~ m1_subset_1(esk369_0,u1_struct_0(k1_latsum_1(esk367_0,esk368_0))),
i_0_3034 ).
cnf(c_0_6481,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
i_0_3853 ).
cnf(c_0_6482,plain,
( ~ l1_orders_2(X1)
| ~ r2_hidden(esk369_0,k4_xboole_0(X2,u1_struct_0(k1_latsum_1(X1,esk368_0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6477,c_0_6478]),c_0_6479])]) ).
cnf(c_0_6483,negated_conjecture,
~ r2_hidden(esk369_0,u1_struct_0(k1_latsum_1(esk367_0,esk368_0))),
inference(spm,[status(thm)],[c_0_6480,c_0_6481]) ).
cnf(c_0_6484,negated_conjecture,
( r2_hidden(esk369_0,u1_struct_0(k1_latsum_1(X1,esk368_0)))
| ~ l1_orders_2(X1) ),
inference(spm,[status(thm)],[c_0_6482,c_0_6459]) ).
cnf(c_0_6485,negated_conjecture,
l1_orders_2(esk367_0),
i_0_3042 ).
cnf(c_0_6486,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6483,c_0_6484]),c_0_6485])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU408+4 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 18 21:05:58 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 2.64/2.86 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/2.86 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 2.64/2.86 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 2.64/2.86 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 16.40/7.10 # ENIGMATIC: Solved by autoschedule-lgb:
% 16.40/7.10 # No SInE strategy applied
% 16.40/7.10 # Trying AutoSched0 for 148 seconds
% 16.40/7.10 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 16.40/7.10 # and selection function SelectComplexExceptUniqMaxHorn.
% 16.40/7.10 #
% 16.40/7.10 # Preprocessing time : 0.034 s
% 16.40/7.10 # Presaturation interreduction done
% 16.40/7.10
% 16.40/7.10 # Proof found!
% 16.40/7.10 # SZS status Theorem
% 16.40/7.10 # SZS output start CNFRefutation
% See solution above
% 16.40/7.10 # Training examples: 0 positive, 0 negative
% 16.40/7.10
% 16.40/7.10 # -------------------------------------------------
% 16.40/7.10 # User time : 0.364 s
% 16.40/7.10 # System time : 0.019 s
% 16.40/7.10 # Total time : 0.383 s
% 16.40/7.10 # Maximum resident set size: 7120 pages
% 16.40/7.10
%------------------------------------------------------------------------------