%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GRP466-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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:49 AM UTC 2026
% Result : Unsatisfiable 12.07s 2.09s
% Output : CNFRefutation 12.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 4 RR)
% Number of literals : 12 ( 11 equ; 3 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X0,X0),divide(X1,divide(divide(X2,divide(X3,X1)),inverse(X3)))) = X2 ).
cnf(multiply,axiom,
multiply(X0,X1) = divide(X0,inverse(X1)) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ).
cnf(c0,plain,
divide(divide(X0,X0),divide(X1,divide(divide(X2,divide(X3,X1)),inverse(X3)))) = X2,
inference(clausification,[status(esa)],[single_axiom]) ).
cnf(c1,plain,
multiply(X0,X1) = divide(X0,inverse(X1)),
inference(clausification,[status(esa)],[multiply]) ).
cnf(c2,plain,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(clausification,[status(esa)],[prove_these_axioms_1]) ).
cnf(d0,plain,
divide(divide(X3,X3),divide(X2,multiply(divide(X0,divide(X1,X2)),X1))) = X0,
inference(demodulation,[status(thm)],[c0,c1]) ).
cnf(d1,plain,
divide(divide(X4,X4),divide(multiply(divide(X2,divide(X3,X1)),X3),multiply(X2,X1))) = divide(X0,X0),
inference(superposition,[status(thm)],[d0,d0]) ).
cnf(d2,plain,
divide(X4,X4) = divide(X5,X5),
inference(superposition,[status(thm)],[d1,d1]) ).
cnf(d3,plain,
multiply(inverse(X0),X0) = divide(X1,X1),
inference(superposition,[status(thm)],[d2,c1]) ).
cnf(d4,plain,
multiply(inverse(a1),a1) != divide(X0,X0),
inference(superposition,[status(thm)],[d3,c2]) ).
cnf(d5,plain,
$false,
inference(resolution,[status(thm)],[d3,d4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP466-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n015.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 14:58:27 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.07/2.09 % SZS status Unsatisfiable for theBenchmark.p
% 12.07/2.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------