%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU023+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:03 EDT 2022
% Result : Theorem 7.62s 2.44s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 11 unt; 0 nHn; 24 RR)
% Number of literals : 67 ( 15 equ; 48 neg)
% Maximal clause size : 9 ( 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; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_66,plain,
( X1 = apply(X2,X3)
| X2 != function_inverse(X4)
| X3 != apply(X4,X1)
| ~ function(X4)
| ~ function(X2)
| ~ relation(X4)
| ~ relation(X2)
| ~ one_to_one(X4)
| ~ in(X1,relation_dom(X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-azmeed73/lgb.p',i_0_66) ).
cnf(i_0_7,plain,
( function(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-azmeed73/lgb.p',i_0_7) ).
cnf(i_0_8,plain,
( relation(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-azmeed73/lgb.p',i_0_8) ).
cnf(i_0_71,negated_conjecture,
( apply(function_inverse(esk17_0),apply(esk17_0,esk16_0)) != esk16_0
| apply(relation_composition(esk17_0,function_inverse(esk17_0)),esk16_0) != esk16_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-azmeed73/lgb.p',i_0_71) ).
cnf(i_0_52,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(X3,relation_dom(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-azmeed73/lgb.p',i_0_52) ).
cnf(i_0_75,negated_conjecture,
relation(esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-azmeed73/lgb.p',i_0_75) ).
cnf(i_0_74,negated_conjecture,
function(esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-azmeed73/lgb.p',i_0_74) ).
cnf(i_0_72,negated_conjecture,
in(esk16_0,relation_dom(esk17_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-azmeed73/lgb.p',i_0_72) ).
cnf(i_0_73,negated_conjecture,
one_to_one(esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-azmeed73/lgb.p',i_0_73) ).
cnf(c_0_85,plain,
( X1 = apply(X2,X3)
| X2 != function_inverse(X4)
| X3 != apply(X4,X1)
| ~ function(X4)
| ~ function(X2)
| ~ relation(X4)
| ~ relation(X2)
| ~ one_to_one(X4)
| ~ in(X1,relation_dom(X4)) ),
i_0_66 ).
cnf(c_0_86,plain,
( function(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_7 ).
cnf(c_0_87,plain,
( relation(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_8 ).
cnf(c_0_88,negated_conjecture,
( apply(function_inverse(esk17_0),apply(esk17_0,esk16_0)) != esk16_0
| apply(relation_composition(esk17_0,function_inverse(esk17_0)),esk16_0) != esk16_0 ),
i_0_71 ).
cnf(c_0_89,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(X3,relation_dom(X1)) ),
i_0_52 ).
cnf(c_0_90,negated_conjecture,
relation(esk17_0),
i_0_75 ).
cnf(c_0_91,negated_conjecture,
function(esk17_0),
i_0_74 ).
cnf(c_0_92,negated_conjecture,
in(esk16_0,relation_dom(esk17_0)),
i_0_72 ).
cnf(c_0_93,plain,
( apply(function_inverse(X1),apply(X1,X2)) = X2
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,relation_dom(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_85])]),c_0_86]),c_0_87]) ).
cnf(c_0_94,negated_conjecture,
one_to_one(esk17_0),
i_0_73 ).
cnf(c_0_95,negated_conjecture,
( apply(function_inverse(esk17_0),apply(esk17_0,esk16_0)) != esk16_0
| ~ relation(function_inverse(esk17_0))
| ~ function(function_inverse(esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_91]),c_0_92])]) ).
cnf(c_0_96,negated_conjecture,
apply(function_inverse(esk17_0),apply(esk17_0,esk16_0)) = esk16_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_92]),c_0_94]),c_0_90]),c_0_91])]) ).
cnf(c_0_97,negated_conjecture,
( ~ relation(function_inverse(esk17_0))
| ~ function(function_inverse(esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_98,plain,
~ relation(function_inverse(esk17_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_86]),c_0_90]),c_0_91])]) ).
cnf(c_0_99,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_87]),c_0_90]),c_0_91])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU023+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 : Sat Jun 18 23:06:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.62/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.62/2.44 # No SInE strategy applied
% 7.62/2.44 # Trying AutoSched0 for 150 seconds
% 7.62/2.44 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.62/2.44 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.62/2.44 #
% 7.62/2.44 # Preprocessing time : 0.024 s
% 7.62/2.44 # Presaturation interreduction done
% 7.62/2.44
% 7.62/2.44 # Proof found!
% 7.62/2.44 # SZS status Theorem
% 7.62/2.44 # SZS output start CNFRefutation
% See solution above
% 7.62/2.44 # Training examples: 0 positive, 0 negative
% 7.62/2.44
% 7.62/2.44 # -------------------------------------------------
% 7.62/2.44 # User time : 0.026 s
% 7.62/2.44 # System time : 0.005 s
% 7.62/2.44 # Total time : 0.031 s
% 7.62/2.44 # Maximum resident set size: 7120 pages
% 7.62/2.44
%------------------------------------------------------------------------------