%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP704-12 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n019.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:14 PM UTC 2026
% Result : Unsatisfiable 6.36s 1.49s
% Output : CNFRefutation 6.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 5 RR)
% Number of literals : 19 ( 18 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t9,axiom,
mult(mult(X1,op_c),X2) = mult(X1,mult(op_c,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t62,plain,
mult(mult(X1,op_c),X2) = mult(X1,mult(op_c,X2)),
inference(orient,[status(thm)],[t9]) ).
cnf(t7,axiom,
mult(X1,mult(X2,ld(mult(X1,X2),op_c))) = op_f,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t46,plain,
mult(X1,mult(X2,ld(mult(X1,X2),op_c))) = op_f,
inference(orient,[status(thm)],[t7]) ).
cnf(t1,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t17,plain,
mult(unit,X1) = X1,
inference(orient,[status(thm)],[t1]) ).
cnf(t48,plain,
op_f = mult(X1,ld(mult(unit,X1),op_c)),
inference(cp,[status(thm)],[t46,t17]) ).
cnf(t191,plain,
op_f = mult(X1,ld(X1,op_c)),
inference(step,[status(thm)],[t48,t17]) ).
cnf(t4,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t13,plain,
mult(X1,ld(X1,X2)) = X2,
inference(orient,[status(thm)],[t4]) ).
cnf(t192,plain,
op_f = op_c,
inference(step,[status(thm)],[t191,t13]) ).
cnf(t113,plain,
op_c = op_f,
inference(orient,[status(thm)],[t192]) ).
cnf(t196,plain,
mult(mult(X1,op_f),X2) = mult(X1,mult(op_c,X2)),
inference(step,[status(thm)],[t62,t113]) ).
cnf(t197,plain,
mult(mult(X1,op_f),X2) = mult(X1,mult(op_f,X2)),
inference(step,[status(thm)],[t196,t113]) ).
cnf(t116,plain,
mult(mult(X1,op_f),X2) = mult(X1,mult(op_f,X2)),
inference(rw,[status(thm)],[t197]) ).
cnf(t180,plain,
mult(mult(X1,op_f),X2) = mult(X1,mult(op_f,X2)),
inference(orient,[status(thm)],[t116]) ).
cnf(goal_0,negated_conjecture,
mult(x4,mult(op_f,x5)) != mult(mult(x4,op_f),x5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
mult(x4,mult(op_f,x5)) != mult(x4,mult(op_f,x5)),
inference(rw,[status(thm)],[goal_0,t180]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP704-12 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 15:46:49 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.36/1.49 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.36/1.49 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------