TSTP Solution File: SEU187+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU187+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:19 EDT 2022
% Result : Theorem 7.31s 2.36s
% Output : CNFRefutation 7.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 12 unt; 2 nHn; 20 RR)
% Number of literals : 52 ( 22 equ; 34 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 37 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_266,lemma,
( set_difference(X1,unordered_pair(X2,X2)) != X1
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp4sjufa/lgb.p',i_0_266) ).
cnf(i_0_254,plain,
set_difference(empty_set,X1) = empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp4sjufa/lgb.p',i_0_254) ).
cnf(i_0_67,plain,
( in(unordered_pair(unordered_pair(X1,esk19_3(X2,X3,X1)),unordered_pair(X1,X1)),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp4sjufa/lgb.p',i_0_67) ).
cnf(i_0_4,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp4sjufa/lgb.p',i_0_4) ).
cnf(i_0_140,plain,
relation(empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp4sjufa/lgb.p',i_0_140) ).
cnf(i_0_84,plain,
( in(unordered_pair(unordered_pair(esk26_3(X1,X2,X3),X3),unordered_pair(esk26_3(X1,X2,X3),esk26_3(X1,X2,X3))),X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp4sjufa/lgb.p',i_0_84) ).
cnf(i_0_25,plain,
( X1 = empty_set
| in(esk8_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp4sjufa/lgb.p',i_0_25) ).
cnf(i_0_262,negated_conjecture,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bp4sjufa/lgb.p',i_0_262) ).
cnf(c_0_275,lemma,
( set_difference(X1,unordered_pair(X2,X2)) != X1
| ~ in(X2,X1) ),
i_0_266 ).
cnf(c_0_276,plain,
set_difference(empty_set,X1) = empty_set,
i_0_254 ).
cnf(c_0_277,plain,
( in(unordered_pair(unordered_pair(X1,esk19_3(X2,X3,X1)),unordered_pair(X1,X1)),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
i_0_67 ).
cnf(c_0_278,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_4 ).
cnf(c_0_279,lemma,
~ in(X1,empty_set),
inference(spm,[status(thm)],[c_0_275,c_0_276]) ).
cnf(c_0_280,plain,
( in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,esk19_3(X2,X3,X1))),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
inference(rw,[status(thm)],[c_0_277,c_0_278]) ).
cnf(c_0_281,plain,
relation(empty_set),
i_0_140 ).
cnf(c_0_282,plain,
( in(unordered_pair(unordered_pair(esk26_3(X1,X2,X3),X3),unordered_pair(esk26_3(X1,X2,X3),esk26_3(X1,X2,X3))),X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
i_0_84 ).
cnf(c_0_283,plain,
( X1 != relation_dom(empty_set)
| ~ in(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_279,c_0_280]),c_0_281])]) ).
cnf(c_0_284,plain,
( in(unordered_pair(unordered_pair(X1,esk26_3(X2,X3,X1)),unordered_pair(esk26_3(X2,X3,X1),esk26_3(X2,X3,X1))),X2)
| X3 != relation_rng(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
inference(rw,[status(thm)],[c_0_282,c_0_278]) ).
cnf(c_0_285,plain,
~ in(X1,relation_dom(empty_set)),
inference(er,[status(thm)],[c_0_283]) ).
cnf(c_0_286,plain,
( X1 = empty_set
| in(esk8_1(X1),X1) ),
i_0_25 ).
cnf(c_0_287,plain,
( X1 != relation_rng(empty_set)
| ~ in(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_279,c_0_284]),c_0_281])]) ).
cnf(c_0_288,negated_conjecture,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
i_0_262 ).
cnf(c_0_289,plain,
relation_dom(empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_285,c_0_286]) ).
cnf(c_0_290,plain,
~ in(X1,relation_rng(empty_set)),
inference(er,[status(thm)],[c_0_287]) ).
cnf(c_0_291,negated_conjecture,
relation_rng(empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_288,c_0_289])]) ).
cnf(c_0_292,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_290,c_0_286]),c_0_291]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU187+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 : Sun Jun 19 01:57:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.31/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.31/2.36 # No SInE strategy applied
% 7.31/2.36 # Trying AutoSched0 for 150 seconds
% 7.31/2.36 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.31/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.31/2.36 #
% 7.31/2.36 # Preprocessing time : 0.022 s
% 7.31/2.36
% 7.31/2.36 # Proof found!
% 7.31/2.36 # SZS status Theorem
% 7.31/2.36 # SZS output start CNFRefutation
% See solution above
% 7.31/2.36 # Training examples: 0 positive, 0 negative
% 7.31/2.36
% 7.31/2.36 # -------------------------------------------------
% 7.31/2.36 # User time : 0.038 s
% 7.31/2.36 # System time : 0.007 s
% 7.31/2.36 # Total time : 0.045 s
% 7.31/2.36 # Maximum resident set size: 7124 pages
% 7.31/2.36
%------------------------------------------------------------------------------