TSTP Solution File: SWW591_2 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SWW591_2 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n027.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 : Mon Jun 24 18:34:25 EDT 2024
% Result : Theorem 0.25s 0.54s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 16
% Syntax : Number of formulae : 94 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 290 ( 139 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 309 ( 113 ~; 92 |; 61 &)
% ( 5 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number arithmetic : 71 ( 18 atm; 0 fun; 18 num; 35 var)
% Number of types : 8 ( 6 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 36 ( 35 usr; 13 con; 0-5 aty)
% Number of variables : 171 ( 147 !; 24 ?; 171 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool: $tType ).
tff(type_def_8,type,
tuple0: $tType ).
tff(type_def_9,type,
map_int_lpoption_intrp: $tType ).
tff(type_def_10,type,
option_int: $tType ).
tff(func_def_0,type,
witness: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool1: ty ).
tff(func_def_4,type,
true: bool ).
tff(func_def_5,type,
false: bool ).
tff(func_def_6,type,
match_bool: ( ty * bool * uni * uni ) > uni ).
tff(func_def_7,type,
tuple01: ty ).
tff(func_def_8,type,
tuple02: tuple0 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_10,type,
option: ty > ty ).
tff(func_def_11,type,
none: ty > uni ).
tff(func_def_12,type,
some: ( ty * uni ) > uni ).
tff(func_def_13,type,
match_option: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_14,type,
some_proj_1: ( ty * uni ) > uni ).
tff(func_def_17,type,
fib: $int > $int ).
tff(func_def_22,type,
ref: ty > ty ).
tff(func_def_23,type,
mk_ref: ( ty * uni ) > uni ).
tff(func_def_24,type,
contents: ( ty * uni ) > uni ).
tff(func_def_25,type,
map: ( ty * ty ) > ty ).
tff(func_def_26,type,
get: ( ty * ty * uni * uni ) > uni ).
tff(func_def_27,type,
set: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_28,type,
const: ( ty * ty * uni ) > uni ).
tff(func_def_29,type,
t2tb: map_int_lpoption_intrp > uni ).
tff(func_def_30,type,
tb2t: uni > map_int_lpoption_intrp ).
tff(func_def_31,type,
t2tb1: option_int > uni ).
tff(func_def_32,type,
tb2t1: uni > option_int ).
tff(func_def_33,type,
t2tb2: $int > uni ).
tff(func_def_34,type,
tb2t2: uni > $int ).
tff(func_def_36,type,
sK0: map_int_lpoption_intrp ).
tff(func_def_37,type,
sK1: $int ).
tff(func_def_38,type,
sK2: map_int_lpoption_intrp ).
tff(func_def_39,type,
sK3: map_int_lpoption_intrp ).
tff(func_def_40,type,
sK4: map_int_lpoption_intrp > $int ).
tff(func_def_41,type,
sK5: map_int_lpoption_intrp > $int ).
tff(pred_def_1,type,
sort: ( ty * uni ) > $o ).
tff(pred_def_3,type,
inv: map_int_lpoption_intrp > $o ).
tff(f670,plain,
$false,
inference(avatar_sat_refutation,[],[f311,f465,f669]) ).
tff(f669,plain,
~ spl6_3,
inference(avatar_contradiction_clause,[],[f668]) ).
tff(f668,plain,
( $false
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f664,f494]) ).
tff(f494,plain,
( ( fib(sK1) != sK4(sK3) )
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f492,f194]) ).
tff(f194,plain,
~ inv(sK3),
inference(trivial_inequality_removal,[],[f158]) ).
tff(f158,plain,
( ( fib(sK1) != fib(sK1) )
| ~ inv(sK3) ),
inference(cnf_transformation,[],[f125]) ).
tff(f125,plain,
( inv(sK0)
& ( ~ inv(sK3)
| ( fib(sK1) != fib(sK1) ) )
& ( tb2t(set(option(int),int,t2tb(sK2),t2tb2(sK1),some(int,t2tb2(fib(sK1))))) = sK3 )
& inv(sK2)
& ~ $less(sK1,0)
& inv(sK0)
& ( tb2t1(none(int)) = tb2t1(get(option(int),int,t2tb(sK0),t2tb2(sK1))) )
& ~ $less(sK1,0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f111,f124,f123,f122]) ).
tff(f122,plain,
( ? [X0: map_int_lpoption_intrp,X1: $int] :
( inv(X0)
& ? [X2: map_int_lpoption_intrp] :
( ? [X3: map_int_lpoption_intrp] :
( ( ~ inv(X3)
| ( fib(X1) != fib(X1) ) )
& ( tb2t(set(option(int),int,t2tb(X2),t2tb2(X1),some(int,t2tb2(fib(X1))))) = X3 ) )
& inv(X2) )
& ~ $less(X1,0)
& inv(X0)
& ( tb2t1(none(int)) = tb2t1(get(option(int),int,t2tb(X0),t2tb2(X1))) )
& ~ $less(X1,0) )
=> ( inv(sK0)
& ? [X2: map_int_lpoption_intrp] :
( ? [X3: map_int_lpoption_intrp] :
( ( ~ inv(X3)
| ( fib(sK1) != fib(sK1) ) )
& ( tb2t(set(option(int),int,t2tb(X2),t2tb2(sK1),some(int,t2tb2(fib(sK1))))) = X3 ) )
& inv(X2) )
& ~ $less(sK1,0)
& inv(sK0)
& ( tb2t1(none(int)) = tb2t1(get(option(int),int,t2tb(sK0),t2tb2(sK1))) )
& ~ $less(sK1,0) ) ),
introduced(choice_axiom,[]) ).
tff(f123,plain,
( ? [X2: map_int_lpoption_intrp] :
( ? [X3: map_int_lpoption_intrp] :
( ( ~ inv(X3)
| ( fib(sK1) != fib(sK1) ) )
& ( tb2t(set(option(int),int,t2tb(X2),t2tb2(sK1),some(int,t2tb2(fib(sK1))))) = X3 ) )
& inv(X2) )
=> ( ? [X3: map_int_lpoption_intrp] :
( ( ~ inv(X3)
| ( fib(sK1) != fib(sK1) ) )
& ( tb2t(set(option(int),int,t2tb(sK2),t2tb2(sK1),some(int,t2tb2(fib(sK1))))) = X3 ) )
& inv(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f124,plain,
( ? [X3: map_int_lpoption_intrp] :
( ( ~ inv(X3)
| ( fib(sK1) != fib(sK1) ) )
& ( tb2t(set(option(int),int,t2tb(sK2),t2tb2(sK1),some(int,t2tb2(fib(sK1))))) = X3 ) )
=> ( ( ~ inv(sK3)
| ( fib(sK1) != fib(sK1) ) )
& ( tb2t(set(option(int),int,t2tb(sK2),t2tb2(sK1),some(int,t2tb2(fib(sK1))))) = sK3 ) ) ),
introduced(choice_axiom,[]) ).
tff(f111,plain,
? [X0: map_int_lpoption_intrp,X1: $int] :
( inv(X0)
& ? [X2: map_int_lpoption_intrp] :
( ? [X3: map_int_lpoption_intrp] :
( ( ~ inv(X3)
| ( fib(X1) != fib(X1) ) )
& ( tb2t(set(option(int),int,t2tb(X2),t2tb2(X1),some(int,t2tb2(fib(X1))))) = X3 ) )
& inv(X2) )
& ~ $less(X1,0)
& inv(X0)
& ( tb2t1(none(int)) = tb2t1(get(option(int),int,t2tb(X0),t2tb2(X1))) )
& ~ $less(X1,0) ),
inference(flattening,[],[f110]) ).
tff(f110,plain,
? [X0: map_int_lpoption_intrp,X1: $int] :
( ? [X2: map_int_lpoption_intrp] :
( ? [X3: map_int_lpoption_intrp] :
( ( ~ inv(X3)
| ( fib(X1) != fib(X1) ) )
& ( tb2t(set(option(int),int,t2tb(X2),t2tb2(X1),some(int,t2tb2(fib(X1))))) = X3 ) )
& inv(X2) )
& ~ $less(X1,0)
& inv(X0)
& ( tb2t1(none(int)) = tb2t1(get(option(int),int,t2tb(X0),t2tb2(X1))) )
& ~ $less(X1,0)
& inv(X0) ),
inference(ennf_transformation,[],[f93]) ).
tff(f93,plain,
~ ! [X0: map_int_lpoption_intrp,X1: $int] :
( ( ~ $less(X1,0)
& inv(X0) )
=> ( ( tb2t1(none(int)) = tb2t1(get(option(int),int,t2tb(X0),t2tb2(X1))) )
=> ( ( ~ $less(X1,0)
& inv(X0) )
=> ! [X2: map_int_lpoption_intrp] :
( inv(X2)
=> ! [X3: map_int_lpoption_intrp] :
( ( tb2t(set(option(int),int,t2tb(X2),t2tb2(X1),some(int,t2tb2(fib(X1))))) = X3 )
=> ( ( fib(X1) = fib(X1) )
& inv(X3) ) ) ) ) ) ),
inference(rectify,[],[f45]) ).
tff(f45,plain,
~ ! [X18: map_int_lpoption_intrp,X10: $int] :
( ( ~ $less(X10,0)
& inv(X18) )
=> ( ( tb2t1(get(option(int),int,t2tb(X18),t2tb2(X10))) = tb2t1(none(int)) )
=> ( ( ~ $less(X10,0)
& inv(X18) )
=> ! [X19: map_int_lpoption_intrp] :
( inv(X19)
=> ! [X20: map_int_lpoption_intrp] :
( ( tb2t(set(option(int),int,t2tb(X19),t2tb2(X10),some(int,t2tb2(fib(X10))))) = X20 )
=> ( inv(X20)
& ( fib(X10) = fib(X10) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f42]) ).
tff(f42,negated_conjecture,
~ ! [X18: map_int_lpoption_intrp,X10: $int] :
( ( $lesseq(0,X10)
& inv(X18) )
=> ( ( tb2t1(get(option(int),int,t2tb(X18),t2tb2(X10))) = tb2t1(none(int)) )
=> ( ( $lesseq(0,X10)
& inv(X18) )
=> ! [X19: map_int_lpoption_intrp] :
( inv(X19)
=> ! [X20: map_int_lpoption_intrp] :
( ( tb2t(set(option(int),int,t2tb(X19),t2tb2(X10),some(int,t2tb2(fib(X10))))) = X20 )
=> ( inv(X20)
& ( fib(X10) = fib(X10) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f41]) ).
tff(f41,conjecture,
! [X18: map_int_lpoption_intrp,X10: $int] :
( ( $lesseq(0,X10)
& inv(X18) )
=> ( ( tb2t1(get(option(int),int,t2tb(X18),t2tb2(X10))) = tb2t1(none(int)) )
=> ( ( $lesseq(0,X10)
& inv(X18) )
=> ! [X19: map_int_lpoption_intrp] :
( inv(X19)
=> ! [X20: map_int_lpoption_intrp] :
( ( tb2t(set(option(int),int,t2tb(X19),t2tb2(X10),some(int,t2tb2(fib(X10))))) = X20 )
=> ( inv(X20)
& ( fib(X10) = fib(X10) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f492,plain,
( ( fib(sK1) != sK4(sK3) )
| inv(sK3)
| ~ spl6_3 ),
inference(superposition,[],[f167,f489]) ).
tff(f489,plain,
( ( sK1 = sK5(sK3) )
| ~ spl6_3 ),
inference(superposition,[],[f141,f467]) ).
tff(f467,plain,
( ( sK5(sK3) = tb2t2(t2tb2(sK1)) )
| ~ spl6_3 ),
inference(superposition,[],[f141,f306]) ).
tff(f306,plain,
( ( t2tb2(sK1) = t2tb2(sK5(sK3)) )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f304]) ).
tff(f304,plain,
( spl6_3
<=> ( t2tb2(sK1) = t2tb2(sK5(sK3)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
tff(f141,plain,
! [X0: $int] : ( tb2t2(t2tb2(X0)) = X0 ),
inference(cnf_transformation,[],[f87]) ).
tff(f87,plain,
! [X0: $int] : ( tb2t2(t2tb2(X0)) = X0 ),
inference(rectify,[],[f38]) ).
tff(f38,axiom,
! [X15: $int] : ( tb2t2(t2tb2(X15)) = X15 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f167,plain,
! [X0: map_int_lpoption_intrp] :
( ( sK4(X0) != fib(sK5(X0)) )
| inv(X0) ),
inference(cnf_transformation,[],[f130]) ).
tff(f130,plain,
! [X0: map_int_lpoption_intrp] :
( ( inv(X0)
| ( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(sK5(X0)))) = tb2t1(some(int,t2tb2(sK4(X0)))) )
& ( sK4(X0) != fib(sK5(X0)) ) ) )
& ( ! [X3: $int,X4: $int] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(X4))) != tb2t1(some(int,t2tb2(X3))) )
| ( fib(X4) = X3 ) )
| ~ inv(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f128,f129]) ).
tff(f129,plain,
! [X0: map_int_lpoption_intrp] :
( ? [X1: $int,X2: $int] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(X2))) = tb2t1(some(int,t2tb2(X1))) )
& ( fib(X2) != X1 ) )
=> ( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(sK5(X0)))) = tb2t1(some(int,t2tb2(sK4(X0)))) )
& ( sK4(X0) != fib(sK5(X0)) ) ) ),
introduced(choice_axiom,[]) ).
tff(f128,plain,
! [X0: map_int_lpoption_intrp] :
( ( inv(X0)
| ? [X1: $int,X2: $int] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(X2))) = tb2t1(some(int,t2tb2(X1))) )
& ( fib(X2) != X1 ) ) )
& ( ! [X3: $int,X4: $int] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(X4))) != tb2t1(some(int,t2tb2(X3))) )
| ( fib(X4) = X3 ) )
| ~ inv(X0) ) ),
inference(rectify,[],[f127]) ).
tff(f127,plain,
! [X0: map_int_lpoption_intrp] :
( ( inv(X0)
| ? [X1: $int,X2: $int] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(X2))) = tb2t1(some(int,t2tb2(X1))) )
& ( fib(X2) != X1 ) ) )
& ( ! [X1: $int,X2: $int] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(X2))) != tb2t1(some(int,t2tb2(X1))) )
| ( fib(X2) = X1 ) )
| ~ inv(X0) ) ),
inference(nnf_transformation,[],[f108]) ).
tff(f108,plain,
! [X0: map_int_lpoption_intrp] :
( inv(X0)
<=> ! [X1: $int,X2: $int] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(X2))) != tb2t1(some(int,t2tb2(X1))) )
| ( fib(X2) = X1 ) ) ),
inference(ennf_transformation,[],[f91]) ).
tff(f91,plain,
! [X0: map_int_lpoption_intrp] :
( inv(X0)
<=> ! [X2: $int,X1: $int] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(X2))) = tb2t1(some(int,t2tb2(X1))) )
=> ( fib(X2) = X1 ) ) ),
inference(rectify,[],[f40]) ).
tff(f40,axiom,
! [X17: map_int_lpoption_intrp] :
( inv(X17)
<=> ! [X9: $int,X1: $int] :
( ( tb2t1(get(option(int),int,t2tb(X17),t2tb2(X1))) = tb2t1(some(int,t2tb2(X9))) )
=> ( fib(X1) = X9 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f664,plain,
( ( fib(sK1) = sK4(sK3) )
| ~ spl6_3 ),
inference(superposition,[],[f141,f658]) ).
tff(f658,plain,
( ( fib(sK1) = tb2t2(t2tb2(sK4(sK3))) )
| ~ spl6_3 ),
inference(superposition,[],[f141,f652]) ).
tff(f652,plain,
( ( t2tb2(fib(sK1)) = t2tb2(sK4(sK3)) )
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f648,f145]) ).
tff(f145,plain,
! [X0: $int] : sort(int,t2tb2(X0)),
inference(cnf_transformation,[],[f65]) ).
tff(f65,plain,
! [X0: $int] : sort(int,t2tb2(X0)),
inference(rectify,[],[f37]) ).
tff(f37,axiom,
! [X1: $int] : sort(int,t2tb2(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f648,plain,
( ~ sort(int,t2tb2(sK4(sK3)))
| ( t2tb2(fib(sK1)) = t2tb2(sK4(sK3)) )
| ~ spl6_3 ),
inference(superposition,[],[f638,f176]) ).
tff(f176,plain,
! [X0: uni,X1: ty] :
( ( some_proj_1(X1,some(X1,X0)) = X0 )
| ~ sort(X1,X0) ),
inference(cnf_transformation,[],[f100]) ).
tff(f100,plain,
! [X0: uni,X1: ty] :
( ~ sort(X1,X0)
| ( some_proj_1(X1,some(X1,X0)) = X0 ) ),
inference(ennf_transformation,[],[f70]) ).
tff(f70,plain,
! [X1: ty,X0: uni] :
( sort(X1,X0)
=> ( some_proj_1(X1,some(X1,X0)) = X0 ) ),
inference(rectify,[],[f15]) ).
tff(f15,axiom,
! [X6: uni,X0: ty] :
( sort(X0,X6)
=> ( some_proj_1(X0,some(X0,X6)) = X6 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f638,plain,
( ( t2tb2(fib(sK1)) = some_proj_1(int,some(int,t2tb2(sK4(sK3)))) )
| ~ spl6_3 ),
inference(superposition,[],[f604,f190]) ).
tff(f190,plain,
! [X0: uni] : ( t2tb1(tb2t1(X0)) = X0 ),
inference(cnf_transformation,[],[f97]) ).
tff(f97,plain,
! [X0: uni] : ( t2tb1(tb2t1(X0)) = X0 ),
inference(rectify,[],[f36]) ).
tff(f36,axiom,
! [X16: uni] : ( t2tb1(tb2t1(X16)) = X16 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f604,plain,
( ( t2tb2(fib(sK1)) = some_proj_1(int,t2tb1(tb2t1(some(int,t2tb2(sK4(sK3)))))) )
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f602,f145]) ).
tff(f602,plain,
( ~ sort(int,t2tb2(fib(sK1)))
| ( t2tb2(fib(sK1)) = some_proj_1(int,t2tb1(tb2t1(some(int,t2tb2(sK4(sK3)))))) )
| ~ spl6_3 ),
inference(superposition,[],[f176,f586]) ).
tff(f586,plain,
( ( some(int,t2tb2(fib(sK1))) = t2tb1(tb2t1(some(int,t2tb2(sK4(sK3))))) )
| ~ spl6_3 ),
inference(superposition,[],[f190,f501]) ).
tff(f501,plain,
( ( tb2t1(some(int,t2tb2(fib(sK1)))) = tb2t1(some(int,t2tb2(sK4(sK3)))) )
| ~ spl6_3 ),
inference(superposition,[],[f474,f223]) ).
tff(f223,plain,
some(int,t2tb2(fib(sK1))) = get(option(int),int,t2tb(sK3),t2tb2(sK1)),
inference(subsumption_resolution,[],[f220,f143]) ).
tff(f143,plain,
! [X0: uni,X1: ty] : sort(option(X1),some(X1,X0)),
inference(cnf_transformation,[],[f79]) ).
tff(f79,plain,
! [X0: uni,X1: ty] : sort(option(X1),some(X1,X0)),
inference(rectify,[],[f9]) ).
tff(f9,axiom,
! [X1: uni,X0: ty] : sort(option(X0),some(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f220,plain,
( ( some(int,t2tb2(fib(sK1))) = get(option(int),int,t2tb(sK3),t2tb2(sK1)) )
| ~ sort(option(int),some(int,t2tb2(fib(sK1)))) ),
inference(superposition,[],[f192,f199]) ).
tff(f199,plain,
set(option(int),int,t2tb(sK2),t2tb2(sK1),some(int,t2tb2(fib(sK1)))) = t2tb(sK3),
inference(superposition,[],[f177,f157]) ).
tff(f157,plain,
tb2t(set(option(int),int,t2tb(sK2),t2tb2(sK1),some(int,t2tb2(fib(sK1))))) = sK3,
inference(cnf_transformation,[],[f125]) ).
tff(f177,plain,
! [X0: uni] : ( t2tb(tb2t(X0)) = X0 ),
inference(cnf_transformation,[],[f84]) ).
tff(f84,plain,
! [X0: uni] : ( t2tb(tb2t(X0)) = X0 ),
inference(rectify,[],[f33]) ).
tff(f33,axiom,
! [X16: uni] : ( t2tb(tb2t(X16)) = X16 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f192,plain,
! [X2: ty,X3: uni,X1: uni,X4: ty,X5: uni] :
( ( get(X2,X4,set(X2,X4,X3,X5,X1),X5) = X1 )
| ~ sort(X2,X1) ),
inference(equality_resolution,[],[f181]) ).
tff(f181,plain,
! [X2: ty,X3: uni,X0: uni,X1: uni,X4: ty,X5: uni] :
( ~ sort(X2,X1)
| ( get(X2,X4,set(X2,X4,X3,X0,X1),X5) = X1 )
| ( X0 != X5 ) ),
inference(cnf_transformation,[],[f138]) ).
tff(f138,plain,
! [X0: uni,X1: uni,X2: ty,X3: uni,X4: ty,X5: uni] :
( ~ sort(X2,X1)
| ( get(X2,X4,set(X2,X4,X3,X0,X1),X5) = X1 )
| ( X0 != X5 ) ),
inference(rectify,[],[f102]) ).
tff(f102,plain,
! [X5: uni,X0: uni,X1: ty,X2: uni,X3: ty,X4: uni] :
( ~ sort(X1,X0)
| ( get(X1,X3,set(X1,X3,X2,X5,X0),X4) = X0 )
| ( X4 != X5 ) ),
inference(flattening,[],[f101]) ).
tff(f101,plain,
! [X5: uni,X2: uni,X1: ty,X4: uni,X0: uni,X3: ty] :
( ( get(X1,X3,set(X1,X3,X2,X5,X0),X4) = X0 )
| ( X4 != X5 )
| ~ sort(X1,X0) ),
inference(ennf_transformation,[],[f74]) ).
tff(f74,plain,
! [X5: uni,X2: uni,X1: ty,X4: uni,X0: uni,X3: ty] :
( sort(X1,X0)
=> ( ( X4 = X5 )
=> ( get(X1,X3,set(X1,X3,X2,X5,X0),X4) = X0 ) ) ),
inference(rectify,[],[f27]) ).
tff(f27,axiom,
! [X14: uni,X11: ty,X12: uni,X0: ty,X13: uni,X7: uni] :
( sort(X11,X14)
=> ( ( X7 = X13 )
=> ( get(X11,X0,set(X11,X0,X12,X7,X14),X13) = X14 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f474,plain,
( ( tb2t1(get(option(int),int,t2tb(sK3),t2tb2(sK1))) = tb2t1(some(int,t2tb2(sK4(sK3)))) )
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f466,f194]) ).
tff(f466,plain,
( ( tb2t1(get(option(int),int,t2tb(sK3),t2tb2(sK1))) = tb2t1(some(int,t2tb2(sK4(sK3)))) )
| inv(sK3)
| ~ spl6_3 ),
inference(superposition,[],[f168,f306]) ).
tff(f168,plain,
! [X0: map_int_lpoption_intrp] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(sK5(X0)))) = tb2t1(some(int,t2tb2(sK4(X0)))) )
| inv(X0) ),
inference(cnf_transformation,[],[f130]) ).
tff(f465,plain,
~ spl6_4,
inference(avatar_contradiction_clause,[],[f464]) ).
tff(f464,plain,
( $false
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f463,f194]) ).
tff(f463,plain,
( inv(sK3)
| ~ spl6_4 ),
inference(trivial_inequality_removal,[],[f462]) ).
tff(f462,plain,
( inv(sK3)
| ( sK4(sK3) != sK4(sK3) )
| ~ spl6_4 ),
inference(superposition,[],[f167,f461]) ).
tff(f461,plain,
( ( sK4(sK3) = fib(sK5(sK3)) )
| ~ spl6_4 ),
inference(equality_resolution,[],[f441]) ).
tff(f441,plain,
( ! [X0: $int] :
( ( tb2t1(some(int,t2tb2(X0))) != tb2t1(some(int,t2tb2(sK4(sK3)))) )
| ( fib(sK5(sK3)) = X0 ) )
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f437,f156]) ).
tff(f156,plain,
inv(sK2),
inference(cnf_transformation,[],[f125]) ).
tff(f437,plain,
( ! [X0: $int] :
( ( tb2t1(some(int,t2tb2(X0))) != tb2t1(some(int,t2tb2(sK4(sK3)))) )
| ( fib(sK5(sK3)) = X0 )
| ~ inv(sK2) )
| ~ spl6_4 ),
inference(superposition,[],[f166,f310]) ).
tff(f310,plain,
( ( tb2t1(some(int,t2tb2(sK4(sK3)))) = tb2t1(get(option(int),int,t2tb(sK2),t2tb2(sK5(sK3)))) )
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f308]) ).
tff(f308,plain,
( spl6_4
<=> ( tb2t1(some(int,t2tb2(sK4(sK3)))) = tb2t1(get(option(int),int,t2tb(sK2),t2tb2(sK5(sK3)))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
tff(f166,plain,
! [X3: $int,X0: map_int_lpoption_intrp,X4: $int] :
( ( tb2t1(get(option(int),int,t2tb(X0),t2tb2(X4))) != tb2t1(some(int,t2tb2(X3))) )
| ( fib(X4) = X3 )
| ~ inv(X0) ),
inference(cnf_transformation,[],[f130]) ).
tff(f311,plain,
( spl6_3
| spl6_4 ),
inference(avatar_split_clause,[],[f256,f308,f304]) ).
tff(f256,plain,
( ( tb2t1(some(int,t2tb2(sK4(sK3)))) = tb2t1(get(option(int),int,t2tb(sK2),t2tb2(sK5(sK3)))) )
| ( t2tb2(sK1) = t2tb2(sK5(sK3)) ) ),
inference(subsumption_resolution,[],[f255,f194]) ).
tff(f255,plain,
( inv(sK3)
| ( tb2t1(some(int,t2tb2(sK4(sK3)))) = tb2t1(get(option(int),int,t2tb(sK2),t2tb2(sK5(sK3)))) )
| ( t2tb2(sK1) = t2tb2(sK5(sK3)) ) ),
inference(subsumption_resolution,[],[f251,f145]) ).
tff(f251,plain,
( ~ sort(int,t2tb2(sK5(sK3)))
| inv(sK3)
| ( t2tb2(sK1) = t2tb2(sK5(sK3)) )
| ( tb2t1(some(int,t2tb2(sK4(sK3)))) = tb2t1(get(option(int),int,t2tb(sK2),t2tb2(sK5(sK3)))) ) ),
inference(superposition,[],[f168,f224]) ).
tff(f224,plain,
! [X0: uni] :
( ( get(option(int),int,t2tb(sK2),X0) = get(option(int),int,t2tb(sK3),X0) )
| ( t2tb2(sK1) = X0 )
| ~ sort(int,X0) ),
inference(subsumption_resolution,[],[f222,f145]) ).
tff(f222,plain,
! [X0: uni] :
( ~ sort(int,t2tb2(sK1))
| ~ sort(int,X0)
| ( get(option(int),int,t2tb(sK2),X0) = get(option(int),int,t2tb(sK3),X0) )
| ( t2tb2(sK1) = X0 ) ),
inference(superposition,[],[f173,f199]) ).
tff(f173,plain,
! [X2: ty,X3: ty,X0: uni,X1: uni,X4: uni,X5: uni] :
( ( get(X2,X3,set(X2,X3,X1,X0,X5),X4) = get(X2,X3,X1,X4) )
| ~ sort(X3,X4)
| ( X0 = X4 )
| ~ sort(X3,X0) ),
inference(cnf_transformation,[],[f133]) ).
tff(f133,plain,
! [X0: uni,X1: uni,X2: ty,X3: ty,X4: uni] :
( ~ sort(X3,X4)
| ~ sort(X3,X0)
| ! [X5: uni] :
( ( X0 = X4 )
| ( get(X2,X3,set(X2,X3,X1,X0,X5),X4) = get(X2,X3,X1,X4) ) ) ),
inference(rectify,[],[f115]) ).
tff(f115,plain,
! [X0: uni,X1: uni,X3: ty,X4: ty,X2: uni] :
( ~ sort(X4,X2)
| ~ sort(X4,X0)
| ! [X5: uni] :
( ( X0 = X2 )
| ( get(X3,X4,set(X3,X4,X1,X0,X5),X2) = get(X3,X4,X1,X2) ) ) ),
inference(flattening,[],[f114]) ).
tff(f114,plain,
! [X2: uni,X1: uni,X4: ty,X0: uni,X3: ty] :
( ! [X5: uni] :
( ( X0 = X2 )
| ( get(X3,X4,set(X3,X4,X1,X0,X5),X2) = get(X3,X4,X1,X2) ) )
| ~ sort(X4,X2)
| ~ sort(X4,X0) ),
inference(ennf_transformation,[],[f66]) ).
tff(f66,plain,
! [X2: uni,X1: uni,X4: ty,X0: uni,X3: ty] :
( sort(X4,X0)
=> ( sort(X4,X2)
=> ! [X5: uni] :
( ( X0 != X2 )
=> ( get(X3,X4,set(X3,X4,X1,X0,X5),X2) = get(X3,X4,X1,X2) ) ) ) ),
inference(rectify,[],[f28]) ).
tff(f28,axiom,
! [X7: uni,X12: uni,X13: uni,X11: ty,X0: ty] :
( sort(X0,X7)
=> ( sort(X0,X13)
=> ! [X14: uni] :
( ( X7 != X13 )
=> ( get(X11,X0,set(X11,X0,X12,X7,X14),X13) = get(X11,X0,X12,X13) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWW591_2 : TPTP v8.2.0. Released v6.1.0.
% 0.03/0.13 % Command : run_vampire %s %d THM
% 0.13/0.37 % Computer : n027.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8042.1875MB
% 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Wed Jun 19 07:50:24 EDT 2024
% 0.13/0.37 % CPUTime :
% 0.13/0.39 This is a TF0_THM_EQU_ARI problem
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.46 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.46 % (576)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.25/0.46 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.46 % (572)dis+1010_1:4_aac=none:abs=on:atotf=0.5:avsq=on:avsqc=2:avsqr=215,247:awrs=converge:awrsf=128:bsd=on:erd=off:fde=none:gve=cautious:newcnf=on:nwc=5.0:rnwc=on:sac=on:sas=z3:sp=const_min:tgt=ground:thsq=on:thsqc=64:thsqr=1,4:i=59848:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59848Mi)
% 0.25/0.46 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.46 % (574)dis+1011_1:64_drc=off:flr=on:nwc=2.0:sac=on:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/8Mi)
% 0.25/0.46 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.46 % (577)lrs+10_1:32_s2a=on:s2agt=10:sgt=8:ss=axioms:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/15Mi)
% 0.25/0.46 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.46 % (578)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/32Mi)
% 0.25/0.46 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.46 % (575)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.25/0.46 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.46 % (573)lrs+1010_1:1_aac=none:bce=on:nicw=on:nm=0:plsq=on:plsql=on:sac=on:sos=on:sp=frequency:spb=units:to=lpo:i=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/34Mi)
% 0.25/0.46 % (575)Instruction limit reached!
% 0.25/0.46 % (575)------------------------------
% 0.25/0.46 % (575)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.46 % (575)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.46 % (575)Termination reason: Time limit
% 0.25/0.46 % (575)Termination phase: SInE selection
% 0.25/0.46
% 0.25/0.46 % (575)Memory used [KB]: 756
% 0.25/0.46 % (575)Time elapsed: 0.003 s
% 0.25/0.46 % (575)Instructions burned: 3 (million)
% 0.25/0.46 % (574)Instruction limit reached!
% 0.25/0.46 % (574)------------------------------
% 0.25/0.46 % (574)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.46 % (574)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.46 % (574)Termination reason: Time limit
% 0.25/0.46 % (574)Termination phase: Saturation
% 0.25/0.46
% 0.25/0.46 % (574)Memory used [KB]: 907
% 0.25/0.46 % (574)Time elapsed: 0.007 s
% 0.25/0.46 % (574)Instructions burned: 8 (million)
% 0.25/0.47 % (577)Instruction limit reached!
% 0.25/0.47 % (577)------------------------------
% 0.25/0.47 % (577)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.47 % (577)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.47 % (577)Termination reason: Time limit
% 0.25/0.47 % (577)Termination phase: Saturation
% 0.25/0.47
% 0.25/0.47 % (577)Memory used [KB]: 942
% 0.25/0.47 % (577)Time elapsed: 0.012 s
% 0.25/0.47 % (577)Instructions burned: 15 (million)
% 0.25/0.48 % (578)Instruction limit reached!
% 0.25/0.48 % (578)------------------------------
% 0.25/0.48 % (578)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.48 % (578)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.48 % (578)Termination reason: Time limit
% 0.25/0.48 % (578)Termination phase: Saturation
% 0.25/0.48
% 0.25/0.48 % (578)Memory used [KB]: 1305
% 0.25/0.48 % (578)Time elapsed: 0.022 s
% 0.25/0.48 % (578)Instructions burned: 32 (million)
% 0.25/0.48 % (573)Instruction limit reached!
% 0.25/0.48 % (573)------------------------------
% 0.25/0.48 % (573)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.48 % (573)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.48 % (573)Termination reason: Time limit
% 0.25/0.48 % (573)Termination phase: Saturation
% 0.25/0.48
% 0.25/0.48 % (573)Memory used [KB]: 1185
% 0.25/0.48 % (573)Time elapsed: 0.023 s
% 0.25/0.48 % (573)Instructions burned: 34 (million)
% 0.25/0.48 % (576)Instruction limit reached!
% 0.25/0.48 % (576)------------------------------
% 0.25/0.48 % (576)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.48 % (576)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.48 % (576)Termination reason: Time limit
% 0.25/0.48 % (576)Termination phase: Saturation
% 0.25/0.48
% 0.25/0.48 % (576)Memory used [KB]: 1398
% 0.25/0.48 % (576)Time elapsed: 0.026 s
% 0.25/0.48 % (576)Instructions burned: 38 (million)
% 0.25/0.52 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.52 % (579)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/36Mi)
% 0.25/0.52 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.52 % (580)lrs+1010_1:1_ep=RST:s2a=on:s2at=5.0:sos=all:i=26:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/26Mi)
% 0.25/0.53 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.53 % (581)lrs+10_1:8_ep=R:erd=off:fs=off:fsr=off:gve=force:nwc=2.0:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.25/0.53 % (581)Instruction limit reached!
% 0.25/0.53 % (581)------------------------------
% 0.25/0.53 % (581)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.53 % (581)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.53 % (581)Termination reason: Time limit
% 0.25/0.53 % (581)Termination phase: Preprocessing 2
% 0.25/0.53
% 0.25/0.53 % (581)Memory used [KB]: 826
% 0.25/0.53 % (581)Time elapsed: 0.003 s
% 0.25/0.53 % (581)Instructions burned: 3 (million)
% 0.25/0.54 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.54 % (582)lrs+10_1:1_canc=force:tha=some:to=lpo:i=35:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/35Mi)
% 0.25/0.54 % (579)First to succeed.
% 0.25/0.54 % (579)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-571"
% 0.25/0.54 % (580)Instruction limit reached!
% 0.25/0.54 % (580)------------------------------
% 0.25/0.54 % (580)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.54 % (580)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.54 % (580)Termination reason: Time limit
% 0.25/0.54 % (580)Termination phase: Saturation
% 0.25/0.54
% 0.25/0.54 % (580)Memory used [KB]: 1281
% 0.25/0.54 % (580)Time elapsed: 0.019 s
% 0.25/0.54 % (580)Instructions burned: 27 (million)
% 0.25/0.54 % (571)Running in auto input_syntax mode. Trying TPTP
% 0.25/0.54 % (579)Refutation found. Thanks to Tanya!
% 0.25/0.54 % SZS status Theorem for theBenchmark
% 0.25/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.54 % (579)------------------------------
% 0.25/0.54 % (579)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.25/0.54 % (579)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.25/0.54 % (579)Termination reason: Refutation
% 0.25/0.54
% 0.25/0.54 % (579)Memory used [KB]: 1106
% 0.25/0.54 % (579)Time elapsed: 0.022 s
% 0.25/0.54 % (579)Instructions burned: 32 (million)
% 0.25/0.54 % (579)------------------------------
% 0.25/0.54 % (579)------------------------------
% 0.25/0.54 % (571)Success in time 0.141 s
%------------------------------------------------------------------------------