%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP519-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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:30:16 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.37s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% 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 : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 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(inverse(multiply(VAR_0,VAR_1)),VAR_2),VAR_1)) = VAR_2,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(prove_these_axioms_3,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('theBenchmark.p',prove_these_axioms_3) ).
cnf(c_2,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(clausify,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_3,plain,
multiply(A,multiply(multiply(inverse(B),C),multiply(multiply(inverse(multiply(A,D)),B),D))) = C,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_53,plain,
multiply(A,multiply(B,C)) = multiply(multiply(inverse(multiply(inverse(multiply(A,C)),D)),B),D),
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_4,plain,
multiply(multiply(inverse(multiply(inverse(multiply(A,B)),C)),D),C) = multiply(A,multiply(D,B)),
inference(copy,[status(thm)],[c_53]) ).
cnf(c_8,plain,
multiply(multiply(inverse(A),B),A) = B,
inference(paramod,[status(thm)],[c_1,c_3]) ).
cnf(c_54,plain,
multiply(A,B) = multiply(multiply(inverse(multiply(inverse(B),C)),A),C),
inference(paramod,[status(thm)],[c_1,c_8]) ).
cnf(c_13,plain,
multiply(multiply(inverse(multiply(inverse(A),B)),C),B) = multiply(C,A),
inference(copy,[status(thm)],[c_54]) ).
cnf(c_55,plain,
multiply(A,B) = multiply(multiply(inverse(C),A),multiply(multiply(inverse(multiply(inverse(B),D)),C),D)),
inference(paramod,[status(thm)],[c_3,c_8]) ).
cnf(c_56,plain,
multiply(A,B) = multiply(multiply(inverse(C),A),multiply(C,B)),
inference(paramod,[status(thm)],[c_13,c_55]) ).
cnf(c_15,plain,
multiply(multiply(inverse(A),B),multiply(A,C)) = multiply(B,C),
inference(copy,[status(thm)],[c_56]) ).
cnf(c_17,plain,
multiply(A,multiply(B,C)) = multiply(B,multiply(A,C)),
inference(paramod,[status(thm)],[c_13,c_4]) ).
cnf(c_18,plain,
multiply(A,multiply(multiply(inverse(A),B),C)) = multiply(B,C),
inference(paramod,[status(thm)],[c_17,c_15]) ).
cnf(c_32,plain,
multiply(A,B) = multiply(B,A),
inference(paramod,[status(thm)],[c_8,c_18]) ).
cnf(c_57,plain,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_32,c_2]) ).
cnf(c_58,plain,
multiply(a3,multiply(c3,b3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_17,c_57]) ).
cnf(c_59,plain,
multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_32,c_58]) ).
cnf(c_52,plain,
$false,
inference(copy,[status(thm)],[c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP519-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n007.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 14:55:53 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35 % Process 1285562 was started by sandbox on n007,
% 0.09/0.35 % Fri Sep 25 14:55:53 2026
% 0.09/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.35
% 0.09/0.35 % From the command line: assign(max_seconds, 300).
% 0.09/0.37
% 0.09/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.37
% 0.09/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.37 % Length of proof is 11.
% 0.09/0.37 % Level of proof is 7.
% 0.09/0.37 % Maximum clause weight is 17.000.
% 0.09/0.37 % Given clauses 6.
% 0.09/0.37
% 0.09/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------