%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL207-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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 8.42s 7.55s
% Output : CNFRefutation 8.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 50 ( 28 unt; 0 nHn; 20 RR)
% Number of literals : 78 ( 2 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 104 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ theorem(implies(not(implies(p,q)),implies(q,p))) ).
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(not(implies(p,q)),implies(q,p))),
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(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[c3,c7]) ).
cnf(d1,plain,
theorem(implies(or(X1,not(X0)),implies(X0,X1))),
inference(superposition,[status(thm)],[c6,d0]) ).
cnf(d2,plain,
theorem(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c2,c7]) ).
cnf(d3,plain,
( ~ theorem(X1)
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c8,d2]) ).
cnf(d4,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[c4,c7]) ).
cnf(d5,plain,
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[d4,c8]) ).
cnf(d6,plain,
( ~ theorem(or(X0,X2))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[d5,d3]) ).
cnf(d7,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(resolution,[status(thm)],[c5,c7]) ).
cnf(d8,plain,
( ~ theorem(implies(X1,X2))
| theorem(implies(or(X0,X1),or(X0,X2))) ),
inference(resolution,[status(thm)],[d7,c8]) ).
cnf(d9,plain,
( ~ theorem(or(X2,X0))
| theorem(or(X2,X1))
| ~ theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d8,c8]) ).
cnf(d10,plain,
( ~ theorem(or(X3,X1))
| theorem(or(X3,X2))
| ~ theorem(implies(or(X0,X1),X2)) ),
inference(resolution,[status(thm)],[d9,d6]) ).
cnf(d11,plain,
( ~ theorem(or(X0,not(X1)))
| theorem(or(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[d10,d1]) ).
cnf(d12,plain,
( ~ theorem(or(not(X0),not(X1)))
| theorem(implies(X0,implies(X1,X2))) ),
inference(superposition,[status(thm)],[c6,d11]) ).
cnf(d13,plain,
( ~ theorem(implies(X0,not(X1)))
| theorem(implies(X0,implies(X1,X2))) ),
inference(demodulation,[status(thm)],[d12,c6]) ).
cnf(d14,plain,
~ theorem(implies(not(implies(p,q)),not(q))),
inference(resolution,[status(thm)],[d13,c0]) ).
cnf(d15,plain,
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[d0,c8]) ).
cnf(d16,plain,
( theorem(or(X1,not(X0)))
| ~ theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c6,d15]) ).
cnf(d17,plain,
( ~ theorem(implies(X1,not(X0)))
| theorem(implies(X0,not(X1))) ),
inference(superposition,[status(thm)],[c6,d16]) ).
cnf(d18,plain,
theorem(implies(or(X0,X0),X0)),
inference(resolution,[status(thm)],[c1,c7]) ).
cnf(d19,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[c8,d18]) ).
cnf(d20,plain,
( theorem(or(X1,or(not(X0),X2)))
| ~ theorem(implies(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c6,d5]) ).
cnf(d21,plain,
( theorem(or(X2,implies(X0,X1)))
| ~ theorem(implies(X0,or(X2,X1))) ),
inference(demodulation,[status(thm)],[d20,c6]) ).
cnf(d22,plain,
theorem(or(X0,implies(X1,X1))),
inference(resolution,[status(thm)],[d21,d2]) ).
cnf(d23,plain,
theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[d22,d19]) ).
cnf(d24,plain,
theorem(implies(X0,not(not(X0)))),
inference(resolution,[status(thm)],[d17,d23]) ).
cnf(d25,plain,
theorem(implies(X1,implies(X0,X1))),
inference(superposition,[status(thm)],[c6,d2]) ).
cnf(d26,plain,
( theorem(or(not(X0),X2))
| ~ theorem(implies(X1,X2))
| ~ theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c6,d9]) ).
cnf(d27,plain,
( theorem(implies(X0,X1))
| ~ theorem(implies(X0,X2))
| ~ theorem(implies(X2,X1)) ),
inference(demodulation,[status(thm)],[d26,c6]) ).
cnf(d28,plain,
( theorem(implies(X1,X2))
| ~ theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[d27,d25]) ).
cnf(d29,plain,
theorem(implies(X0,not(not(implies(X1,X0))))),
inference(resolution,[status(thm)],[d28,d24]) ).
cnf(d30,plain,
theorem(implies(not(implies(X0,X1)),not(X1))),
inference(resolution,[status(thm)],[d29,d17]) ).
cnf(d31,plain,
$false,
inference(resolution,[status(thm)],[d30,d14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL207-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.44 % Computer : n017.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Fri Sep 25 21:56:17 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.42/7.55 % SZS status Unsatisfiable for theBenchmark.p
% 8.42/7.55 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------