%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : SET066+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n029.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:23 PM UTC 2025
% Result : Theorem 69.91s 9.13s
% Output : CNFRefutation 69.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 5 unt; 0 def)
% Number of atoms : 74 ( 21 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 74 ( 32 ~; 36 |; 2 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 30 ( 4 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(commutativity_of_unordered_pair,plain,
! [X,Y] : unordered_pair(X,Y) = unordered_pair(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
fof(commutativity_of_unordered_pair_negated,plain,
~ ! [X,Y] : unordered_pair(X,Y) = unordered_pair(Y,X),
inference(negate_conjecture,[status(cth)],[commutativity_of_unordered_pair]) ).
cnf(89,plain,
unordered_pair(sK10,sK11) != unordered_pair(sK11,sK10),
inference(cnf,[status(esa)],[commutativity_of_unordered_pair_negated]) ).
cnf(l0,plain,
unordered_pair(sK10,sK11) != unordered_pair(sK11,sK10),
inference(instantiation,[status(thm)],[89]) ).
fof(extensionality,plain,
! [X,Y] :
( X = Y
<=> ( subclass(X,Y)
& subclass(Y,X) ) ),
file('Axioms/SET005+0.ax',extensionality) ).
cnf(6,plain,
( ~ subclass(X0,X1)
| ~ subclass(X1,X0)
| X0 = X1 ),
inference(cnf,[status(esa)],[extensionality]) ).
cnf(l1,plain,
( ~ subclass(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10))
| ~ subclass(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11))
| unordered_pair(sK10,sK11) = unordered_pair(sK11,sK10) ),
inference(instantiation,[status(thm)],[6]) ).
fof(subclass_defn,plain,
! [X,Y] :
( subclass(X,Y)
<=> ! [U] :
( member(U,X)
=> member(U,Y) ) ),
file('Axioms/SET005+0.ax',subclass_defn) ).
cnf(1,plain,
( subclass(X0,X1)
| member(sK1(X0,X1),X0) ),
inference(cnf,[status(esa)],[subclass_defn]) ).
cnf(l2,plain,
( subclass(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10))
| member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),unordered_pair(sK10,sK11)) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l7,plain,
( subclass(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11))
| member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),unordered_pair(sK11,sK10)) ),
inference(instantiation,[status(thm)],[1]) ).
fof(unordered_pair_defn,plain,
! [U,X,Y] :
( member(U,unordered_pair(X,Y))
<=> ( member(U,universal_class)
& ( U = X
| U = Y ) ) ),
file('Axioms/SET005+0.ax',unordered_pair_defn) ).
cnf(8,plain,
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf,[status(esa)],[unordered_pair_defn]) ).
cnf(l18,plain,
( ~ member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),unordered_pair(sK11,sK10))
| sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)) = sK11
| sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)) = sK10 ),
inference(instantiation,[status(thm)],[8]) ).
cnf(10,plain,
( ~ member(X0,universal_class)
| X0 != X1
| member(X0,unordered_pair(X2,X1)) ),
inference(cnf,[status(esa)],[unordered_pair_defn]) ).
cnf(l25,plain,
( ~ member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),universal_class)
| sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)) != sK11
| member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),unordered_pair(sK10,sK11)) ),
inference(instantiation,[status(thm)],[10]) ).
cnf(7,plain,
( ~ member(X0,unordered_pair(X1,X2))
| member(X0,universal_class) ),
inference(cnf,[status(esa)],[unordered_pair_defn]) ).
cnf(l26,plain,
( ~ member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),unordered_pair(sK11,sK10))
| member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),universal_class) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l4,plain,
( ~ member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),unordered_pair(sK10,sK11))
| sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)) = sK10
| sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)) = sK11 ),
inference(instantiation,[status(thm)],[8]) ).
cnf(2,plain,
( ~ member(sK1(X0,X1),X1)
| subclass(X0,X1) ),
inference(cnf,[status(esa)],[subclass_defn]) ).
cnf(l27,plain,
( ~ member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),unordered_pair(sK10,sK11))
| subclass(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(9,plain,
( ~ member(X0,universal_class)
| X0 != X1
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf,[status(esa)],[unordered_pair_defn]) ).
cnf(l58,plain,
( ~ member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),universal_class)
| sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)) != sK10
| member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),unordered_pair(sK10,sK11)) ),
inference(instantiation,[status(thm)],[9]) ).
cnf(l61,plain,
( ~ member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),unordered_pair(sK11,sK10))
| member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),universal_class) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l60,plain,
( ~ member(sK1(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)),unordered_pair(sK10,sK11))
| subclass(unordered_pair(sK11,sK10),unordered_pair(sK10,sK11)) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(l8,plain,
( ~ member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),universal_class)
| sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)) != sK11
| member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),unordered_pair(sK11,sK10)) ),
inference(instantiation,[status(thm)],[9]) ).
cnf(l33,plain,
( ~ member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),unordered_pair(sK10,sK11))
| member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),universal_class) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l12,plain,
( ~ member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),unordered_pair(sK11,sK10))
| subclass(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(l35,plain,
( ~ member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),universal_class)
| sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)) != sK10
| member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),unordered_pair(sK11,sK10)) ),
inference(instantiation,[status(thm)],[10]) ).
cnf(l36,plain,
( ~ member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),unordered_pair(sK10,sK11))
| member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),universal_class) ),
inference(instantiation,[status(thm)],[7]) ).
cnf(l42,plain,
( ~ member(sK1(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)),unordered_pair(sK11,sK10))
| subclass(unordered_pair(sK10,sK11),unordered_pair(sK11,sK10)) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l7,l18,l25,l26,l4,l27,l58,l61,l60,l8,l33,l12,l35,l36,l42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET066+1 : TPTP v9.0.0. Bugfixed v5.4.0.
% 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Jul 21 19:39:04 EDT 2025
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % launching worker at depth: 2
% 0.13/0.34 % launching worker at depth: 6
% 0.13/0.34 % launching worker at depth: 8
% 0.13/0.34 % launching worker at depth: 4
% 0.13/0.34 % launching worker at depth: 5
% 0.13/0.34 % launching worker at depth: 1
% 0.13/0.34 % launching worker at depth: 7
% 0.13/0.34 % launching worker at depth: 3
% 0.13/0.34 % launching worker at depth: 9
% 0.13/0.35 % launching worker at depth: 10
% 0.13/0.37 % launching worker at depth: 11
% 3.69/0.87 % launching worker at depth: 12
% 69.91/9.13 % SZS status Theorem for theBenchmark
% 69.91/9.13 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------