%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET616+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:50 EDT 2022
% Result : Theorem 8.78s 2.54s
% Output : CNFRefutation 8.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 8 unt; 5 nHn; 19 RR)
% Number of literals : 44 ( 6 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yxn7qnf4/lgb.p',i_0_4) ).
cnf(i_0_18,negated_conjecture,
difference(esk4_0,esk5_0) = difference(esk5_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yxn7qnf4/lgb.p',i_0_18) ).
cnf(i_0_5,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yxn7qnf4/lgb.p',i_0_5) ).
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yxn7qnf4/lgb.p',i_0_3) ).
cnf(i_0_14,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yxn7qnf4/lgb.p',i_0_14) ).
cnf(i_0_13,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yxn7qnf4/lgb.p',i_0_13) ).
cnf(i_0_6,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yxn7qnf4/lgb.p',i_0_6) ).
cnf(i_0_17,negated_conjecture,
esk4_0 != esk5_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yxn7qnf4/lgb.p',i_0_17) ).
cnf(c_0_27,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_4 ).
cnf(c_0_28,negated_conjecture,
difference(esk4_0,esk5_0) = difference(esk5_0,esk4_0),
i_0_18 ).
cnf(c_0_29,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
i_0_5 ).
cnf(c_0_30,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
i_0_3 ).
cnf(c_0_31,negated_conjecture,
~ member(X1,difference(esk5_0,esk4_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( member(X1,esk5_0)
| ~ member(X1,esk4_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_31]) ).
cnf(c_0_33,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
i_0_14 ).
cnf(c_0_34,plain,
( subset(X1,X2)
| ~ member(esk3_2(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_35,plain,
( subset(esk4_0,X1)
| member(esk3_2(esk4_0,X1),esk5_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( member(X1,esk4_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_37,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_6 ).
cnf(c_0_38,plain,
subset(esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
esk4_0 != esk5_0,
i_0_17 ).
cnf(c_0_40,plain,
( subset(X1,esk4_0)
| ~ member(esk3_2(X1,esk4_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_36]) ).
cnf(c_0_41,plain,
~ subset(esk5_0,esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET616+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jul 11 04:39:05 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.41 # ENIGMATIC: Selected complete mode:
% 8.78/2.54 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.78/2.54 # No SInE strategy applied
% 8.78/2.54 # Trying AutoSched0 for 150 seconds
% 8.78/2.54 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.78/2.54 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.78/2.54 #
% 8.78/2.54 # Preprocessing time : 0.023 s
% 8.78/2.54
% 8.78/2.54 # Proof found!
% 8.78/2.54 # SZS status Theorem
% 8.78/2.54 # SZS output start CNFRefutation
% See solution above
% 8.78/2.54 # Training examples: 0 positive, 0 negative
% 8.78/2.54
% 8.78/2.54 # -------------------------------------------------
% 8.78/2.54 # User time : 0.024 s
% 8.78/2.54 # System time : 0.008 s
% 8.78/2.54 # Total time : 0.032 s
% 8.78/2.54 # Maximum resident set size: 7124 pages
% 8.78/2.54
%------------------------------------------------------------------------------