%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP009-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n009.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:23:32 PM UTC 2026
% Result : Unsatisfiable 1.23s 1.71s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 39 ( 24 unt; 0 nHn; 29 RR)
% Number of literals : 63 ( 12 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',total_function2) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(associativity2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',associativity2) ).
cnf(c_is_an_inverse_of_b,hypothesis,
product(c,b,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_an_inverse_of_b) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',total_function1) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
cnf(a_is_an_inverse_of_b,hypothesis,
product(a,b,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_an_inverse_of_b) ).
cnf(prove_a_equals_c,negated_conjecture,
a != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_c) ).
cnf(c_0_9,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
total_function2 ).
cnf(c_0_10,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_11,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
associativity2 ).
cnf(c_0_12,hypothesis,
product(c,b,identity),
c_is_an_inverse_of_b ).
cnf(c_0_13,plain,
( X1 = X2
| ~ product(X2,identity,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_15,hypothesis,
( product(X1,b,X2)
| ~ product(X3,identity,X2)
| ~ product(X3,c,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_18,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_19,hypothesis,
( product(X1,b,X2)
| ~ product(X2,c,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
cnf(c_0_20,plain,
( X1 = X2
| ~ product(identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_21,hypothesis,
product(a,b,identity),
a_is_an_inverse_of_b ).
cnf(c_0_22,plain,
( product(X1,X2,X3)
| ~ product(X4,inverse(X2),X1)
| ~ product(X4,identity,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_23,plain,
( X1 = multiply(X2,X3)
| ~ product(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_24,hypothesis,
product(identity,b,inverse(c)),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_25,plain,
multiply(identity,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_26,hypothesis,
( product(X1,b,X2)
| ~ product(X3,identity,X2)
| ~ product(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_27,plain,
( product(identity,X1,X2)
| ~ product(inverse(inverse(X1)),identity,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_28,hypothesis,
inverse(c) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,hypothesis,
( product(X1,b,X2)
| ~ product(X2,a,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_16]) ).
cnf(c_0_30,hypothesis,
( product(identity,c,X1)
| ~ product(inverse(b),identity,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,hypothesis,
product(identity,b,inverse(a)),
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_32,hypothesis,
product(identity,c,inverse(b)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_14]),c_0_16]) ).
cnf(c_0_33,hypothesis,
inverse(a) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_25]) ).
cnf(c_0_34,hypothesis,
inverse(b) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_32]),c_0_25]) ).
cnf(c_0_35,hypothesis,
( product(identity,a,X1)
| ~ product(c,identity,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_33]),c_0_34]) ).
cnf(c_0_36,hypothesis,
product(identity,a,c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_14]),c_0_16]) ).
cnf(c_0_37,negated_conjecture,
a != c,
prove_a_equals_c ).
cnf(c_0_38,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_36]),c_0_25]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP009-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n009.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 18:26:41 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.23/1.71 % Version : CSE_E---1.7
% 1.23/1.71 % Problem : theBenchmark.p
% 1.23/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.71 % SZS output start CNFRefutation
% See solution above
% 1.23/1.71 % Total time : 1.369s
%------------------------------------------------------------------------------