TSTP Solution File: SEU010+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU010+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:37:59 EDT 2022
% Result : Theorem 7.72s 2.42s
% Output : CNFRefutation 7.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 6 unt; 0 nHn; 12 RR)
% Number of literals : 26 ( 11 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_55,plain,
( relation_composition(identity_relation(X1),X2) = X2
| ~ relation(X2)
| ~ subset(relation_dom(X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eq7jaitf/input.p',i_0_55) ).
cnf(i_0_29,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eq7jaitf/input.p',i_0_29) ).
cnf(i_0_52,negated_conjecture,
( relation_composition(esk10_0,identity_relation(relation_rng(esk10_0))) != esk10_0
| relation_composition(identity_relation(relation_dom(esk10_0)),esk10_0) != esk10_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eq7jaitf/input.p',i_0_52) ).
cnf(i_0_54,negated_conjecture,
relation(esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eq7jaitf/input.p',i_0_54) ).
cnf(i_0_56,plain,
( relation_composition(X1,identity_relation(X2)) = X1
| ~ relation(X1)
| ~ subset(relation_rng(X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eq7jaitf/input.p',i_0_56) ).
cnf(c_0_62,plain,
( relation_composition(identity_relation(X1),X2) = X2
| ~ relation(X2)
| ~ subset(relation_dom(X2),X1) ),
i_0_55 ).
cnf(c_0_63,plain,
subset(X1,X1),
i_0_29 ).
cnf(c_0_64,negated_conjecture,
( relation_composition(esk10_0,identity_relation(relation_rng(esk10_0))) != esk10_0
| relation_composition(identity_relation(relation_dom(esk10_0)),esk10_0) != esk10_0 ),
i_0_52 ).
cnf(c_0_65,plain,
( relation_composition(identity_relation(relation_dom(X1)),X1) = X1
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
relation(esk10_0),
i_0_54 ).
cnf(c_0_67,plain,
( relation_composition(X1,identity_relation(X2)) = X1
| ~ relation(X1)
| ~ subset(relation_rng(X1),X2) ),
i_0_56 ).
cnf(c_0_68,negated_conjecture,
relation_composition(esk10_0,identity_relation(relation_rng(esk10_0))) != esk10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]) ).
cnf(c_0_69,plain,
( relation_composition(X1,identity_relation(relation_rng(X1))) = X1
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_63]) ).
cnf(c_0_70,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU010+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n009.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 00:14:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.72/2.42 # ENIGMATIC: Solved by autoschedule:
% 7.72/2.42 # No SInE strategy applied
% 7.72/2.42 # Trying AutoSched0 for 150 seconds
% 7.72/2.42 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.72/2.42 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.72/2.42 #
% 7.72/2.42 # Preprocessing time : 0.013 s
% 7.72/2.42
% 7.72/2.42 # Proof found!
% 7.72/2.42 # SZS status Theorem
% 7.72/2.42 # SZS output start CNFRefutation
% See solution above
% 7.72/2.42 # Training examples: 0 positive, 0 negative
% 7.72/2.42
% 7.72/2.42 # -------------------------------------------------
% 7.72/2.42 # User time : 0.012 s
% 7.72/2.42 # System time : 0.008 s
% 7.72/2.42 # Total time : 0.021 s
% 7.72/2.42 # Maximum resident set size: 7116 pages
% 7.72/2.42
%------------------------------------------------------------------------------