TSTP Solution File: ALG042+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG042+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 14:44:15 EDT 2022
% Result : Theorem 7.63s 2.30s
% Output : CNFRefutation 7.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of clauses : 55 ( 42 unt; 13 nHn; 55 RR)
% Number of literals : 89 ( 82 equ; 14 neg)
% Maximal clause size : 5 ( 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_84,negated_conjecture,
op1(j(e20),j(e20)) = j(op2(e20,e20)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_84) ).
cnf(i_0_60,plain,
op2(e20,e20) = e20,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_60) ).
cnf(i_0_105,plain,
( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13
| ~ epred1_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_105) ).
cnf(i_0_101,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_101) ).
cnf(i_0_29,plain,
op1(e13,e13) = e10,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_29) ).
cnf(i_0_4,plain,
e13 != e10,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_4) ).
cnf(i_0_34,plain,
op1(e12,e12) = e10,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_34) ).
cnf(i_0_5,plain,
e12 != e10,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_5) ).
cnf(i_0_79,negated_conjecture,
op1(j(e21),j(e21)) = j(op2(e21,e21)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_79) ).
cnf(i_0_55,plain,
op2(e21,e21) = e23,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_55) ).
cnf(i_0_104,plain,
( j(e21) = e10
| j(e21) = e11
| j(e21) = e12
| j(e21) = e13
| ~ epred1_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_104) ).
cnf(i_0_39,plain,
op1(e11,e11) = e10,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_39) ).
cnf(i_0_6,plain,
e11 != e10,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_6) ).
cnf(i_0_68,negated_conjecture,
h(j(e20)) = e20,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_68) ).
cnf(i_0_65,negated_conjecture,
h(j(e23)) = e23,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_65) ).
cnf(i_0_10,plain,
e23 != e20,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_10) ).
cnf(i_0_95,negated_conjecture,
h(op1(e11,e11)) = op2(h(e11),h(e11)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_95) ).
cnf(i_0_67,negated_conjecture,
h(j(e21)) = e21,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_67) ).
cnf(i_0_12,plain,
e21 != e20,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7c2_rc0s/input.p',i_0_12) ).
cnf(c_0_125,negated_conjecture,
op1(j(e20),j(e20)) = j(op2(e20,e20)),
i_0_84 ).
cnf(c_0_126,plain,
op2(e20,e20) = e20,
i_0_60 ).
cnf(c_0_127,plain,
( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13
| ~ epred1_0 ),
i_0_105 ).
cnf(c_0_128,negated_conjecture,
epred1_0,
i_0_101 ).
cnf(c_0_129,negated_conjecture,
op1(j(e20),j(e20)) = j(e20),
inference(rw,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_130,plain,
( j(e20) = e13
| j(e20) = e12
| j(e20) = e11
| j(e20) = e10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_128])]) ).
cnf(c_0_131,plain,
op1(e13,e13) = e10,
i_0_29 ).
cnf(c_0_132,plain,
e13 != e10,
i_0_4 ).
cnf(c_0_133,plain,
( j(e20) = e10
| j(e20) = e11
| j(e20) = e12 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_131]),c_0_132]) ).
cnf(c_0_134,plain,
op1(e12,e12) = e10,
i_0_34 ).
cnf(c_0_135,plain,
e12 != e10,
i_0_5 ).
cnf(c_0_136,negated_conjecture,
op1(j(e21),j(e21)) = j(op2(e21,e21)),
i_0_79 ).
cnf(c_0_137,plain,
op2(e21,e21) = e23,
i_0_55 ).
cnf(c_0_138,plain,
( j(e21) = e10
| j(e21) = e11
| j(e21) = e12
| j(e21) = e13
| ~ epred1_0 ),
i_0_104 ).
cnf(c_0_139,negated_conjecture,
( j(e20) = e11
| j(e20) = e10 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_133]),c_0_134]),c_0_135]) ).
cnf(c_0_140,plain,
op1(e11,e11) = e10,
i_0_39 ).
cnf(c_0_141,plain,
e11 != e10,
i_0_6 ).
cnf(c_0_142,negated_conjecture,
op1(j(e21),j(e21)) = j(e23),
inference(rw,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_143,plain,
( j(e21) = e13
| j(e21) = e12
| j(e21) = e11
| j(e21) = e10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_128])]) ).
cnf(c_0_144,negated_conjecture,
h(j(e20)) = e20,
i_0_68 ).
cnf(c_0_145,negated_conjecture,
j(e20) = e10,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_139]),c_0_140]),c_0_141]) ).
cnf(c_0_146,negated_conjecture,
h(j(e23)) = e23,
i_0_65 ).
cnf(c_0_147,plain,
( j(e21) = e10
| j(e21) = e11
| j(e21) = e12
| j(e23) = e10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_131]) ).
cnf(c_0_148,negated_conjecture,
h(e10) = e20,
inference(rw,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_149,plain,
e23 != e20,
i_0_10 ).
cnf(c_0_150,negated_conjecture,
( j(e21) = e12
| j(e21) = e11
| j(e21) = e10 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148]),c_0_149]) ).
cnf(c_0_151,negated_conjecture,
( j(e21) = e10
| j(e21) = e11
| j(e23) = e10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_150]),c_0_134]) ).
cnf(c_0_152,negated_conjecture,
h(op1(e11,e11)) = op2(h(e11),h(e11)),
i_0_95 ).
cnf(c_0_153,negated_conjecture,
h(j(e21)) = e21,
i_0_67 ).
cnf(c_0_154,negated_conjecture,
( j(e21) = e11
| j(e21) = e10 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_151]),c_0_148]),c_0_149]) ).
cnf(c_0_155,negated_conjecture,
op2(h(e11),h(e11)) = h(e10),
inference(rw,[status(thm)],[c_0_152,c_0_140]) ).
cnf(c_0_156,negated_conjecture,
( j(e21) = e10
| h(e11) = e21 ),
inference(spm,[status(thm)],[c_0_153,c_0_154]) ).
cnf(c_0_157,plain,
e21 != e20,
i_0_12 ).
cnf(c_0_158,negated_conjecture,
op2(h(e11),h(e11)) = e20,
inference(rw,[status(thm)],[c_0_155,c_0_148]) ).
cnf(c_0_159,negated_conjecture,
h(e11) = e21,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_156]),c_0_148]),c_0_157]) ).
cnf(c_0_160,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_158,c_0_159]),c_0_159]),c_0_137]),c_0_149]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG042+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 8 14:33:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 7.63/2.30 # ENIGMATIC: Solved by autoschedule:
% 7.63/2.30 # No SInE strategy applied
% 7.63/2.30 # Trying AutoSched0 for 150 seconds
% 7.63/2.30 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.63/2.30 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.63/2.30 #
% 7.63/2.30 # Preprocessing time : 0.024 s
% 7.63/2.30
% 7.63/2.30 # Proof found!
% 7.63/2.30 # SZS status Theorem
% 7.63/2.30 # SZS output start CNFRefutation
% See solution above
% 7.63/2.30 # Training examples: 0 positive, 0 negative
% 7.63/2.30
% 7.63/2.30 # -------------------------------------------------
% 7.63/2.30 # User time : 0.031 s
% 7.63/2.30 # System time : 0.003 s
% 7.63/2.30 # Total time : 0.034 s
% 7.63/2.30 # Maximum resident set size: 7124 pages
% 7.63/2.30
%------------------------------------------------------------------------------