TSTP Solution File: SWV142+1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SWV142+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n020.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 5.67s 5.89s
% Output : CNFRefutation 5.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 139 ( 4 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 154 ( 39 ~; 22 |; 53 &)
% ( 0 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_succ_gt,axiom,
! [X,Y] :
( leq(succ(X),Y)
=> gt(Y,X) ) ).
fof(gauss_array_0012,conjecture,
( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_best7,n3) ) ).
fof(successor_1,axiom,
succ(n0) = n1 ).
fof(subgoal_0,plain,
( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_best7,n3) ),
inference(strip,[],[gauss_array_0012]) ).
fof(negate_0_0,plain,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_best7,n3) ),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
( ~ leq(s_best7,n3)
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341)
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) ) ),
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_1,plain,
leq(n1,loopcounter),
inference(conjunct,[],[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,
( ~ gt(loopcounter,n0)
| leq(s_best7,n3) ),
inference(conjunct,[],[normalize_0_0]) ).
fof(normalize_0_6,plain,
~ leq(s_best7,n3),
inference(conjunct,[],[normalize_0_0]) ).
fof(normalize_0_7,plain,
~ gt(loopcounter,n0),
inference(simplify,[],[normalize_0_5,normalize_0_6]) ).
cnf(refute_0_0,plain,
leq(n1,loopcounter),
inference(canonicalize,[],[normalize_0_1]) ).
cnf(refute_0_1,plain,
( ~ leq(succ(X),Y)
| gt(Y,X) ),
inference(canonicalize,[],[normalize_0_3]) ).
cnf(refute_0_2,plain,
( ~ leq(succ(n0),X_1470)
| gt(X_1470,n0) ),
inference(subst,[],[refute_0_1:[bind(X,$fot(n0)),bind(Y,$fot(X_1470))]]) ).
cnf(refute_0_3,plain,
succ(n0) = n1,
inference(canonicalize,[],[normalize_0_4]) ).
cnf(refute_0_4,plain,
( succ(n0) != n1
| ~ leq(n1,X_1470)
| leq(succ(n0),X_1470) ),
introduced(tautology,[equality,[$cnf( ~ leq(succ(n0),X_1470) ),[0],$fot(n1)]]) ).
cnf(refute_0_5,plain,
( ~ leq(n1,X_1470)
| leq(succ(n0),X_1470) ),
inference(resolve,[$cnf( $equal(succ(n0),n1) )],[refute_0_3,refute_0_4]) ).
cnf(refute_0_6,plain,
( ~ leq(n1,X_1470)
| gt(X_1470,n0) ),
inference(resolve,[$cnf( leq(succ(n0),X_1470) )],[refute_0_5,refute_0_2]) ).
cnf(refute_0_7,plain,
( ~ leq(n1,loopcounter)
| gt(loopcounter,n0) ),
inference(subst,[],[refute_0_6:[bind(X_1470,$fot(loopcounter))]]) ).
cnf(refute_0_8,plain,
gt(loopcounter,n0),
inference(resolve,[$cnf( leq(n1,loopcounter) )],[refute_0_0,refute_0_7]) ).
cnf(refute_0_9,plain,
~ gt(loopcounter,n0),
inference(canonicalize,[],[normalize_0_7]) ).
cnf(refute_0_10,plain,
$false,
inference(resolve,[$cnf( gt(loopcounter,n0) )],[refute_0_8,refute_0_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV142+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13 % Command : metis --show proof --show saturation %s
% 0.13/0.34 % Computer : n020.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 14:27:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 5.67/5.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.67/5.89
% 5.67/5.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.67/5.89
%------------------------------------------------------------------------------