%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL230-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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:07:14 PM UTC 2026
% Result : Unsatisfiable 0.13s 10.80s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 17 unt; 2 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 67 ( 34 ~; 31 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 66 ( 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] :
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( ~ theorem(Y)
| ~ axiom(or(not(Y),X))
| theorem(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Z,Y] :
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f13,plain,
! [X0,X1,X2] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f14,plain,
! [X0,X1,X2] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f15,plain,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f16,plain,
! [Y] :
( ~ theorem(Y)
| ! [X] :
( ~ axiom(or(not(Y),X))
| theorem(X) ) ),
inference(miniscoping,[status(thm)],[f7]) ).
fof(f17,plain,
! [X0,X1] :
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f18,plain,
! [Z,Y] :
( ~ theorem(or(not(Y),Z))
| ! [X] :
( ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f20,plain,
~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f21,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f10,f17]) ).
fof(f24,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[status(thm)],[f11,f15]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f13,f17]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ~ theorem(or(not(X1),X2))
| theorem(or(not(or(X0,X1)),or(X0,X2))) ),
inference(resolution,[status(thm)],[f14,f17]) ).
fof(f54,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[status(thm)],[f31,f24]) ).
fof(f60,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[status(thm)],[f54,f21]) ).
fof(f72,plain,
! [X0,X1,X2,X3] :
( ~ axiom(or(not(X2),or(X3,X0)))
| theorem(or(not(X2),or(X3,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f33,f19]) ).
fof(f73,plain,
! [X0,X1,X2] :
( theorem(or(X2,or(not(or(X2,X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f33,f31]) ).
fof(f162,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(or(X0,or(X3,X1))),or(X3,X2)))
| ~ theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[f72,f13]) ).
fof(f192,plain,
! [X0,X1,X2,X3] :
( ~ axiom(or(not(X2),X3))
| theorem(or(not(X2),or(not(or(not(X3),X0)),X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f73,f19]) ).
fof(f385,plain,
~ theorem(or(not(or(not(or(p,q)),r)),or(not(q),r))),
inference(resolution,[status(thm)],[f162,f20]) ).
fof(f410,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(or(not(X3),X0)),or(not(X2),X1)))
| ~ axiom(or(not(X2),X3))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f192,f31]) ).
fof(f999,plain,
( ~ axiom(or(not(q),or(p,q)))
| ~ theorem(or(not(r),r)) ),
inference(resolution,[status(thm)],[f410,f385]) ).
fof(f1006,definition,
( sQ2_spl
<=> theorem(or(not(r),r)) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f1008,plain,
( sQ2_spl
| ~ theorem(or(not(r),r)) ),
inference(component_clause,[status(thm)],[f1006]) ).
fof(f1009,definition,
( sQ3_spl
<=> axiom(or(not(q),or(p,q))) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f1011,plain,
( sQ3_spl
| ~ axiom(or(not(q),or(p,q))) ),
inference(component_clause,[status(thm)],[f1009]) ).
fof(f1012,plain,
( ~ sQ3_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f999,f1006,f1009]) ).
fof(f1021,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f1011,f11]) ).
fof(f1022,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f1021]) ).
fof(f1023,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f1008,f60]) ).
fof(f1024,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f1023]) ).
fof(f1025,plain,
$false,
inference(sat_refutation,[status(thm)],[f1012,f1022,f1024]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL230-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/10.37 % Computer : n009.cluster.edu
% 0.10/10.37 % Model : x86_64 x86_64
% 0.10/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.37 % Memory : 8046.5625MB
% 0.10/10.37 % OS : Linux 6.8.0-71-generic
% 0.10/10.37 % CPULimit : 300
% 0.10/10.37 % WCLimit : 300
% 0.10/10.37 % DateTime : Mon Sep 21 00:13:52 UTC 2026
% 0.10/10.37 % CPUTime :
% 0.10/10.38 % Drodi V4.1.1
% 0.13/10.80 % Refutation found
% 0.13/10.80 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/10.80 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/10.83 % Elapsed time: 0.440225 seconds
% 0.13/10.83 % CPU time: 3.335266 seconds
% 0.13/10.83 % Total memory used: 123.759 MB
% 0.13/10.83 % Net memory used: 119.354 MB
%------------------------------------------------------------------------------