%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL066-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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:06:43 PM UTC 2026
% Result : Unsatisfiable 0.18s 5.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 12 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 16 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 43 ( 43 !; 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] : is_a_theorem(implies(X,implies(Y,X))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] : is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
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] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f9,plain,
! [X0,X1,X2] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f10,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f11,plain,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f12,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f7,f8]) ).
fof(f14,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[f9,f7]) ).
fof(f21,plain,
! [X0,X1,X2] : is_a_theorem(implies(X0,implies(implies(not(X1),not(X2)),implies(X2,X1)))),
inference(resolution,[status(thm)],[f10,f12]) ).
fof(f26,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[f14,f7]) ).
fof(f27,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(X3,implies(implies(X0,X1),implies(X0,X2))))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[f14,f12]) ).
fof(f41,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,implies(implies(X1,X0),X2))) ),
inference(resolution,[status(thm)],[f26,f8]) ).
fof(f42,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[status(thm)],[f41,f21]) ).
fof(f93,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(X1,implies(X0,X2)))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[status(thm)],[f27,f41]) ).
fof(f304,plain,
~ is_a_theorem(implies(not(a),implies(a,b))),
inference(resolution,[status(thm)],[f93,f11]) ).
fof(f311,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f304,f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL066-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/5.44 % Computer : n020.cluster.edu
% 0.18/5.44 % Model : x86_64 x86_64
% 0.18/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.44 % Memory : 8046.5625MB
% 0.18/5.44 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.45 % DateTime : Mon Sep 21 00:04:08 UTC 2026
% 0.18/5.45 % CPUTime :
% 0.18/5.45 % Drodi V4.1.1
% 0.18/5.49 % Refutation found
% 0.18/5.49 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.18/5.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.22/5.52 % Elapsed time: 0.058653 seconds
% 0.22/5.52 % CPU time: 0.263657 seconds
% 0.22/5.52 % Total memory used: 58.936 MB
% 0.22/5.52 % Net memory used: 57.937 MB
%------------------------------------------------------------------------------