%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP702-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 : n011.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:15 AM UTC 2026
% Result : Unsatisfiable 0.16s 5.41s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 5 !; 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(f09,axiom,
! [VAR_0,VAR_1] : mult(VAR_0,mult(VAR_1,op_c)) = mult(mult(VAR_0,VAR_1),op_c),
file('theBenchmark.p',f09) ).
cnf(c_11,plain,
mult(A,mult(B,op_c)) = mult(mult(A,B),op_c),
inference(clausify,[status(thm)],[f09]) ).
cnf(c_12,plain,
mult(mult(A,B),op_c) = mult(A,mult(B,op_c)),
inference(copy,[status(thm)],[c_11]) ).
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(goal,axiom,
mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d),
file('theBenchmark.p',goal) ).
cnf(c_21,plain,
mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d),
inference(clausify,[status(thm)],[goal]) ).
cnf(c_22,plain,
mult(mult(x0,x1),op_d) != mult(x0,mult(x1,op_d)),
inference(copy,[status(thm)],[c_21]) ).
cnf(c_64,plain,
op_d = op_c,
inference(paramod,[status(thm)],[c_16,c_2]) ).
cnf(c_66,plain,
mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_d)),
inference(paramod,[status(thm)],[c_64,c_22]) ).
cnf(c_67,plain,
mult(x0,mult(x1,op_c)) != mult(x0,mult(x1,op_d)),
inference(paramod,[status(thm)],[c_12,c_66]) ).
cnf(c_68,plain,
mult(x0,mult(x1,op_c)) != mult(x0,mult(x1,op_c)),
inference(paramod,[status(thm)],[c_64,c_67]) ).
cnf(c_65,plain,
$false,
inference(copy,[status(thm)],[c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP702-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.12/5.39 % Computer : n011.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Fri Sep 25 15:38:34 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.40 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/5.40 % Process 2375278 was started by sandbox2 on n011,
% 0.12/5.40 % Fri Sep 25 15:38:34 2026
% 0.12/5.40 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/5.40
% 0.16/5.40 % 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.00 (+ 0.00) seconds.
% 0.16/5.41 % Length of proof is 9.
% 0.16/5.41 % Level of proof is 3.
% 0.16/5.41 % Maximum clause weight is 11.000.
% 0.16/5.41 % Given clauses 11.
% 0.16/5.41
% 0.16/5.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------