TSTP Solution File: SEU292+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU292+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:40:28 EDT 2022
% Result : Theorem 7.92s 2.41s
% Output : CNFRefutation 7.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of clauses : 44 ( 23 unt; 4 nHn; 44 RR)
% Number of literals : 84 ( 22 equ; 42 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 55 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_97,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_97) ).
cnf(i_0_50,plain,
empty(esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_50) ).
cnf(i_0_13,plain,
( X1 = empty_set
| relation_dom_as_subset(X2,X1,X3) = X2
| ~ relation_of2_as_subset(X3,X2,X1)
| ~ quasi_total(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_13) ).
cnf(i_0_78,plain,
( relation_dom_as_subset(X1,X2,X3) = relation_dom(X3)
| ~ relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_78) ).
cnf(i_0_79,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_79) ).
cnf(i_0_84,negated_conjecture,
esk19_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_84) ).
cnf(i_0_4,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_4) ).
cnf(i_0_23,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_23) ).
cnf(i_0_89,negated_conjecture,
quasi_total(esk21_0,esk18_0,esk19_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_89) ).
cnf(i_0_88,negated_conjecture,
relation_of2_as_subset(esk21_0,esk18_0,esk19_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_88) ).
cnf(i_0_91,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/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_91) ).
cnf(i_0_90,negated_conjecture,
function(esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_90) ).
cnf(i_0_83,negated_conjecture,
apply(relation_composition(esk21_0,esk22_0),esk20_0) != apply(esk22_0,apply(esk21_0,esk20_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_83) ).
cnf(i_0_87,negated_conjecture,
relation(esk22_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_87) ).
cnf(i_0_86,negated_conjecture,
function(esk22_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_86) ).
cnf(i_0_85,negated_conjecture,
in(esk20_0,esk18_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_85) ).
cnf(i_0_80,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k3g0gfpd/lgb.p',i_0_80) ).
cnf(c_0_115,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_97 ).
cnf(c_0_116,plain,
empty(esk6_0),
i_0_50 ).
cnf(c_0_117,plain,
( X1 = empty_set
| relation_dom_as_subset(X2,X1,X3) = X2
| ~ relation_of2_as_subset(X3,X2,X1)
| ~ quasi_total(X3,X2,X1) ),
i_0_13 ).
cnf(c_0_118,plain,
empty_set = esk6_0,
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_119,plain,
( relation_dom_as_subset(X1,X2,X3) = relation_dom(X3)
| ~ relation_of2(X3,X1,X2) ),
i_0_78 ).
cnf(c_0_120,plain,
( relation_dom_as_subset(X1,X2,X3) = X1
| X2 = esk6_0
| ~ relation_of2_as_subset(X3,X1,X2)
| ~ quasi_total(X3,X1,X2) ),
inference(rw,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_121,plain,
( relation_of2_as_subset(X1,X2,X3)
| ~ relation_of2(X1,X2,X3) ),
i_0_79 ).
cnf(c_0_122,negated_conjecture,
esk19_0 != empty_set,
i_0_84 ).
cnf(c_0_123,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
i_0_4 ).
cnf(c_0_124,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_23 ).
cnf(c_0_125,plain,
( X1 = relation_dom(X2)
| X3 = esk6_0
| ~ relation_of2(X2,X1,X3)
| ~ quasi_total(X2,X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_121]) ).
cnf(c_0_126,negated_conjecture,
quasi_total(esk21_0,esk18_0,esk19_0),
i_0_89 ).
cnf(c_0_127,negated_conjecture,
esk6_0 != esk19_0,
inference(rw,[status(thm)],[c_0_122,c_0_118]) ).
cnf(c_0_128,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_129,negated_conjecture,
relation_of2_as_subset(esk21_0,esk18_0,esk19_0),
i_0_88 ).
cnf(c_0_130,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_91 ).
cnf(c_0_131,negated_conjecture,
( relation_dom(esk21_0) = esk18_0
| ~ relation_of2(esk21_0,esk18_0,esk19_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127]) ).
cnf(c_0_132,negated_conjecture,
relation(esk21_0),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_133,negated_conjecture,
function(esk21_0),
i_0_90 ).
cnf(c_0_134,negated_conjecture,
apply(relation_composition(esk21_0,esk22_0),esk20_0) != apply(esk22_0,apply(esk21_0,esk20_0)),
i_0_83 ).
cnf(c_0_135,plain,
( apply(relation_composition(esk21_0,X1),X2) = apply(X1,apply(esk21_0,X2))
| ~ relation_of2(esk21_0,esk18_0,esk19_0)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,esk18_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132]),c_0_133])]) ).
cnf(c_0_136,negated_conjecture,
relation(esk22_0),
i_0_87 ).
cnf(c_0_137,negated_conjecture,
function(esk22_0),
i_0_86 ).
cnf(c_0_138,negated_conjecture,
in(esk20_0,esk18_0),
i_0_85 ).
cnf(c_0_139,negated_conjecture,
~ relation_of2(esk21_0,esk18_0,esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]),c_0_137]),c_0_138])]) ).
cnf(c_0_140,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_80 ).
cnf(c_0_141,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_129])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU292+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n008.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 01:43:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.92/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.92/2.41 # No SInE strategy applied
% 7.92/2.41 # Trying AutoSched0 for 150 seconds
% 7.92/2.41 # AutoSched0-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y
% 7.92/2.41 # and selection function SelectMaxLComplexAPPNTNp.
% 7.92/2.41 #
% 7.92/2.41 # Preprocessing time : 0.013 s
% 7.92/2.41
% 7.92/2.41 # Proof found!
% 7.92/2.41 # SZS status Theorem
% 7.92/2.41 # SZS output start CNFRefutation
% See solution above
% 7.92/2.41 # Training examples: 0 positive, 0 negative
% 7.92/2.41
% 7.92/2.41 # -------------------------------------------------
% 7.92/2.41 # User time : 0.018 s
% 7.92/2.41 # System time : 0.003 s
% 7.92/2.41 # Total time : 0.021 s
% 7.92/2.41 # Maximum resident set size: 7128 pages
% 7.92/2.41
%------------------------------------------------------------------------------