%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL236-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n001.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 14.59s 2.38s
% Output : CNFRefutation 14.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 15 unt; 0 nHn; 10 RR)
% Number of literals : 31 ( 0 equ; 11 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 : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))) ).
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(rule_1,axiom,
( ~ axiom(X0)
| theorem(X0) ) ).
cnf(rule_2,axiom,
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ) ).
cnf(c0,plain,
~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))),
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(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(d0,plain,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c7,c3]) ).
cnf(d1,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[c7,c1]) ).
cnf(d2,plain,
theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c2,c6]) ).
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,or(not(X1),X1))),
inference(resolution,[status(thm)],[d3,d2]) ).
cnf(d5,plain,
theorem(or(not(X0),X0)),
inference(resolution,[status(thm)],[d4,d1]) ).
cnf(d6,plain,
theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[d5,d0]) ).
cnf(d7,plain,
$false,
inference(resolution,[status(thm)],[d6,c0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL236-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.41 % Computer : n001.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.42 % DateTime : Fri Sep 25 22:10:56 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.59/2.38 % SZS status Unsatisfiable for theBenchmark.p
% 14.59/2.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------