%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:40:11 EDT 2022
% Result : Theorem 7.33s 2.35s
% Output : CNFRefutation 7.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 19
% Syntax : Number of clauses : 50 ( 21 unt; 0 nHn; 50 RR)
% Number of literals : 117 ( 0 equ; 69 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( epred1_2(X1,X2)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X3)
| ~ relation_isomorphism(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_9) ).
cnf(i_0_11,negated_conjecture,
relation_isomorphism(esk2_0,esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_11) ).
cnf(i_0_13,negated_conjecture,
function(esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_13) ).
cnf(i_0_14,negated_conjecture,
relation(esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_14) ).
cnf(i_0_16,negated_conjecture,
relation(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_16) ).
cnf(i_0_15,negated_conjecture,
relation(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_15) ).
cnf(i_0_17,plain,
( well_founded_relation(X1)
| ~ well_founded_relation(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_17) ).
cnf(i_0_18,plain,
( antisymmetric(X1)
| ~ antisymmetric(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_18) ).
cnf(i_0_19,plain,
( connected(X1)
| ~ connected(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_19) ).
cnf(i_0_20,plain,
( transitive(X1)
| ~ transitive(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_20) ).
cnf(i_0_21,plain,
( reflexive(X1)
| ~ reflexive(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_21) ).
cnf(i_0_2,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_2) ).
cnf(i_0_12,negated_conjecture,
well_ordering(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_12) ).
cnf(i_0_4,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_4) ).
cnf(i_0_3,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_5) ).
cnf(i_0_6,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_6) ).
cnf(i_0_1,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_1) ).
cnf(i_0_10,negated_conjecture,
~ well_ordering(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t0u1ocgo/lgb.p',i_0_10) ).
cnf(c_0_41,plain,
( epred1_2(X1,X2)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X3)
| ~ relation_isomorphism(X2,X1,X3) ),
i_0_9 ).
cnf(c_0_42,negated_conjecture,
relation_isomorphism(esk2_0,esk3_0,esk4_0),
i_0_11 ).
cnf(c_0_43,negated_conjecture,
function(esk4_0),
i_0_13 ).
cnf(c_0_44,negated_conjecture,
relation(esk4_0),
i_0_14 ).
cnf(c_0_45,negated_conjecture,
relation(esk2_0),
i_0_16 ).
cnf(c_0_46,negated_conjecture,
relation(esk3_0),
i_0_15 ).
cnf(c_0_47,plain,
( well_founded_relation(X1)
| ~ well_founded_relation(X2)
| ~ epred1_2(X1,X2) ),
i_0_17 ).
cnf(c_0_48,negated_conjecture,
epred1_2(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_49,plain,
( antisymmetric(X1)
| ~ antisymmetric(X2)
| ~ epred1_2(X1,X2) ),
i_0_18 ).
cnf(c_0_50,plain,
( connected(X1)
| ~ connected(X2)
| ~ epred1_2(X1,X2) ),
i_0_19 ).
cnf(c_0_51,plain,
( transitive(X1)
| ~ transitive(X2)
| ~ epred1_2(X1,X2) ),
i_0_20 ).
cnf(c_0_52,plain,
( reflexive(X1)
| ~ reflexive(X2)
| ~ epred1_2(X1,X2) ),
i_0_21 ).
cnf(c_0_53,plain,
( well_founded_relation(esk3_0)
| ~ well_founded_relation(esk2_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_2 ).
cnf(c_0_55,negated_conjecture,
well_ordering(esk2_0),
i_0_12 ).
cnf(c_0_56,plain,
( antisymmetric(esk3_0)
| ~ antisymmetric(esk2_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_57,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_4 ).
cnf(c_0_58,plain,
( connected(esk3_0)
| ~ connected(esk2_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_48]) ).
cnf(c_0_59,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_3 ).
cnf(c_0_60,plain,
( transitive(esk3_0)
| ~ transitive(esk2_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_48]) ).
cnf(c_0_61,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_5 ).
cnf(c_0_62,plain,
( reflexive(esk3_0)
| ~ reflexive(esk2_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_48]) ).
cnf(c_0_63,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_6 ).
cnf(c_0_64,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X1) ),
i_0_1 ).
cnf(c_0_65,plain,
well_founded_relation(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_45])]) ).
cnf(c_0_66,plain,
antisymmetric(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_55]),c_0_45])]) ).
cnf(c_0_67,plain,
connected(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_55]),c_0_45])]) ).
cnf(c_0_68,plain,
transitive(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_55]),c_0_45])]) ).
cnf(c_0_69,plain,
reflexive(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_55]),c_0_45])]) ).
cnf(c_0_70,negated_conjecture,
~ well_ordering(esk3_0),
i_0_10 ).
cnf(c_0_71,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67]),c_0_68]),c_0_69]),c_0_46])]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 16:24:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.33/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.33/2.35 # No SInE strategy applied
% 7.33/2.35 # Trying AutoSched0 for 150 seconds
% 7.33/2.35 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 7.33/2.35 # and selection function SelectCQPrecWNTNp.
% 7.33/2.35 #
% 7.33/2.35 # Preprocessing time : 0.023 s
% 7.33/2.35
% 7.33/2.35 # Proof found!
% 7.33/2.35 # SZS status Theorem
% 7.33/2.35 # SZS output start CNFRefutation
% See solution above
% 7.33/2.35 # Training examples: 0 positive, 0 negative
% 7.33/2.35
% 7.33/2.35 # -------------------------------------------------
% 7.33/2.35 # User time : 0.025 s
% 7.33/2.35 # System time : 0.004 s
% 7.33/2.35 # Total time : 0.029 s
% 7.33/2.35 # Maximum resident set size: 7124 pages
% 7.33/2.35
%------------------------------------------------------------------------------