%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP502-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:16 PM UTC 2026
% Result : Unsatisfiable 2.38s 2.08s
% Output : CNFRefutation 2.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 22 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 3 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 : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X1,inverse(double_divide(X2,X3))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))) = X3,
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(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(double_divide(X1,inverse(double_divide(X2,X3))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))) = X3,
single_axiom ).
cnf(c_0_4,plain,
double_divide(double_divide(X1,inverse(X2)),double_divide(inverse(double_divide(X3,inverse(double_divide(X4,X2)))),inverse(double_divide(X5,double_divide(X1,X5))))) = double_divide(inverse(X4),inverse(double_divide(X6,double_divide(X3,X6)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(inverse(X1),inverse(double_divide(X2,double_divide(X3,X2)))) = double_divide(inverse(X1),inverse(double_divide(X4,double_divide(X3,X4)))),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_6,plain,
inverse(double_divide(X1,double_divide(X2,X1))) = inverse(double_divide(X3,double_divide(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_3]) ).
cnf(c_0_7,plain,
double_divide(double_divide(X1,inverse(double_divide(X2,double_divide(X3,X2)))),double_divide(inverse(X4),inverse(double_divide(X5,double_divide(X1,X5))))) = double_divide(X3,X4),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
double_divide(X1,double_divide(X2,inverse(double_divide(X3,double_divide(X4,double_divide(X1,X4)))))) = double_divide(inverse(X3),inverse(double_divide(X5,double_divide(X2,X5)))),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
double_divide(inverse(double_divide(double_divide(X1,inverse(double_divide(X2,X3))),X1)),inverse(double_divide(X4,double_divide(inverse(X2),X4)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(inverse(X1),inverse(double_divide(double_divide(double_divide(X2,inverse(double_divide(X1,X3))),X2),X4))),X3) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_11,plain,
double_divide(inverse(X1),inverse(double_divide(X2,double_divide(inverse(double_divide(double_divide(X3,inverse(double_divide(X4,inverse(X4)))),X3)),X2)))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(double_divide(X1,inverse(double_divide(double_divide(double_divide(X2,inverse(double_divide(X3,inverse(X3)))),X2),X4))),X1) = X4,
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,plain,
double_divide(double_divide(X1,inverse(double_divide(inverse(double_divide(double_divide(X2,inverse(double_divide(X3,inverse(X3)))),X2)),X4))),X1) = X4,
inference(spm,[status(thm)],[c_0_12,c_0_12]) ).
cnf(c_0_14,plain,
double_divide(double_divide(X1,inverse(inverse(X2))),X1) = inverse(double_divide(X3,double_divide(inverse(X2),X3))),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_15,plain,
double_divide(double_divide(X1,inverse(inverse(X2))),X1) = double_divide(double_divide(X3,inverse(inverse(X2))),X3),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_16,plain,
double_divide(double_divide(inverse(X1),inverse(double_divide(double_divide(X2,inverse(inverse(X3))),X2))),X4) = double_divide(inverse(inverse(X3)),inverse(double_divide(X1,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_18,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_19,plain,
double_divide(inverse(inverse(X1)),inverse(double_divide(X2,inverse(X2)))) = double_divide(inverse(inverse(X1)),inverse(double_divide(X3,inverse(X3)))),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
inverse(double_divide(b1,inverse(b1))) != inverse(double_divide(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_21,plain,
inverse(double_divide(X1,inverse(X1))) = inverse(double_divide(X2,inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_19]),c_0_3]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP502-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.17/0.33 % Computer : n008.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Mon May 4 18:39:13 EDT 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.34 % start to proof: theBenchmark
% 2.38/2.08 % Version : CSE_E---1.7
% 2.38/2.08 % Problem : theBenchmark.p
% 2.38/2.08 % SZS status Unsatisfiable for theBenchmark.p
% 2.38/2.08 % SZS output start CNFRefutation
% See solution above
% 2.38/2.09 % Total time : 1.368s
%------------------------------------------------------------------------------