%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : BOO009-4 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n002.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 06:54:38 AM UTC 2026
% Result : Unsatisfiable 17.65s 2.66s
% Output : CNFRefutation 17.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 3 RR)
% Number of literals : 29 ( 28 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_operation,negated_conjecture,
multiply(a,add(a,b)) != a ).
cnf(commutativity_of_add,axiom,
add(X0,X1) = add(X1,X0) ).
cnf(commutativity_of_multiply,axiom,
multiply(X0,X1) = multiply(X1,X0) ).
cnf(distributivity1,axiom,
add(X0,multiply(X1,X2)) = multiply(add(X0,X1),add(X0,X2)) ).
cnf(distributivity2,axiom,
multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)) ).
cnf(additive_id1,axiom,
add(X0,'additive$uidentity') = X0 ).
cnf(multiplicative_inverse1,axiom,
multiply(X0,inverse(X0)) = 'additive$uidentity' ).
cnf(c0,plain,
multiply(a,add(a,b)) != a,
inference(clausification,[status(esa)],[prove_operation]) ).
cnf(c1,plain,
add(X0,X1) = add(X1,X0),
inference(clausification,[status(esa)],[commutativity_of_add]) ).
cnf(c2,plain,
multiply(X0,X1) = multiply(X1,X0),
inference(clausification,[status(esa)],[commutativity_of_multiply]) ).
cnf(c3,plain,
add(X0,multiply(X1,X2)) = multiply(add(X0,X1),add(X0,X2)),
inference(clausification,[status(esa)],[distributivity1]) ).
cnf(c4,plain,
multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
inference(clausification,[status(esa)],[distributivity2]) ).
cnf(c5,plain,
add(X0,'additive$uidentity') = X0,
inference(clausification,[status(esa)],[additive_id1]) ).
cnf(c8,plain,
multiply(X0,inverse(X0)) = 'additive$uidentity',
inference(clausification,[status(esa)],[multiplicative_inverse1]) ).
cnf(d0,plain,
multiply(X0,add(X1,inverse(X0))) = add(multiply(X0,X1),'additive$uidentity'),
inference(superposition,[status(thm)],[c8,c4]) ).
cnf(d1,plain,
multiply(X0,add(X1,inverse(X0))) = multiply(X0,X1),
inference(demodulation,[status(thm)],[d0,c5]) ).
cnf(d2,plain,
X0 = add('additive$uidentity',X0),
inference(superposition,[status(thm)],[c5,c1]) ).
cnf(d3,plain,
multiply(X0,inverse(X0)) = multiply(X0,'additive$uidentity'),
inference(superposition,[status(thm)],[d2,d1]) ).
cnf(d4,plain,
'additive$uidentity' = multiply(X0,'additive$uidentity'),
inference(demodulation,[status(thm)],[d3,c8]) ).
cnf(d5,plain,
add('additive$uidentity',X0) = X0,
inference(superposition,[status(thm)],[c1,c5]) ).
cnf(d6,plain,
add('additive$uidentity',multiply(X0,X1)) = multiply(X0,add('additive$uidentity',X1)),
inference(superposition,[status(thm)],[d5,c3]) ).
cnf(d7,plain,
multiply(X0,X1) = multiply(X0,add('additive$uidentity',X1)),
inference(demodulation,[status(thm)],[d6,d5]) ).
cnf(d8,plain,
multiply(X1,X0) = multiply(X1,X0),
inference(demodulation,[status(thm)],[d7,d5]) ).
cnf(d9,plain,
add(X0,multiply(X1,'additive$uidentity')) = multiply(add(X0,X1),X0),
inference(superposition,[status(thm)],[c5,c3]) ).
cnf(d10,plain,
add(X0,multiply(X1,'additive$uidentity')) = multiply(X0,add(X0,X1)),
inference(demodulation,[status(thm)],[d9,c2]) ).
cnf(d11,plain,
multiply(X0,add(X0,X1)) = add(X0,multiply(X1,'additive$uidentity')),
inference(superposition,[status(thm)],[d10,d8]) ).
cnf(d12,plain,
multiply(X1,add(X1,X0)) = add(X1,'additive$uidentity'),
inference(demodulation,[status(thm)],[d11,d4]) ).
cnf(d13,plain,
multiply(X0,add(X0,X1)) = X0,
inference(demodulation,[status(thm)],[d12,c5]) ).
cnf(d14,plain,
$false,
inference(resolution,[status(thm)],[d13,c0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO009-4 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 22:37:05 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.65/2.66 % SZS status Unsatisfiable for theBenchmark.p
% 17.65/2.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------