%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP123-3.003 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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:36 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 40 ( 20 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 90 ( 47 ~; 43 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 49 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('theBenchmark.p',e_3_is_not_e_1) ).
cnf(c_8,plain,
~ equalish(e_3,e_1),
inference(clausify,[status(thm)],[e_3_is_not_e_1]) ).
fof(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('theBenchmark.p',e_3_is_not_e_2) ).
cnf(c_9,plain,
~ equalish(e_3,e_2),
inference(clausify,[status(thm)],[e_3_is_not_e_2]) ).
fof(product_right_cancellation,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( equalish(VAR_1,VAR_3)
| ~ product(VAR_0,VAR_3,VAR_2)
| ~ product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',product_right_cancellation) ).
cnf(c_11,plain,
( equalish(B,D)
| ~ product(A,D,C)
| ~ product(A,B,C) ),
inference(clausify,[status(thm)],[product_right_cancellation]) ).
fof(product_left_cancellation,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( equalish(VAR_0,VAR_3)
| ~ product(VAR_3,VAR_1,VAR_2)
| ~ product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',product_left_cancellation) ).
cnf(c_12,plain,
( equalish(A,D)
| ~ product(D,B,C)
| ~ product(A,B,C) ),
inference(clausify,[status(thm)],[product_left_cancellation]) ).
fof(qg1_2,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( equalish(VAR_1,VAR_4)
| ~ product(VAR_5,VAR_4,VAR_3)
| ~ product(VAR_5,VAR_1,VAR_0)
| ~ product(VAR_3,VAR_4,VAR_2)
| ~ product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',qg1_2) ).
cnf(c_14,plain,
( equalish(B,E)
| ~ product(F,E,D)
| ~ product(F,B,A)
| ~ product(D,E,C)
| ~ product(A,B,C) ),
inference(clausify,[status(thm)],[qg1_2]) ).
cnf(c_17,plain,
( ~ product(D,e_2,C)
| ~ product(D,e_3,A)
| ~ product(C,e_2,B)
| ~ product(A,e_3,B) ),
inference(resolve,[status(thm)],[c_14,c_9]) ).
cnf(c_22,plain,
( ~ product(e_1,A,B)
| ~ product(e_3,A,B) ),
inference(resolve,[status(thm)],[c_12,c_8]) ).
cnf(c_23,plain,
( ~ product(e_2,A,B)
| ~ product(e_3,A,B) ),
inference(resolve,[status(thm)],[c_12,c_9]) ).
cnf(c_25,plain,
( ~ product(A,e_1,B)
| ~ product(A,e_3,B) ),
inference(resolve,[status(thm)],[c_11,c_8]) ).
cnf(c_26,plain,
( ~ product(A,e_2,B)
| ~ product(A,e_3,B) ),
inference(resolve,[status(thm)],[c_11,c_9]) ).
fof(product_idempotence,axiom,
! [VAR_0] : product(VAR_0,VAR_0,VAR_0),
file('theBenchmark.p',product_idempotence) ).
cnf(c_45,plain,
product(A,A,A),
inference(clausify,[status(thm)],[product_idempotence]) ).
fof(product_total_function1,axiom,
! [VAR_0,VAR_1] :
( product(VAR_0,VAR_1,e_3)
| product(VAR_0,VAR_1,e_2)
| product(VAR_0,VAR_1,e_1)
| ~ group_element(VAR_1)
| ~ group_element(VAR_0) ),
file('theBenchmark.p',product_total_function1) ).
cnf(c_46,plain,
( product(A,B,e_3)
| product(A,B,e_2)
| product(A,B,e_1)
| ~ group_element(B)
| ~ group_element(A) ),
inference(clausify,[status(thm)],[product_total_function1]) ).
fof(element_3,axiom,
group_element(e_3),
file('theBenchmark.p',element_3) ).
cnf(c_47,plain,
group_element(e_3),
inference(clausify,[status(thm)],[element_3]) ).
fof(element_2,axiom,
group_element(e_2),
file('theBenchmark.p',element_2) ).
cnf(c_48,plain,
group_element(e_2),
inference(clausify,[status(thm)],[element_2]) ).
fof(element_1,axiom,
group_element(e_1),
file('theBenchmark.p',element_1) ).
cnf(c_49,plain,
group_element(e_1),
inference(clausify,[status(thm)],[element_1]) ).
cnf(c_68,plain,
( ~ product(B,e_3,A)
| ~ product(B,e_2,B)
| ~ product(A,e_3,B) ),
inference(factor,[status(thm)],[c_17]) ).
cnf(c_109,plain,
~ product(e_2,e_3,e_3),
inference(resolve,[status(thm)],[c_45,c_23]) ).
cnf(c_110,plain,
~ product(e_1,e_3,e_3),
inference(resolve,[status(thm)],[c_45,c_22]) ).
cnf(c_139,plain,
~ product(e_2,e_3,e_2),
inference(resolve,[status(thm)],[c_26,c_45]) ).
cnf(c_140,plain,
~ product(e_1,e_3,e_1),
inference(resolve,[status(thm)],[c_25,c_45]) ).
cnf(c_145,plain,
( product(A,e_3,e_3)
| product(A,e_3,e_2)
| product(A,e_3,e_1)
| ~ group_element(A) ),
inference(resolve,[status(thm)],[c_47,c_46]) ).
cnf(c_203,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_1) ),
inference(resolve,[status(thm)],[c_145,c_49]) ).
cnf(c_204,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(resolve,[status(thm)],[c_140,c_203]) ).
cnf(c_200,plain,
product(e_1,e_3,e_2),
inference(resolve,[status(thm)],[c_110,c_204]) ).
cnf(c_205,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_1) ),
inference(resolve,[status(thm)],[c_145,c_48]) ).
cnf(c_206,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_1) ),
inference(resolve,[status(thm)],[c_139,c_205]) ).
cnf(c_201,plain,
product(e_2,e_3,e_1),
inference(resolve,[status(thm)],[c_109,c_206]) ).
cnf(c_207,plain,
( ~ product(e_2,e_3,e_1)
| ~ product(e_2,e_2,e_2) ),
inference(resolve,[status(thm)],[c_200,c_68]) ).
cnf(c_208,plain,
~ product(e_2,e_3,e_1),
inference(resolve,[status(thm)],[c_45,c_207]) ).
cnf(c_202,plain,
$false,
inference(resolve,[status(thm)],[c_201,c_208]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP123-3.003 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n001.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Fri Sep 25 14:29:25 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 3514377 was started by sandbox2 on n001,
% 0.17/0.44 % Fri Sep 25 14:29:25 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 0.17/0.47
% 0.17/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.47
% 0.17/0.47 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.17/0.47 % Length of proof is 24.
% 0.17/0.47 % Level of proof is 4.
% 0.17/0.47 % Maximum clause weight is 21.000.
% 0.17/0.47 % Given clauses 85.
% 0.17/0.47
% 0.17/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------