%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL108-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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 10.84s 3.55s
% Output : CNFRefutation 10.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 26 ( 18 unt; 0 nHn; 10 RR)
% Number of literals : 36 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 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 : 130 ( 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_q_3,negated_conjecture,
~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(a,b),equivalent(equivalent(b,a),c)),c)) ).
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(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),equivalent(equivalent(b,a),c)),c)),
inference(clausification,[status(esa)],[prove_q_3]) ).
cnf(d0,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(X2,X1),X0),equivalent(equivalent(X4,X5),equivalent(equivalent(equivalent(X6,X5),equivalent(X6,X4)),X3))))
| 'is$ua$utheorem'(equivalent(X0,equivalent(equivalent(X1,X2),X3))) ),
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(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)],[d1,d0]) ).
cnf(d3,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(equivalent(X8,X5),equivalent(X8,X6)),X7))),
inference(resolution,[status(thm)],[d2,d0]) ).
cnf(d4,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(X5,X7))),equivalent(X4,equivalent(X6,X7))),equivalent(equivalent(equivalent(X8,X1),equivalent(X8,X2)),X3)))
| 'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3)) ),
inference(resolution,[status(thm)],[d3,c0]) ).
cnf(d5,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,X3)),equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3))),
inference(resolution,[status(thm)],[d4,d2]) ).
cnf(d6,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,equivalent(X1,X3))),equivalent(X2,X3))),
inference(resolution,[status(thm)],[d5,d4]) ).
cnf(d7,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(X2,equivalent(X3,X0)),equivalent(X2,equivalent(X3,X1))))
| 'is$ua$utheorem'(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[d6,c0]) ).
cnf(d8,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X0),X1),X1)),
inference(resolution,[status(thm)],[d7,d5]) ).
cnf(d9,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
inference(resolution,[status(thm)],[d8,d4]) ).
cnf(d10,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(X2,X0),equivalent(X2,X1)))
| 'is$ua$utheorem'(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[d9,c0]) ).
cnf(d11,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),equivalent(equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(X5,X7))),equivalent(X4,equivalent(X6,X7))),X2)))
| 'is$ua$utheorem'(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[status(thm)],[d2,c0]) ).
cnf(d12,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4)))),equivalent(X0,equivalent(X3,X4))),X5),X5)),
inference(resolution,[status(thm)],[d11,d2]) ).
cnf(d13,plain,
( ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,equivalent(X3,X5)))),equivalent(X1,equivalent(X4,X5))),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d12,c0]) ).
cnf(d14,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X3))),equivalent(X1,X3)),X4),X4)),
inference(resolution,[status(thm)],[d11,d3]) ).
cnf(d15,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(equivalent(X7,X6),equivalent(X7,X5)))),X3))),
inference(resolution,[status(thm)],[d14,d0]) ).
cnf(d16,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X4),equivalent(X6,X7)))),equivalent(X3,equivalent(X5,X7))),X8)),equivalent(equivalent(X1,X2),X8))),
inference(resolution,[status(thm)],[d15,d0]) ).
cnf(d17,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,equivalent(equivalent(X3,X1),X4))),equivalent(equivalent(equivalent(X5,X3),equivalent(X5,X2)),X4))),
inference(resolution,[status(thm)],[d16,d13]) ).
cnf(d18,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
inference(resolution,[status(thm)],[d17,d10]) ).
cnf(d19,plain,
$false,
inference(resolution,[status(thm)],[d18,c2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL108-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.43 % Computer : n011.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Fri Sep 25 21:51:28 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.84/3.55 % SZS status Unsatisfiable for theBenchmark.p
% 10.84/3.55 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------