%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL118-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 : n004.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:53:49 AM UTC 2026
% Result : Unsatisfiable 39.87s 5.54s
% Output : CNFRefutation 39.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of clauses : 18 ( 12 unt; 0 nHn; 9 RR)
% Number of literals : 26 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 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 : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0)
| ~ 'is$ua$utheorem'(equivalent(X0,X1)) ) ).
cnf(wo,axiom,
'is$ua$utheorem'(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X1,X0)))) ).
cnf(prove_yqm,negated_conjecture,
~ 'is$ua$utheorem'(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))) ).
cnf(c0,plain,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(equivalent(X0,X1))
| ~ 'is$ua$utheorem'(X0) ),
inference(clausification,[status(esa)],[condensed_detachment]) ).
cnf(c1,plain,
'is$ua$utheorem'(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X1,X0)))),
inference(clausification,[status(esa)],[wo]) ).
cnf(c2,plain,
~ 'is$ua$utheorem'(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
inference(clausification,[status(esa)],[prove_yqm]) ).
cnf(d0,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,equivalent(X2,X1))),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[c1,c0]) ).
cnf(d1,plain,
'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(X1,equivalent(X0,X2))))),
inference(resolution,[status(thm)],[d0,c1]) ).
cnf(d2,plain,
'is$ua$utheorem'(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,equivalent(X2,X1)),X0)))),
inference(resolution,[status(thm)],[d1,d0]) ).
cnf(d3,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,equivalent(X1,X3)))),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d1,c0]) ).
cnf(d4,plain,
'is$ua$utheorem'(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,equivalent(X1,X0)),equivalent(equivalent(X3,X4),equivalent(X5,equivalent(X4,equivalent(X3,X5))))))),
inference(resolution,[status(thm)],[d3,d2]) ).
cnf(d5,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,equivalent(X2,X1)),equivalent(equivalent(X4,X5),equivalent(X6,equivalent(X5,equivalent(X4,X6)))))),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d4,c0]) ).
cnf(d6,plain,
'is$ua$utheorem'(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0)))),
inference(resolution,[status(thm)],[d3,d1]) ).
cnf(d7,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,equivalent(X4,X2))),equivalent(equivalent(X4,X3),X1))),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d6,c0]) ).
cnf(d8,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,equivalent(X1,equivalent(X0,X3))),X2))),
inference(resolution,[status(thm)],[d7,c1]) ).
cnf(d9,plain,
'is$ua$utheorem'(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X0))),equivalent(X2,equivalent(X1,X3)))),
inference(resolution,[status(thm)],[d8,d0]) ).
cnf(d10,plain,
'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X2,X0)))),
inference(resolution,[status(thm)],[d9,d5]) ).
cnf(d11,plain,
$false,
inference(resolution,[status(thm)],[d10,c2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL118-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.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 21:53:07 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 39.87/5.54 % SZS status Unsatisfiable for theBenchmark.p
% 39.87/5.54 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------