%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL126-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 : n001.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.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 11 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 47 !; 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(f3,axiom,
! [X,Y,Z] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,plain,
! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(X)
| ~ is_a_theorem(equivalent(X,Y)) ) ),
inference(miniscoping,[status(thm)],[f1]) ).
fof(f6,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f8,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f9,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f11,plain,
! [X0,X1,X2] :
( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[f8,f6]) ).
fof(f14,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(equivalent(X0,X3),equivalent(X1,X3)),X2))),
inference(resolution,[status(thm)],[f11,f8]) ).
fof(f17,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X3),equivalent(X1,X3)),X2))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[status(thm)],[f14,f6]) ).
fof(f28,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),equivalent(equivalent(X0,X3),equivalent(X2,X3)))),
inference(resolution,[status(thm)],[f17,f8]) ).
fof(f43,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(equivalent(equivalent(X0,X3),equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1))) ),
inference(resolution,[status(thm)],[f28,f6]) ).
fof(f45,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X0,X1),X2))),
inference(resolution,[status(thm)],[f43,f28]) ).
fof(f50,plain,
! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X3,X2)),equivalent(equivalent(X0,X1),X3))),
inference(resolution,[status(thm)],[f45,f17]) ).
fof(f64,plain,
! [X0,X1,X2,X3] :
( is_a_theorem(equivalent(equivalent(X0,X1),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X3,X2))) ),
inference(resolution,[status(thm)],[f50,f6]) ).
fof(f67,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(resolution,[status(thm)],[f64,f28]) ).
fof(f74,plain,
! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),equivalent(X0,X2))),
inference(resolution,[status(thm)],[f67,f17]) ).
fof(f85,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f9,f74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL126-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 % Computer : n001.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 00:11:58 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.47 % Drodi V4.1.1
% 0.18/0.50 % Refutation found
% 0.18/0.50 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.18/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.24/0.52 % Elapsed time: 0.058017 seconds
% 0.24/0.52 % CPU time: 0.166313 seconds
% 0.24/0.52 % Total memory used: 41.853 MB
% 0.24/0.52 % Net memory used: 41.343 MB
%------------------------------------------------------------------------------