%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL107-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 : n013.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:49 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 18 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 20 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 8 ( 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 : 127 ( 127 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(equivalent(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z,U,V,W,V6] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(U,V),equivalent(equivalent(equivalent(W,V),equivalent(W,U)),V6))),equivalent(Z,equivalent(equivalent(Y,X),V6)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('/export/starexec/sandbox2/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,X4,X5,X6] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))),equivalent(X2,equivalent(equivalent(X1,X0),X6)))),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f7,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X0),X6)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6)))) ),
inference(resolution,[status(thm)],[f6,f5]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X2,X1),equivalent(X2,X0)),X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X4),equivalent(X6,X5))),X3))),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)),equivalent(equivalent(X1,X2),X7))),
inference(resolution,[status(thm)],[f9,f8]) ).
fof(f12,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)),equivalent(equivalent(equivalent(X8,X5),equivalent(X8,X6)),X7))),
inference(resolution,[status(thm)],[f10,f8]) ).
fof(f13,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( is_a_theorem(equivalent(equivalent(X1,X2),X7))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7))) ),
inference(resolution,[status(thm)],[f10,f5]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4)))),equivalent(X0,equivalent(X3,X4))),X5),X5)),
inference(resolution,[status(thm)],[f13,f10]) ).
fof(f18,plain,
! [X0,X1,X2,X3,X4,X5] :
( is_a_theorem(X5)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4)))),equivalent(X0,equivalent(X3,X4))),X5)) ),
inference(resolution,[status(thm)],[f14,f5]) ).
fof(f22,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X3,equivalent(X4,X0)),equivalent(X3,equivalent(X4,equivalent(X1,X5))))),equivalent(X2,X5))),
inference(resolution,[status(thm)],[f18,f14]) ).
fof(f24,plain,
! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4)))),equivalent(X0,equivalent(X1,X5))),equivalent(equivalent(X3,X4),X5))),
inference(resolution,[status(thm)],[f18,f6]) ).
fof(f33,plain,
! [X0,X1,X2,X3,X4,X5] :
( is_a_theorem(equivalent(X2,X5))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X3,equivalent(X4,X0)),equivalent(X3,equivalent(X4,equivalent(X1,X5)))))) ),
inference(resolution,[status(thm)],[f22,f5]) ).
fof(f36,plain,
! [X0,X1,X2,X3,X4,X5] :
( is_a_theorem(equivalent(equivalent(X3,X4),X5))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4)))),equivalent(X0,equivalent(X1,X5)))) ),
inference(resolution,[status(thm)],[f24,f5]) ).
fof(f67,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(equivalent(equivalent(X3,X1),equivalent(X3,X2)),X4))),X4)),
inference(resolution,[status(thm)],[f33,f9]) ).
fof(f76,plain,
! [X0,X1,X2,X3,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X3),equivalent(equivalent(X0,equivalent(equivalent(X4,X1),equivalent(X4,X2))),X3))),
inference(resolution,[status(thm)],[f36,f12]) ).
fof(f79,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
inference(resolution,[status(thm)],[f36,f67]) ).
fof(f83,plain,
! [X0,X1,X2] :
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2))) ),
inference(resolution,[status(thm)],[f79,f5]) ).
fof(f101,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[status(thm)],[f76,f83]) ).
fof(f107,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3))),
inference(resolution,[status(thm)],[f101,f8]) ).
fof(f108,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
inference(resolution,[status(thm)],[f101,f36]) ).
fof(f115,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X2,X1)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[f108,f5]) ).
fof(f124,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[f115,f5]) ).
fof(f127,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))) ),
inference(resolution,[status(thm)],[f124,f7]) ).
fof(f185,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(a,b)),equivalent(X0,c)),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(resolution,[status(thm)],[f127,f108]) ).
fof(f208,plain,
$false,
inference(resolution,[status(thm)],[f107,f185]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL107-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 00:04:22 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Drodi V4.1.1
% 0.10/0.46 % Refutation found
% 0.10/0.46 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.49 % Elapsed time: 0.113781 seconds
% 0.14/0.49 % CPU time: 0.623602 seconds
% 0.14/0.49 % Total memory used: 70.678 MB
% 0.14/0.49 % Net memory used: 70.168 MB
%------------------------------------------------------------------------------