%------------------------------------------------------------------------------
% File : Toma---0.7
% Problem : LCL203-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n027.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 : Mon Sep 7 01:14:14 PM UTC 2026
% Result : Unsatisfiable 2.94s 3.39s
% Output : CNFRefutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 3 RR)
% Number of literals : 37 ( 36 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 73 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
file('theBenchmark.p',prove_this) ).
cnf(c1,axiom,
implies(X,Y) = or(not(X),Y),
file('theBenchmark.p',implies_definition) ).
cnf(c2,axiom,
ifeq(X,X,Y,Z) = Y,
file('theBenchmark.p',ifeq_axiom) ).
cnf(c3,axiom,
axiom(implies(X,or(Y,X))) = true,
file('theBenchmark.p',axiom_1_3) ).
cnf(c4,plain,
axiom(or(not(X),or(Y,X))) = true,
inference(equational,[status(thm)],[c1,c3]) ).
cnf(c5,axiom,
axiom(implies(or(X,X),X)) = true,
file('theBenchmark.p',axiom_1_2) ).
cnf(c6,plain,
axiom(or(not(or(X,X)),X)) = true,
inference(equational,[status(thm)],[c1,c5]) ).
cnf(c7,axiom,
ifeq(axiom(X),true,theorem(X),true) = true,
file('theBenchmark.p',rule_1) ).
cnf(c8,plain,
theorem(or(not(or(X,X)),X)) = true,
inference(equational,[status(thm)],[c2,c6,c7]) ).
cnf(c9,plain,
theorem(or(not(X),or(Y,X))) = true,
inference(equational,[status(thm)],[c2,c4,c7]) ).
cnf(c10,axiom,
axiom(implies(or(X,Y),or(Y,X))) = true,
file('theBenchmark.p',axiom_1_4) ).
cnf(c11,plain,
axiom(or(not(or(X,Y)),or(Y,X))) = true,
inference(equational,[status(thm)],[c1,c10]) ).
cnf(c12,plain,
theorem(or(not(or(X,Y)),or(Y,X))) = true,
inference(equational,[status(thm)],[c2,c7,c11]) ).
cnf(c13,axiom,
axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))) = true,
file('theBenchmark.p',axiom_1_6) ).
cnf(c14,plain,
axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))) = true,
inference(equational,[status(thm)],[c1,c13]) ).
cnf(c15,axiom,
axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))) = true,
file('theBenchmark.p',axiom_1_5) ).
cnf(c16,plain,
axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))) = true,
inference(equational,[status(thm)],[c1,c15]) ).
cnf(c17,plain,
theorem(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))) = true,
inference(equational,[status(thm)],[c2,c7,c16]) ).
cnf(c18,axiom,
ifeq(theorem(implies(X,Y)),true,ifeq(theorem(X),true,theorem(Y),true),true) = true,
file('theBenchmark.p',rule_2) ).
cnf(c19,plain,
ifeq(theorem(or(not(X),Y)),true,ifeq(theorem(X),true,theorem(Y),true),true) = true,
inference(equational,[status(thm)],[c1,c18]) ).
cnf(c20,plain,
ifeq(theorem(or(X,X)),true,theorem(X),true) = true,
inference(equational,[status(thm)],[c2,c8,c19]) ).
cnf(c25,plain,
ifeq(theorem(or(X,Y)),true,theorem(or(Y,X)),true) = true,
inference(equational,[status(thm)],[c2,c12,c19]) ).
cnf(c61,plain,
theorem(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))) = true,
inference(equational,[status(thm)],[c2,c7,c14]) ).
cnf(c69,plain,
ifeq(theorem(or(X,or(Y,Z))),true,theorem(or(Y,or(X,Z))),true) = true,
inference(equational,[status(thm)],[c2,c17,c19]) ).
cnf(c70,plain,
theorem(or(X,or(not(Y),Y))) = true,
inference(equational,[status(thm)],[c2,c9,c69]) ).
cnf(c71,plain,
theorem(or(not(X),X)) = true,
inference(equational,[status(thm)],[c2,c20,c70]) ).
cnf(c72,plain,
theorem(or(X,not(X))) = true,
inference(equational,[status(thm)],[c2,c25,c71]) ).
cnf(c314,plain,
ifeq(theorem(or(not(or(not(X),or(Y,X))),Z)),true,theorem(Z),true) = true,
inference(equational,[status(thm)],[c2,c9,c19]) ).
cnf(c315,plain,
theorem(or(not(or(X,Y)),or(X,or(Z,Y)))) = true,
inference(equational,[status(thm)],[c2,c61,c314]) ).
cnf(c330,plain,
ifeq(theorem(or(X,Y)),true,theorem(or(X,or(Z,Y))),true) = true,
inference(equational,[status(thm)],[c2,c19,c315]) ).
cnf(c477,plain,
ifeq(theorem(or(not(or(X,not(X))),Y)),true,theorem(Y),true) = true,
inference(equational,[status(thm)],[c2,c19,c72]) ).
cnf(c478,plain,
theorem(or(not(or(X,Y)),or(X,not(not(Y))))) = true,
inference(equational,[status(thm)],[c2,c61,c477]) ).
cnf(c481,plain,
theorem(or(not(X),not(not(or(Y,X))))) = true,
inference(equational,[status(thm)],[c2,c314,c478]) ).
cnf(c484,plain,
theorem(or(not(not(or(X,Y))),not(Y))) = true,
inference(equational,[status(thm)],[c2,c25,c481]) ).
cnf(c610,plain,
theorem(or(not(not(or(X,Y))),or(Z,not(Y)))) = true,
inference(equational,[status(thm)],[c2,c330,c484]) ).
cnf(g1,plain,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) = true,
inference(equational,[status(thm)],[c1,c610]) ).
cnf(g2,plain,
$false,
inference(resolution,[status(thm)],[g0,g1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL203-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.02 % Command : run_Leo-III %s %d THM
% 0.08/0.34 % Computer : n027.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sun Sep 6 00:39:13 UTC 2026
% 0.08/0.35 % CPUTime :
% 2.94/3.39 % SZS status Unsatisfiable
% 2.94/3.39 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------