%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL236-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n012.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:10 AM UTC 2026
% Result : Unsatisfiable 2.90s 2.84s
% Output : CNFRefutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 36 ( 26 unt; 0 nHn; 16 RR)
% Number of literals : 48 ( 6 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X0,X0),X0)) ).
cnf(axiom_1_3,axiom,
axiom(implies(X0,or(X1,X0))) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X0,X1),or(X1,X0))) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ).
cnf(implies_definition,axiom,
implies(X0,X1) = or(not(X0),X1) ).
cnf(rule_1,axiom,
( ~ axiom(X0)
| theorem(X0) ) ).
cnf(rule_2,axiom,
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ) ).
cnf(and_defn,axiom,
and(X0,X1) = not(or(not(X0),not(X1))) ).
cnf(c0,plain,
~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
inference(clausification,[status(esa)],[prove_this]) ).
cnf(c1,plain,
axiom(implies(or(X0,X0),X0)),
inference(clausification,[status(esa)],[axiom_1_2]) ).
cnf(c2,plain,
axiom(implies(X0,or(X1,X0))),
inference(clausification,[status(esa)],[axiom_1_3]) ).
cnf(c3,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
inference(clausification,[status(esa)],[axiom_1_4]) ).
cnf(c4,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(clausification,[status(esa)],[axiom_1_5]) ).
cnf(c6,plain,
implies(X0,X1) = or(not(X0),X1),
inference(clausification,[status(esa)],[implies_definition]) ).
cnf(c7,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(clausification,[status(esa)],[rule_1]) ).
cnf(c8,plain,
( ~ theorem(X1)
| ~ theorem(implies(X1,X0))
| theorem(X0) ),
inference(clausification,[status(esa)],[rule_2]) ).
cnf(c9,plain,
and(X0,X1) = not(or(not(X0),not(X1))),
inference(clausification,[status(esa)],[and_defn]) ).
cnf(d0,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[c3,c7]) ).
cnf(d1,plain,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[d0,c8]) ).
cnf(d2,plain,
( theorem(or(X1,not(X0)))
| ~ theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c6,d1]) ).
cnf(d3,plain,
and(X0,X1) = not(implies(X0,not(X1))),
inference(demodulation,[status(thm)],[c9,c6]) ).
cnf(d4,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[d3,c6]) ).
cnf(d5,plain,
~ theorem(implies(implies(p,not(q)),not(and(p,q)))),
inference(demodulation,[status(thm)],[c0,c6]) ).
cnf(d6,plain,
~ theorem(or(and(p,q),not(and(p,q)))),
inference(demodulation,[status(thm)],[d5,d4]) ).
cnf(d7,plain,
~ theorem(implies(and(p,q),and(p,q))),
inference(resolution,[status(thm)],[d6,d2]) ).
cnf(d8,plain,
theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[c1,c7]) ).
cnf(d9,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[c8,d8]) ).
cnf(d10,plain,
theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c2,c7]) ).
cnf(d11,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[c4,c7]) ).
cnf(d12,plain,
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[d11,c8]) ).
cnf(d13,plain,
( theorem(or(X1,or(not(X0),X2)))
| ~ theorem(implies(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c6,d12]) ).
cnf(d14,plain,
( theorem(or(X2,implies(X0,X1)))
| ~ theorem(implies(X0,or(X2,X1))) ),
inference(demodulation,[status(thm)],[d13,c6]) ).
cnf(d15,plain,
theorem(or(X0,implies(X1,X1))),
inference(resolution,[status(thm)],[d14,d10]) ).
cnf(d16,plain,
theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[d15,d9]) ).
cnf(d17,plain,
$false,
inference(resolution,[status(thm)],[d16,d7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL236-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.32 % Computer : n012.cluster.edu
% 0.06/0.32 % Model : x86_64 x86_64
% 0.06/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.32 % Memory : 8046.5625MB
% 0.06/0.32 % OS : Linux 6.8.0-71-generic
% 0.06/0.32 % CPULimit : 300
% 0.06/0.32 % WCLimit : 300
% 0.06/0.32 % DateTime : Fri Sep 25 22:04:50 UTC 2026
% 0.06/0.32 % CPUTime :
% 0.06/0.32 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.90/2.84 % SZS status Unsatisfiable for theBenchmark.p
% 2.90/2.84 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------