TSTP Solution File: SET637+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET637+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:13:05 EDT 2022
% Result : Theorem 7.45s 2.32s
% Output : CNFRefutation 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 52 ( 10 unt; 16 nHn; 37 RR)
% Number of literals : 103 ( 15 equ; 45 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_4) ).
cnf(i_0_16,plain,
( empty(X1)
| member(esk3_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_16) ).
cnf(i_0_2,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_2) ).
cnf(i_0_7,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_7) ).
cnf(i_0_8,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_8) ).
cnf(i_0_17,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_17) ).
cnf(i_0_15,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_15) ).
cnf(i_0_5,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_5) ).
cnf(i_0_6,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_6) ).
cnf(i_0_14,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_14) ).
cnf(i_0_19,negated_conjecture,
( ~ intersect(esk4_0,esk5_0)
| ~ not_equal(intersection(esk4_0,esk5_0),empty_set) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_19) ).
cnf(i_0_12,plain,
( X1 = X2
| not_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_12) ).
cnf(i_0_1,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_1) ).
cnf(i_0_13,plain,
( X1 != X2
| ~ not_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_13) ).
cnf(i_0_18,negated_conjecture,
( intersect(esk4_0,esk5_0)
| not_equal(intersection(esk4_0,esk5_0),empty_set) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qf7ab5l0/lgb.p',i_0_18) ).
cnf(c_0_35,plain,
( intersect(X1,X2)
| ~ member(X3,X2)
| ~ member(X3,X1) ),
i_0_4 ).
cnf(c_0_36,plain,
( empty(X1)
| member(esk3_1(X1),X1) ),
i_0_16 ).
cnf(c_0_37,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_2 ).
cnf(c_0_38,plain,
~ member(X1,empty_set),
i_0_7 ).
cnf(c_0_39,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
i_0_8 ).
cnf(c_0_40,plain,
( empty(X1)
| intersect(X2,X1)
| ~ member(esk3_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( empty(intersection(X1,X2))
| member(esk3_1(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_42,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
i_0_17 ).
cnf(c_0_43,plain,
( X1 = empty_set
| member(esk2_2(X1,empty_set),X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( intersect(X1,X2)
| ~ intersect(X2,X1) ),
i_0_15 ).
cnf(c_0_45,plain,
( empty(intersection(X1,X2))
| intersect(X2,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
( member(esk1_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
i_0_5 ).
cnf(c_0_47,plain,
( member(esk1_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
i_0_6 ).
cnf(c_0_48,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
( empty(intersection(X1,X2))
| intersect(intersection(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
( intersect(X1,X2)
| ~ member(esk1_2(X3,X2),X1)
| ~ intersect(X3,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_46]) ).
cnf(c_0_51,plain,
( member(esk1_2(intersection(X1,X2),X3),X2)
| ~ intersect(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_47]) ).
cnf(c_0_52,plain,
( intersection(X1,X2) = empty_set
| intersect(intersection(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_14 ).
cnf(c_0_54,negated_conjecture,
( ~ intersect(esk4_0,esk5_0)
| ~ not_equal(intersection(esk4_0,esk5_0),empty_set) ),
i_0_19 ).
cnf(c_0_55,plain,
( X1 = X2
| not_equal(X1,X2) ),
i_0_12 ).
cnf(c_0_56,plain,
( intersect(X1,X2)
| ~ intersect(intersection(X3,X1),X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
( intersection(X1,X2) = empty_set
| intersect(intersection(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
i_0_1 ).
cnf(c_0_59,plain,
( intersection(esk4_0,esk5_0) = empty_set
| ~ intersect(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
( intersection(X1,X2) = empty_set
| intersect(X2,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
( X1 != X2
| ~ not_equal(X1,X2) ),
i_0_13 ).
cnf(c_0_62,plain,
( ~ empty(intersection(X1,X2))
| ~ member(X3,X2)
| ~ member(X3,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_58]) ).
cnf(c_0_63,plain,
intersection(esk4_0,esk5_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_53])]) ).
cnf(c_0_64,plain,
empty(empty_set),
inference(spm,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_65,negated_conjecture,
( intersect(esk4_0,esk5_0)
| not_equal(intersection(esk4_0,esk5_0),empty_set) ),
i_0_18 ).
cnf(c_0_66,plain,
~ not_equal(X1,X1),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_67,plain,
( ~ member(X1,esk5_0)
| ~ member(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_68,negated_conjecture,
intersect(esk4_0,esk5_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_63]),c_0_66]) ).
cnf(c_0_69,plain,
( ~ member(esk1_2(esk5_0,X1),esk4_0)
| ~ intersect(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_47]) ).
cnf(c_0_70,plain,
intersect(esk5_0,esk4_0),
inference(spm,[status(thm)],[c_0_44,c_0_68]) ).
cnf(c_0_71,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_46]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET637+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 23:23:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.45/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.45/2.32 # No SInE strategy applied
% 7.45/2.32 # Trying AutoSched0 for 150 seconds
% 7.45/2.32 # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.45/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.45/2.32 #
% 7.45/2.32 # Preprocessing time : 0.013 s
% 7.45/2.32
% 7.45/2.32 # Proof found!
% 7.45/2.32 # SZS status Theorem
% 7.45/2.32 # SZS output start CNFRefutation
% See solution above
% 7.45/2.32 # Training examples: 0 positive, 0 negative
% 7.45/2.32
% 7.45/2.32 # -------------------------------------------------
% 7.45/2.32 # User time : 0.020 s
% 7.45/2.32 # System time : 0.004 s
% 7.45/2.32 # Total time : 0.024 s
% 7.45/2.32 # Maximum resident set size: 7128 pages
% 7.45/2.32
%------------------------------------------------------------------------------