%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL007-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 : 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:53:32 AM UTC 2026
% Result : Unsatisfiable 10.62s 12.84s
% Output : CNFRefutation 10.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 6 RR)
% Number of literals : 16 ( 0 equ; 7 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; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0)
| ~ 'is$ua$utheorem'(equivalent(X0,X1)) ) ).
cnf(ec_4,axiom,
'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(X1,X0))) ).
cnf(ec_5,axiom,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X0,equivalent(X1,X2)))) ).
cnf(prove_ec_2,negated_conjecture,
~ 'is$ua$utheorem'(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),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(X0,X1),equivalent(X1,X0))),
inference(clausification,[status(esa)],[ec_4]) ).
cnf(c2,plain,
'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X0,equivalent(X1,X2)))),
inference(clausification,[status(esa)],[ec_5]) ).
cnf(c3,plain,
~ 'is$ua$utheorem'(equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(a,b),c))),
inference(clausification,[status(esa)],[prove_ec_2]) ).
cnf(d0,plain,
( ~ 'is$ua$utheorem'(equivalent(X1,X0))
| 'is$ua$utheorem'(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[c0,c1]) ).
cnf(d1,plain,
'is$ua$utheorem'(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X0,X1),X2))),
inference(resolution,[status(thm)],[c2,d0]) ).
cnf(d2,plain,
$false,
inference(resolution,[status(thm)],[d1,c3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/10.47 % Computer : n006.cluster.edu
% 0.19/10.47 % Model : x86_64 x86_64
% 0.19/10.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/10.47 % Memory : 8046.5625MB
% 0.19/10.47 % OS : Linux 6.8.0-71-generic
% 0.19/10.47 % CPULimit : 300
% 0.19/10.47 % WCLimit : 300
% 0.19/10.47 % DateTime : Fri Sep 25 21:43:08 UTC 2026
% 0.19/10.47 % CPUTime :
% 0.19/10.47 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.62/12.84 % SZS status Unsatisfiable for theBenchmark.p
% 10.62/12.84 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------