%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP665-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.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 : Sun Sep 27 07:31:07 AM UTC 2026
% Result : Unsatisfiable 0.17s 5.68s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 15 unt; 0 def)
% Number of atoms : 15 ( 14 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f02,axiom,
! [VAR_0,VAR_1] : ld(VAR_0,mult(VAR_0,VAR_1)) = VAR_1,
file('theBenchmark.p',f02) ).
cnf(c_2,plain,
ld(A,mult(A,B)) = B,
inference(clausify,[status(thm)],[f02]) ).
fof(f08,axiom,
! [VAR_0,VAR_1,VAR_2] : mult(mult(VAR_0,VAR_1),VAR_2) = mult(mult(VAR_0,VAR_2),ld(VAR_2,mult(VAR_1,VAR_2))),
file('theBenchmark.p',f08) ).
cnf(c_9,plain,
mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))),
inference(clausify,[status(thm)],[f08]) ).
cnf(c_10,plain,
mult(mult(A,B),ld(B,mult(C,B))) = mult(mult(A,C),B),
inference(copy,[status(thm)],[c_9]) ).
fof(f09,axiom,
! [VAR_0] : mult(op_c,VAR_0) = mult(VAR_0,op_c),
file('theBenchmark.p',f09) ).
cnf(c_11,plain,
mult(op_c,A) = mult(A,op_c),
inference(clausify,[status(thm)],[f09]) ).
fof(goal,axiom,
mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
file('theBenchmark.p',goal) ).
cnf(c_12,plain,
mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
inference(clausify,[status(thm)],[goal]) ).
cnf(c_13,plain,
mult(mult(op_c,x0),x1) != mult(op_c,mult(x0,x1)),
inference(copy,[status(thm)],[c_12]) ).
cnf(c_43,plain,
ld(op_c,mult(A,op_c)) = A,
inference(paramod,[status(thm)],[c_11,c_2]) ).
cnf(c_53,plain,
mult(mult(op_c,A),ld(op_c,mult(B,op_c))) = mult(mult(A,B),op_c),
inference(paramod,[status(thm)],[c_11,c_10]) ).
cnf(c_54,plain,
mult(mult(op_c,A),B) = mult(mult(A,B),op_c),
inference(paramod,[status(thm)],[c_43,c_53]) ).
cnf(c_51,plain,
mult(mult(op_c,A),B) = mult(op_c,mult(A,B)),
inference(paramod,[status(thm)],[c_11,c_54]) ).
cnf(c_52,plain,
$false,
inference(resolve,[status(thm)],[c_51,c_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP665-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.65 % Computer : n010.cluster.edu
% 0.17/5.65 % Model : x86_64 x86_64
% 0.17/5.65 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.65 % Memory : 8046.5625MB
% 0.17/5.65 % OS : Linux 6.8.0-71-generic
% 0.17/5.65 % CPULimit : 300
% 0.17/5.65 % WCLimit : 300
% 0.17/5.65 % DateTime : Fri Sep 25 15:33:37 UTC 2026
% 0.17/5.66 % CPUTime :
% 0.17/5.66 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/5.66 % Process 1116544 was started by sandbox2 on n010,
% 0.17/5.66 % Fri Sep 25 15:33:37 2026
% 0.17/5.66 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/5.67
% 0.17/5.67 % From the command line: assign(max_seconds, 300).
% 0.17/5.68
% 0.17/5.68 % SZS status Unsatisfiable for theBenchmark
% 0.17/5.68
% 0.17/5.68 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/5.68 % Length of proof is 9.
% 0.17/5.68 % Level of proof is 3.
% 0.17/5.68 % Maximum clause weight is 45.000.
% 0.17/5.68 % Given clauses 9.
% 0.17/5.68
% 0.17/5.68 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------