%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP680-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 10:11:42 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.46s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of clauses : 58 ( 58 unt; 0 nHn; 10 RR)
% Number of literals : 58 ( 57 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
mult(i(op_c),a) != mult(a,i(op_c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c2,axiom,
mult(A,unit) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c3,plain,
mult(X,unit) = X,
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
X = mult(X,unit),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,plain,
mult(i(op_c),X) = mult(i(op_c),mult(X,unit)),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,axiom,
mult(op_c,A2) = mult(A2,op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(c7,plain,
mult(op_c,i(op_c)) = mult(i(op_c),op_c),
inference(substitution,[status(thm)],[c6]) ).
cnf(c8,plain,
mult(X,unit) = X,
inference(substitution,[status(thm)],[c2]) ).
cnf(c9,plain,
X = mult(X,unit),
inference(symmetry,[status(thm)],[c8]) ).
cnf(c10,plain,
mult(i(X),X) = mult(i(X),mult(X,unit)),
inference(congruence,[status(thm)],[c9]) ).
cnf(c11,axiom,
mult(i(A2),mult(A2,B)) = B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c12,plain,
mult(i(X),mult(X,unit)) = unit,
inference(substitution,[status(thm)],[c11]) ).
cnf(c13,plain,
mult(i(X),X) = unit,
inference(transitivity,[status(thm)],[c10,c12]) ).
cnf(c14,plain,
mult(i(op_c),op_c) = unit,
inference(substitution,[status(thm)],[c13]) ).
cnf(c15,plain,
mult(op_c,i(op_c)) = unit,
inference(transitivity,[status(thm)],[c7,c14]) ).
cnf(c16,plain,
unit = mult(op_c,i(op_c)),
inference(symmetry,[status(thm)],[c15]) ).
cnf(c17,plain,
mult(X,unit) = mult(X,mult(op_c,i(op_c))),
inference(congruence,[status(thm)],[c16]) ).
cnf(c18,plain,
mult(i(op_c),mult(X,unit)) = mult(i(op_c),mult(X,mult(op_c,i(op_c)))),
inference(congruence,[status(thm)],[c17]) ).
cnf(c19,plain,
mult(op_c,i(op_c)) = mult(i(op_c),op_c),
inference(substitution,[status(thm)],[c6]) ).
cnf(c20,plain,
mult(X,mult(op_c,i(op_c))) = mult(X,mult(i(op_c),op_c)),
inference(congruence,[status(thm)],[c19]) ).
cnf(c21,plain,
mult(i(op_c),mult(X,mult(op_c,i(op_c)))) = mult(i(op_c),mult(X,mult(i(op_c),op_c))),
inference(congruence,[status(thm)],[c20]) ).
cnf(c22,axiom,
mult(A2,mult(B2,mult(A2,C))) = mult(mult(A2,mult(B2,A2)),C),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c23,plain,
mult(i(op_c),mult(X,mult(i(op_c),op_c))) = mult(mult(i(op_c),mult(X,i(op_c))),op_c),
inference(substitution,[status(thm)],[c22]) ).
cnf(c24,plain,
mult(op_c,mult(i(op_c),mult(X,i(op_c)))) = mult(mult(i(op_c),mult(X,i(op_c))),op_c),
inference(substitution,[status(thm)],[c6]) ).
cnf(c25,plain,
mult(mult(i(op_c),mult(X,i(op_c))),op_c) = mult(op_c,mult(i(op_c),mult(X,i(op_c)))),
inference(symmetry,[status(thm)],[c24]) ).
cnf(c26,plain,
mult(i(X2),mult(X2,X)) = X,
inference(substitution,[status(thm)],[c11]) ).
cnf(c27,plain,
X2 = mult(i(X),mult(X,X2)),
inference(symmetry,[status(thm)],[c26]) ).
cnf(c28,plain,
rd(X2,mult(X,X2)) = rd(mult(i(X),mult(X,X2)),mult(X,X2)),
inference(congruence,[status(thm)],[c27]) ).
cnf(c29,axiom,
rd(mult(A2,B2),B2) = A2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c30,plain,
rd(mult(i(X),mult(X,X2)),mult(X,X2)) = i(X),
inference(substitution,[status(thm)],[c29]) ).
cnf(c31,plain,
rd(X2,mult(X,X2)) = i(X),
inference(transitivity,[status(thm)],[c28,c30]) ).
cnf(c32,plain,
rd(mult(X,op_c),mult(i(op_c),mult(X,op_c))) = i(i(op_c)),
inference(substitution,[status(thm)],[c31]) ).
cnf(c33,plain,
i(i(op_c)) = rd(mult(X,op_c),mult(i(op_c),mult(X,op_c))),
inference(symmetry,[status(thm)],[c32]) ).
cnf(c34,plain,
mult(op_c,X) = mult(X,op_c),
inference(substitution,[status(thm)],[c6]) ).
cnf(c35,plain,
mult(X,op_c) = mult(op_c,X),
inference(symmetry,[status(thm)],[c34]) ).
cnf(c36,plain,
mult(i(op_c),mult(X,op_c)) = mult(i(op_c),mult(op_c,X)),
inference(congruence,[status(thm)],[c35]) ).
cnf(c37,plain,
mult(i(op_c),mult(op_c,X)) = X,
inference(substitution,[status(thm)],[c11]) ).
cnf(c38,plain,
mult(i(op_c),mult(X,op_c)) = X,
inference(transitivity,[status(thm)],[c36,c37]) ).
cnf(c39,plain,
rd(mult(X,op_c),mult(i(op_c),mult(X,op_c))) = rd(mult(X,op_c),X),
inference(congruence,[status(thm)],[c38]) ).
cnf(c40,plain,
mult(op_c,X) = mult(X,op_c),
inference(substitution,[status(thm)],[c6]) ).
cnf(c41,plain,
mult(X,op_c) = mult(op_c,X),
inference(symmetry,[status(thm)],[c40]) ).
cnf(c42,plain,
rd(mult(X,op_c),X) = rd(mult(op_c,X),X),
inference(congruence,[status(thm)],[c41]) ).
cnf(c43,plain,
rd(mult(op_c,X),X) = op_c,
inference(substitution,[status(thm)],[c29]) ).
cnf(c44,plain,
rd(mult(X,op_c),X) = op_c,
inference(transitivity,[status(thm)],[c42,c43]) ).
cnf(c45,plain,
rd(mult(X,op_c),mult(i(op_c),mult(X,op_c))) = op_c,
inference(transitivity,[status(thm)],[c39,c44]) ).
cnf(c46,plain,
i(i(op_c)) = op_c,
inference(transitivity,[status(thm)],[c33,c45]) ).
cnf(c47,plain,
op_c = i(i(op_c)),
inference(symmetry,[status(thm)],[c46]) ).
cnf(c48,plain,
mult(op_c,mult(i(op_c),X)) = mult(i(i(op_c)),mult(i(op_c),X)),
inference(congruence,[status(thm)],[c47]) ).
cnf(c49,plain,
mult(i(i(op_c)),mult(i(op_c),X)) = X,
inference(substitution,[status(thm)],[c11]) ).
cnf(c50,plain,
mult(op_c,mult(i(op_c),X)) = X,
inference(transitivity,[status(thm)],[c48,c49]) ).
cnf(c51,plain,
mult(op_c,mult(i(op_c),mult(X,i(op_c)))) = mult(X,i(op_c)),
inference(substitution,[status(thm)],[c50]) ).
cnf(c52,plain,
mult(mult(i(op_c),mult(X,i(op_c))),op_c) = mult(X,i(op_c)),
inference(transitivity,[status(thm)],[c25,c51]) ).
cnf(c53,plain,
mult(i(op_c),mult(X,mult(i(op_c),op_c))) = mult(X,i(op_c)),
inference(transitivity,[status(thm)],[c23,c52]) ).
cnf(c54,plain,
mult(i(op_c),mult(X,mult(op_c,i(op_c)))) = mult(X,i(op_c)),
inference(transitivity,[status(thm)],[c21,c53]) ).
cnf(c55,plain,
mult(i(op_c),mult(X,unit)) = mult(X,i(op_c)),
inference(transitivity,[status(thm)],[c18,c54]) ).
cnf(c56,plain,
mult(i(op_c),X) = mult(X,i(op_c)),
inference(transitivity,[status(thm)],[c5,c55]) ).
cnf(c57,plain,
mult(i(op_c),a) = mult(a,i(op_c)),
inference(substitution,[status(thm)],[c56]) ).
cnf(c58,plain,
$false,
inference(resolution,[status(thm)],[c1,c57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP680-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 10:38:59 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.46 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.11/0.46
% 0.11/0.46 % SZS status Unsatisfiable
% 0.11/0.46
% 0.11/0.46 % SZS output start CNFRefutation
% See solution above
% 0.20/0.47
% 0.20/0.47 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------