%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GRP600-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 : n008.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:24:08 AM UTC 2026
% Result : Unsatisfiable 30.59s 7.74s
% Output : CNFRefutation 30.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 3 RR)
% Number of literals : 30 ( 29 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
'double$udivide'('double$udivide'(X0,X1),inverse('double$udivide'(X0,inverse('double$udivide'(inverse(X2),X1))))) = X2 ).
cnf(multiply,axiom,
multiply(X0,X1) = inverse('double$udivide'(X1,X0)) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a) ).
cnf(c0,plain,
'double$udivide'('double$udivide'(X0,X1),inverse('double$udivide'(X0,inverse('double$udivide'(inverse(X2),X1))))) = X2,
inference(clausification,[status(esa)],[single_axiom]) ).
cnf(c1,plain,
multiply(X0,X1) = inverse('double$udivide'(X1,X0)),
inference(clausification,[status(esa)],[multiply]) ).
cnf(c2,plain,
multiply(a,b) != multiply(b,a),
inference(clausification,[status(esa)],[prove_these_axioms_4]) ).
cnf(d0,plain,
'double$udivide'('double$udivide'(X0,X2),multiply(inverse('double$udivide'(inverse(X1),X2)),X0)) = X1,
inference(demodulation,[status(thm)],[c0,c1]) ).
cnf(d1,plain,
'double$udivide'('double$udivide'(X2,X1),multiply(multiply(X1,inverse(X0)),X2)) = X0,
inference(demodulation,[status(thm)],[d0,c1]) ).
cnf(d2,plain,
'double$udivide'(X2,multiply(multiply(multiply(multiply(X1,inverse(X2)),X0),inverse(X3)),'double$udivide'(X0,X1))) = X3,
inference(superposition,[status(thm)],[d1,d1]) ).
cnf(d3,plain,
multiply(multiply(multiply(X1,inverse(X2)),X0),'double$udivide'(X0,X1)) = inverse(X2),
inference(superposition,[status(thm)],[d1,c1]) ).
cnf(d4,plain,
multiply(multiply(multiply(multiply(multiply(X1,inverse(X2)),X0),inverse(X3)),'double$udivide'(X0,X1)),X2) = inverse(X3),
inference(superposition,[status(thm)],[d1,d3]) ).
cnf(d5,plain,
'double$udivide'(X3,multiply(inverse(X3),'double$udivide'('double$udivide'(X2,X0),multiply(multiply(X0,inverse(inverse(X1))),X2)))) = X1,
inference(superposition,[status(thm)],[d4,d2]) ).
cnf(d6,plain,
'double$udivide'(X3,multiply(inverse(X3),inverse(X2))) = X2,
inference(demodulation,[status(thm)],[d5,d1]) ).
cnf(d7,plain,
multiply(multiply(inverse(X0),inverse(X1)),X0) = inverse(X1),
inference(superposition,[status(thm)],[d6,c1]) ).
cnf(d8,plain,
'double$udivide'('double$udivide'(X0,inverse(X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[d7,d1]) ).
cnf(d9,plain,
'double$udivide'('double$udivide'(X2,inverse(X2)),multiply(X1,X0)) = 'double$udivide'(X0,X1),
inference(superposition,[status(thm)],[c1,d8]) ).
cnf(d10,plain,
X1 = 'double$udivide'(X0,multiply(inverse(X0),inverse(X1))),
inference(superposition,[status(thm)],[d1,d9]) ).
cnf(d11,plain,
multiply(multiply(multiply(X2,multiply(X1,X0)),X3),'double$udivide'(X3,X2)) = inverse('double$udivide'(X0,X1)),
inference(superposition,[status(thm)],[c1,d3]) ).
cnf(d12,plain,
multiply(multiply(multiply(X2,multiply(X1,X0)),X3),'double$udivide'(X3,X2)) = multiply(X1,X0),
inference(demodulation,[status(thm)],[d11,c1]) ).
cnf(d13,plain,
multiply(inverse(X1),'double$udivide'('double$udivide'(multiply(X2,X3),X0),multiply(X0,inverse(X1)))) = multiply(X2,X3),
inference(superposition,[status(thm)],[d3,d12]) ).
cnf(d14,plain,
'double$udivide'('double$udivide'('double$udivide'(inverse(X3),X0),multiply(X0,multiply(X1,X2))),multiply(X1,X2)) = X3,
inference(superposition,[status(thm)],[d12,d1]) ).
cnf(d15,plain,
'double$udivide'('double$udivide'(multiply(X1,X2),inverse(inverse(X0))),multiply(X1,X2)) = X0,
inference(superposition,[status(thm)],[d9,d14]) ).
cnf(d16,plain,
multiply(inverse(X1),X0) = multiply(inverse(inverse(X0)),inverse(X1)),
inference(superposition,[status(thm)],[d15,d13]) ).
cnf(d17,plain,
'double$udivide'(inverse(X0),multiply(inverse(X1),X0)) = X1,
inference(superposition,[status(thm)],[d16,d6]) ).
cnf(d18,plain,
X0 = inverse(inverse(X0)),
inference(superposition,[status(thm)],[d17,d10]) ).
cnf(d19,plain,
multiply(inverse(X1),X0) = multiply(X0,inverse(X1)),
inference(demodulation,[status(thm)],[d16,d18]) ).
cnf(d20,plain,
inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[d17,d6]) ).
cnf(d21,plain,
multiply(X0,X1) = multiply(X1,inverse(inverse(X0))),
inference(superposition,[status(thm)],[d20,d19]) ).
cnf(d22,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(demodulation,[status(thm)],[d21,d18]) ).
cnf(d23,plain,
$false,
inference(resolution,[status(thm)],[d22,c2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP600-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 15:02:09 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.59/7.74 % SZS status Unsatisfiable for theBenchmark.p
% 30.59/7.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------