%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP034-3 : 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 : 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:26:20 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 15 unt; 0 def)
% Number of atoms : 41 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 20 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_identity,axiom,
! [VAR_0] : product(identity,VAR_0,VAR_0),
file('theBenchmark.p',left_identity) ).
cnf(c_1,plain,
product(identity,A,A),
inference(clausify,[status(thm)],[left_identity]) ).
fof(right_inverse,axiom,
! [VAR_0] : product(VAR_0,inverse(VAR_0),identity),
file('theBenchmark.p',right_inverse) ).
cnf(c_4,plain,
product(A,inverse(A),identity),
inference(clausify,[status(thm)],[right_inverse]) ).
fof(total_function1,axiom,
! [VAR_0,VAR_1] : product(VAR_0,VAR_1,multiply(VAR_0,VAR_1)),
file('theBenchmark.p',total_function1) ).
cnf(c_5,plain,
product(A,B,multiply(A,B)),
inference(clausify,[status(thm)],[total_function1]) ).
fof(total_function2,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( VAR_2 = VAR_3
| ~ product(VAR_0,VAR_1,VAR_3)
| ~ product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',total_function2) ).
cnf(c_6,plain,
( C = D
| ~ product(A,B,D)
| ~ product(A,B,C) ),
inference(clausify,[status(thm)],[total_function2]) ).
fof(closure_of_product_and_inverse,axiom,
! [VAR_0,VAR_1,VAR_2] :
( subgroup_member(VAR_2)
| ~ product(VAR_0,inverse(VAR_1),VAR_2)
| ~ subgroup_member(VAR_1)
| ~ subgroup_member(VAR_0) ),
file('theBenchmark.p',closure_of_product_and_inverse) ).
cnf(c_9,plain,
( subgroup_member(C)
| ~ product(A,inverse(B),C)
| ~ subgroup_member(B)
| ~ subgroup_member(A) ),
inference(clausify,[status(thm)],[closure_of_product_and_inverse]) ).
fof(a_is_in_subgroup,axiom,
subgroup_member(a),
file('theBenchmark.p',a_is_in_subgroup) ).
cnf(c_10,plain,
subgroup_member(a),
inference(clausify,[status(thm)],[a_is_in_subgroup]) ).
fof(prove_a_inverse_is_in_subgroup,axiom,
~ subgroup_member(inverse(a)),
file('theBenchmark.p',prove_a_inverse_is_in_subgroup) ).
cnf(c_11,plain,
~ subgroup_member(inverse(a)),
inference(clausify,[status(thm)],[prove_a_inverse_is_in_subgroup]) ).
cnf(c_36,plain,
( multiply(A,B) = C
| ~ product(A,B,C) ),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_12,plain,
multiply(A,inverse(A)) = identity,
inference(resolve,[status(thm)],[c_36,c_4]) ).
cnf(c_37,plain,
( subgroup_member(B)
| ~ product(a,inverse(A),B)
| ~ subgroup_member(A) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
cnf(c_38,plain,
( subgroup_member(A)
| ~ product(a,inverse(a),A) ),
inference(resolve,[status(thm)],[c_37,c_10]) ).
cnf(c_39,plain,
subgroup_member(multiply(a,inverse(a))),
inference(resolve,[status(thm)],[c_38,c_5]) ).
cnf(c_33,plain,
subgroup_member(identity),
inference(paramod,[status(thm)],[c_12,c_39]) ).
cnf(c_40,plain,
( subgroup_member(B)
| ~ product(A,inverse(a),B)
| ~ subgroup_member(A) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
cnf(c_41,plain,
( subgroup_member(inverse(a))
| ~ subgroup_member(identity) ),
inference(resolve,[status(thm)],[c_40,c_1]) ).
cnf(c_34,plain,
~ subgroup_member(identity),
inference(resolve,[status(thm)],[c_41,c_11]) ).
cnf(c_35,plain,
$false,
inference(resolve,[status(thm)],[c_34,c_33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP034-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n003.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 14:20:22 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.37 % Process 358638 was started by sandbox on n003,
% 0.11/0.37 % Fri Sep 25 14:20:22 2026
% 0.11/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.38
% 0.11/0.38 % From the command line: assign(max_seconds, 300).
% 0.14/0.39
% 0.14/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.39
% 0.14/0.39 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.14/0.39 % Length of proof is 11.
% 0.14/0.39 % Level of proof is 3.
% 0.14/0.39 % Maximum clause weight is 11.000.
% 0.14/0.39 % Given clauses 11.
% 0.14/0.39
% 0.14/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------