%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : BOO001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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:35 AM UTC 2026
% Result : Unsatisfiable 14.77s 3.39s
% Output : CNFRefutation 14.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 3 RR)
% Number of literals : 14 ( 13 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-3 aty)
% Number of variables : 30 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_inverse_is_self_cancelling,negated_conjecture,
inverse(inverse(a)) != a ).
cnf(associativity,axiom,
multiply(multiply(X0,X1,X2),X3,multiply(X0,X1,X4)) = multiply(X0,X1,multiply(X2,X3,X4)) ).
cnf(ternary_multiply_1,axiom,
multiply(X0,X1,X1) = X1 ).
cnf(right_inverse,axiom,
multiply(X0,X1,inverse(X1)) = X0 ).
cnf(c0,plain,
inverse(inverse(a)) != a,
inference(clausification,[status(esa)],[prove_inverse_is_self_cancelling]) ).
cnf(c1,plain,
multiply(multiply(X0,X1,X2),X3,multiply(X0,X1,X4)) = multiply(X0,X1,multiply(X2,X3,X4)),
inference(clausification,[status(esa)],[associativity]) ).
cnf(c2,plain,
multiply(X0,X1,X1) = X1,
inference(clausification,[status(esa)],[ternary_multiply_1]) ).
cnf(c5,plain,
multiply(X0,X1,inverse(X1)) = X0,
inference(clausification,[status(esa)],[right_inverse]) ).
cnf(d0,plain,
multiply(X1,X2,multiply(X0,X1,X3)) = multiply(X0,X1,multiply(X1,X2,X3)),
inference(superposition,[status(thm)],[c2,c1]) ).
cnf(d1,plain,
multiply(X0,X1,multiply(X2,X0,X1)) = multiply(X2,X0,X1),
inference(superposition,[status(thm)],[c2,d0]) ).
cnf(d2,plain,
multiply(X1,inverse(X1),X0) = multiply(X0,X1,inverse(X1)),
inference(superposition,[status(thm)],[c5,d1]) ).
cnf(d3,plain,
multiply(X1,inverse(X1),X0) = X0,
inference(demodulation,[status(thm)],[d2,c5]) ).
cnf(d4,plain,
inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[d3,c5]) ).
cnf(d5,plain,
$false,
inference(resolution,[status(thm)],[d4,c0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 26 22:36:29 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.77/3.39 % SZS status Unsatisfiable for theBenchmark.p
% 14.77/3.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------