%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN015-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/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 03:14:56 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 16
% Syntax : Number of formulae : 67 ( 12 unt; 0 def)
% Number of atoms : 193 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 191 ( 65 ~; 126 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 74 ( 74 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : equalish(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y] :
( equalish(Y,X)
| ~ equalish(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y,Z] :
( equalish(X,Z)
| ~ equalish(Y,Z)
| ~ equalish(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B,C] :
( element(C,B)
| ~ element(C,A)
| ~ equalish(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B,C] :
( element(C,B)
| ~ equalish(A,C)
| ~ element(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
! [A] :
( equalish(A,m)
| ~ element(A,m)
| ~ equalish(f(A),m) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
! [A] :
( equalish(A,m)
| ~ element(A,m)
| ~ equalish(f(A),A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
! [A] :
( equalish(A,m)
| ~ element(A,m)
| element(A,f(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
! [A,B] :
( equalish(B,m)
| element(B,m)
| equalish(A,m)
| equalish(A,B)
| ~ element(B,A)
| ~ element(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,negated_conjecture,
! [A] :
( equalish(A,n)
| element(A,n)
| ~ equalish(g(A),A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
! [A] :
( equalish(A,n)
| element(A,n)
| element(A,g(A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
! [A] :
( equalish(A,n)
| element(A,n)
| element(g(A),A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,negated_conjecture,
! [A] :
( equalish(A,k)
| element(A,k)
| ~ equalish(A,n) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
! [A] :
( equalish(A,k)
| equalish(A,m)
| equalish(A,n)
| ~ element(A,k) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f23,negated_conjecture,
~ equalish(n,k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f26,negated_conjecture,
equalish(m,k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f27,plain,
! [X0] : equalish(X0,X0),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f28,plain,
! [X0,X1] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f29,plain,
! [X,Z] :
( equalish(X,Z)
| ! [Y] :
( ~ equalish(Y,Z)
| ~ equalish(X,Y) ) ),
inference(miniscoping,[status(thm)],[f3]) ).
fof(f30,plain,
! [X0,X1,X2] :
( equalish(X0,X2)
| ~ equalish(X1,X2)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f29]) ).
fof(f31,plain,
! [B,C] :
( element(C,B)
| ! [A] :
( ~ element(C,A)
| ~ equalish(A,B) ) ),
inference(miniscoping,[status(thm)],[f4]) ).
fof(f32,plain,
! [X0,X1,X2] :
( element(X2,X1)
| ~ element(X2,X0)
| ~ equalish(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
fof(f33,plain,
! [B,C] :
( element(C,B)
| ! [A] :
( ~ equalish(A,C)
| ~ element(A,B) ) ),
inference(miniscoping,[status(thm)],[f5]) ).
fof(f34,plain,
! [X0,X1,X2] :
( element(X2,X1)
| ~ equalish(X0,X2)
| ~ element(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f37,plain,
! [X0] :
( equalish(X0,m)
| ~ element(X0,m)
| ~ equalish(f(X0),m) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f38,plain,
! [X0] :
( equalish(X0,m)
| ~ element(X0,m)
| ~ equalish(f(X0),X0) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f39,plain,
! [X0] :
( equalish(X0,m)
| ~ element(X0,m)
| element(X0,f(X0)) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f41,plain,
! [B] :
( equalish(B,m)
| element(B,m)
| ! [A] :
( equalish(A,m)
| equalish(A,B)
| ~ element(B,A)
| ~ element(A,B) ) ),
inference(miniscoping,[status(thm)],[f12]) ).
fof(f42,plain,
! [X0,X1] :
( equalish(X1,m)
| element(X1,m)
| equalish(X0,m)
| equalish(X0,X1)
| ~ element(X1,X0)
| ~ element(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f41]) ).
fof(f44,plain,
! [X0] :
( equalish(X0,n)
| element(X0,n)
| ~ equalish(g(X0),X0) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f45,plain,
! [X0] :
( equalish(X0,n)
| element(X0,n)
| element(X0,g(X0)) ),
inference(cnf_transformation,[status(thm)],[f15]) ).
fof(f46,plain,
! [X0] :
( equalish(X0,n)
| element(X0,n)
| element(g(X0),X0) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f50,plain,
! [X0] :
( equalish(X0,k)
| element(X0,k)
| ~ equalish(X0,n) ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f51,plain,
! [X0] :
( equalish(X0,k)
| equalish(X0,m)
| equalish(X0,n)
| ~ element(X0,k) ),
inference(cnf_transformation,[status(thm)],[f20]) ).
fof(f54,plain,
~ equalish(n,k),
inference(cnf_transformation,[status(thm)],[f23]) ).
fof(f57,plain,
equalish(m,k),
inference(cnf_transformation,[status(thm)],[f26]) ).
fof(f63,plain,
! [X0] :
( equalish(X0,k)
| ~ equalish(X0,m) ),
inference(resolution,[status(thm)],[f57,f30]) ).
fof(f64,plain,
equalish(k,m),
inference(resolution,[status(thm)],[f57,f28]) ).
fof(f75,plain,
! [X0,X1] :
( equalish(X1,m)
| element(X1,m)
| equalish(X0,X1)
| ~ element(X1,X0)
| ~ element(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f42,f32]) ).
fof(f83,plain,
! [X0] :
( equalish(X0,m)
| ~ equalish(X0,k) ),
inference(resolution,[status(thm)],[f64,f30]) ).
fof(f87,plain,
( equalish(n,k)
| element(n,k) ),
inference(resolution,[status(thm)],[f50,f27]) ).
fof(f88,plain,
element(n,k),
inference(forward_subsumption_resolution,[status(thm)],[f87,f54]) ).
fof(f91,plain,
! [X0] :
( element(n,X0)
| ~ equalish(k,X0) ),
inference(resolution,[status(thm)],[f88,f32]) ).
fof(f93,plain,
element(n,m),
inference(resolution,[status(thm)],[f91,f64]) ).
fof(f95,plain,
! [X0] :
( equalish(X0,m)
| element(X0,m)
| equalish(g(X0),X0)
| ~ element(g(X0),X0)
| equalish(X0,n)
| element(X0,n) ),
inference(resolution,[status(thm)],[f45,f75]) ).
fof(f98,plain,
! [X0] :
( equalish(X0,m)
| element(X0,m)
| ~ element(g(X0),X0)
| equalish(X0,n)
| element(X0,n) ),
inference(forward_subsumption_resolution,[status(thm)],[f95,f44]) ).
fof(f104,plain,
( equalish(n,m)
| element(n,f(n)) ),
inference(resolution,[status(thm)],[f93,f39]) ).
fof(f105,plain,
( equalish(n,m)
| ~ equalish(f(n),n) ),
inference(resolution,[status(thm)],[f93,f38]) ).
fof(f107,plain,
! [X0] :
( element(X0,m)
| ~ equalish(n,X0) ),
inference(resolution,[status(thm)],[f93,f34]) ).
fof(f127,plain,
! [X0] :
( equalish(X0,k)
| equalish(X0,n)
| ~ element(X0,k) ),
inference(forward_subsumption_resolution,[status(thm)],[f51,f63]) ).
fof(f129,plain,
! [X0] :
( equalish(X0,m)
| element(X0,m)
| equalish(X0,n)
| element(X0,n) ),
inference(forward_subsumption_resolution,[status(thm)],[f98,f46]) ).
fof(f131,plain,
! [X0] :
( equalish(X0,m)
| element(X0,m)
| equalish(n,X0)
| ~ element(n,X0)
| equalish(X0,m)
| element(X0,m)
| equalish(X0,n) ),
inference(resolution,[status(thm)],[f129,f75]) ).
fof(f135,plain,
! [X0] :
( equalish(n,X0)
| ~ element(n,X0)
| equalish(X0,m)
| element(X0,m)
| equalish(X0,n) ),
inference(duplicate_literals_removal,[status(thm)],[f131]) ).
fof(f136,plain,
! [X0] :
( equalish(n,X0)
| ~ element(n,X0)
| equalish(X0,m)
| element(X0,m) ),
inference(forward_subsumption_resolution,[status(thm)],[f135,f28]) ).
fof(f185,plain,
! [X0] :
( ~ element(n,X0)
| equalish(X0,m)
| element(X0,m) ),
inference(forward_subsumption_resolution,[status(thm)],[f136,f107]) ).
fof(f191,plain,
! [X0,X1] :
( element(X0,X1)
| ~ equalish(m,X1)
| ~ element(n,X0)
| equalish(X0,m) ),
inference(resolution,[status(thm)],[f185,f32]) ).
fof(f217,plain,
! [X0] :
( element(X0,k)
| ~ element(n,X0)
| equalish(X0,m) ),
inference(resolution,[status(thm)],[f191,f57]) ).
fof(f223,plain,
! [X0] :
( equalish(X0,k)
| equalish(X0,n)
| ~ element(n,X0)
| equalish(X0,m) ),
inference(resolution,[status(thm)],[f217,f127]) ).
fof(f227,plain,
! [X0] :
( equalish(X0,k)
| equalish(X0,n)
| ~ element(n,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f223,f63]) ).
fof(f229,plain,
( equalish(n,m)
| equalish(f(n),k)
| equalish(f(n),n) ),
inference(resolution,[status(thm)],[f227,f104]) ).
fof(f239,plain,
( equalish(n,m)
| equalish(f(n),k) ),
inference(forward_subsumption_resolution,[status(thm)],[f229,f105]) ).
fof(f246,plain,
( equalish(f(n),m)
| equalish(n,m) ),
inference(resolution,[status(thm)],[f239,f83]) ).
fof(f269,plain,
( equalish(n,m)
| ~ element(n,m)
| equalish(n,m) ),
inference(resolution,[status(thm)],[f246,f37]) ).
fof(f280,plain,
( ~ element(n,m)
| equalish(n,m) ),
inference(duplicate_literals_removal,[status(thm)],[f269]) ).
fof(f281,plain,
equalish(n,m),
inference(forward_subsumption_resolution,[status(thm)],[f280,f93]) ).
fof(f291,plain,
equalish(n,k),
inference(resolution,[status(thm)],[f281,f63]) ).
fof(f299,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f291,f54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN015-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.34 % Computer : n007.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Mon Sep 21 10:37:35 UTC 2026
% 0.10/0.34 % CPUTime :
% 0.10/0.35 % 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.42 % Elapsed time: 0.071063 seconds
% 0.12/0.42 % CPU time: 0.311701 seconds
% 0.12/0.42 % Total memory used: 20.038 MB
% 0.12/0.42 % Net memory used: 19.446 MB
%------------------------------------------------------------------------------