%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : FLD067-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/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 07:10:59 AM UTC 2026
% Result : Unsatisfiable 8.63s 7.45s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 11 unt; 0 nHn; 27 RR)
% Number of literals : 57 ( 0 equ; 37 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a_is_defined,hypothesis,
defined(a) ).
cnf(b_is_defined,hypothesis,
defined(b) ).
cnf(less_or_equal_3,negated_conjecture,
'less$uor$uequal'(a,b) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ 'less$uor$uequal'('additive$uidentity',add(b,'additive$uinverse'(a))) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X0)
| sum('additive$uinverse'(X0),X0,'additive$uidentity') ) ).
cnf(commutativity_addition,axiom,
( ~ sum(X1,X0,X2)
| sum(X0,X1,X2) ) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X0)
| defined('additive$uinverse'(X0)) ) ).
cnf(totality_of_addition,axiom,
( ~ defined(X1)
| ~ defined(X0)
| sum(X0,X1,add(X0,X1)) ) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ sum(X3,X4,X1)
| ~ sum(X2,X4,X0)
| ~ 'less$uor$uequal'(X2,X3)
| 'less$uor$uequal'(X0,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,
'less$uor$uequal'(a,b),
inference(clausification,[status(esa)],[less_or_equal_3]) ).
cnf(c3,plain,
~ 'less$uor$uequal'('additive$uidentity',add(b,'additive$uinverse'(a))),
inference(clausification,[status(esa)],[not_less_or_equal_4]) ).
cnf(c7,plain,
( ~ defined(X0)
| sum('additive$uinverse'(X0),X0,'additive$uidentity') ),
inference(clausification,[status(esa)],[existence_of_inverse_addition]) ).
cnf(c8,plain,
( ~ sum(X1,X0,X2)
| sum(X0,X1,X2) ),
inference(clausification,[status(esa)],[commutativity_addition]) ).
cnf(c18,plain,
( ~ defined(X0)
| defined('additive$uinverse'(X0)) ),
inference(clausification,[status(esa)],[well_definedness_of_additive_inverse]) ).
cnf(c22,plain,
( ~ defined(X1)
| ~ defined(X0)
| sum(X0,X1,add(X0,X1)) ),
inference(clausification,[status(esa)],[totality_of_addition]) ).
cnf(c27,plain,
( ~ sum(X3,X4,X1)
| ~ sum(X2,X4,X0)
| ~ 'less$uor$uequal'(X2,X3)
| 'less$uor$uequal'(X0,X1) ),
inference(clausification,[status(esa)],[compatibility_of_order_relation_and_addition]) ).
cnf(d0,plain,
( ~ defined(X0)
| sum(X0,'additive$uinverse'(X0),'additive$uidentity') ),
inference(resolution,[status(thm)],[c8,c7]) ).
cnf(d1,plain,
( ~ defined(X1)
| ~ sum(X2,'additive$uinverse'(X1),X0)
| ~ 'less$uor$uequal'(X1,X2)
| 'less$uor$uequal'('additive$uidentity',X0) ),
inference(resolution,[status(thm)],[c27,d0]) ).
cnf(d2,plain,
( ~ defined('additive$uinverse'(X0))
| ~ defined(X1)
| 'less$uor$uequal'('additive$uidentity',add(X1,'additive$uinverse'(X0)))
| ~ 'less$uor$uequal'(X0,X1)
| ~ defined(X0) ),
inference(resolution,[status(thm)],[d1,c22]) ).
cnf(d3,plain,
( ~ 'less$uor$uequal'(a,b)
| ~ defined('additive$uinverse'(a))
| ~ defined(a)
| ~ defined(b) ),
inference(resolution,[status(thm)],[d2,c3]) ).
cnf(d4,plain,
( ~ 'less$uor$uequal'(a,b)
| ~ defined('additive$uinverse'(a))
| ~ defined(b) ),
inference(resolution,[status(thm)],[c0,d3]) ).
cnf(d5,plain,
( ~ 'less$uor$uequal'(a,b)
| ~ defined('additive$uinverse'(a)) ),
inference(resolution,[status(thm)],[c1,d4]) ).
cnf(d6,plain,
~ defined('additive$uinverse'(a)),
inference(resolution,[status(thm)],[c2,d5]) ).
cnf(d7,plain,
~ defined(a),
inference(resolution,[status(thm)],[d6,c18]) ).
cnf(d8,plain,
$false,
inference(resolution,[status(thm)],[c0,d7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD067-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.38 % Computer : n003.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Sun Sep 27 02:36:01 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.63/7.45 % SZS status Unsatisfiable for theBenchmark.p
% 8.63/7.45 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------