%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU139+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:46 EDT 2022
% Result : Theorem 7.54s 2.39s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 13 RR)
% Number of literals : 19 ( 3 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_35,plain,
( subset(X1,X2)
| ~ proper_subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s0e_rl_o/lgb.p',i_0_35) ).
cnf(i_0_79,negated_conjecture,
proper_subset(esk12_0,esk11_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s0e_rl_o/lgb.p',i_0_79) ).
cnf(i_0_5,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s0e_rl_o/lgb.p',i_0_5) ).
cnf(i_0_80,negated_conjecture,
subset(esk11_0,esk12_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s0e_rl_o/lgb.p',i_0_80) ).
cnf(i_0_45,plain,
~ proper_subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-s0e_rl_o/lgb.p',i_0_45) ).
cnf(c_0_86,plain,
( subset(X1,X2)
| ~ proper_subset(X1,X2) ),
i_0_35 ).
cnf(c_0_87,negated_conjecture,
proper_subset(esk12_0,esk11_0),
i_0_79 ).
cnf(c_0_88,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_5 ).
cnf(c_0_89,negated_conjecture,
subset(esk12_0,esk11_0),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,negated_conjecture,
subset(esk11_0,esk12_0),
i_0_80 ).
cnf(c_0_91,plain,
esk12_0 = esk11_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90])]) ).
cnf(c_0_92,plain,
~ proper_subset(X1,X1),
i_0_45 ).
cnf(c_0_93,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_91]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU139+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jun 19 01:24:11 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 7.54/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.54/2.39 # No SInE strategy applied
% 7.54/2.39 # Trying AutoSched0 for 150 seconds
% 7.54/2.39 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 7.54/2.39 # and selection function SelectNewComplexAHP.
% 7.54/2.39 #
% 7.54/2.39 # Preprocessing time : 0.023 s
% 7.54/2.39
% 7.54/2.39 # Proof found!
% 7.54/2.39 # SZS status Theorem
% 7.54/2.39 # SZS output start CNFRefutation
% See solution above
% 7.54/2.39 # Training examples: 0 positive, 0 negative
% 7.54/2.39
% 7.54/2.39 # -------------------------------------------------
% 7.54/2.39 # User time : 0.024 s
% 7.54/2.39 # System time : 0.007 s
% 7.54/2.39 # Total time : 0.032 s
% 7.54/2.39 # Maximum resident set size: 7124 pages
% 7.54/2.39
%------------------------------------------------------------------------------