%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP515-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 : n008.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:18 PM UTC 2026
% Result : Unsatisfiable 1.34s 1.74s
% Output : CNFRefutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 21 ( 20 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X1,X3)))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X1,X3)))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X4,X3))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
multiply(X1,multiply(X2,inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,multiply(multiply(X2,multiply(multiply(X3,X4),inverse(multiply(X1,X4)))),inverse(X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,X2),multiply(X3,inverse(multiply(X3,X2)))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_8,plain,
multiply(X1,multiply(multiply(X2,X3),inverse(X2))) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_9,plain,
multiply(multiply(X1,X2),multiply(X3,inverse(X1))) = multiply(X3,X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
multiply(multiply(X1,X2),X3) = multiply(multiply(X1,X3),X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(multiply(X2,inverse(X3)),multiply(multiply(X3,X4),inverse(multiply(X1,X4))))) = X2,
inference(rw,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_12,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_2]),c_0_10]) ).
cnf(c_0_13,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_15,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(X2,X3)) = multiply(X3,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_15]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
multiply(b3,multiply(a3,c3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP515-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.32 % Computer : n008.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 18:40:28 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.34/1.74 % Version : CSE_E---1.7
% 1.34/1.74 % Problem : theBenchmark.p
% 1.34/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.34/1.74 % SZS output start CNFRefutation
% See solution above
% 1.34/1.74 % Total time : 1.372s
%------------------------------------------------------------------------------