%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL209-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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:04 AM UTC 2026
% Result : Unsatisfiable 15.76s 3.32s
% Output : CNFRefutation 15.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 40 ( 26 unt; 0 nHn; 15 RR)
% Number of literals : 57 ( 2 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 81 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(implies(implies(not(p),q),or(p,q))) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X0,X0),X0)) ).
cnf(axiom_1_3,axiom,
axiom(implies(X0,or(X1,X0))) ).
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(c0,plain,
~ theorem(implies(implies(not(p),q),or(p,q))),
inference(clausification,[status(esa)],[prove_this]) ).
cnf(c1,plain,
axiom(implies(or(X0,X0),X0)),
inference(clausification,[status(esa)],[axiom_1_2]) ).
cnf(c2,plain,
axiom(implies(X0,or(X1,X0))),
inference(clausification,[status(esa)],[axiom_1_3]) ).
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(d0,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(resolution,[status(thm)],[c5,c7]) ).
cnf(d1,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[c4,c7]) ).
cnf(d2,plain,
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[d1,c8]) ).
cnf(d3,plain,
( theorem(or(X1,or(not(X0),X2)))
| ~ theorem(implies(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c6,d2]) ).
cnf(d4,plain,
( theorem(or(X2,implies(X0,X1)))
| ~ theorem(implies(X0,or(X2,X1))) ),
inference(demodulation,[status(thm)],[d3,c6]) ).
cnf(d5,plain,
( theorem(or(not(X0),implies(X2,X1)))
| ~ theorem(implies(X2,implies(X0,X1))) ),
inference(superposition,[status(thm)],[c6,d4]) ).
cnf(d6,plain,
( theorem(implies(X0,implies(X1,X2)))
| ~ theorem(implies(X1,implies(X0,X2))) ),
inference(demodulation,[status(thm)],[d5,c6]) ).
cnf(d7,plain,
theorem(implies(or(X0,X1),implies(implies(X1,X2),or(X0,X2)))),
inference(resolution,[status(thm)],[d6,d0]) ).
cnf(d8,plain,
( ~ theorem(or(X2,X0))
| theorem(implies(implies(X0,X1),or(X2,X1))) ),
inference(resolution,[status(thm)],[d7,c8]) ).
cnf(d9,plain,
~ theorem(or(p,not(p))),
inference(resolution,[status(thm)],[d8,c0]) ).
cnf(d10,plain,
theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[c1,c7]) ).
cnf(d11,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[c8,d10]) ).
cnf(d12,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[c3,c7]) ).
cnf(d13,plain,
theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[status(thm)],[c6,d12]) ).
cnf(d14,plain,
theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c2,c7]) ).
cnf(d15,plain,
theorem(or(X0,implies(X1,X1))),
inference(resolution,[status(thm)],[d4,d14]) ).
cnf(d16,plain,
( ~ theorem(implies(X1,X2))
| theorem(implies(or(X0,X1),or(X0,X2))) ),
inference(resolution,[status(thm)],[d0,c8]) ).
cnf(d17,plain,
( ~ theorem(or(X2,X0))
| theorem(or(X2,X1))
| ~ theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d16,c8]) ).
cnf(d18,plain,
( theorem(or(X2,X1))
| ~ theorem(implies(implies(X0,X0),X1)) ),
inference(resolution,[status(thm)],[d17,d15]) ).
cnf(d19,plain,
theorem(or(X0,or(X1,not(X1)))),
inference(resolution,[status(thm)],[d18,d13]) ).
cnf(d20,plain,
theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[d19,d11]) ).
cnf(d21,plain,
$false,
inference(resolution,[status(thm)],[d20,d9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL209-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 % Computer : n014.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Fri Sep 25 22:01:02 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.76/3.32 % SZS status Unsatisfiable for theBenchmark.p
% 15.76/3.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------