%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL082-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 : n007.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:45 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 22 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 57 !; 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,U] : is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),implies(U,X)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,plain,
! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y)) ) ),
inference(miniscoping,[status(thm)],[f1]) ).
fof(f5,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f6,plain,
! [X0,X1,X2,X3] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(implies(a,implies(b,a))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(implies(X2,X0),implies(X3,X0)))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(X3,X0))
| ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[f8,f5]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4] :
( is_a_theorem(implies(X4,implies(X1,X3)))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3))) ),
inference(resolution,[status(thm)],[f9,f6]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4] :
( ~ is_a_theorem(implies(implies(X1,X4),X2))
| is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[f9,f8]) ).
fof(f13,plain,
! [X0,X1,X2,X3,X4,X5] :
( is_a_theorem(implies(X5,implies(implies(X3,X1),implies(X4,X1))))
| ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X3,X1),implies(X4,X1)))) ),
inference(resolution,[status(thm)],[f11,f6]) ).
fof(f48,plain,
! [X0,X1,X2,X3] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1)))),
inference(resolution,[status(thm)],[f13,f6]) ).
fof(f65,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f48,f5]) ).
fof(f74,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(X1,implies(X2,implies(X3,X2))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f65,f10]) ).
fof(f86,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(implies(X2,implies(X3,X2)))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f74,f5]) ).
fof(f91,plain,
! [X0,X1] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f86,f7]) ).
fof(f95,plain,
! [X0] : ~ is_a_theorem(X0),
inference(backward_subsumption_resolution,[status(thm)],[f65,f91]) ).
fof(f102,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f6,f95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL082-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n007.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 00:01:50 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.12/0.36 % Drodi V4.1.1
% 0.12/0.40 % Refutation found
% 0.12/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.41 % Elapsed time: 0.056253 seconds
% 0.12/0.41 % CPU time: 0.217494 seconds
% 0.12/0.41 % Total memory used: 44.865 MB
% 0.12/0.41 % Net memory used: 44.219 MB
%------------------------------------------------------------------------------