TSTP Solution File: SEU406+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU406+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:57 EDT 2022
% Result : Theorem 17.86s 5.53s
% Output : CNFRefutation 17.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 10 unt; 8 nHn; 25 RR)
% Number of literals : 52 ( 4 equ; 29 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_729,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X4 != k3_tarski(k1_enumset1(X3,X3,X2))
| ~ r2_hidden(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7wmtue_/lgb.p',i_0_729) ).
cnf(i_0_853,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X2 != k5_xboole_0(X4,k1_setfam_1(k1_enumset1(X4,X4,X3)))
| ~ r2_hidden(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7wmtue_/lgb.p',i_0_853) ).
cnf(i_0_3257,negated_conjecture,
r2_hidden(esk467_0,k3_tarski(k1_enumset1(esk469_0,esk469_0,esk470_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7wmtue_/lgb.p',i_0_3257) ).
cnf(i_0_3256,negated_conjecture,
r2_hidden(esk468_0,k3_tarski(k1_enumset1(esk469_0,esk469_0,esk470_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7wmtue_/lgb.p',i_0_3256) ).
cnf(i_0_3253,negated_conjecture,
( ~ r2_hidden(esk468_0,esk470_0)
| ~ r2_hidden(esk467_0,k5_xboole_0(esk469_0,k1_setfam_1(k1_enumset1(esk469_0,esk469_0,esk470_0)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7wmtue_/lgb.p',i_0_3253) ).
cnf(i_0_3254,negated_conjecture,
( ~ r2_hidden(esk467_0,esk470_0)
| ~ r2_hidden(esk468_0,esk470_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7wmtue_/lgb.p',i_0_3254) ).
cnf(i_0_3252,negated_conjecture,
( ~ r2_hidden(esk467_0,esk470_0)
| ~ r2_hidden(esk468_0,k5_xboole_0(esk469_0,k1_setfam_1(k1_enumset1(esk469_0,esk469_0,esk470_0)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7wmtue_/lgb.p',i_0_3252) ).
cnf(i_0_3255,negated_conjecture,
( ~ r2_hidden(esk467_0,k5_xboole_0(esk469_0,k1_setfam_1(k1_enumset1(esk469_0,esk469_0,esk470_0))))
| ~ r2_hidden(esk468_0,k5_xboole_0(esk469_0,k1_setfam_1(k1_enumset1(esk469_0,esk469_0,esk470_0)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7wmtue_/lgb.p',i_0_3255) ).
cnf(c_0_3266,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X4 != k3_tarski(k1_enumset1(X3,X3,X2))
| ~ r2_hidden(X1,X4) ),
i_0_729 ).
cnf(c_0_3267,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X2 != k5_xboole_0(X4,k1_setfam_1(k1_enumset1(X4,X4,X3)))
| ~ r2_hidden(X1,X4) ),
i_0_853 ).
cnf(c_0_3268,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k3_tarski(k1_enumset1(X2,X2,X3))) ),
inference(er,[status(thm)],[c_0_3266]) ).
cnf(c_0_3269,negated_conjecture,
r2_hidden(esk467_0,k3_tarski(k1_enumset1(esk469_0,esk469_0,esk470_0))),
i_0_3257 ).
cnf(c_0_3270,negated_conjecture,
r2_hidden(esk468_0,k3_tarski(k1_enumset1(esk469_0,esk469_0,esk470_0))),
i_0_3256 ).
cnf(c_0_3271,negated_conjecture,
( ~ r2_hidden(esk468_0,esk470_0)
| ~ r2_hidden(esk467_0,k5_xboole_0(esk469_0,k1_setfam_1(k1_enumset1(esk469_0,esk469_0,esk470_0)))) ),
i_0_3253 ).
cnf(c_0_3272,plain,
( r2_hidden(X1,k5_xboole_0(X2,k1_setfam_1(k1_enumset1(X2,X2,X3))))
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,X2) ),
inference(er,[status(thm)],[c_0_3267]) ).
cnf(c_0_3273,negated_conjecture,
( r2_hidden(esk467_0,esk470_0)
| r2_hidden(esk467_0,esk469_0) ),
inference(spm,[status(thm)],[c_0_3268,c_0_3269]) ).
cnf(c_0_3274,negated_conjecture,
( ~ r2_hidden(esk467_0,esk470_0)
| ~ r2_hidden(esk468_0,esk470_0) ),
i_0_3254 ).
cnf(c_0_3275,negated_conjecture,
( r2_hidden(esk468_0,esk470_0)
| r2_hidden(esk468_0,esk469_0) ),
inference(spm,[status(thm)],[c_0_3268,c_0_3270]) ).
cnf(c_0_3276,negated_conjecture,
~ r2_hidden(esk468_0,esk470_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3271,c_0_3272]),c_0_3273]),c_0_3274]) ).
cnf(c_0_3277,negated_conjecture,
( ~ r2_hidden(esk467_0,esk470_0)
| ~ r2_hidden(esk468_0,k5_xboole_0(esk469_0,k1_setfam_1(k1_enumset1(esk469_0,esk469_0,esk470_0)))) ),
i_0_3252 ).
cnf(c_0_3278,negated_conjecture,
r2_hidden(esk468_0,esk469_0),
inference(sr,[status(thm)],[c_0_3275,c_0_3276]) ).
cnf(c_0_3279,negated_conjecture,
~ r2_hidden(esk467_0,esk470_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3277,c_0_3272]),c_0_3278])]),c_0_3276]) ).
cnf(c_0_3280,negated_conjecture,
( ~ r2_hidden(esk467_0,k5_xboole_0(esk469_0,k1_setfam_1(k1_enumset1(esk469_0,esk469_0,esk470_0))))
| ~ r2_hidden(esk468_0,k5_xboole_0(esk469_0,k1_setfam_1(k1_enumset1(esk469_0,esk469_0,esk470_0)))) ),
i_0_3255 ).
cnf(c_0_3281,negated_conjecture,
r2_hidden(esk467_0,esk469_0),
inference(sr,[status(thm)],[c_0_3273,c_0_3279]) ).
cnf(c_0_3282,negated_conjecture,
~ r2_hidden(esk468_0,k5_xboole_0(esk469_0,k1_setfam_1(k1_enumset1(esk469_0,esk469_0,esk470_0)))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3280,c_0_3272]),c_0_3281])]),c_0_3279]) ).
cnf(c_0_3283,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3282,c_0_3272]),c_0_3278])]),c_0_3276]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU406+3 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jun 19 03:09:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected SinE mode:
% 0.89/1.10 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.89/1.10 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.89/1.10 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.89/1.10 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 17.86/5.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 17.86/5.53 # No SInE strategy applied
% 17.86/5.53 # Trying AutoSched0 for 149 seconds
% 17.86/5.53 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_S0Y
% 17.86/5.53 # and selection function SelectMaxLComplexAvoidPosPred.
% 17.86/5.53 #
% 17.86/5.53 # Preprocessing time : 0.029 s
% 17.86/5.53
% 17.86/5.53 # Proof found!
% 17.86/5.53 # SZS status Theorem
% 17.86/5.53 # SZS output start CNFRefutation
% See solution above
% 17.86/5.53 # Training examples: 0 positive, 0 negative
% 17.86/5.53
% 17.86/5.53 # -------------------------------------------------
% 17.86/5.53 # User time : 0.810 s
% 17.86/5.53 # System time : 0.029 s
% 17.86/5.53 # Total time : 0.839 s
% 17.86/5.53 # Maximum resident set size: 7124 pages
% 17.86/5.53
%------------------------------------------------------------------------------