TSTP Solution File: SEU135+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU135+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:38:43 EDT 2022
% Result : Theorem 22.69s 4.27s
% Output : CNFRefutation 22.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 42 ( 11 unt; 13 nHn; 25 RR)
% Number of literals : 95 ( 18 equ; 41 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 114 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_12) ).
cnf(i_0_13,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_13) ).
cnf(i_0_14,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_14) ).
cnf(i_0_15,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_15) ).
cnf(i_0_27,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_27) ).
cnf(i_0_16,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_16) ).
cnf(i_0_29,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_29) ).
cnf(i_0_4,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_4) ).
cnf(i_0_73,lemma,
subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_73) ).
cnf(i_0_2,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_2) ).
cnf(i_0_75,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_75) ).
cnf(i_0_62,negated_conjecture,
set_union2(esk9_0,set_difference(esk10_0,esk9_0)) != set_union2(esk9_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pva962jw/input.p',i_0_62) ).
cnf(c_0_88,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
i_0_12 ).
cnf(c_0_89,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
i_0_13 ).
cnf(c_0_90,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
i_0_14 ).
cnf(c_0_91,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_15 ).
cnf(c_0_92,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_88]) ).
cnf(c_0_93,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_27 ).
cnf(c_0_94,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_89]) ).
cnf(c_0_95,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_90]) ).
cnf(c_0_96,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_97,plain,
( subset(X1,set_union2(X2,X3))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_98,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_93]) ).
cnf(c_0_99,plain,
( subset(X1,set_union2(X2,X3))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_91,c_0_94]) ).
cnf(c_0_100,plain,
( in(esk3_2(set_union2(X1,X2),X3),X1)
| in(esk3_2(set_union2(X1,X2),X3),X2)
| subset(set_union2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_101,plain,
( in(esk3_2(X1,set_union2(X2,set_difference(X3,X4))),X4)
| subset(X1,set_union2(X2,set_difference(X3,X4)))
| ~ in(esk3_2(X1,set_union2(X2,set_difference(X3,X4))),X3) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_102,plain,
( in(esk3_2(set_union2(X1,X2),set_union2(X2,X3)),X1)
| subset(set_union2(X1,X2),set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_29 ).
cnf(c_0_104,plain,
( in(esk3_2(set_union2(X1,X2),set_union2(X2,set_difference(X1,X3))),X3)
| subset(set_union2(X1,X2),set_union2(X2,set_difference(X1,X3))) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_103]) ).
cnf(c_0_106,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_4 ).
cnf(c_0_107,plain,
subset(set_union2(X1,X2),set_union2(X2,set_difference(X1,X2))),
inference(spm,[status(thm)],[c_0_99,c_0_104]) ).
cnf(c_0_108,plain,
( in(esk3_2(set_difference(X1,X2),X3),X1)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_105,c_0_96]) ).
cnf(c_0_109,lemma,
subset(X1,set_union2(X1,X2)),
i_0_73 ).
cnf(c_0_110,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_2 ).
cnf(c_0_111,plain,
( set_union2(X1,set_difference(X2,X1)) = set_union2(X2,X1)
| ~ subset(set_union2(X1,set_difference(X2,X1)),set_union2(X2,X1)) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_112,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
i_0_75 ).
cnf(c_0_113,plain,
subset(set_difference(X1,X2),set_union2(X1,X3)),
inference(spm,[status(thm)],[c_0_99,c_0_108]) ).
cnf(c_0_114,lemma,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_115,negated_conjecture,
set_union2(esk9_0,set_difference(esk10_0,esk9_0)) != set_union2(esk9_0,esk10_0),
i_0_62 ).
cnf(c_0_116,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),c_0_114])]) ).
cnf(c_0_117,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_116]),c_0_110])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU135+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 23:50:16 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 22.69/4.27 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 22.69/4.27 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 23; version: 991; iters: 150)
% 22.69/4.27 # Preprocessing time : 1.219 s
% 22.69/4.27 # Presaturation interreduction done
% 22.69/4.27
% 22.69/4.27 # Proof found!
% 22.69/4.27 # SZS status Theorem
% 22.69/4.27 # SZS output start CNFRefutation
% See solution above
% 22.69/4.27 # Training examples: 0 positive, 0 negative
% 22.69/4.27
% 22.69/4.27 # -------------------------------------------------
% 22.69/4.27 # User time : 1.831 s
% 22.69/4.27 # System time : 0.145 s
% 22.69/4.27 # Total time : 1.976 s
% 22.69/4.27 # ...preprocessing : 1.219 s
% 22.69/4.27 # ...main loop : 0.757 s
% 22.69/4.27 # Maximum resident set size: 185056 pages
% 22.69/4.27
%------------------------------------------------------------------------------