%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP070-1 : TPTP v9.2.1. Bugfixed v2.3.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 : n026.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:43 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.73s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 27 ( 22 unt; 0 nHn; 8 RR)
% Number of literals : 35 ( 34 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X1,X1),divide(X2,divide(divide(X3,divide(X4,X2)),inverse(X4)))) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
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)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(divide(X1,X1),divide(X2,divide(divide(X3,divide(X4,X2)),inverse(X4)))) = X3,
single_axiom ).
cnf(c_0_4,plain,
divide(divide(X1,X1),divide(divide(divide(X2,divide(X3,X4)),inverse(X3)),divide(X2,inverse(X4)))) = divide(X5,X5),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_6,plain,
divide(divide(X1,X1),divide(X2,divide(divide(X3,X3),inverse(X4)))) = divide(X4,X2),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
divide(divide(X1,X1),divide(divide(X2,divide(divide(X3,divide(X4,X2)),inverse(X4))),divide(divide(X5,X3),inverse(divide(X6,X6))))) = X5,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
divide(X1,divide(divide(X2,X2),inverse(X1))) = divide(X3,X3),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
divide(divide(X1,X1),inverse(X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6]),c_0_3]) ).
cnf(c_0_10,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)) ),
prove_these_axioms ).
cnf(c_0_11,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_12,plain,
divide(divide(X1,X1),divide(X2,X3)) = divide(X3,X2),
inference(rw,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2
| divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1))
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(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)],[c_0_10,c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_14,plain,
divide(divide(X1,X2),divide(X3,X3)) = divide(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_12]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 ),
inference(sr,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_16,plain,
divide(divide(divide(X1,divide(X2,X3)),inverse(X2)),X3) = X1,
inference(rw,[status(thm)],[c_0_3,c_0_12]) ).
cnf(c_0_17,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(divide(X1,X1),inverse(a2)) != a2 ),
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
cnf(c_0_19,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_5]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_9])]) ).
cnf(c_0_21,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_22,plain,
divide(divide(X1,divide(X2,divide(X3,X4))),inverse(X2)) = divide(divide(X1,inverse(X3)),X4),
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_23,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_24,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]),c_0_21]),c_0_17]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP070-1 : TPTP v9.2.1. Bugfixed v2.3.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.15/0.33 % Computer : n026.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 18:19:23 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.28/1.73 % Version : CSE_E---1.7
% 1.28/1.73 % Problem : theBenchmark.p
% 1.28/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.73 % SZS output start CNFRefutation
% See solution above
% 1.28/1.73 % Total time : 1.370s
%------------------------------------------------------------------------------