%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL365+2 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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:30 PM UTC 2026
% Result : Theorem 28.61s 4.07s
% Output : CNFRefutation 28.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 19 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 23 ~; 17 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 141 ( 141 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( ( is_a_theorem(X)
& is_a_theorem(implies(X,Y)) )
=> is_a_theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B,C,D,E,F,G,H,I,J,K,L,M,N,O] : is_a_theorem(implies(implies(implies(implies(implies(A,implies(B,A)),implies(implies(C,implies(D,implies(E,D))),F)),F),implies(implies(implies(implies(implies(implies(implies(G,H),implies(implies(H,I),implies(G,I))),implies(implies(implies(n(J),J),J),K)),K),implies(implies(L,implies(n(L),M)),N)),N),O)),O)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,conjecture,
is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(n(z),y),u))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(n(z),y),u))),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f6,plain,
! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) ),
inference(miniscoping,[status(thm)],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14] : is_a_theorem(implies(implies(implies(implies(implies(X0,implies(X1,X0)),implies(implies(X2,implies(X3,implies(X4,X3))),X5)),X5),implies(implies(implies(implies(implies(implies(implies(X6,X7),implies(implies(X7,X8),implies(X6,X8))),implies(implies(implies(n(X9),X9),X9),X10)),X10),implies(implies(X11,implies(n(X11),X12)),X13)),X13),X14)),X14)),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f9,plain,
~ is_a_theorem(implies(implies(implies(x,implies(implies(y,z),z)),u),implies(implies(n(z),y),u))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11,X12,X13,X14] :
( is_a_theorem(X14)
| ~ is_a_theorem(implies(implies(implies(implies(X0,implies(X1,X0)),implies(implies(X2,implies(X3,implies(X4,X3))),X5)),X5),implies(implies(implies(implies(implies(implies(implies(X6,X7),implies(implies(X7,X8),implies(X6,X8))),implies(implies(implies(n(X9),X9),X9),X10)),X10),implies(implies(X11,implies(n(X11),X12)),X13)),X13),X14))) ),
inference(resolution,[status(thm)],[f8,f7]) ).
fof(f11,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[status(thm)],[f10,f8]) ).
fof(f12,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(X1,X0)),implies(implies(X2,implies(X3,implies(X4,X3))),X5)),X5)),
inference(resolution,[status(thm)],[f11,f10]) ).
fof(f13,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f11,f7]) ).
fof(f14,plain,
! [X0,X1,X2] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[status(thm)],[f12,f10]) ).
fof(f15,plain,
! [X0,X1,X2,X3,X4,X5] :
( is_a_theorem(X5)
| ~ is_a_theorem(implies(implies(X0,implies(X1,X0)),implies(implies(X2,implies(X3,implies(X4,X3))),X5))) ),
inference(resolution,[status(thm)],[f12,f7]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( is_a_theorem(X8)
| ~ is_a_theorem(implies(implies(implies(implies(implies(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),implies(implies(implies(n(X3),X3),X3),X4)),X4),implies(implies(X5,implies(n(X5),X6)),X7)),X7),X8)) ),
inference(resolution,[status(thm)],[f13,f10]) ).
fof(f19,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : is_a_theorem(implies(X0,implies(implies(implies(implies(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))),implies(implies(implies(n(X4),X4),X4),X5)),X5),implies(implies(X6,implies(n(X6),X7)),X8)),X8))),
inference(resolution,[status(thm)],[f14,f10]) ).
fof(f36,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] : is_a_theorem(implies(implies(implies(implies(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),implies(implies(implies(n(X3),X3),X3),X4)),X4),implies(implies(X5,implies(n(X5),X6)),X7)),X7)),
inference(resolution,[status(thm)],[f19,f16]) ).
fof(f54,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( is_a_theorem(X7)
| ~ is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),implies(implies(implies(n(X3),X3),X3),X4)),X4),implies(implies(X5,implies(n(X5),X6)),X7))) ),
inference(resolution,[status(thm)],[f36,f7]) ).
fof(f77,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),implies(implies(implies(n(X3),X3),X3),X4)),X4)),
inference(resolution,[status(thm)],[f54,f11]) ).
fof(f93,plain,
! [X0,X1,X2,X3] : is_a_theorem(implies(implies(implies(X0,implies(X1,X0)),X2),implies(X3,X2))),
inference(resolution,[status(thm)],[f77,f15]) ).
fof(f94,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(X4)
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),implies(implies(implies(n(X3),X3),X3),X4))) ),
inference(resolution,[status(thm)],[f77,f7]) ).
fof(f105,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(resolution,[status(thm)],[f93,f54]) ).
fof(f112,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(resolution,[status(thm)],[f94,f93]) ).
fof(f130,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f105,f7]) ).
fof(f150,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(implies(n(X0),X0),X0),X1),implies(X2,X1))),
inference(resolution,[status(thm)],[f112,f94]) ).
fof(f236,plain,
~ is_a_theorem(implies(implies(n(z),y),implies(x,implies(implies(y,z),z)))),
inference(resolution,[status(thm)],[f130,f9]) ).
fof(f242,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f130,f7]) ).
fof(f1021,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(X0,implies(implies(X2,X3),implies(X1,X3))))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[f242,f105]) ).
fof(f1065,plain,
! [X0] :
( ~ is_a_theorem(implies(X0,implies(x,implies(implies(y,z),z))))
| ~ is_a_theorem(implies(implies(n(z),y),X0)) ),
inference(resolution,[status(thm)],[f242,f236]) ).
fof(f1106,plain,
! [X0] : ~ is_a_theorem(implies(implies(n(z),y),implies(implies(implies(n(X0),X0),X0),implies(implies(y,z),z)))),
inference(resolution,[status(thm)],[f1065,f150]) ).
fof(f10485,plain,
~ is_a_theorem(implies(implies(n(z),y),implies(implies(y,z),implies(n(z),z)))),
inference(resolution,[status(thm)],[f1021,f1106]) ).
fof(f10561,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f10485,f105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL365+2 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.37 % Computer : n017.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 21 00:19:27 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.38 % Drodi V4.1.1
% 28.61/4.07 % Refutation found
% 28.61/4.07 % SZS status Theorem for theBenchmark: Theorem is valid
% 28.61/4.07 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 12.71/4.13 % Elapsed time: 3.742886 seconds
% 12.71/4.13 % CPU time: 29.139228 seconds
% 12.71/4.13 % Total memory used: 289.468 MB
% 12.71/4.13 % Net memory used: 274.482 MB
%------------------------------------------------------------------------------