%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP424-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:05 PM UTC 2026
% Result : Unsatisfiable 1.43s 1.76s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 3 RR)
% Number of literals : 18 ( 17 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 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 : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X3),X3))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X3),X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(inverse(multiply(inverse(X3),X3)))))),inverse(multiply(inverse(inverse(multiply(inverse(X3),X3))),inverse(multiply(inverse(X3),X3))))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),X3)))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),X3)))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(X2),inverse(multiply(inverse(X3),X3)))),X3)))),multiply(X1,inverse(X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(X3,inverse(X4))))) = multiply(inverse(multiply(X5,inverse(X2))),multiply(X5,inverse(multiply(X3,inverse(X4))))),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(X3))) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,inverse(X3))),
inference(spm,[status(thm)],[c_0_6,c_0_2]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),multiply(X3,inverse(X4)))))),multiply(X1,inverse(multiply(X3,inverse(X4)))))),inverse(multiply(inverse(multiply(X5,inverse(X4))),multiply(X5,inverse(X4))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),multiply(X3,inverse(multiply(inverse(X4),X4))))))),multiply(X1,inverse(multiply(X3,inverse(multiply(inverse(X4),X4))))))),inverse(multiply(inverse(X5),X5))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_2]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X3)))),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X4),X4))) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(inverse(X1),multiply(inverse(multiply(inverse(multiply(X2,inverse(multiply(inverse(X1),X3)))),multiply(X2,inverse(X3)))),inverse(X3)))),inverse(multiply(inverse(X3),X3))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_12,plain,
multiply(inverse(X1),inverse(multiply(inverse(X2),X2))) = multiply(inverse(X1),inverse(multiply(inverse(X3),X3))),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(multiply(inverse(X2),X2)),multiply(inverse(X2),X2)))) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_14,plain,
multiply(inverse(X1),X1) = multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(X3),X3))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
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,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP424-1 : TPTP v9.2.1. Released v2.6.0.
% 0.00/0.10 % 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.12/0.30 % Computer : n009.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30 % CPULimit : 300
% 0.12/0.30 % WCLimit : 300
% 0.12/0.30 % DateTime : Mon May 4 18:35:10 EDT 2026
% 0.12/0.30 % CPUTime :
% 0.12/0.31 % start to proof: theBenchmark
% 1.43/1.76 % Version : CSE_E---1.7
% 1.43/1.76 % Problem : theBenchmark.p
% 1.43/1.76 % SZS status Unsatisfiable for theBenchmark.p
% 1.43/1.76 % SZS output start CNFRefutation
% See solution above
% 1.43/1.76 % Total time : 1.367s
%------------------------------------------------------------------------------