%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL107-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:46 AM UTC 2026
% Result : Unsatisfiable 32.23s 4.65s
% Output : CNFRefutation 32.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 8 RR)
% Number of literals : 22 ( 0 equ; 9 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0)
| ~ 'is$ua$utheorem'(equivalent(X0,X1)) ) ).
cnf(lg_27_1690,axiom,
'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))),equivalent(X2,equivalent(equivalent(X1,X0),X6)))) ).
cnf(prove_p_1,negated_conjecture,
~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))) ).
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(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))),equivalent(X2,equivalent(equivalent(X1,X0),X6)))),
inference(clausification,[status(esa)],[lg_27_1690]) ).
cnf(c2,plain,
~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(clausification,[status(esa)],[prove_p_1]) ).
cnf(d0,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X5),equivalent(equivalent(equivalent(X6,X5),equivalent(X6,X4)),X7))),equivalent(X3,equivalent(equivalent(X2,X1),X7))),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[c1,c0]) ).
cnf(d1,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X2,X1),equivalent(X2,X0)),X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X4),equivalent(X6,X5))),X3))),
inference(resolution,[status(thm)],[d0,c1]) ).
cnf(d2,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X2),equivalent(X3,X1)),X4)),equivalent(equivalent(equivalent(X5,X6),equivalent(equivalent(X7,X5),equivalent(X7,X6))),X4)),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d1,c0]) ).
cnf(d3,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)),equivalent(equivalent(X1,X2),X7))),
inference(resolution,[status(thm)],[d2,c1]) ).
cnf(d4,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)),equivalent(equivalent(X5,X6),X7))),
inference(resolution,[status(thm)],[d3,d0]) ).
cnf(d5,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3))),
inference(resolution,[status(thm)],[d4,d0]) ).
cnf(d6,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d5,c0]) ).
cnf(d7,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
inference(resolution,[status(thm)],[d6,d5]) ).
cnf(d8,plain,
$false,
inference(resolution,[status(thm)],[d7,c2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL107-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42 % Computer : n004.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Fri Sep 25 21:51:21 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 32.23/4.65 % SZS status Unsatisfiable for theBenchmark.p
% 32.23/4.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------