%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP704-11 : 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 : n003.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:16 AM UTC 2026
% Result : Unsatisfiable 0.16s 5.41s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 41 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 9 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 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; 6 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 13 !; 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(f05,axiom,
! [VAR_0] : mult(VAR_0,unit) = VAR_0,
file('theBenchmark.p',f05) ).
cnf(c_5,plain,
mult(A,unit) = A,
inference(clausify,[status(thm)],[f05]) ).
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(f08,axiom,
! [VAR_0,VAR_1] : mult(op_c,mult(VAR_0,VAR_1)) = mult(mult(op_c,VAR_0),VAR_1),
file('theBenchmark.p',f08) ).
cnf(c_9,plain,
mult(op_c,mult(A,B)) = mult(mult(op_c,A),B),
inference(clausify,[status(thm)],[f08]) ).
cnf(c_10,plain,
mult(mult(op_c,A),B) = mult(op_c,mult(A,B)),
inference(copy,[status(thm)],[c_9]) ).
fof(f10,axiom,
! [VAR_0,VAR_1] : mult(VAR_0,mult(op_c,VAR_1)) = mult(mult(VAR_0,op_c),VAR_1),
file('theBenchmark.p',f10) ).
cnf(c_13,plain,
mult(A,mult(op_c,B)) = mult(mult(A,op_c),B),
inference(clausify,[status(thm)],[f10]) ).
cnf(c_14,plain,
mult(mult(A,op_c),B) = mult(A,mult(op_c,B)),
inference(copy,[status(thm)],[c_13]) ).
fof(f11,axiom,
! [VAR_0] : op_d = ld(VAR_0,mult(op_c,VAR_0)),
file('theBenchmark.p',f11) ).
cnf(c_15,plain,
op_d = ld(A,mult(op_c,A)),
inference(clausify,[status(thm)],[f11]) ).
cnf(c_16,plain,
ld(A,mult(op_c,A)) = op_d,
inference(copy,[status(thm)],[c_15]) ).
fof(f13,axiom,
! [VAR_0,VAR_1] : op_f = mult(VAR_0,mult(VAR_1,ld(mult(VAR_0,VAR_1),op_c))),
file('theBenchmark.p',f13) ).
cnf(c_19,plain,
op_f = mult(A,mult(B,ld(mult(A,B),op_c))),
inference(clausify,[status(thm)],[f13]) ).
cnf(c_20,plain,
mult(A,mult(B,ld(mult(A,B),op_c))) = op_f,
inference(copy,[status(thm)],[c_19]) ).
fof(goal,axiom,
mult(x4,mult(x5,op_f)) != mult(mult(x4,x5),op_f),
file('theBenchmark.p',goal) ).
cnf(c_21,plain,
mult(x4,mult(x5,op_f)) != mult(mult(x4,x5),op_f),
inference(clausify,[status(thm)],[goal]) ).
cnf(c_22,plain,
mult(mult(x4,x5),op_f) != mult(x4,mult(x5,op_f)),
inference(copy,[status(thm)],[c_21]) ).
cnf(c_115,plain,
mult(A,op_d) = mult(op_c,A),
inference(paramod,[status(thm)],[c_16,c_1]) ).
cnf(c_62,plain,
mult(op_c,A) = mult(A,op_d),
inference(copy,[status(thm)],[c_115]) ).
cnf(c_64,plain,
op_d = op_c,
inference(paramod,[status(thm)],[c_16,c_2]) ).
cnf(c_66,plain,
mult(op_c,A) = mult(A,op_c),
inference(paramod,[status(thm)],[c_64,c_62]) ).
cnf(c_116,plain,
mult(A,mult(unit,ld(A,op_c))) = op_f,
inference(paramod,[status(thm)],[c_5,c_20]) ).
cnf(c_117,plain,
mult(A,ld(A,op_c)) = op_f,
inference(paramod,[status(thm)],[c_6,c_116]) ).
cnf(c_118,plain,
op_c = op_f,
inference(paramod,[status(thm)],[c_1,c_117]) ).
cnf(c_89,plain,
op_f = op_c,
inference(copy,[status(thm)],[c_118]) ).
cnf(c_119,plain,
mult(mult(x4,x5),op_c) != mult(x4,mult(x5,op_f)),
inference(paramod,[status(thm)],[c_89,c_22]) ).
cnf(c_120,plain,
mult(op_c,mult(x4,x5)) != mult(x4,mult(x5,op_f)),
inference(paramod,[status(thm)],[c_66,c_119]) ).
cnf(c_121,plain,
mult(op_c,mult(x4,x5)) != mult(x4,mult(x5,op_c)),
inference(paramod,[status(thm)],[c_89,c_120]) ).
cnf(c_122,plain,
mult(op_c,mult(x4,x5)) != mult(x4,mult(op_c,x5)),
inference(paramod,[status(thm)],[c_66,c_121]) ).
cnf(c_96,plain,
mult(x4,mult(op_c,x5)) != mult(op_c,mult(x4,x5)),
inference(copy,[status(thm)],[c_122]) ).
cnf(c_123,plain,
mult(mult(A,op_c),B) = mult(op_c,mult(A,B)),
inference(paramod,[status(thm)],[c_66,c_10]) ).
cnf(c_124,plain,
mult(A,mult(op_c,B)) = mult(op_c,mult(A,B)),
inference(paramod,[status(thm)],[c_14,c_123]) ).
cnf(c_113,plain,
mult(op_c,mult(A,B)) = mult(A,mult(op_c,B)),
inference(copy,[status(thm)],[c_124]) ).
cnf(c_125,plain,
mult(op_c,mult(x4,x5)) != mult(x4,mult(op_c,x5)),
inference(copy,[status(thm)],[c_96]) ).
cnf(c_114,plain,
$false,
inference(resolve,[status(thm)],[c_113,c_125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP704-11 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.38 % Computer : n003.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Fri Sep 25 15:40:44 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.39 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.39 % Process 554490 was started by sandbox2 on n003,
% 0.09/5.39 % Fri Sep 25 15:40:44 2026
% 0.09/5.39 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/5.39
% 0.09/5.39 % From the command line: assign(max_seconds, 300).
% 0.16/5.41
% 0.16/5.41 % SZS status Unsatisfiable for theBenchmark
% 0.16/5.41
% 0.16/5.41 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.16/5.41 % Length of proof is 21.
% 0.16/5.41 % Level of proof is 5.
% 0.16/5.41 % Maximum clause weight is 11.000.
% 0.16/5.41 % Given clauses 26.
% 0.16/5.41
% 0.16/5.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------