%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP123-2.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 : n002.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.48s
% 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_2,axiom,
~ equalish(e_3,e_2),
file('theBenchmark.p',e_3_is_not_e_2) ).
cnf(c_10,plain,
~ equalish(e_3,e_2),
inference(clausify,[status(thm)],[e_3_is_not_e_2]) ).
fof(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('theBenchmark.p',e_3_is_not_e_1) ).
cnf(c_11,plain,
~ equalish(e_3,e_1),
inference(clausify,[status(thm)],[e_3_is_not_e_1]) ).
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_16,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_17,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_19,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_22,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_19,c_10]) ).
cnf(c_27,plain,
( ~ product(e_1,A,B)
| ~ product(e_3,A,B) ),
inference(resolve,[status(thm)],[c_17,c_11]) ).
cnf(c_28,plain,
( ~ product(e_2,A,B)
| ~ product(e_3,A,B) ),
inference(resolve,[status(thm)],[c_17,c_10]) ).
cnf(c_30,plain,
( ~ product(A,e_1,B)
| ~ product(A,e_3,B) ),
inference(resolve,[status(thm)],[c_16,c_11]) ).
cnf(c_31,plain,
( ~ product(A,e_2,B)
| ~ product(A,e_3,B) ),
inference(resolve,[status(thm)],[c_16,c_10]) ).
fof(product_idempotence,axiom,
! [VAR_0] : product(VAR_0,VAR_0,VAR_0),
file('theBenchmark.p',product_idempotence) ).
cnf(c_35,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_36,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_37,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_38,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_39,plain,
group_element(e_1),
inference(clausify,[status(thm)],[element_1]) ).
cnf(c_46,plain,
( ~ product(B,e_3,A)
| ~ product(B,e_2,B)
| ~ product(A,e_3,B) ),
inference(factor,[status(thm)],[c_22]) ).
cnf(c_60,plain,
~ product(e_2,e_3,e_3),
inference(resolve,[status(thm)],[c_35,c_28]) ).
cnf(c_61,plain,
~ product(e_1,e_3,e_3),
inference(resolve,[status(thm)],[c_35,c_27]) ).
cnf(c_89,plain,
~ product(e_2,e_3,e_2),
inference(resolve,[status(thm)],[c_31,c_35]) ).
cnf(c_90,plain,
~ product(e_1,e_3,e_1),
inference(resolve,[status(thm)],[c_30,c_35]) ).
cnf(c_95,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_37,c_36]) ).
cnf(c_110,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_95,c_39]) ).
cnf(c_111,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(resolve,[status(thm)],[c_90,c_110]) ).
cnf(c_107,plain,
product(e_1,e_3,e_2),
inference(resolve,[status(thm)],[c_61,c_111]) ).
cnf(c_112,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_95,c_38]) ).
cnf(c_113,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_1) ),
inference(resolve,[status(thm)],[c_89,c_112]) ).
cnf(c_108,plain,
product(e_2,e_3,e_1),
inference(resolve,[status(thm)],[c_60,c_113]) ).
cnf(c_114,plain,
( ~ product(e_2,e_3,e_1)
| ~ product(e_2,e_2,e_2) ),
inference(resolve,[status(thm)],[c_107,c_46]) ).
cnf(c_115,plain,
~ product(e_2,e_3,e_1),
inference(resolve,[status(thm)],[c_35,c_114]) ).
cnf(c_109,plain,
$false,
inference(resolve,[status(thm)],[c_108,c_115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP123-2.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.44 % Computer : n002.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Fri Sep 25 14:26:38 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.45 % Process 3492074 was started by sandbox2 on n002,
% 0.17/0.45 % Fri Sep 25 14:26:38 2026
% 0.17/0.45 % 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.48
% 0.17/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.48
% 0.17/0.48 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.17/0.48 % Length of proof is 24.
% 0.17/0.48 % Level of proof is 4.
% 0.17/0.48 % Maximum clause weight is 16.000.
% 0.17/0.48 % Given clauses 38.
% 0.17/0.48
% 0.17/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------