%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU131+1 : TPTP v8.1.0. Released v3.3.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 08:38:40 EDT 2022
% Result : Theorem 7.89s 2.37s
% Output : CNFRefutation 7.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 7 unt; 14 nHn; 24 RR)
% Number of literals : 76 ( 19 equ; 33 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 62 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_9) ).
cnf(i_0_22,plain,
set_difference(empty_set,X1) = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_22) ).
cnf(i_0_3,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_3) ).
cnf(i_0_4,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_4) ).
cnf(i_0_14,negated_conjecture,
( set_difference(esk3_0,esk4_0) = empty_set
| subset(esk3_0,esk4_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_14) ).
cnf(i_0_6,plain,
( X1 = set_difference(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_6) ).
cnf(i_0_8,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_8) ).
cnf(i_0_5,plain,
( X1 = set_difference(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| ~ in(esk2_3(X2,X3,X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_5) ).
cnf(i_0_2,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_2) ).
cnf(i_0_15,negated_conjecture,
( set_difference(esk3_0,esk4_0) != empty_set
| ~ subset(esk3_0,esk4_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-phayarj5/input.p',i_0_15) ).
cnf(c_0_33,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_9 ).
cnf(c_0_34,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_35,plain,
set_difference(empty_set,X1) = empty_set,
i_0_22 ).
cnf(c_0_36,plain,
( ~ in(X1,empty_set)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_3 ).
cnf(c_0_38,plain,
( subset(empty_set,X1)
| ~ in(esk1_2(empty_set,X1),X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_4 ).
cnf(c_0_40,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( set_difference(esk3_0,esk4_0) = empty_set
| subset(esk3_0,esk4_0) ),
i_0_14 ).
cnf(c_0_42,plain,
~ in(X1,empty_set),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]) ).
cnf(c_0_43,plain,
( X1 = set_difference(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X2) ),
i_0_6 ).
cnf(c_0_44,negated_conjecture,
( set_difference(esk3_0,esk4_0) = empty_set
| in(X1,esk4_0)
| ~ in(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_45,plain,
( set_difference(X1,X2) = empty_set
| in(esk2_3(X1,X2,empty_set),X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_8 ).
cnf(c_0_47,plain,
( X1 = set_difference(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| ~ in(esk2_3(X2,X3,X1),X3) ),
i_0_5 ).
cnf(c_0_48,negated_conjecture,
( set_difference(esk3_0,esk4_0) = empty_set
| set_difference(esk3_0,X1) = empty_set
| in(esk2_3(esk3_0,X1,empty_set),esk4_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_50,plain,
set_difference(esk3_0,esk4_0) = empty_set,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_42]) ).
cnf(c_0_51,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_2 ).
cnf(c_0_52,plain,
( in(X1,esk4_0)
| ~ in(X1,esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_42]) ).
cnf(c_0_53,negated_conjecture,
( set_difference(esk3_0,esk4_0) != empty_set
| ~ subset(esk3_0,esk4_0) ),
i_0_15 ).
cnf(c_0_54,plain,
( subset(X1,esk4_0)
| ~ in(esk1_2(X1,esk4_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
~ subset(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_50])]) ).
cnf(c_0_56,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_37]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU131+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 07:08:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 7.89/2.37 # ENIGMATIC: Solved by autoschedule:
% 7.89/2.37 # No SInE strategy applied
% 7.89/2.37 # Trying AutoSched0 for 150 seconds
% 7.89/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.89/2.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.89/2.37 #
% 7.89/2.37 # Preprocessing time : 0.020 s
% 7.89/2.37 # Presaturation interreduction done
% 7.89/2.37
% 7.89/2.37 # Proof found!
% 7.89/2.37 # SZS status Theorem
% 7.89/2.37 # SZS output start CNFRefutation
% See solution above
% 7.89/2.37 # Training examples: 0 positive, 0 negative
% 7.89/2.37
% 7.89/2.37 # -------------------------------------------------
% 7.89/2.37 # User time : 0.022 s
% 7.89/2.37 # System time : 0.012 s
% 7.89/2.37 # Total time : 0.034 s
% 7.89/2.37 # Maximum resident set size: 7120 pages
% 7.89/2.37
%------------------------------------------------------------------------------