%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : GRP496-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:53 AM UTC 2026
% Result : Unsatisfiable 10.75s 7.87s
% Output : CNFRefutation 10.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 4 RR)
% Number of literals : 17 ( 16 equ; 2 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 : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
'double$udivide'('double$udivide'(identity,'double$udivide'(X0,'double$udivide'(X1,identity))),'double$udivide'('double$udivide'(X1,'double$udivide'(X2,X0)),identity)) = X2 ).
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,'double$udivide'(X0,'double$udivide'(X1,identity))),'double$udivide'('double$udivide'(X1,'double$udivide'(X2,X0)),identity)) = X2,
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,'double$udivide'(X1,inverse(X0))),'double$udivide'('double$udivide'(X0,'double$udivide'(X2,X1)),identity)) = X2,
inference(demodulation,[status(thm)],[c0,c2]) ).
cnf(d1,plain,
'double$udivide'('double$udivide'(identity,'double$udivide'(X2,inverse(X0))),inverse('double$udivide'(X0,'double$udivide'(X1,X2)))) = X1,
inference(demodulation,[status(thm)],[d0,c2]) ).
cnf(d2,plain,
identity = inverse(identity),
inference(superposition,[status(thm)],[c3,d1]) ).
cnf(d3,plain,
multiply(X1,X0) = inverse('double$udivide'(X0,X1)),
inference(demodulation,[status(thm)],[c1,c2]) ).
cnf(d4,plain,
multiply(inverse(X0),X0) = inverse(identity),
inference(superposition,[status(thm)],[c3,d3]) ).
cnf(d5,plain,
multiply(inverse(X0),X0) = identity,
inference(demodulation,[status(thm)],[d4,d2]) ).
cnf(d6,plain,
$false,
inference(resolution,[status(thm)],[d5,c4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP496-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/5.43 % Computer : n005.cluster.edu
% 0.15/5.43 % Model : x86_64 x86_64
% 0.15/5.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.43 % Memory : 8046.5625MB
% 0.15/5.43 % OS : Linux 6.8.0-71-generic
% 0.15/5.43 % CPULimit : 300
% 0.15/5.43 % WCLimit : 300
% 0.15/5.43 % DateTime : Fri Sep 25 14:57:23 UTC 2026
% 0.15/5.44 % CPUTime :
% 0.15/5.44 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.75/7.87 % SZS status Unsatisfiable for theBenchmark.p
% 10.75/7.87 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------