TSTP Solution File: SET144+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET144+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:09:54 EDT 2022
% Result : Theorem 17.17s 3.52s
% Output : CNFRefutation 17.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 12 unt; 8 nHn; 31 RR)
% Number of literals : 77 ( 9 equ; 37 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 55 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,negated_conjecture,
intersection(union(esk3_0,esk5_0),esk4_0) != union(esk3_0,intersection(esk5_0,esk4_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_20) ).
cnf(i_0_14,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_14) ).
cnf(i_0_17,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_17) ).
cnf(i_0_4,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_4) ).
cnf(i_0_16,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_16) ).
cnf(i_0_9,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_9) ).
cnf(i_0_21,negated_conjecture,
subset(esk3_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_21) ).
cnf(i_0_1,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_1) ).
cnf(i_0_6,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_6) ).
cnf(i_0_2,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_2) ).
cnf(i_0_5,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_5) ).
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bdfimaz2/lgb.p',i_0_3) ).
cnf(c_0_34,negated_conjecture,
intersection(union(esk3_0,esk5_0),esk4_0) != union(esk3_0,intersection(esk5_0,esk4_0)),
i_0_20 ).
cnf(c_0_35,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_14 ).
cnf(c_0_36,negated_conjecture,
intersection(esk4_0,union(esk3_0,esk5_0)) != union(esk3_0,intersection(esk4_0,esk5_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35]) ).
cnf(c_0_37,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
i_0_17 ).
cnf(c_0_38,negated_conjecture,
( ~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),intersection(esk4_0,union(esk3_0,esk5_0)))
| ~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,intersection(esk4_0,esk5_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_39,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
i_0_4 ).
cnf(c_0_40,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_41,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
i_0_9 ).
cnf(c_0_42,negated_conjecture,
subset(esk3_0,esk4_0),
i_0_21 ).
cnf(c_0_43,plain,
( ~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,intersection(esk4_0,esk5_0)))
| ~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,esk5_0))
| ~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),esk4_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
i_0_1 ).
cnf(c_0_45,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
i_0_6 ).
cnf(c_0_46,negated_conjecture,
( member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,intersection(esk4_0,esk5_0)))
| member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),intersection(esk4_0,union(esk3_0,esk5_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_40])]) ).
cnf(c_0_47,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_2 ).
cnf(c_0_48,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_5 ).
cnf(c_0_50,plain,
( ~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,esk5_0))
| ~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),intersection(esk4_0,esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_51,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
i_0_3 ).
cnf(c_0_52,plain,
( member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,intersection(esk4_0,esk5_0)))
| member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),esk4_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,plain,
~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),esk3_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_47]),c_0_48]),c_0_47]) ).
cnf(c_0_54,plain,
( member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,intersection(esk4_0,esk5_0)))
| member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_55,plain,
( ~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),esk5_0)
| ~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_44]) ).
cnf(c_0_56,plain,
member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),esk4_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_45]) ).
cnf(c_0_57,plain,
( member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,esk5_0))
| member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),intersection(esk4_0,esk5_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_54]),c_0_53]) ).
cnf(c_0_58,plain,
~ member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_59,plain,
member(esk2_2(union(esk3_0,intersection(esk4_0,esk5_0)),intersection(esk4_0,union(esk3_0,esk5_0))),union(esk3_0,esk5_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_57]),c_0_58]) ).
cnf(c_0_60,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_59]),c_0_53]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET144+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.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 Jul 11 06:04:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 17.17/3.52 # ENIGMATIC: Solved by autoschedule-lgb:
% 17.17/3.52 # No SInE strategy applied
% 17.17/3.52 # Trying AutoSched0 for 150 seconds
% 17.17/3.52 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 17.17/3.52 # and selection function MSelectComplexExceptUniqMaxHorn.
% 17.17/3.52 #
% 17.17/3.52 # Preprocessing time : 0.023 s
% 17.17/3.52 # Presaturation interreduction done
% 17.17/3.52
% 17.17/3.52 # Proof found!
% 17.17/3.52 # SZS status Theorem
% 17.17/3.52 # SZS output start CNFRefutation
% See solution above
% 17.17/3.52 # Training examples: 0 positive, 0 negative
% 17.17/3.52
% 17.17/3.52 # -------------------------------------------------
% 17.17/3.52 # User time : 1.267 s
% 17.17/3.52 # System time : 0.052 s
% 17.17/3.52 # Total time : 1.319 s
% 17.17/3.52 # Maximum resident set size: 7128 pages
% 17.17/3.52
%------------------------------------------------------------------------------