TSTP Solution File: SWV490+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV490+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %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 : 300s
% DateTime : Wed May 1 04:09:15 EDT 2024
% Result : Theorem 0.65s 0.81s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 13
% Syntax : Number of formulae : 94 ( 10 unt; 0 def)
% Number of atoms : 466 ( 102 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 656 ( 284 ~; 270 |; 75 &)
% ( 7 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 128 ( 118 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f299,plain,
$false,
inference(avatar_sat_refutation,[],[f73,f82,f83,f256,f285,f292,f298]) ).
fof(f298,plain,
~ spl3_10,
inference(avatar_contradiction_clause,[],[f297]) ).
fof(f297,plain,
( $false
| ~ spl3_10 ),
inference(subsumption_resolution,[],[f296,f39]) ).
fof(f39,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ( ( real_zero = a(sK0,sK1)
& sK0 = sK1 )
| ( real_zero != a(sK0,sK1)
& sK0 != sK1 ) )
& int_leq(sK1,n)
& int_leq(int_one,sK1)
& int_leq(sK0,n)
& int_leq(int_one,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f20,f26]) ).
fof(f26,plain,
( ? [X0,X1] :
( ( ( real_zero = a(X0,X1)
& X0 = X1 )
| ( real_zero != a(X0,X1)
& X0 != X1 ) )
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ( ( real_zero = a(sK0,sK1)
& sK0 = sK1 )
| ( real_zero != a(sK0,sK1)
& sK0 != sK1 ) )
& int_leq(sK1,n)
& int_leq(int_one,sK1)
& int_leq(sK0,n)
& int_leq(int_one,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( ( ( real_zero = a(X0,X1)
& X0 = X1 )
| ( real_zero != a(X0,X1)
& X0 != X1 ) )
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X0,X1] :
( ( ( real_zero = a(X0,X1)
& X0 = X1 )
| ( real_zero != a(X0,X1)
& X0 != X1 ) )
& int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ( X0 = X1
=> real_zero != a(X0,X1) )
& ( X0 != X1
=> real_zero = a(X0,X1) ) ) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ( X0 = X1
=> real_zero != a(X0,X1) )
& ( X0 != X1
=> real_zero = a(X0,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vmjSUoQFEr/Vampire---4.8_29556',di) ).
fof(f296,plain,
( ~ int_leq(sK0,n)
| ~ spl3_10 ),
inference(subsumption_resolution,[],[f294,f38]) ).
fof(f38,plain,
int_leq(int_one,sK0),
inference(cnf_transformation,[],[f27]) ).
fof(f294,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ spl3_10 ),
inference(resolution,[],[f273,f66]) ).
fof(f66,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f54]) ).
fof(f54,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( X0 != X1
& ~ int_less(X0,X1) ) )
& ( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( X0 != X1
& ~ int_less(X0,X1) ) )
& ( X0 = X1
| int_less(X0,X1)
| ~ int_leq(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( X0 = X1
| int_less(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vmjSUoQFEr/Vampire---4.8_29556',int_leq) ).
fof(f273,plain,
( ! [X1] :
( ~ int_leq(sK0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) )
| ~ spl3_10 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f272,plain,
( spl3_10
<=> ! [X1] :
( ~ int_leq(int_one,X1)
| ~ int_leq(sK0,X1)
| ~ int_leq(X1,n) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_10])]) ).
fof(f292,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f291,plain,
( $false
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f287,f41]) ).
fof(f41,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f27]) ).
fof(f287,plain,
( ~ int_leq(sK1,n)
| ~ spl3_1 ),
inference(resolution,[],[f69,f40]) ).
fof(f40,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f69,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,n) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f68]) ).
fof(f68,plain,
( spl3_1
<=> ! [X0] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f285,plain,
( spl3_10
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f284,f79,f75,f71,f272]) ).
fof(f71,plain,
( spl3_2
<=> ! [X4,X1] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f75,plain,
( spl3_3
<=> sK0 = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f79,plain,
( spl3_4
<=> real_zero = a(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f284,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(sK0,X0) )
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f265,f38]) ).
fof(f265,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,X0) )
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f264]) ).
fof(f264,plain,
( ! [X0] :
( real_zero != real_zero
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,X0) )
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(superposition,[],[f85,f259]) ).
fof(f259,plain,
( real_zero = a(sK0,sK0)
| ~ spl3_3
| ~ spl3_4 ),
inference(superposition,[],[f81,f76]) ).
fof(f76,plain,
( sK0 = sK1
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f81,plain,
( real_zero = a(sK0,sK1)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f85,plain,
( ! [X0,X1] :
( real_zero != a(X0,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,X1) )
| ~ spl3_2 ),
inference(superposition,[],[f61,f72]) ).
fof(f72,plain,
( ! [X1,X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f61,plain,
real_zero != real_one,
inference(cnf_transformation,[],[f11]) ).
fof(f11,axiom,
real_zero != real_one,
file('/export/starexec/sandbox2/tmp/tmp.vmjSUoQFEr/Vampire---4.8_29556',real_constants) ).
fof(f256,plain,
( spl3_3
| spl3_4 ),
inference(avatar_contradiction_clause,[],[f255]) ).
fof(f255,plain,
( $false
| spl3_3
| spl3_4 ),
inference(subsumption_resolution,[],[f251,f163]) ).
fof(f163,plain,
( ~ int_leq(sK0,sK1)
| spl3_3
| spl3_4 ),
inference(subsumption_resolution,[],[f161,f77]) ).
fof(f77,plain,
( sK0 != sK1
| spl3_3 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f161,plain,
( sK0 = sK1
| ~ int_leq(sK0,sK1)
| spl3_4 ),
inference(resolution,[],[f159,f52]) ).
fof(f52,plain,
! [X0,X1] :
( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f159,plain,
( ~ int_less(sK0,sK1)
| spl3_4 ),
inference(subsumption_resolution,[],[f158,f39]) ).
fof(f158,plain,
( ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_4 ),
inference(subsumption_resolution,[],[f157,f40]) ).
fof(f157,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_4 ),
inference(subsumption_resolution,[],[f156,f41]) ).
fof(f156,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_4 ),
inference(subsumption_resolution,[],[f152,f38]) ).
fof(f152,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_4 ),
inference(trivial_inequality_removal,[],[f142]) ).
fof(f142,plain,
( real_zero != real_zero
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_4 ),
inference(superposition,[],[f80,f138]) ).
fof(f138,plain,
! [X0,X1] :
( real_zero = a(X0,X1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f137,f66]) ).
fof(f137,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_less(X0,X1) ),
inference(duplicate_literal_removal,[],[f134]) ).
fof(f134,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_less(X0,X1)
| ~ int_less(X0,X1) ),
inference(superposition,[],[f112,f47]) ).
fof(f47,plain,
! [X0,X1] :
( plus(X0,sK2(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ( int_less(int_zero,sK2(X0,X1))
& plus(X0,sK2(X0,X1)) = X1 )
| ~ int_less(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f29,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 )
=> ( int_less(int_zero,sK2(X0,X1))
& plus(X0,sK2(X0,X1)) = X1 ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 )
| ~ int_less(X0,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 ) )
& ( ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 )
| ~ int_less(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( int_less(X0,X1)
<=> ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.vmjSUoQFEr/Vampire---4.8_29556',plus_and_inverse) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ int_leq(plus(X2,sK2(X0,X1)),n)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| real_zero = a(X0,X1)
| ~ int_leq(int_one,plus(X2,sK2(X0,X1)))
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f108,f48]) ).
fof(f48,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f108,plain,
! [X2,X0,X1] :
( real_zero = a(X0,X1)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| ~ int_less(int_zero,sK2(X0,X1))
| ~ int_leq(plus(X2,sK2(X0,X1)),n)
| ~ int_leq(int_one,plus(X2,sK2(X0,X1)))
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_less(X0,X1) ),
inference(superposition,[],[f62,f47]) ).
fof(f62,plain,
! [X2,X3,X0] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3)
| ~ int_less(int_zero,X2)
| ~ int_leq(plus(X0,X2),n)
| ~ int_leq(int_one,plus(X0,X2))
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(equality_resolution,[],[f37]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3)
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) )
& ! [X5] :
( ! [X6] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6) )
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( real_zero = a(X3,plus(X3,X2))
| ~ int_leq(X3,X0)
| ~ int_leq(int_one,X3) )
| plus(X0,X2) != X1
| ~ int_less(int_zero,X2) )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4) )
& ! [X5] :
( ! [X6] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6) )
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5) ) )
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X2] :
( ( plus(X0,X2) = X1
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X0)
& int_leq(int_one,X3) )
=> real_zero = a(X3,plus(X3,X2)) ) )
& ! [X4] :
( ( int_leq(X4,X1)
& int_leq(int_one,X4) )
=> real_one = a(X4,X4) )
& ! [X5] :
( ( plus(X1,X5) = X0
& int_less(int_zero,X5) )
=> ! [X6] :
( ( int_leq(X6,X1)
& int_leq(int_one,X6) )
=> real_zero = a(plus(X6,X5),X6) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X7] :
( ( plus(X0,X7) = X1
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X0)
& int_leq(int_one,X2) )
=> real_zero = a(X2,plus(X2,X7)) ) )
& ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> real_one = a(X2,X2) )
& ! [X7] :
( ( plus(X1,X7) = X0
& int_less(int_zero,X7) )
=> ! [X2] :
( ( int_leq(X2,X1)
& int_leq(int_one,X2) )
=> real_zero = a(plus(X2,X7),X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vmjSUoQFEr/Vampire---4.8_29556',qii) ).
fof(f80,plain,
( real_zero != a(sK0,sK1)
| spl3_4 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f251,plain,
( int_leq(sK0,sK1)
| spl3_4 ),
inference(resolution,[],[f248,f51]) ).
fof(f51,plain,
! [X0,X1] :
( int_less(X0,X1)
| int_leq(X1,X0) ),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( int_leq(X1,X0)
| int_less(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.vmjSUoQFEr/Vampire---4.8_29556',int_less_total) ).
fof(f248,plain,
( ~ int_less(sK1,sK0)
| spl3_4 ),
inference(subsumption_resolution,[],[f247,f38]) ).
fof(f247,plain,
( ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_4 ),
inference(subsumption_resolution,[],[f246,f39]) ).
fof(f246,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_4 ),
inference(subsumption_resolution,[],[f245,f41]) ).
fof(f245,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_4 ),
inference(subsumption_resolution,[],[f241,f40]) ).
fof(f241,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_4 ),
inference(trivial_inequality_removal,[],[f231]) ).
fof(f231,plain,
( real_zero != real_zero
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_4 ),
inference(superposition,[],[f80,f168]) ).
fof(f168,plain,
! [X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f167,f66]) ).
fof(f167,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_less(X0,X1) ),
inference(duplicate_literal_removal,[],[f164]) ).
fof(f164,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(X0,X0)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_less(X0,X1)
| ~ int_less(X0,X1) ),
inference(superposition,[],[f117,f47]) ).
fof(f117,plain,
! [X2,X0,X1] :
( ~ int_leq(plus(X2,sK2(X0,X1)),n)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| real_zero = a(X1,X0)
| ~ int_leq(int_one,plus(X2,sK2(X0,X1)))
| ~ int_less(X0,X1) ),
inference(subsumption_resolution,[],[f113,f48]) ).
fof(f113,plain,
! [X2,X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(X0,X2)
| ~ int_leq(int_one,X0)
| ~ int_less(int_zero,sK2(X0,X1))
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(plus(X2,sK2(X0,X1)),n)
| ~ int_leq(int_one,plus(X2,sK2(X0,X1)))
| ~ int_less(X0,X1) ),
inference(superposition,[],[f63,f47]) ).
fof(f63,plain,
! [X1,X6,X5] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6)
| ~ int_less(int_zero,X5)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(plus(X1,X5),n)
| ~ int_leq(int_one,plus(X1,X5)) ),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X6,X5] :
( real_zero = a(plus(X6,X5),X6)
| ~ int_leq(X6,X1)
| ~ int_leq(int_one,X6)
| plus(X1,X5) != X0
| ~ int_less(int_zero,X5)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f83,plain,
( ~ spl3_4
| spl3_3 ),
inference(avatar_split_clause,[],[f43,f75,f79]) ).
fof(f43,plain,
( sK0 = sK1
| real_zero != a(sK0,sK1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f82,plain,
( ~ spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f44,f79,f75]) ).
fof(f44,plain,
( real_zero = a(sK0,sK1)
| sK0 != sK1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f73,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f36,f71,f68]) ).
fof(f36,plain,
! [X0,X1,X4] :
( real_one = a(X4,X4)
| ~ int_leq(X4,X1)
| ~ int_leq(int_one,X4)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : SWV490+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.31 % Computer : n008.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.31 % CPULimit : 300
% 0.17/0.31 % WCLimit : 300
% 0.17/0.31 % DateTime : Tue Apr 30 18:39:42 EDT 2024
% 0.17/0.31 % CPUTime :
% 0.17/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.17/0.31 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.vmjSUoQFEr/Vampire---4.8_29556
% 0.61/0.80 % (29671)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.80 % (29674)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.80 % (29673)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.80 % (29672)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.61/0.80 % (29676)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.80 % (29675)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.80 % (29677)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.61/0.80 % (29678)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.80 % (29678)Refutation not found, incomplete strategy% (29678)------------------------------
% 0.61/0.80 % (29678)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (29678)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (29678)Memory used [KB]: 1046
% 0.61/0.80 % (29675)Refutation not found, incomplete strategy% (29675)------------------------------
% 0.61/0.80 % (29675)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (29678)Time elapsed: 0.003 s
% 0.61/0.80 % (29678)Instructions burned: 3 (million)
% 0.61/0.80 % (29678)------------------------------
% 0.61/0.80 % (29678)------------------------------
% 0.61/0.80 % (29675)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (29675)Memory used [KB]: 1048
% 0.61/0.80 % (29675)Time elapsed: 0.004 s
% 0.61/0.80 % (29675)Instructions burned: 4 (million)
% 0.61/0.80 % (29675)------------------------------
% 0.61/0.80 % (29675)------------------------------
% 0.65/0.81 % (29679)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.65/0.81 % (29680)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.65/0.81 % (29676)First to succeed.
% 0.65/0.81 % (29676)Refutation found. Thanks to Tanya!
% 0.65/0.81 % SZS status Theorem for Vampire---4
% 0.65/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.65/0.81 % (29676)------------------------------
% 0.65/0.81 % (29676)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.65/0.81 % (29676)Termination reason: Refutation
% 0.65/0.81
% 0.65/0.81 % (29676)Memory used [KB]: 1100
% 0.65/0.81 % (29676)Time elapsed: 0.011 s
% 0.65/0.81 % (29676)Instructions burned: 17 (million)
% 0.65/0.81 % (29676)------------------------------
% 0.65/0.81 % (29676)------------------------------
% 0.65/0.81 % (29665)Success in time 0.493 s
% 0.65/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------