%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET585+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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:10:08 PM UTC 2026
% Result : Theorem 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 19 unt; 0 def)
% Number of atoms : 33 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 7 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 41 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C,D] :
( ( subset(C,D)
& subset(B,C) )
=> subset(B,D) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B,C] : subset(B,union(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [B,C] : subset(intersection(B,C),B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [B,C] : union(B,C) = union(C,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [B,C] : intersection(B,C) = intersection(C,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,conjecture,
! [B,C,D] : subset(intersection(B,C),union(B,D)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
~ ! [B,C,D] : subset(intersection(B,C),union(B,D)),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [B,C,D] :
( subset(B,D)
| ~ subset(C,D)
| ~ subset(B,C) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f14,plain,
! [B,D] :
( subset(B,D)
| ! [C] :
( ~ subset(C,D)
| ~ subset(B,C) ) ),
inference(miniscoping,[status(thm)],[f13]) ).
fof(f15,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f16,plain,
! [X0,X1] : subset(X0,union(X0,X1)),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f17,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f35,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f36,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f45,plain,
? [B,C,D] : ~ subset(intersection(B,C),union(B,D)),
inference(pre_NNF_transformation,[status(thm)],[f12]) ).
fof(f46,plain,
~ subset(intersection(sK2_skl,sK3_skl),union(sK2_skl,sK4_skl)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl,sK4_skl]),skolemize(B,sK2_skl),skolemize(C,sK3_skl),skolemize(D,sK4_skl)],[f45]) ).
fof(f47,plain,
~ subset(intersection(sK2_skl,sK3_skl),union(sK2_skl,sK4_skl)),
inference(cnf_transformation,[status(thm)],[f46]) ).
fof(f52,plain,
~ subset(intersection(sK2_skl,sK3_skl),union(sK4_skl,sK2_skl)),
inference(paramodulation,[status(thm)],[f35,f47]) ).
fof(f53,plain,
! [X0,X1] : subset(X0,union(X1,X0)),
inference(paramodulation,[status(thm)],[f35,f16]) ).
fof(f62,plain,
~ subset(intersection(sK3_skl,sK2_skl),union(sK4_skl,sK2_skl)),
inference(paramodulation,[status(thm)],[f36,f52]) ).
fof(f64,plain,
! [X0,X1] : subset(intersection(X0,X1),X1),
inference(paramodulation,[status(thm)],[f36,f17]) ).
fof(f80,plain,
! [X0,X1,X2] :
( subset(X0,union(X2,X1))
| ~ subset(X0,X1) ),
inference(resolution,[status(thm)],[f15,f53]) ).
fof(f152,plain,
~ subset(intersection(sK3_skl,sK2_skl),sK2_skl),
inference(resolution,[status(thm)],[f80,f62]) ).
fof(f159,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f152,f64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET585+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 05:28:17 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.14/0.38 % Drodi V4.1.1
% 0.14/0.38 % Refutation found
% 0.14/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.41 % Elapsed time: 0.034658 seconds
% 0.14/0.41 % CPU time: 0.068517 seconds
% 0.14/0.41 % Total memory used: 9.594 MB
% 0.14/0.41 % Net memory used: 9.572 MB
%------------------------------------------------------------------------------