TSTP Solution File: SYN398+1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SYN398+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n004.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:07 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 20 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 12 ~; 0 |; 16 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 28 ( 4 sgn 22 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish215,conjecture,
( ! [X] :
( p
& f(X) )
<=> ( p
& ! [Y] : f(Y) ) ) ).
fof(subgoal_0,plain,
( ! [X] :
( p
& f(X) )
=> p ),
inference(strip,[],[kalish215]) ).
fof(subgoal_1,plain,
( ( ! [X] :
( p
& f(X) )
& p )
=> ! [Y] : f(Y) ),
inference(strip,[],[kalish215]) ).
fof(subgoal_2,plain,
( ( p
& ! [Y] : f(Y) )
=> ! [X] : p ),
inference(strip,[],[kalish215]) ).
fof(subgoal_3,plain,
( ( p
& ! [Y] : f(Y) )
=> ! [X] :
( p
=> f(X) ) ),
inference(strip,[],[kalish215]) ).
fof(negate_0_0,plain,
~ ( ! [X] :
( p
& f(X) )
=> p ),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
$false,
inference(canonicalize,[],[negate_0_0]) ).
cnf(refute_0_0,plain,
$false,
inference(canonicalize,[],[normalize_0_0]) ).
fof(negate_1_0,plain,
~ ( ( ! [X] :
( p
& f(X) )
& p )
=> ! [Y] : f(Y) ),
inference(negate,[],[subgoal_1]) ).
fof(normalize_1_0,plain,
( p
& ? [Y] : ~ f(Y)
& ! [X] : f(X) ),
inference(canonicalize,[],[negate_1_0]) ).
fof(normalize_1_1,plain,
? [Y] : ~ f(Y),
inference(conjunct,[],[normalize_1_0]) ).
fof(normalize_1_2,plain,
~ f(skolemFOFtoCNF_Y),
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_Y),
inference(canonicalize,[],[normalize_1_2]) ).
cnf(refute_1_1,plain,
f(X),
inference(canonicalize,[],[normalize_1_4]) ).
cnf(refute_1_2,plain,
f(skolemFOFtoCNF_Y),
inference(subst,[],[refute_1_1:[bind(X,$fot(skolemFOFtoCNF_Y))]]) ).
cnf(refute_1_3,plain,
$false,
inference(resolve,[$cnf( f(skolemFOFtoCNF_Y) )],[refute_1_2,refute_1_0]) ).
fof(negate_2_0,plain,
~ ( ( p
& ! [Y] : f(Y) )
=> ! [X] : p ),
inference(negate,[],[subgoal_2]) ).
fof(normalize_2_0,plain,
$false,
inference(canonicalize,[],[negate_2_0]) ).
cnf(refute_2_0,plain,
$false,
inference(canonicalize,[],[normalize_2_0]) ).
fof(negate_3_0,plain,
~ ( ( p
& ! [Y] : f(Y) )
=> ! [X] :
( p
=> f(X) ) ),
inference(negate,[],[subgoal_3]) ).
fof(normalize_3_0,plain,
( p
& ? [X] : ~ f(X)
& ! [Y] : f(Y) ),
inference(canonicalize,[],[negate_3_0]) ).
fof(normalize_3_1,plain,
? [X] : ~ f(X),
inference(conjunct,[],[normalize_3_0]) ).
fof(normalize_3_2,plain,
~ f(skolemFOFtoCNF_X),
inference(skolemize,[],[normalize_3_1]) ).
fof(normalize_3_3,plain,
! [Y] : f(Y),
inference(conjunct,[],[normalize_3_0]) ).
fof(normalize_3_4,plain,
! [Y] : f(Y),
inference(specialize,[],[normalize_3_3]) ).
cnf(refute_3_0,plain,
~ f(skolemFOFtoCNF_X),
inference(canonicalize,[],[normalize_3_2]) ).
cnf(refute_3_1,plain,
f(Y),
inference(canonicalize,[],[normalize_3_4]) ).
cnf(refute_3_2,plain,
f(skolemFOFtoCNF_X),
inference(subst,[],[refute_3_1:[bind(Y,$fot(skolemFOFtoCNF_X))]]) ).
cnf(refute_3_3,plain,
$false,
inference(resolve,[$cnf( f(skolemFOFtoCNF_X) )],[refute_3_2,refute_3_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN398+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : metis --show proof --show saturation %s
% 0.13/0.34 % Computer : n004.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 20:11:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.35 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35
% 0.13/0.35 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.13/0.35
%------------------------------------------------------------------------------