%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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 : Mon Jul 18 08:35:39 EDT 2022
% Result : Theorem 7.59s 2.20s
% Output : CNFRefutation 7.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 14 unt; 4 nHn; 23 RR)
% Number of literals : 51 ( 5 equ; 25 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_51,plain,
( X1 = X2
| in(X2,X1)
| in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6vmz9toy/lgb.p',i_0_51) ).
cnf(i_0_54,negated_conjecture,
ordinal(esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6vmz9toy/lgb.p',i_0_54) ).
cnf(i_0_53,negated_conjecture,
~ ordinal_subset(esk14_0,esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6vmz9toy/lgb.p',i_0_53) ).
cnf(i_0_46,plain,
( ordinal_subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6vmz9toy/lgb.p',i_0_46) ).
cnf(i_0_55,negated_conjecture,
ordinal(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6vmz9toy/lgb.p',i_0_55) ).
cnf(i_0_13,plain,
( subset(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6vmz9toy/lgb.p',i_0_13) ).
cnf(i_0_4,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6vmz9toy/lgb.p',i_0_4) ).
cnf(i_0_52,negated_conjecture,
~ in(esk15_0,esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6vmz9toy/lgb.p',i_0_52) ).
cnf(i_0_49,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6vmz9toy/lgb.p',i_0_49) ).
cnf(c_0_65,plain,
( X1 = X2
| in(X2,X1)
| in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
i_0_51 ).
cnf(c_0_66,negated_conjecture,
ordinal(esk15_0),
i_0_54 ).
cnf(c_0_67,negated_conjecture,
~ ordinal_subset(esk14_0,esk15_0),
i_0_53 ).
cnf(c_0_68,plain,
( ordinal_subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ subset(X1,X2) ),
i_0_46 ).
cnf(c_0_69,negated_conjecture,
ordinal(esk14_0),
i_0_55 ).
cnf(c_0_70,plain,
( subset(X1,X2)
| ~ epsilon_transitive(X2)
| ~ in(X1,X2) ),
i_0_13 ).
cnf(c_0_71,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
i_0_4 ).
cnf(c_0_72,negated_conjecture,
( X1 = esk15_0
| in(esk15_0,X1)
| in(X1,esk15_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_73,negated_conjecture,
~ in(esk15_0,esk14_0),
i_0_52 ).
cnf(c_0_74,negated_conjecture,
~ subset(esk14_0,esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_66]),c_0_69])]) ).
cnf(c_0_75,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
( esk15_0 = esk14_0
| in(esk14_0,esk15_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_69]),c_0_73]) ).
cnf(c_0_77,negated_conjecture,
~ in(esk14_0,esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_66])]) ).
cnf(c_0_78,negated_conjecture,
esk15_0 = esk14_0,
inference(sr,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_79,plain,
subset(X1,X1),
i_0_49 ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_78]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 17:16:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.46 # ENIGMATIC: Selected complete mode:
% 7.59/2.20 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.59/2.20 # No SInE strategy applied
% 7.59/2.20 # Trying AutoSched0 for 150 seconds
% 7.59/2.20 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y
% 7.59/2.20 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.59/2.20 #
% 7.59/2.20 # Preprocessing time : 0.024 s
% 7.59/2.20
% 7.59/2.20 # Proof found!
% 7.59/2.20 # SZS status Theorem
% 7.59/2.20 # SZS output start CNFRefutation
% See solution above
% 7.59/2.20 # Training examples: 0 positive, 0 negative
% 7.59/2.20
% 7.59/2.20 # -------------------------------------------------
% 7.59/2.20 # User time : 0.029 s
% 7.59/2.20 # System time : 0.007 s
% 7.59/2.20 # Total time : 0.036 s
% 7.59/2.20 # Maximum resident set size: 7120 pages
% 7.59/2.20
%------------------------------------------------------------------------------