%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP416-1 : TPTP v9.2.1. Released v2.6.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 : 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:26:04 PM UTC 2026
% Result : Unsatisfiable 87.73s 54.01s
% Output : CNFRefutation 88.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 5 RR)
% Number of literals : 32 ( 31 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 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 : 81 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))) = X3,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,X3))),inverse(multiply(inverse(X1),X1)))))) = multiply(X4,inverse(multiply(inverse(multiply(inverse(multiply(X5,X4)),multiply(X5,inverse(X3)))),inverse(multiply(inverse(X4),X4))))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(inverse(X3))))),inverse(multiply(inverse(X1),X1))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),X3)),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(inverse(X3))))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),inverse(multiply(inverse(X2),X2)))))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_2]) ).
cnf(c_0_7,plain,
inverse(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,X3))),inverse(multiply(inverse(X1),X1))))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,inverse(X3))))))),inverse(multiply(inverse(X2),X2))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_5]) ).
cnf(c_0_9,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X4)))),inverse(multiply(inverse(inverse(multiply(X2,X3))),inverse(multiply(X2,X3)))))) = multiply(X2,inverse(inverse(multiply(X3,inverse(multiply(X4,inverse(multiply(inverse(X3),X3)))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_3]),c_0_7]) ).
cnf(c_0_10,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,inverse(inverse(multiply(X3,inverse(X4))))))),X1)),X4)),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(X3),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8]),c_0_4]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))),inverse(multiply(inverse(X2),X2))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,X3))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_3]),c_0_2]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(X3),inverse(multiply(inverse(X2),X2))))))))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_13,plain,
inverse(multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(inverse(multiply(inverse(X1),X1))),inverse(multiply(inverse(X1),X1)))))))) = multiply(inverse(X1),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8]) ).
cnf(c_0_14,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(multiply(inverse(X2),X2)))) = multiply(inverse(X3),X3),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X2),X2)))),inverse(multiply(inverse(multiply(X3,multiply(X2,inverse(X4)))),inverse(multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X2),X2))))),inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X2),X2)))))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_16,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(X1),inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(inverse(X1)),inverse(X1))))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_18,plain,
inverse(multiply(inverse(X1),inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(X3),X3)))))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_19,plain,
inverse(multiply(inverse(X1),multiply(inverse(X2),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_18]),c_0_18]) ).
cnf(c_0_20,plain,
inverse(multiply(inverse(X1),X1)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_21,plain,
inverse(multiply(inverse(X1),inverse(multiply(inverse(X2),X2)))) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(inverse(X3))))) = X3,
inference(rw,[status(thm)],[c_0_4,c_0_21]) ).
cnf(c_0_23,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,X3))))) = X3,
inference(rw,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_25,plain,
multiply(inverse(inverse(X1)),multiply(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_26,plain,
multiply(inverse(inverse(inverse(multiply(X1,X2)))),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_28,plain,
inverse(multiply(multiply(inverse(X1),X1),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
multiply(multiply(inverse(X1),multiply(multiply(inverse(X2),X2),X1)),a2) != a2,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_22]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP416-1 : TPTP v9.2.1. Released v2.6.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.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:35:25 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 87.73/54.01 % Version : CSE_E---1.7
% 87.73/54.01 % Problem : theBenchmark.p
% 87.73/54.01 % SZS status Unsatisfiable for theBenchmark.p
% 87.73/54.01 % SZS output start CNFRefutation
% See solution above
% 88.12/54.38 % Total time : 37.581s
%------------------------------------------------------------------------------