%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP440-1 : TPTP v9.2.1. Released v2.6.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 : n006.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:26:07 PM UTC 2026
% Result : Unsatisfiable 14.58s 9.31s
% Output : CNFRefutation 14.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 8 RR)
% Number of literals : 39 ( 38 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 14 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 121 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(X4,multiply(X1,X3))))))) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(X4,multiply(X1,X3))))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),X3),inverse(multiply(X4,multiply(X5,X3))))),X4)))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(X1,multiply(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),X4),inverse(multiply(X5,multiply(X2,X4)))))),multiply(multiply(X5,X6),inverse(multiply(X7,multiply(X1,X6))))))) = X7,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),multiply(multiply(inverse(X3),X4),inverse(multiply(X5,multiply(X6,X4))))),X5)),X6)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),multiply(multiply(X3,X4),inverse(multiply(X5,multiply(X6,X4))))),X5)),X6)))) = multiply(X7,multiply(X8,multiply(multiply(inverse(X8),X9),inverse(multiply(X3,multiply(X7,X9)))))),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(inverse(X4),multiply(X1,X3)))))) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
inverse(multiply(X1,multiply(X2,multiply(X3,inverse(multiply(X4,multiply(X1,multiply(X5,multiply(multiply(inverse(X5),X6),inverse(multiply(inverse(X3),multiply(inverse(X2),X6)))))))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
inverse(multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(X3,X2)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_5]) ).
cnf(c_0_10,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(X3,inverse(multiply(X4,X3)))),X4))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_5]) ).
cnf(c_0_11,plain,
inverse(multiply(X1,multiply(X2,multiply(inverse(X2),inverse(multiply(X3,X1)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_10]),c_0_10]) ).
cnf(c_0_12,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),inverse(multiply(inverse(X3),X1))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_10]) ).
cnf(c_0_13,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(X3,multiply(inverse(X3),inverse(multiply(X4,X5)))),X4)),X5))) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
multiply(multiply(X1,multiply(X2,inverse(multiply(X3,X2)))),multiply(X4,multiply(inverse(X4),X3))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_15,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),multiply(multiply(X3,multiply(inverse(X3),inverse(X4))),X4)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(X2,inverse(multiply(multiply(multiply(X3,multiply(inverse(X3),inverse(X4))),X4),X2)))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
inverse(multiply(multiply(X1,multiply(inverse(X1),inverse(multiply(X2,X3)))),multiply(X4,multiply(inverse(X4),X2)))) = X3,
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_18,plain,
inverse(multiply(inverse(X1),X1)) = multiply(multiply(X2,multiply(inverse(X2),inverse(X3))),X3),
inference(spm,[status(thm)],[c_0_2,c_0_16]) ).
cnf(c_0_19,plain,
inverse(inverse(multiply(inverse(X1),X1))) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_22,plain,
inverse(multiply(X1,multiply(inverse(multiply(X2,X1)),multiply(inverse(X3),X3)))) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_24,plain,
multiply(multiply(X1,multiply(X2,inverse(multiply(multiply(inverse(inverse(X3)),inverse(multiply(inverse(X4),X3))),X2)))),X4) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_25,plain,
inverse(multiply(X1,multiply(inverse(X2),X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
inverse(multiply(X1,inverse(multiply(multiply(inverse(inverse(X2)),inverse(multiply(inverse(a2),X2))),X1)))) != a2,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_25]),c_0_5]) ).
cnf(c_0_28,plain,
inverse(multiply(inverse(X1),multiply(X1,multiply(multiply(X2,multiply(X3,inverse(multiply(X4,X3)))),X4)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_29,negated_conjecture,
inverse(multiply(X1,inverse(multiply(multiply(inverse(inverse(a2)),inverse(multiply(inverse(X2),X2))),X1)))) != a2,
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_30,plain,
inverse(multiply(X1,inverse(multiply(X2,X1)))) = X2,
inference(rw,[status(thm)],[c_0_22,c_0_27]) ).
cnf(c_0_31,plain,
multiply(inverse(X1),multiply(X1,multiply(multiply(X2,multiply(X3,inverse(multiply(X4,X3)))),X4))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_28]),c_0_5]) ).
cnf(c_0_32,plain,
multiply(X1,inverse(multiply(inverse(X2),X2))) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_27]) ).
cnf(c_0_33,plain,
multiply(X1,multiply(X2,inverse(multiply(inverse(multiply(inverse(X3),X3)),X2)))) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
multiply(inverse(inverse(a2)),inverse(multiply(inverse(X1),X1))) != a2,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,negated_conjecture,
inverse(inverse(a2)) != a2,
inference(rw,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_37,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP440-1 : TPTP v9.2.1. Released v2.6.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 : n006.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:34:46 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 14.58/9.31 % Version : CSE_E---1.7
% 14.58/9.31 % Problem : theBenchmark.p
% 14.58/9.31 % SZS status Unsatisfiable for theBenchmark.p
% 14.58/9.31 % SZS output start CNFRefutation
% See solution above
% 14.58/9.37 % Total time : 6.374s
%------------------------------------------------------------------------------