%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL397-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 : 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:36 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 16 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 48 !; 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(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(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(f20,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[status(thm)],[f14,f10]) ).
fof(f73,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(implies(not(X0),X1),X2)) ),
inference(resolution,[status(thm)],[f20,f7]) ).
fof(f100,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[status(thm)],[f73,f9]) ).
fof(f108,plain,
! [X0,X1] : is_a_theorem(implies(not(implies(X0,X0)),X1)),
inference(resolution,[status(thm)],[f100,f13]) ).
fof(f112,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(implies(X2,X2)),X1))),
inference(resolution,[status(thm)],[f108,f14]) ).
fof(f160,plain,
! [X0,X1,X2] : is_a_theorem(implies(X0,implies(not(implies(X1,X1)),X2))),
inference(resolution,[status(thm)],[f112,f73]) ).
fof(f170,plain,
! [X0,X1,X2,X3] : is_a_theorem(implies(implies(implies(not(implies(X0,X0)),X1),X2),implies(X3,X2))),
inference(resolution,[status(thm)],[f160,f14]) ).
fof(f443,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(implies(not(implies(X0,X0)),X1),X2)) ),
inference(resolution,[status(thm)],[f170,f7]) ).
fof(f459,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1))),
inference(resolution,[status(thm)],[f443,f9]) ).
fof(f472,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f11,f459]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL397-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 00:31:36 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.39 % Drodi V4.1.1
% 0.14/0.41 % Refutation found
% 0.14/0.41 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.43 % Elapsed time: 0.047546 seconds
% 0.14/0.43 % CPU time: 0.159570 seconds
% 0.14/0.43 % Total memory used: 46.603 MB
% 0.14/0.43 % Net memory used: 45.955 MB
%------------------------------------------------------------------------------