%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU120+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:34 EDT 2022
% Result : Theorem 7.54s 2.33s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 7 unt; 3 nHn; 27 RR)
% Number of literals : 59 ( 10 equ; 33 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gdmorzhw/input.p',i_0_4) ).
cnf(i_0_11,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gdmorzhw/input.p',i_0_11) ).
cnf(i_0_3,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gdmorzhw/input.p',i_0_3) ).
cnf(i_0_26,negated_conjecture,
( in(esk8_0,set_intersection2(esk6_0,esk7_0))
| ~ disjoint(esk6_0,esk7_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gdmorzhw/input.p',i_0_26) ).
cnf(i_0_23,negated_conjecture,
( disjoint(esk6_0,esk7_0)
| ~ in(X1,set_intersection2(esk6_0,esk7_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gdmorzhw/input.p',i_0_23) ).
cnf(i_0_9,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gdmorzhw/input.p',i_0_9) ).
cnf(i_0_24,negated_conjecture,
( in(esk8_0,set_intersection2(esk6_0,esk7_0))
| ~ in(X1,set_intersection2(esk6_0,esk7_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gdmorzhw/input.p',i_0_24) ).
cnf(i_0_20,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gdmorzhw/input.p',i_0_20) ).
cnf(i_0_10,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gdmorzhw/input.p',i_0_10) ).
cnf(c_0_36,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_4 ).
cnf(c_0_37,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
i_0_11 ).
cnf(c_0_38,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
i_0_3 ).
cnf(c_0_39,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( in(esk8_0,set_intersection2(esk6_0,esk7_0))
| ~ disjoint(esk6_0,esk7_0) ),
i_0_26 ).
cnf(c_0_41,plain,
( disjoint(X1,X2)
| in(esk1_1(set_intersection2(X1,X2)),set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( in(esk1_1(X1),X1)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( disjoint(esk6_0,esk7_0)
| ~ in(X1,set_intersection2(esk6_0,esk7_0)) ),
i_0_23 ).
cnf(c_0_44,negated_conjecture,
in(esk1_1(set_intersection2(esk6_0,esk7_0)),set_intersection2(esk6_0,esk7_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_46,negated_conjecture,
( in(esk8_0,set_intersection2(esk6_0,esk7_0))
| ~ in(X1,set_intersection2(esk6_0,esk7_0)) ),
i_0_24 ).
cnf(c_0_47,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
i_0_20 ).
cnf(c_0_48,negated_conjecture,
disjoint(esk6_0,esk7_0),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_50,negated_conjecture,
in(esk8_0,set_intersection2(esk6_0,esk7_0)),
inference(spm,[status(thm)],[c_0_46,c_0_44]) ).
cnf(c_0_51,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_52,lemma,
( ~ in(X1,esk6_0)
| ~ in(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
in(esk8_0,esk7_0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_55,plain,
~ in(esk8_0,esk6_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_50]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU120+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 13:27:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.54/2.33 # ENIGMATIC: Solved by autoschedule:
% 7.54/2.33 # No SInE strategy applied
% 7.54/2.33 # Trying AutoSched0 for 150 seconds
% 7.54/2.33 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S002A
% 7.54/2.33 # and selection function SelectNegativeLiterals.
% 7.54/2.33 #
% 7.54/2.33 # Preprocessing time : 0.023 s
% 7.54/2.33 # Presaturation interreduction done
% 7.54/2.33
% 7.54/2.33 # Proof found!
% 7.54/2.33 # SZS status Theorem
% 7.54/2.33 # SZS output start CNFRefutation
% See solution above
% 7.54/2.33 # Training examples: 0 positive, 0 negative
% 7.54/2.33
% 7.54/2.33 # -------------------------------------------------
% 7.54/2.33 # User time : 0.038 s
% 7.54/2.33 # System time : 0.007 s
% 7.54/2.33 # Total time : 0.045 s
% 7.54/2.33 # Maximum resident set size: 7124 pages
% 7.54/2.33
%------------------------------------------------------------------------------