TSTP Solution File: ALG081+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG081+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 : Thu Jul 14 14:51:37 EDT 2022
% Result : Theorem 7.92s 2.41s
% Output : CNFRefutation 7.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of clauses : 53 ( 41 unt; 12 nHn; 53 RR)
% Number of literals : 93 ( 86 equ; 16 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_130,negated_conjecture,
op1(j(e20),j(e20)) = j(op2(e20,e20)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_130) ).
cnf(i_0_95,plain,
op2(e20,e20) = e20,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_95) ).
cnf(i_0_161,plain,
( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13
| j(e20) = e14
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_161) ).
cnf(i_0_156,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_156) ).
cnf(i_0_46,plain,
op1(e14,e14) = e11,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_46) ).
cnf(i_0_4,plain,
e14 != e11,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_4) ).
cnf(i_0_52,plain,
op1(e13,e13) = e11,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_52) ).
cnf(i_0_5,plain,
e13 != e11,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_5) ).
cnf(i_0_58,plain,
op1(e12,e12) = e11,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_58) ).
cnf(i_0_6,plain,
e12 != e11,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_6) ).
cnf(i_0_106,negated_conjecture,
op1(j(e24),j(e24)) = j(op2(e24,e24)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_106) ).
cnf(i_0_71,plain,
op2(e24,e24) = e20,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_71) ).
cnf(i_0_64,plain,
op1(e11,e11) = e12,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_64) ).
cnf(i_0_157,plain,
( j(e24) = e10
| j(e24) = e11
| j(e24) = e12
| j(e24) = e13
| j(e24) = e14
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_157) ).
cnf(i_0_10,plain,
e11 != e10,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_10) ).
cnf(i_0_9,plain,
e12 != e10,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_9) ).
cnf(i_0_105,negated_conjecture,
h(j(e20)) = e20,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_105) ).
cnf(i_0_101,negated_conjecture,
h(j(e24)) = e24,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_101) ).
cnf(i_0_17,plain,
e24 != e20,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eqytearw/input.p',i_0_17) ).
cnf(c_0_181,negated_conjecture,
op1(j(e20),j(e20)) = j(op2(e20,e20)),
i_0_130 ).
cnf(c_0_182,plain,
op2(e20,e20) = e20,
i_0_95 ).
cnf(c_0_183,plain,
( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13
| j(e20) = e14
| ~ epred1_0 ),
i_0_161 ).
cnf(c_0_184,negated_conjecture,
epred1_0,
i_0_156 ).
cnf(c_0_185,negated_conjecture,
op1(j(e20),j(e20)) = j(e20),
inference(rw,[status(thm)],[c_0_181,c_0_182]) ).
cnf(c_0_186,plain,
( j(e20) = e14
| j(e20) = e13
| j(e20) = e12
| j(e20) = e11
| j(e20) = e10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_184])]) ).
cnf(c_0_187,plain,
op1(e14,e14) = e11,
i_0_46 ).
cnf(c_0_188,plain,
e14 != e11,
i_0_4 ).
cnf(c_0_189,plain,
( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_185,c_0_186]),c_0_187]),c_0_188]) ).
cnf(c_0_190,plain,
op1(e13,e13) = e11,
i_0_52 ).
cnf(c_0_191,plain,
e13 != e11,
i_0_5 ).
cnf(c_0_192,negated_conjecture,
( j(e20) = e12
| j(e20) = e11
| j(e20) = e10 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_185,c_0_189]),c_0_190]),c_0_191]) ).
cnf(c_0_193,plain,
op1(e12,e12) = e11,
i_0_58 ).
cnf(c_0_194,plain,
e12 != e11,
i_0_6 ).
cnf(c_0_195,negated_conjecture,
op1(j(e24),j(e24)) = j(op2(e24,e24)),
i_0_106 ).
cnf(c_0_196,plain,
op2(e24,e24) = e20,
i_0_71 ).
cnf(c_0_197,negated_conjecture,
( j(e20) = e10
| j(e20) = e11 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_185,c_0_192]),c_0_193]),c_0_194]) ).
cnf(c_0_198,plain,
op1(e11,e11) = e12,
i_0_64 ).
cnf(c_0_199,negated_conjecture,
op1(j(e24),j(e24)) = j(e20),
inference(rw,[status(thm)],[c_0_195,c_0_196]) ).
cnf(c_0_200,negated_conjecture,
j(e20) = e10,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_185,c_0_197]),c_0_198]),c_0_194]) ).
cnf(c_0_201,plain,
( j(e24) = e10
| j(e24) = e11
| j(e24) = e12
| j(e24) = e13
| j(e24) = e14
| ~ epred1_0 ),
i_0_157 ).
cnf(c_0_202,negated_conjecture,
op1(j(e24),j(e24)) = e10,
inference(rw,[status(thm)],[c_0_199,c_0_200]) ).
cnf(c_0_203,plain,
( j(e24) = e14
| j(e24) = e13
| j(e24) = e12
| j(e24) = e11
| j(e24) = e10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_201,c_0_184])]) ).
cnf(c_0_204,plain,
e11 != e10,
i_0_10 ).
cnf(c_0_205,plain,
( j(e24) = e10
| j(e24) = e11
| j(e24) = e12
| j(e24) = e13 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_203]),c_0_187]),c_0_204]) ).
cnf(c_0_206,negated_conjecture,
( j(e24) = e12
| j(e24) = e11
| j(e24) = e10 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_205]),c_0_190]),c_0_204]) ).
cnf(c_0_207,negated_conjecture,
( j(e24) = e10
| j(e24) = e11 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_206]),c_0_193]),c_0_204]) ).
cnf(c_0_208,plain,
e12 != e10,
i_0_9 ).
cnf(c_0_209,negated_conjecture,
h(j(e20)) = e20,
i_0_105 ).
cnf(c_0_210,negated_conjecture,
h(j(e24)) = e24,
i_0_101 ).
cnf(c_0_211,negated_conjecture,
j(e24) = e10,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_207]),c_0_198]),c_0_208]) ).
cnf(c_0_212,negated_conjecture,
h(e10) = e20,
inference(rw,[status(thm)],[c_0_209,c_0_200]) ).
cnf(c_0_213,plain,
e24 != e20,
i_0_17 ).
cnf(c_0_214,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_211]),c_0_212]),c_0_213]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ALG081+1 : TPTP v8.1.0. Released v2.7.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 : Tue Jun 7 23:01:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.92/2.41 # ENIGMATIC: Solved by autoschedule:
% 7.92/2.41 # No SInE strategy applied
% 7.92/2.41 # Trying AutoSched0 for 150 seconds
% 7.92/2.41 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.92/2.41 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.92/2.41 #
% 7.92/2.41 # Preprocessing time : 0.023 s
% 7.92/2.41
% 7.92/2.41 # Proof found!
% 7.92/2.41 # SZS status Theorem
% 7.92/2.41 # SZS output start CNFRefutation
% See solution above
% 7.92/2.41 # Training examples: 0 positive, 0 negative
% 7.92/2.41
% 7.92/2.41 # -------------------------------------------------
% 7.92/2.41 # User time : 0.031 s
% 7.92/2.41 # System time : 0.002 s
% 7.92/2.41 # Total time : 0.033 s
% 7.92/2.41 # Maximum resident set size: 7120 pages
% 7.92/2.41
%------------------------------------------------------------------------------