%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL225-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 : n018.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:08 AM UTC 2026
% Result : Unsatisfiable 16.76s 5.53s
% Output : CNFRefutation 16.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 47 ( 23 unt; 0 nHn; 21 RR)
% Number of literals : 75 ( 0 equ; 31 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 112 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))) ).
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(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
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(not(X1),X2))
| theorem(or(not(or(X0,X1)),or(X0,X2))) ),
inference(resolution,[status(thm)],[c5,c7]) ).
cnf(d2,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(d3,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)],[d2,d1]) ).
cnf(d4,plain,
( theorem(or(not(or(X1,or(not(X4),X2))),or(not(or(X0,X4)),X3)))
| ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
inference(resolution,[status(thm)],[d3,d0]) ).
cnf(d5,plain,
~ theorem(or(not(or(not(p),or(not(p),r))),or(not(p),r))),
inference(resolution,[status(thm)],[d4,c0]) ).
cnf(d6,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[c7,c1]) ).
cnf(d7,plain,
( ~ theorem(X1)
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c7,c2]) ).
cnf(d8,plain,
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[c7,c4]) ).
cnf(d9,plain,
( ~ theorem(or(X0,X2))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[d8,d7]) ).
cnf(d10,plain,
( theorem(or(X0,X1))
| ~ theorem(or(or(X0,X1),X1)) ),
inference(resolution,[status(thm)],[d9,d6]) ).
cnf(d11,plain,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c7,c3]) ).
cnf(d12,plain,
( theorem(or(not(or(X1,X0)),X2))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c8,c3]) ).
cnf(d13,plain,
( theorem(or(not(X1),X2))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[c8,c2]) ).
cnf(d14,plain,
theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[c2,c6]) ).
cnf(d15,plain,
theorem(or(not(or(X0,X1)),or(X2,or(X1,X0)))),
inference(resolution,[status(thm)],[d12,d14]) ).
cnf(d16,plain,
theorem(or(not(X0),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[d15,d13]) ).
cnf(d17,plain,
( theorem(or(not(or(X0,X0)),X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[c8,c1]) ).
cnf(d18,plain,
( theorem(or(X1,or(not(or(X0,X0)),X2)))
| ~ theorem(or(not(X0),or(X1,X2))) ),
inference(resolution,[status(thm)],[d17,d8]) ).
cnf(d19,plain,
( theorem(or(not(or(X0,X0)),X1))
| ~ theorem(or(not(X0),or(or(not(or(X0,X0)),X1),X1))) ),
inference(resolution,[status(thm)],[d18,d6]) ).
cnf(d20,plain,
theorem(or(not(or(X0,X0)),or(X0,X1))),
inference(resolution,[status(thm)],[d19,d16]) ).
cnf(d21,plain,
( ~ theorem(or(not(or(X0,X2)),X3))
| theorem(or(not(or(X0,or(X1,X2))),or(X1,X3))) ),
inference(resolution,[status(thm)],[d0,d1]) ).
cnf(d22,plain,
( theorem(or(not(or(X3,X1)),or(X3,X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[d21,d13]) ).
cnf(d23,plain,
theorem(or(not(or(X0,X1)),or(X0,or(X1,X2)))),
inference(resolution,[status(thm)],[d22,d20]) ).
cnf(d24,plain,
theorem(or(not(or(X0,X1)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[d23,d12]) ).
cnf(d25,plain,
theorem(or(X0,or(not(or(X1,X0)),or(X1,X2)))),
inference(resolution,[status(thm)],[d24,d8]) ).
cnf(d26,plain,
theorem(or(or(not(or(X0,X1)),or(X0,X2)),X1)),
inference(resolution,[status(thm)],[d25,d11]) ).
cnf(d27,plain,
theorem(or(not(or(X0,or(X0,X1))),or(X0,X1))),
inference(resolution,[status(thm)],[d26,d10]) ).
cnf(d28,plain,
$false,
inference(resolution,[status(thm)],[d27,d5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL225-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n018.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 22:06:06 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.76/5.53 % SZS status Unsatisfiable for theBenchmark.p
% 16.76/5.53 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------