%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL190-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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:59 AM UTC 2026
% Result : Unsatisfiable 9.55s 6.69s
% Output : CNFRefutation 9.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 9 unt; 0 nHn; 8 RR)
% Number of literals : 21 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X0,X1)),or(X1,X0))) ).
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(c0,plain,
~ theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))),
inference(clausification,[status(esa)],[prove_this]) ).
cnf(c3,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(clausification,[status(esa)],[axiom_1_4]) ).
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(d0,plain,
( ~ theorem(or(not(X1),X2))
| theorem(or(not(or(X0,X1)),or(X0,X2))) ),
inference(resolution,[status(thm)],[c5,c7]) ).
cnf(d1,plain,
~ theorem(or(not(or(q,r)),or(r,q))),
inference(resolution,[status(thm)],[d0,c0]) ).
cnf(d2,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[c3,c6]) ).
cnf(d3,plain,
$false,
inference(resolution,[status(thm)],[d2,d1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL190-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.37 % Computer : n010.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Fri Sep 25 21:59:19 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.55/6.69 % SZS status Unsatisfiable for theBenchmark.p
% 9.55/6.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------