%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL257-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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:54:14 AM UTC 2026
% Result : Unsatisfiable 15.17s 3.88s
% Output : CNFRefutation 15.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 22 ( 10 unt; 0 nHn; 12 RR)
% Number of literals : 38 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0)
| ~ 'is$ua$utheorem'(equivalent(X0,X1)) ) ).
cnf(yql,axiom,
'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))) ).
cnf(prove_xhn,negated_conjecture,
~ 'is$ua$utheorem'(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))) ).
cnf(c0,plain,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0)
| ~ 'is$ua$utheorem'(equivalent(X0,X1)) ),
inference(clausification,[status(esa)],[condensed_detachment]) ).
cnf(c1,plain,
'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
inference(clausification,[status(esa)],[yql]) ).
cnf(c2,plain,
~ 'is$ua$utheorem'(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))),
inference(clausification,[status(esa)],[prove_xhn]) ).
cnf(d0,plain,
( ~ 'is$ua$utheorem'(equivalent(X2,X1))
| 'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(X2,X0))) ),
inference(resolution,[status(thm)],[c1,c0]) ).
cnf(d1,plain,
( ~ 'is$ua$utheorem'(equivalent(X2,X1))
| 'is$ua$utheorem'(equivalent(X0,X2))
| ~ 'is$ua$utheorem'(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[d0,c0]) ).
cnf(d2,plain,
( 'is$ua$utheorem'(equivalent(equivalent(X3,X2),X0))
| ~ 'is$ua$utheorem'(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1)))) ),
inference(resolution,[status(thm)],[d1,c1]) ).
cnf(d3,plain,
'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(resolution,[status(thm)],[d2,c1]) ).
cnf(d4,plain,
( 'is$ua$utheorem'(equivalent(equivalent(X1,X2),X0))
| ~ 'is$ua$utheorem'(equivalent(X0,equivalent(X1,X2))) ),
inference(resolution,[status(thm)],[d3,d1]) ).
cnf(d5,plain,
( ~ 'is$ua$utheorem'(equivalent(X0,X2))
| 'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(X1,X2))) ),
inference(resolution,[status(thm)],[d4,d0]) ).
cnf(d6,plain,
( ~ 'is$ua$utheorem'(equivalent(X0,X2))
| 'is$ua$utheorem'(equivalent(X2,X1))
| ~ 'is$ua$utheorem'(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[d5,c0]) ).
cnf(d7,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(X3,X2),X0))
| 'is$ua$utheorem'(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1)))) ),
inference(resolution,[status(thm)],[d6,c1]) ).
cnf(d8,plain,
~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(z,x),z),x)),
inference(resolution,[status(thm)],[d7,c2]) ).
cnf(d9,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X0)),equivalent(X2,X1))),
inference(resolution,[status(thm)],[d4,c1]) ).
cnf(d10,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(X2,X1),equivalent(X0,X2)))
| 'is$ua$utheorem'(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[d9,c0]) ).
cnf(d11,plain,
'is$ua$utheorem'(equivalent(X0,X0)),
inference(resolution,[status(thm)],[d10,d3]) ).
cnf(d12,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(X2,X1),X3))
| 'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),X3))) ),
inference(resolution,[status(thm)],[d2,d0]) ).
cnf(d13,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(X1,X2),X0))
| 'is$ua$utheorem'(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[status(thm)],[d10,d12]) ).
cnf(d14,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),X0),X1)),
inference(resolution,[status(thm)],[d13,d11]) ).
cnf(d15,plain,
$false,
inference(resolution,[status(thm)],[d14,d8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL257-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 % Computer : n014.cluster.edu
% 0.20/0.44 % Model : x86_64 x86_64
% 0.20/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.44 % Memory : 8046.5625MB
% 0.20/0.44 % OS : Linux 6.8.0-71-generic
% 0.20/0.44 % CPULimit : 300
% 0.20/0.44 % WCLimit : 300
% 0.20/0.44 % DateTime : Fri Sep 25 22:08:32 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.17/3.88 % SZS status Unsatisfiable for theBenchmark.p
% 15.17/3.88 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------