TSTP Solution File: SWV491+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV491+4 : 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 : n029.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 : Sun May 5 10:35:00 EDT 2024
% Result : Theorem 0.75s 0.84s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of formulae : 82 ( 7 unt; 0 def)
% Number of atoms : 420 ( 99 equ)
% Maximal formula atoms : 17 ( 5 avg)
% Number of connectives : 583 ( 245 ~; 236 |; 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 : 121 ( 111 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f491,plain,
$false,
inference(avatar_sat_refutation,[],[f73,f87,f88,f432,f461,f490]) ).
fof(f490,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f489]) ).
fof(f489,plain,
( $false
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f481,f41]) ).
fof(f41,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ( ( real_one != 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_one != 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_one != 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_one != 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_one != 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_one = 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_one = a(X0,X1) )
& ( X0 != X1
=> real_zero = a(X0,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.PBpSkfhD6i/Vampire---4.8_26155',id) ).
fof(f481,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(f461,plain,
( ~ spl3_2
| spl3_4
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f451]) ).
fof(f451,plain,
( $false
| ~ spl3_2
| spl3_4
| ~ spl3_5 ),
inference(unit_resulting_resolution,[],[f66,f38,f39,f38,f437,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(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(f437,plain,
( real_one != a(sK0,sK0)
| spl3_4
| ~ spl3_5 ),
inference(superposition,[],[f81,f85]) ).
fof(f85,plain,
( sK0 = sK1
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f84,plain,
( spl3_5
<=> sK0 = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f81,plain,
( real_one != a(sK0,sK1)
| spl3_4 ),
inference(avatar_component_clause,[],[f79]) ).
fof(f79,plain,
( spl3_4
<=> real_one = a(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f39,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f27]) ).
fof(f38,plain,
int_leq(int_one,sK0),
inference(cnf_transformation,[],[f27]) ).
fof(f66,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f55]) ).
fof(f55,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.PBpSkfhD6i/Vampire---4.8_26155',int_leq) ).
fof(f432,plain,
( spl3_5
| spl3_3 ),
inference(avatar_split_clause,[],[f431,f75,f84]) ).
fof(f75,plain,
( spl3_3
<=> real_zero = a(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f431,plain,
( sK0 = sK1
| spl3_3 ),
inference(subsumption_resolution,[],[f428,f361]) ).
fof(f361,plain,
( int_leq(sK1,sK0)
| spl3_3 ),
inference(resolution,[],[f359,f60]) ).
fof(f60,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.PBpSkfhD6i/Vampire---4.8_26155',int_less_total) ).
fof(f359,plain,
( ~ int_less(sK0,sK1)
| spl3_3 ),
inference(subsumption_resolution,[],[f358,f39]) ).
fof(f358,plain,
( ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_3 ),
inference(subsumption_resolution,[],[f357,f40]) ).
fof(f357,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_3 ),
inference(subsumption_resolution,[],[f356,f41]) ).
fof(f356,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_3 ),
inference(subsumption_resolution,[],[f346,f38]) ).
fof(f346,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_3 ),
inference(trivial_inequality_removal,[],[f324]) ).
fof(f324,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_3 ),
inference(superposition,[],[f77,f169]) ).
fof(f169,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,[],[f168,f66]) ).
fof(f168,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,[],[f165]) ).
fof(f165,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,[],[f96,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.PBpSkfhD6i/Vampire---4.8_26155',plus_and_inverse) ).
fof(f96,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,[],[f92,f48]) ).
fof(f48,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f92,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.PBpSkfhD6i/Vampire---4.8_26155',qii) ).
fof(f77,plain,
( real_zero != a(sK0,sK1)
| spl3_3 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f428,plain,
( sK0 = sK1
| ~ int_leq(sK1,sK0)
| spl3_3 ),
inference(resolution,[],[f425,f53]) ).
fof(f53,plain,
! [X0,X1] :
( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f425,plain,
( ~ int_less(sK1,sK0)
| spl3_3 ),
inference(subsumption_resolution,[],[f424,f38]) ).
fof(f424,plain,
( ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_3 ),
inference(subsumption_resolution,[],[f423,f39]) ).
fof(f423,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_3 ),
inference(subsumption_resolution,[],[f422,f41]) ).
fof(f422,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_3 ),
inference(subsumption_resolution,[],[f412,f40]) ).
fof(f412,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_3 ),
inference(trivial_inequality_removal,[],[f390]) ).
fof(f390,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_3 ),
inference(superposition,[],[f77,f175]) ).
fof(f175,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,[],[f174,f66]) ).
fof(f174,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,[],[f171]) ).
fof(f171,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,[],[f108,f47]) ).
fof(f108,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,[],[f102,f48]) ).
fof(f102,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(f88,plain,
( ~ spl3_3
| spl3_5 ),
inference(avatar_split_clause,[],[f43,f84,f75]) ).
fof(f43,plain,
( sK0 = sK1
| real_zero != a(sK0,sK1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f87,plain,
( ~ spl3_5
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f44,f79,f84]) ).
fof(f44,plain,
( real_one != 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.03/0.12 % Problem : SWV491+4 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.14 % 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.13/0.34 % Computer : n029.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 : 300
% 0.13/0.34 % DateTime : Fri May 3 21:11:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 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.PBpSkfhD6i/Vampire---4.8_26155
% 0.59/0.79 % (26264)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.59/0.79 % (26265)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.59/0.79 % (26266)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.59/0.79 % (26267)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.59/0.79 % (26268)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.59/0.79 % (26269)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.59/0.79 % (26263)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.59/0.79 % (26270)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.59/0.80 % (26267)Refutation not found, incomplete strategy% (26267)------------------------------
% 0.59/0.80 % (26267)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (26267)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.80
% 0.59/0.80 % (26267)Memory used [KB]: 1049
% 0.59/0.80 % (26267)Time elapsed: 0.004 s
% 0.59/0.80 % (26267)Instructions burned: 4 (million)
% 0.59/0.80 % (26267)------------------------------
% 0.59/0.80 % (26267)------------------------------
% 0.59/0.80 % (26270)Refutation not found, incomplete strategy% (26270)------------------------------
% 0.59/0.80 % (26270)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (26270)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.80
% 0.59/0.80 % (26270)Memory used [KB]: 1046
% 0.59/0.80 % (26270)Time elapsed: 0.003 s
% 0.59/0.80 % (26270)Instructions burned: 4 (million)
% 0.59/0.80 % (26270)------------------------------
% 0.59/0.80 % (26270)------------------------------
% 0.59/0.80 % (26272)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.59/0.80 % (26271)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.59/0.81 % (26266)Instruction limit reached!
% 0.59/0.81 % (26266)------------------------------
% 0.59/0.81 % (26266)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.81 % (26266)Termination reason: Unknown
% 0.59/0.81 % (26266)Termination phase: Saturation
% 0.59/0.81
% 0.59/0.81 % (26266)Memory used [KB]: 1413
% 0.59/0.81 % (26266)Time elapsed: 0.018 s
% 0.59/0.81 % (26266)Instructions burned: 33 (million)
% 0.59/0.81 % (26266)------------------------------
% 0.59/0.81 % (26266)------------------------------
% 0.59/0.81 % (26263)Instruction limit reached!
% 0.59/0.81 % (26263)------------------------------
% 0.59/0.81 % (26263)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.81 % (26263)Termination reason: Unknown
% 0.59/0.81 % (26263)Termination phase: Saturation
% 0.59/0.81
% 0.59/0.81 % (26263)Memory used [KB]: 1199
% 0.59/0.81 % (26263)Time elapsed: 0.021 s
% 0.59/0.81 % (26263)Instructions burned: 35 (million)
% 0.59/0.81 % (26263)------------------------------
% 0.59/0.81 % (26263)------------------------------
% 0.59/0.82 % (26268)Instruction limit reached!
% 0.59/0.82 % (26268)------------------------------
% 0.59/0.82 % (26268)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.82 % (26268)Termination reason: Unknown
% 0.59/0.82 % (26268)Termination phase: Saturation
% 0.59/0.82
% 0.59/0.82 % (26268)Memory used [KB]: 1301
% 0.59/0.82 % (26268)Time elapsed: 0.023 s
% 0.59/0.82 % (26268)Instructions burned: 45 (million)
% 0.59/0.82 % (26268)------------------------------
% 0.59/0.82 % (26268)------------------------------
% 0.59/0.82 % (26273)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.59/0.82 % (26275)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on Vampire---4 for (2995ds/518Mi)
% 0.59/0.82 % (26264)Instruction limit reached!
% 0.59/0.82 % (26264)------------------------------
% 0.59/0.82 % (26264)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.82 % (26264)Termination reason: Unknown
% 0.59/0.82 % (26264)Termination phase: Saturation
% 0.59/0.82
% 0.59/0.82 % (26264)Memory used [KB]: 1351
% 0.59/0.82 % (26264)Time elapsed: 0.027 s
% 0.59/0.82 % (26264)Instructions burned: 51 (million)
% 0.59/0.82 % (26264)------------------------------
% 0.59/0.82 % (26264)------------------------------
% 0.59/0.82 % (26274)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2995ds/52Mi)
% 0.59/0.82 % (26276)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on Vampire---4 for (2995ds/42Mi)
% 0.59/0.82 % (26272)Instruction limit reached!
% 0.59/0.82 % (26272)------------------------------
% 0.59/0.82 % (26272)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.82 % (26272)Termination reason: Unknown
% 0.59/0.82 % (26272)Termination phase: Saturation
% 0.59/0.82
% 0.59/0.82 % (26272)Memory used [KB]: 1337
% 0.59/0.82 % (26272)Time elapsed: 0.025 s
% 0.59/0.82 % (26272)Instructions burned: 50 (million)
% 0.59/0.82 % (26272)------------------------------
% 0.59/0.82 % (26272)------------------------------
% 0.59/0.83 % (26277)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on Vampire---4 for (2995ds/243Mi)
% 0.75/0.83 % (26271)Instruction limit reached!
% 0.75/0.83 % (26271)------------------------------
% 0.75/0.83 % (26271)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.75/0.83 % (26271)Termination reason: Unknown
% 0.75/0.83 % (26271)Termination phase: Saturation
% 0.75/0.83
% 0.75/0.83 % (26271)Memory used [KB]: 1594
% 0.75/0.83 % (26271)Time elapsed: 0.029 s
% 0.75/0.83 % (26271)Instructions burned: 56 (million)
% 0.75/0.83 % (26271)------------------------------
% 0.75/0.83 % (26271)------------------------------
% 0.75/0.83 % (26278)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on Vampire---4 for (2995ds/117Mi)
% 0.75/0.83 % (26269)Instruction limit reached!
% 0.75/0.83 % (26269)------------------------------
% 0.75/0.83 % (26269)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.75/0.83 % (26269)Termination reason: Unknown
% 0.75/0.83 % (26269)Termination phase: Saturation
% 0.75/0.83
% 0.75/0.83 % (26269)Memory used [KB]: 1858
% 0.75/0.83 % (26269)Time elapsed: 0.041 s
% 0.75/0.83 % (26269)Instructions burned: 83 (million)
% 0.75/0.83 % (26269)------------------------------
% 0.75/0.83 % (26269)------------------------------
% 0.75/0.84 % (26265)Instruction limit reached!
% 0.75/0.84 % (26265)------------------------------
% 0.75/0.84 % (26265)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.75/0.84 % (26265)Termination reason: Unknown
% 0.75/0.84 % (26265)Termination phase: Saturation
% 0.75/0.84
% 0.75/0.84 % (26265)Memory used [KB]: 1436
% 0.75/0.84 % (26265)Time elapsed: 0.043 s
% 0.75/0.84 % (26265)Instructions burned: 78 (million)
% 0.75/0.84 % (26265)------------------------------
% 0.75/0.84 % (26265)------------------------------
% 0.75/0.84 % (26275)First to succeed.
% 0.75/0.84 % (26279)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on Vampire---4 for (2995ds/143Mi)
% 0.75/0.84 % (26275)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-26262"
% 0.75/0.84 % (26280)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on Vampire---4 for (2995ds/93Mi)
% 0.75/0.84 % (26275)Refutation found. Thanks to Tanya!
% 0.75/0.84 % SZS status Theorem for Vampire---4
% 0.75/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.75/0.84 % (26275)------------------------------
% 0.75/0.84 % (26275)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.75/0.84 % (26275)Termination reason: Refutation
% 0.75/0.84
% 0.75/0.84 % (26275)Memory used [KB]: 1164
% 0.75/0.84 % (26275)Time elapsed: 0.022 s
% 0.75/0.84 % (26275)Instructions burned: 42 (million)
% 0.75/0.84 % (26262)Success in time 0.473 s
% 0.75/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------