%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUM228-1 : 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 : 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 08:10:54 AM UTC 2026
% Result : Unsatisfiable 14.63s 2.84s
% Output : CNFRefutation 14.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 6 unt; 3 nHn; 8 RR)
% Number of literals : 16 ( 6 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 7 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_corollary_1,negated_conjecture,
~ function(z) ).
cnf(prove_corollary_2,negated_conjecture,
'recursion$uequation$ufunctions'(z) != 'null$uclass' ).
cnf(regularity1,axiom,
( member(regular(X0),X0)
| X0 = 'null$uclass' ) ).
cnf(recursion_equation_functions1,axiom,
( function(X1)
| ~ member(X0,'recursion$uequation$ufunctions'(X1)) ) ).
cnf(c0,plain,
~ function(z),
inference(clausification,[status(esa)],[prove_corollary_1]) ).
cnf(c1,plain,
'recursion$uequation$ufunctions'(z) != 'null$uclass',
inference(clausification,[status(esa)],[prove_corollary_2]) ).
cnf(c67,plain,
( member(regular(X0),X0)
| X0 = 'null$uclass' ),
inference(clausification,[status(esa)],[regularity1]) ).
cnf(c148,plain,
( function(X1)
| ~ member(X0,'recursion$uequation$ufunctions'(X1)) ),
inference(clausification,[status(esa)],[recursion_equation_functions1]) ).
cnf(d0,plain,
( function(X0)
| 'recursion$uequation$ufunctions'(X0) = 'null$uclass' ),
inference(resolution,[status(thm)],[c67,c148]) ).
cnf(d1,plain,
'recursion$uequation$ufunctions'(z) = 'null$uclass',
inference(resolution,[status(thm)],[d0,c0]) ).
cnf(d2,plain,
$false,
inference(resolution,[status(thm)],[c1,d1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM228-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 02:14:48 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.63/2.84 % SZS status Unsatisfiable for theBenchmark.p
% 14.63/2.84 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------