%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU122+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:36 EDT 2022
% Result : Theorem 4.59s 2.25s
% Output : CNFRefutation 4.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 5 unt; 2 nHn; 6 RR)
% Number of literals : 13 ( 2 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rm8wx9ih/lgb.p',i_0_4) ).
cnf(i_0_6,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rm8wx9ih/lgb.p',i_0_6) ).
cnf(i_0_25,negated_conjecture,
~ subset(empty_set,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rm8wx9ih/lgb.p',i_0_25) ).
cnf(c_0_29,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_4 ).
cnf(c_0_30,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_31,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
i_0_6 ).
cnf(c_0_32,negated_conjecture,
~ subset(empty_set,esk6_0),
i_0_25 ).
cnf(c_0_33,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU122+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n003.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 Jun 20 11:53:16 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.59/2.25 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.59/2.25 # No SInE strategy applied
% 4.59/2.25 # Trying AutoSched0 for 150 seconds
% 4.59/2.25 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 4.59/2.25 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.59/2.25 #
% 4.59/2.25 # Preprocessing time : 0.012 s
% 4.59/2.25 # Presaturation interreduction done
% 4.59/2.25
% 4.59/2.25 # Proof found!
% 4.59/2.25 # SZS status Theorem
% 4.59/2.25 # SZS output start CNFRefutation
% See solution above
% 4.59/2.25 # Training examples: 0 positive, 0 negative
% 4.59/2.25
% 4.59/2.25 # -------------------------------------------------
% 4.59/2.25 # User time : 0.014 s
% 4.59/2.25 # System time : 0.003 s
% 4.59/2.25 # Total time : 0.017 s
% 4.59/2.25 # Maximum resident set size: 7124 pages
% 4.59/2.25
%------------------------------------------------------------------------------