%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWV009-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 : n012.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 09:01:14 AM UTC 2026
% Result : Unsatisfiable 8.12s 6.76s
% Output : CNFRefutation 8.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 13 unt; 2 nHn; 27 RR)
% Number of literals : 64 ( 0 equ; 45 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
( less(X1,X0)
| 'less$uor$uequal'(X0,X1) ) ).
cnf(clause_3,negated_conjecture,
'less$uor$uequal'(m,p) ).
cnf(clause_4,negated_conjecture,
'less$uor$uequal'(p,q) ).
cnf(clause_5,negated_conjecture,
'less$uor$uequal'(q,n) ).
cnf(clause_6,negated_conjecture,
( 'less$uor$uequal'(a(X0),a(X1))
| ~ 'less$uor$uequal'(X1,n)
| ~ less(j,X1)
| ~ less(X0,i)
| ~ 'less$uor$uequal'(m,X0) ) ).
cnf(clause_7,negated_conjecture,
( 'less$uor$uequal'(a(X0),a(X1))
| ~ 'less$uor$uequal'(X1,j)
| ~ 'less$uor$uequal'(X0,X1)
| ~ 'less$uor$uequal'(m,X0) ) ).
cnf(clause_8,negated_conjecture,
( 'less$uor$uequal'(a(X0),a(X1))
| ~ 'less$uor$uequal'(X1,n)
| ~ 'less$uor$uequal'(X0,X1)
| ~ 'less$uor$uequal'(i,X0) ) ).
cnf(clause_9,negated_conjecture,
~ 'less$uor$uequal'(a(p),a(q)) ).
cnf(c0,plain,
( less(X1,X0)
| 'less$uor$uequal'(X0,X1) ),
inference(clausification,[status(esa)],[clause_1]) ).
cnf(c2,plain,
'less$uor$uequal'(m,p),
inference(clausification,[status(esa)],[clause_3]) ).
cnf(c3,plain,
'less$uor$uequal'(p,q),
inference(clausification,[status(esa)],[clause_4]) ).
cnf(c4,plain,
'less$uor$uequal'(q,n),
inference(clausification,[status(esa)],[clause_5]) ).
cnf(c5,plain,
( ~ 'less$uor$uequal'(m,X1)
| 'less$uor$uequal'(a(X1),a(X0))
| ~ less(X1,i)
| ~ less(j,X0)
| ~ 'less$uor$uequal'(X0,n) ),
inference(clausification,[status(esa)],[clause_6]) ).
cnf(c6,plain,
( 'less$uor$uequal'(a(X0),a(X1))
| ~ 'less$uor$uequal'(X1,j)
| ~ 'less$uor$uequal'(X0,X1)
| ~ 'less$uor$uequal'(m,X0) ),
inference(clausification,[status(esa)],[clause_7]) ).
cnf(c7,plain,
( 'less$uor$uequal'(a(X0),a(X1))
| ~ 'less$uor$uequal'(X1,n)
| ~ 'less$uor$uequal'(X0,X1)
| ~ 'less$uor$uequal'(i,X0) ),
inference(clausification,[status(esa)],[clause_8]) ).
cnf(c8,plain,
~ 'less$uor$uequal'(a(p),a(q)),
inference(clausification,[status(esa)],[clause_9]) ).
cnf(d0,plain,
( ~ 'less$uor$uequal'(m,p)
| ~ 'less$uor$uequal'(q,n)
| ~ less(j,q)
| ~ less(p,i) ),
inference(resolution,[status(thm)],[c8,c5]) ).
cnf(d1,plain,
( ~ 'less$uor$uequal'(q,n)
| ~ less(p,i)
| ~ less(j,q) ),
inference(resolution,[status(thm)],[c2,d0]) ).
cnf(d2,plain,
( ~ less(p,i)
| ~ less(j,q) ),
inference(resolution,[status(thm)],[c4,d1]) ).
cnf(d3,plain,
( 'less$uor$uequal'(i,p)
| ~ less(j,q) ),
inference(resolution,[status(thm)],[d2,c0]) ).
cnf(d4,plain,
( ~ 'less$uor$uequal'(i,p)
| ~ 'less$uor$uequal'(p,q)
| ~ 'less$uor$uequal'(q,n) ),
inference(resolution,[status(thm)],[c7,c8]) ).
cnf(d5,plain,
( ~ 'less$uor$uequal'(q,n)
| ~ 'less$uor$uequal'(i,p) ),
inference(resolution,[status(thm)],[c3,d4]) ).
cnf(d6,plain,
~ 'less$uor$uequal'(i,p),
inference(resolution,[status(thm)],[c4,d5]) ).
cnf(d7,plain,
~ less(j,q),
inference(resolution,[status(thm)],[d6,d3]) ).
cnf(d8,plain,
'less$uor$uequal'(q,j),
inference(resolution,[status(thm)],[d7,c0]) ).
cnf(d9,plain,
( ~ 'less$uor$uequal'(m,p)
| ~ 'less$uor$uequal'(p,q)
| ~ 'less$uor$uequal'(q,j) ),
inference(resolution,[status(thm)],[c6,c8]) ).
cnf(d10,plain,
( ~ 'less$uor$uequal'(q,j)
| ~ 'less$uor$uequal'(p,q) ),
inference(resolution,[status(thm)],[c2,d9]) ).
cnf(d11,plain,
~ 'less$uor$uequal'(q,j),
inference(resolution,[status(thm)],[c3,d10]) ).
cnf(d12,plain,
$false,
inference(resolution,[status(thm)],[d11,d8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/5.51 % Computer : n012.cluster.edu
% 0.03/5.51 % Model : x86_64 x86_64
% 0.03/5.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/5.51 % Memory : 8046.5625MB
% 0.03/5.51 % OS : Linux 6.8.0-71-generic
% 0.03/5.51 % CPULimit : 300
% 0.03/5.51 % WCLimit : 300
% 0.03/5.51 % DateTime : Sat Sep 26 13:05:27 UTC 2026
% 0.03/5.52 % CPUTime :
% 0.03/5.52 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.12/6.76 % SZS status Unsatisfiable for theBenchmark.p
% 8.12/6.76 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------