%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP117-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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:27:22 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(VAR_0,multiply(multiply(VAR_0,multiply(multiply(VAR_0,VAR_1),VAR_2)),multiply(identity,multiply(VAR_2,VAR_2)))) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(prove_order3,axiom,
multiply(a,identity) != a,
file('theBenchmark.p',prove_order3) ).
cnf(c_2,plain,
multiply(a,identity) != a,
inference(clausify,[status(thm)],[prove_order3]) ).
cnf(c_47,plain,
multiply(A,multiply(B,multiply(identity,multiply(multiply(identity,multiply(C,C)),multiply(identity,multiply(C,C)))))) = multiply(multiply(A,B),C),
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_3,plain,
multiply(multiply(A,B),C) = multiply(A,multiply(B,multiply(identity,multiply(multiply(identity,multiply(C,C)),multiply(identity,multiply(C,C)))))),
inference(copy,[status(thm)],[c_47]) ).
cnf(c_48,plain,
multiply(A,multiply(A,multiply(multiply(multiply(A,B),C),multiply(identity,multiply(multiply(identity,multiply(multiply(identity,multiply(C,C)),multiply(identity,multiply(C,C)))),multiply(identity,multiply(multiply(identity,multiply(C,C)),multiply(identity,multiply(C,C))))))))) = B,
inference(paramod,[status(thm)],[c_3,c_1]) ).
cnf(c_4,plain,
multiply(A,multiply(A,multiply(multiply(multiply(A,B),C),multiply(C,C)))) = B,
inference(paramod,[status(thm)],[c_1,c_48]) ).
cnf(c_49,plain,
multiply(A,multiply(multiply(multiply(A,multiply(A,B)),C),multiply(identity,multiply(multiply(identity,multiply(multiply(identity,multiply(C,C)),multiply(identity,multiply(C,C)))),multiply(identity,multiply(multiply(identity,multiply(C,C)),multiply(identity,multiply(C,C)))))))) = B,
inference(paramod,[status(thm)],[c_3,c_1]) ).
cnf(c_5,plain,
multiply(A,multiply(multiply(multiply(A,multiply(A,B)),C),multiply(C,C))) = B,
inference(paramod,[status(thm)],[c_1,c_49]) ).
cnf(c_8,plain,
multiply(multiply(A,B),multiply(identity,C)) = multiply(A,multiply(B,C)),
inference(paramod,[status(thm)],[c_1,c_3]) ).
cnf(c_50,plain,
multiply(A,multiply(A,multiply(multiply(A,B),multiply(identity,identity)))) = B,
inference(paramod,[status(thm)],[c_8,c_4]) ).
cnf(c_17,plain,
multiply(A,multiply(A,multiply(A,multiply(B,identity)))) = B,
inference(paramod,[status(thm)],[c_8,c_50]) ).
cnf(c_27,plain,
multiply(A,multiply(multiply(B,C),multiply(C,C))) = multiply(A,multiply(B,identity)),
inference(paramod,[status(thm)],[c_17,c_5]) ).
cnf(c_51,plain,
multiply(A,multiply(multiply(B,multiply(identity,C)),multiply(identity,multiply(C,C)))) = multiply(A,multiply(B,identity)),
inference(paramod,[status(thm)],[c_8,c_27]) ).
cnf(c_52,plain,
multiply(A,multiply(B,multiply(multiply(identity,C),multiply(C,C)))) = multiply(A,multiply(B,identity)),
inference(paramod,[status(thm)],[c_8,c_51]) ).
cnf(c_37,plain,
multiply(A,multiply(B,multiply(identity,identity))) = multiply(A,multiply(B,identity)),
inference(paramod,[status(thm)],[c_27,c_52]) ).
cnf(c_42,plain,
multiply(A,multiply(A,multiply(A,identity))) = identity,
inference(paramod,[status(thm)],[c_37,c_17]) ).
cnf(c_45,plain,
multiply(A,identity) = A,
inference(paramod,[status(thm)],[c_42,c_17]) ).
cnf(c_46,plain,
$false,
inference(resolve,[status(thm)],[c_45,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP117-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.44 % Computer : n016.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.45 % DateTime : Fri Sep 25 14:27:58 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.45 % Process 2589918 was started by sandbox on n016,
% 0.17/0.45 % Fri Sep 25 14:27:58 2026
% 0.17/0.45 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 0.17/0.48
% 0.17/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.48
% 0.17/0.48 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.17/0.48 % Length of proof is 12.
% 0.17/0.48 % Level of proof is 8.
% 0.17/0.48 % Maximum clause weight is 98.000.
% 0.17/0.48 % Given clauses 10.
% 0.17/0.48
% 0.17/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------