%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL384+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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:34 PM UTC 2026
% Result : Theorem 8.71s 1.74s
% Output : CNFRefutation 8.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 19 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 23 ~; 18 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 69 !; 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,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X] : is_a_theorem(implies(implies(not(X),X),X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,conjecture,
is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,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(f8,plain,
! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) ),
inference(miniscoping,[status(thm)],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f10,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f11,plain,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f12,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f13,plain,
~ is_a_theorem(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f25,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f10,f9]) ).
fof(f26,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)],[f25,f9]) ).
fof(f28,plain,
! [X0] :
( ~ is_a_theorem(implies(X0,implies(implies(not(z),y),implies(x,z))))
| ~ is_a_theorem(implies(implies(x,implies(y,z)),X0)) ),
inference(resolution,[status(thm)],[f26,f13]) ).
fof(f117,plain,
! [X0,X1,X2,X3] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),X3),implies(implies(X2,X0),X3))),
inference(resolution,[status(thm)],[f25,f10]) ).
fof(f118,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[status(thm)],[f25,f12]) ).
fof(f129,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(implies(not(X0),X1),X2)) ),
inference(resolution,[status(thm)],[f118,f9]) ).
fof(f151,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(not(X1),X1))) ),
inference(resolution,[status(thm)],[f26,f11]) ).
fof(f156,plain,
! [X0] : ~ is_a_theorem(implies(implies(implies(implies(y,z),X0),implies(x,X0)),implies(implies(not(z),y),implies(x,z)))),
inference(resolution,[status(thm)],[f28,f10]) ).
fof(f161,plain,
! [X0,X1,X2] : is_a_theorem(implies(X0,implies(implies(X1,X2),implies(not(X0),X2)))),
inference(resolution,[status(thm)],[f129,f10]) ).
fof(f313,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X1,X2),implies(not(X0),X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f161,f9]) ).
fof(f322,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(implies(X2,X0),X3))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3)) ),
inference(resolution,[status(thm)],[f117,f9]) ).
fof(f596,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(resolution,[status(thm)],[f129,f313]) ).
fof(f626,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X1),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[status(thm)],[f151,f25]) ).
fof(f636,plain,
! [X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f151,f596]) ).
fof(f641,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
inference(resolution,[status(thm)],[f636,f11]) ).
fof(f672,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(implies(X2,X0),X3))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3)) ),
inference(resolution,[status(thm)],[f117,f9]) ).
fof(f985,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(implies(not(X0),X0),X0),X1),X1)),
inference(resolution,[status(thm)],[f626,f641]) ).
fof(f2762,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X0,X1))),
inference(resolution,[status(thm)],[f322,f985]) ).
fof(f4366,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X1,X0),X0))),
inference(resolution,[status(thm)],[f672,f2762]) ).
fof(f7314,plain,
~ is_a_theorem(implies(implies(not(z),y),implies(implies(y,z),z))),
inference(resolution,[status(thm)],[f156,f25]) ).
fof(f7319,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f7314,f4366]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL384+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 00:29:35 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 8.71/1.74 % Refutation found
% 8.71/1.74 % SZS status Theorem for theBenchmark: Theorem is valid
% 8.71/1.74 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.92/1.78 % Elapsed time: 1.402112 seconds
% 0.92/1.78 % CPU time: 10.650251 seconds
% 0.92/1.78 % Total memory used: 139.722 MB
% 0.92/1.78 % Net memory used: 126.264 MB
%------------------------------------------------------------------------------