%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP522-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 : n021.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:18 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 7 RR)
% Number of literals : 24 ( 23 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
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(single_axiom,axiom,
divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_0_4,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_5,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_6,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
divide(multiply(inverse(X1),X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_9,plain,
multiply(multiply(inverse(X1),X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
single_axiom ).
cnf(c_0_11,negated_conjecture,
inverse(inverse(a2)) != a2,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_13,plain,
divide(X1,divide(divide(X2,divide(X3,X1)),X2)) = X3,
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_14,plain,
inverse(divide(X1,multiply(X2,X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_10]),c_0_5]),c_0_6]) ).
cnf(c_0_15,negated_conjecture,
multiply(divide(X1,X1),a2) != a2,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
multiply(X1,divide(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_5]),c_0_6]) ).
cnf(c_0_17,plain,
inverse(multiply(X1,inverse(X1))) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_6]) ).
cnf(c_0_18,negated_conjecture,
multiply(inverse(divide(X1,X1)),a2) != a2,
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_20,plain,
inverse(multiply(X1,multiply(X2,inverse(X2)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_6]) ).
cnf(c_0_21,negated_conjecture,
multiply(inverse(inverse(multiply(inverse(X1),X1))),a2) != a2,
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_22,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_9]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_9]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP522-1 : TPTP v9.2.1. Released v2.6.0.
% 0.00/0.11 % 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.14/0.32 % Computer : n021.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 18:41:55 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------