%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL186-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 : n004.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:58 AM UTC 2026
% Result : Unsatisfiable 9.95s 3.52s
% Output : CNFRefutation 9.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 3 RR)
% Number of literals : 19 ( 18 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 : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 36 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X0,X0,X1,X2) = X1 ).
cnf(axiom_1_3,axiom,
axiom(or(not(X0),or(X1,X0))) = true ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X0,X1)),or(X1,X0))) = true ).
cnf(rule_1,axiom,
ifeq(axiom(X0),true,theorem(X0),true) = true ).
cnf(rule_3,axiom,
ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true) = true ).
cnf(prove_this,negated_conjecture,
theorem(or(not(not(p)),or(not(p),q))) != true ).
cnf(c0,plain,
ifeq(X0,X0,X1,X2) = X1,
inference(clausification,[status(esa)],[ifeq_axiom]) ).
cnf(c2,plain,
axiom(or(not(X0),or(X1,X0))) = true,
inference(clausification,[status(esa)],[axiom_1_3]) ).
cnf(c3,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(clausification,[status(esa)],[axiom_1_4]) ).
cnf(c6,plain,
ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(clausification,[status(esa)],[rule_1]) ).
cnf(c8,plain,
ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true) = true,
inference(clausification,[status(esa)],[rule_3]) ).
cnf(c9,plain,
theorem(or(not(not(p)),or(not(p),q))) != true,
inference(clausification,[status(esa)],[prove_this]) ).
cnf(d0,plain,
ifeq(theorem(or(not(or(X1,X0)),X2)),true,ifeq(true,true,theorem(or(not(X0),X2)),true),true) = true,
inference(superposition,[status(thm)],[c2,c8]) ).
cnf(d1,plain,
ifeq(theorem(or(not(or(X2,X0)),X1)),true,theorem(or(not(X0),X1)),true) = true,
inference(demodulation,[status(thm)],[d0,c0]) ).
cnf(d2,plain,
ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c3,c6]) ).
cnf(d3,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[d2,c0]) ).
cnf(d4,plain,
ifeq(true,true,theorem(or(not(X1),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[d3,d1]) ).
cnf(d5,plain,
theorem(or(not(X0),or(X0,X1))) = true,
inference(demodulation,[status(thm)],[d4,c0]) ).
cnf(d6,plain,
$false,
inference(resolution,[status(thm)],[d5,c9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL186-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.57 % Computer : n004.cluster.edu
% 0.11/0.57 % Model : x86_64 x86_64
% 0.11/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57 % Memory : 8046.5625MB
% 0.11/0.57 % OS : Linux 6.8.0-71-generic
% 0.11/0.57 % CPULimit : 300
% 0.11/0.57 % WCLimit : 300
% 0.11/0.58 % DateTime : Fri Sep 25 21:58:21 UTC 2026
% 0.11/0.58 % CPUTime :
% 0.11/0.58 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.95/3.52 % SZS status Unsatisfiable for theBenchmark.p
% 9.95/3.52 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------