%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL198-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 : n007.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:06 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.59s
% Output : CNFRefutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 18 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 61 ( 33 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 73 ( 73 !; 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(not(p),or(not(p),q))),or(not(p),q))),
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(not(p),or(not(p),q))),or(not(p),q))),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f21,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[status(thm)],[f10,f17]) ).
fof(f36,plain,
! [X0,X1] :
( ~ theorem(X1)
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f11,f17]) ).
fof(f48,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f12,f17]) ).
fof(f49,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[status(thm)],[f12,f15]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ~ axiom(or(not(X2),X1))
| theorem(or(not(X2),X0))
| ~ theorem(or(X0,not(X1))) ),
inference(resolution,[status(thm)],[f48,f19]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ~ axiom(or(not(X0),or(X2,X1)))
| theorem(or(not(X0),or(X1,X2))) ),
inference(resolution,[status(thm)],[f49,f19]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[f13,f17]) ).
fof(f65,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(f69,plain,
! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(or(X0,or(or(X0,X1),X1))) ),
inference(resolution,[status(thm)],[f63,f21]) ).
fof(f81,plain,
! [X0,X1] :
( ~ theorem(or(or(X0,X1),X1))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f69,f36]) ).
fof(f83,plain,
! [X0,X1] :
( ~ theorem(or(X1,or(X0,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f81,f48]) ).
fof(f86,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f83,f63]) ).
fof(f125,plain,
! [X0,X1] :
( theorem(or(not(or(X1,X0)),X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f65,f86]) ).
fof(f164,plain,
! [X0,X1,X2] :
( theorem(or(not(or(X2,X1)),X0))
| ~ theorem(or(X0,not(or(X1,X2)))) ),
inference(resolution,[status(thm)],[f52,f12]) ).
fof(f171,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[status(thm)],[f56,f11]) ).
fof(f482,plain,
~ theorem(or(or(not(p),q),not(or(or(not(p),q),not(p))))),
inference(resolution,[status(thm)],[f164,f20]) ).
fof(f820,plain,
~ theorem(or(not(or(or(not(p),q),not(p))),or(not(p),q))),
inference(resolution,[status(thm)],[f482,f48]) ).
fof(f1394,plain,
~ theorem(or(not(not(p)),or(not(p),q))),
inference(resolution,[status(thm)],[f820,f125]) ).
fof(f1405,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f1394,f171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL198-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 : n007.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:08:35 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 % Drodi V4.1.1
% 0.14/0.59 % Refutation found
% 0.14/0.59 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.59 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.34/0.60 % Elapsed time: 0.244913 seconds
% 1.34/0.60 % CPU time: 1.667782 seconds
% 1.34/0.60 % Total memory used: 94.541 MB
% 1.34/0.60 % Net memory used: 92.055 MB
%------------------------------------------------------------------------------