TSTP Solution File: SEU204+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU204+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:39:30 EDT 2022
% Result : Theorem 17.66s 3.67s
% Output : CNFRefutation 17.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 7 unt; 3 nHn; 14 RR)
% Number of literals : 41 ( 2 equ; 20 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 38 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_261,lemma,
( in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ydst_kik/input.p',i_0_261) ).
cnf(i_0_4,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ydst_kik/input.p',i_0_4) ).
cnf(i_0_251,lemma,
( in(unordered_pair(unordered_pair(esk58_3(X1,X2,X3),X1),unordered_pair(esk58_3(X1,X2,X3),esk58_3(X1,X2,X3))),X3)
| ~ relation(X3)
| ~ in(X1,relation_image(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ydst_kik/input.p',i_0_251) ).
cnf(i_0_87,plain,
( subset(X1,X2)
| in(esk30_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ydst_kik/input.p',i_0_87) ).
cnf(i_0_86,plain,
( subset(X1,X2)
| ~ in(esk30_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ydst_kik/input.p',i_0_86) ).
cnf(i_0_253,negated_conjecture,
~ subset(relation_image(esk60_0,esk59_0),relation_rng(esk60_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ydst_kik/input.p',i_0_253) ).
cnf(i_0_254,negated_conjecture,
relation(esk60_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ydst_kik/input.p',i_0_254) ).
cnf(c_0_269,lemma,
( in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2) ),
i_0_261 ).
cnf(c_0_270,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_4 ).
cnf(c_0_271,lemma,
( in(unordered_pair(unordered_pair(esk58_3(X1,X2,X3),X1),unordered_pair(esk58_3(X1,X2,X3),esk58_3(X1,X2,X3))),X3)
| ~ relation(X3)
| ~ in(X1,relation_image(X3,X2)) ),
i_0_251 ).
cnf(c_0_272,plain,
( in(X1,relation_rng(X2))
| ~ in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X3,X3)),X2)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_269,c_0_270]) ).
cnf(c_0_273,lemma,
( in(unordered_pair(unordered_pair(X1,esk58_3(X1,X2,X3)),unordered_pair(esk58_3(X1,X2,X3),esk58_3(X1,X2,X3))),X3)
| ~ in(X1,relation_image(X3,X2))
| ~ relation(X3) ),
inference(rw,[status(thm)],[c_0_271,c_0_270]) ).
cnf(c_0_274,lemma,
( in(X1,relation_rng(X2))
| ~ in(X1,relation_image(X2,X3))
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_272,c_0_273]) ).
cnf(c_0_275,plain,
( subset(X1,X2)
| in(esk30_2(X1,X2),X1) ),
i_0_87 ).
cnf(c_0_276,plain,
( subset(X1,X2)
| ~ in(esk30_2(X1,X2),X2) ),
i_0_86 ).
cnf(c_0_277,plain,
( in(esk30_2(relation_image(X1,X2),X3),relation_rng(X1))
| subset(relation_image(X1,X2),X3)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_274,c_0_275]) ).
cnf(c_0_278,negated_conjecture,
~ subset(relation_image(esk60_0,esk59_0),relation_rng(esk60_0)),
i_0_253 ).
cnf(c_0_279,plain,
( subset(relation_image(X1,X2),relation_rng(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_276,c_0_277]) ).
cnf(c_0_280,negated_conjecture,
relation(esk60_0),
i_0_254 ).
cnf(c_0_281,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_278,c_0_279]),c_0_280])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU204+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n015.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 : Sun Jun 19 12:04:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 17.66/3.67 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 17.66/3.67 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 34; version: 991; iters: 150)
% 17.66/3.67 # Preprocessing time : 1.201 s
% 17.66/3.67
% 17.66/3.67 # Proof found!
% 17.66/3.67 # SZS status Theorem
% 17.66/3.67 # SZS output start CNFRefutation
% See solution above
% 17.66/3.67 # Training examples: 0 positive, 0 negative
% 17.66/3.67
% 17.66/3.67 # -------------------------------------------------
% 17.66/3.67 # User time : 1.073 s
% 17.66/3.67 # System time : 0.142 s
% 17.66/3.67 # Total time : 1.215 s
% 17.66/3.67 # ...preprocessing : 1.201 s
% 17.66/3.67 # ...main loop : 0.014 s
% 17.66/3.67 # Maximum resident set size: 177260 pages
% 17.66/3.67
%------------------------------------------------------------------------------