%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU193+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:23 EDT 2022
% Result : Theorem 16.57s 3.70s
% Output : CNFRefutation 16.57s
% 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_20,plain,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X3)
| X4 != relation_dom_restriction(X3,X5)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aido2mfr/input.p',i_0_20) ).
cnf(i_0_4,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aido2mfr/input.p',i_0_4) ).
cnf(i_0_24,plain,
( unordered_pair(unordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),unordered_pair(esk5_2(X1,X2),esk5_2(X1,X2))) = X2
| ~ relation(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aido2mfr/input.p',i_0_24) ).
cnf(i_0_145,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aido2mfr/input.p',i_0_145) ).
cnf(i_0_71,plain,
( subset(X1,X2)
| in(esk23_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aido2mfr/input.p',i_0_71) ).
cnf(i_0_70,plain,
( subset(X1,X2)
| ~ in(esk23_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aido2mfr/input.p',i_0_70) ).
cnf(i_0_312,negated_conjecture,
~ subset(relation_dom_restriction(esk57_0,esk56_0),esk57_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aido2mfr/input.p',i_0_312) ).
cnf(i_0_313,negated_conjecture,
relation(esk57_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aido2mfr/input.p',i_0_313) ).
cnf(c_0_322,plain,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X3)
| X4 != relation_dom_restriction(X3,X5)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X4) ),
i_0_20 ).
cnf(c_0_323,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_4 ).
cnf(c_0_324,plain,
( unordered_pair(unordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),unordered_pair(esk5_2(X1,X2),esk5_2(X1,X2))) = X2
| ~ relation(X1)
| ~ in(X2,X1) ),
i_0_24 ).
cnf(c_0_325,plain,
( in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2)),X3)
| X4 != relation_dom_restriction(X3,X5)
| ~ in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2)),X4)
| ~ relation(X4)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_322,c_0_323]) ).
cnf(c_0_326,plain,
( unordered_pair(unordered_pair(esk5_2(X1,X2),esk5_2(X1,X2)),unordered_pair(esk5_2(X1,X2),esk6_2(X1,X2))) = X2
| ~ in(X2,X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_324,c_0_323]) ).
cnf(c_0_327,plain,
( in(X1,X2)
| X3 != relation_dom_restriction(X2,X4)
| ~ in(X1,X3)
| ~ in(X1,X5)
| ~ relation(X3)
| ~ relation(X2)
| ~ relation(X5) ),
inference(spm,[status(thm)],[c_0_325,c_0_326]) ).
cnf(c_0_328,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
i_0_145 ).
cnf(c_0_329,plain,
( in(X1,X2)
| ~ in(X1,relation_dom_restriction(X2,X3))
| ~ in(X1,X4)
| ~ relation(X2)
| ~ relation(X4) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_327]),c_0_328]) ).
cnf(c_0_330,plain,
( subset(X1,X2)
| in(esk23_2(X1,X2),X1) ),
i_0_71 ).
cnf(c_0_331,plain,
( in(esk23_2(relation_dom_restriction(X1,X2),X3),X1)
| subset(relation_dom_restriction(X1,X2),X3)
| ~ in(esk23_2(relation_dom_restriction(X1,X2),X3),X4)
| ~ relation(X1)
| ~ relation(X4) ),
inference(spm,[status(thm)],[c_0_329,c_0_330]) ).
cnf(c_0_332,plain,
( subset(X1,X2)
| ~ in(esk23_2(X1,X2),X2) ),
i_0_70 ).
cnf(c_0_333,plain,
( in(esk23_2(relation_dom_restriction(X1,X2),X3),X1)
| subset(relation_dom_restriction(X1,X2),X3)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_331,c_0_330]),c_0_328]) ).
cnf(c_0_334,negated_conjecture,
~ subset(relation_dom_restriction(esk57_0,esk56_0),esk57_0),
i_0_312 ).
cnf(c_0_335,plain,
( subset(relation_dom_restriction(X1,X2),X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_332,c_0_333]) ).
cnf(c_0_336,negated_conjecture,
relation(esk57_0),
i_0_313 ).
cnf(c_0_337,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_334,c_0_335]),c_0_336])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU193+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 02:05:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 16.57/3.70 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 16.57/3.70 # 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)
% 16.57/3.70 # Preprocessing time : 1.231 s
% 16.57/3.70
% 16.57/3.70 # Proof found!
% 16.57/3.70 # SZS status Theorem
% 16.57/3.70 # SZS output start CNFRefutation
% See solution above
% 16.57/3.70 # Training examples: 0 positive, 0 negative
% 16.57/3.70
% 16.57/3.70 # -------------------------------------------------
% 16.57/3.70 # User time : 1.096 s
% 16.57/3.70 # System time : 0.146 s
% 16.57/3.70 # Total time : 1.242 s
% 16.57/3.70 # ...preprocessing : 1.231 s
% 16.57/3.70 # ...main loop : 0.012 s
% 16.57/3.70 # Maximum resident set size: 177156 pages
% 16.57/3.70
%------------------------------------------------------------------------------