%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GRP536-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:23:58 AM UTC 2026
% Result : Unsatisfiable 8.80s 7.55s
% Output : CNFRefutation 8.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 3 RR)
% Number of literals : 31 ( 30 equ; 2 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X0,divide(divide(X0,X1),X2)),X1) = X2 ).
cnf(multiply,axiom,
multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)) ).
cnf(inverse,axiom,
inverse(X0) = divide(divide(X1,X1),X0) ).
cnf(identity,axiom,
identity = divide(X0,X0) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a) ).
cnf(c0,plain,
divide(divide(X0,divide(divide(X0,X1),X2)),X1) = X2,
inference(clausification,[status(esa)],[single_axiom]) ).
cnf(c1,plain,
multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
inference(clausification,[status(esa)],[multiply]) ).
cnf(c2,plain,
inverse(X0) = divide(divide(X1,X1),X0),
inference(clausification,[status(esa)],[inverse]) ).
cnf(c3,plain,
identity = divide(X0,X0),
inference(clausification,[status(esa)],[identity]) ).
cnf(c4,plain,
multiply(a,b) != multiply(b,a),
inference(clausification,[status(esa)],[prove_these_axioms_4]) ).
cnf(d0,plain,
inverse(X1) = divide(identity,X1),
inference(demodulation,[status(thm)],[c2,c3]) ).
cnf(d1,plain,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
inference(demodulation,[status(thm)],[c1,c3]) ).
cnf(d2,plain,
multiply(X1,X0) = divide(X1,inverse(X0)),
inference(demodulation,[status(thm)],[d1,d0]) ).
cnf(d3,plain,
divide(divide(X0,X2),divide(divide(X0,X1),X2)) = X1,
inference(superposition,[status(thm)],[c0,c0]) ).
cnf(d4,plain,
divide(divide(X0,X1),divide(identity,X1)) = X0,
inference(superposition,[status(thm)],[c3,d3]) ).
cnf(d5,plain,
divide(divide(X1,X0),inverse(X0)) = X1,
inference(demodulation,[status(thm)],[d4,d0]) ).
cnf(d6,plain,
multiply(divide(X0,X1),X1) = X0,
inference(demodulation,[status(thm)],[d5,d2]) ).
cnf(d7,plain,
divide(X2,divide(divide(divide(X0,X1),X3),divide(divide(X0,X2),X1))) = X3,
inference(superposition,[status(thm)],[d3,d3]) ).
cnf(d8,plain,
divide(X1,identity) = X1,
inference(superposition,[status(thm)],[c3,d7]) ).
cnf(d9,plain,
divide(divide(X0,divide(X0,X1)),identity) = X1,
inference(superposition,[status(thm)],[c3,d3]) ).
cnf(d10,plain,
divide(X0,divide(X0,X1)) = X1,
inference(demodulation,[status(thm)],[d9,d8]) ).
cnf(d11,plain,
multiply(X0,identity) = divide(X0,identity),
inference(superposition,[status(thm)],[c3,d1]) ).
cnf(d12,plain,
multiply(X0,identity) = X0,
inference(demodulation,[status(thm)],[d11,d8]) ).
cnf(d13,plain,
X0 = divide(X0,identity),
inference(superposition,[status(thm)],[d6,d12]) ).
cnf(d14,plain,
divide(divide(divide(X0,divide(divide(X0,X1),X2)),divide(X2,X3)),X1) = X3,
inference(superposition,[status(thm)],[c0,c0]) ).
cnf(d15,plain,
divide(divide(divide(X1,divide(divide(X1,X2),identity)),inverse(X0)),X2) = X0,
inference(superposition,[status(thm)],[d0,d14]) ).
cnf(d16,plain,
divide(multiply(divide(X0,divide(divide(X0,X1),identity)),X2),X1) = X2,
inference(demodulation,[status(thm)],[d15,d2]) ).
cnf(d17,plain,
divide(multiply(divide(X0,divide(X0,X1)),X2),X1) = X2,
inference(demodulation,[status(thm)],[d16,d13]) ).
cnf(d18,plain,
divide(multiply(X1,X2),X1) = X2,
inference(demodulation,[status(thm)],[d17,d10]) ).
cnf(d19,plain,
multiply(X1,X0) = multiply(X0,X1),
inference(superposition,[status(thm)],[d18,d6]) ).
cnf(d20,plain,
$false,
inference(resolution,[status(thm)],[d19,c4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP536-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.37 % Computer : n010.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Fri Sep 25 14:59:21 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.80/7.55 % SZS status Unsatisfiable for theBenchmark.p
% 8.80/7.55 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------