%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL366-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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 1.53s 8.18s
% Output : CNFRefutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 24 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 42 ( 0 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 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_15,negated_conjecture,
~ 'is$ua$utheorem'(implies(implies(not(x),y),implies(implies(y,x),x))) ).
cnf(c0,plain,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(implies(X0,X1))
| ~ 'is$ua$utheorem'(X0) ),
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(not(x),y),implies(implies(y,x),x))),
inference(clausification,[status(esa)],[prove_cn_15]) ).
cnf(d0,plain,
( ~ 'is$ua$utheorem'(implies(X2,X0))
| 'is$ua$utheorem'(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[status(thm)],[c1,c0]) ).
cnf(d1,plain,
( ~ 'is$ua$utheorem'(implies(X1,X2))
| 'is$ua$utheorem'(implies(X0,X2))
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d0,c0]) ).
cnf(d2,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)],[d1,c1]) ).
cnf(d3,plain,
( ~ 'is$ua$utheorem'(X0)
| 'is$ua$utheorem'(implies(not(X0),X1)) ),
inference(resolution,[status(thm)],[c3,c0]) ).
cnf(d4,plain,
( 'is$ua$utheorem'(implies(X0,X2))
| ~ 'is$ua$utheorem'(implies(implies(not(X0),X1),X2)) ),
inference(resolution,[status(thm)],[d1,c3]) ).
cnf(d5,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)],[d1,d0]) ).
cnf(d6,plain,
( 'is$ua$utheorem'(implies(implies(X1,X0),X0))
| ~ 'is$ua$utheorem'(implies(not(X0),X1)) ),
inference(resolution,[status(thm)],[d5,c2]) ).
cnf(d7,plain,
( 'is$ua$utheorem'(implies(X1,X0))
| ~ 'is$ua$utheorem'(implies(not(X0),not(X1))) ),
inference(resolution,[status(thm)],[d6,d4]) ).
cnf(d8,plain,
( ~ 'is$ua$utheorem'(X1)
| 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d7,d3]) ).
cnf(d9,plain,
( 'is$ua$utheorem'(implies(implies(X0,X2),implies(X0,X1)))
| ~ 'is$ua$utheorem'(implies(not(implies(X0,X1)),implies(X2,X1))) ),
inference(resolution,[status(thm)],[d6,d2]) ).
cnf(d10,plain,
( ~ 'is$ua$utheorem'(implies(X1,X2))
| 'is$ua$utheorem'(implies(implies(X0,X1),implies(X0,X2))) ),
inference(resolution,[status(thm)],[d9,d8]) ).
cnf(d11,plain,
( 'is$ua$utheorem'(implies(implies(X0,X3),implies(implies(X3,X1),X2)))
| ~ 'is$ua$utheorem'(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[d10,d2]) ).
cnf(d12,plain,
~ 'is$ua$utheorem'(implies(implies(not(x),x),x)),
inference(resolution,[status(thm)],[d11,c4]) ).
cnf(d13,plain,
$false,
inference(resolution,[status(thm)],[c2,d12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL366-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 22:22:58 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.53/8.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.53/8.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------