%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP748-4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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 : Sun Sep 27 07:31:22 AM UTC 2026
% Result : Unsatisfiable 9.81s 1.68s
% Output : CNFRefutation 9.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 9
% Syntax : Number of formulae : 62 ( 47 unt; 0 def)
% Number of atoms : 79 ( 78 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 5 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 119 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f01,axiom,
! [VAR_0,VAR_1] : mult(VAR_0,ld(VAR_0,VAR_1)) = VAR_1,
file('theBenchmark.p',f01) ).
cnf(c_1,plain,
mult(A,ld(A,B)) = B,
inference(clausify,[status(thm)],[f01]) ).
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(f03,axiom,
! [VAR_0,VAR_1] : mult(rd(VAR_0,VAR_1),VAR_1) = VAR_0,
file('theBenchmark.p',f03) ).
cnf(c_3,plain,
mult(rd(A,B),B) = A,
inference(clausify,[status(thm)],[f03]) ).
fof(f06,axiom,
! [VAR_0] : mult(unit,VAR_0) = VAR_0,
file('theBenchmark.p',f06) ).
cnf(c_6,plain,
mult(unit,A) = A,
inference(clausify,[status(thm)],[f06]) ).
fof(f07,axiom,
! [VAR_0,VAR_1,VAR_2] : mult(mult(mult(VAR_0,VAR_1),VAR_2),VAR_1) = mult(VAR_0,mult(mult(VAR_1,VAR_2),VAR_1)),
file('theBenchmark.p',f07) ).
cnf(c_7,plain,
mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)),
inference(clausify,[status(thm)],[f07]) ).
fof(f08,axiom,
! [VAR_0,VAR_1] : mult(mult(VAR_0,VAR_1),i(VAR_1)) = VAR_0,
file('theBenchmark.p',f08) ).
cnf(c_8,plain,
mult(mult(A,B),i(B)) = A,
inference(clausify,[status(thm)],[f08]) ).
fof(f10,axiom,
! [VAR_0] : mult(i(VAR_0),VAR_0) = unit,
file('theBenchmark.p',f10) ).
cnf(c_10,plain,
mult(i(A),A) = unit,
inference(clausify,[status(thm)],[f10]) ).
fof(f11,axiom,
! [VAR_0,VAR_1] :
( mult(i(VAR_0),mult(VAR_0,VAR_1)) = VAR_1
| mult(VAR_0,VAR_1) = mult(VAR_1,VAR_0) ),
file('theBenchmark.p',f11) ).
cnf(c_11,plain,
( mult(i(A),mult(A,B)) = B
| mult(A,B) = mult(B,A) ),
inference(clausify,[status(thm)],[f11]) ).
fof(goals,axiom,
mult(mult(a,b),mult(c,a)) != mult(mult(a,mult(b,c)),a),
file('theBenchmark.p',goals) ).
cnf(c_12,plain,
mult(mult(a,b),mult(c,a)) != mult(mult(a,mult(b,c)),a),
inference(clausify,[status(thm)],[goals]) ).
cnf(c_13,plain,
mult(mult(a,mult(b,c)),a) != mult(mult(a,b),mult(c,a)),
inference(copy,[status(thm)],[c_12]) ).
cnf(c_14,plain,
ld(rd(A,B),A) = B,
inference(paramod,[status(thm)],[c_3,c_2]) ).
cnf(c_4017,plain,
mult(mult(A,B),C) = mult(rd(A,C),mult(mult(C,B),C)),
inference(paramod,[status(thm)],[c_3,c_7]) ).
cnf(c_23,plain,
mult(rd(A,B),mult(mult(B,C),B)) = mult(mult(A,C),B),
inference(copy,[status(thm)],[c_4017]) ).
cnf(c_29,plain,
ld(mult(A,B),A) = i(B),
inference(paramod,[status(thm)],[c_8,c_2]) ).
cnf(c_4018,plain,
mult(A,i(B)) = rd(A,B),
inference(paramod,[status(thm)],[c_3,c_8]) ).
cnf(c_30,plain,
rd(A,B) = mult(A,i(B)),
inference(copy,[status(thm)],[c_4018]) ).
cnf(c_35,plain,
mult(mult(A,i(B)),mult(mult(B,C),B)) = mult(mult(A,C),B),
inference(paramod,[status(thm)],[c_30,c_23]) ).
cnf(c_4019,plain,
ld(mult(A,i(B)),A) = B,
inference(paramod,[status(thm)],[c_30,c_14]) ).
cnf(c_36,plain,
i(i(A)) = A,
inference(paramod,[status(thm)],[c_29,c_4019]) ).
cnf(c_4020,plain,
mult(mult(unit,A),B) = mult(i(B),mult(mult(B,A),B)),
inference(paramod,[status(thm)],[c_10,c_7]) ).
cnf(c_4021,plain,
mult(A,B) = mult(i(B),mult(mult(B,A),B)),
inference(paramod,[status(thm)],[c_6,c_4020]) ).
cnf(c_42,plain,
mult(i(A),mult(mult(A,B),A)) = mult(B,A),
inference(copy,[status(thm)],[c_4021]) ).
cnf(c_4022,plain,
( mult(i(A),B) = ld(A,B)
| mult(A,ld(A,B)) = mult(ld(A,B),A) ),
inference(paramod,[status(thm)],[c_1,c_11]) ).
cnf(c_4023,plain,
( mult(i(A),B) = ld(A,B)
| B = mult(ld(A,B),A) ),
inference(paramod,[status(thm)],[c_1,c_4022]) ).
cnf(c_4024,plain,
( mult(i(A),B) = ld(A,B)
| mult(ld(A,B),A) = B ),
inference(copy,[status(thm)],[c_4023]) ).
cnf(c_43,plain,
( ld(A,B) = mult(i(A),B)
| mult(ld(A,B),A) = B ),
inference(copy,[status(thm)],[c_4024]) ).
cnf(c_4025,plain,
( mult(B,i(A)) = ld(A,B)
| ld(A,B) = mult(i(A),B) ),
inference(paramod,[status(thm)],[c_43,c_8]) ).
cnf(c_69,plain,
( ld(A,B) = mult(B,i(A))
| ld(A,B) = mult(i(A),B) ),
inference(copy,[status(thm)],[c_4025]) ).
cnf(c_4026,plain,
( ld(i(A),B) = mult(B,i(i(A)))
| ld(i(A),B) = mult(A,B) ),
inference(paramod,[status(thm)],[c_36,c_69]) ).
cnf(c_150,plain,
( ld(i(A),B) = mult(B,A)
| ld(i(A),B) = mult(A,B) ),
inference(paramod,[status(thm)],[c_36,c_4026]) ).
cnf(c_4027,plain,
( ld(i(A),ld(A,B)) = B
| ld(i(A),ld(A,B)) = mult(A,ld(A,B))
| ld(A,B) = mult(i(A),B) ),
inference(paramod,[status(thm)],[c_43,c_150]) ).
cnf(c_4028,plain,
( ld(i(A),ld(A,B)) = B
| ld(i(A),ld(A,B)) = B
| ld(A,B) = mult(i(A),B) ),
inference(paramod,[status(thm)],[c_1,c_4027]) ).
cnf(c_181,plain,
( ld(i(A),ld(A,B)) = B
| ld(A,B) = mult(i(A),B) ),
inference(copy,[status(thm)],[c_4028]) ).
cnf(c_1651,plain,
ld(mult(A,i(B)),mult(mult(A,C),B)) = mult(mult(B,C),B),
inference(paramod,[status(thm)],[c_35,c_2]) ).
cnf(c_4029,plain,
( mult(i(A),B) = ld(A,B)
| ld(A,B) = mult(i(A),B) ),
inference(paramod,[status(thm)],[c_181,c_1]) ).
cnf(c_4030,plain,
( ld(A,B) = mult(i(A),B)
| ld(A,B) = mult(i(A),B) ),
inference(copy,[status(thm)],[c_4029]) ).
cnf(c_2779,plain,
ld(A,B) = mult(i(A),B),
inference(copy,[status(thm)],[c_4030]) ).
cnf(c_3006,plain,
mult(i(mult(A,i(B))),mult(mult(A,C),B)) = mult(mult(B,C),B),
inference(paramod,[status(thm)],[c_2779,c_1651]) ).
cnf(c_3200,plain,
mult(i(mult(A,B)),A) = i(B),
inference(paramod,[status(thm)],[c_2779,c_29]) ).
cnf(c_3203,plain,
mult(i(A),mult(A,B)) = B,
inference(paramod,[status(thm)],[c_2779,c_2]) ).
cnf(c_4031,plain,
mult(i(A),i(B)) = i(mult(B,A)),
inference(paramod,[status(thm)],[c_3200,c_8]) ).
cnf(c_3252,plain,
i(mult(A,B)) = mult(i(B),i(A)),
inference(copy,[status(thm)],[c_4031]) ).
cnf(c_4032,plain,
mult(mult(i(i(B)),i(A)),mult(mult(A,C),B)) = mult(mult(B,C),B),
inference(paramod,[status(thm)],[c_3252,c_3006]) ).
cnf(c_3282,plain,
mult(mult(A,i(B)),mult(mult(B,C),A)) = mult(mult(A,C),A),
inference(paramod,[status(thm)],[c_36,c_4032]) ).
cnf(c_4033,plain,
mult(i(i(A)),mult(B,A)) = mult(mult(A,B),A),
inference(paramod,[status(thm)],[c_42,c_3203]) ).
cnf(c_4034,plain,
mult(A,mult(B,A)) = mult(mult(A,B),A),
inference(paramod,[status(thm)],[c_36,c_4033]) ).
cnf(c_3311,plain,
mult(mult(A,B),A) = mult(A,mult(B,A)),
inference(copy,[status(thm)],[c_4034]) ).
cnf(c_3319,plain,
mult(mult(A,i(B)),mult(mult(B,C),A)) = mult(A,mult(C,A)),
inference(paramod,[status(thm)],[c_3311,c_3282]) ).
cnf(c_4035,plain,
mult(a,mult(mult(b,c),a)) != mult(mult(a,b),mult(c,a)),
inference(paramod,[status(thm)],[c_3311,c_13]) ).
cnf(c_3348,plain,
mult(mult(a,b),mult(c,a)) != mult(a,mult(mult(b,c),a)),
inference(copy,[status(thm)],[c_4035]) ).
cnf(c_4036,plain,
mult(mult(A,i(i(B))),mult(C,A)) = mult(A,mult(mult(B,C),A)),
inference(paramod,[status(thm)],[c_3203,c_3319]) ).
cnf(c_4015,plain,
mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A)),
inference(paramod,[status(thm)],[c_36,c_4036]) ).
cnf(c_4016,plain,
$false,
inference(resolve,[status(thm)],[c_4015,c_3348]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP748-4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 15:43:35 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.12/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.36 % Process 2473277 was started by sandbox2 on n012,
% 0.12/0.36 % Fri Sep 25 15:43:35 2026
% 0.12/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.36
% 0.12/0.36 % From the command line: assign(max_seconds, 300).
% 9.81/1.68
% 9.81/1.68 % Assigning unary symbol i kb_weight 0 and highest precedence (9).
% 9.81/1.68
% 9.81/1.68 % SZS status Unsatisfiable for theBenchmark
% 9.81/1.68
% 9.81/1.68 % Proof 1 at 1.12 (+ 0.17) seconds.
% 9.81/1.68 % Length of proof is 33.
% 9.81/1.68 % Level of proof is 11.
% 9.81/1.68 % Maximum clause weight is 57.000.
% 9.81/1.68 % Given clauses 142.
% 9.81/1.68
% 9.81/1.68 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------