%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP550-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 : n019.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:22 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 5 RR)
% Number of literals : 26 ( 25 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(single_axiom,axiom,
divide(divide(identity,X1),divide(divide(divide(X2,X1),X3),X2)) = 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_5,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_6,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(c_0_7,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_8,axiom,
divide(divide(identity,X1),divide(divide(divide(X2,X1),X3),X2)) = X3,
single_axiom ).
cnf(c_0_9,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_11,plain,
divide(inverse(X1),divide(divide(divide(X2,X1),X3),X2)) = X3,
inference(rw,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_12,plain,
divide(X1,identity) = multiply(X1,identity),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
divide(X1,X2) = multiply(inverse(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_7]),c_0_6]),c_0_9]) ).
cnf(c_0_14,plain,
multiply(identity,X1) = inverse(inverse(X1)),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_15,plain,
multiply(X1,identity) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_10]),c_0_14]) ).
cnf(c_0_16,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X2,X1),
inference(rw,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_17,plain,
inverse(inverse(inverse(X1))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_13]),c_0_15]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(inverse(X2))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_16]) ).
cnf(c_0_19,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_18]),c_0_16]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_21,plain,
multiply(inverse(X1),X1) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_22,plain,
multiply(inverse(X1),inverse(multiply(inverse(X2),multiply(inverse(X3),multiply(inverse(X1),X2))))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_13]),c_0_13]),c_0_13]),c_0_13]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
inverse(inverse(a2)) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_14]) ).
cnf(c_0_24,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP550-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.14/0.33 % Computer : n019.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 18:42:44 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------