%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP135-2.002 : TPTP v9.2.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:24:32 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 37 ( 13 unt; 16 nHn; 37 RR)
% Number of literals : 78 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(qg3,negated_conjecture,
( product(X4,X1,X2)
| ~ product(X1,X2,X3)
| ~ product(X3,X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg3) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_2) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_1) ).
cnf(c_0_8,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| ~ group_element(X1)
| ~ group_element(X2) ),
product_total_function1 ).
cnf(c_0_9,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_10,plain,
( product(X1,e_2,e_2)
| product(X1,e_2,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_12,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_13,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( product(X4,X1,X2)
| ~ product(X1,X2,X3)
| ~ product(X3,X1,X4) ),
qg3 ).
cnf(c_0_15,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( equalish(X1,e_2)
| product(e_2,e_2,e_1)
| ~ product(X1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
~ equalish(e_1,e_2),
e_1_is_not_e_2 ).
cnf(c_0_18,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
cnf(c_0_19,plain,
( product(X1,e_1,e_2)
| product(X1,e_1,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( product(e_1,e_2,e_1)
| product(e_2,e_2,X1)
| ~ product(e_2,X1,e_1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( product(e_1,e_2,e_1)
| product(e_2,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_17]) ).
cnf(c_0_22,plain,
( equalish(X1,e_2)
| product(e_2,e_2,e_1)
| ~ product(e_2,X1,e_2) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_23,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_24,plain,
( equalish(X1,e_1)
| product(e_1,e_2,e_1)
| ~ product(X1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( product(e_2,e_2,e_2)
| product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
~ equalish(e_2,e_1),
e_2_is_not_e_1 ).
cnf(c_0_27,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]) ).
cnf(c_0_28,negated_conjecture,
product(e_1,e_2,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
( equalish(X1,e_2)
| product(e_2,e_1,e_1)
| ~ product(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( equalish(X1,e_2)
| ~ product(e_1,X1,e_1) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
product(e_2,e_1,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_28]),c_0_17]) ).
cnf(c_0_32,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_33,negated_conjecture,
~ product(e_1,e_1,e_1),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( product(e_1,e_1,X1)
| ~ product(e_1,X1,e_2) ),
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
cnf(c_0_35,plain,
product(e_1,e_1,e_2),
inference(sr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP135-2.002 : TPTP v9.2.1. Released v1.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n022.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 18:24:51 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.369s
%------------------------------------------------------------------------------