%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GRP403-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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:42 AM UTC 2026
% Result : Unsatisfiable 1.40s 13.11s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 3 RR)
% Number of literals : 17 ( 16 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),inverse(multiply(X1,multiply(inverse(X1),X1)))))) = X2 ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ).
cnf(c0,plain,
multiply(X0,inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),inverse(multiply(X1,multiply(inverse(X1),X1)))))) = X2,
inference(clausification,[status(esa)],[single_axiom]) ).
cnf(c1,plain,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(clausification,[status(esa)],[prove_these_axioms_1]) ).
cnf(d0,plain,
multiply(X0,inverse(multiply(inverse(X3),inverse(multiply(X1,multiply(inverse(X1),X1)))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),X3)),inverse(multiply(X2,multiply(inverse(X2),X2))))),
inference(superposition,[status(thm)],[c0,c0]) ).
cnf(d1,plain,
multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(multiply(inverse(X3),inverse(multiply(X1,multiply(inverse(X1),X1))))))) = X3,
inference(superposition,[status(thm)],[d0,c0]) ).
cnf(d2,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X0,X1)),X3)),multiply(inverse(multiply(X0,X1)),X2))),inverse(multiply(X3,multiply(inverse(X3),X3))))) = X2,
inference(superposition,[status(thm)],[d0,c0]) ).
cnf(d3,plain,
multiply(inverse(multiply(X4,X2)),multiply(X4,X3)) = multiply(inverse(multiply(inverse(multiply(X0,X1)),X2)),multiply(inverse(multiply(X0,X1)),X3)),
inference(superposition,[status(thm)],[d2,d1]) ).
cnf(d4,plain,
multiply(inverse(multiply(X5,X2)),multiply(X5,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(superposition,[status(thm)],[d3,d3]) ).
cnf(d5,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,X3))),inverse(multiply(X2,multiply(inverse(X2),X2))))) = X3,
inference(superposition,[status(thm)],[d3,d2]) ).
cnf(d6,plain,
multiply(X2,multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,X2))),X3)) = multiply(inverse(multiply(X4,inverse(multiply(X1,multiply(inverse(X1),X1))))),multiply(X4,X3)),
inference(superposition,[status(thm)],[d5,d4]) ).
cnf(d7,plain,
multiply(X5,multiply(inverse(multiply(inverse(multiply(X6,X1)),multiply(X6,X5))),X2)) = multiply(X3,multiply(inverse(multiply(inverse(multiply(X4,X1)),multiply(X4,X3))),X2)),
inference(superposition,[status(thm)],[d6,d6]) ).
cnf(d8,plain,
multiply(inverse(multiply(X0,X1)),inverse(multiply(X2,inverse(multiply(multiply(X0,X2),multiply(inverse(multiply(X0,X2)),multiply(X0,X2))))))) = inverse(multiply(X1,multiply(inverse(X1),X1))),
inference(superposition,[status(thm)],[d5,c0]) ).
cnf(d9,plain,
multiply(inverse(multiply(inverse(multiply(X0,X1)),multiply(X0,inverse(X2)))),inverse(multiply(X1,multiply(inverse(X1),X1)))) = X2,
inference(superposition,[status(thm)],[d8,d1]) ).
cnf(d10,plain,
multiply(inverse(X2),X2) = multiply(X3,multiply(inverse(multiply(inverse(multiply(X4,X1)),multiply(X4,X3))),inverse(multiply(X1,multiply(inverse(X1),X1))))),
inference(superposition,[status(thm)],[d9,d7]) ).
cnf(d11,plain,
multiply(inverse(X4),X4) = multiply(inverse(X3),X3),
inference(superposition,[status(thm)],[d10,d10]) ).
cnf(d12,plain,
$false,
inference(resolution,[status(thm)],[d11,c1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP403-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.38 % Computer : n005.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Fri Sep 25 14:52:08 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.40/13.11 % SZS status Unsatisfiable for theBenchmark.p
% 1.40/13.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------