%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP665+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:07 EDT 2022
% Result : Theorem 8.39s 2.50s
% Output : CNFRefutation 8.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 19 unt; 0 nHn; 5 RR)
% Number of literals : 28 ( 27 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
mult(mult(X1,X2),ld(X2,mult(X3,X2))) = mult(mult(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba2ub9f9/input.p',i_0_8) ).
cnf(i_0_3,plain,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba2ub9f9/input.p',i_0_3) ).
cnf(i_0_2,plain,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba2ub9f9/input.p',i_0_2) ).
cnf(i_0_9,plain,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba2ub9f9/input.p',i_0_9) ).
cnf(i_0_4,plain,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba2ub9f9/input.p',i_0_4) ).
cnf(i_0_10,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(esk1_0,op_c),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(mult(esk1_0,esk2_0),op_c) != mult(esk1_0,mult(esk2_0,op_c)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba2ub9f9/input.p',i_0_10) ).
cnf(i_0_7,plain,
mult(rd(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ba2ub9f9/input.p',i_0_7) ).
cnf(c_0_18,plain,
mult(mult(X1,X2),ld(X2,mult(X3,X2))) = mult(mult(X1,X3),X2),
i_0_8 ).
cnf(c_0_19,plain,
mult(rd(X1,X2),X2) = X1,
i_0_3 ).
cnf(c_0_20,plain,
ld(X1,mult(X1,X2)) = X2,
i_0_2 ).
cnf(c_0_21,plain,
mult(op_c,X1) = mult(X1,op_c),
i_0_9 ).
cnf(c_0_22,plain,
mult(mult(X1,X2),ld(X2,X3)) = mult(mult(X1,rd(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
ld(X1,mult(op_c,X1)) = op_c,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
rd(mult(X1,X2),X2) = X1,
i_0_4 ).
cnf(c_0_25,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(esk1_0,op_c),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(mult(esk1_0,esk2_0),op_c) != mult(esk1_0,mult(esk2_0,op_c)) ),
i_0_10 ).
cnf(c_0_26,plain,
mult(mult(X1,op_c),X2) = mult(op_c,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(op_c,esk1_0),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(esk1_0,mult(op_c,esk2_0)) != mult(op_c,mult(esk1_0,esk2_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_28,plain,
mult(mult(op_c,X1),X2) = mult(op_c,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_29,plain,
mult(rd(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(X2,X3)),
i_0_7 ).
cnf(c_0_30,negated_conjecture,
mult(esk1_0,mult(op_c,esk2_0)) != mult(op_c,mult(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28])])]) ).
cnf(c_0_31,plain,
mult(X1,mult(op_c,X2)) = mult(op_c,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_24]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP665+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n007.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 : Tue Jun 14 00:39:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 8.39/2.50 # ENIGMATIC: Solved by autoschedule:
% 8.39/2.50 # No SInE strategy applied
% 8.39/2.50 # Trying AutoSched0 for 150 seconds
% 8.39/2.50 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 8.39/2.50 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.39/2.50 #
% 8.39/2.50 # Preprocessing time : 0.019 s
% 8.39/2.50 # Presaturation interreduction done
% 8.39/2.50
% 8.39/2.50 # Proof found!
% 8.39/2.50 # SZS status Theorem
% 8.39/2.50 # SZS output start CNFRefutation
% See solution above
% 8.39/2.50 # Training examples: 0 positive, 0 negative
% 8.39/2.50
% 8.39/2.50 # -------------------------------------------------
% 8.39/2.50 # User time : 0.124 s
% 8.39/2.50 # System time : 0.013 s
% 8.39/2.50 # Total time : 0.137 s
% 8.39/2.50 # Maximum resident set size: 7120 pages
% 8.39/2.50
%------------------------------------------------------------------------------