%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL200-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 : 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:06 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 22 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 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 : 41 ( 41 !; 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(f3,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
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(not(or(p,q))),not(q))),
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(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[status(thm)],[f3]) ).
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(not(or(p,q))),not(q))),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f22,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[f10,f15]) ).
fof(f23,plain,
! [X0,X1] :
( ~ axiom(or(not(X0),or(X1,X1)))
| theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[f22,f19]) ).
fof(f35,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[status(thm)],[f11,f23]) ).
fof(f47,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f12,f17]) ).
fof(f49,plain,
~ theorem(or(not(q),not(not(or(p,q))))),
inference(resolution,[status(thm)],[f47,f20]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ~ axiom(or(not(X2),X1))
| theorem(or(not(X2),X0))
| ~ theorem(or(X0,not(X1))) ),
inference(resolution,[status(thm)],[f47,f19]) ).
fof(f126,plain,
! [X0,X1,X2] :
( theorem(or(not(X2),X0))
| ~ theorem(or(X0,not(or(X1,X2)))) ),
inference(resolution,[status(thm)],[f50,f11]) ).
fof(f141,plain,
! [X0,X1] : theorem(or(not(X0),not(not(or(X1,X0))))),
inference(resolution,[status(thm)],[f126,f35]) ).
fof(f146,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f49,f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL200-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n008.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 00:11:08 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.44 % Drodi V4.1.1
% 0.16/0.45 % Refutation found
% 0.16/0.45 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.53 % Elapsed time: 0.087362 seconds
% 0.16/0.53 % CPU time: 0.121462 seconds
% 0.16/0.53 % Total memory used: 11.096 MB
% 0.16/0.53 % Net memory used: 11.002 MB
%------------------------------------------------------------------------------