%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL239-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n013.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:11 AM UTC 2026
% Result : Unsatisfiable 22.36s 3.38s
% Output : CNFRefutation 22.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 3 RR)
% Number of literals : 52 ( 51 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 95 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X0,X0,X1,X2) = X1 ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X0,X0),X0)) = true ).
cnf(axiom_1_3,axiom,
axiom(implies(X0,or(X1,X0))) = true ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X0,X1),or(X1,X0))) = true ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true ).
cnf(implies_definition,axiom,
implies(X0,X1) = or(not(X0),X1) ).
cnf(rule_1,axiom,
ifeq(axiom(X0),true,theorem(X0),true) = true ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true ).
cnf(and_defn,axiom,
and(X0,X1) = not(or(not(X0),not(X1))) ).
cnf(prove_this,negated_conjecture,
theorem(not(and(p,not(p)))) != true ).
cnf(c0,plain,
ifeq(X0,X0,X1,X2) = X1,
inference(clausification,[status(esa)],[ifeq_axiom]) ).
cnf(c1,plain,
axiom(implies(or(X0,X0),X0)) = true,
inference(clausification,[status(esa)],[axiom_1_2]) ).
cnf(c2,plain,
axiom(implies(X0,or(X1,X0))) = true,
inference(clausification,[status(esa)],[axiom_1_3]) ).
cnf(c3,plain,
axiom(implies(or(X0,X1),or(X1,X0))) = true,
inference(clausification,[status(esa)],[axiom_1_4]) ).
cnf(c4,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
inference(clausification,[status(esa)],[axiom_1_5]) ).
cnf(c6,plain,
implies(X0,X1) = or(not(X0),X1),
inference(clausification,[status(esa)],[implies_definition]) ).
cnf(c7,plain,
ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(clausification,[status(esa)],[rule_1]) ).
cnf(c8,plain,
ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
inference(clausification,[status(esa)],[rule_2]) ).
cnf(c9,plain,
and(X0,X1) = not(or(not(X0),not(X1))),
inference(clausification,[status(esa)],[and_defn]) ).
cnf(c10,plain,
theorem(not(and(p,not(p)))) != true,
inference(clausification,[status(esa)],[prove_this]) ).
cnf(d0,plain,
and(X0,X1) = not(implies(X0,not(X1))),
inference(demodulation,[status(thm)],[c9,c6]) ).
cnf(d1,plain,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[status(thm)],[d0,c6]) ).
cnf(d2,plain,
ifeq(theorem(or(and(X0,X1),X2)),true,ifeq(theorem(implies(X0,not(X1))),true,theorem(X2),true),true) = true,
inference(superposition,[status(thm)],[d1,c8]) ).
cnf(d3,plain,
ifeq(true,true,theorem(implies(or(X0,X1),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c3,c7]) ).
cnf(d4,plain,
theorem(implies(or(X0,X1),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[d3,c0]) ).
cnf(d5,plain,
theorem(implies(implies(X0,X1),or(X1,not(X0)))) = true,
inference(superposition,[status(thm)],[c6,d4]) ).
cnf(d6,plain,
ifeq(true,true,ifeq(theorem(implies(X0,X1)),true,theorem(or(X1,not(X0))),true),true) = true,
inference(superposition,[status(thm)],[d5,c8]) ).
cnf(d7,plain,
ifeq(theorem(implies(X0,X1)),true,theorem(or(X1,not(X0))),true) = true,
inference(demodulation,[status(thm)],[d6,c0]) ).
cnf(d8,plain,
ifeq(true,true,theorem(implies(or(X0,X0),X0)),true) = true,
inference(superposition,[status(thm)],[c1,c7]) ).
cnf(d9,plain,
theorem(implies(or(X0,X0),X0)) = true,
inference(demodulation,[status(thm)],[d8,c0]) ).
cnf(d10,plain,
ifeq(true,true,ifeq(theorem(or(X0,X0)),true,theorem(X0),true),true) = true,
inference(superposition,[status(thm)],[d9,c8]) ).
cnf(d11,plain,
ifeq(theorem(or(X0,X0)),true,theorem(X0),true) = true,
inference(demodulation,[status(thm)],[d10,c0]) ).
cnf(d12,plain,
ifeq(true,true,theorem(implies(X0,or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c2,c7]) ).
cnf(d13,plain,
theorem(implies(X0,or(X1,X0))) = true,
inference(demodulation,[status(thm)],[d12,c0]) ).
cnf(d14,plain,
ifeq(theorem(implies(implies(X0,or(X1,X0)),X2)),true,ifeq(true,true,theorem(X2),true),true) = true,
inference(superposition,[status(thm)],[d13,c8]) ).
cnf(d15,plain,
ifeq(theorem(implies(implies(X1,or(X2,X1)),X0)),true,theorem(X0),true) = true,
inference(demodulation,[status(thm)],[d14,c0]) ).
cnf(d16,plain,
axiom(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))) = true,
inference(superposition,[status(thm)],[c6,c4]) ).
cnf(d17,plain,
axiom(implies(implies(X0,or(X2,X1)),or(X2,implies(X0,X1)))) = true,
inference(demodulation,[status(thm)],[d16,c6]) ).
cnf(d18,plain,
ifeq(true,true,theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),true) = true,
inference(superposition,[status(thm)],[d17,c7]) ).
cnf(d19,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))) = true,
inference(demodulation,[status(thm)],[d18,c0]) ).
cnf(d20,plain,
ifeq(true,true,theorem(or(X1,implies(X0,X0))),true) = true,
inference(superposition,[status(thm)],[d19,d15]) ).
cnf(d21,plain,
theorem(or(X0,implies(X1,X1))) = true,
inference(demodulation,[status(thm)],[d20,c0]) ).
cnf(d22,plain,
ifeq(true,true,theorem(implies(X0,X0)),true) = true,
inference(superposition,[status(thm)],[d21,d11]) ).
cnf(d23,plain,
theorem(implies(X0,X0)) = true,
inference(demodulation,[status(thm)],[d22,c0]) ).
cnf(d24,plain,
ifeq(true,true,theorem(or(X0,not(X0))),true) = true,
inference(superposition,[status(thm)],[d23,d7]) ).
cnf(d25,plain,
theorem(or(X0,not(X0))) = true,
inference(demodulation,[status(thm)],[d24,c0]) ).
cnf(d26,plain,
ifeq(true,true,ifeq(theorem(implies(X0,not(X1))),true,theorem(not(and(X0,X1))),true),true) = true,
inference(superposition,[status(thm)],[d25,d2]) ).
cnf(d27,plain,
ifeq(theorem(implies(X0,not(X1))),true,theorem(not(and(X0,X1))),true) = true,
inference(demodulation,[status(thm)],[d26,c0]) ).
cnf(d28,plain,
theorem(implies(X0,not(not(X0)))) = true,
inference(superposition,[status(thm)],[c6,d25]) ).
cnf(d29,plain,
ifeq(true,true,theorem(not(and(X0,not(X0)))),true) = true,
inference(superposition,[status(thm)],[d28,d27]) ).
cnf(d30,plain,
theorem(not(and(X0,not(X0)))) = true,
inference(demodulation,[status(thm)],[d29,c0]) ).
cnf(d31,plain,
$false,
inference(resolution,[status(thm)],[d30,c10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL239-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 22:04:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.36/3.38 % SZS status Unsatisfiable for theBenchmark.p
% 22.36/3.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------