%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : SET199+3 : TPTP v9.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Jul 25 03:31:47 PM UTC 2025
% Result : Theorem 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 38 ( 15 ~; 15 |; 3 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_intersection_of_subsets,plain,
! [B,C,D] :
( ( subset(B,C)
& subset(B,D) )
=> subset(B,intersection(C,D)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_of_subsets) ).
fof(prove_intersection_of_subsets_negated,plain,
~ ! [B,C,D] :
( ( subset(B,C)
& subset(B,D) )
=> subset(B,intersection(C,D)) ),
inference(negate_conjecture,[status(cth)],[prove_intersection_of_subsets]) ).
cnf(16,plain,
~ subset(sK3,intersection(sK4,sK5)),
inference(cnf,[status(esa)],[prove_intersection_of_subsets_negated]) ).
cnf(l0,plain,
~ subset(sK3,intersection(sK4,sK5)),
inference(instantiation,[status(thm)],[16]) ).
fof(subset_defn,plain,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
cnf(5,plain,
( ~ member(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf,[status(esa)],[subset_defn]) ).
cnf(l1,plain,
( ~ member(sK1(sK3,intersection(sK4,sK5)),intersection(sK4,sK5))
| subset(sK3,intersection(sK4,sK5)) ),
inference(instantiation,[status(thm)],[5]) ).
fof(intersection_defn,plain,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
cnf(2,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(cnf,[status(esa)],[intersection_defn]) ).
cnf(l2,plain,
( ~ member(sK1(sK3,intersection(sK4,sK5)),sK4)
| ~ member(sK1(sK3,intersection(sK4,sK5)),sK5)
| member(sK1(sK3,intersection(sK4,sK5)),intersection(sK4,sK5)) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(3,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf,[status(esa)],[subset_defn]) ).
cnf(l38,plain,
( ~ subset(sK3,sK5)
| ~ member(sK1(sK3,intersection(sK4,sK5)),sK3)
| member(sK1(sK3,intersection(sK4,sK5)),sK5) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(15,plain,
subset(sK3,sK5),
inference(cnf,[status(esa)],[prove_intersection_of_subsets_negated]) ).
cnf(l66,plain,
subset(sK3,sK5),
inference(instantiation,[status(thm)],[15]) ).
cnf(l10,plain,
( ~ subset(sK3,sK4)
| ~ member(sK1(sK3,intersection(sK4,sK5)),sK3)
| member(sK1(sK3,intersection(sK4,sK5)),sK4) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(4,plain,
( subset(X0,X1)
| member(sK1(X0,X1),X0) ),
inference(cnf,[status(esa)],[subset_defn]) ).
cnf(l27,plain,
( subset(sK3,intersection(sK4,sK5))
| member(sK1(sK3,intersection(sK4,sK5)),sK3) ),
inference(instantiation,[status(thm)],[4]) ).
cnf(l67,plain,
( subset(sK3,intersection(sK4,sK5))
| member(sK1(sK3,intersection(sK4,sK5)),sK3) ),
inference(instantiation,[status(thm)],[4]) ).
cnf(14,plain,
subset(sK3,sK4),
inference(cnf,[status(esa)],[prove_intersection_of_subsets_negated]) ).
cnf(l30,plain,
subset(sK3,sK4),
inference(instantiation,[status(thm)],[14]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l38,l66,l10,l27,l67,l30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET199+3 : TPTP v9.0.0. Released v2.2.0.
% 0.10/0.12 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Jul 21 20:24:04 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.12/0.33 % launching worker at depth: 1
% 0.12/0.33 % launching worker at depth: 4
% 0.12/0.33 % launching worker at depth: 3
% 0.12/0.33 % launching worker at depth: 5
% 0.12/0.33 % launching worker at depth: 2
% 0.12/0.33 % launching worker at depth: 6
% 0.12/0.33 % launching worker at depth: 7
% 0.12/0.33 % launching worker at depth: 8
% 0.12/0.33 % launching worker at depth: 9
% 0.12/0.34 % launching worker at depth: 10
% 0.12/0.38 % launching worker at depth: 11
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------