%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET008+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:07:52 EDT 2022
% Result : Theorem 7.27s 2.37s
% Output : CNFRefutation 7.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 10 unt; 7 nHn; 16 RR)
% Number of literals : 46 ( 10 equ; 19 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_ovkdrg/lgb.p',i_0_2) ).
cnf(i_0_16,plain,
( empty(X1)
| member(esk2_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_ovkdrg/lgb.p',i_0_16) ).
cnf(i_0_7,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_ovkdrg/lgb.p',i_0_7) ).
cnf(i_0_18,plain,
( X1 = X2
| member(esk3_2(X1,X2),X2)
| member(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_ovkdrg/lgb.p',i_0_18) ).
cnf(i_0_5,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_ovkdrg/lgb.p',i_0_5) ).
cnf(i_0_3,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_ovkdrg/lgb.p',i_0_3) ).
cnf(i_0_17,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_ovkdrg/lgb.p',i_0_17) ).
cnf(i_0_22,negated_conjecture,
intersection(difference(esk4_0,esk5_0),esk5_0) != empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_ovkdrg/lgb.p',i_0_22) ).
cnf(i_0_11,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_ovkdrg/lgb.p',i_0_11) ).
cnf(c_0_32,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_2 ).
cnf(c_0_33,plain,
( empty(X1)
| member(esk2_1(X1),X1) ),
i_0_16 ).
cnf(c_0_34,plain,
~ member(X1,empty_set),
i_0_7 ).
cnf(c_0_35,plain,
( X1 = X2
| member(esk3_2(X1,X2),X2)
| member(esk3_2(X1,X2),X1) ),
i_0_18 ).
cnf(c_0_36,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_5 ).
cnf(c_0_37,plain,
( empty(intersection(X1,X2))
| member(esk2_1(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
i_0_3 ).
cnf(c_0_39,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
i_0_17 ).
cnf(c_0_40,plain,
( X1 = empty_set
| member(esk3_2(X1,empty_set),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( empty(intersection(X1,difference(X2,X3)))
| ~ member(esk2_1(intersection(X1,difference(X2,X3))),X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( empty(intersection(X1,X2))
| member(esk2_1(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_43,negated_conjecture,
intersection(difference(esk4_0,esk5_0),esk5_0) != empty_set,
i_0_22 ).
cnf(c_0_44,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_11 ).
cnf(c_0_45,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
empty(intersection(X1,difference(X2,X1))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
intersection(esk5_0,difference(esk4_0,esk5_0)) != empty_set,
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
intersection(X1,difference(X2,X1)) = empty_set,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET008+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 01:55:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 7.27/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.27/2.37 # No SInE strategy applied
% 7.27/2.37 # Trying AutoSched0 for 150 seconds
% 7.27/2.37 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.27/2.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.27/2.37 #
% 7.27/2.37 # Preprocessing time : 0.022 s
% 7.27/2.37
% 7.27/2.37 # Proof found!
% 7.27/2.37 # SZS status Theorem
% 7.27/2.37 # SZS output start CNFRefutation
% See solution above
% 7.27/2.37 # Training examples: 0 positive, 0 negative
% 7.27/2.37
% 7.27/2.37 # -------------------------------------------------
% 7.27/2.37 # User time : 0.041 s
% 7.27/2.37 # System time : 0.002 s
% 7.27/2.37 # Total time : 0.043 s
% 7.27/2.37 # Maximum resident set size: 7120 pages
% 7.27/2.37
%------------------------------------------------------------------------------