%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : BOO005-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:37 AM UTC 2026
% Result : Unsatisfiable 16.07s 2.47s
% Output : CNFRefutation 16.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 19 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 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 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_a_plus_1_is_a,negated_conjecture,
add(a,'multiplicative$uidentity') != 'multiplicative$uidentity' ).
cnf(commutativity_of_add,axiom,
add(X0,X1) = add(X1,X0) ).
cnf(commutativity_of_multiply,axiom,
multiply(X0,X1) = multiply(X1,X0) ).
cnf(distributivity2,axiom,
add(X0,multiply(X1,X2)) = multiply(add(X0,X1),add(X0,X2)) ).
cnf(additive_inverse1,axiom,
add(X0,inverse(X0)) = 'multiplicative$uidentity' ).
cnf(multiplicative_id2,axiom,
multiply('multiplicative$uidentity',X0) = X0 ).
cnf(c0,plain,
add(a,'multiplicative$uidentity') != 'multiplicative$uidentity',
inference(clausification,[status(esa)],[prove_a_plus_1_is_a]) ).
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(c4,plain,
add(X0,multiply(X1,X2)) = multiply(add(X0,X1),add(X0,X2)),
inference(clausification,[status(esa)],[distributivity2]) ).
cnf(c7,plain,
add(X0,inverse(X0)) = 'multiplicative$uidentity',
inference(clausification,[status(esa)],[additive_inverse1]) ).
cnf(c12,plain,
multiply('multiplicative$uidentity',X0) = X0,
inference(clausification,[status(esa)],[multiplicative_id2]) ).
cnf(d0,plain,
add('multiplicative$uidentity',a) != 'multiplicative$uidentity',
inference(demodulation,[status(thm)],[c0,c1]) ).
cnf(d1,plain,
add(X0,multiply(inverse(X0),X1)) = multiply('multiplicative$uidentity',add(X0,X1)),
inference(superposition,[status(thm)],[c7,c4]) ).
cnf(d2,plain,
add(X0,multiply(inverse(X0),X1)) = add(X0,X1),
inference(demodulation,[status(thm)],[d1,c12]) ).
cnf(d3,plain,
X0 = multiply(X0,'multiplicative$uidentity'),
inference(superposition,[status(thm)],[c12,c2]) ).
cnf(d4,plain,
add(X0,inverse(X0)) = add(X0,'multiplicative$uidentity'),
inference(superposition,[status(thm)],[d3,d2]) ).
cnf(d5,plain,
'multiplicative$uidentity' = add(X0,'multiplicative$uidentity'),
inference(demodulation,[status(thm)],[d4,c7]) ).
cnf(d6,plain,
add('multiplicative$uidentity',X0) = 'multiplicative$uidentity',
inference(superposition,[status(thm)],[d5,c1]) ).
cnf(d7,plain,
$false,
inference(resolution,[status(thm)],[d6,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO005-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n003.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 22:35:54 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.07/2.47 % SZS status Unsatisfiable for theBenchmark.p
% 16.07/2.47 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------