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