%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP603-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 01:27:38 PM UTC 2026
% Result : Unsatisfiable 4.82s 1.21s
% Output : CNFRefutation 4.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 3
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 3 RR)
% Number of literals : 34 ( 33 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
inverse(double_divide(inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,X3))))),X3)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t2,plain,
inverse(double_divide(inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,X3))))),X3)) = X2,
inference(orient,[status(thm)],[t1]) ).
cnf(t0,axiom,
inverse(double_divide(X1,X2)) = multiply(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t4,plain,
inverse(double_divide(X1,X2)) = multiply(X2,X1),
inference(orient,[status(thm)],[t0]) ).
cnf(t196,plain,
multiply(X3,inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,X3)))))) = X2,
inference(step,[status(thm)],[t2,t4]) ).
cnf(t197,plain,
multiply(X3,multiply(inverse(double_divide(X2,double_divide(X1,X3))),X1)) = X2,
inference(step,[status(thm)],[t196,t4]) ).
cnf(t198,plain,
multiply(X3,multiply(multiply(double_divide(X1,X3),X2),X1)) = X2,
inference(step,[status(thm)],[t197,t4]) ).
cnf(t5,plain,
multiply(X3,multiply(multiply(double_divide(X1,X3),X2),X1)) = X2,
inference(rw,[status(thm)],[t198]) ).
cnf(t6,plain,
multiply(X1,multiply(multiply(double_divide(X2,X1),X3),X2)) = X3,
inference(orient,[status(thm)],[t5]) ).
cnf(t7,plain,
multiply(multiply(double_divide(X1,double_divide(X2,X3)),Y3),X1) = multiply(X3,multiply(Y3,X2)),
inference(cp,[status(thm)],[t6,t6]) ).
cnf(t8,plain,
multiply(multiply(double_divide(X1,double_divide(X2,X3)),Y3),X1) = multiply(X3,multiply(Y3,X2)),
inference(orient,[status(thm)],[t7]) ).
cnf(t9,plain,
X1 = multiply(double_divide(X2,X3),multiply(X3,multiply(X1,X2))),
inference(cp,[status(thm)],[t6,t8]) ).
cnf(t10,plain,
multiply(double_divide(X1,X2),multiply(X2,multiply(X3,X1))) = X3,
inference(orient,[status(thm)],[t9]) ).
cnf(t15,plain,
double_divide(X1,X2) = multiply(double_divide(multiply(X2,multiply(X3,X1)),Y3),multiply(Y3,X3)),
inference(cp,[status(thm)],[t10,t10]) ).
cnf(t23,plain,
multiply(double_divide(multiply(X1,multiply(X2,X3)),Y3),multiply(Y3,X2)) = double_divide(X3,X1),
inference(orient,[status(thm)],[t15]) ).
cnf(t14,plain,
X1 = multiply(double_divide(multiply(X2,X3),double_divide(X3,X1)),X2),
inference(cp,[status(thm)],[t10,t10]) ).
cnf(t16,plain,
multiply(double_divide(multiply(X1,X2),double_divide(X2,X3)),X1) = X3,
inference(orient,[status(thm)],[t14]) ).
cnf(t24,plain,
double_divide(X1,multiply(double_divide(multiply(X2,X1),X3),X2)) = X3,
inference(cp,[status(thm)],[t23,t16]) ).
cnf(t42,plain,
double_divide(X1,multiply(double_divide(multiply(X2,X1),X3),X2)) = X3,
inference(orient,[status(thm)],[t24]) ).
cnf(t43,plain,
X1 = double_divide(multiply(X2,X3),double_divide(X3,multiply(X1,X2))),
inference(cp,[status(thm)],[t42,t23]) ).
cnf(t56,plain,
double_divide(multiply(X1,X2),double_divide(X2,multiply(X3,X1))) = X3,
inference(orient,[status(thm)],[t43]) ).
cnf(t67,plain,
multiply(double_divide(X1,multiply(X2,X3)),multiply(X3,X1)) = inverse(X2),
inference(cp,[status(thm)],[t4,t56]) ).
cnf(t92,plain,
multiply(double_divide(X1,multiply(X2,X3)),multiply(X3,X1)) = inverse(X2),
inference(orient,[status(thm)],[t67]) ).
cnf(t112,plain,
multiply(X1,X2) = multiply(multiply(X3,X1),multiply(inverse(X3),X2)),
inference(cp,[status(thm)],[t6,t92]) ).
cnf(t118,plain,
multiply(multiply(X1,X2),multiply(inverse(X1),X3)) = multiply(X2,X3),
inference(orient,[status(thm)],[t112]) ).
cnf(t120,plain,
multiply(multiply(X1,multiply(X2,X3)),Y3) = multiply(X2,multiply(inverse(double_divide(X3,X1)),Y3)),
inference(cp,[status(thm)],[t118,t10]) ).
cnf(t199,plain,
multiply(multiply(X1,multiply(X2,X3)),Y3) = multiply(X2,multiply(multiply(X1,X3),Y3)),
inference(step,[status(thm)],[t120,t4]) ).
cnf(t140,plain,
multiply(multiply(X1,multiply(X2,X3)),Y3) = multiply(X2,multiply(multiply(X1,X3),Y3)),
inference(orient,[status(thm)],[t199]) ).
cnf(t141,plain,
multiply(X1,multiply(multiply(X2,X3),multiply(inverse(X2),Y3))) = multiply(multiply(X1,X3),Y3),
inference(cp,[status(thm)],[t140,t118]) ).
cnf(t200,plain,
multiply(X1,multiply(X3,Y3)) = multiply(multiply(X1,X3),Y3),
inference(step,[status(thm)],[t141,t118]) ).
cnf(t175,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(orient,[status(thm)],[t200]) ).
cnf(goal_0,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[goal_0,t175]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP603-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 15:14:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.82/1.21 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.82/1.21 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------