%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GRP445-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 : 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:46 AM UTC 2026
% Result : Unsatisfiable 6.58s 5.34s
% Output : CNFRefutation 6.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 equ; 3 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 : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X0,divide(divide(divide(divide(X0,X0),X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1 ).
cnf(multiply,axiom,
multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)) ).
cnf(inverse,axiom,
inverse(X0) = divide(divide(X1,X1),X0) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ).
cnf(c0,plain,
divide(X0,divide(divide(divide(divide(X0,X0),X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1,
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,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(clausification,[status(esa)],[prove_these_axioms_1]) ).
cnf(d0,plain,
multiply(X2,X1) = divide(X2,inverse(X1)),
inference(demodulation,[status(thm)],[c1,c2]) ).
cnf(d1,plain,
divide(X0,divide(divide(inverse(X1),X2),divide(divide(divide(X0,X0),X0),X2))) = X1,
inference(demodulation,[status(thm)],[c0,c2]) ).
cnf(d2,plain,
divide(X0,divide(divide(inverse(X1),X2),divide(inverse(X0),X2))) = X1,
inference(demodulation,[status(thm)],[d1,c2]) ).
cnf(d3,plain,
divide(X0,divide(divide(inverse(X3),divide(divide(inverse(X1),X2),divide(inverse(inverse(X0)),X2))),X1)) = X3,
inference(superposition,[status(thm)],[d2,d2]) ).
cnf(d4,plain,
divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[d2,d3]) ).
cnf(d5,plain,
inverse(divide(X1,X1)) = divide(X0,X0),
inference(superposition,[status(thm)],[d4,c2]) ).
cnf(d6,plain,
divide(X1,X1) = divide(X2,X2),
inference(superposition,[status(thm)],[d5,d5]) ).
cnf(d7,plain,
multiply(inverse(X0),X0) = divide(X1,X1),
inference(superposition,[status(thm)],[d6,d0]) ).
cnf(d8,plain,
multiply(inverse(a1),a1) != divide(X0,X0),
inference(superposition,[status(thm)],[d7,c3]) ).
cnf(d9,plain,
$false,
inference(resolution,[status(thm)],[d7,d8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP445-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.41 % Computer : n005.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Fri Sep 25 14:54:32 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.58/5.34 % SZS status Unsatisfiable for theBenchmark.p
% 6.58/5.34 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------