TSTP Solution File: SEU430+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU430+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:23 EDT 2022
% Result : Theorem 12.43s 4.04s
% Output : CNFRefutation 12.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 6 unt; 5 nHn; 19 RR)
% Number of literals : 40 ( 26 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2322,negated_conjecture,
( X1 = k1_xboole_0
| k5_setfam_1(esk361_0,esk362_0) = k1_xboole_0
| ~ r2_hidden(X1,esk362_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obz3cg_3/lgb.p',i_0_2322) ).
cnf(i_0_3713,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk509_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obz3cg_3/lgb.p',i_0_3713) ).
cnf(i_0_3714,plain,
( k3_tarski(X1) = k1_xboole_0
| esk509_1(X1) != k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obz3cg_3/lgb.p',i_0_3714) ).
cnf(i_0_1128,plain,
( k5_setfam_1(X1,X2) = k3_tarski(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obz3cg_3/lgb.p',i_0_1128) ).
cnf(i_0_2325,negated_conjecture,
m1_subset_1(esk362_0,k1_zfmisc_1(k1_zfmisc_1(esk361_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obz3cg_3/lgb.p',i_0_2325) ).
cnf(i_0_2324,negated_conjecture,
( r2_hidden(esk363_0,esk362_0)
| k5_setfam_1(esk361_0,esk362_0) != k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obz3cg_3/lgb.p',i_0_2324) ).
cnf(i_0_2323,negated_conjecture,
( esk363_0 != k1_xboole_0
| k5_setfam_1(esk361_0,esk362_0) != k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obz3cg_3/lgb.p',i_0_2323) ).
cnf(i_0_3715,plain,
( X1 = k1_xboole_0
| k3_tarski(X2) != k1_xboole_0
| ~ r2_hidden(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-obz3cg_3/lgb.p',i_0_3715) ).
cnf(c_0_3724,negated_conjecture,
( X1 = k1_xboole_0
| k5_setfam_1(esk361_0,esk362_0) = k1_xboole_0
| ~ r2_hidden(X1,esk362_0) ),
i_0_2322 ).
cnf(c_0_3725,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk509_1(X1),X1) ),
i_0_3713 ).
cnf(c_0_3726,plain,
( k3_tarski(X1) = k1_xboole_0
| esk509_1(X1) != k1_xboole_0 ),
i_0_3714 ).
cnf(c_0_3727,negated_conjecture,
( k5_setfam_1(esk361_0,esk362_0) = k1_xboole_0
| k3_tarski(esk362_0) = k1_xboole_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3724,c_0_3725]),c_0_3726]) ).
cnf(c_0_3728,plain,
( k5_setfam_1(X1,X2) = k3_tarski(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
i_0_1128 ).
cnf(c_0_3729,negated_conjecture,
m1_subset_1(esk362_0,k1_zfmisc_1(k1_zfmisc_1(esk361_0))),
i_0_2325 ).
cnf(c_0_3730,negated_conjecture,
( r2_hidden(esk363_0,esk362_0)
| k5_setfam_1(esk361_0,esk362_0) != k1_xboole_0 ),
i_0_2324 ).
cnf(c_0_3731,negated_conjecture,
k3_tarski(esk362_0) = k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3727,c_0_3728]),c_0_3729])]) ).
cnf(c_0_3732,negated_conjecture,
( esk363_0 != k1_xboole_0
| k5_setfam_1(esk361_0,esk362_0) != k1_xboole_0 ),
i_0_2323 ).
cnf(c_0_3733,plain,
( X1 = k1_xboole_0
| k3_tarski(X2) != k1_xboole_0
| ~ r2_hidden(X1,X2) ),
i_0_3715 ).
cnf(c_0_3734,negated_conjecture,
r2_hidden(esk363_0,esk362_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3730,c_0_3728]),c_0_3729])]),c_0_3731])]) ).
cnf(c_0_3735,negated_conjecture,
esk363_0 != k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3732,c_0_3728]),c_0_3729])]),c_0_3731])]) ).
cnf(c_0_3736,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3733,c_0_3734]),c_0_3731])]),c_0_3735]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU430+2 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 16:27:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.46/0.63 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.63 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.46/0.63 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.46/0.63 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.43/4.04 # ENIGMATIC: Solved by autoschedule-lgb:
% 12.43/4.04 # No SInE strategy applied
% 12.43/4.04 # Trying AutoSched0 for 150 seconds
% 12.43/4.04 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 12.43/4.04 # and selection function SelectComplexExceptUniqMaxHorn.
% 12.43/4.04 #
% 12.43/4.04 # Preprocessing time : 0.041 s
% 12.43/4.04 # Presaturation interreduction done
% 12.43/4.04
% 12.43/4.04 # Proof found!
% 12.43/4.04 # SZS status Theorem
% 12.43/4.04 # SZS output start CNFRefutation
% See solution above
% 12.43/4.04 # Training examples: 0 positive, 0 negative
% 12.43/4.04
% 12.43/4.04 # -------------------------------------------------
% 12.43/4.04 # User time : 0.296 s
% 12.43/4.04 # System time : 0.015 s
% 12.43/4.04 # Total time : 0.311 s
% 12.43/4.04 # Maximum resident set size: 7128 pages
% 12.43/4.04
%------------------------------------------------------------------------------