TSTP Solution File: SEU422+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU422+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:13 EDT 2022
% Result : Theorem 13.97s 3.30s
% Output : CNFRefutation 13.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 33 ( 10 unt; 15 nHn; 24 RR)
% Number of literals : 66 ( 4 equ; 24 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 43 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_24,plain,
( v1_xboole_0(X1)
| m1_subset_1(esk5_3(X2,X1,X3),X1)
| ~ m1_subset_1(X3,k1_zfmisc_1(X1))
| ~ r2_hidden(X2,a_2_0_relset_2(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_24) ).
cnf(i_0_2,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
~ v1_xboole_0(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_3) ).
cnf(i_0_7,plain,
( r1_tarski(X1,X2)
| r2_hidden(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_7) ).
cnf(i_0_37,plain,
( v1_xboole_0(X1)
| r2_hidden(X2,X1)
| ~ m1_subset_1(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_37) ).
cnf(i_0_40,plain,
( r1_tarski(k1_tarski(X1),X2)
| ~ r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_40) ).
cnf(i_0_42,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_42) ).
cnf(i_0_23,plain,
( k1_tarski(esk5_3(X1,X2,X3)) = X1
| v1_xboole_0(X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2))
| ~ r2_hidden(X1,a_2_0_relset_2(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_23) ).
cnf(i_0_17,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_17) ).
cnf(i_0_6,plain,
( r1_tarski(X1,X2)
| ~ r2_hidden(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_6) ).
cnf(i_0_1,negated_conjecture,
~ m1_subset_1(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sc621azq/input.p',i_0_1) ).
cnf(c_0_54,plain,
( v1_xboole_0(X1)
| m1_subset_1(esk5_3(X2,X1,X3),X1)
| ~ m1_subset_1(X3,k1_zfmisc_1(X1))
| ~ r2_hidden(X2,a_2_0_relset_2(X1,X3)) ),
i_0_24 ).
cnf(c_0_55,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0)),
i_0_2 ).
cnf(c_0_56,negated_conjecture,
~ v1_xboole_0(esk1_0),
i_0_3 ).
cnf(c_0_57,negated_conjecture,
( m1_subset_1(esk5_3(X1,esk1_0,esk2_0),esk1_0)
| ~ r2_hidden(X1,a_2_0_relset_2(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_58,plain,
( r1_tarski(X1,X2)
| r2_hidden(esk3_2(X1,X2),X1) ),
i_0_7 ).
cnf(c_0_59,plain,
( v1_xboole_0(X1)
| r2_hidden(X2,X1)
| ~ m1_subset_1(X2,X1) ),
i_0_37 ).
cnf(c_0_60,plain,
( m1_subset_1(esk5_3(esk3_2(a_2_0_relset_2(esk1_0,esk2_0),X1),esk1_0,esk2_0),esk1_0)
| r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
( r1_tarski(k1_tarski(X1),X2)
| ~ r2_hidden(X1,X2) ),
i_0_40 ).
cnf(c_0_62,plain,
( r2_hidden(esk5_3(esk3_2(a_2_0_relset_2(esk1_0,esk2_0),X1),esk1_0,esk2_0),esk1_0)
| r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_56]) ).
cnf(c_0_63,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
i_0_42 ).
cnf(c_0_64,plain,
( r1_tarski(k1_tarski(esk5_3(esk3_2(a_2_0_relset_2(esk1_0,esk2_0),X1),esk1_0,esk2_0)),esk1_0)
| r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,plain,
( k1_tarski(esk5_3(X1,X2,X3)) = X1
| v1_xboole_0(X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(X2))
| ~ r2_hidden(X1,a_2_0_relset_2(X2,X3)) ),
i_0_23 ).
cnf(c_0_66,plain,
( m1_subset_1(k1_tarski(esk5_3(esk3_2(a_2_0_relset_2(esk1_0,esk2_0),X1),esk1_0,esk2_0)),k1_zfmisc_1(esk1_0))
| r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
i_0_17 ).
cnf(c_0_68,negated_conjecture,
( k1_tarski(esk5_3(X1,esk1_0,esk2_0)) = X1
| ~ r2_hidden(X1,a_2_0_relset_2(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_55]),c_0_56]) ).
cnf(c_0_69,plain,
( r2_hidden(k1_tarski(esk5_3(esk3_2(a_2_0_relset_2(esk1_0,esk2_0),X1),esk1_0,esk2_0)),k1_zfmisc_1(esk1_0))
| r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_66]),c_0_67]) ).
cnf(c_0_70,plain,
( k1_tarski(esk5_3(esk3_2(a_2_0_relset_2(esk1_0,esk2_0),X1),esk1_0,esk2_0)) = esk3_2(a_2_0_relset_2(esk1_0,esk2_0),X1)
| r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_58]) ).
cnf(c_0_71,plain,
( r1_tarski(X1,X2)
| ~ r2_hidden(esk3_2(X1,X2),X2) ),
i_0_6 ).
cnf(c_0_72,plain,
( r2_hidden(esk3_2(a_2_0_relset_2(esk1_0,esk2_0),X1),k1_zfmisc_1(esk1_0))
| r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,negated_conjecture,
~ m1_subset_1(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
i_0_1 ).
cnf(c_0_75,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_73]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU422+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n004.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 01:54:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 13.97/3.30 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 13.97/3.30 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 44; version: 991; iters: 150)
% 13.97/3.30 # Preprocessing time : 0.851 s
% 13.97/3.30 # Presaturation interreduction done
% 13.97/3.30
% 13.97/3.30 # Proof found!
% 13.97/3.30 # SZS status Theorem
% 13.97/3.30 # SZS output start CNFRefutation
% See solution above
% 13.97/3.30 # Training examples: 0 positive, 0 negative
% 13.97/3.30
% 13.97/3.30 # -------------------------------------------------
% 13.97/3.30 # User time : 0.807 s
% 13.97/3.30 # System time : 0.104 s
% 13.97/3.30 # Total time : 0.911 s
% 13.97/3.30 # ...preprocessing : 0.851 s
% 13.97/3.30 # ...main loop : 0.060 s
% 13.97/3.30 # Maximum resident set size: 167808 pages
% 13.97/3.30
%------------------------------------------------------------------------------