%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL211-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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:05 AM UTC 2026
% Result : Unsatisfiable 34.28s 8.00s
% Output : CNFRefutation 34.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 39 ( 19 unt; 0 nHn; 17 RR)
% Number of literals : 63 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 85 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(or(not(not(q)),or(not(or(p,q)),p))) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X0,X0)),X0)) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X0),or(X1,X0))) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X0,X1)),or(X1,X0))) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ).
cnf(rule_1,axiom,
( ~ axiom(X0)
| theorem(X0) ) ).
cnf(rule_2,axiom,
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ) ).
cnf(rule_3,axiom,
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ) ).
cnf(c0,plain,
~ theorem(or(not(not(q)),or(not(or(p,q)),p))),
inference(clausification,[status(esa)],[prove_this]) ).
cnf(c1,plain,
axiom(or(not(or(X0,X0)),X0)),
inference(clausification,[status(esa)],[axiom_1_2]) ).
cnf(c2,plain,
axiom(or(not(X0),or(X1,X0))),
inference(clausification,[status(esa)],[axiom_1_3]) ).
cnf(c3,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(clausification,[status(esa)],[axiom_1_4]) ).
cnf(c4,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(clausification,[status(esa)],[axiom_1_5]) ).
cnf(c5,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(clausification,[status(esa)],[axiom_1_6]) ).
cnf(c6,plain,
( ~ axiom(X0)
| theorem(X0) ),
inference(clausification,[status(esa)],[rule_1]) ).
cnf(c7,plain,
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ),
inference(clausification,[status(esa)],[rule_2]) ).
cnf(c8,plain,
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ),
inference(clausification,[status(esa)],[rule_3]) ).
cnf(d0,plain,
( theorem(or(not(or(X1,or(X0,X2))),X3))
| ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
inference(resolution,[status(thm)],[c8,c4]) ).
cnf(d1,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[c7,c1]) ).
cnf(d2,plain,
( ~ theorem(X1)
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c7,c2]) ).
cnf(d3,plain,
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[c7,c4]) ).
cnf(d4,plain,
( ~ theorem(or(X0,X2))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[d3,d2]) ).
cnf(d5,plain,
( theorem(or(X0,X1))
| ~ theorem(or(or(X0,X1),X1)) ),
inference(resolution,[status(thm)],[d4,d1]) ).
cnf(d6,plain,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c7,c3]) ).
cnf(d7,plain,
theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c1,c6]) ).
cnf(d8,plain,
theorem(or(X0,or(not(or(or(X0,X1),or(X0,X1))),X1))),
inference(resolution,[status(thm)],[d3,d7]) ).
cnf(d9,plain,
theorem(or(or(not(or(or(X0,X1),or(X0,X1))),X1),X0)),
inference(resolution,[status(thm)],[d8,d6]) ).
cnf(d10,plain,
theorem(or(not(or(or(X0,X0),or(X0,X0))),X0)),
inference(resolution,[status(thm)],[d9,d5]) ).
cnf(d11,plain,
theorem(or(not(or(X0,or(or(X0,X0),X0))),X0)),
inference(resolution,[status(thm)],[d10,d0]) ).
cnf(d12,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c8,c2]) ).
cnf(d13,plain,
( theorem(or(not(or(X1,X0)),X2))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c8,c3]) ).
cnf(d14,plain,
( ~ theorem(or(not(X1),X2))
| theorem(or(not(or(X0,X1)),or(X0,X2))) ),
inference(resolution,[status(thm)],[c5,c7]) ).
cnf(d15,plain,
( theorem(or(not(or(not(X1),X2)),X3))
| ~ theorem(or(not(or(not(or(X0,X1)),or(X0,X2))),X3)) ),
inference(resolution,[status(thm)],[c8,c5]) ).
cnf(d16,plain,
( ~ theorem(or(not(or(X2,X1)),X3))
| theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),X3))) ),
inference(resolution,[status(thm)],[d15,d14]) ).
cnf(d17,plain,
( theorem(or(not(or(X1,not(X3))),or(not(or(X0,X3)),X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[d16,d13]) ).
cnf(d18,plain,
( theorem(or(not(not(X3)),or(not(or(X0,X3)),X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[d17,d12]) ).
cnf(d19,plain,
theorem(or(not(not(X0)),or(not(or(X1,X0)),X1))),
inference(resolution,[status(thm)],[d18,d11]) ).
cnf(d20,plain,
$false,
inference(resolution,[status(thm)],[d19,c0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL211-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.43 % Computer : n007.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Fri Sep 25 21:58:53 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 34.28/8.00 % SZS status Unsatisfiable for theBenchmark.p
% 34.28/8.00 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------