%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP594-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 : n001.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:28 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 6 RR)
% Number of literals : 31 ( 30 equ; 5 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; 2 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(double_divide(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(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(double_divide(X3,X2)))))) = X3,
single_axiom ).
cnf(c_0_4,plain,
inverse(double_divide(double_divide(double_divide(X1,X2),inverse(double_divide(X3,X2))),X3)) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(double_divide(double_divide(X1,inverse(double_divide(X2,inverse(double_divide(X3,X4))))),inverse(double_divide(X1,X3)))) = double_divide(X2,X4),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
double_divide(inverse(double_divide(double_divide(X1,inverse(double_divide(X2,X3))),X2)),X3) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(double_divide(inverse(double_divide(X1,X2)),X3),inverse(double_divide(X2,X3))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
inverse(double_divide(double_divide(double_divide(inverse(double_divide(X1,X2)),X3),X3),inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
double_divide(inverse(double_divide(X1,X2)),inverse(double_divide(inverse(X1),X3))) = double_divide(X2,X3),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(inverse(double_divide(double_divide(X1,X2),inverse(X3))),X2) = inverse(double_divide(X3,X1)),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_11,plain,
inverse(double_divide(double_divide(X1,inverse(double_divide(X2,X3))),X1)) = double_divide(X2,X3),
inference(spm,[status(thm)],[c_0_10,c_0_3]) ).
cnf(c_0_12,plain,
double_divide(double_divide(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_13,plain,
inverse(inverse(double_divide(X1,X2))) = double_divide(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_14,plain,
double_divide(inverse(X1),inverse(X2)) = inverse(double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_16,plain,
double_divide(X1,inverse(double_divide(inverse(X2),X3))) = inverse(double_divide(X2,double_divide(X1,X3))),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_17,plain,
inverse(double_divide(X1,double_divide(X1,X2))) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_14]),c_0_15]),c_0_16]),c_0_12]) ).
cnf(c_0_18,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_19,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_20,plain,
double_divide(X1,double_divide(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_15]) ).
cnf(c_0_21,negated_conjecture,
inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_22,plain,
inverse(double_divide(X1,inverse(X2))) = double_divide(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_24,plain,
inverse(double_divide(inverse(X1),X2)) = double_divide(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
double_divide(double_divide(b2,inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_27,plain,
double_divide(X1,double_divide(inverse(X2),X3)) = inverse(double_divide(X3,double_divide(X1,X2))),
inference(rw,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
double_divide(inverse(a2),double_divide(b2,inverse(b2))) != a2,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
double_divide(X1,double_divide(X2,inverse(X3))) = inverse(double_divide(X2,double_divide(X1,X3))),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_26]),c_0_20]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP594-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.16/0.33 % Computer : n001.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:45:48 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.28/1.72 % Version : CSE_E---1.7
% 1.28/1.72 % Problem : theBenchmark.p
% 1.28/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.72 % SZS output start CNFRefutation
% See solution above
% 1.28/1.72 % Total time : 1.368s
%------------------------------------------------------------------------------