%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GRP517-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 : n016.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:56 AM UTC 2026
% Result : Unsatisfiable 20.66s 3.08s
% Output : CNFRefutation 20.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 3 RR)
% Number of literals : 12 ( 11 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 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 : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X0,multiply(multiply(inverse(multiply(X0,X1)),X2),X1)) = X2 ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ).
cnf(c0,plain,
multiply(X0,multiply(multiply(inverse(multiply(X0,X1)),X2),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,multiply(multiply(inverse(X2),X3),multiply(multiply(inverse(multiply(X0,X1)),X2),X1))) = X3,
inference(superposition,[status(thm)],[c0,c0]) ).
cnf(d1,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c0,d0]) ).
cnf(d2,plain,
multiply(X2,X0) = multiply(multiply(inverse(multiply(inverse(X0),X1)),X2),X1),
inference(superposition,[status(thm)],[c0,d1]) ).
cnf(d3,plain,
multiply(inverse(X0),multiply(X2,X0)) = X2,
inference(superposition,[status(thm)],[d2,c0]) ).
cnf(d4,plain,
multiply(multiply(inverse(X0),X1),multiply(multiply(inverse(X1),X2),X0)) = X2,
inference(superposition,[status(thm)],[d1,c0]) ).
cnf(d5,plain,
multiply(multiply(inverse(X0),X0),X1) = X1,
inference(superposition,[status(thm)],[d1,d4]) ).
cnf(d6,plain,
multiply(inverse(X1),X1) = multiply(inverse(X0),X0),
inference(superposition,[status(thm)],[d5,d3]) ).
cnf(d7,plain,
$false,
inference(resolution,[status(thm)],[d6,c1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP517-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.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 15:03:00 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.66/3.08 % SZS status Unsatisfiable for theBenchmark.p
% 20.66/3.08 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------