TSTP Solution File: SWV138+1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SWV138+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n008.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:15 EDT 2022
% Result : Theorem 13.86s 14.08s
% Output : CNFRefutation 13.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 18 unt; 0 def)
% Number of atoms : 110 ( 21 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 94 ( 30 ~; 26 |; 33 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_gt1,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ) ).
fof(leq_succ_gt,axiom,
! [X,Y] :
( leq(succ(X),Y)
=> gt(Y,X) ) ).
fof(gauss_array_0008,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)
& gt(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)) )
=> 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)
& gt(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)) )
=> leq(n0,pv1325) ),
inference(strip,[],[gauss_array_0008]) ).
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)
& gt(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7)) )
=> 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,
( ~ leq(n0,pv1325)
& gt(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& 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_3,plain,
leq(n2,pv1325),
inference(conjunct,[],[normalize_0_2]) ).
fof(normalize_0_4,plain,
! [X,Y] :
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(canonicalize,[],[leq_succ_gt]) ).
fof(normalize_0_5,plain,
! [X,Y] :
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(specialize,[],[normalize_0_4]) ).
fof(normalize_0_6,plain,
succ(succ(n0)) = n2,
inference(canonicalize,[],[successor_2]) ).
fof(normalize_0_7,plain,
succ(n0) = n1,
inference(canonicalize,[],[successor_1]) ).
fof(normalize_0_8,plain,
~ leq(n0,pv1325),
inference(conjunct,[],[normalize_0_2]) ).
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,
( ~ gt(pv1325,n1)
| leq(n1,pv1325) ),
inference(subst,[],[refute_0_0:[bind(X,$fot(n1)),bind(Y,$fot(pv1325))]]) ).
cnf(refute_0_3,plain,
leq(n2,pv1325),
inference(canonicalize,[],[normalize_0_3]) ).
cnf(refute_0_4,plain,
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(canonicalize,[],[normalize_0_5]) ).
cnf(refute_0_5,plain,
( ~ leq(succ(n1),X_1225)
| gt(X_1225,n1) ),
inference(subst,[],[refute_0_4:[bind(X,$fot(n1)),bind(Y,$fot(X_1225))]]) ).
cnf(refute_0_6,plain,
succ(succ(n0)) = n2,
inference(canonicalize,[],[normalize_0_6]) ).
cnf(refute_0_7,plain,
succ(n0) = n1,
inference(canonicalize,[],[normalize_0_7]) ).
cnf(refute_0_8,plain,
succ(succ(n0)) = succ(succ(n0)),
introduced(tautology,[refl,[$fot(succ(succ(n0)))]]) ).
cnf(refute_0_9,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_10,plain,
( succ(n0) != n1
| succ(succ(n0)) = succ(n1) ),
inference(resolve,[$cnf( $equal(succ(succ(n0)),succ(succ(n0))) )],[refute_0_8,refute_0_9]) ).
cnf(refute_0_11,plain,
succ(succ(n0)) = succ(n1),
inference(resolve,[$cnf( $equal(succ(n0),n1) )],[refute_0_7,refute_0_10]) ).
cnf(refute_0_12,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_13,plain,
( succ(succ(n0)) != n2
| succ(n1) = n2 ),
inference(resolve,[$cnf( $equal(succ(succ(n0)),succ(n1)) )],[refute_0_11,refute_0_12]) ).
cnf(refute_0_14,plain,
succ(n1) = n2,
inference(resolve,[$cnf( $equal(succ(succ(n0)),n2) )],[refute_0_6,refute_0_13]) ).
cnf(refute_0_15,plain,
( succ(n1) != n2
| ~ leq(n2,X_1225)
| leq(succ(n1),X_1225) ),
introduced(tautology,[equality,[$cnf( ~ leq(succ(n1),X_1225) ),[0],$fot(n2)]]) ).
cnf(refute_0_16,plain,
( ~ leq(n2,X_1225)
| leq(succ(n1),X_1225) ),
inference(resolve,[$cnf( $equal(succ(n1),n2) )],[refute_0_14,refute_0_15]) ).
cnf(refute_0_17,plain,
( ~ leq(n2,X_1225)
| gt(X_1225,n1) ),
inference(resolve,[$cnf( leq(succ(n1),X_1225) )],[refute_0_16,refute_0_5]) ).
cnf(refute_0_18,plain,
( ~ leq(n2,pv1325)
| gt(pv1325,n1) ),
inference(subst,[],[refute_0_17:[bind(X_1225,$fot(pv1325))]]) ).
cnf(refute_0_19,plain,
gt(pv1325,n1),
inference(resolve,[$cnf( leq(n2,pv1325) )],[refute_0_3,refute_0_18]) ).
cnf(refute_0_20,plain,
leq(n1,pv1325),
inference(resolve,[$cnf( gt(pv1325,n1) )],[refute_0_19,refute_0_2]) ).
cnf(refute_0_21,plain,
( ~ leq(succ(n0),X_1225)
| gt(X_1225,n0) ),
inference(subst,[],[refute_0_4:[bind(X,$fot(n0)),bind(Y,$fot(X_1225))]]) ).
cnf(refute_0_22,plain,
( succ(n0) != n1
| ~ leq(n1,X_1225)
| leq(succ(n0),X_1225) ),
introduced(tautology,[equality,[$cnf( ~ leq(succ(n0),X_1225) ),[0],$fot(n1)]]) ).
cnf(refute_0_23,plain,
( ~ leq(n1,X_1225)
| leq(succ(n0),X_1225) ),
inference(resolve,[$cnf( $equal(succ(n0),n1) )],[refute_0_7,refute_0_22]) ).
cnf(refute_0_24,plain,
( ~ leq(n1,X_1225)
| gt(X_1225,n0) ),
inference(resolve,[$cnf( leq(succ(n0),X_1225) )],[refute_0_23,refute_0_21]) ).
cnf(refute_0_25,plain,
( ~ leq(n1,pv1325)
| gt(pv1325,n0) ),
inference(subst,[],[refute_0_24:[bind(X_1225,$fot(pv1325))]]) ).
cnf(refute_0_26,plain,
gt(pv1325,n0),
inference(resolve,[$cnf( leq(n1,pv1325) )],[refute_0_20,refute_0_25]) ).
cnf(refute_0_27,plain,
leq(n0,pv1325),
inference(resolve,[$cnf( gt(pv1325,n0) )],[refute_0_26,refute_0_1]) ).
cnf(refute_0_28,plain,
~ leq(n0,pv1325),
inference(canonicalize,[],[normalize_0_8]) ).
cnf(refute_0_29,plain,
$false,
inference(resolve,[$cnf( leq(n0,pv1325) )],[refute_0_27,refute_0_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV138+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : metis --show proof --show saturation %s
% 0.13/0.34 % Computer : n008.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 : Tue Jun 14 19:02:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 13.86/14.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.86/14.08
% 13.86/14.08 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.86/14.09
%------------------------------------------------------------------------------