%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP475-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 : n015.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:12 PM UTC 2026
% Result : Unsatisfiable 1.43s 1.78s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 4 RR)
% Number of literals : 32 ( 31 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(divide(divide(X1,X2),X3),divide(X4,X3))),divide(X2,X1)) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(inverse(divide(divide(divide(X1,X2),X3),divide(X4,X3))),divide(X2,X1)) = X4,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(divide(divide(X1,X2),divide(X3,X4)),X5)),divide(X2,X1)) = inverse(divide(divide(divide(X4,X3),X6),divide(X5,X6))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(divide(inverse(divide(divide(divide(X1,X2),divide(X3,X4)),X5)),divide(X2,X1)),divide(X3,X4)) = X5,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
divide(inverse(divide(divide(X1,X2),divide(X3,X2))),divide(divide(X4,X5),inverse(divide(divide(divide(X5,X4),X6),divide(X1,X6))))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_7,plain,
inverse(divide(divide(divide(X1,X2),X3),divide(divide(X4,divide(X2,X1)),X3))) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_8,plain,
divide(divide(inverse(divide(divide(divide(X1,X2),X3),X4)),divide(X2,X1)),X3) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_9,plain,
divide(X1,divide(divide(X2,X3),inverse(divide(divide(divide(X3,X2),X4),divide(divide(X5,X6),X4))))) = divide(X1,divide(X6,X5)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
divide(divide(X1,X2),inverse(divide(divide(divide(X2,X1),X3),divide(divide(X4,X5),X3)))) = divide(X5,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
cnf(c_0_11,plain,
divide(inverse(divide(X1,divide(X2,X3))),divide(divide(X4,X5),inverse(divide(divide(divide(X5,X4),X3),X1)))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_12,plain,
inverse(divide(divide(divide(X1,divide(X2,X3)),X4),divide(divide(X5,X6),X4))) = divide(divide(inverse(divide(X6,X5)),divide(X3,X2)),X1),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_13,plain,
divide(divide(divide(inverse(divide(X1,X2)),divide(X3,X4)),X5),divide(divide(X4,X3),X5)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_14,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),inverse(divide(divide(divide(X4,X3),X5),X1)))),X5))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,plain,
divide(divide(divide(X1,X2),inverse(divide(X3,X4))),inverse(divide(X4,X3))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_16,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,X4),inverse(divide(X2,X1)))) = divide(X4,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_10]) ).
cnf(c_0_17,plain,
divide(inverse(divide(divide(divide(divide(X1,X2),inverse(divide(divide(divide(X2,X1),X3),divide(X4,X3)))),X5),divide(X6,X5))),X4) = X6,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_18,plain,
inverse(divide(divide(divide(X1,X2),inverse(divide(X2,X1))),X3)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_3]) ).
cnf(c_0_20,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
divide(X1,divide(divide(X2,X3),divide(X2,X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_20]),c_0_20]) ).
cnf(c_0_22,plain,
divide(X1,inverse(inverse(X2))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_23,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_21]) ).
cnf(c_0_24,plain,
divide(inverse(inverse(X1)),X2) = divide(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_20]) ).
cnf(c_0_25,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_26,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_27,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_28,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_24]),c_0_19]) ).
cnf(c_0_29,negated_conjecture,
divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]) ).
cnf(c_0_30,plain,
divide(X1,X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_27]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_29,c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP475-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.16/0.33 % Computer : n015.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 18:36:32 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.43/1.78 % Version : CSE_E---1.7
% 1.43/1.78 % Problem : theBenchmark.p
% 1.43/1.78 % SZS status Unsatisfiable for theBenchmark.p
% 1.43/1.78 % SZS output start CNFRefutation
% See solution above
% 1.43/1.78 % Total time : 1.371s
%------------------------------------------------------------------------------