TSTP Solution File: SEU422+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU422+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:14 EDT 2022
% Result : Theorem 39.43s 8.09s
% Output : CNFRefutation 39.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 42 ( 13 unt; 7 nHn; 36 RR)
% Number of literals : 85 ( 6 equ; 41 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3871,plain,
( r1_tarski(X1,X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_3871) ).
cnf(i_0_2674,negated_conjecture,
m1_subset_1(esk385_0,k1_zfmisc_1(esk384_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_2674) ).
cnf(i_0_532,plain,
( r2_hidden(X1,X2)
| X2 != k1_zfmisc_1(X3)
| ~ r1_tarski(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_532) ).
cnf(i_0_2958,plain,
( r1_tarski(X1,X2)
| ~ r1_tarski(X3,X2)
| ~ r1_tarski(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_2958) ).
cnf(i_0_533,plain,
( r1_tarski(X1,X2)
| X3 != k1_zfmisc_1(X2)
| ~ r2_hidden(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_533) ).
cnf(i_0_2061,plain,
r1_tarski(X1,k1_zfmisc_1(k3_tarski(X1))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_2061) ).
cnf(i_0_4233,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_4233) ).
cnf(i_0_3870,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_3870) ).
cnf(i_0_2580,plain,
( k3_tarski(a_2_0_relset_2(X1,X2)) = X2
| v1_xboole_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_2580) ).
cnf(i_0_640,plain,
( r1_tarski(X1,X2)
| r2_hidden(esk98_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_640) ).
cnf(i_0_2673,negated_conjecture,
~ m1_subset_1(a_2_0_relset_2(esk384_0,esk385_0),k1_zfmisc_1(k1_zfmisc_1(esk384_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_2673) ).
cnf(i_0_2675,negated_conjecture,
~ v1_xboole_0(esk384_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_2675) ).
cnf(i_0_639,plain,
( r1_tarski(X1,X2)
| ~ r2_hidden(esk98_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_639) ).
cnf(i_0_4923,plain,
( r1_tarski(k1_zfmisc_1(X1),k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9yst49_7/lgb.p',i_0_4923) ).
cnf(c_0_4938,plain,
( r1_tarski(X1,X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2)) ),
i_0_3871 ).
cnf(c_0_4939,negated_conjecture,
m1_subset_1(esk385_0,k1_zfmisc_1(esk384_0)),
i_0_2674 ).
cnf(c_0_4940,plain,
( r2_hidden(X1,X2)
| X2 != k1_zfmisc_1(X3)
| ~ r1_tarski(X1,X3) ),
i_0_532 ).
cnf(c_0_4941,plain,
( r1_tarski(X1,X2)
| ~ r1_tarski(X3,X2)
| ~ r1_tarski(X1,X3) ),
i_0_2958 ).
cnf(c_0_4942,negated_conjecture,
r1_tarski(esk385_0,esk384_0),
inference(spm,[status(thm)],[c_0_4938,c_0_4939]) ).
cnf(c_0_4943,plain,
( r1_tarski(X1,X2)
| X3 != k1_zfmisc_1(X2)
| ~ r2_hidden(X1,X3) ),
i_0_533 ).
cnf(c_0_4944,plain,
( r2_hidden(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(er,[status(thm)],[c_0_4940]) ).
cnf(c_0_4945,plain,
r1_tarski(X1,k1_zfmisc_1(k3_tarski(X1))),
i_0_2061 ).
cnf(c_0_4946,negated_conjecture,
( r1_tarski(X1,esk384_0)
| ~ r1_tarski(X1,esk385_0) ),
inference(spm,[status(thm)],[c_0_4941,c_0_4942]) ).
cnf(c_0_4947,plain,
( r1_tarski(X1,X2)
| ~ r2_hidden(X1,k1_zfmisc_1(X2)) ),
inference(er,[status(thm)],[c_0_4943]) ).
cnf(c_0_4948,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X3)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
i_0_4233 ).
cnf(c_0_4949,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
i_0_3870 ).
cnf(c_0_4950,plain,
r2_hidden(X1,k1_zfmisc_1(k1_zfmisc_1(k3_tarski(X1)))),
inference(spm,[status(thm)],[c_0_4944,c_0_4945]) ).
cnf(c_0_4951,plain,
( k3_tarski(a_2_0_relset_2(X1,X2)) = X2
| v1_xboole_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
i_0_2580 ).
cnf(c_0_4952,plain,
( r1_tarski(X1,esk384_0)
| ~ r2_hidden(X1,k1_zfmisc_1(esk385_0)) ),
inference(spm,[status(thm)],[c_0_4946,c_0_4947]) ).
cnf(c_0_4953,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X3)
| ~ r1_tarski(X3,X2) ),
inference(spm,[status(thm)],[c_0_4948,c_0_4949]) ).
cnf(c_0_4954,plain,
( v1_xboole_0(X1)
| r2_hidden(a_2_0_relset_2(X1,X2),k1_zfmisc_1(k1_zfmisc_1(X2)))
| ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
inference(spm,[status(thm)],[c_0_4950,c_0_4951]) ).
cnf(c_0_4955,plain,
( r2_hidden(X1,k1_zfmisc_1(esk384_0))
| ~ r2_hidden(X1,k1_zfmisc_1(esk385_0)) ),
inference(spm,[status(thm)],[c_0_4944,c_0_4952]) ).
cnf(c_0_4956,plain,
( r1_tarski(X1,X2)
| r2_hidden(esk98_2(X1,X2),X1) ),
i_0_640 ).
cnf(c_0_4957,negated_conjecture,
~ m1_subset_1(a_2_0_relset_2(esk384_0,esk385_0),k1_zfmisc_1(k1_zfmisc_1(esk384_0))),
i_0_2673 ).
cnf(c_0_4958,plain,
( v1_xboole_0(X1)
| m1_subset_1(a_2_0_relset_2(X1,X2),X3)
| ~ r1_tarski(k1_zfmisc_1(k1_zfmisc_1(X2)),X3)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
inference(spm,[status(thm)],[c_0_4953,c_0_4954]) ).
cnf(c_0_4959,negated_conjecture,
~ v1_xboole_0(esk384_0),
i_0_2675 ).
cnf(c_0_4960,plain,
( r1_tarski(X1,X2)
| ~ r2_hidden(esk98_2(X1,X2),X2) ),
i_0_639 ).
cnf(c_0_4961,plain,
( r2_hidden(esk98_2(k1_zfmisc_1(esk385_0),X1),k1_zfmisc_1(esk384_0))
| r1_tarski(k1_zfmisc_1(esk385_0),X1) ),
inference(spm,[status(thm)],[c_0_4955,c_0_4956]) ).
cnf(c_0_4962,negated_conjecture,
~ r1_tarski(k1_zfmisc_1(k1_zfmisc_1(esk385_0)),k1_zfmisc_1(k1_zfmisc_1(esk384_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4957,c_0_4958]),c_0_4939])]),c_0_4959]) ).
cnf(c_0_4963,plain,
( r1_tarski(k1_zfmisc_1(X1),k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
i_0_4923 ).
cnf(c_0_4964,plain,
r1_tarski(k1_zfmisc_1(esk385_0),k1_zfmisc_1(esk384_0)),
inference(spm,[status(thm)],[c_0_4960,c_0_4961]) ).
cnf(c_0_4965,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4962,c_0_4963]),c_0_4964])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU422+3 : TPTP v8.1.0. Released v3.4.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 : Mon Jun 20 09:10:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.91/1.12 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.12 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.91/1.12 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.91/1.12 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 39.43/8.09 # ENIGMATIC: Solved by autoschedule-lgb:
% 39.43/8.09 # No SInE strategy applied
% 39.43/8.09 # Trying AutoSched0 for 149 seconds
% 39.43/8.09 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S061N
% 39.43/8.09 # and selection function SelectMaxLComplexAPPNTNp.
% 39.43/8.09 #
% 39.43/8.09 # Preprocessing time : 0.027 s
% 39.43/8.09 # Presaturation interreduction done
% 39.43/8.09
% 39.43/8.09 # Proof found!
% 39.43/8.09 # SZS status Theorem
% 39.43/8.09 # SZS output start CNFRefutation
% See solution above
% 39.43/8.09 # Training examples: 0 positive, 0 negative
% 39.43/8.09
% 39.43/8.09 # -------------------------------------------------
% 39.43/8.09 # User time : 3.411 s
% 39.43/8.09 # System time : 0.087 s
% 39.43/8.09 # Total time : 3.498 s
% 39.43/8.09 # Maximum resident set size: 7128 pages
% 39.43/8.09
%------------------------------------------------------------------------------