TSTP Solution File: SET366+4 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SET366+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n018.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:34:26 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 16 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 49 ( 25 ~; 12 |; 5 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 5 sgn 28 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subset,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ) ).
fof(power_set,axiom,
! [X,A] :
( member(X,power_set(A))
<=> subset(X,A) ) ).
fof(empty_set,axiom,
! [X] : ~ member(X,empty_set) ).
fof(thI47,conjecture,
! [A] : member(empty_set,power_set(A)) ).
fof(subgoal_0,plain,
! [A] : member(empty_set,power_set(A)),
inference(strip,[],[thI47]) ).
fof(negate_0_0,plain,
~ ! [A] : member(empty_set,power_set(A)),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
? [A] : ~ member(empty_set,power_set(A)),
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_1,plain,
~ member(empty_set,power_set(skolemFOFtoCNF_A)),
inference(skolemize,[],[normalize_0_0]) ).
fof(normalize_0_2,plain,
! [A,X] :
( ~ member(X,power_set(A))
<=> ~ subset(X,A) ),
inference(canonicalize,[],[power_set]) ).
fof(normalize_0_3,plain,
! [A,X] :
( ~ member(X,power_set(A))
<=> ~ subset(X,A) ),
inference(specialize,[],[normalize_0_2]) ).
fof(normalize_0_4,plain,
! [A,X] :
( ( ~ member(X,power_set(A))
| subset(X,A) )
& ( ~ subset(X,A)
| member(X,power_set(A)) ) ),
inference(clausify,[],[normalize_0_3]) ).
fof(normalize_0_5,plain,
! [A,X] :
( ~ subset(X,A)
| member(X,power_set(A)) ),
inference(conjunct,[],[normalize_0_4]) ).
fof(normalize_0_6,plain,
! [X] : ~ member(X,empty_set),
inference(canonicalize,[],[empty_set]) ).
fof(normalize_0_7,plain,
! [X] : ~ member(X,empty_set),
inference(specialize,[],[normalize_0_6]) ).
fof(normalize_0_8,plain,
! [A,B] :
( ~ subset(A,B)
<=> ? [X] :
( ~ member(X,B)
& member(X,A) ) ),
inference(canonicalize,[],[subset]) ).
fof(normalize_0_9,plain,
! [A,B] :
( ~ subset(A,B)
<=> ? [X] :
( ~ member(X,B)
& member(X,A) ) ),
inference(specialize,[],[normalize_0_8]) ).
fof(normalize_0_10,plain,
! [A,B,X] :
( ( ~ member(skolemFOFtoCNF_X(A,B),B)
| subset(A,B) )
& ( member(skolemFOFtoCNF_X(A,B),A)
| subset(A,B) )
& ( ~ member(X,A)
| ~ subset(A,B)
| member(X,B) ) ),
inference(clausify,[],[normalize_0_9]) ).
fof(normalize_0_11,plain,
! [A,B] :
( member(skolemFOFtoCNF_X(A,B),A)
| subset(A,B) ),
inference(conjunct,[],[normalize_0_10]) ).
cnf(refute_0_0,plain,
~ member(empty_set,power_set(skolemFOFtoCNF_A)),
inference(canonicalize,[],[normalize_0_1]) ).
cnf(refute_0_1,plain,
( ~ subset(X,A)
| member(X,power_set(A)) ),
inference(canonicalize,[],[normalize_0_5]) ).
cnf(refute_0_2,plain,
( ~ subset(empty_set,X_24)
| member(empty_set,power_set(X_24)) ),
inference(subst,[],[refute_0_1:[bind(A,$fot(X_24)),bind(X,$fot(empty_set))]]) ).
cnf(refute_0_3,plain,
~ member(X,empty_set),
inference(canonicalize,[],[normalize_0_7]) ).
cnf(refute_0_4,plain,
~ member(skolemFOFtoCNF_X(empty_set,X_23),empty_set),
inference(subst,[],[refute_0_3:[bind(X,$fot(skolemFOFtoCNF_X(empty_set,X_23)))]]) ).
cnf(refute_0_5,plain,
( member(skolemFOFtoCNF_X(A,B),A)
| subset(A,B) ),
inference(canonicalize,[],[normalize_0_11]) ).
cnf(refute_0_6,plain,
( member(skolemFOFtoCNF_X(empty_set,X_23),empty_set)
| subset(empty_set,X_23) ),
inference(subst,[],[refute_0_5:[bind(A,$fot(empty_set)),bind(B,$fot(X_23))]]) ).
cnf(refute_0_7,plain,
subset(empty_set,X_23),
inference(resolve,[$cnf( member(skolemFOFtoCNF_X(empty_set,X_23),empty_set) )],[refute_0_6,refute_0_4]) ).
cnf(refute_0_8,plain,
subset(empty_set,X_24),
inference(subst,[],[refute_0_7:[bind(X_23,$fot(X_24))]]) ).
cnf(refute_0_9,plain,
member(empty_set,power_set(X_24)),
inference(resolve,[$cnf( subset(empty_set,X_24) )],[refute_0_8,refute_0_2]) ).
cnf(refute_0_10,plain,
member(empty_set,power_set(skolemFOFtoCNF_A)),
inference(subst,[],[refute_0_9:[bind(X_24,$fot(skolemFOFtoCNF_A))]]) ).
cnf(refute_0_11,plain,
$false,
inference(resolve,[$cnf( member(empty_set,power_set(skolemFOFtoCNF_A)) )],[refute_0_10,refute_0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET366+4 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : metis --show proof --show saturation %s
% 0.12/0.33 % Computer : n018.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 02:16:28 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.35
% 0.12/0.35 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.12/0.36
%------------------------------------------------------------------------------