%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL130-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n009.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:53 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.40s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 10 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 19 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 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(equivalent(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z,U] : is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))),X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,plain,
! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(X)
| ~ is_a_theorem(equivalent(X,Y)) ) ),
inference(miniscoping,[status(thm)],[f1]) ).
fof(f5,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f6,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),X0)),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3))))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2))),equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5))))),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f10,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
inference(resolution,[status(thm)],[f9,f8]) ).
fof(f12,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[f10,f5]) ).
fof(f14,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[f12,f5]) ).
fof(f15,plain,
! [X0] :
( ~ is_a_theorem(equivalent(X0,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X0,a)) ),
inference(resolution,[status(thm)],[f14,f7]) ).
fof(f22,plain,
! [X0,X1,X2] : ~ is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
inference(resolution,[status(thm)],[f15,f6]) ).
fof(f29,plain,
~ is_a_theorem(equivalent(a,a)),
inference(resolution,[status(thm)],[f22,f12]) ).
fof(f32,plain,
! [X0] :
( ~ is_a_theorem(equivalent(X0,a))
| ~ is_a_theorem(equivalent(X0,a)) ),
inference(resolution,[status(thm)],[f29,f14]) ).
fof(f34,plain,
! [X0] : ~ is_a_theorem(equivalent(X0,a)),
inference(duplicate_literals_removal,[status(thm)],[f32]) ).
fof(f35,plain,
$false,
inference(resolution,[status(thm)],[f34,f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL130-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n009.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 00:06:28 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.37 % Drodi V4.1.1
% 0.08/0.40 % Refutation found
% 0.08/0.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.08/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.08/0.43 % Elapsed time: 0.051939 seconds
% 0.08/0.43 % CPU time: 0.152298 seconds
% 0.08/0.43 % Total memory used: 56.190 MB
% 0.08/0.43 % Net memory used: 55.533 MB
%------------------------------------------------------------------------------