%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL004-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 13.61s 2.27s
% Output : CNFRefutation 13.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 69 ( 11 unt; 10 def)
% Number of atoms : 157 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 163 ( 75 ~; 78 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 12 ( 11 usr; 11 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 202 ( 202 !; 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(a),or(b,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(a),or(b,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(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(f10,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)],[f9,f8]) ).
fof(f12,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)],[f10,f8]) ).
fof(f25,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)],[f12,f5]) ).
fof(f29,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(not(or(not(X2),X3)),or(X4,or(X0,X3))))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0))) ),
inference(resolution,[status(thm)],[f25,f8]) ).
fof(f50,definition,
! [X4] :
( sQ1_spl
<=> ~ is_a_theorem(X4) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f51,plain,
! [X0] :
( ~ sQ1_spl
| ~ is_a_theorem(X0) ),
inference(component_clause,[status(thm)],[f50]) ).
fof(f74,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(not(or(not(X0),X2)),or(X3,or(X4,X2))))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0))) ),
inference(resolution,[status(thm)],[f29,f8]) ).
fof(f79,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(X4,or(X0,X3)))
| ~ is_a_theorem(or(not(X2),X3))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0))) ),
inference(resolution,[status(thm)],[f29,f5]) ).
fof(f101,plain,
( ~ sQ1_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f6,f51]) ).
fof(f105,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f101]) ).
fof(f180,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(X3,or(X4,X2)))
| ~ is_a_theorem(or(not(X0),X2))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0))) ),
inference(resolution,[status(thm)],[f74,f5]) ).
fof(f232,plain,
! [X0,X1,X2,X3,X4,X5] :
( is_a_theorem(or(X4,or(X5,X3)))
| ~ is_a_theorem(or(not(or(X2,X0)),X3))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0))) ),
inference(resolution,[status(thm)],[f25,f180]) ).
fof(f319,plain,
! [X0,X1,X2,X3,X4,X5] :
( is_a_theorem(or(X4,or(X5,X3)))
| ~ is_a_theorem(or(not(or(not(or(not(X0),X1)),or(not(X1),or(X2,X1)))),X3)) ),
inference(resolution,[status(thm)],[f232,f6]) ).
fof(f336,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(or(X0,or(X1,or(not(or(not(X2),X3)),or(not(X4),or(X4,X3)))))),
inference(resolution,[status(thm)],[f319,f6]) ).
fof(f366,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X4),or(X4,X3)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f336,f5]) ).
fof(f367,definition,
! [X1,X2,X3,X4] :
( sQ7_spl
<=> is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X4),or(X4,X3))))) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f368,plain,
! [X0,X1,X2,X3] :
( ~ sQ7_spl
| is_a_theorem(or(X0,or(not(or(not(X1),X2)),or(not(X3),or(X3,X2))))) ),
inference(component_clause,[status(thm)],[f367]) ).
fof(f370,plain,
( sQ7_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f366,f50,f367]) ).
fof(f385,plain,
! [X0,X1,X2,X3] :
( ~ sQ7_spl
| is_a_theorem(or(not(or(not(X1),X2)),or(not(X3),or(X3,X2))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f368,f5]) ).
fof(f386,definition,
! [X1,X2,X3] :
( sQ8_spl
<=> is_a_theorem(or(not(or(not(X1),X2)),or(not(X3),or(X3,X2)))) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f387,plain,
! [X0,X1,X2] :
( ~ sQ8_spl
| is_a_theorem(or(not(or(not(X0),X1)),or(not(X2),or(X2,X1)))) ),
inference(component_clause,[status(thm)],[f386]) ).
fof(f389,plain,
( ~ sQ7_spl
| sQ8_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f385,f50,f386,f367]) ).
fof(f391,plain,
! [X0,X1,X2] :
( ~ sQ8_spl
| is_a_theorem(or(not(or(not(X0),X1)),or(not(X0),or(X2,X1)))) ),
inference(resolution,[status(thm)],[f387,f8]) ).
fof(f392,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ8_spl
| is_a_theorem(or(X3,or(X4,X2)))
| ~ is_a_theorem(or(not(or(not(X0),or(X0,X1))),X2)) ),
inference(resolution,[status(thm)],[f387,f232]) ).
fof(f459,definition,
! [X3,X4,X5,X6] :
( sQ10_spl
<=> is_a_theorem(or(X3,or(X4,or(not(X5),or(X5,X6))))) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f460,plain,
! [X0,X1,X2,X3] :
( ~ sQ10_spl
| is_a_theorem(or(X0,or(X1,or(not(X2),or(X2,X3))))) ),
inference(component_clause,[status(thm)],[f459]) ).
fof(f477,definition,
! [X1,X2] :
( sQ15_spl
<=> is_a_theorem(or(not(X1),or(X1,X2))) ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f478,plain,
! [X0,X1] :
( ~ sQ15_spl
| is_a_theorem(or(not(X0),or(X0,X1))) ),
inference(component_clause,[status(thm)],[f477]) ).
fof(f522,plain,
! [X0,X1,X2] :
( ~ sQ8_spl
| is_a_theorem(or(not(or(not(X0),X1)),or(not(X1),or(X2,X1)))) ),
inference(resolution,[status(thm)],[f391,f8]) ).
fof(f1234,definition,
! [X1,X2,X3] :
( sQ69_spl
<=> is_a_theorem(or(X1,or(not(X2),or(X3,X2)))) ),
introduced(definition,[new_symbols(definition,[sQ69_spl])],[split_symbol_definition]) ).
fof(f1235,plain,
! [X0,X1,X2] :
( ~ sQ69_spl
| is_a_theorem(or(X0,or(not(X1),or(X2,X1)))) ),
inference(component_clause,[status(thm)],[f1234]) ).
fof(f1267,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ8_spl
| is_a_theorem(or(X0,or(X1,or(not(or(X2,X3)),or(X4,or(X2,X3)))))) ),
inference(resolution,[status(thm)],[f392,f522]) ).
fof(f1764,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ8_spl
| is_a_theorem(or(X1,or(not(or(X2,X3)),or(X4,or(X2,X3)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f1267,f5]) ).
fof(f1769,definition,
! [X1,X2,X3,X4] :
( sQ99_spl
<=> is_a_theorem(or(X1,or(not(or(X2,X3)),or(X4,or(X2,X3))))) ),
introduced(definition,[new_symbols(definition,[sQ99_spl])],[split_symbol_definition]) ).
fof(f1770,plain,
! [X0,X1,X2,X3] :
( ~ sQ99_spl
| is_a_theorem(or(X0,or(not(or(X1,X2)),or(X3,or(X1,X2))))) ),
inference(component_clause,[status(thm)],[f1769]) ).
fof(f1772,plain,
( ~ sQ8_spl
| sQ99_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f1764,f50,f1769,f386]) ).
fof(f1818,plain,
! [X0,X1,X2,X3] :
( ~ sQ99_spl
| is_a_theorem(or(not(or(X1,X2)),or(X3,or(X1,X2))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f1770,f5]) ).
fof(f1820,definition,
! [X1,X2,X3] :
( sQ102_spl
<=> is_a_theorem(or(not(or(X1,X2)),or(X3,or(X1,X2)))) ),
introduced(definition,[new_symbols(definition,[sQ102_spl])],[split_symbol_definition]) ).
fof(f1821,plain,
! [X0,X1,X2] :
( ~ sQ102_spl
| is_a_theorem(or(not(or(X0,X1)),or(X2,or(X0,X1)))) ),
inference(component_clause,[status(thm)],[f1820]) ).
fof(f1823,plain,
( ~ sQ99_spl
| sQ102_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f1818,f50,f1820,f1769]) ).
fof(f1825,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ8_spl
| ~ sQ102_spl
| is_a_theorem(or(X0,or(X1,or(X2,or(not(X3),or(X3,X4)))))) ),
inference(resolution,[status(thm)],[f1821,f392]) ).
fof(f2062,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ8_spl
| ~ sQ102_spl
| is_a_theorem(or(X1,or(X2,or(not(X3),or(X3,X4)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f1825,f5]) ).
fof(f2068,plain,
( ~ sQ8_spl
| ~ sQ102_spl
| sQ10_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f2062,f50,f459,f1820,f386]) ).
fof(f2124,plain,
! [X0,X1,X2,X3] :
( ~ sQ10_spl
| is_a_theorem(or(X1,or(not(X2),or(X2,X3))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f460,f5]) ).
fof(f2126,definition,
! [X1,X2,X3] :
( sQ109_spl
<=> is_a_theorem(or(X1,or(not(X2),or(X2,X3)))) ),
introduced(definition,[new_symbols(definition,[sQ109_spl])],[split_symbol_definition]) ).
fof(f2127,plain,
! [X0,X1,X2] :
( ~ sQ109_spl
| is_a_theorem(or(X0,or(not(X1),or(X1,X2)))) ),
inference(component_clause,[status(thm)],[f2126]) ).
fof(f2129,plain,
( ~ sQ10_spl
| sQ109_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f2124,f50,f2126,f459]) ).
fof(f2150,plain,
! [X0,X1,X2] :
( ~ sQ109_spl
| is_a_theorem(or(not(X1),or(X1,X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f2127,f5]) ).
fof(f2152,plain,
( ~ sQ109_spl
| sQ15_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f2150,f50,f477,f2126]) ).
fof(f2161,plain,
! [X0,X1,X2,X3] :
( ~ sQ15_spl
| is_a_theorem(or(X3,or(X0,X2)))
| ~ is_a_theorem(or(not(or(not(X0),X1)),X2)) ),
inference(resolution,[status(thm)],[f478,f79]) ).
fof(f2345,plain,
! [X0,X1,X2,X3] :
( ~ sQ8_spl
| ~ sQ15_spl
| is_a_theorem(or(X0,or(X1,or(not(X2),or(X3,X2))))) ),
inference(resolution,[status(thm)],[f2161,f522]) ).
fof(f2565,plain,
! [X0,X1,X2,X3] :
( ~ sQ8_spl
| ~ sQ15_spl
| is_a_theorem(or(X1,or(not(X2),or(X3,X2))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f2345,f5]) ).
fof(f2568,plain,
( ~ sQ8_spl
| ~ sQ15_spl
| sQ69_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f2565,f50,f1234,f477,f386]) ).
fof(f2589,plain,
! [X0,X1,X2] :
( ~ sQ69_spl
| is_a_theorem(or(not(X1),or(X2,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f1235,f5]) ).
fof(f2591,definition,
! [X1,X2] :
( sQ121_spl
<=> is_a_theorem(or(not(X1),or(X2,X1))) ),
introduced(definition,[new_symbols(definition,[sQ121_spl])],[split_symbol_definition]) ).
fof(f2592,plain,
! [X0,X1] :
( ~ sQ121_spl
| is_a_theorem(or(not(X0),or(X1,X0))) ),
inference(component_clause,[status(thm)],[f2591]) ).
fof(f2594,plain,
( ~ sQ69_spl
| sQ121_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f2589,f50,f2591,f1234]) ).
fof(f2595,plain,
( ~ sQ121_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f7,f2592]) ).
fof(f2612,plain,
~ sQ121_spl,
inference(contradiction_clause,[status(thm)],[f2595]) ).
fof(f2613,plain,
$false,
inference(sat_refutation,[status(thm)],[f105,f370,f389,f1772,f1823,f2068,f2129,f2152,f2568,f2594,f2612]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 % Computer : n006.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Sun Sep 20 23:59:13 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.48 % Drodi V4.1.1
% 13.61/2.27 % Refutation found
% 13.61/2.27 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 13.61/2.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.65/2.33 % Elapsed time: 1.844007 seconds
% 1.65/2.33 % CPU time: 14.196583 seconds
% 1.65/2.33 % Total memory used: 232.188 MB
% 1.65/2.33 % Net memory used: 218.075 MB
%------------------------------------------------------------------------------