%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL237-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 : n008.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 30.47s 4.36s
% Output : CNFRefutation 30.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 38 ( 27 unt; 0 nHn; 13 RR)
% Number of literals : 52 ( 6 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))) ).
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(axiom_1_6,axiom,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) ).
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(q,implies(p,and(p,q)))),
inference(clausification,[status(esa)],[prove_this]) ).
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(c5,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(clausification,[status(esa)],[axiom_1_6]) ).
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,
and(X0,X1) = not(implies(X0,not(X1))),
inference(demodulation,[status(thm)],[c9,c6]) ).
cnf(d1,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[d0,c6]) ).
cnf(d2,plain,
axiom(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[status(thm)],[c6,c3]) ).
cnf(d3,plain,
axiom(implies(implies(X1,not(X0)),implies(X0,not(X1)))),
inference(superposition,[status(thm)],[c6,d2]) ).
cnf(d4,plain,
axiom(or(and(X0,X1),implies(X1,not(X0)))),
inference(demodulation,[status(thm)],[d3,d1]) ).
cnf(d5,plain,
theorem(or(and(X0,X1),implies(X1,not(X0)))),
inference(resolution,[status(thm)],[d4,c7]) ).
cnf(d6,plain,
theorem(or(and(implies(X0,not(X1)),X2),implies(X2,and(X0,X1)))),
inference(superposition,[status(thm)],[d0,d5]) ).
cnf(d7,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(resolution,[status(thm)],[c5,c7]) ).
cnf(d8,plain,
( ~ theorem(implies(X1,X2))
| theorem(implies(or(X0,X1),or(X0,X2))) ),
inference(resolution,[status(thm)],[d7,c8]) ).
cnf(d9,plain,
( ~ theorem(or(X2,X0))
| theorem(or(X2,X1))
| ~ theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d8,c8]) ).
cnf(d10,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[c3,c7]) ).
cnf(d11,plain,
theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[status(thm)],[c6,d10]) ).
cnf(d12,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[c4,c7]) ).
cnf(d13,plain,
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[d12,c8]) ).
cnf(d14,plain,
( theorem(or(X1,or(not(X0),X2)))
| ~ theorem(implies(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c6,d13]) ).
cnf(d15,plain,
( theorem(or(X2,implies(X0,X1)))
| ~ theorem(implies(X0,or(X2,X1))) ),
inference(demodulation,[status(thm)],[d14,c6]) ).
cnf(d16,plain,
theorem(or(X0,implies(implies(X1,X0),not(X1)))),
inference(resolution,[status(thm)],[d15,d11]) ).
cnf(d17,plain,
( theorem(or(X1,X2))
| ~ theorem(implies(implies(implies(X0,X1),not(X0)),X2)) ),
inference(resolution,[status(thm)],[d16,d9]) ).
cnf(d18,plain,
( theorem(or(X1,X2))
| ~ theorem(or(and(implies(X0,X1),X0),X2)) ),
inference(demodulation,[status(thm)],[d17,d1]) ).
cnf(d19,plain,
theorem(or(not(X0),implies(X1,and(X1,X0)))),
inference(resolution,[status(thm)],[d18,d6]) ).
cnf(d20,plain,
theorem(implies(X0,implies(X1,and(X1,X0)))),
inference(demodulation,[status(thm)],[d19,c6]) ).
cnf(d21,plain,
$false,
inference(resolution,[status(thm)],[d20,c0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL237-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.41 % Computer : n008.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Fri Sep 25 22:06:09 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.47/4.36 % SZS status Unsatisfiable for theBenchmark.p
% 30.47/4.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------