%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU234+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:39:54 EDT 2022
% Result : Theorem 7.37s 2.34s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 6 unt; 13 nHn; 27 RR)
% Number of literals : 76 ( 10 equ; 27 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
( epsilon_transitive(X1)
| ~ subset(esk1_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_13) ).
cnf(i_0_81,negated_conjecture,
( subset(X1,esk18_0)
| ~ in(X1,esk18_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_81) ).
cnf(i_0_14,plain,
( epsilon_transitive(X1)
| in(esk1_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_14) ).
cnf(i_0_78,plain,
( X1 = X2
| in(X2,X1)
| in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_78) ).
cnf(i_0_82,negated_conjecture,
( ordinal(X1)
| ~ in(X1,esk18_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_82) ).
cnf(i_0_9,plain,
( ordinal(X1)
| ~ epsilon_transitive(X1)
| ~ epsilon_connected(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_9) ).
cnf(i_0_80,negated_conjecture,
~ ordinal(esk18_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_80) ).
cnf(i_0_20,plain,
( epsilon_connected(X1)
| in(esk2_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_20) ).
cnf(i_0_19,plain,
( epsilon_connected(X1)
| in(esk3_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_19) ).
cnf(i_0_18,plain,
( epsilon_connected(X1)
| ~ in(esk2_1(X1),esk3_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_18) ).
cnf(i_0_16,plain,
( epsilon_connected(X1)
| ~ in(esk3_1(X1),esk2_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_16) ).
cnf(i_0_17,plain,
( epsilon_connected(X1)
| esk3_1(X1) != esk2_1(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1vag8m96/input.p',i_0_17) ).
cnf(c_0_95,plain,
( epsilon_transitive(X1)
| ~ subset(esk1_1(X1),X1) ),
i_0_13 ).
cnf(c_0_96,negated_conjecture,
( subset(X1,esk18_0)
| ~ in(X1,esk18_0) ),
i_0_81 ).
cnf(c_0_97,plain,
( epsilon_transitive(X1)
| in(esk1_1(X1),X1) ),
i_0_14 ).
cnf(c_0_98,plain,
( X1 = X2
| in(X2,X1)
| in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
i_0_78 ).
cnf(c_0_99,negated_conjecture,
( ordinal(X1)
| ~ in(X1,esk18_0) ),
i_0_82 ).
cnf(c_0_100,plain,
( ordinal(X1)
| ~ epsilon_transitive(X1)
| ~ epsilon_connected(X1) ),
i_0_9 ).
cnf(c_0_101,negated_conjecture,
epsilon_transitive(esk18_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]) ).
cnf(c_0_102,negated_conjecture,
~ ordinal(esk18_0),
i_0_80 ).
cnf(c_0_103,negated_conjecture,
( X1 = X2
| in(X2,X1)
| in(X1,X2)
| ~ in(X2,esk18_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_104,plain,
( epsilon_connected(X1)
| in(esk2_1(X1),X1) ),
i_0_20 ).
cnf(c_0_105,plain,
~ epsilon_connected(esk18_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]) ).
cnf(c_0_106,plain,
( X1 = esk2_1(esk18_0)
| in(X1,esk2_1(esk18_0))
| in(esk2_1(esk18_0),X1)
| ~ ordinal(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]) ).
cnf(c_0_107,negated_conjecture,
( X1 = esk2_1(esk18_0)
| in(esk2_1(esk18_0),X1)
| in(X1,esk2_1(esk18_0))
| ~ in(X1,esk18_0) ),
inference(spm,[status(thm)],[c_0_106,c_0_99]) ).
cnf(c_0_108,plain,
( epsilon_connected(X1)
| in(esk3_1(X1),X1) ),
i_0_19 ).
cnf(c_0_109,plain,
( epsilon_connected(X1)
| ~ in(esk2_1(X1),esk3_1(X1)) ),
i_0_18 ).
cnf(c_0_110,plain,
( esk2_1(esk18_0) = esk3_1(esk18_0)
| in(esk3_1(esk18_0),esk2_1(esk18_0))
| in(esk2_1(esk18_0),esk3_1(esk18_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_105]) ).
cnf(c_0_111,plain,
( epsilon_connected(X1)
| ~ in(esk3_1(X1),esk2_1(X1)) ),
i_0_16 ).
cnf(c_0_112,plain,
( esk2_1(esk18_0) = esk3_1(esk18_0)
| in(esk3_1(esk18_0),esk2_1(esk18_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_105]) ).
cnf(c_0_113,plain,
( epsilon_connected(X1)
| esk3_1(X1) != esk2_1(X1) ),
i_0_17 ).
cnf(c_0_114,plain,
esk2_1(esk18_0) = esk3_1(esk18_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_105]) ).
cnf(c_0_115,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_105]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU234+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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 12:47:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.37/2.34 # ENIGMATIC: Solved by autoschedule:
% 7.37/2.34 # No SInE strategy applied
% 7.37/2.34 # Trying AutoSched0 for 150 seconds
% 7.37/2.34 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y
% 7.37/2.34 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.37/2.34 #
% 7.37/2.34 # Preprocessing time : 0.024 s
% 7.37/2.34
% 7.37/2.34 # Proof found!
% 7.37/2.34 # SZS status Theorem
% 7.37/2.34 # SZS output start CNFRefutation
% See solution above
% 7.37/2.34 # Training examples: 0 positive, 0 negative
% 7.37/2.34
% 7.37/2.34 # -------------------------------------------------
% 7.37/2.34 # User time : 0.042 s
% 7.37/2.34 # System time : 0.003 s
% 7.37/2.34 # Total time : 0.045 s
% 7.37/2.34 # Maximum resident set size: 7124 pages
% 7.37/2.34
%------------------------------------------------------------------------------