%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL365-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n006.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:24 AM UTC 2026
% Result : Unsatisfiable 11.26s 1.93s
% Output : CNFRefutation 11.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 25 ( 12 unt; 0 nHn; 14 RR)
% Number of literals : 42 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0)
| ~ 'is$ua$utheorem'(implies(X0,X1)) ) ).
cnf(cn_1,axiom,
'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ).
cnf(cn_2,axiom,
'is$ua$utheorem'(implies(implies(not(X0),X0),X0)) ).
cnf(cn_3,axiom,
'is$ua$utheorem'(implies(X0,implies(not(X0),X1))) ).
cnf(prove_cn_14,negated_conjecture,
~ 'is$ua$utheorem'(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))) ).
cnf(c0,plain,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0)
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(clausification,[status(esa)],[condensed_detachment]) ).
cnf(c1,plain,
'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(clausification,[status(esa)],[cn_1]) ).
cnf(c2,plain,
'is$ua$utheorem'(implies(implies(not(X0),X0),X0)),
inference(clausification,[status(esa)],[cn_2]) ).
cnf(c3,plain,
'is$ua$utheorem'(implies(X0,implies(not(X0),X1))),
inference(clausification,[status(esa)],[cn_3]) ).
cnf(c4,plain,
~ 'is$ua$utheorem'(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(not(z),y),u))),
inference(clausification,[status(esa)],[prove_cn_14]) ).
cnf(d0,plain,
( ~ 'is$ua$utheorem'(X0)
| 'is$ua$utheorem'(implies(not(X0),X1)) ),
inference(resolution,[status(thm)],[c3,c0]) ).
cnf(d1,plain,
( ~ 'is$ua$utheorem'(implies(X2,X0))
| 'is$ua$utheorem'(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[status(thm)],[c1,c0]) ).
cnf(d2,plain,
( ~ 'is$ua$utheorem'(implies(X1,X2))
| 'is$ua$utheorem'(implies(X0,X2))
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d1,c0]) ).
cnf(d3,plain,
( 'is$ua$utheorem'(implies(X0,X2))
| ~ 'is$ua$utheorem'(implies(implies(not(X0),X1),X2)) ),
inference(resolution,[status(thm)],[d2,c3]) ).
cnf(d4,plain,
( ~ 'is$ua$utheorem'(implies(X0,X3))
| 'is$ua$utheorem'(implies(implies(X3,X1),X2))
| ~ 'is$ua$utheorem'(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[d2,d1]) ).
cnf(d5,plain,
( 'is$ua$utheorem'(implies(implies(X1,X0),X0))
| ~ 'is$ua$utheorem'(implies(not(X0),X1)) ),
inference(resolution,[status(thm)],[d4,c2]) ).
cnf(d6,plain,
( 'is$ua$utheorem'(implies(X1,X0))
| ~ 'is$ua$utheorem'(implies(not(X0),not(X1))) ),
inference(resolution,[status(thm)],[d5,d3]) ).
cnf(d7,plain,
( ~ 'is$ua$utheorem'(X1)
| 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d6,d0]) ).
cnf(d8,plain,
~ 'is$ua$utheorem'(implies(implies(not(z),y),implies(x,implies(implies(y,z),z)))),
inference(resolution,[status(thm)],[d1,c4]) ).
cnf(d9,plain,
( 'is$ua$utheorem'(implies(implies(X2,X0),X3))
| ~ 'is$ua$utheorem'(implies(implies(implies(X0,X1),implies(X2,X1)),X3)) ),
inference(resolution,[status(thm)],[d2,c1]) ).
cnf(d10,plain,
( ~ 'is$ua$utheorem'(implies(X2,implies(X1,X3)))
| 'is$ua$utheorem'(implies(implies(X0,X1),implies(X2,implies(X0,X3)))) ),
inference(resolution,[status(thm)],[d9,d1]) ).
cnf(d11,plain,
( 'is$ua$utheorem'(implies(implies(X1,X4),implies(X0,implies(implies(X4,X2),X3))))
| ~ 'is$ua$utheorem'(implies(X0,implies(implies(X1,X2),X3))) ),
inference(resolution,[status(thm)],[d10,d9]) ).
cnf(d12,plain,
~ 'is$ua$utheorem'(implies(x,implies(implies(not(z),z),z))),
inference(resolution,[status(thm)],[d11,d8]) ).
cnf(d13,plain,
~ 'is$ua$utheorem'(implies(implies(not(z),z),z)),
inference(resolution,[status(thm)],[d12,d7]) ).
cnf(d14,plain,
$false,
inference(resolution,[status(thm)],[c2,d13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL365-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n006.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 22:19:26 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.26/1.93 % SZS status Unsatisfiable for theBenchmark.p
% 11.26/1.93 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------