%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP033-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 : n012.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.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 15 unt; 0 def)
% Number of atoms : 44 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 42 ( 23 ~; 19 |; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 13 !; 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_identity,axiom,
! [VAR_0] : product(VAR_0,identity,VAR_0),
file('theBenchmark.p',right_identity) ).
cnf(c_2,plain,
product(A,identity,A),
inference(clausify,[status(thm)],[right_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_subgr2,axiom,
! [VAR_0] :
( ~ subgroup_member(VAR_0)
| ~ product(VAR_0,j(VAR_0),j(VAR_0))
| ~ product(j(VAR_0),VAR_0,j(VAR_0)) ),
file('theBenchmark.p',prove_subgr2) ).
cnf(c_12,plain,
( ~ subgroup_member(A)
| ~ product(A,j(A),j(A))
| ~ product(j(A),A,j(A)) ),
inference(clausify,[status(thm)],[prove_subgr2]) ).
cnf(c_37,plain,
( multiply(A,B) = C
| ~ product(A,B,C) ),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_13,plain,
multiply(A,inverse(A)) = identity,
inference(resolve,[status(thm)],[c_37,c_4]) ).
cnf(c_38,plain,
( subgroup_member(B)
| ~ product(a,inverse(A),B)
| ~ subgroup_member(A) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
cnf(c_39,plain,
( subgroup_member(A)
| ~ product(a,inverse(a),A) ),
inference(resolve,[status(thm)],[c_38,c_10]) ).
cnf(c_40,plain,
subgroup_member(multiply(a,inverse(a))),
inference(resolve,[status(thm)],[c_39,c_5]) ).
cnf(c_34,plain,
subgroup_member(identity),
inference(paramod,[status(thm)],[c_13,c_40]) ).
cnf(c_41,plain,
( ~ subgroup_member(identity)
| ~ product(identity,j(identity),j(identity)) ),
inference(resolve,[status(thm)],[c_12,c_2]) ).
cnf(c_42,plain,
~ subgroup_member(identity),
inference(resolve,[status(thm)],[c_41,c_1]) ).
cnf(c_36,plain,
$false,
inference(resolve,[status(thm)],[c_34,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP033-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 14:18:05 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 2272812 was started by sandbox on n012,
% 0.08/0.36 % Fri Sep 25 14:18:05 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.37
% 0.13/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.37
% 0.13/0.37 % Proof 1 at 0.00 (+ 0.01) seconds.
% 0.13/0.37 % Length of proof is 11.
% 0.13/0.37 % Level of proof is 3.
% 0.13/0.37 % Maximum clause weight is 14.000.
% 0.13/0.37 % Given clauses 12.
% 0.13/0.37
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------