%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWV001-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 : n019.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:13 AM UTC 2026
% Result : Unsatisfiable 9.69s 1.62s
% Output : CNFRefutation 9.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 9 unt; 6 nHn; 25 RR)
% Number of literals : 64 ( 0 equ; 37 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_1,axiom,
( q2(X0,X1,X2)
| ~ 'less$uor$uequalish'(X0,X1)
| ~ q1(X0,X1,X2) ) ).
cnf(clause_2,axiom,
( q3(X0,X1,X2)
| 'less$uor$uequalish'(X0,X1)
| ~ q1(X0,X1,X2) ) ).
cnf(clause_3,axiom,
( q4(X0,X1,X1)
| ~ q2(X0,X1,X2) ) ).
cnf(clause_4,axiom,
( q4(X0,X1,X0)
| ~ q3(X0,X1,X2) ) ).
cnf(less_or_equal_reflexivity,axiom,
'less$uor$uequalish'(X0,X0) ).
cnf(all_less_or_equal,axiom,
( 'less$uor$uequalish'(X1,X0)
| 'less$uor$uequalish'(X0,X1) ) ).
cnf(clause_5,negated_conjecture,
q1(a,b,c) ).
cnf(clause_6,negated_conjecture,
( ~ 'less$uor$uequalish'(X0,a)
| ~ 'less$uor$uequalish'(b,X0)
| ~ 'less$uor$uequalish'(a,X0)
| ~ q4(a,b,X0) ) ).
cnf(clause_7,negated_conjecture,
( ~ 'less$uor$uequalish'(X0,b)
| ~ 'less$uor$uequalish'(b,X0)
| ~ 'less$uor$uequalish'(a,X0)
| ~ q4(a,b,X0) ) ).
cnf(c2,plain,
( q2(X0,X1,X2)
| ~ 'less$uor$uequalish'(X0,X1)
| ~ q1(X0,X1,X2) ),
inference(clausification,[status(esa)],[clause_1]) ).
cnf(c3,plain,
( q3(X0,X1,X2)
| 'less$uor$uequalish'(X0,X1)
| ~ q1(X0,X1,X2) ),
inference(clausification,[status(esa)],[clause_2]) ).
cnf(c4,plain,
( q4(X0,X1,X1)
| ~ q2(X0,X1,X2) ),
inference(clausification,[status(esa)],[clause_3]) ).
cnf(c5,plain,
( q4(X0,X1,X0)
| ~ q3(X0,X1,X2) ),
inference(clausification,[status(esa)],[clause_4]) ).
cnf(c6,plain,
'less$uor$uequalish'(X0,X0),
inference(clausification,[status(esa)],[less_or_equal_reflexivity]) ).
cnf(c9,plain,
( 'less$uor$uequalish'(X1,X0)
| 'less$uor$uequalish'(X0,X1) ),
inference(clausification,[status(esa)],[all_less_or_equal]) ).
cnf(c11,plain,
q1(a,b,c),
inference(clausification,[status(esa)],[clause_5]) ).
cnf(c12,plain,
( ~ 'less$uor$uequalish'(X0,a)
| ~ 'less$uor$uequalish'(b,X0)
| ~ 'less$uor$uequalish'(a,X0)
| ~ q4(a,b,X0) ),
inference(clausification,[status(esa)],[clause_6]) ).
cnf(c13,plain,
( ~ 'less$uor$uequalish'(X0,b)
| ~ 'less$uor$uequalish'(b,X0)
| ~ 'less$uor$uequalish'(a,X0)
| ~ q4(a,b,X0) ),
inference(clausification,[status(esa)],[clause_7]) ).
cnf(d0,plain,
( q3(a,b,c)
| 'less$uor$uequalish'(a,b) ),
inference(resolution,[status(thm)],[c3,c11]) ).
cnf(d1,plain,
( q4(a,b,a)
| 'less$uor$uequalish'(a,b) ),
inference(resolution,[status(thm)],[d0,c5]) ).
cnf(d2,plain,
( q2(a,b,c)
| ~ 'less$uor$uequalish'(a,b) ),
inference(resolution,[status(thm)],[c2,c11]) ).
cnf(d3,plain,
( q4(a,b,b)
| ~ 'less$uor$uequalish'(a,b) ),
inference(resolution,[status(thm)],[d2,c4]) ).
cnf(d4,plain,
( ~ 'less$uor$uequalish'(b,b)
| ~ 'less$uor$uequalish'(a,b)
| ~ 'less$uor$uequalish'(b,b)
| ~ 'less$uor$uequalish'(a,b) ),
inference(resolution,[status(thm)],[d3,c13]) ).
cnf(d5,plain,
~ 'less$uor$uequalish'(a,b),
inference(resolution,[status(thm)],[c6,d4]) ).
cnf(d6,plain,
q4(a,b,a),
inference(resolution,[status(thm)],[d5,d1]) ).
cnf(d7,plain,
( ~ 'less$uor$uequalish'(b,a)
| ~ 'less$uor$uequalish'(a,a)
| ~ 'less$uor$uequalish'(a,a) ),
inference(resolution,[status(thm)],[d6,c12]) ).
cnf(d8,plain,
~ 'less$uor$uequalish'(b,a),
inference(resolution,[status(thm)],[c6,d7]) ).
cnf(d9,plain,
'less$uor$uequalish'(b,a),
inference(resolution,[status(thm)],[d5,c9]) ).
cnf(d10,plain,
$false,
inference(resolution,[status(thm)],[d9,d8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV001-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.10/0.35 % Computer : n019.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 13:04:49 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.69/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 9.69/1.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------