%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL005-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n006.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 : Thu Sep 24 01:06:35 PM UTC 2026
% Result : Unsatisfiable 201.64s 25.87s
% Output : CNFRefutation 201.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of formulae : 120 ( 18 unt; 13 def)
% Number of atoms : 326 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 394 ( 188 ~; 193 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 15 ( 14 usr; 14 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 378 ( 378 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(or(not(X),Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z,U,V] : is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,or(U,V)))),or(not(or(not(U),X)),or(Z,or(V,X))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(or(not(or(a,a)),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,plain,
! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(X)
| ~ is_a_theorem(or(not(X),Y)) ) ),
inference(miniscoping,[status(thm)],[f1]) ).
fof(f5,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f6,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))),or(not(or(not(X3),X0)),or(X2,or(X4,X0))))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(or(not(or(a,a)),a)),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(not(or(not(X3),X0)),or(X2,or(X4,X0))))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(X2,or(X4,X0)))
| ~ is_a_theorem(or(not(X3),X0))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))) ),
inference(resolution,[status(thm)],[f8,f5]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( is_a_theorem(or(X5,or(X7,or(not(or(not(X0),X1)),or(X2,or(X3,X1))))))
| ~ is_a_theorem(or(not(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X1)))),X4)),or(X5,or(or(not(or(not(X1),X6)),or(X2,or(X0,X3))),X7)))) ),
inference(resolution,[status(thm)],[f9,f6]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ is_a_theorem(or(not(or(not(X2),X7)),or(X0,or(X5,X1))))
| is_a_theorem(or(X4,or(X6,or(X0,or(X1,X2)))))
| ~ is_a_theorem(or(not(or(not(or(X0,or(X1,X2))),X3)),or(X4,or(or(not(X5),X2),X6)))) ),
inference(resolution,[status(thm)],[f9,f8]) ).
fof(f13,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ is_a_theorem(or(not(or(not(X1),X7)),or(X0,or(X2,X5))))
| is_a_theorem(or(X4,or(X6,or(X0,or(X1,X2)))))
| ~ is_a_theorem(or(not(or(not(or(X0,or(X1,X2))),X3)),or(X4,or(or(not(X5),X2),X6)))) ),
inference(resolution,[status(thm)],[f11,f8]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( is_a_theorem(or(X5,or(X7,or(not(or(not(X0),X1)),or(or(not(X1),X2),X3)))))
| ~ is_a_theorem(or(not(or(not(or(not(or(not(X0),X1)),or(or(not(X1),X2),X3))),X4)),or(X5,or(or(not(or(X6,X1)),X3),X7)))) ),
inference(resolution,[status(thm)],[f13,f6]) ).
fof(f19,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ is_a_theorem(or(not(or(not(X1),X6)),or(X0,or(or(not(or(not(X2),X3)),or(or(not(X3),X4),X5)),or(not(or(X7,X3)),X5)))))
| is_a_theorem(or(X0,or(X1,or(not(or(not(X2),X3)),or(or(not(X3),X4),X5))))) ),
inference(resolution,[status(thm)],[f14,f8]) ).
fof(f26,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ is_a_theorem(or(not(or(not(or(not(or(X6,X3)),X5)),X7)),or(X0,or(X1,or(not(or(not(X2),X3)),or(or(not(X3),X4),X5))))))
| is_a_theorem(or(X0,or(X1,or(not(or(not(X2),X3)),or(or(not(X3),X4),X5))))) ),
inference(resolution,[status(thm)],[f19,f8]) ).
fof(f32,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(or(not(or(not(X0),or(not(X1),X2))),or(or(X3,or(not(X1),X2)),or(not(or(not(X1),X2)),or(X4,or(X5,X2)))))),
inference(resolution,[status(thm)],[f10,f6]) ).
fof(f46,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(or(not(or(not(X0),or(or(not(X1),X2),X1))),or(X3,or(not(or(not(X4),X1)),or(or(not(X1),X2),X1))))),
inference(resolution,[status(thm)],[f26,f6]) ).
fof(f47,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(or(or(X0,or(not(X1),X2)),or(not(or(not(X1),X2)),or(not(or(not(X3),X4)),or(or(not(X4),X5),X2))))),
inference(resolution,[status(thm)],[f26,f32]) ).
fof(f53,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(X3,or(not(or(not(X4),X1)),or(or(not(X1),X2),X1))))
| ~ is_a_theorem(or(not(X0),or(or(not(X1),X2),X1))) ),
inference(resolution,[status(thm)],[f46,f5]) ).
fof(f71,definition,
! [X0] :
( sQ0_spl
<=> ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f72,plain,
! [X0] :
( ~ sQ0_spl
| ~ is_a_theorem(X0) ),
inference(component_clause,[status(thm)],[f71]) ).
fof(f78,plain,
( ~ sQ0_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f47,f72]) ).
fof(f86,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f78]) ).
fof(f89,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(or(not(or(not(X0),or(not(X1),X2))),or(not(or(not(X3),X1)),or(or(X4,X1),or(not(X1),X2))))),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f90,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(or(not(or(not(or(X0,X1)),X2)),or(not(or(not(X3),X1)),or(or(not(X1),X4),X2)))),
inference(resolution,[status(thm)],[f89,f8]) ).
fof(f93,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,X0))),or(not(or(not(X3),X0)),or(X4,or(X2,X0))))),
inference(resolution,[status(thm)],[f90,f8]) ).
fof(f94,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( is_a_theorem(or(X5,or(X7,or(not(or(not(X0),X1)),or(or(not(X1),X2),X3)))))
| ~ is_a_theorem(or(not(or(not(or(not(or(not(X0),X1)),or(or(not(X1),X2),X3))),X4)),or(X5,or(or(not(or(X6,X1)),X3),X7)))) ),
inference(resolution,[status(thm)],[f90,f9]) ).
fof(f95,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(not(or(not(X3),X1)),or(or(not(X1),X4),X2)))
| ~ is_a_theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[f90,f5]) ).
fof(f106,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(not(or(not(X3),X0)),or(X4,or(X2,X0))))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0))) ),
inference(resolution,[status(thm)],[f93,f5]) ).
fof(f126,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(or(not(or(not(X0),or(not(X1),or(X2,X1)))),or(X3,or(not(or(not(X4),X1)),or(not(X1),or(X2,X1)))))),
inference(resolution,[status(thm)],[f10,f90]) ).
fof(f139,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(or(not(or(not(not(or(not(X0),X1))),X2)),or(X3,or(or(or(not(X1),X4),X1),X2)))),
inference(resolution,[status(thm)],[f46,f8]) ).
fof(f147,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(or(not(or(not(X0),X1)),or(or(not(X1),X2),or(X3,or(or(or(not(X4),X5),X4),X1))))),
inference(resolution,[status(thm)],[f139,f95]) ).
fof(f154,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(or(not(or(not(X0),X1)),or(or(not(X2),X3),or(or(or(or(not(X4),X5),X4),X2),X1)))),
inference(resolution,[status(thm)],[f147,f8]) ).
fof(f175,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(or(not(or(not(or(or(or(not(X0),X1),X0),X2)),X3)),or(or(not(X2),X4),or(X5,X3)))),
inference(resolution,[status(thm)],[f154,f8]) ).
fof(f197,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(or(X0,or(not(or(not(X1),or(X2,X3))),or(or(not(or(X2,X3)),X4),or(X2,X3))))),
inference(resolution,[status(thm)],[f175,f53]) ).
fof(f231,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(not(or(not(X1),or(X2,X3))),or(or(not(or(X2,X3)),X4),or(X2,X3))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f197,f5]) ).
fof(f232,definition,
! [X1,X2,X3,X4] :
( sQ2_spl
<=> is_a_theorem(or(not(or(not(X1),or(X2,X3))),or(or(not(or(X2,X3)),X4),or(X2,X3)))) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f233,plain,
! [X0,X1,X2,X3] :
( ~ sQ2_spl
| is_a_theorem(or(not(or(not(X0),or(X1,X2))),or(or(not(or(X1,X2)),X3),or(X1,X2)))) ),
inference(component_clause,[status(thm)],[f232]) ).
fof(f235,plain,
( sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f231,f71,f232]) ).
fof(f248,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ2_spl
| is_a_theorem(or(not(or(not(X0),or(X1,X2))),or(X3,or(or(not(or(X1,X2)),X4),or(X1,X2))))) ),
inference(resolution,[status(thm)],[f233,f106]) ).
fof(f290,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ2_spl
| is_a_theorem(or(not(or(not(or(not(or(X0,X1)),X2)),X3)),or(X4,or(or(X0,X1),X3)))) ),
inference(resolution,[status(thm)],[f248,f8]) ).
fof(f328,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ2_spl
| is_a_theorem(or(X0,or(X1,or(not(or(not(or(X2,X3)),X3)),or(or(not(X3),X4),X3))))) ),
inference(resolution,[status(thm)],[f290,f94]) ).
fof(f432,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ2_spl
| is_a_theorem(or(X1,or(not(or(not(or(X2,X3)),X3)),or(or(not(X3),X4),X3))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f328,f5]) ).
fof(f433,definition,
! [X1,X2,X3,X4] :
( sQ6_spl
<=> is_a_theorem(or(X1,or(not(or(not(or(X2,X3)),X3)),or(or(not(X3),X4),X3)))) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f434,plain,
! [X0,X1,X2,X3] :
( ~ sQ6_spl
| is_a_theorem(or(X0,or(not(or(not(or(X1,X2)),X2)),or(or(not(X2),X3),X2)))) ),
inference(component_clause,[status(thm)],[f433]) ).
fof(f436,plain,
( ~ sQ2_spl
| sQ6_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f432,f71,f433,f232]) ).
fof(f451,plain,
! [X0,X1,X2,X3] :
( ~ sQ6_spl
| is_a_theorem(or(not(or(not(or(X1,X2)),X2)),or(or(not(X2),X3),X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f434,f5]) ).
fof(f452,definition,
! [X1,X2,X3] :
( sQ7_spl
<=> is_a_theorem(or(not(or(not(or(X1,X2)),X2)),or(or(not(X2),X3),X2))) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f453,plain,
! [X0,X1,X2] :
( ~ sQ7_spl
| is_a_theorem(or(not(or(not(or(X0,X1)),X1)),or(or(not(X1),X2),X1))) ),
inference(component_clause,[status(thm)],[f452]) ).
fof(f455,plain,
( ~ sQ6_spl
| sQ7_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f451,f71,f452,f433]) ).
fof(f462,plain,
! [X0,X1,X2,X3] :
( ~ sQ7_spl
| is_a_theorem(or(X0,or(not(or(not(X1),X2)),or(or(not(X2),X3),X2)))) ),
inference(resolution,[status(thm)],[f453,f53]) ).
fof(f479,plain,
! [X0,X1,X2,X3] :
( ~ sQ7_spl
| is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f462,f5]) ).
fof(f480,definition,
! [X1,X2,X3] :
( sQ8_spl
<=> is_a_theorem(or(not(or(not(X1),X2)),or(or(not(X2),X3),X2))) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f481,plain,
! [X0,X1,X2] :
( ~ sQ8_spl
| is_a_theorem(or(not(or(not(X0),X1)),or(or(not(X1),X2),X1))) ),
inference(component_clause,[status(thm)],[f480]) ).
fof(f483,plain,
( ~ sQ7_spl
| sQ8_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f479,f71,f480,f452]) ).
fof(f492,plain,
! [X0,X1,X2,X3] :
( ~ sQ8_spl
| is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(or(not(X1),X3),X1)))) ),
inference(resolution,[status(thm)],[f481,f106]) ).
fof(f521,plain,
! [X0,X1,X2,X3] :
( ~ sQ8_spl
| is_a_theorem(or(not(or(not(or(not(X0),X1)),X2)),or(X3,or(X0,X2)))) ),
inference(resolution,[status(thm)],[f492,f8]) ).
fof(f555,plain,
! [X0,X1,X2,X3] :
( ~ sQ8_spl
| is_a_theorem(or(X3,or(X0,X2)))
| ~ is_a_theorem(or(not(or(not(X0),X1)),X2)) ),
inference(resolution,[status(thm)],[f521,f5]) ).
fof(f577,plain,
! [X0,X1,X2,X3] :
( ~ sQ8_spl
| is_a_theorem(or(X0,X2))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(or(not(or(not(X0),X1)),X2)) ),
inference(resolution,[status(thm)],[f555,f5]) ).
fof(f578,definition,
! [X0,X1,X2] :
( sQ10_spl
<=> ( is_a_theorem(or(X0,X2))
| ~ is_a_theorem(or(not(or(not(X0),X1)),X2)) ) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f579,plain,
! [X0,X1,X2] :
( ~ sQ10_spl
| is_a_theorem(or(X0,X2))
| ~ is_a_theorem(or(not(or(not(X0),X1)),X2)) ),
inference(component_clause,[status(thm)],[f578]) ).
fof(f581,plain,
( ~ sQ8_spl
| sQ0_spl
| sQ10_spl ),
inference(split_clause,[status(thm)],[f577,f578,f71,f480]) ).
fof(f592,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ10_spl
| is_a_theorem(or(X0,or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3)))))) ),
inference(resolution,[status(thm)],[f579,f126]) ).
fof(f861,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ10_spl
| is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f592,f5]) ).
fof(f862,definition,
! [X1,X2,X3,X4] :
( sQ19_spl
<=> is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3))))) ),
introduced(definition,[new_symbols(definition,[sQ19_spl])],[split_symbol_definition]) ).
fof(f863,plain,
! [X0,X1,X2,X3] :
( ~ sQ19_spl
| is_a_theorem(or(X0,or(not(or(not(X1),X2)),or(not(X2),or(X3,X2))))) ),
inference(component_clause,[status(thm)],[f862]) ).
fof(f865,plain,
( ~ sQ10_spl
| sQ19_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f861,f71,f862,f578]) ).
fof(f874,plain,
! [X0,X1,X2,X3] :
( ~ sQ19_spl
| is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f863,f5]) ).
fof(f875,definition,
! [X1,X2,X3] :
( sQ20_spl
<=> is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2)))) ),
introduced(definition,[new_symbols(definition,[sQ20_spl])],[split_symbol_definition]) ).
fof(f876,plain,
! [X0,X1,X2] :
( ~ sQ20_spl
| is_a_theorem(or(not(or(not(X0),X1)),or(not(X1),or(X2,X1)))) ),
inference(component_clause,[status(thm)],[f875]) ).
fof(f878,plain,
( ~ sQ19_spl
| sQ20_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f874,f71,f875,f862]) ).
fof(f890,plain,
! [X0,X1,X2] :
( ~ sQ10_spl
| ~ sQ20_spl
| is_a_theorem(or(X0,or(not(X1),or(X2,X1)))) ),
inference(resolution,[status(thm)],[f876,f579]) ).
fof(f912,plain,
! [X0,X1,X2] :
( ~ sQ10_spl
| ~ sQ20_spl
| is_a_theorem(or(not(X1),or(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f890,f5]) ).
fof(f913,definition,
! [X1,X2] :
( sQ21_spl
<=> is_a_theorem(or(not(X1),or(X2,X1))) ),
introduced(definition,[new_symbols(definition,[sQ21_spl])],[split_symbol_definition]) ).
fof(f914,plain,
! [X0,X1] :
( ~ sQ21_spl
| is_a_theorem(or(not(X0),or(X1,X0))) ),
inference(component_clause,[status(thm)],[f913]) ).
fof(f916,plain,
( ~ sQ10_spl
| ~ sQ20_spl
| sQ21_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f912,f71,f913,f875,f578]) ).
fof(f951,plain,
! [X0,X1,X2] :
( ~ sQ21_spl
| is_a_theorem(or(not(or(not(not(X0)),X0)),or(X1,or(X2,X0)))) ),
inference(resolution,[status(thm)],[f914,f8]) ).
fof(f952,plain,
! [X0,X1,X2] :
( ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(or(X0,or(X1,or(not(X0),X2)))) ),
inference(resolution,[status(thm)],[f914,f579]) ).
fof(f1139,plain,
! [X0,X1,X2] :
( ~ sQ21_spl
| is_a_theorem(or(not(or(not(X0),not(X1))),or(X2,or(X1,not(X1))))) ),
inference(resolution,[status(thm)],[f951,f8]) ).
fof(f1140,plain,
! [X0,X1,X2] :
( ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(or(not(X0),or(X1,or(X2,X0)))) ),
inference(resolution,[status(thm)],[f951,f579]) ).
fof(f1144,plain,
! [X0,X1,X2] :
( ~ sQ21_spl
| is_a_theorem(or(X1,or(X2,X0)))
| ~ is_a_theorem(or(not(not(X0)),X0)) ),
inference(resolution,[status(thm)],[f951,f5]) ).
fof(f1163,plain,
! [X0,X1,X2] :
( ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(or(X1,or(X2,X0)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f1140,f5]) ).
fof(f1836,plain,
! [X0,X1,X2] :
( ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(or(X0,or(X1,or(X2,not(X2))))) ),
inference(resolution,[status(thm)],[f1139,f579]) ).
fof(f1842,plain,
! [X0,X1,X2,X3] :
( ~ sQ21_spl
| ~ sQ10_spl
| is_a_theorem(or(X0,or(X1,or(X2,or(X3,not(X3)))))) ),
inference(resolution,[status(thm)],[f1836,f1144]) ).
fof(f1860,plain,
! [X0,X1,X2] :
( ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(or(X1,or(X2,not(X2))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f1836,f5]) ).
fof(f1861,definition,
! [X1,X2] :
( sQ51_spl
<=> is_a_theorem(or(X1,or(X2,not(X2)))) ),
introduced(definition,[new_symbols(definition,[sQ51_spl])],[split_symbol_definition]) ).
fof(f1862,plain,
! [X0,X1] :
( ~ sQ51_spl
| is_a_theorem(or(X0,or(X1,not(X1)))) ),
inference(component_clause,[status(thm)],[f1861]) ).
fof(f1864,plain,
( ~ sQ10_spl
| ~ sQ21_spl
| sQ51_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f1860,f71,f1861,f913,f578]) ).
fof(f1873,plain,
! [X0,X1] :
( ~ sQ51_spl
| is_a_theorem(or(X1,not(X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f1862,f5]) ).
fof(f1874,definition,
! [X1] :
( sQ52_spl
<=> is_a_theorem(or(X1,not(X1))) ),
introduced(definition,[new_symbols(definition,[sQ52_spl])],[split_symbol_definition]) ).
fof(f1875,plain,
! [X0] :
( ~ sQ52_spl
| is_a_theorem(or(X0,not(X0))) ),
inference(component_clause,[status(thm)],[f1874]) ).
fof(f1877,plain,
( ~ sQ51_spl
| sQ52_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f1873,f71,f1874,f1861]) ).
fof(f1880,plain,
! [X0,X1] :
( ~ sQ10_spl
| ~ sQ52_spl
| is_a_theorem(or(X0,not(not(or(not(X0),X1))))) ),
inference(resolution,[status(thm)],[f1875,f579]) ).
fof(f2178,plain,
! [X0,X1,X2,X3,X4] :
( ~ is_a_theorem(or(not(or(not(X3),X4)),or(X2,or(X1,X0))))
| is_a_theorem(or(X2,or(X3,X1)))
| ~ is_a_theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f9,f8]) ).
fof(f2188,plain,
! [X0,X1,X2,X3] :
( ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(or(X3,or(X1,X2)))
| ~ is_a_theorem(or(not(X0),X2))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f1163,f9]) ).
fof(f2348,plain,
! [X0,X1,X2,X3] :
( ~ sQ21_spl
| ~ sQ10_spl
| is_a_theorem(or(X2,or(X3,X1)))
| ~ is_a_theorem(or(not(or(X0,not(X0))),X1)) ),
inference(resolution,[status(thm)],[f2178,f1842]) ).
fof(f2376,plain,
! [X0,X1,X2] :
( ~ sQ21_spl
| is_a_theorem(or(X2,X0))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(or(not(not(X0)),X0)) ),
inference(resolution,[status(thm)],[f1144,f5]) ).
fof(f2377,definition,
! [X0,X2] :
( sQ64_spl
<=> ( is_a_theorem(or(X2,X0))
| ~ is_a_theorem(or(not(not(X0)),X0)) ) ),
introduced(definition,[new_symbols(definition,[sQ64_spl])],[split_symbol_definition]) ).
fof(f2378,plain,
! [X0,X1] :
( ~ sQ64_spl
| is_a_theorem(or(X1,X0))
| ~ is_a_theorem(or(not(not(X0)),X0)) ),
inference(component_clause,[status(thm)],[f2377]) ).
fof(f2380,plain,
( ~ sQ21_spl
| sQ0_spl
| sQ64_spl ),
inference(split_clause,[status(thm)],[f2376,f2377,f71,f913]) ).
fof(f2388,plain,
! [X0,X1] :
( ~ sQ64_spl
| is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(or(not(not(X0)),X0)) ),
inference(resolution,[status(thm)],[f2378,f5]) ).
fof(f2393,definition,
! [X0] :
( sQ66_spl
<=> ( is_a_theorem(X0)
| ~ is_a_theorem(or(not(not(X0)),X0)) ) ),
introduced(definition,[new_symbols(definition,[sQ66_spl])],[split_symbol_definition]) ).
fof(f2394,plain,
! [X0] :
( ~ sQ66_spl
| is_a_theorem(X0)
| ~ is_a_theorem(or(not(not(X0)),X0)) ),
inference(component_clause,[status(thm)],[f2393]) ).
fof(f2396,plain,
( ~ sQ64_spl
| sQ0_spl
| sQ66_spl ),
inference(split_clause,[status(thm)],[f2388,f2393,f71,f2377]) ).
fof(f2902,plain,
! [X0,X1,X2] :
( ~ sQ66_spl
| ~ sQ21_spl
| ~ sQ10_spl
| is_a_theorem(or(X2,X1))
| ~ is_a_theorem(or(not(or(X0,not(X0))),X1)) ),
inference(resolution,[status(thm)],[f2348,f2394]) ).
fof(f2919,plain,
! [X0,X1] :
( ~ sQ66_spl
| ~ sQ21_spl
| ~ sQ10_spl
| is_a_theorem(X1)
| ~ is_a_theorem(or(not(or(X0,not(X0))),X1)) ),
inference(resolution,[status(thm)],[f2902,f2394]) ).
fof(f2977,plain,
! [X0,X1,X2] :
( ~ sQ10_spl
| ~ sQ21_spl
| ~ sQ66_spl
| is_a_theorem(or(X0,or(not(not(or(X1,not(X1)))),X2))) ),
inference(resolution,[status(thm)],[f2919,f952]) ).
fof(f3105,plain,
! [X0,X1] :
( ~ sQ66_spl
| ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(or(not(not(or(X0,not(X0)))),X1)) ),
inference(resolution,[status(thm)],[f2977,f2394]) ).
fof(f3373,plain,
! [X0,X1,X2] :
( ~ sQ66_spl
| ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(not(X0),X2))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f2188,f2394]) ).
fof(f3406,plain,
! [X0,X1] :
( ~ sQ66_spl
| ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(X1)
| ~ is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(or(X0,not(not(X1)))) ),
inference(resolution,[status(thm)],[f3373,f2394]) ).
fof(f3713,plain,
! [X0,X1] :
( ~ sQ66_spl
| ~ sQ10_spl
| ~ sQ21_spl
| is_a_theorem(X1)
| ~ is_a_theorem(or(not(not(not(or(X0,not(X0))))),X1)) ),
inference(resolution,[status(thm)],[f3406,f3105]) ).
fof(f3718,plain,
! [X0,X1] :
( ~ sQ10_spl
| ~ sQ52_spl
| ~ sQ66_spl
| ~ sQ21_spl
| is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(or(not(X0),or(not(X0),X1))) ),
inference(resolution,[status(thm)],[f3406,f1880]) ).
fof(f4494,plain,
! [X0,X1] :
( ~ sQ21_spl
| ~ sQ10_spl
| ~ sQ52_spl
| ~ sQ66_spl
| is_a_theorem(or(not(or(not(not(X0)),X0)),or(X1,X0))) ),
inference(resolution,[status(thm)],[f3718,f951]) ).
fof(f4504,plain,
! [X0] :
( ~ sQ21_spl
| ~ sQ10_spl
| ~ sQ52_spl
| ~ sQ66_spl
| is_a_theorem(or(not(X0),X0)) ),
inference(resolution,[status(thm)],[f3718,f914]) ).
fof(f4786,plain,
! [X0,X1,X2] :
( ~ sQ21_spl
| ~ sQ10_spl
| ~ sQ52_spl
| ~ sQ66_spl
| is_a_theorem(or(X2,or(not(or(X1,X0)),X1)))
| ~ is_a_theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f4494,f2178]) ).
fof(f6618,plain,
! [X0,X1] :
( ~ sQ66_spl
| ~ sQ10_spl
| ~ sQ21_spl
| ~ sQ52_spl
| is_a_theorem(or(not(or(X1,X0)),X1))
| ~ is_a_theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f4786,f3713]) ).
fof(f6657,plain,
( ~ sQ66_spl
| ~ sQ10_spl
| ~ sQ21_spl
| ~ sQ52_spl
| ~ is_a_theorem(or(not(a),a)) ),
inference(resolution,[status(thm)],[f6618,f7]) ).
fof(f6695,plain,
( ~ sQ66_spl
| ~ sQ10_spl
| ~ sQ21_spl
| ~ sQ52_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f6657,f4504]) ).
fof(f6696,plain,
( ~ sQ66_spl
| ~ sQ10_spl
| ~ sQ21_spl
| ~ sQ52_spl ),
inference(contradiction_clause,[status(thm)],[f6695]) ).
fof(f6697,plain,
$false,
inference(sat_refutation,[status(thm)],[f86,f235,f436,f455,f483,f581,f865,f878,f916,f1864,f1877,f2380,f2396,f6696]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 23:59:27 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.14/0.38 % Drodi V4.1.1
% 201.64/25.87 % Refutation found
% 201.64/25.87 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 201.64/25.87 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 129.50/26.00 % Elapsed time: 25.609166 seconds
% 129.50/26.00 % CPU time: 202.752319 seconds
% 129.50/26.00 % Total memory used: 1.065 GB
% 129.50/26.00 % Net memory used: 970.689 MB
%------------------------------------------------------------------------------