%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP094-1 : TPTP v9.2.1. Bugfixed v2.7.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 : n016.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:23:47 PM UTC 2026
% Result : Unsatisfiable 1.44s 1.79s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of clauses : 35 ( 30 unt; 0 nHn; 10 RR)
% Number of literals : 47 ( 46 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_5,axiom,
divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
single_axiom ).
cnf(c_0_6,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_7,plain,
divide(identity,divide(divide(X1,X2),X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_8,plain,
divide(identity,divide(identity,X1)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
divide(identity,divide(X1,identity)) = divide(identity,X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
divide(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_9]),c_0_7]) ).
cnf(c_0_11,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_10]),c_0_8]) ).
cnf(c_0_12,plain,
divide(divide(X1,X2),X1) = divide(identity,X2),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_13,plain,
divide(X1,X2) = divide(identity,divide(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_14,plain,
divide(divide(X1,X2),divide(divide(X1,X3),X2)) = X3,
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
prove_these_axioms ).
cnf(c_0_16,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(c_0_17,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_18,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4))
| divide(divide(divide(identity,b2),divide(identity,b2)),divide(identity,a2)) != a2
| divide(divide(identity,b1),divide(identity,b1)) != divide(divide(identity,a1),divide(identity,a1))
| divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]),c_0_16]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_20,plain,
divide(identity,divide(X1,divide(X2,divide(X3,X1)))) = divide(X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
| divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4))
| divide(identity,divide(identity,a2)) != a2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_6]),c_0_6]),c_0_6])]) ).
cnf(c_0_22,plain,
divide(divide(X1,X2),X3) = divide(identity,divide(X2,divide(X1,X3))),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
| divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_8])]) ).
cnf(c_0_24,plain,
divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_22]),c_0_11]) ).
cnf(c_0_25,negated_conjecture,
divide(a3,divide(identity,divide(c3,divide(identity,b3)))) != divide(b3,divide(identity,divide(c3,divide(identity,a3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22]),c_0_22]),c_0_11]),c_0_24]),c_0_24]),c_0_24])]) ).
cnf(c_0_26,plain,
divide(identity,divide(X1,divide(X2,X3))) = divide(X4,divide(X1,divide(X2,divide(X4,divide(identity,X3))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_22]),c_0_22]),c_0_22]),c_0_22]),c_0_11]),c_0_11]) ).
cnf(c_0_27,plain,
divide(divide(X1,X2),divide(identity,X2)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_28,negated_conjecture,
divide(a3,divide(X1,divide(c3,divide(identity,divide(X1,divide(identity,b3)))))) != divide(b3,divide(identity,divide(c3,divide(identity,a3)))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
divide(X1,divide(identity,divide(X2,X1))) = X2,
inference(spm,[status(thm)],[c_0_27,c_0_11]) ).
cnf(c_0_30,negated_conjecture,
divide(b3,divide(identity,divide(c3,divide(identity,a3)))) != divide(c3,divide(identity,divide(b3,divide(identity,a3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_11]),c_0_24]) ).
cnf(c_0_31,plain,
divide(X1,divide(X2,divide(X3,X1))) = divide(X3,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_11]) ).
cnf(c_0_32,negated_conjecture,
divide(b3,divide(identity,divide(c3,divide(X1,divide(a3,divide(identity,X1)))))) != divide(c3,divide(identity,divide(b3,divide(X1,divide(a3,divide(identity,X1)))))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
divide(X1,divide(X2,divide(X3,X4))) = divide(X3,divide(X2,divide(X1,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_22]),c_0_22]),c_0_11]),c_0_22]),c_0_11]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP094-1 : TPTP v9.2.1. Bugfixed v2.7.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 : n016.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:20:36 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.44/1.79 % Version : CSE_E---1.7
% 1.44/1.79 % Problem : theBenchmark.p
% 1.44/1.79 % SZS status Unsatisfiable for theBenchmark.p
% 1.44/1.79 % SZS output start CNFRefutation
% See solution above
% 1.44/1.79 % Total time : 1.369s
%------------------------------------------------------------------------------