%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL191-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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:04 PM UTC 2026
% Result : Unsatisfiable 144.53s 18.68s
% Output : CNFRefutation 118.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 57 ( 21 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 90 ( 48 ~; 42 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 126 ( 126 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] :
( ~ axiom(X)
| theorem(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] :
( ~ theorem(Y)
| ~ axiom(or(not(Y),X))
| theorem(X) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(p,or(q,r))),or(or(p,q),r))),
file('/export/starexec/sandbox/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(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f3]) ).
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(p,or(q,r))),or(or(p,q),r))),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f22,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f10,f17]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ~ theorem(or(not(or(X2,X0)),X1))
| theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f11,f19]) ).
fof(f26,plain,
! [X0,X1] :
( ~ theorem(X1)
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f11,f17]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ~ theorem(or(not(or(X1,X0)),X2))
| theorem(or(not(or(X0,X1)),X2)) ),
inference(resolution,[status(thm)],[f12,f19]) ).
fof(f30,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f12,f17]) ).
fof(f31,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[f12,f15]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( ~ theorem(or(not(or(X1,or(X0,X2))),X3))
| theorem(or(not(or(X0,or(X1,X2))),X3)) ),
inference(resolution,[status(thm)],[f13,f19]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f13,f17]) ).
fof(f36,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(f63,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[status(thm)],[f31,f25]) ).
fof(f66,plain,
~ theorem(or(not(or(q,or(p,r))),or(or(p,q),r))),
inference(resolution,[status(thm)],[f32,f20]) ).
fof(f67,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(or(or(X0,X2),X1)),X3))
| ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
inference(resolution,[status(thm)],[f32,f29]) ).
fof(f68,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(or(X0,X2)),X3))
| ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
inference(resolution,[status(thm)],[f32,f25]) ).
fof(f75,plain,
! [X0,X1,X2] :
( theorem(or(or(X0,X2),X1))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f33,f30]) ).
fof(f76,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X0,or(or(X0,X1),X1))) ),
inference(resolution,[status(thm)],[f33,f22]) ).
fof(f77,plain,
! [X0,X1,X2,X3] :
( theorem(or(X3,or(X1,or(X0,X2))))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f33,f26]) ).
fof(f104,plain,
! [X0,X1,X2] : theorem(or(not(or(X0,X1)),or(or(X1,X0),X2))),
inference(resolution,[status(thm)],[f63,f29]) ).
fof(f108,plain,
! [X0,X1,X2] :
( theorem(or(not(or(X0,X2)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f36,f29]) ).
fof(f185,plain,
! [X0,X1,X2,X3] :
( theorem(or(not(or(X2,X0)),X3))
| ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
inference(resolution,[status(thm)],[f68,f29]) ).
fof(f258,plain,
! [X0,X1,X2,X3] :
( theorem(or(X3,or(or(X0,X2),X1)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f75,f26]) ).
fof(f268,plain,
! [X0] :
( theorem(X0)
| ~ theorem(or(X0,or(or(X0,X0),X0))) ),
inference(resolution,[status(thm)],[f76,f22]) ).
fof(f361,plain,
! [X0,X1,X2] :
( theorem(or(or(X2,X1),not(or(X0,X2))))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f108,f30]) ).
fof(f399,plain,
! [X0,X1] :
( theorem(or(X1,X0))
| ~ theorem(or(or(X0,X1),or(or(or(X0,X1),or(X0,X1)),or(X0,X1)))) ),
inference(resolution,[status(thm)],[f268,f30]) ).
fof(f405,plain,
! [X0,X1,X2] : theorem(or(not(X0),or(or(X0,X1),X2))),
inference(resolution,[status(thm)],[f104,f25]) ).
fof(f637,plain,
! [X0] : ~ theorem(or(not(or(or(p,r),or(X0,q))),or(or(p,q),r))),
inference(resolution,[status(thm)],[f185,f66]) ).
fof(f1386,plain,
! [X0,X1,X2,X3] :
( theorem(or(X2,or(or(X3,X1),not(or(X0,X3)))))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f361,f26]) ).
fof(f2301,plain,
! [X0,X1] :
( ~ theorem(or(X1,or(or(or(X1,X0),or(X1,X0)),X0)))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f399,f77]) ).
fof(f3692,plain,
! [X0] : ~ theorem(or(not(or(p,or(or(X0,q),r))),or(or(p,q),r))),
inference(resolution,[status(thm)],[f637,f67]) ).
fof(f38107,plain,
! [X0,X1] :
( ~ theorem(or(or(X1,X0),or(X0,or(X1,X0))))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f2301,f258]) ).
fof(f43590,plain,
! [X0,X1] :
( ~ theorem(or(X1,or(X0,X0)))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f38107,f77]) ).
fof(f44376,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X0)))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f43590,f33]) ).
fof(f46035,plain,
! [X0,X1] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,or(or(X1,X1),X0))) ),
inference(resolution,[status(thm)],[f44376,f43590]) ).
fof(f51603,plain,
! [X0,X1] :
( ~ theorem(or(or(X0,X0),or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f46035,f33]) ).
fof(f56444,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(or(X1,X1),X0)))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f51603,f75]) ).
fof(f63548,plain,
! [X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X0,X1)),X1)) ),
inference(resolution,[status(thm)],[f56444,f1386]) ).
fof(f85017,plain,
~ theorem(or(not(p),or(or(p,q),r))),
inference(resolution,[status(thm)],[f3692,f63548]) ).
fof(f85070,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f85017,f405]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL191-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n008.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 : Mon Sep 21 00:10:54 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.35 % Drodi V4.1.1
% 144.53/18.68 % Refutation found
% 144.53/18.68 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 144.53/18.68 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 9.23/18.84 % Elapsed time: 18.472422 seconds
% 9.23/18.84 % CPU time: 146.054164 seconds
% 9.23/18.84 % Total memory used: 749.537 MB
% 9.23/18.84 % Net memory used: 699.228 MB
%------------------------------------------------------------------------------