TSTP Solution File: SEU194+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU194+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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.81s 3.32s
% Output : CNFRefutation 16.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 9 unt; 10 nHn; 16 RR)
% Number of literals : 73 ( 20 equ; 29 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 63 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z45i71q2/input.p',i_0_38) ).
cnf(i_0_4,plain,
( X1 = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z45i71q2/input.p',i_0_4) ).
cnf(i_0_42,negated_conjecture,
relation(esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z45i71q2/input.p',i_0_42) ).
cnf(i_0_39,plain,
( in(X1,X2)
| ~ relation(X3)
| ~ in(X1,relation_dom(relation_dom_restriction(X3,X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z45i71q2/input.p',i_0_39) ).
cnf(i_0_5,plain,
( X1 = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z45i71q2/input.p',i_0_5) ).
cnf(i_0_6,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk1_3(X2,X3,X1),X1)
| ~ in(esk1_3(X2,X3,X1),X3)
| ~ in(esk1_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z45i71q2/input.p',i_0_6) ).
cnf(i_0_37,plain,
( in(X1,relation_dom(relation_dom_restriction(X2,X3)))
| ~ relation(X2)
| ~ in(X1,X3)
| ~ in(X1,relation_dom(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z45i71q2/input.p',i_0_37) ).
cnf(i_0_41,negated_conjecture,
relation_dom(relation_dom_restriction(esk9_0,esk8_0)) != set_intersection2(relation_dom(esk9_0),esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z45i71q2/input.p',i_0_41) ).
cnf(i_0_3,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z45i71q2/input.p',i_0_3) ).
cnf(c_0_52,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X3))) ),
i_0_38 ).
cnf(c_0_53,plain,
( X1 = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X3) ),
i_0_4 ).
cnf(c_0_54,plain,
( relation_dom(relation_dom_restriction(X1,X2)) = set_intersection2(X3,X4)
| in(esk1_3(X3,X4,relation_dom(relation_dom_restriction(X1,X2))),relation_dom(X1))
| in(esk1_3(X3,X4,relation_dom(relation_dom_restriction(X1,X2))),X4)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
relation(esk9_0),
i_0_42 ).
cnf(c_0_56,negated_conjecture,
( relation_dom(relation_dom_restriction(esk9_0,X1)) = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,relation_dom(relation_dom_restriction(esk9_0,X1))),relation_dom(esk9_0))
| in(esk1_3(X2,X3,relation_dom(relation_dom_restriction(esk9_0,X1))),X3) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
( in(X1,X2)
| ~ relation(X3)
| ~ in(X1,relation_dom(relation_dom_restriction(X3,X2))) ),
i_0_39 ).
cnf(c_0_58,plain,
( X1 = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,X1),X1)
| in(esk1_3(X2,X3,X1),X2) ),
i_0_5 ).
cnf(c_0_59,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk1_3(X2,X3,X1),X1)
| ~ in(esk1_3(X2,X3,X1),X3)
| ~ in(esk1_3(X2,X3,X1),X2) ),
i_0_6 ).
cnf(c_0_60,negated_conjecture,
( relation_dom(relation_dom_restriction(esk9_0,X1)) = set_intersection2(X2,relation_dom(esk9_0))
| in(esk1_3(X2,relation_dom(esk9_0),relation_dom(relation_dom_restriction(esk9_0,X1))),relation_dom(esk9_0)) ),
inference(ef,[status(thm)],[c_0_56]) ).
cnf(c_0_61,plain,
( relation_dom(relation_dom_restriction(X1,X2)) = set_intersection2(X3,X4)
| in(esk1_3(X3,X4,relation_dom(relation_dom_restriction(X1,X2))),X3)
| in(esk1_3(X3,X4,relation_dom(relation_dom_restriction(X1,X2))),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( relation_dom(relation_dom_restriction(esk9_0,X1)) = set_intersection2(X2,relation_dom(esk9_0))
| ~ in(esk1_3(X2,relation_dom(esk9_0),relation_dom(relation_dom_restriction(esk9_0,X1))),relation_dom(relation_dom_restriction(esk9_0,X1)))
| ~ in(esk1_3(X2,relation_dom(esk9_0),relation_dom(relation_dom_restriction(esk9_0,X1))),X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( in(X1,relation_dom(relation_dom_restriction(X2,X3)))
| ~ relation(X2)
| ~ in(X1,X3)
| ~ in(X1,relation_dom(X2)) ),
i_0_37 ).
cnf(c_0_64,negated_conjecture,
( relation_dom(relation_dom_restriction(esk9_0,X1)) = set_intersection2(X2,X3)
| in(esk1_3(X2,X3,relation_dom(relation_dom_restriction(esk9_0,X1))),X1)
| in(esk1_3(X2,X3,relation_dom(relation_dom_restriction(esk9_0,X1))),X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_55]) ).
cnf(c_0_65,negated_conjecture,
relation_dom(relation_dom_restriction(esk9_0,esk8_0)) != set_intersection2(relation_dom(esk9_0),esk8_0),
i_0_41 ).
cnf(c_0_66,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_3 ).
cnf(c_0_67,plain,
( relation_dom(relation_dom_restriction(esk9_0,X1)) = set_intersection2(X2,relation_dom(esk9_0))
| ~ in(esk1_3(X2,relation_dom(esk9_0),relation_dom(relation_dom_restriction(esk9_0,X1))),X2)
| ~ in(esk1_3(X2,relation_dom(esk9_0),relation_dom(relation_dom_restriction(esk9_0,X1))),X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_55])]),c_0_60]) ).
cnf(c_0_68,negated_conjecture,
( relation_dom(relation_dom_restriction(esk9_0,X1)) = set_intersection2(X1,X2)
| in(esk1_3(X1,X2,relation_dom(relation_dom_restriction(esk9_0,X1))),X1) ),
inference(ef,[status(thm)],[c_0_64]) ).
cnf(c_0_69,negated_conjecture,
relation_dom(relation_dom_restriction(esk9_0,esk8_0)) != set_intersection2(esk8_0,relation_dom(esk9_0)),
inference(rw,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
relation_dom(relation_dom_restriction(esk9_0,X1)) = set_intersection2(X1,relation_dom(esk9_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_68]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU194+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n011.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jun 20 10:28:11 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 16.81/3.32 # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 16.81/3.32 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 37; version: 991; iters: 150)
% 16.81/3.32 # Preprocessing time : 0.864 s
% 16.81/3.32
% 16.81/3.32 # Proof found!
% 16.81/3.32 # SZS status Theorem
% 16.81/3.32 # SZS output start CNFRefutation
% See solution above
% 16.81/3.32 # Training examples: 0 positive, 0 negative
% 16.81/3.32
% 16.81/3.32 # -------------------------------------------------
% 16.81/3.32 # User time : 1.082 s
% 16.81/3.32 # System time : 0.121 s
% 16.81/3.32 # Total time : 1.203 s
% 16.81/3.32 # ...preprocessing : 0.864 s
% 16.81/3.32 # ...main loop : 0.339 s
% 16.81/3.32 # Maximum resident set size: 168340 pages
% 16.81/3.32
%------------------------------------------------------------------------------