TSTP Solution File: SEU020+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU020+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 8.02s 2.55s
% Output : CNFRefutation 8.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 18 unt; 0 nHn; 18 RR)
% Number of literals : 44 ( 6 equ; 24 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 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 : 12 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_44,plain,
( subset(relation_rng(X1),relation_dom(X2))
| relation_dom(relation_composition(X1,X2)) != relation_dom(X1)
| ~ function(X1)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_44) ).
cnf(i_0_52,negated_conjecture,
identity_relation(relation_dom(esk10_0)) = relation_composition(esk10_0,esk11_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_52) ).
cnf(i_0_60,plain,
relation_dom(identity_relation(X1)) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_60) ).
cnf(i_0_54,negated_conjecture,
relation(esk11_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_54) ).
cnf(i_0_56,negated_conjecture,
relation(esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_56) ).
cnf(i_0_53,negated_conjecture,
function(esk11_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_53) ).
cnf(i_0_55,negated_conjecture,
function(esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_55) ).
cnf(i_0_48,plain,
( one_to_one(X1)
| ~ function(X1)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X2)
| ~ one_to_one(relation_composition(X1,X2))
| ~ subset(relation_rng(X1),relation_dom(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_48) ).
cnf(i_0_50,plain,
one_to_one(identity_relation(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_50) ).
cnf(i_0_51,negated_conjecture,
~ one_to_one(esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xioeoc7m/lgb.p',i_0_51) ).
cnf(c_0_71,plain,
( subset(relation_rng(X1),relation_dom(X2))
| relation_dom(relation_composition(X1,X2)) != relation_dom(X1)
| ~ function(X1)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X2) ),
i_0_44 ).
cnf(c_0_72,negated_conjecture,
identity_relation(relation_dom(esk10_0)) = relation_composition(esk10_0,esk11_0),
i_0_52 ).
cnf(c_0_73,plain,
relation_dom(identity_relation(X1)) = X1,
i_0_60 ).
cnf(c_0_74,negated_conjecture,
relation(esk11_0),
i_0_54 ).
cnf(c_0_75,negated_conjecture,
relation(esk10_0),
i_0_56 ).
cnf(c_0_76,negated_conjecture,
function(esk11_0),
i_0_53 ).
cnf(c_0_77,negated_conjecture,
function(esk10_0),
i_0_55 ).
cnf(c_0_78,plain,
( one_to_one(X1)
| ~ function(X1)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X2)
| ~ one_to_one(relation_composition(X1,X2))
| ~ subset(relation_rng(X1),relation_dom(X2)) ),
i_0_48 ).
cnf(c_0_79,negated_conjecture,
subset(relation_rng(esk10_0),relation_dom(esk11_0)),
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_71,c_0_72]),c_0_73]),c_0_74]),c_0_75]),c_0_76]),c_0_77])]) ).
cnf(c_0_80,plain,
one_to_one(identity_relation(X1)),
i_0_50 ).
cnf(c_0_81,negated_conjecture,
~ one_to_one(esk10_0),
i_0_51 ).
cnf(c_0_82,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_72]),c_0_80]),c_0_74]),c_0_75]),c_0_76]),c_0_77])]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU020+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 10:41:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.02/2.55 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.02/2.55 # No SInE strategy applied
% 8.02/2.55 # Trying AutoSched0 for 150 seconds
% 8.02/2.55 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 8.02/2.55 # and selection function SelectComplexG.
% 8.02/2.55 #
% 8.02/2.55 # Preprocessing time : 0.024 s
% 8.02/2.55
% 8.02/2.55 # Proof found!
% 8.02/2.55 # SZS status Theorem
% 8.02/2.55 # SZS output start CNFRefutation
% See solution above
% 8.02/2.55 # Training examples: 0 positive, 0 negative
% 8.02/2.55
% 8.02/2.55 # -------------------------------------------------
% 8.02/2.55 # User time : 0.031 s
% 8.02/2.55 # System time : 0.009 s
% 8.02/2.55 # Total time : 0.039 s
% 8.02/2.55 # Maximum resident set size: 7120 pages
% 8.02/2.55
%------------------------------------------------------------------------------