%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP671-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 : n016.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:00 PM UTC 2026
% Result : Unsatisfiable 5.25s 1.21s
% Output : CNFRefutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 3 RR)
% Number of literals : 14 ( 13 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t8,axiom,
mult(mult(mult(X1,mult(X2,X3)),X1),X2) = mult(mult(X1,X2),mult(X3,mult(X1,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t41,plain,
mult(mult(mult(X1,mult(X2,X3)),X1),X2) = mult(mult(X1,X2),mult(X3,mult(X1,X2))),
inference(orient,[status(thm)],[t8]) ).
cnf(t0,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t10,plain,
mult(X1,unit) = X1,
inference(orient,[status(thm)],[t0]) ).
cnf(t43,plain,
mult(mult(X1,unit),mult(X2,mult(X1,unit))) = mult(mult(X1,mult(unit,X2)),X1),
inference(cp,[status(thm)],[t41,t10]) ).
cnf(t183,plain,
mult(X1,mult(X2,mult(X1,unit))) = mult(mult(X1,mult(unit,X2)),X1),
inference(step,[status(thm)],[t43,t10]) ).
cnf(t184,plain,
mult(X1,mult(X2,X1)) = mult(mult(X1,mult(unit,X2)),X1),
inference(step,[status(thm)],[t183,t10]) ).
cnf(t1,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t15,plain,
mult(unit,X1) = X1,
inference(orient,[status(thm)],[t1]) ).
cnf(t185,plain,
mult(X1,mult(X2,X1)) = mult(mult(X1,X2),X1),
inference(step,[status(thm)],[t184,t15]) ).
cnf(t166,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(orient,[status(thm)],[t185]) ).
cnf(goal_0,negated_conjecture,
mult(mult(a,b),a) != mult(a,mult(b,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
mult(a,mult(b,a)) != mult(a,mult(b,a)),
inference(rw,[status(thm)],[goal_0,t166]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP671-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 15:43:41 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.25/1.21 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.25/1.21 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------