%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU101+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:27 EDT 2022
% Result : Theorem 8.48s 2.50s
% Output : CNFRefutation 8.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 47 ( 10 unt; 14 nHn; 37 RR)
% Number of literals : 106 ( 2 equ; 49 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_57,negated_conjecture,
( preboolean(esk15_0)
| in(set_difference(X1,X2),esk15_0)
| ~ in(X2,esk15_0)
| ~ in(X1,esk15_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_57) ).
cnf(i_0_13,plain,
( diff_closed(X1)
| in(esk4_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_13) ).
cnf(i_0_3,plain,
( diff_closed(X1)
| ~ preboolean(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_3) ).
cnf(i_0_58,negated_conjecture,
( preboolean(esk15_0)
| in(set_union2(X1,X2),esk15_0)
| ~ in(X2,esk15_0)
| ~ in(X1,esk15_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_58) ).
cnf(i_0_10,plain,
( cup_closed(X1)
| in(esk1_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_10) ).
cnf(i_0_4,plain,
( cup_closed(X1)
| ~ preboolean(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_4) ).
cnf(i_0_14,plain,
( diff_closed(X1)
| in(esk3_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_14) ).
cnf(i_0_12,plain,
( diff_closed(X1)
| ~ in(set_difference(esk3_1(X1),esk4_1(X1)),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_12) ).
cnf(i_0_9,plain,
( cup_closed(X1)
| in(esk2_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_9) ).
cnf(i_0_7,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_7) ).
cnf(i_0_8,plain,
( cup_closed(X1)
| ~ in(set_union2(esk1_1(X1),esk2_1(X1)),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_8) ).
cnf(i_0_6,plain,
( preboolean(X1)
| ~ cup_closed(X1)
| ~ diff_closed(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_6) ).
cnf(i_0_60,negated_conjecture,
( in(esk17_0,esk15_0)
| ~ preboolean(esk15_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_60) ).
cnf(i_0_15,plain,
( in(set_difference(X1,X2),X3)
| ~ diff_closed(X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_15) ).
cnf(i_0_61,negated_conjecture,
( in(esk16_0,esk15_0)
| ~ preboolean(esk15_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_61) ).
cnf(i_0_59,negated_conjecture,
( ~ preboolean(esk15_0)
| ~ in(set_union2(esk16_0,esk17_0),esk15_0)
| ~ in(set_difference(esk16_0,esk17_0),esk15_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_59) ).
cnf(i_0_11,plain,
( in(set_union2(X1,X2),X3)
| ~ cup_closed(X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ngergkm/input.p',i_0_11) ).
cnf(c_0_79,negated_conjecture,
( preboolean(esk15_0)
| in(set_difference(X1,X2),esk15_0)
| ~ in(X2,esk15_0)
| ~ in(X1,esk15_0) ),
i_0_57 ).
cnf(c_0_80,plain,
( diff_closed(X1)
| in(esk4_1(X1),X1) ),
i_0_13 ).
cnf(c_0_81,plain,
( diff_closed(X1)
| ~ preboolean(X1) ),
i_0_3 ).
cnf(c_0_82,negated_conjecture,
( preboolean(esk15_0)
| in(set_union2(X1,X2),esk15_0)
| ~ in(X2,esk15_0)
| ~ in(X1,esk15_0) ),
i_0_58 ).
cnf(c_0_83,plain,
( cup_closed(X1)
| in(esk1_1(X1),X1) ),
i_0_10 ).
cnf(c_0_84,plain,
( cup_closed(X1)
| ~ preboolean(X1) ),
i_0_4 ).
cnf(c_0_85,negated_conjecture,
( in(set_difference(X1,esk4_1(esk15_0)),esk15_0)
| diff_closed(esk15_0)
| ~ in(X1,esk15_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]) ).
cnf(c_0_86,plain,
( diff_closed(X1)
| in(esk3_1(X1),X1) ),
i_0_14 ).
cnf(c_0_87,plain,
( diff_closed(X1)
| ~ in(set_difference(esk3_1(X1),esk4_1(X1)),X1) ),
i_0_12 ).
cnf(c_0_88,negated_conjecture,
( in(set_union2(X1,esk1_1(esk15_0)),esk15_0)
| cup_closed(esk15_0)
| ~ in(X1,esk15_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]) ).
cnf(c_0_89,plain,
( cup_closed(X1)
| in(esk2_1(X1),X1) ),
i_0_9 ).
cnf(c_0_90,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_7 ).
cnf(c_0_91,plain,
( cup_closed(X1)
| ~ in(set_union2(esk1_1(X1),esk2_1(X1)),X1) ),
i_0_8 ).
cnf(c_0_92,plain,
( preboolean(X1)
| ~ cup_closed(X1)
| ~ diff_closed(X1) ),
i_0_6 ).
cnf(c_0_93,plain,
diff_closed(esk15_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_94,plain,
cup_closed(esk15_0),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_91]) ).
cnf(c_0_95,negated_conjecture,
( in(esk17_0,esk15_0)
| ~ preboolean(esk15_0) ),
i_0_60 ).
cnf(c_0_96,plain,
preboolean(esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94])]) ).
cnf(c_0_97,plain,
( in(set_difference(X1,X2),X3)
| ~ diff_closed(X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
i_0_15 ).
cnf(c_0_98,negated_conjecture,
in(esk17_0,esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_99,negated_conjecture,
( in(esk16_0,esk15_0)
| ~ preboolean(esk15_0) ),
i_0_61 ).
cnf(c_0_100,negated_conjecture,
( ~ preboolean(esk15_0)
| ~ in(set_union2(esk16_0,esk17_0),esk15_0)
| ~ in(set_difference(esk16_0,esk17_0),esk15_0) ),
i_0_59 ).
cnf(c_0_101,plain,
( in(set_difference(X1,esk17_0),esk15_0)
| ~ in(X1,esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_93])]) ).
cnf(c_0_102,negated_conjecture,
in(esk16_0,esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_96])]) ).
cnf(c_0_103,plain,
( in(set_union2(X1,X2),X3)
| ~ cup_closed(X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
i_0_11 ).
cnf(c_0_104,negated_conjecture,
( ~ in(set_difference(esk16_0,esk17_0),esk15_0)
| ~ in(set_union2(esk16_0,esk17_0),esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_96])]) ).
cnf(c_0_105,negated_conjecture,
in(set_difference(esk16_0,esk17_0),esk15_0),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_106,plain,
( in(set_union2(X1,esk17_0),esk15_0)
| ~ in(X1,esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_98]),c_0_94])]) ).
cnf(c_0_107,negated_conjecture,
~ in(set_union2(esk16_0,esk17_0),esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105])]) ).
cnf(c_0_108,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_102]),c_0_107]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU101+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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 Jun 19 22:45:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.48/2.50 # ENIGMATIC: Solved by autoschedule:
% 8.48/2.50 # No SInE strategy applied
% 8.48/2.50 # Trying AutoSched0 for 150 seconds
% 8.48/2.50 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 8.48/2.50 # and selection function SelectComplexG.
% 8.48/2.50 #
% 8.48/2.50 # Preprocessing time : 0.023 s
% 8.48/2.50
% 8.48/2.50 # Proof found!
% 8.48/2.50 # SZS status Theorem
% 8.48/2.50 # SZS output start CNFRefutation
% See solution above
% 8.48/2.50 # Training examples: 0 positive, 0 negative
% 8.48/2.50
% 8.48/2.50 # -------------------------------------------------
% 8.48/2.50 # User time : 0.035 s
% 8.48/2.50 # System time : 0.007 s
% 8.48/2.50 # Total time : 0.042 s
% 8.48/2.50 # Maximum resident set size: 7124 pages
% 8.48/2.50
%------------------------------------------------------------------------------