%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : FLD005-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/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:10:42 AM UTC 2026
% Result : Unsatisfiable 2.33s 11.71s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 9 unt; 0 nHn; 29 RR)
% Number of literals : 71 ( 0 equ; 50 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a_is_defined,hypothesis,
defined(a) ).
cnf(b_is_defined,hypothesis,
defined(b) ).
cnf(add_not_equal_to_b_3,negated_conjecture,
~ equalish(add(a,X0),b) ).
cnf(associativity_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| ~ defined(X0)
| equalish(add(X0,add(X1,X2)),add(add(X0,X1),X2)) ) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X0)
| equalish(add('additive$uidentity',X0),X0) ) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X0)
| equalish(add(X0,'additive$uinverse'(X0)),'additive$uidentity') ) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X0)
| defined('additive$uinverse'(X0)) ) ).
cnf(transitivity_of_equality,axiom,
( ~ equalish(X2,X1)
| ~ equalish(X0,X2)
| equalish(X0,X1) ) ).
cnf(compatibility_of_equality_and_addition,axiom,
( ~ equalish(X0,X2)
| ~ defined(X1)
| equalish(add(X0,X1),add(X2,X1)) ) ).
cnf(c0,plain,
defined(a),
inference(clausification,[status(esa)],[a_is_defined]) ).
cnf(c1,plain,
defined(b),
inference(clausification,[status(esa)],[b_is_defined]) ).
cnf(c2,plain,
~ equalish(add(a,X0),b),
inference(clausification,[status(esa)],[add_not_equal_to_b_3]) ).
cnf(c3,plain,
( ~ defined(X2)
| ~ defined(X1)
| ~ defined(X0)
| equalish(add(X0,add(X1,X2)),add(add(X0,X1),X2)) ),
inference(clausification,[status(esa)],[associativity_addition]) ).
cnf(c4,plain,
( ~ defined(X0)
| equalish(add('additive$uidentity',X0),X0) ),
inference(clausification,[status(esa)],[existence_of_identity_addition]) ).
cnf(c5,plain,
( ~ defined(X0)
| equalish(add(X0,'additive$uinverse'(X0)),'additive$uidentity') ),
inference(clausification,[status(esa)],[existence_of_inverse_addition]) ).
cnf(c14,plain,
( ~ defined(X0)
| defined('additive$uinverse'(X0)) ),
inference(clausification,[status(esa)],[well_definedness_of_additive_inverse]) ).
cnf(c25,plain,
( ~ equalish(X2,X1)
| ~ equalish(X0,X2)
| equalish(X0,X1) ),
inference(clausification,[status(esa)],[transitivity_of_equality]) ).
cnf(c26,plain,
( ~ equalish(X0,X2)
| ~ defined(X1)
| equalish(add(X0,X1),add(X2,X1)) ),
inference(clausification,[status(esa)],[compatibility_of_equality_and_addition]) ).
cnf(d0,plain,
( ~ defined(X1)
| ~ equalish(X0,add('additive$uidentity',X1))
| equalish(X0,X1) ),
inference(resolution,[status(thm)],[c25,c4]) ).
cnf(d1,plain,
( ~ equalish(X3,add(X1,X0))
| equalish(X3,add(X2,X0))
| ~ equalish(X1,X2)
| ~ defined(X0) ),
inference(resolution,[status(thm)],[c26,c25]) ).
cnf(d2,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X0)
| ~ equalish(add(X1,X2),X3)
| equalish(add(X1,add(X2,X0)),add(X3,X0))
| ~ defined(X0) ),
inference(resolution,[status(thm)],[d1,c3]) ).
cnf(d3,plain,
( equalish(add(X1,add(X0,X2)),X2)
| ~ defined(X2)
| ~ equalish(add(X1,X0),'additive$uidentity')
| ~ defined(X2)
| ~ defined(X1)
| ~ defined(X0) ),
inference(resolution,[status(thm)],[d2,d0]) ).
cnf(d4,plain,
( ~ equalish(add(a,X0),'additive$uidentity')
| ~ defined(X0)
| ~ defined(a)
| ~ defined(b) ),
inference(resolution,[status(thm)],[d3,c2]) ).
cnf(d5,plain,
( ~ equalish(add(a,X0),'additive$uidentity')
| ~ defined(b)
| ~ defined(X0) ),
inference(resolution,[status(thm)],[c0,d4]) ).
cnf(d6,plain,
( ~ equalish(add(a,X0),'additive$uidentity')
| ~ defined(X0) ),
inference(resolution,[status(thm)],[c1,d5]) ).
cnf(d7,plain,
( ~ defined(a)
| ~ defined('additive$uinverse'(a)) ),
inference(resolution,[status(thm)],[d6,c5]) ).
cnf(d8,plain,
~ defined('additive$uinverse'(a)),
inference(resolution,[status(thm)],[c0,d7]) ).
cnf(d9,plain,
~ defined(a),
inference(resolution,[status(thm)],[d8,c14]) ).
cnf(d10,plain,
$false,
inference(resolution,[status(thm)],[c0,d9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD005-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n005.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sun Sep 27 02:20:31 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.44 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.33/11.71 % SZS status Unsatisfiable for theBenchmark.p
% 2.33/11.71 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------