%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SET627+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n015.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 : 600s
% DateTime : Tue Jul 19 03:36:08 EDT 2022
% Result : Theorem 0.15s 0.36s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 14 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 53 ( 27 ~; 16 |; 4 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 3 sgn 29 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(empty_set_defn,axiom,
! [B] : ~ member(B,empty_set) ).
fof(intersect_defn,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,B)
& member(D,C) ) ) ).
fof(disjoint_defn,axiom,
! [B,C] :
( disjoint(B,C)
<=> ~ intersect(B,C) ) ).
fof(prove_th104,conjecture,
! [B] : disjoint(B,empty_set) ).
fof(subgoal_0,plain,
! [B] : disjoint(B,empty_set),
inference(strip,[],[prove_th104]) ).
fof(negate_0_0,plain,
~ ! [B] : disjoint(B,empty_set),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
? [B] : ~ disjoint(B,empty_set),
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_1,plain,
~ disjoint(skolemFOFtoCNF_B,empty_set),
inference(skolemize,[],[normalize_0_0]) ).
fof(normalize_0_2,plain,
! [B] : ~ member(B,empty_set),
inference(canonicalize,[],[empty_set_defn]) ).
fof(normalize_0_3,plain,
! [B] : ~ member(B,empty_set),
inference(specialize,[],[normalize_0_2]) ).
fof(normalize_0_4,plain,
! [B,C] :
( ~ disjoint(B,C)
<=> intersect(B,C) ),
inference(canonicalize,[],[disjoint_defn]) ).
fof(normalize_0_5,plain,
! [B,C] :
( ~ disjoint(B,C)
<=> intersect(B,C) ),
inference(specialize,[],[normalize_0_4]) ).
fof(normalize_0_6,plain,
! [B,C] :
( ( ~ disjoint(B,C)
| ~ intersect(B,C) )
& ( disjoint(B,C)
| intersect(B,C) ) ),
inference(clausify,[],[normalize_0_5]) ).
fof(normalize_0_7,plain,
! [B,C] :
( disjoint(B,C)
| intersect(B,C) ),
inference(conjunct,[],[normalize_0_6]) ).
fof(normalize_0_8,plain,
! [B,C] :
( ~ intersect(B,C)
<=> ! [D] :
( ~ member(D,B)
| ~ member(D,C) ) ),
inference(canonicalize,[],[intersect_defn]) ).
fof(normalize_0_9,plain,
! [B,C] :
( ~ intersect(B,C)
<=> ! [D] :
( ~ member(D,B)
| ~ member(D,C) ) ),
inference(specialize,[],[normalize_0_8]) ).
fof(normalize_0_10,plain,
! [B,C,D] :
( ( ~ intersect(B,C)
| member(skolemFOFtoCNF_D(B,C),B) )
& ( ~ intersect(B,C)
| member(skolemFOFtoCNF_D(B,C),C) )
& ( ~ member(D,B)
| ~ member(D,C)
| intersect(B,C) ) ),
inference(clausify,[],[normalize_0_9]) ).
fof(normalize_0_11,plain,
! [B,C] :
( ~ intersect(B,C)
| member(skolemFOFtoCNF_D(B,C),C) ),
inference(conjunct,[],[normalize_0_10]) ).
cnf(refute_0_0,plain,
~ disjoint(skolemFOFtoCNF_B,empty_set),
inference(canonicalize,[],[normalize_0_1]) ).
cnf(refute_0_1,plain,
~ member(B,empty_set),
inference(canonicalize,[],[normalize_0_3]) ).
cnf(refute_0_2,plain,
~ member(skolemFOFtoCNF_D(X_23,empty_set),empty_set),
inference(subst,[],[refute_0_1:[bind(B,$fot(skolemFOFtoCNF_D(X_23,empty_set)))]]) ).
cnf(refute_0_3,plain,
( disjoint(B,C)
| intersect(B,C) ),
inference(canonicalize,[],[normalize_0_7]) ).
cnf(refute_0_4,plain,
( disjoint(X_21,X_22)
| intersect(X_21,X_22) ),
inference(subst,[],[refute_0_3:[bind(B,$fot(X_21)),bind(C,$fot(X_22))]]) ).
cnf(refute_0_5,plain,
( ~ intersect(B,C)
| member(skolemFOFtoCNF_D(B,C),C) ),
inference(canonicalize,[],[normalize_0_11]) ).
cnf(refute_0_6,plain,
( ~ intersect(X_21,X_22)
| member(skolemFOFtoCNF_D(X_21,X_22),X_22) ),
inference(subst,[],[refute_0_5:[bind(B,$fot(X_21)),bind(C,$fot(X_22))]]) ).
cnf(refute_0_7,plain,
( disjoint(X_21,X_22)
| member(skolemFOFtoCNF_D(X_21,X_22),X_22) ),
inference(resolve,[$cnf( intersect(X_21,X_22) )],[refute_0_4,refute_0_6]) ).
cnf(refute_0_8,plain,
( disjoint(X_23,empty_set)
| member(skolemFOFtoCNF_D(X_23,empty_set),empty_set) ),
inference(subst,[],[refute_0_7:[bind(X_21,$fot(X_23)),bind(X_22,$fot(empty_set))]]) ).
cnf(refute_0_9,plain,
disjoint(X_23,empty_set),
inference(resolve,[$cnf( member(skolemFOFtoCNF_D(X_23,empty_set),empty_set) )],[refute_0_8,refute_0_2]) ).
cnf(refute_0_10,plain,
disjoint(skolemFOFtoCNF_B,empty_set),
inference(subst,[],[refute_0_9:[bind(X_23,$fot(skolemFOFtoCNF_B))]]) ).
cnf(refute_0_11,plain,
$false,
inference(resolve,[$cnf( disjoint(skolemFOFtoCNF_B,empty_set) )],[refute_0_10,refute_0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET627+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : metis --show proof --show saturation %s
% 0.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jul 10 14:55:38 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.15/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.15/0.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.36
% 0.15/0.36 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.15/0.36
%------------------------------------------------------------------------------