TSTP Solution File: SWV137+1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SWV137+1 : TPTP v8.1.0. Bugfixed v3.3.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 : Wed Jul 20 20:30:14 EDT 2022
% Result : Theorem 5.34s 5.55s
% Output : CNFRefutation 5.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 66 ( 25 unt; 0 def)
% Number of atoms : 150 ( 27 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 129 ( 45 ~; 37 |; 38 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_gt1,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ) ).
fof(leq_gt_pred,axiom,
! [X,Y] :
( leq(X,pred(Y))
<=> gt(Y,X) ) ).
fof(leq_succ,axiom,
! [X,Y] :
( leq(X,Y)
=> leq(X,succ(Y)) ) ).
fof(pred_succ,axiom,
! [X] : pred(succ(X)) = X ).
fof(leq_succ_gt,axiom,
! [X,Y] :
( leq(succ(X),Y)
=> gt(Y,X) ) ).
fof(gauss_array_0007,conjecture,
( ( leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ) ).
fof(successor_1,axiom,
succ(n0) = n1 ).
fof(successor_2,axiom,
succ(succ(n0)) = n2 ).
fof(subgoal_0,plain,
( ( leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
inference(strip,[],[gauss_array_0007]) ).
fof(negate_0_0,plain,
~ ( ( leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
! [X,Y] :
( ~ gt(Y,X)
| leq(X,Y) ),
inference(canonicalize,[],[leq_gt1]) ).
fof(normalize_0_1,plain,
! [X,Y] :
( ~ gt(Y,X)
| leq(X,Y) ),
inference(specialize,[],[normalize_0_0]) ).
fof(normalize_0_2,plain,
! [X,Y] :
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(canonicalize,[],[leq_succ_gt]) ).
fof(normalize_0_3,plain,
! [X,Y] :
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(specialize,[],[normalize_0_2]) ).
fof(normalize_0_4,plain,
succ(n0) = n1,
inference(canonicalize,[],[successor_1]) ).
fof(normalize_0_5,plain,
! [X,Y] :
( ~ gt(Y,X)
<=> ~ leq(X,pred(Y)) ),
inference(canonicalize,[],[leq_gt_pred]) ).
fof(normalize_0_6,plain,
! [X,Y] :
( ~ gt(Y,X)
<=> ~ leq(X,pred(Y)) ),
inference(specialize,[],[normalize_0_5]) ).
fof(normalize_0_7,plain,
! [X,Y] :
( ( ~ gt(Y,X)
| leq(X,pred(Y)) )
& ( ~ leq(X,pred(Y))
| gt(Y,X) ) ),
inference(clausify,[],[normalize_0_6]) ).
fof(normalize_0_8,plain,
! [X,Y] :
( ~ gt(Y,X)
| leq(X,pred(Y)) ),
inference(conjunct,[],[normalize_0_7]) ).
fof(normalize_0_9,plain,
( ~ leq(n0,pv1325)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(pv1325,n3)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3) ),
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_10,plain,
leq(n2,pv1325),
inference(conjunct,[],[normalize_0_9]) ).
fof(normalize_0_11,plain,
! [X,Y] :
( ~ leq(X,Y)
| leq(X,succ(Y)) ),
inference(canonicalize,[],[leq_succ]) ).
fof(normalize_0_12,plain,
! [X,Y] :
( ~ leq(X,Y)
| leq(X,succ(Y)) ),
inference(specialize,[],[normalize_0_11]) ).
fof(normalize_0_13,plain,
succ(succ(n0)) = n2,
inference(canonicalize,[],[successor_2]) ).
fof(normalize_0_14,plain,
! [X] : pred(succ(X)) = X,
inference(canonicalize,[],[pred_succ]) ).
fof(normalize_0_15,plain,
! [X] : pred(succ(X)) = X,
inference(specialize,[],[normalize_0_14]) ).
fof(normalize_0_16,plain,
~ leq(n0,pv1325),
inference(conjunct,[],[normalize_0_9]) ).
cnf(refute_0_0,plain,
( ~ gt(Y,X)
| leq(X,Y) ),
inference(canonicalize,[],[normalize_0_1]) ).
cnf(refute_0_1,plain,
( ~ gt(pv1325,n0)
| leq(n0,pv1325) ),
inference(subst,[],[refute_0_0:[bind(X,$fot(n0)),bind(Y,$fot(pv1325))]]) ).
cnf(refute_0_2,plain,
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(canonicalize,[],[normalize_0_3]) ).
cnf(refute_0_3,plain,
( ~ leq(succ(n0),X_271)
| gt(X_271,n0) ),
inference(subst,[],[refute_0_2:[bind(X,$fot(n0)),bind(Y,$fot(X_271))]]) ).
cnf(refute_0_4,plain,
succ(n0) = n1,
inference(canonicalize,[],[normalize_0_4]) ).
cnf(refute_0_5,plain,
( succ(n0) != n1
| ~ leq(n1,X_271)
| leq(succ(n0),X_271) ),
introduced(tautology,[equality,[$cnf( ~ leq(succ(n0),X_271) ),[0],$fot(n1)]]) ).
cnf(refute_0_6,plain,
( ~ leq(n1,X_271)
| leq(succ(n0),X_271) ),
inference(resolve,[$cnf( $equal(succ(n0),n1) )],[refute_0_4,refute_0_5]) ).
cnf(refute_0_7,plain,
( ~ leq(n1,X_271)
| gt(X_271,n0) ),
inference(resolve,[$cnf( leq(succ(n0),X_271) )],[refute_0_6,refute_0_3]) ).
cnf(refute_0_8,plain,
( ~ leq(n1,pv1325)
| gt(pv1325,n0) ),
inference(subst,[],[refute_0_7:[bind(X_271,$fot(pv1325))]]) ).
cnf(refute_0_9,plain,
( ~ gt(Y,X)
| leq(X,pred(Y)) ),
inference(canonicalize,[],[normalize_0_8]) ).
cnf(refute_0_10,plain,
( ~ gt(succ(pv1325),n1)
| leq(n1,pred(succ(pv1325))) ),
inference(subst,[],[refute_0_9:[bind(X,$fot(n1)),bind(Y,$fot(succ(pv1325)))]]) ).
cnf(refute_0_11,plain,
leq(n2,pv1325),
inference(canonicalize,[],[normalize_0_10]) ).
cnf(refute_0_12,plain,
( ~ leq(X,Y)
| leq(X,succ(Y)) ),
inference(canonicalize,[],[normalize_0_12]) ).
cnf(refute_0_13,plain,
( ~ leq(n2,pv1325)
| leq(n2,succ(pv1325)) ),
inference(subst,[],[refute_0_12:[bind(X,$fot(n2)),bind(Y,$fot(pv1325))]]) ).
cnf(refute_0_14,plain,
leq(n2,succ(pv1325)),
inference(resolve,[$cnf( leq(n2,pv1325) )],[refute_0_11,refute_0_13]) ).
cnf(refute_0_15,plain,
( ~ leq(succ(n1),X_271)
| gt(X_271,n1) ),
inference(subst,[],[refute_0_2:[bind(X,$fot(n1)),bind(Y,$fot(X_271))]]) ).
cnf(refute_0_16,plain,
succ(succ(n0)) = n2,
inference(canonicalize,[],[normalize_0_13]) ).
cnf(refute_0_17,plain,
succ(succ(n0)) = succ(succ(n0)),
introduced(tautology,[refl,[$fot(succ(succ(n0)))]]) ).
cnf(refute_0_18,plain,
( succ(n0) != n1
| succ(succ(n0)) != succ(succ(n0))
| succ(succ(n0)) = succ(n1) ),
introduced(tautology,[equality,[$cnf( $equal(succ(succ(n0)),succ(succ(n0))) ),[1,0],$fot(n1)]]) ).
cnf(refute_0_19,plain,
( succ(n0) != n1
| succ(succ(n0)) = succ(n1) ),
inference(resolve,[$cnf( $equal(succ(succ(n0)),succ(succ(n0))) )],[refute_0_17,refute_0_18]) ).
cnf(refute_0_20,plain,
succ(succ(n0)) = succ(n1),
inference(resolve,[$cnf( $equal(succ(n0),n1) )],[refute_0_4,refute_0_19]) ).
cnf(refute_0_21,plain,
( succ(succ(n0)) != n2
| succ(succ(n0)) != succ(n1)
| succ(n1) = n2 ),
introduced(tautology,[equality,[$cnf( $equal(succ(succ(n0)),n2) ),[0],$fot(succ(n1))]]) ).
cnf(refute_0_22,plain,
( succ(succ(n0)) != n2
| succ(n1) = n2 ),
inference(resolve,[$cnf( $equal(succ(succ(n0)),succ(n1)) )],[refute_0_20,refute_0_21]) ).
cnf(refute_0_23,plain,
succ(n1) = n2,
inference(resolve,[$cnf( $equal(succ(succ(n0)),n2) )],[refute_0_16,refute_0_22]) ).
cnf(refute_0_24,plain,
( succ(n1) != n2
| ~ leq(n2,X_271)
| leq(succ(n1),X_271) ),
introduced(tautology,[equality,[$cnf( ~ leq(succ(n1),X_271) ),[0],$fot(n2)]]) ).
cnf(refute_0_25,plain,
( ~ leq(n2,X_271)
| leq(succ(n1),X_271) ),
inference(resolve,[$cnf( $equal(succ(n1),n2) )],[refute_0_23,refute_0_24]) ).
cnf(refute_0_26,plain,
( ~ leq(n2,X_271)
| gt(X_271,n1) ),
inference(resolve,[$cnf( leq(succ(n1),X_271) )],[refute_0_25,refute_0_15]) ).
cnf(refute_0_27,plain,
( ~ leq(n2,succ(pv1325))
| gt(succ(pv1325),n1) ),
inference(subst,[],[refute_0_26:[bind(X_271,$fot(succ(pv1325)))]]) ).
cnf(refute_0_28,plain,
gt(succ(pv1325),n1),
inference(resolve,[$cnf( leq(n2,succ(pv1325)) )],[refute_0_14,refute_0_27]) ).
cnf(refute_0_29,plain,
leq(n1,pred(succ(pv1325))),
inference(resolve,[$cnf( gt(succ(pv1325),n1) )],[refute_0_28,refute_0_10]) ).
cnf(refute_0_30,plain,
pred(succ(X)) = X,
inference(canonicalize,[],[normalize_0_15]) ).
cnf(refute_0_31,plain,
pred(succ(pv1325)) = pv1325,
inference(subst,[],[refute_0_30:[bind(X,$fot(pv1325))]]) ).
cnf(refute_0_32,plain,
( pred(succ(pv1325)) != pv1325
| ~ leq(n1,pred(succ(pv1325)))
| leq(n1,pv1325) ),
introduced(tautology,[equality,[$cnf( leq(n1,pred(succ(pv1325))) ),[1],$fot(pv1325)]]) ).
cnf(refute_0_33,plain,
( ~ leq(n1,pred(succ(pv1325)))
| leq(n1,pv1325) ),
inference(resolve,[$cnf( $equal(pred(succ(pv1325)),pv1325) )],[refute_0_31,refute_0_32]) ).
cnf(refute_0_34,plain,
leq(n1,pv1325),
inference(resolve,[$cnf( leq(n1,pred(succ(pv1325))) )],[refute_0_29,refute_0_33]) ).
cnf(refute_0_35,plain,
gt(pv1325,n0),
inference(resolve,[$cnf( leq(n1,pv1325) )],[refute_0_34,refute_0_8]) ).
cnf(refute_0_36,plain,
leq(n0,pv1325),
inference(resolve,[$cnf( gt(pv1325,n0) )],[refute_0_35,refute_0_1]) ).
cnf(refute_0_37,plain,
~ leq(n0,pv1325),
inference(canonicalize,[],[normalize_0_16]) ).
cnf(refute_0_38,plain,
$false,
inference(resolve,[$cnf( leq(n0,pv1325) )],[refute_0_36,refute_0_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV137+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13 % Command : metis --show proof --show saturation %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 21:52:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 5.34/5.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.34/5.55
% 5.34/5.55 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.34/5.55
%------------------------------------------------------------------------------