%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP699-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n012.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:28:04 PM UTC 2026
% Result : Unsatisfiable 7.43s 1.35s
% Output : CNFRefutation 7.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 3 RR)
% Number of literals : 25 ( 24 equ; 2 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; 4 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t6,axiom,
mult(mult(X1,mult(X2,mult(X2,X3))),X2) = mult(mult(X1,X2),mult(X2,mult(X3,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t24,plain,
mult(mult(X1,mult(X2,mult(X2,X3))),X2) = mult(mult(X1,X2),mult(X2,mult(X3,X2))),
inference(orient,[status(thm)],[t6]) ).
cnf(t3,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t15,plain,
mult(X1,ld(X1,X2)) = X2,
inference(orient,[status(thm)],[t3]) ).
cnf(t27,plain,
mult(mult(X1,X2),mult(X2,mult(ld(X2,X3),X2))) = mult(mult(X1,mult(X2,X3)),X2),
inference(cp,[status(thm)],[t24,t15]) ).
cnf(t148,plain,
mult(mult(X1,X2),mult(X2,mult(ld(X2,X3),X2))) = mult(mult(X1,mult(X2,X3)),X2),
inference(orient,[status(thm)],[t27]) ).
cnf(t2,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t10,plain,
ld(X1,mult(X1,X2)) = X2,
inference(orient,[status(thm)],[t2]) ).
cnf(t1,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t9,plain,
mult(unit,X1) = X1,
inference(orient,[status(thm)],[t1]) ).
cnf(t26,plain,
mult(mult(unit,X1),mult(X1,mult(X2,X1))) = mult(mult(X1,mult(X1,X2)),X1),
inference(cp,[status(thm)],[t24,t9]) ).
cnf(t1729,plain,
mult(X1,mult(X1,mult(X2,X1))) = mult(mult(X1,mult(X1,X2)),X1),
inference(step,[status(thm)],[t26,t9]) ).
cnf(t51,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,mult(X2,X1))),
inference(orient,[status(thm)],[t1729]) ).
cnf(t52,plain,
mult(X1,mult(X1,mult(ld(X1,X2),X1))) = mult(mult(X1,X2),X1),
inference(cp,[status(thm)],[t51,t15]) ).
cnf(t199,plain,
mult(X1,mult(X1,mult(ld(X1,X2),X1))) = mult(mult(X1,X2),X1),
inference(orient,[status(thm)],[t52]) ).
cnf(t201,plain,
mult(X1,mult(ld(X1,X2),X1)) = ld(X1,mult(mult(X1,X2),X1)),
inference(cp,[status(thm)],[t10,t199]) ).
cnf(t213,plain,
ld(X1,mult(mult(X1,X2),X1)) = mult(X1,mult(ld(X1,X2),X1)),
inference(orient,[status(thm)],[t201]) ).
cnf(t215,plain,
mult(X1,mult(ld(X1,ld(X1,X2)),X1)) = ld(X1,mult(X2,X1)),
inference(cp,[status(thm)],[t213,t15]) ).
cnf(t646,plain,
mult(X1,mult(ld(X1,ld(X1,X2)),X1)) = ld(X1,mult(X2,X1)),
inference(orient,[status(thm)],[t215]) ).
cnf(t655,plain,
mult(mult(X1,mult(X2,ld(X2,X3))),X2) = mult(mult(X1,X2),ld(X2,mult(X3,X2))),
inference(cp,[status(thm)],[t148,t646]) ).
cnf(t1760,plain,
mult(mult(X1,X3),X2) = mult(mult(X1,X2),ld(X2,mult(X3,X2))),
inference(step,[status(thm)],[t655,t15]) ).
cnf(t1632,plain,
mult(mult(X1,X2),ld(X2,mult(X3,X2))) = mult(mult(X1,X3),X2),
inference(orient,[status(thm)],[t1760]) ).
cnf(goal_0,negated_conjecture,
mult(mult(a,c),ld(c,mult(b,c))) != mult(mult(a,b),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
mult(mult(a,b),c) != mult(mult(a,b),c),
inference(rw,[status(thm)],[goal_0,t1632]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP699-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Wed Sep 23 15:44:07 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.43/1.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.43/1.35 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------