TSTP Solution File: GRP748+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP748+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 : Sat Jul 16 08:40:30 EDT 2022
% Result : Theorem 7.84s 2.40s
% Output : CNFRefutation 7.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 33 unt; 4 nHn; 10 RR)
% Number of literals : 41 ( 40 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_7) ).
cnf(i_0_10,plain,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_10) ).
cnf(i_0_6,plain,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_6) ).
cnf(i_0_8,plain,
mult(mult(X1,X2),i(X2)) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_8) ).
cnf(i_0_9,plain,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_9) ).
cnf(i_0_3,plain,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_3) ).
cnf(i_0_14,negated_conjecture,
mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0) != mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_14) ).
cnf(i_0_11,plain,
( mult(X1,X2) = mult(X2,X1)
| mult(i(X1),mult(X1,X2)) = X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_11) ).
cnf(i_0_4,plain,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_4) ).
cnf(i_0_5,plain,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_5) ).
cnf(i_0_2,plain,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-34tnat9g/input.p',i_0_2) ).
cnf(c_0_26,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
i_0_7 ).
cnf(c_0_27,plain,
mult(i(X1),X1) = unit,
i_0_10 ).
cnf(c_0_28,plain,
mult(unit,X1) = X1,
i_0_6 ).
cnf(c_0_29,plain,
mult(mult(X1,X2),i(X2)) = X1,
i_0_8 ).
cnf(c_0_30,plain,
mult(X1,i(X1)) = unit,
i_0_9 ).
cnf(c_0_31,plain,
mult(rd(X1,X2),X2) = X1,
i_0_3 ).
cnf(c_0_32,negated_conjecture,
mult(mult(mult(esk4_0,esk6_0),esk5_0),esk6_0) != mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))),
i_0_14 ).
cnf(c_0_33,plain,
( mult(X1,X2) = mult(X2,X1)
| mult(i(X1),mult(X1,X2)) = X2 ),
i_0_11 ).
cnf(c_0_34,plain,
mult(i(X1),mult(mult(X1,X2),X1)) = mult(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_35,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_28]) ).
cnf(c_0_36,plain,
mult(X1,i(X2)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_37,plain,
rd(mult(X1,X2),X2) = X1,
i_0_4 ).
cnf(c_0_38,plain,
mult(X1,unit) = X1,
i_0_5 ).
cnf(c_0_39,negated_conjecture,
mult(esk4_0,mult(mult(esk6_0,esk5_0),esk6_0)) != mult(esk4_0,mult(esk6_0,mult(esk5_0,esk6_0))),
inference(rw,[status(thm)],[c_0_32,c_0_26]) ).
cnf(c_0_40,plain,
( mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1))
| mult(X2,X1) = mult(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]),c_0_37]) ).
cnf(c_0_41,plain,
ld(X1,mult(X1,X2)) = X2,
i_0_2 ).
cnf(c_0_42,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_38]),c_0_38]) ).
cnf(c_0_43,negated_conjecture,
mult(esk5_0,esk6_0) = mult(esk6_0,esk5_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
ld(i(X1),mult(X2,X1)) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_41,c_0_34]) ).
cnf(c_0_45,plain,
mult(mult(esk6_0,esk5_0),esk6_0) = mult(esk5_0,mult(esk6_0,esk6_0)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
mult(esk4_0,mult(mult(esk6_0,esk5_0),esk6_0)) != mult(esk4_0,mult(esk6_0,mult(esk6_0,esk5_0))),
inference(rw,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_47,plain,
( ld(i(X1),X2) = mult(X1,X2)
| mult(X1,X2) = mult(X2,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_33]) ).
cnf(c_0_48,plain,
ld(i(esk6_0),mult(esk6_0,esk5_0)) = mult(esk5_0,mult(esk6_0,esk6_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_43]),c_0_45]) ).
cnf(c_0_49,negated_conjecture,
mult(esk4_0,mult(esk5_0,mult(esk6_0,esk6_0))) != mult(esk4_0,mult(esk6_0,mult(esk6_0,esk5_0))),
inference(rw,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_50,plain,
mult(esk5_0,mult(esk6_0,esk6_0)) = mult(esk6_0,mult(esk6_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_45])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP748+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n029.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 : Mon Jun 13 21:46:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.84/2.40 # ENIGMATIC: Solved by autoschedule:
% 7.84/2.40 # No SInE strategy applied
% 7.84/2.40 # Trying AutoSched0 for 150 seconds
% 7.84/2.40 # AutoSched0-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S
% 7.84/2.40 # and selection function SelectNewComplexAHPNS.
% 7.84/2.40 #
% 7.84/2.40 # Preprocessing time : 0.023 s
% 7.84/2.40 # Presaturation interreduction done
% 7.84/2.40
% 7.84/2.40 # Proof found!
% 7.84/2.40 # SZS status Theorem
% 7.84/2.40 # SZS output start CNFRefutation
% See solution above
% 7.84/2.40 # Training examples: 0 positive, 0 negative
% 7.84/2.40
% 7.84/2.40 # -------------------------------------------------
% 7.84/2.40 # User time : 0.056 s
% 7.84/2.40 # System time : 0.008 s
% 7.84/2.40 # Total time : 0.064 s
% 7.84/2.40 # Maximum resident set size: 7124 pages
% 7.84/2.40
%------------------------------------------------------------------------------