%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP011-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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:26:09 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 4 ( 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 : 24 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(associativity,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(multiply(VAR_0,VAR_1),VAR_2) = multiply(VAR_0,multiply(VAR_1,VAR_2)),
file('theBenchmark.p',associativity) ).
cnf(c_1,plain,
multiply(multiply(A,B),C) = multiply(A,multiply(B,C)),
inference(clausify,[status(thm)],[associativity]) ).
fof(left_identity,axiom,
! [VAR_0] : multiply(identity,VAR_0) = VAR_0,
file('theBenchmark.p',left_identity) ).
cnf(c_2,plain,
multiply(identity,A) = A,
inference(clausify,[status(thm)],[left_identity]) ).
fof(left_inverse,axiom,
! [VAR_0] : multiply(inverse(VAR_0),VAR_0) = identity,
file('theBenchmark.p',left_inverse) ).
cnf(c_3,plain,
multiply(inverse(A),A) = identity,
inference(clausify,[status(thm)],[left_inverse]) ).
fof(product_equality,axiom,
multiply(b,c) = multiply(d,c),
file('theBenchmark.p',product_equality) ).
cnf(c_4,plain,
multiply(b,c) = multiply(d,c),
inference(clausify,[status(thm)],[product_equality]) ).
cnf(c_5,plain,
multiply(d,c) = multiply(b,c),
inference(copy,[status(thm)],[c_4]) ).
fof(prove_left_cancellation,axiom,
b != d,
file('theBenchmark.p',prove_left_cancellation) ).
cnf(c_6,plain,
b != d,
inference(clausify,[status(thm)],[prove_left_cancellation]) ).
cnf(c_7,plain,
d != b,
inference(copy,[status(thm)],[c_6]) ).
cnf(c_24,plain,
multiply(identity,A) = multiply(inverse(B),multiply(B,A)),
inference(paramod,[status(thm)],[c_3,c_1]) ).
cnf(c_25,plain,
A = multiply(inverse(B),multiply(B,A)),
inference(paramod,[status(thm)],[c_2,c_24]) ).
cnf(c_8,plain,
multiply(inverse(A),multiply(A,B)) = B,
inference(copy,[status(thm)],[c_25]) ).
cnf(c_26,plain,
multiply(multiply(b,c),A) = multiply(d,multiply(c,A)),
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_27,plain,
multiply(b,multiply(c,A)) = multiply(d,multiply(c,A)),
inference(paramod,[status(thm)],[c_1,c_26]) ).
cnf(c_9,plain,
multiply(d,multiply(c,A)) = multiply(b,multiply(c,A)),
inference(copy,[status(thm)],[c_27]) ).
cnf(c_12,plain,
multiply(inverse(inverse(A)),identity) = A,
inference(paramod,[status(thm)],[c_3,c_8]) ).
cnf(c_14,plain,
multiply(inverse(inverse(A)),B) = multiply(A,B),
inference(paramod,[status(thm)],[c_8,c_8]) ).
cnf(c_15,plain,
multiply(A,identity) = A,
inference(paramod,[status(thm)],[c_14,c_12]) ).
cnf(c_18,plain,
multiply(A,inverse(A)) = identity,
inference(paramod,[status(thm)],[c_14,c_3]) ).
cnf(c_28,plain,
multiply(d,identity) = multiply(b,multiply(c,inverse(c))),
inference(paramod,[status(thm)],[c_18,c_9]) ).
cnf(c_29,plain,
d = multiply(b,multiply(c,inverse(c))),
inference(paramod,[status(thm)],[c_15,c_28]) ).
cnf(c_30,plain,
d = multiply(b,identity),
inference(paramod,[status(thm)],[c_18,c_29]) ).
cnf(c_22,plain,
d = b,
inference(paramod,[status(thm)],[c_15,c_30]) ).
cnf(c_23,plain,
$false,
inference(resolve,[status(thm)],[c_22,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP011-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 14:17:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 3094268 was started by sandbox on n020,
% 0.09/0.37 % Fri Sep 25 14:17:19 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 15.
% 0.09/0.38 % Level of proof is 5.
% 0.09/0.38 % Maximum clause weight is 11.000.
% 0.09/0.38 % Given clauses 13.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------