TSTP Solution File: SEU290+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU290+1 : TPTP v8.1.0. Released v3.3.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:40:27 EDT 2022
% Result : Theorem 7.69s 2.34s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 20 unt; 3 nHn; 39 RR)
% Number of literals : 74 ( 21 equ; 39 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 : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 48 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_91,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_91) ).
cnf(i_0_53,plain,
empty(esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_53) ).
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/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_13) ).
cnf(i_0_93,negated_conjecture,
esk22_0 != empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_93) ).
cnf(i_0_95,negated_conjecture,
relation_of2_as_subset(esk24_0,esk21_0,esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_95) ).
cnf(i_0_96,negated_conjecture,
quasi_total(esk24_0,esk21_0,esk22_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_96) ).
cnf(i_0_17,plain,
( in(X1,X2)
| X2 != relation_rng(X3)
| X1 != apply(X3,X4)
| ~ function(X3)
| ~ relation(X3)
| ~ in(X4,relation_dom(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_17) ).
cnf(i_0_81,plain,
( relation_dom_as_subset(X1,X2,X3) = relation_dom(X3)
| ~ relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_81) ).
cnf(i_0_92,negated_conjecture,
~ in(apply(esk24_0,esk23_0),relation_rng(esk24_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_92) ).
cnf(i_0_97,negated_conjecture,
function(esk24_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_97) ).
cnf(i_0_83,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_83) ).
cnf(i_0_4,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_4) ).
cnf(i_0_29,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_29) ).
cnf(i_0_94,negated_conjecture,
in(esk23_0,esk21_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rytwh4x_/lgb.p',i_0_94) ).
cnf(c_0_112,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_91 ).
cnf(c_0_113,plain,
empty(esk9_0),
i_0_53 ).
cnf(c_0_114,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_115,plain,
empty_set = esk9_0,
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_116,negated_conjecture,
esk22_0 != empty_set,
i_0_93 ).
cnf(c_0_117,plain,
( relation_dom_as_subset(X1,X2,X3) = X1
| X2 = esk9_0
| ~ relation_of2_as_subset(X3,X1,X2)
| ~ quasi_total(X3,X1,X2) ),
inference(rw,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_118,negated_conjecture,
relation_of2_as_subset(esk24_0,esk21_0,esk22_0),
i_0_95 ).
cnf(c_0_119,negated_conjecture,
quasi_total(esk24_0,esk21_0,esk22_0),
i_0_96 ).
cnf(c_0_120,negated_conjecture,
esk9_0 != esk22_0,
inference(rw,[status(thm)],[c_0_116,c_0_115]) ).
cnf(c_0_121,plain,
( in(X1,X2)
| X2 != relation_rng(X3)
| X1 != apply(X3,X4)
| ~ function(X3)
| ~ relation(X3)
| ~ in(X4,relation_dom(X3)) ),
i_0_17 ).
cnf(c_0_122,plain,
( relation_dom_as_subset(X1,X2,X3) = relation_dom(X3)
| ~ relation_of2(X3,X1,X2) ),
i_0_81 ).
cnf(c_0_123,negated_conjecture,
relation_dom_as_subset(esk21_0,esk22_0,esk24_0) = esk21_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119])]),c_0_120]) ).
cnf(c_0_124,negated_conjecture,
~ in(apply(esk24_0,esk23_0),relation_rng(esk24_0)),
i_0_92 ).
cnf(c_0_125,plain,
( in(apply(X1,X2),relation_rng(X1))
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,relation_dom(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_121])]) ).
cnf(c_0_126,negated_conjecture,
function(esk24_0),
i_0_97 ).
cnf(c_0_127,plain,
( relation_dom(esk24_0) = esk21_0
| ~ relation_of2(esk24_0,esk21_0,esk22_0) ),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_128,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_83 ).
cnf(c_0_129,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
i_0_4 ).
cnf(c_0_130,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_29 ).
cnf(c_0_131,negated_conjecture,
( ~ relation(esk24_0)
| ~ in(esk23_0,relation_dom(esk24_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126])]) ).
cnf(c_0_132,plain,
relation_dom(esk24_0) = esk21_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_118])]) ).
cnf(c_0_133,negated_conjecture,
in(esk23_0,esk21_0),
i_0_94 ).
cnf(c_0_134,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_135,negated_conjecture,
~ relation(esk24_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_132]),c_0_133])]) ).
cnf(c_0_136,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_118]),c_0_135]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU290+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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:26:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.69/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.69/2.34 # No SInE strategy applied
% 7.69/2.34 # Trying AutoSched0 for 150 seconds
% 7.69/2.34 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 7.69/2.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.69/2.34 #
% 7.69/2.34 # Preprocessing time : 0.024 s
% 7.69/2.34 # Presaturation interreduction done
% 7.69/2.34
% 7.69/2.34 # Proof found!
% 7.69/2.34 # SZS status Theorem
% 7.69/2.34 # SZS output start CNFRefutation
% See solution above
% 7.69/2.34 # Training examples: 0 positive, 0 negative
% 7.69/2.34
% 7.69/2.34 # -------------------------------------------------
% 7.69/2.34 # User time : 0.030 s
% 7.69/2.34 # System time : 0.004 s
% 7.69/2.34 # Total time : 0.033 s
% 7.69/2.34 # Maximum resident set size: 7124 pages
% 7.69/2.34
%------------------------------------------------------------------------------