TSTP Solution File: SEU212+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU212+3 : TPTP v8.1.0. Released v3.2.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:35 EDT 2022
% Result : Theorem 7.78s 2.38s
% Output : CNFRefutation 7.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 10 unt; 5 nHn; 24 RR)
% Number of literals : 65 ( 14 equ; 37 neg)
% Maximal clause size : 5 ( 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; 3 con; 0-2 aty)
% Number of variables : 32 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X2 != apply(X3,X1)
| ~ function(X3)
| ~ relation(X3)
| ~ in(X1,relation_dom(X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qihdpu9m/lgb.p',i_0_8) ).
cnf(i_0_4,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qihdpu9m/lgb.p',i_0_4) ).
cnf(i_0_11,plain,
( in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qihdpu9m/lgb.p',i_0_11) ).
cnf(i_0_53,negated_conjecture,
( in(esk13_0,relation_dom(esk15_0))
| in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qihdpu9m/lgb.p',i_0_53) ).
cnf(i_0_55,negated_conjecture,
function(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qihdpu9m/lgb.p',i_0_55) ).
cnf(i_0_56,negated_conjecture,
relation(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qihdpu9m/lgb.p',i_0_56) ).
cnf(i_0_7,plain,
( X1 = apply(X2,X3)
| ~ function(X2)
| ~ relation(X2)
| ~ in(X3,relation_dom(X2))
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qihdpu9m/lgb.p',i_0_7) ).
cnf(i_0_52,negated_conjecture,
( apply(esk15_0,esk13_0) = esk14_0
| in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qihdpu9m/lgb.p',i_0_52) ).
cnf(i_0_54,negated_conjecture,
( apply(esk15_0,esk13_0) != esk14_0
| ~ in(esk13_0,relation_dom(esk15_0))
| ~ in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qihdpu9m/lgb.p',i_0_54) ).
cnf(c_0_66,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X2 != apply(X3,X1)
| ~ function(X3)
| ~ relation(X3)
| ~ in(X1,relation_dom(X3)) ),
i_0_8 ).
cnf(c_0_67,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_4 ).
cnf(c_0_68,plain,
( in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
i_0_11 ).
cnf(c_0_69,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,apply(X2,X1))),X2)
| ~ function(X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_66]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
( in(esk13_0,relation_dom(esk15_0))
| in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0) ),
i_0_53 ).
cnf(c_0_71,negated_conjecture,
function(esk15_0),
i_0_55 ).
cnf(c_0_72,negated_conjecture,
relation(esk15_0),
i_0_56 ).
cnf(c_0_73,plain,
( X1 = apply(X2,X3)
| ~ function(X2)
| ~ relation(X2)
| ~ in(X3,relation_dom(X2))
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2) ),
i_0_7 ).
cnf(c_0_74,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_75,negated_conjecture,
( in(unordered_pair(singleton(esk13_0),unordered_pair(esk13_0,apply(esk15_0,esk13_0))),esk15_0)
| in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_72])]) ).
cnf(c_0_76,negated_conjecture,
( apply(esk15_0,esk13_0) = esk14_0
| in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0) ),
i_0_52 ).
cnf(c_0_77,plain,
( X1 = apply(X2,X3)
| ~ function(X2)
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2) ),
inference(csr,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,negated_conjecture,
in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_67])]) ).
cnf(c_0_79,negated_conjecture,
( apply(esk15_0,esk13_0) != esk14_0
| ~ in(esk13_0,relation_dom(esk15_0))
| ~ in(unordered_pair(unordered_pair(esk13_0,esk14_0),singleton(esk13_0)),esk15_0) ),
i_0_54 ).
cnf(c_0_80,plain,
apply(esk15_0,esk13_0) = esk14_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_71]),c_0_72])]) ).
cnf(c_0_81,negated_conjecture,
~ in(esk13_0,relation_dom(esk15_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_78])]),c_0_80])]) ).
cnf(c_0_82,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_78]),c_0_72])]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU212+3 : TPTP v8.1.0. Released v3.2.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 15:29:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.78/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.78/2.38 # No SInE strategy applied
% 7.78/2.38 # Trying AutoSched0 for 150 seconds
% 7.78/2.38 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S2q
% 7.78/2.38 # and selection function SelectCQArNTNp.
% 7.78/2.38 #
% 7.78/2.38 # Preprocessing time : 0.023 s
% 7.78/2.38 # Presaturation interreduction done
% 7.78/2.38
% 7.78/2.38 # Proof found!
% 7.78/2.38 # SZS status Theorem
% 7.78/2.38 # SZS output start CNFRefutation
% See solution above
% 7.78/2.38 # Training examples: 0 positive, 0 negative
% 7.78/2.38
% 7.78/2.38 # -------------------------------------------------
% 7.78/2.38 # User time : 0.026 s
% 7.78/2.38 # System time : 0.006 s
% 7.78/2.38 # Total time : 0.032 s
% 7.78/2.38 # Maximum resident set size: 7124 pages
% 7.78/2.38
%------------------------------------------------------------------------------