%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP473-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 : n020.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 2.40s 2.12s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 3
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 10 RR)
% Number of literals : 55 ( 54 equ; 9 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 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 : 176 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(divide(inverse(X1),divide(divide(X2,X3),divide(inverse(divide(X4,X1)),divide(divide(X5,X6),X4)))),divide(X3,X2)) = divide(X6,X5),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(divide(X2,X1),divide(inverse(divide(X4,X3)),divide(divide(X5,X6),X4))))) = divide(X5,X6),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(divide(X2,X1),divide(inverse(divide(X4,X3)),divide(X5,X4))))) = X5,
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_7,plain,
divide(divide(divide(divide(divide(X1,X2),inverse(divide(X2,X3))),X4),inverse(divide(X4,X5))),divide(inverse(X3),X5)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_3]) ).
cnf(c_0_8,plain,
divide(divide(X1,inverse(divide(divide(inverse(X2),X3),X4))),divide(inverse(X3),X4)) = divide(divide(X1,X5),inverse(divide(X5,X2))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_9,plain,
divide(divide(divide(divide(divide(X1,X2),inverse(divide(X2,X3))),divide(inverse(X4),X3)),X5),inverse(divide(X5,X4))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
divide(divide(inverse(divide(divide(X1,X2),X3)),X4),divide(divide(divide(X2,X1),X5),inverse(divide(X5,X4)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_11,plain,
divide(divide(X1,X2),inverse(divide(X2,X3))) = divide(divide(X1,X4),inverse(divide(X4,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_12,plain,
divide(divide(divide(divide(divide(X1,divide(inverse(X2),X3)),X4),inverse(divide(X4,X2))),X5),inverse(divide(X5,X3))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_13,plain,
divide(divide(inverse(X1),divide(divide(X2,X3),divide(inverse(divide(divide(X4,X5),X1)),X6))),divide(X3,X2)) = divide(divide(divide(X5,X4),X7),inverse(divide(X7,X6))),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_14,plain,
divide(divide(inverse(divide(inverse(divide(X1,X2)),X3)),divide(divide(X4,X5),inverse(divide(X5,X2)))),divide(X1,X4)) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_15,plain,
divide(X1,inverse(divide(inverse(divide(divide(inverse(X2),X3),X4)),X2))) = divide(X1,divide(inverse(X3),X4)),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_16,plain,
divide(divide(divide(X1,X2),X3),inverse(divide(X3,divide(divide(X4,X5),divide(X2,X1))))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_17,plain,
inverse(divide(inverse(divide(divide(inverse(X1),X2),X3)),X1)) = divide(inverse(X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]) ).
cnf(c_0_18,plain,
divide(inverse(divide(X1,divide(divide(X2,X3),divide(X4,X5)))),divide(divide(X5,X4),X1)) = divide(X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_16]),c_0_4]) ).
cnf(c_0_19,plain,
inverse(divide(inverse(X1),divide(X2,X1))) = divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)),
inference(spm,[status(thm)],[c_0_17,c_0_3]) ).
cnf(c_0_20,plain,
divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_21,plain,
inverse(divide(inverse(X1),divide(X2,X1))) = inverse(divide(inverse(X3),divide(X2,X3))),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_22,plain,
divide(inverse(divide(inverse(X1),divide(X2,X1))),divide(divide(X3,X4),inverse(divide(X4,X3)))) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,divide(X4,X5)),X1)) = inverse(divide(X3,divide(X2,divide(X5,X4)))),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_24,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),X1)),divide(X4,X3)))) = X2,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
divide(inverse(divide(X1,X2)),divide(X3,X1)) = divide(inverse(divide(X4,X2)),divide(X3,X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_4]) ).
cnf(c_0_26,plain,
inverse(inverse(divide(X1,divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23]) ).
cnf(c_0_27,plain,
inverse(inverse(divide(X1,divide(X2,inverse(divide(inverse(X3),divide(X2,X3))))))) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_28,plain,
inverse(inverse(divide(X1,divide(inverse(divide(X2,X3)),divide(X3,X2))))) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_29,plain,
inverse(inverse(divide(inverse(X1),divide(inverse(divide(X2,X3)),X1)))) = inverse(divide(X3,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_30,plain,
inverse(divide(divide(X1,X2),inverse(X2))) = inverse(divide(divide(X1,X3),inverse(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_29]) ).
cnf(c_0_31,plain,
divide(inverse(X1),inverse(X1)) = divide(inverse(X2),inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_30]),c_0_17]) ).
cnf(c_0_32,plain,
divide(inverse(X1),inverse(X1)) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_34,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_35,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_34]) ).
cnf(c_0_37,plain,
inverse(inverse(divide(inverse(inverse(divide(X1,X2))),divide(X3,X3)))) = inverse(divide(X2,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_35]) ).
cnf(c_0_38,plain,
inverse(divide(X1,divide(divide(X2,X2),divide(X3,X4)))) = divide(divide(X4,X3),X1),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
divide(divide(inverse(X1),inverse(X1)),inverse(a2)) != a2,
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_40,plain,
inverse(divide(divide(X1,X1),inverse(inverse(divide(X2,X3))))) = inverse(divide(X3,X2)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
divide(divide(X1,X1),inverse(a2)) != a2,
inference(spm,[status(thm)],[c_0_39,c_0_26]) ).
cnf(c_0_42,plain,
inverse(divide(X1,divide(X2,X2))) = divide(divide(X3,X3),X1),
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_43,plain,
inverse(divide(divide(X1,X1),inverse(divide(X2,X3)))) = inverse(divide(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_40]) ).
cnf(c_0_44,plain,
inverse(divide(inverse(X1),divide(divide(X2,divide(divide(X3,X4),inverse(divide(X4,X3)))),X1))) = X2,
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_45,negated_conjecture,
divide(inverse(divide(divide(X1,X1),divide(X2,X2))),inverse(a2)) != a2,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
inverse(divide(inverse(divide(divide(X1,X1),X2)),X3)) = divide(inverse(inverse(X3)),X2),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_47,plain,
inverse(divide(divide(X1,X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
divide(inverse(divide(X1,X1)),inverse(a2)) != a2,
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_49,plain,
divide(inverse(inverse(X1)),X2) = inverse(divide(X2,X1)),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
inverse(divide(inverse(a2),inverse(divide(X1,X1)))) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_49]),c_0_49]) ).
cnf(c_0_51,plain,
divide(inverse(X1),inverse(divide(X1,X2))) = divide(inverse(X3),inverse(divide(X3,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_17]) ).
cnf(c_0_52,negated_conjecture,
inverse(divide(inverse(X1),inverse(divide(X1,a2)))) != a2,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
inverse(divide(X1,X1)) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_47,c_0_35]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_47]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : GRP473-1 : TPTP v9.2.1. Released v2.6.0.
% 0.10/0.14 % 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.35 % Computer : n020.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Mon May 4 18:36:35 EDT 2026
% 0.16/0.35 % CPUTime :
% 0.17/0.36 % start to proof: theBenchmark
% 2.40/2.12 % Version : CSE_E---1.7
% 2.40/2.12 % Problem : theBenchmark.p
% 2.40/2.12 % SZS status Unsatisfiable for theBenchmark.p
% 2.40/2.12 % SZS output start CNFRefutation
% See solution above
% 2.50/2.13 % Total time : 1.372s
%------------------------------------------------------------------------------