TSTP Solution File: SWV491+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV491+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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.60s 0.79s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of formulae : 96 ( 8 unt; 0 def)
% Number of atoms : 470 ( 102 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 639 ( 265 ~; 260 |; 82 &)
% ( 9 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 122 ( 112 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f600,plain,
$false,
inference(avatar_sat_refutation,[],[f79,f99,f104,f107,f381,f388,f397,f426,f429,f599]) ).
fof(f599,plain,
( spl3_3
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f598]) ).
fof(f598,plain,
( $false
| spl3_3
| ~ spl3_6 ),
inference(subsumption_resolution,[],[f597,f97]) ).
fof(f97,plain,
( int_less(sK1,sK0)
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f95]) ).
fof(f95,plain,
( spl3_6
<=> int_less(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f597,plain,
( ~ int_less(sK1,sK0)
| spl3_3 ),
inference(subsumption_resolution,[],[f596,f38]) ).
fof(f38,plain,
int_leq(int_one,sK0),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ( ( real_one != a(sK0,sK1)
& sK0 = sK1 )
| ( real_zero != a(sK0,sK1)
& int_less(sK1,sK0) )
| ( real_zero != a(sK0,sK1)
& int_less(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)
& int_less(X1,X0) )
| ( real_zero != a(X0,X1)
& int_less(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)
& int_less(sK1,sK0) )
| ( real_zero != a(sK0,sK1)
& int_less(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)
& int_less(X1,X0) )
| ( real_zero != a(X0,X1)
& int_less(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)
& int_less(X1,X0) )
| ( real_zero != a(X0,X1)
& int_less(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) )
& ( int_less(X1,X0)
=> real_zero = a(X0,X1) )
& ( int_less(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) )
& ( int_less(X1,X0)
=> real_zero = a(X0,X1) )
& ( int_less(X0,X1)
=> real_zero = a(X0,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.NBzd5k1t0Y/Vampire---4.8_20290',diag) ).
fof(f596,plain,
( ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_3 ),
inference(subsumption_resolution,[],[f595,f39]) ).
fof(f39,plain,
int_leq(sK0,n),
inference(cnf_transformation,[],[f27]) ).
fof(f595,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_3 ),
inference(subsumption_resolution,[],[f594,f41]) ).
fof(f41,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f27]) ).
fof(f594,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK0)
| ~ int_less(sK1,sK0)
| spl3_3 ),
inference(subsumption_resolution,[],[f558,f40]) ).
fof(f40,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f558,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,[],[f557]) ).
fof(f557,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,[],[f83,f194]) ).
fof(f194,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,[],[f193,f70]) ).
fof(f70,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f59]) ).
fof(f59,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/sandbox/tmp/tmp.NBzd5k1t0Y/Vampire---4.8_20290',int_leq) ).
fof(f193,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,[],[f190]) ).
fof(f190,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,[],[f127,f51]) ).
fof(f51,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/sandbox/tmp/tmp.NBzd5k1t0Y/Vampire---4.8_20290',plus_and_inverse) ).
fof(f127,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,[],[f121,f52]) ).
fof(f52,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f121,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,[],[f67,f51]) ).
fof(f67,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(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/sandbox/tmp/tmp.NBzd5k1t0Y/Vampire---4.8_20290',qih) ).
fof(f83,plain,
( real_zero != a(sK0,sK1)
| spl3_3 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f81,plain,
( spl3_3
<=> real_zero = a(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f429,plain,
( ~ spl3_6
| ~ spl3_7 ),
inference(avatar_contradiction_clause,[],[f428]) ).
fof(f428,plain,
( $false
| ~ spl3_6
| ~ spl3_7 ),
inference(subsumption_resolution,[],[f427,f69]) ).
fof(f69,plain,
! [X1] : ~ int_less(X1,X1),
inference(equality_resolution,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( X0 != X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( X0 != X1
| ~ int_less(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( int_less(X0,X1)
=> X0 != X1 ),
file('/export/starexec/sandbox/tmp/tmp.NBzd5k1t0Y/Vampire---4.8_20290',int_less_irreflexive) ).
fof(f427,plain,
( int_less(sK0,sK0)
| ~ spl3_6
| ~ spl3_7 ),
inference(forward_demodulation,[],[f97,f103]) ).
fof(f103,plain,
( sK0 = sK1
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f101,plain,
( spl3_7
<=> sK0 = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_7])]) ).
fof(f426,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f425]) ).
fof(f425,plain,
( $false
| ~ spl3_1 ),
inference(subsumption_resolution,[],[f417,f41]) ).
fof(f417,plain,
( ~ int_leq(sK1,n)
| ~ spl3_1 ),
inference(resolution,[],[f75,f40]) ).
fof(f75,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,n) )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f74]) ).
fof(f74,plain,
( spl3_1
<=> ! [X0] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f397,plain,
( ~ spl3_2
| spl3_4
| ~ spl3_7 ),
inference(avatar_contradiction_clause,[],[f390]) ).
fof(f390,plain,
( $false
| ~ spl3_2
| spl3_4
| ~ spl3_7 ),
inference(unit_resulting_resolution,[],[f70,f38,f39,f38,f382,f78]) ).
fof(f78,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,[],[f77]) ).
fof(f77,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(f382,plain,
( real_one != a(sK0,sK0)
| spl3_4
| ~ spl3_7 ),
inference(forward_demodulation,[],[f87,f103]) ).
fof(f87,plain,
( real_one != a(sK0,sK1)
| spl3_4 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f85,plain,
( spl3_4
<=> real_one = a(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f388,plain,
( ~ spl3_5
| ~ spl3_7 ),
inference(avatar_contradiction_clause,[],[f387]) ).
fof(f387,plain,
( $false
| ~ spl3_5
| ~ spl3_7 ),
inference(subsumption_resolution,[],[f384,f69]) ).
fof(f384,plain,
( int_less(sK0,sK0)
| ~ spl3_5
| ~ spl3_7 ),
inference(superposition,[],[f92,f103]) ).
fof(f92,plain,
( int_less(sK0,sK1)
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f90,plain,
( spl3_5
<=> int_less(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f381,plain,
( spl3_3
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f380]) ).
fof(f380,plain,
( $false
| spl3_3
| ~ spl3_5 ),
inference(subsumption_resolution,[],[f379,f92]) ).
fof(f379,plain,
( ~ int_less(sK0,sK1)
| spl3_3 ),
inference(subsumption_resolution,[],[f378,f39]) ).
fof(f378,plain,
( ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_3 ),
inference(subsumption_resolution,[],[f377,f40]) ).
fof(f377,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_3 ),
inference(subsumption_resolution,[],[f376,f41]) ).
fof(f376,plain,
( ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1)
| spl3_3 ),
inference(subsumption_resolution,[],[f365,f38]) ).
fof(f365,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,[],[f343]) ).
fof(f343,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,[],[f83,f188]) ).
fof(f188,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,[],[f187,f70]) ).
fof(f187,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,[],[f184]) ).
fof(f184,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,[],[f115,f51]) ).
fof(f115,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,[],[f111,f52]) ).
fof(f111,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,[],[f66,f51]) ).
fof(f66,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(f107,plain,
( spl3_5
| spl3_6
| spl3_7 ),
inference(avatar_split_clause,[],[f42,f101,f95,f90]) ).
fof(f42,plain,
( sK0 = sK1
| int_less(sK1,sK0)
| int_less(sK0,sK1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f104,plain,
( ~ spl3_3
| spl3_7 ),
inference(avatar_split_clause,[],[f71,f101,f81]) ).
fof(f71,plain,
( sK0 = sK1
| real_zero != a(sK0,sK1) ),
inference(duplicate_literal_removal,[],[f45]) ).
fof(f45,plain,
( sK0 = sK1
| real_zero != a(sK0,sK1)
| real_zero != a(sK0,sK1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f99,plain,
( spl3_5
| spl3_6
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f46,f85,f95,f90]) ).
fof(f46,plain,
( real_one != a(sK0,sK1)
| int_less(sK1,sK0)
| int_less(sK0,sK1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f79,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f36,f77,f74]) ).
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.12/0.12 % Problem : SWV491+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n023.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 : 300
% 0.14/0.35 % DateTime : Fri May 3 21:06:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.NBzd5k1t0Y/Vampire---4.8_20290
% 0.55/0.75 % (20405)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 (2996ds/56Mi)
% 0.55/0.75 % (20398)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 (2996ds/34Mi)
% 0.55/0.75 % (20400)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.75 % (20402)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 (2996ds/34Mi)
% 0.55/0.75 % (20401)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.55/0.75 % (20399)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 (2996ds/51Mi)
% 0.55/0.75 % (20403)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.75 % (20404)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 (2996ds/83Mi)
% 0.55/0.75 % (20405)Refutation not found, incomplete strategy% (20405)------------------------------
% 0.55/0.75 % (20405)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (20405)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75
% 0.55/0.75 % (20405)Memory used [KB]: 1049
% 0.55/0.75 % (20405)Time elapsed: 0.002 s
% 0.55/0.75 % (20405)Instructions burned: 4 (million)
% 0.55/0.75 % (20405)------------------------------
% 0.55/0.75 % (20405)------------------------------
% 0.60/0.76 % (20406)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 (2996ds/55Mi)
% 0.60/0.77 % (20398)Instruction limit reached!
% 0.60/0.77 % (20398)------------------------------
% 0.60/0.77 % (20398)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (20398)Termination reason: Unknown
% 0.60/0.77 % (20398)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (20398)Memory used [KB]: 1201
% 0.60/0.77 % (20398)Time elapsed: 0.020 s
% 0.60/0.77 % (20398)Instructions burned: 34 (million)
% 0.60/0.77 % (20401)Instruction limit reached!
% 0.60/0.77 % (20401)------------------------------
% 0.60/0.77 % (20401)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (20398)------------------------------
% 0.60/0.77 % (20398)------------------------------
% 0.60/0.77 % (20401)Termination reason: Unknown
% 0.60/0.77 % (20401)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (20401)Memory used [KB]: 1452
% 0.60/0.77 % (20401)Time elapsed: 0.020 s
% 0.60/0.77 % (20401)Instructions burned: 34 (million)
% 0.60/0.77 % (20401)------------------------------
% 0.60/0.77 % (20401)------------------------------
% 0.60/0.77 % (20402)Instruction limit reached!
% 0.60/0.77 % (20402)------------------------------
% 0.60/0.77 % (20402)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (20402)Termination reason: Unknown
% 0.60/0.77 % (20402)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (20402)Memory used [KB]: 1326
% 0.60/0.77 % (20402)Time elapsed: 0.022 s
% 0.60/0.77 % (20402)Instructions burned: 35 (million)
% 0.60/0.77 % (20402)------------------------------
% 0.60/0.77 % (20402)------------------------------
% 0.60/0.77 % (20406)Instruction limit reached!
% 0.60/0.77 % (20406)------------------------------
% 0.60/0.77 % (20406)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (20406)Termination reason: Unknown
% 0.60/0.77 % (20406)Termination phase: Saturation
% 0.60/0.77
% 0.60/0.77 % (20406)Memory used [KB]: 1691
% 0.60/0.77 % (20406)Time elapsed: 0.019 s
% 0.60/0.77 % (20406)Instructions burned: 58 (million)
% 0.60/0.77 % (20406)------------------------------
% 0.60/0.77 % (20406)------------------------------
% 0.60/0.78 % (20407)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.60/0.78 % (20408)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.60/0.78 % (20410)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.60/0.78 % (20403)Instruction limit reached!
% 0.60/0.78 % (20403)------------------------------
% 0.60/0.78 % (20403)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (20403)Termination reason: Unknown
% 0.60/0.78 % (20403)Termination phase: Saturation
% 0.60/0.78
% 0.60/0.78 % (20403)Memory used [KB]: 1323
% 0.60/0.78 % (20403)Time elapsed: 0.026 s
% 0.60/0.78 % (20403)Instructions burned: 45 (million)
% 0.60/0.78 % (20403)------------------------------
% 0.60/0.78 % (20403)------------------------------
% 0.60/0.78 % (20409)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.60/0.78 % (20411)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.60/0.78 % (20399)Instruction limit reached!
% 0.60/0.78 % (20399)------------------------------
% 0.60/0.78 % (20399)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (20399)Termination reason: Unknown
% 0.60/0.79 % (20399)Termination phase: Saturation
% 0.60/0.79
% 0.60/0.79 % (20399)Memory used [KB]: 1413
% 0.60/0.79 % (20399)Time elapsed: 0.033 s
% 0.60/0.79 % (20399)Instructions burned: 52 (million)
% 0.60/0.79 % (20399)------------------------------
% 0.60/0.79 % (20399)------------------------------
% 0.60/0.79 % (20412)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.60/0.79 % (20410)First to succeed.
% 0.60/0.79 % (20410)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20397"
% 0.60/0.79 % (20410)Refutation found. Thanks to Tanya!
% 0.60/0.79 % SZS status Theorem for Vampire---4
% 0.60/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.79 % (20410)------------------------------
% 0.60/0.79 % (20410)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (20410)Termination reason: Refutation
% 0.60/0.79
% 0.60/0.79 % (20410)Memory used [KB]: 1245
% 0.60/0.79 % (20410)Time elapsed: 0.016 s
% 0.60/0.79 % (20410)Instructions burned: 48 (million)
% 0.60/0.79 % (20397)Success in time 0.425 s
% 0.60/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------