TSTP Solution File: SYN940+1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SYN940+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n011.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:12:20 EDT 2022
% Result : Theorem 0.14s 0.35s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 1
% Syntax : Number of formulae : 30 ( 10 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 117 ( 50 ~; 38 |; 20 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 60 ( 13 sgn 31 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [B,C] :
( ! [Z] : q(f(Z))
=> ? [X,Y] :
( ( p(f(Y))
=> ( p(X)
& ( r(Y)
=> ( r(B)
& r(C) ) ) ) )
& q(X) ) ) ).
fof(subgoal_0,plain,
! [B,C] :
( ! [Z] : q(f(Z))
=> ? [X,Y] :
( ( p(f(Y))
=> ( p(X)
& ( r(Y)
=> ( r(B)
& r(C) ) ) ) )
& q(X) ) ),
inference(strip,[],[prove_this]) ).
fof(negate_0_0,plain,
~ ! [B,C] :
( ! [Z] : q(f(Z))
=> ? [X,Y] :
( ( p(f(Y))
=> ( p(X)
& ( r(Y)
=> ( r(B)
& r(C) ) ) ) )
& q(X) ) ),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
( ? [B,C] :
! [X] :
( ~ q(X)
| ( ( ~ p(X)
| ( ( ~ r(B)
| ~ r(C) )
& ! [Y] : r(Y) ) )
& ! [Y] : p(f(Y)) ) )
& ! [Z] : q(f(Z)) ),
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_1,plain,
! [Z] : q(f(Z)),
inference(conjunct,[],[normalize_0_0]) ).
fof(normalize_0_2,plain,
! [Z] : q(f(Z)),
inference(specialize,[],[normalize_0_1]) ).
fof(normalize_0_3,plain,
? [B,C] :
! [X] :
( ~ q(X)
| ( ( ~ p(X)
| ( ( ~ r(B)
| ~ r(C) )
& ! [Y] : r(Y) ) )
& ! [Y] : p(f(Y)) ) ),
inference(conjunct,[],[normalize_0_0]) ).
fof(normalize_0_4,plain,
! [X] :
( ~ q(X)
| ( ( ~ p(X)
| ( ( ~ r(skolemFOFtoCNF_B)
| ~ r(skolemFOFtoCNF_C) )
& ! [Y] : r(Y) ) )
& ! [Y] : p(f(Y)) ) ),
inference(skolemize,[],[normalize_0_3]) ).
fof(normalize_0_5,plain,
! [X] :
( ~ q(X)
| ( ( ~ p(X)
| ( ( ~ r(skolemFOFtoCNF_B)
| ~ r(skolemFOFtoCNF_C) )
& ! [Y] : r(Y) ) )
& ! [Y] : p(f(Y)) ) ),
inference(specialize,[],[normalize_0_4]) ).
fof(normalize_0_6,plain,
! [X,Y] :
( ( ~ q(X)
| p(f(Y)) )
& ( ~ p(X)
| ~ q(X)
| r(Y) )
& ( ~ p(X)
| ~ q(X)
| ~ r(skolemFOFtoCNF_B)
| ~ r(skolemFOFtoCNF_C) ) ),
inference(clausify,[],[normalize_0_5]) ).
fof(normalize_0_7,plain,
! [X] :
( ~ p(X)
| ~ q(X)
| ~ r(skolemFOFtoCNF_B)
| ~ r(skolemFOFtoCNF_C) ),
inference(conjunct,[],[normalize_0_6]) ).
fof(normalize_0_8,plain,
! [X,Y] :
( ~ p(X)
| ~ q(X)
| r(Y) ),
inference(conjunct,[],[normalize_0_6]) ).
fof(normalize_0_9,plain,
! [X,Y] :
( ~ q(X)
| p(f(Y)) ),
inference(conjunct,[],[normalize_0_6]) ).
cnf(refute_0_0,plain,
q(f(Z)),
inference(canonicalize,[],[normalize_0_2]) ).
cnf(refute_0_1,plain,
( ~ p(X)
| ~ q(X)
| ~ r(skolemFOFtoCNF_B)
| ~ r(skolemFOFtoCNF_C) ),
inference(canonicalize,[],[normalize_0_7]) ).
cnf(refute_0_2,plain,
( ~ p(X)
| ~ q(X)
| r(Y) ),
inference(canonicalize,[],[normalize_0_8]) ).
cnf(refute_0_3,plain,
( ~ p(f(Z))
| ~ q(f(Z))
| r(X_5) ),
inference(subst,[],[refute_0_2:[bind(X,$fot(f(Z))),bind(Y,$fot(X_5))]]) ).
cnf(refute_0_4,plain,
( ~ p(f(Z))
| r(X_5) ),
inference(resolve,[$cnf( q(f(Z)) )],[refute_0_0,refute_0_3]) ).
cnf(refute_0_5,plain,
( ~ q(X)
| p(f(Y)) ),
inference(canonicalize,[],[normalize_0_9]) ).
cnf(refute_0_6,plain,
( ~ q(f(Z))
| p(f(X_2)) ),
inference(subst,[],[refute_0_5:[bind(X,$fot(f(Z))),bind(Y,$fot(X_2))]]) ).
cnf(refute_0_7,plain,
p(f(X_2)),
inference(resolve,[$cnf( q(f(Z)) )],[refute_0_0,refute_0_6]) ).
cnf(refute_0_8,plain,
p(f(Z)),
inference(subst,[],[refute_0_7:[bind(X_2,$fot(Z))]]) ).
cnf(refute_0_9,plain,
r(X_5),
inference(resolve,[$cnf( p(f(Z)) )],[refute_0_8,refute_0_4]) ).
cnf(refute_0_10,plain,
r(skolemFOFtoCNF_B),
inference(subst,[],[refute_0_9:[bind(X_5,$fot(skolemFOFtoCNF_B))]]) ).
cnf(refute_0_11,plain,
( ~ p(X)
| ~ q(X)
| ~ r(skolemFOFtoCNF_C) ),
inference(resolve,[$cnf( r(skolemFOFtoCNF_B) )],[refute_0_10,refute_0_1]) ).
cnf(refute_0_12,plain,
r(skolemFOFtoCNF_C),
inference(subst,[],[refute_0_9:[bind(X_5,$fot(skolemFOFtoCNF_C))]]) ).
cnf(refute_0_13,plain,
( ~ p(X)
| ~ q(X) ),
inference(resolve,[$cnf( r(skolemFOFtoCNF_C) )],[refute_0_12,refute_0_11]) ).
cnf(refute_0_14,plain,
( ~ p(f(Z))
| ~ q(f(Z)) ),
inference(subst,[],[refute_0_13:[bind(X,$fot(f(Z)))]]) ).
cnf(refute_0_15,plain,
~ p(f(Z)),
inference(resolve,[$cnf( q(f(Z)) )],[refute_0_0,refute_0_14]) ).
cnf(refute_0_16,plain,
$false,
inference(resolve,[$cnf( p(f(Z)) )],[refute_0_8,refute_0_15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : SYN940+1 : TPTP v8.1.0. Released v3.1.0.
% 0.05/0.13 % Command : metis --show proof --show saturation %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 12 06:24:58 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.14/0.35 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.35
% 0.14/0.35 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.14/0.35
%------------------------------------------------------------------------------