TSTP Solution File: ALG204+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG204+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 15:32:58 EDT 2022
% Result : Theorem 7.90s 2.31s
% Output : CNFRefutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of clauses : 45 ( 37 unt; 8 nHn; 45 RR)
% Number of literals : 80 ( 75 equ; 16 neg)
% Maximal clause size : 8 ( 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; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_252,negated_conjecture,
op1(j(e20),j(e20)) = j(op2(e20,e20)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_252) ).
cnf(i_0_189,plain,
op2(e20,e20) = e20,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_189) ).
cnf(i_0_309,plain,
( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13
| j(e20) = e14
| j(e20) = e15
| j(e20) = e16
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_309) ).
cnf(i_0_302,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_302) ).
cnf(i_0_92,plain,
op1(e16,e16) = e10,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_92) ).
cnf(i_0_16,plain,
e16 != e10,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_16) ).
cnf(i_0_100,plain,
op1(e15,e15) = e11,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_100) ).
cnf(i_0_12,plain,
e15 != e11,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_12) ).
cnf(i_0_108,plain,
op1(e14,e14) = e12,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_108) ).
cnf(i_0_9,plain,
e14 != e12,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_9) ).
cnf(i_0_116,plain,
op1(e13,e13) = e14,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_116) ).
cnf(i_0_6,plain,
e14 != e13,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_6) ).
cnf(i_0_124,plain,
op1(e12,e12) = e15,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_124) ).
cnf(i_0_8,plain,
e15 != e12,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_8) ).
cnf(i_0_132,plain,
op1(e11,e11) = e16,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_132) ).
cnf(i_0_11,plain,
e16 != e11,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_11) ).
cnf(i_0_140,plain,
op1(e10,e10) = e13,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_140) ).
cnf(i_0_19,plain,
e13 != e10,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o5hprx3a/input.p',i_0_19) ).
cnf(c_0_328,negated_conjecture,
op1(j(e20),j(e20)) = j(op2(e20,e20)),
i_0_252 ).
cnf(c_0_329,plain,
op2(e20,e20) = e20,
i_0_189 ).
cnf(c_0_330,plain,
( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13
| j(e20) = e14
| j(e20) = e15
| j(e20) = e16
| ~ epred1_0 ),
i_0_309 ).
cnf(c_0_331,negated_conjecture,
epred1_0,
i_0_302 ).
cnf(c_0_332,negated_conjecture,
op1(j(e20),j(e20)) = j(e20),
inference(rw,[status(thm)],[c_0_328,c_0_329]) ).
cnf(c_0_333,plain,
( j(e20) = e16
| j(e20) = e15
| 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_330,c_0_331])]) ).
cnf(c_0_334,plain,
op1(e16,e16) = e10,
i_0_92 ).
cnf(c_0_335,plain,
e16 != e10,
i_0_16 ).
cnf(c_0_336,plain,
( j(e20) = e10
| j(e20) = e11
| j(e20) = e12
| j(e20) = e13
| j(e20) = e14
| j(e20) = e15 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_332,c_0_333]),c_0_334]),c_0_335]) ).
cnf(c_0_337,plain,
op1(e15,e15) = e11,
i_0_100 ).
cnf(c_0_338,plain,
e15 != e11,
i_0_12 ).
cnf(c_0_339,negated_conjecture,
( j(e20) = e14
| j(e20) = e13
| j(e20) = e12
| j(e20) = e11
| j(e20) = e10 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_332,c_0_336]),c_0_337]),c_0_338]) ).
cnf(c_0_340,plain,
op1(e14,e14) = e12,
i_0_108 ).
cnf(c_0_341,plain,
e14 != e12,
i_0_9 ).
cnf(c_0_342,negated_conjecture,
( 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_332,c_0_339]),c_0_340]),c_0_341]) ).
cnf(c_0_343,plain,
op1(e13,e13) = e14,
i_0_116 ).
cnf(c_0_344,plain,
e14 != e13,
i_0_6 ).
cnf(c_0_345,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_332,c_0_342]),c_0_343]),c_0_344]) ).
cnf(c_0_346,plain,
op1(e12,e12) = e15,
i_0_124 ).
cnf(c_0_347,plain,
e15 != e12,
i_0_8 ).
cnf(c_0_348,negated_conjecture,
( j(e20) = e10
| j(e20) = e11 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_332,c_0_345]),c_0_346]),c_0_347]) ).
cnf(c_0_349,plain,
op1(e11,e11) = e16,
i_0_132 ).
cnf(c_0_350,plain,
e16 != e11,
i_0_11 ).
cnf(c_0_351,negated_conjecture,
j(e20) = e10,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_332,c_0_348]),c_0_349]),c_0_350]) ).
cnf(c_0_352,plain,
op1(e10,e10) = e13,
i_0_140 ).
cnf(c_0_353,plain,
e13 != e10,
i_0_19 ).
cnf(c_0_354,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_332,c_0_351]),c_0_351]),c_0_352]),c_0_351]),c_0_353]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG204+1 : TPTP v8.1.0. Released v2.7.0.
% 0.00/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 06:11:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.90/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.90/2.31 # No SInE strategy applied
% 7.90/2.31 # Trying AutoSched0 for 150 seconds
% 7.90/2.31 # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.90/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.90/2.31 #
% 7.90/2.31 # Preprocessing time : 0.024 s
% 7.90/2.31
% 7.90/2.31 # Proof found!
% 7.90/2.31 # SZS status Theorem
% 7.90/2.31 # SZS output start CNFRefutation
% See solution above
% 7.90/2.31 # Training examples: 0 positive, 0 negative
% 7.90/2.31
% 7.90/2.31 # -------------------------------------------------
% 7.90/2.31 # User time : 0.028 s
% 7.90/2.31 # System time : 0.008 s
% 7.90/2.31 # Total time : 0.036 s
% 7.90/2.31 # Maximum resident set size: 7120 pages
% 7.90/2.31
%------------------------------------------------------------------------------