TSTP Solution File: PUZ133+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PUZ133+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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 : Mon Jul 18 18:08:48 EDT 2022
% Result : Theorem 11.21s 2.79s
% Output : CNFRefutation 11.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of clauses : 95 ( 35 unt; 23 nHn; 84 RR)
% Number of literals : 219 ( 96 equ; 111 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 117 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( queens_q
| le(s(esk1_0),esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_9) ).
cnf(i_0_12,negated_conjecture,
~ queens_q,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_12) ).
cnf(i_0_18,plain,
( le(X1,X2)
| ~ le(X3,X2)
| ~ le(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_18) ).
cnf(i_0_10,plain,
( queens_q
| le(esk1_0,n) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_10) ).
cnf(i_0_11,plain,
( queens_q
| le(s(n0),esk1_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_11) ).
cnf(i_0_7,plain,
( queens_q
| le(s(perm(esk2_0)),perm(esk1_0))
| ~ le(s(esk1_0),esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_7) ).
cnf(i_0_19,plain,
le(X1,s(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_19) ).
cnf(i_0_5,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| plus(p(perm(esk2_0)),esk2_0) = plus(p(perm(esk1_0)),esk1_0)
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| queens_q ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_5) ).
cnf(i_0_15,plain,
( le(perm(X1),n)
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_15) ).
cnf(i_0_21,plain,
( minus(X1,X2) = minus(X3,X4)
| plus(X1,X4) != plus(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_21) ).
cnf(i_0_20,plain,
( plus(X1,X2) = plus(X3,X4)
| minus(X1,X3) != minus(X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_20) ).
cnf(i_0_3,plain,
( p(X1) != p(X2)
| ~ queens_p
| ~ le(X2,n)
| ~ le(X1,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_3) ).
cnf(i_0_14,negated_conjecture,
queens_p,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_14) ).
cnf(i_0_8,plain,
( queens_q
| le(esk2_0,n) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_8) ).
cnf(i_0_17,plain,
minus(perm(X1),perm(X2)) = minus(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_17) ).
cnf(i_0_16,plain,
( le(s(n0),perm(X1))
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_16) ).
cnf(i_0_22,plain,
( minus(X1,X2) = minus(X3,X4)
| minus(X1,X3) != minus(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_22) ).
cnf(i_0_1,plain,
( minus(p(X1),X1) != minus(p(X2),X2)
| ~ queens_p
| ~ le(X2,n)
| ~ le(X1,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_1) ).
cnf(i_0_2,plain,
( plus(p(X1),X1) != plus(p(X2),X2)
| ~ queens_p
| ~ le(X2,n)
| ~ le(X1,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-48995z2t/input.p',i_0_2) ).
cnf(c_0_42,plain,
( queens_q
| le(s(esk1_0),esk2_0) ),
i_0_9 ).
cnf(c_0_43,negated_conjecture,
~ queens_q,
i_0_12 ).
cnf(c_0_44,plain,
( le(X1,X2)
| ~ le(X3,X2)
| ~ le(X1,X3) ),
i_0_18 ).
cnf(c_0_45,plain,
le(s(esk1_0),esk2_0),
inference(sr,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( queens_q
| le(esk1_0,n) ),
i_0_10 ).
cnf(c_0_47,plain,
( queens_q
| le(s(n0),esk1_0) ),
i_0_11 ).
cnf(c_0_48,plain,
( queens_q
| le(s(perm(esk2_0)),perm(esk1_0))
| ~ le(s(esk1_0),esk2_0) ),
i_0_7 ).
cnf(c_0_49,plain,
( le(X1,esk2_0)
| ~ le(X1,s(esk1_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
le(X1,s(X1)),
i_0_19 ).
cnf(c_0_51,negated_conjecture,
( p(perm(esk2_0)) = p(perm(esk1_0))
| plus(p(perm(esk2_0)),esk2_0) = plus(p(perm(esk1_0)),esk1_0)
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| queens_q ),
i_0_5 ).
cnf(c_0_52,plain,
( le(perm(X1),n)
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
i_0_15 ).
cnf(c_0_53,plain,
le(esk1_0,n),
inference(sr,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_54,plain,
le(s(n0),esk1_0),
inference(sr,[status(thm)],[c_0_47,c_0_43]) ).
cnf(c_0_55,plain,
le(s(perm(esk2_0)),perm(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_45])]),c_0_43]) ).
cnf(c_0_56,plain,
le(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
( minus(X1,X2) = minus(X3,X4)
| plus(X1,X4) != plus(X2,X3) ),
i_0_21 ).
cnf(c_0_58,negated_conjecture,
( plus(p(perm(esk2_0)),esk2_0) = plus(p(perm(esk1_0)),esk1_0)
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| p(perm(esk2_0)) = p(perm(esk1_0)) ),
inference(sr,[status(thm)],[c_0_51,c_0_43]) ).
cnf(c_0_59,plain,
( plus(X1,X2) = plus(X3,X4)
| minus(X1,X3) != minus(X4,X2) ),
i_0_20 ).
cnf(c_0_60,plain,
( p(X1) != p(X2)
| ~ queens_p
| ~ le(X2,n)
| ~ le(X1,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1) ),
i_0_3 ).
cnf(c_0_61,negated_conjecture,
queens_p,
i_0_14 ).
cnf(c_0_62,plain,
le(perm(esk1_0),n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_63,plain,
( le(X1,perm(esk1_0))
| ~ le(X1,s(perm(esk2_0))) ),
inference(spm,[status(thm)],[c_0_44,c_0_55]) ).
cnf(c_0_64,plain,
( queens_q
| le(esk2_0,n) ),
i_0_8 ).
cnf(c_0_65,plain,
( le(X1,esk2_0)
| ~ le(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_56]) ).
cnf(c_0_66,plain,
minus(perm(X1),perm(X2)) = minus(X2,X1),
i_0_17 ).
cnf(c_0_67,negated_conjecture,
( minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(X1,p(perm(esk2_0))) = minus(esk2_0,X2)
| p(perm(esk2_0)) = p(perm(esk1_0))
| plus(X1,X2) != plus(p(perm(esk1_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_68,plain,
plus(X1,X2) = plus(X2,X1),
inference(er,[status(thm)],[c_0_59]) ).
cnf(c_0_69,plain,
( p(X1) != p(X2)
| ~ le(s(n0),X1)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_70,plain,
( le(X1,n)
| ~ le(X1,perm(esk1_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_62]) ).
cnf(c_0_71,plain,
le(perm(esk2_0),perm(esk1_0)),
inference(spm,[status(thm)],[c_0_63,c_0_50]) ).
cnf(c_0_72,plain,
( le(s(n0),perm(X1))
| ~ le(X1,n)
| ~ le(s(n0),X1) ),
i_0_16 ).
cnf(c_0_73,plain,
le(esk2_0,n),
inference(sr,[status(thm)],[c_0_64,c_0_43]) ).
cnf(c_0_74,plain,
le(s(n0),esk2_0),
inference(spm,[status(thm)],[c_0_65,c_0_54]) ).
cnf(c_0_75,plain,
( minus(X1,X2) = minus(X3,X4)
| minus(X1,X3) != minus(X2,X4) ),
i_0_22 ).
cnf(c_0_76,plain,
( plus(X1,perm(X2)) = plus(X3,perm(X4))
| minus(X1,X3) != minus(X2,X4) ),
inference(spm,[status(thm)],[c_0_59,c_0_66]) ).
cnf(c_0_77,negated_conjecture,
( minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(X1,p(perm(esk2_0))) = minus(esk2_0,X2)
| p(perm(esk2_0)) = p(perm(esk1_0))
| plus(X1,X2) != plus(esk1_0,p(perm(esk1_0))) ),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_78,plain,
( p(X1) != p(perm(esk1_0))
| ~ le(s(X1),perm(esk1_0))
| ~ le(s(n0),X1)
| ~ le(X1,n) ),
inference(spm,[status(thm)],[c_0_69,c_0_62]) ).
cnf(c_0_79,plain,
le(perm(esk2_0),n),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_80,plain,
le(s(n0),perm(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_81,plain,
( minus(X1,perm(X2)) = minus(X3,perm(X4))
| minus(X1,X3) != minus(X4,X2) ),
inference(spm,[status(thm)],[c_0_75,c_0_66]) ).
cnf(c_0_82,plain,
( plus(X1,perm(perm(X2))) = plus(X3,perm(perm(X4)))
| minus(X1,X3) != minus(X4,X2) ),
inference(spm,[status(thm)],[c_0_76,c_0_66]) ).
cnf(c_0_83,plain,
( minus(p(X1),X1) != minus(p(X2),X2)
| ~ queens_p
| ~ le(X2,n)
| ~ le(X1,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1) ),
i_0_1 ).
cnf(c_0_84,negated_conjecture,
( minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0)))
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| p(perm(esk2_0)) = p(perm(esk1_0)) ),
inference(er,[status(thm)],[c_0_77]) ).
cnf(c_0_85,plain,
p(perm(esk2_0)) != p(perm(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_55]),c_0_80])]) ).
cnf(c_0_86,plain,
minus(X1,perm(X2)) = minus(X2,perm(X1)),
inference(er,[status(thm)],[c_0_81]) ).
cnf(c_0_87,plain,
plus(X1,perm(perm(X2))) = plus(X2,perm(perm(X1))),
inference(er,[status(thm)],[c_0_82]) ).
cnf(c_0_88,plain,
( plus(p(X1),X1) != plus(p(X2),X2)
| ~ queens_p
| ~ le(X2,n)
| ~ le(X1,n)
| ~ le(s(X1),X2)
| ~ le(s(n0),X1) ),
i_0_2 ).
cnf(c_0_89,plain,
( minus(p(X1),X1) != minus(p(X2),X2)
| ~ le(s(n0),X1)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_61])]) ).
cnf(c_0_90,negated_conjecture,
( minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0))) ),
inference(sr,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_91,plain,
minus(X1,perm(perm(X2))) = minus(X1,X2),
inference(spm,[status(thm)],[c_0_66,c_0_86]) ).
cnf(c_0_92,plain,
plus(perm(perm(X1)),X2) = plus(X1,perm(perm(X2))),
inference(spm,[status(thm)],[c_0_68,c_0_87]) ).
cnf(c_0_93,plain,
( plus(p(X1),X1) != plus(p(X2),X2)
| ~ le(s(n0),X1)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_61])]) ).
cnf(c_0_94,negated_conjecture,
( minus(p(perm(esk1_0)),p(perm(esk2_0))) = minus(esk2_0,esk1_0)
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| p(perm(esk2_0)) = p(perm(esk1_0)) ),
inference(er,[status(thm)],[c_0_67]) ).
cnf(c_0_95,plain,
( minus(p(X1),X1) != minus(p(perm(esk1_0)),perm(esk1_0))
| ~ le(s(X1),perm(esk1_0))
| ~ le(s(n0),X1)
| ~ le(X1,n) ),
inference(spm,[status(thm)],[c_0_89,c_0_62]) ).
cnf(c_0_96,plain,
( minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0)))
| minus(p(perm(esk2_0)),perm(X1)) = minus(esk2_0,perm(X2))
| minus(p(perm(esk1_0)),esk1_0) != minus(X2,X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_90]) ).
cnf(c_0_97,plain,
( plus(X1,X2) = plus(X3,perm(perm(X4)))
| minus(X1,X3) != minus(X4,X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_91]),c_0_92]) ).
cnf(c_0_98,plain,
( plus(X1,p(X1)) != plus(X2,p(X2))
| ~ le(s(n0),X1)
| ~ le(s(X1),X2)
| ~ le(X2,n)
| ~ le(X1,n) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_68]),c_0_68]) ).
cnf(c_0_99,negated_conjecture,
( minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(p(perm(esk1_0)),p(perm(esk2_0))) = minus(esk2_0,esk1_0) ),
inference(sr,[status(thm)],[c_0_94,c_0_85]) ).
cnf(c_0_100,plain,
minus(p(perm(esk2_0)),perm(esk2_0)) != minus(p(perm(esk1_0)),perm(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_79]),c_0_55]),c_0_80])]) ).
cnf(c_0_101,plain,
( plus(perm(X1),perm(X2)) = plus(perm(X3),perm(X4))
| minus(X3,X1) != minus(X2,X4) ),
inference(spm,[status(thm)],[c_0_76,c_0_66]) ).
cnf(c_0_102,plain,
( minus(esk2_0,perm(p(perm(esk1_0)))) = minus(esk1_0,perm(p(perm(esk2_0))))
| minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0))) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_96]),c_0_86]) ).
cnf(c_0_103,plain,
plus(X1,perm(perm(X2))) = plus(X2,X1),
inference(er,[status(thm)],[c_0_97]) ).
cnf(c_0_104,plain,
( plus(X1,p(X1)) != plus(perm(esk1_0),p(perm(esk1_0)))
| ~ le(s(X1),perm(esk1_0))
| ~ le(s(n0),X1)
| ~ le(X1,n) ),
inference(spm,[status(thm)],[c_0_98,c_0_62]) ).
cnf(c_0_105,plain,
( minus(p(perm(esk1_0)),perm(X1)) = minus(p(perm(esk2_0)),perm(X2))
| minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0)
| minus(esk2_0,esk1_0) != minus(X2,X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_99]) ).
cnf(c_0_106,plain,
minus(esk2_0,perm(p(perm(esk2_0)))) != minus(esk1_0,perm(p(perm(esk1_0)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_86]),c_0_86]) ).
cnf(c_0_107,plain,
( minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0)))
| plus(perm(X1),perm(esk2_0)) = plus(p(perm(esk1_0)),perm(X2))
| minus(X2,X1) != minus(esk1_0,perm(p(perm(esk2_0)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103]) ).
cnf(c_0_108,plain,
plus(perm(perm(X1)),X2) = plus(X2,X1),
inference(rw,[status(thm)],[c_0_92,c_0_103]) ).
cnf(c_0_109,plain,
plus(perm(esk2_0),p(perm(esk2_0))) != plus(perm(esk1_0),p(perm(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_79]),c_0_55]),c_0_80])]) ).
cnf(c_0_110,plain,
minus(p(perm(esk2_0)),esk2_0) = minus(p(perm(esk1_0)),esk1_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_105]),c_0_86]),c_0_86]),c_0_106]) ).
cnf(c_0_111,plain,
minus(esk2_0,p(perm(esk1_0))) = minus(esk1_0,p(perm(esk2_0))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_107]),c_0_108]),c_0_68]),c_0_109]) ).
cnf(c_0_112,plain,
( minus(X1,p(perm(esk2_0))) = minus(X2,esk2_0)
| minus(X1,X2) != minus(p(perm(esk1_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_110]) ).
cnf(c_0_113,plain,
( minus(esk2_0,X1) = minus(p(perm(esk1_0)),X2)
| minus(esk1_0,p(perm(esk2_0))) != minus(X1,X2) ),
inference(spm,[status(thm)],[c_0_75,c_0_111]) ).
cnf(c_0_114,plain,
minus(p(perm(esk1_0)),p(perm(esk2_0))) = minus(esk1_0,esk2_0),
inference(er,[status(thm)],[c_0_112]) ).
cnf(c_0_115,plain,
minus(esk2_0,esk1_0) = minus(esk1_0,esk2_0),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_113]),c_0_114]) ).
cnf(c_0_116,plain,
( minus(esk2_0,perm(X1)) = minus(esk1_0,perm(X2))
| minus(esk1_0,esk2_0) != minus(X2,X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_115]) ).
cnf(c_0_117,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_114]),c_0_106]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PUZ133+2 : TPTP v8.1.0. Released v4.1.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun May 29 01:56:13 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 11.21/2.79 # ENIGMATIC: Solved by autoschedule:
% 11.21/2.79 # No SInE strategy applied
% 11.21/2.79 # Trying AutoSched0 for 150 seconds
% 11.21/2.79 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 11.21/2.79 # and selection function SelectNewComplexAHP.
% 11.21/2.79 #
% 11.21/2.79 # Preprocessing time : 0.024 s
% 11.21/2.79 # Presaturation interreduction done
% 11.21/2.79
% 11.21/2.79 # Proof found!
% 11.21/2.79 # SZS status Theorem
% 11.21/2.79 # SZS output start CNFRefutation
% See solution above
% 11.21/2.79 # Training examples: 0 positive, 0 negative
% 11.21/2.79
% 11.21/2.79 # -------------------------------------------------
% 11.21/2.79 # User time : 0.599 s
% 11.21/2.79 # System time : 0.011 s
% 11.21/2.79 # Total time : 0.610 s
% 11.21/2.79 # Maximum resident set size: 7120 pages
% 11.21/2.79
%------------------------------------------------------------------------------