TSTP Solution File: SET606+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET606+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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 00:12:42 EDT 2022
% Result : Theorem 17.60s 3.50s
% Output : CNFRefutation 17.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 48 ( 17 unt; 13 nHn; 23 RR)
% Number of literals : 88 ( 11 equ; 31 neg)
% Maximal clause size : 3 ( 1 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 : 120 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_17) ).
cnf(i_0_6,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_6) ).
cnf(i_0_4,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_4) ).
cnf(i_0_18,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_18) ).
cnf(i_0_7,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_7) ).
cnf(i_0_12,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_12) ).
cnf(i_0_8,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_8) ).
cnf(i_0_3,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_3) ).
cnf(i_0_9,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_9) ).
cnf(i_0_21,negated_conjecture,
difference(esk4_0,intersection(esk4_0,esk5_0)) != difference(esk4_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kw9wvhk7/input.p',i_0_21) ).
cnf(c_0_32,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
i_0_17 ).
cnf(c_0_33,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
i_0_6 ).
cnf(c_0_34,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_4 ).
cnf(c_0_35,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
i_0_18 ).
cnf(c_0_36,plain,
( member(esk3_2(X1,difference(X2,X3)),X3)
| subset(X1,difference(X2,X3))
| ~ member(esk3_2(X1,difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_7 ).
cnf(c_0_38,plain,
( member(esk3_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_12 ).
cnf(c_0_40,plain,
( member(esk3_2(X1,difference(X1,X2)),X2)
| subset(X1,difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_41,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
i_0_8 ).
cnf(c_0_42,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
i_0_3 ).
cnf(c_0_43,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk3_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_44,plain,
( member(esk3_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( subset(X1,difference(X1,difference(X2,X3)))
| ~ member(esk3_2(X1,difference(X1,difference(X2,X3))),X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_40]) ).
cnf(c_0_46,plain,
( member(esk3_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_35]) ).
cnf(c_0_47,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk3_2(X1,intersection(X2,X3)),X3)
| ~ member(esk3_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_42]) ).
cnf(c_0_48,plain,
( member(esk3_2(difference(X1,difference(X2,X3)),X4),X3)
| subset(difference(X1,difference(X2,X3)),X4)
| ~ member(esk3_2(difference(X1,difference(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
cnf(c_0_49,plain,
( subset(intersection(difference(X1,X2),X3),X4)
| ~ member(esk3_2(intersection(difference(X1,X2),X3),X4),X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_44]) ).
cnf(c_0_50,plain,
( member(esk3_2(intersection(X1,X2),difference(X2,X3)),X3)
| subset(intersection(X1,X2),difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_36,c_0_38]) ).
cnf(c_0_51,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_9 ).
cnf(c_0_52,plain,
subset(X1,difference(X1,difference(X2,X1))),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_53,plain,
subset(difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_54,plain,
( subset(difference(X1,X2),intersection(X3,X1))
| ~ member(esk3_2(difference(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_55,plain,
( member(esk3_2(difference(X1,difference(X1,X2)),X3),X2)
| subset(difference(X1,difference(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_46]) ).
cnf(c_0_56,plain,
subset(intersection(difference(X1,X2),X3),difference(X3,X2)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
difference(X1,difference(X2,X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_58,plain,
( subset(intersection(X1,difference(X2,X3)),X4)
| ~ member(esk3_2(intersection(X1,difference(X2,X3)),X4),X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_59,plain,
( member(esk3_2(intersection(X1,X2),difference(X1,X3)),X3)
| subset(intersection(X1,X2),difference(X1,X3)) ),
inference(spm,[status(thm)],[c_0_36,c_0_44]) ).
cnf(c_0_60,plain,
subset(difference(X1,difference(X1,X2)),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
subset(intersection(X1,X2),difference(X2,difference(X3,X1))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
subset(difference(X1,X2),intersection(X1,difference(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_35]),c_0_39]) ).
cnf(c_0_63,plain,
subset(intersection(X1,difference(X2,X3)),difference(X1,X3)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
difference(X1,difference(X1,X2)) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_60]),c_0_61])]) ).
cnf(c_0_65,plain,
intersection(X1,difference(X1,X2)) = difference(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_62]),c_0_63])]) ).
cnf(c_0_66,plain,
difference(X1,intersection(X2,X1)) = difference(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_64]),c_0_39]),c_0_65]) ).
cnf(c_0_67,negated_conjecture,
difference(esk4_0,intersection(esk4_0,esk5_0)) != difference(esk4_0,esk5_0),
i_0_21 ).
cnf(c_0_68,plain,
difference(X1,intersection(X1,X2)) = difference(X1,X2),
inference(spm,[status(thm)],[c_0_66,c_0_39]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET606+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 : Sun Jul 10 22:32:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 17.60/3.50 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 17.60/3.50 # 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)
% 17.60/3.50 # Preprocessing time : 1.185 s
% 17.60/3.50 # Presaturation interreduction done
% 17.60/3.50
% 17.60/3.50 # Proof found!
% 17.60/3.50 # SZS status Theorem
% 17.60/3.50 # SZS output start CNFRefutation
% See solution above
% 17.60/3.50 # Training examples: 0 positive, 0 negative
% 17.60/3.50
% 17.60/3.50 # -------------------------------------------------
% 17.60/3.50 # User time : 1.154 s
% 17.60/3.50 # System time : 0.141 s
% 17.60/3.50 # Total time : 1.295 s
% 17.60/3.50 # ...preprocessing : 1.185 s
% 17.60/3.50 # ...main loop : 0.109 s
% 17.60/3.50 # Maximum resident set size: 186596 pages
% 17.60/3.50
%------------------------------------------------------------------------------