TSTP Solution File: SEU199+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU199+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:27 EDT 2022
% Result : Theorem 17.36s 3.57s
% Output : CNFRefutation 17.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 7 unt; 4 nHn; 16 RR)
% Number of literals : 65 ( 9 equ; 39 neg)
% Maximal clause size : 7 ( 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-2 aty)
% Number of variables : 55 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,plain,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X3)
| X4 != relation_rng_restriction(X5,X3)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_zg1g6ps/input.p',i_0_26) ).
cnf(i_0_4,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_zg1g6ps/input.p',i_0_4) ).
cnf(i_0_30,plain,
( unordered_pair(unordered_pair(esk7_2(X1,X2),esk8_2(X1,X2)),unordered_pair(esk7_2(X1,X2),esk7_2(X1,X2))) = X2
| ~ relation(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_zg1g6ps/input.p',i_0_30) ).
cnf(i_0_157,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_zg1g6ps/input.p',i_0_157) ).
cnf(i_0_81,plain,
( subset(X1,X2)
| in(esk27_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_zg1g6ps/input.p',i_0_81) ).
cnf(i_0_80,plain,
( subset(X1,X2)
| ~ in(esk27_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_zg1g6ps/input.p',i_0_80) ).
cnf(i_0_230,negated_conjecture,
~ subset(relation_rng_restriction(esk54_0,esk55_0),esk55_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_zg1g6ps/input.p',i_0_230) ).
cnf(i_0_231,negated_conjecture,
relation(esk55_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_zg1g6ps/input.p',i_0_231) ).
cnf(c_0_240,plain,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X3)
| X4 != relation_rng_restriction(X5,X3)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X4) ),
i_0_26 ).
cnf(c_0_241,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_4 ).
cnf(c_0_242,plain,
( unordered_pair(unordered_pair(esk7_2(X1,X2),esk8_2(X1,X2)),unordered_pair(esk7_2(X1,X2),esk7_2(X1,X2))) = X2
| ~ relation(X1)
| ~ in(X2,X1) ),
i_0_30 ).
cnf(c_0_243,plain,
( in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2)),X3)
| X4 != relation_rng_restriction(X5,X3)
| ~ in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2)),X4)
| ~ relation(X4)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_240,c_0_241]) ).
cnf(c_0_244,plain,
( unordered_pair(unordered_pair(esk7_2(X1,X2),esk7_2(X1,X2)),unordered_pair(esk7_2(X1,X2),esk8_2(X1,X2))) = X2
| ~ in(X2,X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_242,c_0_241]) ).
cnf(c_0_245,plain,
( in(X1,X2)
| X3 != relation_rng_restriction(X4,X2)
| ~ in(X1,X3)
| ~ in(X1,X5)
| ~ relation(X3)
| ~ relation(X2)
| ~ relation(X5) ),
inference(spm,[status(thm)],[c_0_243,c_0_244]) ).
cnf(c_0_246,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
i_0_157 ).
cnf(c_0_247,plain,
( in(X1,X2)
| ~ in(X1,relation_rng_restriction(X3,X2))
| ~ in(X1,X4)
| ~ relation(X2)
| ~ relation(X4) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_245]),c_0_246]) ).
cnf(c_0_248,plain,
( subset(X1,X2)
| in(esk27_2(X1,X2),X1) ),
i_0_81 ).
cnf(c_0_249,plain,
( in(esk27_2(relation_rng_restriction(X1,X2),X3),X2)
| subset(relation_rng_restriction(X1,X2),X3)
| ~ in(esk27_2(relation_rng_restriction(X1,X2),X3),X4)
| ~ relation(X2)
| ~ relation(X4) ),
inference(spm,[status(thm)],[c_0_247,c_0_248]) ).
cnf(c_0_250,plain,
( subset(X1,X2)
| ~ in(esk27_2(X1,X2),X2) ),
i_0_80 ).
cnf(c_0_251,plain,
( in(esk27_2(relation_rng_restriction(X1,X2),X3),X2)
| subset(relation_rng_restriction(X1,X2),X3)
| ~ relation(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_248]),c_0_246]) ).
cnf(c_0_252,negated_conjecture,
~ subset(relation_rng_restriction(esk54_0,esk55_0),esk55_0),
i_0_230 ).
cnf(c_0_253,plain,
( subset(relation_rng_restriction(X1,X2),X2)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_250,c_0_251]) ).
cnf(c_0_254,negated_conjecture,
relation(esk55_0),
i_0_231 ).
cnf(c_0_255,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_253]),c_0_254])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU199+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 : Mon Jun 20 03:06:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 17.36/3.57 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 17.36/3.57 # 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: 30; version: 991; iters: 150)
% 17.36/3.57 # Preprocessing time : 1.173 s
% 17.36/3.57
% 17.36/3.57 # Proof found!
% 17.36/3.57 # SZS status Theorem
% 17.36/3.57 # SZS output start CNFRefutation
% See solution above
% 17.36/3.57 # Training examples: 0 positive, 0 negative
% 17.36/3.57
% 17.36/3.57 # -------------------------------------------------
% 17.36/3.57 # User time : 1.046 s
% 17.36/3.57 # System time : 0.147 s
% 17.36/3.57 # Total time : 1.192 s
% 17.36/3.57 # ...preprocessing : 1.173 s
% 17.36/3.57 # ...main loop : 0.019 s
% 17.36/3.57 # Maximum resident set size: 178972 pages
% 17.36/3.57
%------------------------------------------------------------------------------