%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:09 EDT 2022
% Result : Theorem 8.05s 2.39s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 37 ( 7 unt; 0 nHn; 23 RR)
% Number of literals : 123 ( 0 equ; 88 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,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-hruisge9/input.p',i_0_2) ).
cnf(i_0_17,plain,
( well_founded_relation(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ well_founded_relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_17) ).
cnf(i_0_9,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_9) ).
cnf(i_0_14,plain,
( connected(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ connected(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_14) ).
cnf(i_0_16,plain,
( antisymmetric(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ antisymmetric(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_16) ).
cnf(i_0_15,plain,
( transitive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ transitive(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_15) ).
cnf(i_0_13,plain,
( reflexive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ reflexive(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_13) ).
cnf(i_0_3,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_3) ).
cnf(i_0_7,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_7) ).
cnf(i_0_6,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_6) ).
cnf(i_0_5,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_5) ).
cnf(i_0_4,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_4) ).
cnf(i_0_18,negated_conjecture,
~ well_ordering(relation_restriction(esk2_0,esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_18) ).
cnf(i_0_19,negated_conjecture,
well_ordering(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_19) ).
cnf(i_0_20,negated_conjecture,
relation(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hruisge9/input.p',i_0_20) ).
cnf(c_0_36,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X1) ),
i_0_2 ).
cnf(c_0_37,plain,
( well_founded_relation(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ well_founded_relation(X1) ),
i_0_17 ).
cnf(c_0_38,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
i_0_9 ).
cnf(c_0_39,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(relation_restriction(X1,X2))
| ~ antisymmetric(relation_restriction(X1,X2))
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_40,plain,
( connected(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ connected(X1) ),
i_0_14 ).
cnf(c_0_41,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(relation_restriction(X1,X2))
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( antisymmetric(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ antisymmetric(X1) ),
i_0_16 ).
cnf(c_0_43,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
( transitive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ transitive(X1) ),
i_0_15 ).
cnf(c_0_45,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( reflexive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ reflexive(X1) ),
i_0_13 ).
cnf(c_0_47,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_3 ).
cnf(c_0_49,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_7 ).
cnf(c_0_50,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_6 ).
cnf(c_0_51,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_5 ).
cnf(c_0_52,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_4 ).
cnf(c_0_53,negated_conjecture,
~ well_ordering(relation_restriction(esk2_0,esk1_0)),
i_0_18 ).
cnf(c_0_54,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_ordering(X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]),c_0_51]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
well_ordering(esk2_0),
i_0_19 ).
cnf(c_0_56,negated_conjecture,
relation(esk2_0),
i_0_20 ).
cnf(c_0_57,negated_conjecture,
$false,
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_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 : Mon Jun 20 04:49:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 8.05/2.39 # ENIGMATIC: Solved by autoschedule:
% 8.05/2.39 # No SInE strategy applied
% 8.05/2.39 # Trying AutoSched0 for 150 seconds
% 8.05/2.39 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 8.05/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.05/2.39 #
% 8.05/2.39 # Preprocessing time : 0.014 s
% 8.05/2.39
% 8.05/2.39 # Proof found!
% 8.05/2.39 # SZS status Theorem
% 8.05/2.39 # SZS output start CNFRefutation
% See solution above
% 8.05/2.39 # Training examples: 0 positive, 0 negative
% 8.05/2.39
% 8.05/2.39 # -------------------------------------------------
% 8.05/2.39 # User time : 0.013 s
% 8.05/2.39 # System time : 0.006 s
% 8.05/2.39 # Total time : 0.019 s
% 8.05/2.39 # Maximum resident set size: 7120 pages
% 8.05/2.39
%------------------------------------------------------------------------------