%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU134+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:43 EDT 2022
% Result : Theorem 7.49s 2.32s
% Output : CNFRefutation 7.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 3 unt; 2 nHn; 11 RR)
% Number of literals : 19 ( 9 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_61,negated_conjecture,
( set_difference(esk9_0,esk10_0) != empty_set
| ~ subset(esk9_0,esk10_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cd5j_l1i/lgb.p',i_0_61) ).
cnf(i_0_41,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cd5j_l1i/lgb.p',i_0_41) ).
cnf(i_0_60,negated_conjecture,
( set_difference(esk9_0,esk10_0) = empty_set
| subset(esk9_0,esk10_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cd5j_l1i/lgb.p',i_0_60) ).
cnf(i_0_42,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cd5j_l1i/lgb.p',i_0_42) ).
cnf(c_0_66,negated_conjecture,
( set_difference(esk9_0,esk10_0) != empty_set
| ~ subset(esk9_0,esk10_0) ),
i_0_61 ).
cnf(c_0_67,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_41 ).
cnf(c_0_68,negated_conjecture,
( set_difference(esk9_0,esk10_0) = empty_set
| subset(esk9_0,esk10_0) ),
i_0_60 ).
cnf(c_0_69,negated_conjecture,
~ subset(esk9_0,esk10_0),
inference(csr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
i_0_42 ).
cnf(c_0_71,negated_conjecture,
set_difference(esk9_0,esk10_0) = empty_set,
inference(sr,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU134+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.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 07:35:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.49/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.49/2.32 # No SInE strategy applied
% 7.49/2.32 # Trying AutoSched0 for 150 seconds
% 7.49/2.32 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.49/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.49/2.32 #
% 7.49/2.32 # Preprocessing time : 0.013 s
% 7.49/2.32 # Presaturation interreduction done
% 7.49/2.32
% 7.49/2.32 # Proof found!
% 7.49/2.32 # SZS status Theorem
% 7.49/2.32 # SZS output start CNFRefutation
% See solution above
% 7.49/2.32 # Training examples: 0 positive, 0 negative
% 7.49/2.32
% 7.49/2.32 # -------------------------------------------------
% 7.49/2.32 # User time : 0.017 s
% 7.49/2.32 # System time : 0.005 s
% 7.49/2.32 # Total time : 0.022 s
% 7.49/2.32 # Maximum resident set size: 7124 pages
% 7.49/2.32
%------------------------------------------------------------------------------