TSTP Solution File: SEU019+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU019+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:02 EDT 2022
% Result : Theorem 7.38s 2.35s
% Output : CNFRefutation 7.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 13 unt; 6 nHn; 21 RR)
% Number of literals : 65 ( 17 equ; 35 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 25 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
( relation_dom(X1) = X2
| X1 != identity_relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwuc1cex/lgb.p',i_0_43) ).
cnf(i_0_16,plain,
function(identity_relation(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwuc1cex/lgb.p',i_0_16) ).
cnf(i_0_9,plain,
relation(identity_relation(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwuc1cex/lgb.p',i_0_9) ).
cnf(i_0_42,plain,
( apply(X1,X2) = X2
| X1 != identity_relation(X3)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwuc1cex/lgb.p',i_0_42) ).
cnf(i_0_47,negated_conjecture,
~ one_to_one(identity_relation(esk13_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwuc1cex/lgb.p',i_0_47) ).
cnf(i_0_6,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwuc1cex/lgb.p',i_0_6) ).
cnf(i_0_7,plain,
( one_to_one(X1)
| in(esk1_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwuc1cex/lgb.p',i_0_7) ).
cnf(i_0_5,plain,
( apply(X1,esk1_1(X1)) = apply(X1,esk2_1(X1))
| one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwuc1cex/lgb.p',i_0_5) ).
cnf(i_0_4,plain,
( one_to_one(X1)
| esk1_1(X1) != esk2_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwuc1cex/lgb.p',i_0_4) ).
cnf(c_0_57,plain,
( relation_dom(X1) = X2
| X1 != identity_relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
i_0_43 ).
cnf(c_0_58,plain,
function(identity_relation(X1)),
i_0_16 ).
cnf(c_0_59,plain,
relation(identity_relation(X1)),
i_0_9 ).
cnf(c_0_60,plain,
( apply(X1,X2) = X2
| X1 != identity_relation(X3)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,X3) ),
i_0_42 ).
cnf(c_0_61,negated_conjecture,
~ one_to_one(identity_relation(esk13_0)),
i_0_47 ).
cnf(c_0_62,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_6 ).
cnf(c_0_63,plain,
relation_dom(identity_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_57]),c_0_58]),c_0_59])]) ).
cnf(c_0_64,plain,
( one_to_one(X1)
| in(esk1_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_7 ).
cnf(c_0_65,plain,
( apply(identity_relation(X1),X2) = X2
| ~ in(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_60]),c_0_58]),c_0_59])]) ).
cnf(c_0_66,negated_conjecture,
in(esk2_1(identity_relation(esk13_0)),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_58]),c_0_59])]) ).
cnf(c_0_67,negated_conjecture,
in(esk1_1(identity_relation(esk13_0)),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_64]),c_0_63]),c_0_58]),c_0_59])]) ).
cnf(c_0_68,plain,
( apply(X1,esk1_1(X1)) = apply(X1,esk2_1(X1))
| one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_5 ).
cnf(c_0_69,plain,
apply(identity_relation(esk13_0),esk2_1(identity_relation(esk13_0))) = esk2_1(identity_relation(esk13_0)),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,plain,
apply(identity_relation(esk13_0),esk1_1(identity_relation(esk13_0))) = esk1_1(identity_relation(esk13_0)),
inference(spm,[status(thm)],[c_0_65,c_0_67]) ).
cnf(c_0_71,plain,
( one_to_one(X1)
| esk1_1(X1) != esk2_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_4 ).
cnf(c_0_72,negated_conjecture,
esk2_1(identity_relation(esk13_0)) = esk1_1(identity_relation(esk13_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_68]),c_0_58]),c_0_59])]),c_0_69]),c_0_70]) ).
cnf(c_0_73,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_58]),c_0_59])]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU019+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 14:27:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.38/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.38/2.35 # No SInE strategy applied
% 7.38/2.35 # Trying AutoSched0 for 150 seconds
% 7.38/2.35 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 7.38/2.35 # and selection function SelectNewComplexAHP.
% 7.38/2.35 #
% 7.38/2.35 # Preprocessing time : 0.013 s
% 7.38/2.35 # Presaturation interreduction done
% 7.38/2.35
% 7.38/2.35 # Proof found!
% 7.38/2.35 # SZS status Theorem
% 7.38/2.35 # SZS output start CNFRefutation
% See solution above
% 7.38/2.35 # Training examples: 0 positive, 0 negative
% 7.38/2.35
% 7.38/2.35 # -------------------------------------------------
% 7.38/2.35 # User time : 0.011 s
% 7.38/2.35 # System time : 0.007 s
% 7.38/2.35 # Total time : 0.018 s
% 7.38/2.35 # Maximum resident set size: 7124 pages
% 7.38/2.35
%------------------------------------------------------------------------------