TSTP Solution File: NUM298+1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n028.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 : Mon Jul 18 12:25:48 EDT 2022
% Result : Theorem 0.77s 0.97s
% Output : CNFRefutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 14 unt; 0 def)
% Number of atoms : 58 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 60 ( 31 ~; 21 |; 4 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 36 ( 4 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdn2,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))) ).
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))) ).
fof(less_entry_point_neg_pos,axiom,
! [X,Y,RDN_X,RDN_Y] :
( ( rdn_translate(X,rdn_neg(RDN_X))
& rdn_translate(Y,rdn_pos(RDN_Y)) )
=> less(X,Y) ) ).
fof(less_property,axiom,
! [X,Y] :
( less(X,Y)
<=> ( ~ less(Y,X)
& Y != X ) ) ).
fof(n2_not_less_nn2,conjecture,
~ less(n2,nn2) ).
fof(subgoal_0,plain,
~ less(n2,nn2),
inference(strip,[],[n2_not_less_nn2]) ).
fof(negate_0_0,plain,
~ ~ less(n2,nn2),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
! [X,Y] :
( ~ less(X,Y)
<=> ( Y = X
| less(Y,X) ) ),
inference(canonicalize,[],[less_property]) ).
fof(normalize_0_1,plain,
! [X,Y] :
( ~ less(X,Y)
<=> ( Y = X
| less(Y,X) ) ),
inference(specialize,[],[normalize_0_0]) ).
fof(normalize_0_2,plain,
! [X,Y] :
( ( Y != X
| ~ less(X,Y) )
& ( ~ less(X,Y)
| ~ less(Y,X) )
& ( Y = X
| less(X,Y)
| less(Y,X) ) ),
inference(clausify,[],[normalize_0_1]) ).
fof(normalize_0_3,plain,
! [X,Y] :
( ~ less(X,Y)
| ~ less(Y,X) ),
inference(conjunct,[],[normalize_0_2]) ).
fof(normalize_0_4,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(canonicalize,[],[rdn2]) ).
fof(normalize_0_5,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(canonicalize,[],[rdnn2]) ).
fof(normalize_0_6,plain,
! [X,Y] :
( less(X,Y)
| ! [RDN_X] : ~ rdn_translate(X,rdn_neg(RDN_X))
| ! [RDN_Y] : ~ rdn_translate(Y,rdn_pos(RDN_Y)) ),
inference(canonicalize,[],[less_entry_point_neg_pos]) ).
fof(normalize_0_7,plain,
! [X,Y] :
( less(X,Y)
| ! [RDN_X] : ~ rdn_translate(X,rdn_neg(RDN_X))
| ! [RDN_Y] : ~ rdn_translate(Y,rdn_pos(RDN_Y)) ),
inference(specialize,[],[normalize_0_6]) ).
fof(normalize_0_8,plain,
! [RDN_X,RDN_Y,X,Y] :
( ~ rdn_translate(X,rdn_neg(RDN_X))
| ~ rdn_translate(Y,rdn_pos(RDN_Y))
| less(X,Y) ),
inference(clausify,[],[normalize_0_7]) ).
fof(normalize_0_9,plain,
less(n2,nn2),
inference(canonicalize,[],[negate_0_0]) ).
cnf(refute_0_0,plain,
( ~ less(X,Y)
| ~ less(Y,X) ),
inference(canonicalize,[],[normalize_0_3]) ).
cnf(refute_0_1,plain,
( ~ less(n2,nn2)
| ~ less(nn2,n2) ),
inference(subst,[],[refute_0_0:[bind(X,$fot(nn2)),bind(Y,$fot(n2))]]) ).
cnf(refute_0_2,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(canonicalize,[],[normalize_0_4]) ).
cnf(refute_0_3,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(canonicalize,[],[normalize_0_5]) ).
cnf(refute_0_4,plain,
( ~ rdn_translate(X,rdn_neg(RDN_X))
| ~ rdn_translate(Y,rdn_pos(RDN_Y))
| less(X,Y) ),
inference(canonicalize,[],[normalize_0_8]) ).
cnf(refute_0_5,plain,
( ~ rdn_translate(X_672,rdn_pos(X_670))
| ~ rdn_translate(nn2,rdn_neg(rdnn(n2)))
| less(nn2,X_672) ),
inference(subst,[],[refute_0_4:[bind(RDN_X,$fot(rdnn(n2))),bind(RDN_Y,$fot(X_670)),bind(X,$fot(nn2)),bind(Y,$fot(X_672))]]) ).
cnf(refute_0_6,plain,
( ~ rdn_translate(X_672,rdn_pos(X_670))
| less(nn2,X_672) ),
inference(resolve,[$cnf( rdn_translate(nn2,rdn_neg(rdnn(n2))) )],[refute_0_3,refute_0_5]) ).
cnf(refute_0_7,plain,
( ~ rdn_translate(n2,rdn_pos(rdnn(n2)))
| less(nn2,n2) ),
inference(subst,[],[refute_0_6:[bind(X_670,$fot(rdnn(n2))),bind(X_672,$fot(n2))]]) ).
cnf(refute_0_8,plain,
less(nn2,n2),
inference(resolve,[$cnf( rdn_translate(n2,rdn_pos(rdnn(n2))) )],[refute_0_2,refute_0_7]) ).
cnf(refute_0_9,plain,
~ less(n2,nn2),
inference(resolve,[$cnf( less(nn2,n2) )],[refute_0_8,refute_0_1]) ).
cnf(refute_0_10,plain,
less(n2,nn2),
inference(canonicalize,[],[normalize_0_9]) ).
cnf(refute_0_11,plain,
$false,
inference(resolve,[$cnf( less(n2,nn2) )],[refute_0_10,refute_0_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM298+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : metis --show proof --show saturation %s
% 0.13/0.34 % Computer : n028.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 01:50:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.77/0.97 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.77/0.97
% 0.77/0.97 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.77/0.97
%------------------------------------------------------------------------------