%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP711+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:23 EDT 2022
% Result : Theorem 4.41s 2.30s
% Output : CNFRefutation 4.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 31 ( 29 unt; 2 nHn; 6 RR)
% Number of literals : 33 ( 32 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-__unckoi/input.p',i_0_1) ).
cnf(i_0_3,plain,
mult(mult(mult(X1,X2),X2),X3) = mult(X1,mult(X2,mult(X2,X3))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-__unckoi/input.p',i_0_3) ).
cnf(i_0_5,plain,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-__unckoi/input.p',i_0_5) ).
cnf(i_0_2,plain,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-__unckoi/input.p',i_0_2) ).
cnf(i_0_4,plain,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-__unckoi/input.p',i_0_4) ).
cnf(i_0_9,negated_conjecture,
( mult(esk1_0,esk2_0) = mult(esk1_0,esk3_0)
| mult(esk2_0,esk1_0) = mult(esk3_0,esk1_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-__unckoi/input.p',i_0_9) ).
cnf(i_0_6,negated_conjecture,
esk2_0 != esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-__unckoi/input.p',i_0_6) ).
cnf(c_0_17,plain,
mult(X1,unit) = X1,
i_0_1 ).
cnf(c_0_18,plain,
mult(mult(mult(X1,X2),X2),X3) = mult(X1,mult(X2,mult(X2,X3))),
i_0_3 ).
cnf(c_0_19,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_20,plain,
mult(i(X1),X1) = unit,
i_0_5 ).
cnf(c_0_21,plain,
mult(unit,X1) = X1,
i_0_2 ).
cnf(c_0_22,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,plain,
mult(X1,i(X1)) = unit,
i_0_4 ).
cnf(c_0_25,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_21]) ).
cnf(c_0_26,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_21]) ).
cnf(c_0_28,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_24]),c_0_21]) ).
cnf(c_0_29,plain,
mult(X1,mult(X1,i(mult(X1,X1)))) = unit,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_23]),c_0_20]),c_0_17]) ).
cnf(c_0_31,plain,
mult(mult(X1,mult(X2,mult(X2,X3))),X3) = mult(X1,mult(X2,mult(X2,mult(X3,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_22]),c_0_22]) ).
cnf(c_0_32,plain,
mult(i(X1),i(X1)) = i(mult(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24]),c_0_17]) ).
cnf(c_0_33,plain,
mult(X1,i(mult(X1,X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_29]),c_0_17]) ).
cnf(c_0_34,plain,
mult(X1,mult(X1,mult(i(mult(X1,X1)),X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_30]),c_0_25]) ).
cnf(c_0_35,plain,
mult(mult(X1,X2),i(X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_17]),c_0_32]),c_0_33]),c_0_24]),c_0_17]) ).
cnf(c_0_36,negated_conjecture,
( mult(esk1_0,esk2_0) = mult(esk1_0,esk3_0)
| mult(esk2_0,esk1_0) = mult(esk3_0,esk1_0) ),
i_0_9 ).
cnf(c_0_37,negated_conjecture,
esk2_0 != esk3_0,
i_0_6 ).
cnf(c_0_38,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_26,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
mult(esk1_0,esk2_0) = mult(esk1_0,esk3_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_35]),c_0_37]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_38]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP711+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n007.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 08:57:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 4.41/2.30 # ENIGMATIC: Solved by autoschedule:
% 4.41/2.30 # No SInE strategy applied
% 4.41/2.30 # Trying AutoSched0 for 150 seconds
% 4.41/2.30 # AutoSched0-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S
% 4.41/2.30 # and selection function SelectNewComplexAHPNS.
% 4.41/2.30 #
% 4.41/2.30 # Preprocessing time : 0.013 s
% 4.41/2.30 # Presaturation interreduction done
% 4.41/2.30
% 4.41/2.30 # Proof found!
% 4.41/2.30 # SZS status Theorem
% 4.41/2.30 # SZS output start CNFRefutation
% See solution above
% 4.41/2.31 # Training examples: 0 positive, 0 negative
% 4.41/2.31
% 4.41/2.31 # -------------------------------------------------
% 4.41/2.31 # User time : 0.019 s
% 4.41/2.31 # System time : 0.004 s
% 4.41/2.31 # Total time : 0.023 s
% 4.41/2.31 # Maximum resident set size: 7116 pages
% 4.41/2.31
%------------------------------------------------------------------------------