%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL363-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n003.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:29 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.36s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 19 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,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,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(not(y),y),y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,plain,
! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) ),
inference(miniscoping,[status(thm)],[f1]) ).
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] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f9,plain,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f10,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f11,plain,
~ is_a_theorem(implies(x,implies(implies(not(y),y),y))),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f13,plain,
! [X0,X1] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f7,f10]) ).
fof(f14,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f8,f7]) ).
fof(f17,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)],[f14,f7]) ).
fof(f19,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(not(X1),X1))) ),
inference(resolution,[status(thm)],[f17,f9]) ).
fof(f21,plain,
! [X0,X1,X2,X3] :
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(X0,implies(X3,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[f17,f14]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ~ is_a_theorem(implies(X1,not(X0)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[f21,f10]) ).
fof(f90,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(not(X0),not(X1))) ),
inference(resolution,[status(thm)],[f57,f19]) ).
fof(f96,plain,
! [X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f90,f13]) ).
fof(f105,plain,
~ is_a_theorem(implies(implies(not(y),y),y)),
inference(resolution,[status(thm)],[f96,f11]) ).
fof(f112,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f105,f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL363-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.32 % Computer : n003.cluster.edu
% 0.07/0.32 % Model : x86_64 x86_64
% 0.07/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.32 % Memory : 8046.5625MB
% 0.07/0.32 % OS : Linux 6.8.0-71-generic
% 0.07/0.32 % CPULimit : 300
% 0.07/0.32 % WCLimit : 300
% 0.07/0.32 % DateTime : Mon Sep 21 00:25:30 UTC 2026
% 0.07/0.33 % CPUTime :
% 0.07/0.34 % Drodi V4.1.1
% 0.11/0.36 % Refutation found
% 0.11/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.40 % Elapsed time: 0.053836 seconds
% 0.11/0.40 % CPU time: 0.184666 seconds
% 0.11/0.40 % Total memory used: 56.619 MB
% 0.11/0.40 % Net memory used: 55.824 MB
%------------------------------------------------------------------------------