TSTP Solution File: GRP667+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP667+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:09 EDT 2022
% Result : Theorem 32.25s 5.51s
% Output : CNFRefutation 32.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of clauses : 60 ( 57 unt; 0 nHn; 7 RR)
% Number of literals : 63 ( 62 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 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 : 120 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_4) ).
cnf(i_0_8,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_8) ).
cnf(i_0_3,plain,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_3) ).
cnf(i_0_6,plain,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_6) ).
cnf(i_0_7,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),X3) = mult(mult(X1,X2),mult(mult(X3,X2),X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_7) ).
cnf(i_0_5,plain,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_5) ).
cnf(i_0_2,plain,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_2) ).
cnf(i_0_1,plain,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_1) ).
cnf(i_0_9,plain,
mult(f(X1),f(X1)) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_9) ).
cnf(i_0_10,plain,
( mult(mult(mult(X1,X2),X1),X3) = mult(X1,mult(X2,mult(X1,X3)))
| mult(mult(mult(X2,X1),X3),X1) != mult(X2,mult(X1,mult(X3,X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_10) ).
cnf(i_0_13,negated_conjecture,
mult(mult(mult(a,b),a),c) != mult(a,mult(b,mult(a,c))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1xq41cyy/input.p',i_0_13) ).
cnf(c_0_25,plain,
rd(mult(X1,X2),X2) = X1,
i_0_4 ).
cnf(c_0_26,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
i_0_8 ).
cnf(c_0_27,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
mult(rd(X1,X2),X2) = X1,
i_0_3 ).
cnf(c_0_29,plain,
mult(unit,X1) = X1,
i_0_6 ).
cnf(c_0_30,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),X3) = mult(mult(X1,X2),mult(mult(X3,X2),X3)),
i_0_7 ).
cnf(c_0_31,plain,
rd(mult(X1,X2),X1) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
mult(X1,unit) = X1,
i_0_5 ).
cnf(c_0_33,plain,
rd(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_34,plain,
mult(mult(X1,mult(X2,mult(X3,X2))),X3) = mult(mult(X1,X2),mult(X3,mult(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_26]),c_0_26]) ).
cnf(c_0_35,plain,
ld(X1,mult(X1,X2)) = X2,
i_0_2 ).
cnf(c_0_36,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_37,plain,
mult(rd(X1,X2),mult(X2,rd(X1,X2))) = mult(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_38,plain,
rd(mult(mult(X1,X2),mult(X3,mult(X2,X3))),X3) = mult(X1,mult(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_39,plain,
rd(unit,X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
mult(mult(X1,mult(X2,X3)),rd(X3,X2)) = mult(mult(X1,X2),mult(X3,rd(X3,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_37]) ).
cnf(c_0_41,plain,
rd(mult(mult(X1,X2),mult(X3,rd(X3,X2))),rd(X3,X2)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_37]),c_0_28]) ).
cnf(c_0_42,plain,
mult(ld(X1,unit),X1) = unit,
inference(spm,[status(thm)],[c_0_28,c_0_39]) ).
cnf(c_0_43,plain,
mult(mult(rd(X1,mult(X2,X3)),X2),mult(X3,rd(X3,X2))) = mult(X1,rd(X3,X2)),
inference(spm,[status(thm)],[c_0_40,c_0_28]) ).
cnf(c_0_44,plain,
mult(ld(X1,unit),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_29]),c_0_25]) ).
cnf(c_0_45,plain,
mult(X1,ld(X1,X2)) = X2,
i_0_1 ).
cnf(c_0_46,plain,
rd(mult(X1,rd(X2,X3)),mult(X2,rd(X2,X3))) = mult(rd(X1,mult(X3,X2)),X3),
inference(spm,[status(thm)],[c_0_25,c_0_43]) ).
cnf(c_0_47,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_48,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_34]),c_0_32]),c_0_29]),c_0_29]) ).
cnf(c_0_50,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_25,c_0_45]) ).
cnf(c_0_51,plain,
ld(mult(X1,X2),X1) = ld(X2,unit),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_29]),c_0_47]),c_0_39]),c_0_48]) ).
cnf(c_0_52,plain,
ld(ld(X1,unit),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_53,plain,
ld(rd(X1,X2),unit) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_47,c_0_28]) ).
cnf(c_0_54,plain,
rd(mult(X1,mult(X2,X2)),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_49]) ).
cnf(c_0_55,plain,
mult(f(X1),f(X1)) = X1,
i_0_9 ).
cnf(c_0_56,plain,
rd(X1,ld(X2,unit)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
ld(rd(X1,X2),X3) = mult(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
rd(mult(X1,X2),f(X2)) = mult(X1,f(X2)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
mult(mult(X1,rd(X2,X3)),mult(X3,rd(X3,rd(X2,X3)))) = mult(mult(X1,X2),rd(X3,rd(X2,X3))),
inference(spm,[status(thm)],[c_0_40,c_0_28]) ).
cnf(c_0_60,plain,
rd(X1,rd(X2,X3)) = mult(X1,rd(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_32]) ).
cnf(c_0_61,plain,
mult(rd(X1,X2),f(X2)) = rd(X1,f(X2)),
inference(spm,[status(thm)],[c_0_58,c_0_28]) ).
cnf(c_0_62,plain,
mult(mult(X1,X2),ld(X2,unit)) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_51]) ).
cnf(c_0_63,plain,
mult(mult(X1,rd(X2,X3)),mult(X3,mult(X3,rd(X3,X2)))) = mult(mult(X1,X2),mult(X3,rd(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_60]) ).
cnf(c_0_64,plain,
mult(f(X1),rd(f(X1),X2)) = rd(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_61]),c_0_53]),c_0_60]) ).
cnf(c_0_65,plain,
mult(X1,ld(X2,unit)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_62,c_0_28]) ).
cnf(c_0_66,plain,
( mult(mult(mult(X1,X2),X1),X3) = mult(X1,mult(X2,mult(X1,X3)))
| mult(mult(mult(X2,X1),X3),X1) != mult(X2,mult(X1,mult(X3,X1))) ),
i_0_10 ).
cnf(c_0_67,plain,
rd(mult(X1,mult(X2,X3)),X2) = mult(mult(X1,X2),rd(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_63,c_0_58]),c_0_64]),c_0_47]),c_0_65]),c_0_40]),c_0_64]),c_0_64]),c_0_47]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
mult(mult(mult(a,b),a),c) != mult(a,mult(b,mult(a,c))),
i_0_13 ).
cnf(c_0_69,plain,
( mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3)))
| mult(mult(mult(X2,X1),X3),X1) != mult(X2,mult(X1,mult(X3,X1))) ),
inference(rw,[status(thm)],[c_0_66,c_0_26]) ).
cnf(c_0_70,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(X2,mult(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_67]),c_0_25]) ).
cnf(c_0_71,negated_conjecture,
mult(mult(a,mult(b,a)),c) != mult(a,mult(b,mult(a,c))),
inference(rw,[status(thm)],[c_0_68,c_0_26]) ).
cnf(c_0_72,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP667+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 13:57:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 32.25/5.51 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 32.25/5.51 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 24; version: 991; iters: 150)
% 32.25/5.51 # Preprocessing time : 0.843 s
% 32.25/5.51 # Presaturation interreduction done
% 32.25/5.51
% 32.25/5.51 # Proof found!
% 32.25/5.51 # SZS status Theorem
% 32.25/5.51 # SZS output start CNFRefutation
% See solution above
% 32.25/5.51 # Training examples: 0 positive, 0 negative
% 32.25/5.51
% 32.25/5.51 # -------------------------------------------------
% 32.25/5.51 # User time : 2.841 s
% 32.25/5.51 # System time : 0.144 s
% 32.25/5.51 # Total time : 2.985 s
% 32.25/5.51 # ...preprocessing : 0.843 s
% 32.25/5.51 # ...main loop : 2.141 s
% 32.25/5.51 # Maximum resident set size: 167024 pages
% 32.25/5.51
%------------------------------------------------------------------------------