%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SYN409+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n019.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 : Thu Jul 21 09:02:11 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 34 ( 24 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 15 ~; 0 |; 8 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 41 ( 5 sgn 31 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish246,conjecture,
( ! [X] : f(X)
<=> ! [Y,Z] :
( f(Y)
& f(Z) ) ) ).
fof(subgoal_0,plain,
( ! [X] : f(X)
=> ! [Y,Z] : f(Y) ),
inference(strip,[],[kalish246]) ).
fof(subgoal_1,plain,
( ! [X] : f(X)
=> ! [Y,Z] :
( f(Y)
=> f(Z) ) ),
inference(strip,[],[kalish246]) ).
fof(subgoal_2,plain,
( ! [Y,Z] :
( f(Y)
& f(Z) )
=> ! [X] : f(X) ),
inference(strip,[],[kalish246]) ).
fof(negate_0_0,plain,
~ ( ! [X] : f(X)
=> ! [Y,Z] : f(Y) ),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
( ? [Y] : ~ f(Y)
& ! [X] : f(X) ),
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_1,plain,
? [Y] : ~ f(Y),
inference(conjunct,[],[normalize_0_0]) ).
fof(normalize_0_2,plain,
~ f(skolemFOFtoCNF_Y),
inference(skolemize,[],[normalize_0_1]) ).
fof(normalize_0_3,plain,
! [X] : f(X),
inference(conjunct,[],[normalize_0_0]) ).
fof(normalize_0_4,plain,
! [X] : f(X),
inference(specialize,[],[normalize_0_3]) ).
cnf(refute_0_0,plain,
~ f(skolemFOFtoCNF_Y),
inference(canonicalize,[],[normalize_0_2]) ).
cnf(refute_0_1,plain,
f(X),
inference(canonicalize,[],[normalize_0_4]) ).
cnf(refute_0_2,plain,
f(skolemFOFtoCNF_Y),
inference(subst,[],[refute_0_1:[bind(X,$fot(skolemFOFtoCNF_Y))]]) ).
cnf(refute_0_3,plain,
$false,
inference(resolve,[$cnf( f(skolemFOFtoCNF_Y) )],[refute_0_2,refute_0_0]) ).
fof(negate_1_0,plain,
~ ( ! [X] : f(X)
=> ! [Y,Z] :
( f(Y)
=> f(Z) ) ),
inference(negate,[],[subgoal_1]) ).
fof(normalize_1_0,plain,
( ? [Y] : f(Y)
& ? [Z] : ~ f(Z)
& ! [X] : f(X) ),
inference(canonicalize,[],[negate_1_0]) ).
fof(normalize_1_1,plain,
? [Z] : ~ f(Z),
inference(conjunct,[],[normalize_1_0]) ).
fof(normalize_1_2,plain,
~ f(skolemFOFtoCNF_Z),
inference(skolemize,[],[normalize_1_1]) ).
fof(normalize_1_3,plain,
! [X] : f(X),
inference(conjunct,[],[normalize_1_0]) ).
fof(normalize_1_4,plain,
! [X] : f(X),
inference(specialize,[],[normalize_1_3]) ).
cnf(refute_1_0,plain,
~ f(skolemFOFtoCNF_Z),
inference(canonicalize,[],[normalize_1_2]) ).
cnf(refute_1_1,plain,
f(X),
inference(canonicalize,[],[normalize_1_4]) ).
cnf(refute_1_2,plain,
f(skolemFOFtoCNF_Z),
inference(subst,[],[refute_1_1:[bind(X,$fot(skolemFOFtoCNF_Z))]]) ).
cnf(refute_1_3,plain,
$false,
inference(resolve,[$cnf( f(skolemFOFtoCNF_Z) )],[refute_1_2,refute_1_0]) ).
fof(negate_2_0,plain,
~ ( ! [Y,Z] :
( f(Y)
& f(Z) )
=> ! [X] : f(X) ),
inference(negate,[],[subgoal_2]) ).
fof(normalize_2_0,plain,
( ? [X] : ~ f(X)
& ! [Y] : f(Y)
& ! [Z] : f(Z) ),
inference(canonicalize,[],[negate_2_0]) ).
fof(normalize_2_1,plain,
? [X] : ~ f(X),
inference(conjunct,[],[normalize_2_0]) ).
fof(normalize_2_2,plain,
~ f(skolemFOFtoCNF_X),
inference(skolemize,[],[normalize_2_1]) ).
fof(normalize_2_3,plain,
! [Y] : f(Y),
inference(conjunct,[],[normalize_2_0]) ).
fof(normalize_2_4,plain,
! [Y] : f(Y),
inference(specialize,[],[normalize_2_3]) ).
cnf(refute_2_0,plain,
~ f(skolemFOFtoCNF_X),
inference(canonicalize,[],[normalize_2_2]) ).
cnf(refute_2_1,plain,
f(Y),
inference(canonicalize,[],[normalize_2_4]) ).
cnf(refute_2_2,plain,
f(skolemFOFtoCNF_X),
inference(subst,[],[refute_2_1:[bind(Y,$fot(skolemFOFtoCNF_X))]]) ).
cnf(refute_2_3,plain,
$false,
inference(resolve,[$cnf( f(skolemFOFtoCNF_X) )],[refute_2_2,refute_2_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN409+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : metis --show proof --show saturation %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 : Tue Jul 12 06:34:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.34
% 0.12/0.34 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.12/0.35
%------------------------------------------------------------------------------