TSTP Solution File: SEU046+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU046+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:11 EDT 2022
% Result : Theorem 7.62s 2.37s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 8 unt; 4 nHn; 19 RR)
% Number of literals : 79 ( 2 equ; 48 neg)
% Maximal clause size : 7 ( 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 : 55 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_7) ).
cnf(i_0_9,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_9) ).
cnf(i_0_8,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_8) ).
cnf(i_0_67,negated_conjecture,
( ~ subset(relation_dom(relation_rng_restriction(esk15_0,esk16_0)),relation_dom(esk16_0))
| ~ subset(relation_rng(relation_rng_restriction(esk15_0,esk16_0)),relation_rng(esk16_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_67) ).
cnf(i_0_66,plain,
( in(X1,relation_dom(X2))
| X3 != relation_rng_restriction(X4,X2)
| ~ function(X3)
| ~ function(X2)
| ~ relation(X3)
| ~ relation(X2)
| ~ in(X1,relation_dom(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_66) ).
cnf(i_0_10,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_10) ).
cnf(i_0_19,plain,
( function(relation_rng_restriction(X1,X2))
| ~ function(X2)
| ~ relation(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_19) ).
cnf(i_0_48,plain,
( subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2))
| ~ relation(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_48) ).
cnf(i_0_69,negated_conjecture,
relation(esk16_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_69) ).
cnf(i_0_47,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_47) ).
cnf(i_0_68,negated_conjecture,
function(esk16_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qs1l6orr/lgb.p',i_0_68) ).
cnf(c_0_81,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_7 ).
cnf(c_0_82,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_9 ).
cnf(c_0_83,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_8 ).
cnf(c_0_84,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X3)
| ~ subset(X3,X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_85,plain,
( in(esk1_2(X1,X2),X3)
| subset(X1,X2)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,negated_conjecture,
( ~ subset(relation_dom(relation_rng_restriction(esk15_0,esk16_0)),relation_dom(esk16_0))
| ~ subset(relation_rng(relation_rng_restriction(esk15_0,esk16_0)),relation_rng(esk16_0)) ),
i_0_67 ).
cnf(c_0_87,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_88,plain,
( in(X1,relation_dom(X2))
| X3 != relation_rng_restriction(X4,X2)
| ~ function(X3)
| ~ function(X2)
| ~ relation(X3)
| ~ relation(X2)
| ~ in(X1,relation_dom(X3)) ),
i_0_66 ).
cnf(c_0_89,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
i_0_10 ).
cnf(c_0_90,plain,
( function(relation_rng_restriction(X1,X2))
| ~ function(X2)
| ~ relation(X2) ),
i_0_19 ).
cnf(c_0_91,negated_conjecture,
( ~ subset(relation_rng(relation_rng_restriction(esk15_0,esk16_0)),relation_rng(esk16_0))
| ~ subset(relation_dom(relation_rng_restriction(esk15_0,esk16_0)),X1)
| ~ subset(X1,relation_dom(esk16_0)) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_92,plain,
( subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2))
| ~ relation(X2) ),
i_0_48 ).
cnf(c_0_93,negated_conjecture,
relation(esk16_0),
i_0_69 ).
cnf(c_0_94,plain,
( in(X1,relation_dom(X2))
| ~ function(X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(relation_rng_restriction(X3,X2))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_88]),c_0_89]),c_0_90]) ).
cnf(c_0_95,plain,
( ~ subset(relation_dom(relation_rng_restriction(esk15_0,esk16_0)),X1)
| ~ subset(X1,relation_dom(esk16_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93])]) ).
cnf(c_0_96,plain,
subset(X1,X1),
i_0_47 ).
cnf(c_0_97,plain,
( in(esk1_2(relation_dom(relation_rng_restriction(X1,X2)),X3),relation_dom(X2))
| subset(relation_dom(relation_rng_restriction(X1,X2)),X3)
| ~ function(X2)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_94,c_0_83]) ).
cnf(c_0_98,plain,
~ subset(relation_dom(relation_rng_restriction(esk15_0,esk16_0)),relation_dom(esk16_0)),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_99,plain,
( subset(relation_dom(relation_rng_restriction(X1,X2)),relation_dom(X2))
| ~ function(X2)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_81,c_0_97]) ).
cnf(c_0_100,negated_conjecture,
function(esk16_0),
i_0_68 ).
cnf(c_0_101,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU046+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 12:20:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.62/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.62/2.37 # No SInE strategy applied
% 7.62/2.37 # Trying AutoSched0 for 150 seconds
% 7.62/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S01BI
% 7.62/2.37 # and selection function PSelectMinOptimalNoXTypePred.
% 7.62/2.37 #
% 7.62/2.37 # Preprocessing time : 0.023 s
% 7.62/2.37 # Presaturation interreduction done
% 7.62/2.37
% 7.62/2.37 # Proof found!
% 7.62/2.37 # SZS status Theorem
% 7.62/2.37 # SZS output start CNFRefutation
% See solution above
% 7.62/2.37 # Training examples: 0 positive, 0 negative
% 7.62/2.37
% 7.62/2.37 # -------------------------------------------------
% 7.62/2.37 # User time : 0.030 s
% 7.62/2.37 # System time : 0.005 s
% 7.62/2.37 # Total time : 0.035 s
% 7.62/2.37 # Maximum resident set size: 7120 pages
% 7.62/2.37
%------------------------------------------------------------------------------