%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SEU268+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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 02:19:58 PM UTC 2026
% Result : Theorem 75.27s 9.95s
% Output : CNFRefutation 75.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 160 ( 27 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 204 ( 81 ~; 82 |; 30 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 73 ( 67 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [A,B] :
( A = B
<=> ( subset(B,A)
& subset(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f34,axiom,
! [A,B] :
( relation(B)
=> ( B = inclusion_relation(A)
<=> ( ! [C,D] :
( ( in(D,A)
& in(C,A) )
=> ( in(ordered_pair(C,D),B)
<=> subset(C,D) ) )
& relation_field(B) = A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f86,axiom,
! [A] : relation(inclusion_relation(A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f157,lemma,
! [A] :
( relation(A)
=> ( reflexive(A)
<=> ! [B] :
( in(B,relation_field(A))
=> in(ordered_pair(B,B),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f259,conjecture,
! [A] : reflexive(inclusion_relation(A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f260,negated_conjecture,
~ ! [A] : reflexive(inclusion_relation(A)),
inference(negated_conjecture,[status(cth)],[f259]) ).
fof(f386,plain,
! [A,B] :
( ( ~ subset(B,A)
| ~ subset(A,B)
| A = B )
& ( ( subset(B,A)
& subset(A,B) )
| A != B ) ),
inference(NNF_transformation,[status(thm)],[f15]) ).
fof(f387,plain,
( ! [A,B] :
( ~ subset(B,A)
| ~ subset(A,B)
| A = B )
& ! [A,B] :
( ( subset(B,A)
& subset(A,B) )
| A != B ) ),
inference(miniscoping,[status(thm)],[f386]) ).
fof(f388,plain,
! [X0,X1] :
( subset(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(thm)],[f387]) ).
fof(f528,plain,
! [A,B] :
( ( B = inclusion_relation(A)
<=> ( ! [C,D] :
( ( in(ordered_pair(C,D),B)
<=> subset(C,D) )
| ~ in(D,A)
| ~ in(C,A) )
& relation_field(B) = A ) )
| ~ relation(B) ),
inference(pre_NNF_transformation,[status(thm)],[f34]) ).
fof(f529,plain,
! [A,B] :
( ( ( ? [C,D] :
( ( subset(C,D)
| in(ordered_pair(C,D),B) )
& ( ~ subset(C,D)
| ~ in(ordered_pair(C,D),B) )
& in(D,A)
& in(C,A) )
| relation_field(B) != A
| B = inclusion_relation(A) )
& ( ( ! [C,D] :
( ( ( ~ subset(C,D)
| in(ordered_pair(C,D),B) )
& ( subset(C,D)
| ~ in(ordered_pair(C,D),B) ) )
| ~ in(D,A)
| ~ in(C,A) )
& relation_field(B) = A )
| B != inclusion_relation(A) ) )
| ~ relation(B) ),
inference(NNF_transformation,[status(thm)],[f528]) ).
fof(f530,plain,
! [B] :
( ( ! [A] :
( ? [C,D] :
( ( subset(C,D)
| in(ordered_pair(C,D),B) )
& ( ~ subset(C,D)
| ~ in(ordered_pair(C,D),B) )
& in(D,A)
& in(C,A) )
| relation_field(B) != A
| B = inclusion_relation(A) )
& ! [A] :
( ( ! [C,D] :
( ( ( ~ subset(C,D)
| in(ordered_pair(C,D),B) )
& ( subset(C,D)
| ~ in(ordered_pair(C,D),B) ) )
| ~ in(D,A)
| ~ in(C,A) )
& relation_field(B) = A )
| B != inclusion_relation(A) ) )
| ~ relation(B) ),
inference(miniscoping,[status(thm)],[f529]) ).
fof(f531,plain,
! [B] :
( ( ! [A] :
( ( ( subset(sK28_skl(A,B),sK29_skl(A,B))
| in(ordered_pair(sK28_skl(A,B),sK29_skl(A,B)),B) )
& ( ~ subset(sK28_skl(A,B),sK29_skl(A,B))
| ~ in(ordered_pair(sK28_skl(A,B),sK29_skl(A,B)),B) )
& in(sK29_skl(A,B),A)
& in(sK28_skl(A,B),A) )
| relation_field(B) != A
| B = inclusion_relation(A) )
& ! [A] :
( ( ! [C,D] :
( ( ( ~ subset(C,D)
| in(ordered_pair(C,D),B) )
& ( subset(C,D)
| ~ in(ordered_pair(C,D),B) ) )
| ~ in(D,A)
| ~ in(C,A) )
& relation_field(B) = A )
| B != inclusion_relation(A) ) )
| ~ relation(B) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK28_skl,sK29_skl]),skolemize(C,sK28_skl(A,B)),skolemize(D,sK29_skl(A,B))],[f530]) ).
fof(f532,plain,
! [X0,X1] :
( relation_field(X0) = X1
| X0 != inclusion_relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[status(thm)],[f531]) ).
fof(f534,plain,
! [X0,X1,X2,X3] :
( ~ subset(X2,X3)
| in(ordered_pair(X2,X3),X0)
| ~ in(X3,X1)
| ~ in(X2,X1)
| X0 != inclusion_relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[status(thm)],[f531]) ).
fof(f834,plain,
! [X0] : relation(inclusion_relation(X0)),
inference(cnf_transformation,[status(thm)],[f86]) ).
fof(f969,plain,
! [A] :
( ( reflexive(A)
<=> ! [B] :
( in(ordered_pair(B,B),A)
| ~ in(B,relation_field(A)) ) )
| ~ relation(A) ),
inference(pre_NNF_transformation,[status(thm)],[f157]) ).
fof(f970,plain,
! [A] :
( ( ( ? [B] :
( ~ in(ordered_pair(B,B),A)
& in(B,relation_field(A)) )
| reflexive(A) )
& ( ! [B] :
( in(ordered_pair(B,B),A)
| ~ in(B,relation_field(A)) )
| ~ reflexive(A) ) )
| ~ relation(A) ),
inference(NNF_transformation,[status(thm)],[f969]) ).
fof(f971,plain,
! [A] :
( ( ( ( ~ in(ordered_pair(sK88_skl(A),sK88_skl(A)),A)
& in(sK88_skl(A),relation_field(A)) )
| reflexive(A) )
& ( ! [B] :
( in(ordered_pair(B,B),A)
| ~ in(B,relation_field(A)) )
| ~ reflexive(A) ) )
| ~ relation(A) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK88_skl]),skolemize(B,sK88_skl(A))],[f970]) ).
fof(f973,plain,
! [X0] :
( in(sK88_skl(X0),relation_field(X0))
| reflexive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[status(thm)],[f971]) ).
fof(f974,plain,
! [X0] :
( ~ in(ordered_pair(sK88_skl(X0),sK88_skl(X0)),X0)
| reflexive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[status(thm)],[f971]) ).
fof(f1317,plain,
? [A] : ~ reflexive(inclusion_relation(A)),
inference(pre_NNF_transformation,[status(thm)],[f260]) ).
fof(f1318,plain,
~ reflexive(inclusion_relation(sK119_skl)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK119_skl]),skolemize(A,sK119_skl)],[f1317]) ).
fof(f1319,plain,
~ reflexive(inclusion_relation(sK119_skl)),
inference(cnf_transformation,[status(thm)],[f1318]) ).
fof(f1648,plain,
! [X0] : subset(X0,X0),
inference(destructive_equality_resolution,[status(thm)],[f388]) ).
fof(f1682,plain,
! [X0] :
( relation_field(inclusion_relation(X0)) = X0
| ~ relation(inclusion_relation(X0)) ),
inference(destructive_equality_resolution,[status(thm)],[f532]) ).
fof(f1684,plain,
! [X0,X1,X2] :
( ~ subset(X1,X2)
| in(ordered_pair(X1,X2),inclusion_relation(X0))
| ~ in(X2,X0)
| ~ in(X1,X0)
| ~ relation(inclusion_relation(X0)) ),
inference(destructive_equality_resolution,[status(thm)],[f534]) ).
fof(f1754,plain,
! [X0] : relation_field(inclusion_relation(X0)) = X0,
inference(forward_subsumption_resolution,[status(thm)],[f1682,f834]) ).
fof(f1756,plain,
! [X0,X1,X2] :
( ~ subset(X0,X2)
| in(ordered_pair(X0,X2),inclusion_relation(X1))
| ~ in(X2,X1)
| ~ in(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f1684,f834]) ).
fof(f29279,plain,
! [X0] :
( in(sK88_skl(inclusion_relation(X0)),X0)
| reflexive(inclusion_relation(X0))
| ~ relation(inclusion_relation(X0)) ),
inference(paramodulation,[status(thm)],[f1754,f973]) ).
fof(f29285,plain,
! [X0] :
( in(sK88_skl(inclusion_relation(X0)),X0)
| reflexive(inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f29279,f834]) ).
fof(f29290,plain,
! [X0] :
( ~ subset(sK88_skl(inclusion_relation(X0)),sK88_skl(inclusion_relation(X0)))
| ~ in(sK88_skl(inclusion_relation(X0)),X0)
| ~ in(sK88_skl(inclusion_relation(X0)),X0)
| reflexive(inclusion_relation(X0))
| ~ relation(inclusion_relation(X0)) ),
inference(resolution,[status(thm)],[f974,f1756]) ).
fof(f29302,plain,
! [X0] :
( ~ subset(sK88_skl(inclusion_relation(X0)),sK88_skl(inclusion_relation(X0)))
| ~ in(sK88_skl(inclusion_relation(X0)),X0)
| reflexive(inclusion_relation(X0))
| ~ relation(inclusion_relation(X0)) ),
inference(duplicate_literals_removal,[status(thm)],[f29290]) ).
fof(f29303,plain,
! [X0] :
( ~ subset(sK88_skl(inclusion_relation(X0)),sK88_skl(inclusion_relation(X0)))
| ~ in(sK88_skl(inclusion_relation(X0)),X0)
| reflexive(inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f29302,f834]) ).
fof(f29571,plain,
! [X0] :
( ~ subset(sK88_skl(inclusion_relation(X0)),sK88_skl(inclusion_relation(X0)))
| reflexive(inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f29303,f29285]) ).
fof(f29572,plain,
~ subset(sK88_skl(inclusion_relation(sK119_skl)),sK88_skl(inclusion_relation(sK119_skl))),
inference(resolution,[status(thm)],[f29571,f1319]) ).
fof(f29578,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f29572,f1648]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU268+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n018.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 21 06:07:43 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.39 % Drodi V4.1.1
% 75.27/9.95 % Refutation found
% 75.27/9.95 % SZS status Theorem for theBenchmark: Theorem is valid
% 75.27/9.95 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 4.94/10.06 % Elapsed time: 9.683433 seconds
% 4.94/10.06 % CPU time: 76.210155 seconds
% 4.94/10.06 % Total memory used: 670.541 MB
% 4.94/10.06 % Net memory used: 631.978 MB
%------------------------------------------------------------------------------