TSTP Solution File: SEU187+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU187+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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 8.45s 2.31s
% Output : CNFRefutation 8.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of clauses : 40 ( 14 unt; 6 nHn; 32 RR)
% Number of literals : 80 ( 18 equ; 42 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-3 aty)
% Number of variables : 51 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( in(unordered_pair(unordered_pair(X1,esk1_3(X2,X3,X1)),singleton(X1)),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_7) ).
cnf(i_0_3,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_3) ).
cnf(i_0_41,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_41) ).
cnf(i_0_2,plain,
( relation(X1)
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_2) ).
cnf(i_0_36,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_36) ).
cnf(i_0_20,plain,
element(esk7_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_20) ).
cnf(i_0_40,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_40) ).
cnf(i_0_25,plain,
relation(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_25) ).
cnf(i_0_26,plain,
empty(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_26) ).
cnf(i_0_11,plain,
( in(unordered_pair(unordered_pair(esk4_3(X1,X2,X3),X3),singleton(esk4_3(X1,X2,X3))),X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_11) ).
cnf(i_0_37,plain,
( X1 = X2
| in(esk12_2(X1,X2),X2)
| in(esk12_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_37) ).
cnf(i_0_39,negated_conjecture,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gcl1684b/lgb.p',i_0_39) ).
cnf(c_0_54,plain,
( in(unordered_pair(unordered_pair(X1,esk1_3(X2,X3,X1)),singleton(X1)),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
i_0_7 ).
cnf(c_0_55,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_3 ).
cnf(c_0_56,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
i_0_41 ).
cnf(c_0_57,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_3(X2,relation_dom(X2),X1))),X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_58,plain,
( relation(X1)
| ~ empty(X1) ),
i_0_2 ).
cnf(c_0_59,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_36 ).
cnf(c_0_60,plain,
element(esk7_1(X1),X1),
i_0_20 ).
cnf(c_0_61,plain,
( ~ empty(X1)
| ~ in(X2,relation_dom(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_62,plain,
( empty(X1)
| in(esk7_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_40 ).
cnf(c_0_64,plain,
( empty(relation_dom(X1))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,plain,
( relation_dom(X1) = empty_set
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_66,plain,
( ~ empty(X1)
| ~ in(X2,empty_set) ),
inference(spm,[status(thm)],[c_0_61,c_0_65]) ).
cnf(c_0_67,plain,
relation(empty_set),
i_0_25 ).
cnf(c_0_68,plain,
( ~ empty(X1)
| ~ in(X2,relation_dom(empty_set)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_57]),c_0_67])]) ).
cnf(c_0_69,plain,
( empty(relation_dom(empty_set))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_62]) ).
cnf(c_0_70,plain,
empty(empty_set),
i_0_26 ).
cnf(c_0_71,plain,
empty(relation_dom(empty_set)),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_72,plain,
relation_dom(empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_63,c_0_71]) ).
cnf(c_0_73,plain,
( in(unordered_pair(unordered_pair(esk4_3(X1,X2,X3),X3),singleton(esk4_3(X1,X2,X3))),X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
i_0_11 ).
cnf(c_0_74,plain,
~ in(X1,empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_72]),c_0_70])]) ).
cnf(c_0_75,plain,
( in(unordered_pair(unordered_pair(X1,esk4_3(X2,relation_rng(X2),X1)),singleton(esk4_3(X2,relation_rng(X2),X1))),X2)
| ~ relation(X2)
| ~ in(X1,relation_rng(X2)) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_55])]) ).
cnf(c_0_76,plain,
( X1 = X2
| in(esk12_2(X1,X2),X2)
| in(esk12_2(X1,X2),X1) ),
i_0_37 ).
cnf(c_0_77,negated_conjecture,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
i_0_39 ).
cnf(c_0_78,plain,
~ in(X1,relation_rng(empty_set)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_67])]) ).
cnf(c_0_79,plain,
( empty_set = X1
| in(esk12_2(empty_set,X1),X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
relation_rng(empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_65]),c_0_70])]) ).
cnf(c_0_81,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU187+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 21:45:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.45/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.45/2.31 # No SInE strategy applied
% 8.45/2.31 # Trying AutoSched0 for 150 seconds
% 8.45/2.31 # AutoSched0-Mode selected heuristic G_____0021_C18_F1_SE_CS_SP_S0Y
% 8.45/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.45/2.31 #
% 8.45/2.31 # Preprocessing time : 0.024 s
% 8.45/2.31
% 8.45/2.31 # Proof found!
% 8.45/2.31 # SZS status Theorem
% 8.45/2.31 # SZS output start CNFRefutation
% See solution above
% 8.45/2.31 # Training examples: 0 positive, 0 negative
% 8.45/2.31
% 8.45/2.31 # -------------------------------------------------
% 8.45/2.31 # User time : 0.064 s
% 8.45/2.31 # System time : 0.012 s
% 8.45/2.31 # Total time : 0.075 s
% 8.45/2.31 # Maximum resident set size: 7124 pages
% 8.45/2.31
%------------------------------------------------------------------------------