TSTP Solution File: SEU430+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU430+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:42:23 EDT 2022
% Result : Theorem 12.72s 5.36s
% Output : CNFRefutation 12.72s
% 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_3571,negated_conjecture,
( X1 = k1_xboole_0
| k5_setfam_1(esk579_0,esk580_0) = k1_xboole_0
| ~ r2_hidden(X1,esk580_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h5zrxc8s/lgb.p',i_0_3571) ).
cnf(i_0_5521,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk796_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h5zrxc8s/lgb.p',i_0_5521) ).
cnf(i_0_5522,plain,
( k3_tarski(X1) = k1_xboole_0
| esk796_1(X1) != k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h5zrxc8s/lgb.p',i_0_5522) ).
cnf(i_0_1762,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-h5zrxc8s/lgb.p',i_0_1762) ).
cnf(i_0_3574,negated_conjecture,
m1_subset_1(esk580_0,k1_zfmisc_1(k1_zfmisc_1(esk579_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h5zrxc8s/lgb.p',i_0_3574) ).
cnf(i_0_3573,negated_conjecture,
( r2_hidden(esk581_0,esk580_0)
| k5_setfam_1(esk579_0,esk580_0) != k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h5zrxc8s/lgb.p',i_0_3573) ).
cnf(i_0_3572,negated_conjecture,
( esk581_0 != k1_xboole_0
| k5_setfam_1(esk579_0,esk580_0) != k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h5zrxc8s/lgb.p',i_0_3572) ).
cnf(i_0_5523,plain,
( X1 = k1_xboole_0
| k3_tarski(X2) != k1_xboole_0
| ~ r2_hidden(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h5zrxc8s/lgb.p',i_0_5523) ).
cnf(c_0_5532,negated_conjecture,
( X1 = k1_xboole_0
| k5_setfam_1(esk579_0,esk580_0) = k1_xboole_0
| ~ r2_hidden(X1,esk580_0) ),
i_0_3571 ).
cnf(c_0_5533,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk796_1(X1),X1) ),
i_0_5521 ).
cnf(c_0_5534,plain,
( k3_tarski(X1) = k1_xboole_0
| esk796_1(X1) != k1_xboole_0 ),
i_0_5522 ).
cnf(c_0_5535,negated_conjecture,
( k5_setfam_1(esk579_0,esk580_0) = k1_xboole_0
| k3_tarski(esk580_0) = k1_xboole_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5532,c_0_5533]),c_0_5534]) ).
cnf(c_0_5536,plain,
( k5_setfam_1(X1,X2) = k3_tarski(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
i_0_1762 ).
cnf(c_0_5537,negated_conjecture,
m1_subset_1(esk580_0,k1_zfmisc_1(k1_zfmisc_1(esk579_0))),
i_0_3574 ).
cnf(c_0_5538,negated_conjecture,
( r2_hidden(esk581_0,esk580_0)
| k5_setfam_1(esk579_0,esk580_0) != k1_xboole_0 ),
i_0_3573 ).
cnf(c_0_5539,negated_conjecture,
k3_tarski(esk580_0) = k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5535,c_0_5536]),c_0_5537])]) ).
cnf(c_0_5540,negated_conjecture,
( esk581_0 != k1_xboole_0
| k5_setfam_1(esk579_0,esk580_0) != k1_xboole_0 ),
i_0_3572 ).
cnf(c_0_5541,plain,
( X1 = k1_xboole_0
| k3_tarski(X2) != k1_xboole_0
| ~ r2_hidden(X1,X2) ),
i_0_5523 ).
cnf(c_0_5542,negated_conjecture,
r2_hidden(esk581_0,esk580_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5538,c_0_5536]),c_0_5537])]),c_0_5539])]) ).
cnf(c_0_5543,negated_conjecture,
esk581_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_5540,c_0_5536]),c_0_5537])]),c_0_5539])]) ).
cnf(c_0_5544,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5541,c_0_5542]),c_0_5539])]),c_0_5543]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU430+3 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 08:52:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.90/1.16 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.90/1.16 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.90/1.16 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.90/1.16 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.72/5.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 12.72/5.36 # No SInE strategy applied
% 12.72/5.36 # Trying AutoSched0 for 149 seconds
% 12.72/5.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 12.72/5.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 12.72/5.36 #
% 12.72/5.36 # Preprocessing time : 0.048 s
% 12.72/5.36 # Presaturation interreduction done
% 12.72/5.36
% 12.72/5.36 # Proof found!
% 12.72/5.36 # SZS status Theorem
% 12.72/5.36 # SZS output start CNFRefutation
% See solution above
% 12.72/5.36 # Training examples: 0 positive, 0 negative
% 12.72/5.36
% 12.72/5.36 # -------------------------------------------------
% 12.72/5.36 # User time : 0.313 s
% 12.72/5.36 # System time : 0.013 s
% 12.72/5.36 # Total time : 0.326 s
% 12.72/5.36 # Maximum resident set size: 7128 pages
% 12.72/5.36
%------------------------------------------------------------------------------