%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : SET600+3 : TPTP v9.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n028.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:32:19 PM UTC 2025
% Result : Theorem 13.26s 1.92s
% Output : CNFRefutation 13.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 39 ( 10 unt; 0 def)
% Number of atoms : 83 ( 32 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 76 ( 32 ~; 37 |; 2 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 3 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th59,plain,
! [B,C] :
( union(B,C) = empty_set
<=> ( B = empty_set
& C = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th59) ).
fof(prove_th59_negated,plain,
~ ! [B,C] :
( union(B,C) = empty_set
<=> ( B = empty_set
& C = empty_set ) ),
inference(negate_conjecture,[status(cth)],[prove_th59]) ).
cnf(22,plain,
( union(sK4,sK5) != empty_set
| sK4 != empty_set
| sK5 != empty_set ),
inference(cnf,[status(esa)],[prove_th59_negated]) ).
cnf(l0,plain,
( union(sK4,sK5) != empty_set
| sK4 != empty_set
| sK5 != empty_set ),
inference(instantiation,[status(thm)],[22]) ).
cnf(21,plain,
( union(sK4,sK5) = empty_set
| sK5 = empty_set ),
inference(cnf,[status(esa)],[prove_th59_negated]) ).
cnf(l150,plain,
( union(sK4,sK5) = empty_set
| sK5 = empty_set ),
inference(instantiation,[status(thm)],[21]) ).
cnf(20,plain,
( union(sK4,sK5) = empty_set
| sK4 = empty_set ),
inference(cnf,[status(esa)],[prove_th59_negated]) ).
cnf(l147,plain,
( union(sK4,sK5) = empty_set
| sK4 = empty_set ),
inference(instantiation,[status(thm)],[20]) ).
fof(equal_member_defn,plain,
! [B,C] :
( B = C
<=> ! [D] :
( member(D,B)
<=> member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
cnf(16,plain,
( X0 = X1
| member(sK3(X0,X1),X0)
| sP0(X1,X0) ),
inference(cnf,[status(esa)],[equal_member_defn]) ).
cnf(l2,plain,
( union(empty_set,empty_set) = empty_set
| member(sK3(union(empty_set,empty_set),empty_set),union(empty_set,empty_set))
| sP0(empty_set,union(empty_set,empty_set)) ),
inference(instantiation,[status(thm)],[16]) ).
cnf(l3,plain,
( sK4 = empty_set
| member(sK3(sK4,empty_set),sK4)
| sP0(empty_set,sK4) ),
inference(instantiation,[status(thm)],[16]) ).
cnf(19,plain,
( member(sK3(X0,X1),X1)
| ~ sP0(X1,X0) ),
inference(cnf,[status(esa)],[equal_member_defn]) ).
cnf(l32,plain,
( member(sK3(union(empty_set,empty_set),empty_set),empty_set)
| ~ sP0(empty_set,union(empty_set,empty_set)) ),
inference(instantiation,[status(thm)],[19]) ).
fof(union_defn,plain,
! [B,C,D] :
( member(D,union(B,C))
<=> ( member(D,B)
| member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
cnf(0,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf,[status(esa)],[union_defn]) ).
cnf(l6,plain,
( ~ member(sK3(union(empty_set,empty_set),empty_set),union(empty_set,empty_set))
| member(sK3(union(empty_set,empty_set),empty_set),empty_set)
| member(sK3(union(empty_set,empty_set),empty_set),empty_set) ),
inference(instantiation,[status(thm)],[0]) ).
fof(empty_set_defn,plain,
! [B] : ~ member(B,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
cnf(3,plain,
~ member(X0,empty_set),
inference(cnf,[status(esa)],[empty_set_defn]) ).
cnf(l62,plain,
~ member(sK3(union(empty_set,empty_set),empty_set),empty_set),
inference(instantiation,[status(thm)],[3]) ).
cnf(l34,plain,
( member(sK3(sK4,empty_set),empty_set)
| ~ sP0(empty_set,sK4) ),
inference(instantiation,[status(thm)],[19]) ).
cnf(l45,plain,
~ member(sK3(sK4,empty_set),empty_set),
inference(instantiation,[status(thm)],[3]) ).
cnf(l22,plain,
~ member(sK3(union(empty_set,empty_set),empty_set),empty_set),
inference(instantiation,[status(thm)],[3]) ).
cnf(l11,plain,
~ member(sK3(union(empty_set,empty_set),empty_set),empty_set),
inference(instantiation,[status(thm)],[3]) ).
cnf(1,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf,[status(esa)],[union_defn]) ).
cnf(l7,plain,
( ~ member(sK3(sK4,empty_set),sK4)
| member(sK3(sK4,empty_set),union(sK4,sK5)) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(14,plain,
( X0 != X1
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf,[status(esa)],[equal_member_defn]) ).
cnf(l8,plain,
( union(sK4,sK5) != empty_set
| ~ member(sK3(sK4,empty_set),union(sK4,sK5))
| member(sK3(sK4,empty_set),empty_set) ),
inference(instantiation,[status(thm)],[14]) ).
cnf(l13,plain,
~ member(sK3(sK4,empty_set),empty_set),
inference(instantiation,[status(thm)],[3]) ).
cnf(l30,plain,
( union(sK4,sK5) = empty_set
| sK4 = empty_set ),
inference(instantiation,[status(thm)],[20]) ).
cnf(l227,plain,
( sK5 = empty_set
| member(sK3(sK5,empty_set),sK5)
| sP0(empty_set,sK5) ),
inference(instantiation,[status(thm)],[16]) ).
cnf(l229,plain,
( member(sK3(sK5,empty_set),empty_set)
| ~ sP0(empty_set,sK5) ),
inference(instantiation,[status(thm)],[19]) ).
cnf(l230,plain,
~ member(sK3(sK5,empty_set),empty_set),
inference(instantiation,[status(thm)],[3]) ).
cnf(2,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(cnf,[status(esa)],[union_defn]) ).
cnf(l237,plain,
( ~ member(sK3(sK5,empty_set),sK5)
| member(sK3(sK5,empty_set),union(sK4,sK5)) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(l248,plain,
( union(sK4,sK5) != empty_set
| ~ member(sK3(sK5,empty_set),union(sK4,sK5))
| member(sK3(sK5,empty_set),empty_set) ),
inference(instantiation,[status(thm)],[14]) ).
cnf(l252,plain,
~ member(sK3(sK5,empty_set),empty_set),
inference(instantiation,[status(thm)],[3]) ).
cnf(l259,plain,
( union(sK4,sK5) = empty_set
| sK5 = empty_set ),
inference(instantiation,[status(thm)],[21]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l150,l147,l2,l3,l32,l6,l62,l34,l45,l22,l11,l7,l8,l13,l30,l227,l229,l230,l237,l248,l252,l259]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.06 % Problem : SET600+3 : TPTP v9.0.0. Released v2.2.0.
% 0.01/0.07 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.25 % Computer : n028.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Mon Jul 21 22:05:34 EDT 2025
% 0.06/0.25 % CPUTime :
% 0.06/0.25 % launching worker at depth: 1
% 0.06/0.25 % launching worker at depth: 7
% 0.06/0.25 % launching worker at depth: 2
% 0.06/0.25 % launching worker at depth: 3
% 0.06/0.25 % launching worker at depth: 8
% 0.06/0.25 % launching worker at depth: 4
% 0.06/0.25 % launching worker at depth: 5
% 0.06/0.25 % launching worker at depth: 6
% 0.10/0.26 % launching worker at depth: 9
% 0.10/0.26 % launching worker at depth: 10
% 0.10/0.36 % launching worker at depth: 11
% 13.26/1.92 % SZS status Theorem for theBenchmark
% 13.26/1.92 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------