%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GRP493-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 : n011.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:53 AM UTC 2026
% Result : Unsatisfiable 17.85s 2.92s
% Output : CNFRefutation 17.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 8 RR)
% Number of literals : 27 ( 26 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
'double$udivide'('double$udivide'(identity,X0),'double$udivide'('double$udivide'('double$udivide'(X1,X2),'double$udivide'(identity,identity)),'double$udivide'(X0,X2))) = X1 ).
cnf(multiply,axiom,
multiply(X0,X1) = 'double$udivide'('double$udivide'(X1,X0),identity) ).
cnf(inverse,axiom,
inverse(X0) = 'double$udivide'(X0,identity) ).
cnf(identity,axiom,
identity = 'double$udivide'(X0,inverse(X0)) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != identity ).
cnf(c0,plain,
'double$udivide'('double$udivide'(identity,X0),'double$udivide'('double$udivide'('double$udivide'(X1,X2),'double$udivide'(identity,identity)),'double$udivide'(X0,X2))) = X1,
inference(clausification,[status(esa)],[single_axiom]) ).
cnf(c1,plain,
multiply(X0,X1) = 'double$udivide'('double$udivide'(X1,X0),identity),
inference(clausification,[status(esa)],[multiply]) ).
cnf(c2,plain,
inverse(X0) = 'double$udivide'(X0,identity),
inference(clausification,[status(esa)],[inverse]) ).
cnf(c3,plain,
identity = 'double$udivide'(X0,inverse(X0)),
inference(clausification,[status(esa)],[identity]) ).
cnf(c4,plain,
multiply(inverse(a1),a1) != identity,
inference(clausification,[status(esa)],[prove_these_axioms_1]) ).
cnf(d0,plain,
'double$udivide'('double$udivide'(identity,X0),'double$udivide'('double$udivide'('double$udivide'(X1,X2),inverse(identity)),'double$udivide'(X0,X2))) = X1,
inference(demodulation,[status(thm)],[c0,c2]) ).
cnf(d1,plain,
'double$udivide'('double$udivide'(identity,X1),'double$udivide'('double$udivide'(identity,inverse(identity)),'double$udivide'(X1,inverse(X0)))) = X0,
inference(superposition,[status(thm)],[c3,d0]) ).
cnf(d2,plain,
'double$udivide'('double$udivide'(identity,X0),'double$udivide'(identity,'double$udivide'(X0,inverse(X1)))) = X1,
inference(demodulation,[status(thm)],[d1,c3]) ).
cnf(d3,plain,
'double$udivide'('double$udivide'(identity,X0),'double$udivide'(identity,identity)) = X0,
inference(superposition,[status(thm)],[c3,d2]) ).
cnf(d4,plain,
'double$udivide'('double$udivide'(identity,X0),inverse(identity)) = X0,
inference(demodulation,[status(thm)],[d3,c2]) ).
cnf(d5,plain,
'double$udivide'(identity,inverse(identity)) = inverse(identity),
inference(superposition,[status(thm)],[c3,d4]) ).
cnf(d6,plain,
identity = inverse(identity),
inference(demodulation,[status(thm)],[d5,c3]) ).
cnf(d7,plain,
multiply(X1,X0) = inverse('double$udivide'(X0,X1)),
inference(demodulation,[status(thm)],[c1,c2]) ).
cnf(d8,plain,
multiply(inverse(X0),X0) = inverse(identity),
inference(superposition,[status(thm)],[c3,d7]) ).
cnf(d9,plain,
inverse(identity) != identity,
inference(demodulation,[status(thm)],[c4,d8]) ).
cnf(d10,plain,
identity != identity,
inference(demodulation,[status(thm)],[d9,d6]) ).
cnf(d11,plain,
multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c2,d7]) ).
cnf(d12,plain,
identity = 'double$udivide'('double$udivide'(X0,X1),multiply(X1,X0)),
inference(superposition,[status(thm)],[d7,c3]) ).
cnf(d13,plain,
identity = 'double$udivide'(inverse(X0),multiply(identity,X0)),
inference(superposition,[status(thm)],[c2,d12]) ).
cnf(d14,plain,
identity = 'double$udivide'(inverse(X0),inverse(inverse(X0))),
inference(demodulation,[status(thm)],[d13,d11]) ).
cnf(d15,plain,
identity = identity,
inference(demodulation,[status(thm)],[d14,c3]) ).
cnf(d16,plain,
$false,
inference(resolution,[status(thm)],[d15,d10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP493-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.63 % Computer : n011.cluster.edu
% 0.17/0.63 % Model : x86_64 x86_64
% 0.17/0.63 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.63 % Memory : 8046.5625MB
% 0.17/0.63 % OS : Linux 6.8.0-71-generic
% 0.17/0.63 % CPULimit : 300
% 0.17/0.63 % WCLimit : 300
% 0.17/0.63 % DateTime : Fri Sep 25 14:56:45 UTC 2026
% 0.17/0.63 % CPUTime :
% 0.17/0.63 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.85/2.92 % SZS status Unsatisfiable for theBenchmark.p
% 17.85/2.92 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------