TSTP Solution File: SYO888_10 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO888_10 : TPTP v8.2.0. Released v8.2.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 : 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 : Tue May 21 09:09:32 EDT 2024
% Result : Theorem 0.58s 0.73s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 33 ( 9 unt; 9 typ; 0 def)
% Number of atoms : 144 ( 0 equ)
% Maximal formula atoms : 12 ( 6 avg)
% Number of connectives : 152 ( 53 ~; 36 |; 31 &)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 21 ( 21 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 50 ( 40 !; 10 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_2,type,
sK1: '$ki_world' ).
tff(func_def_3,type,
sK2: '$ki_world' > $i ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
f: ( '$ki_world' * $i ) > $o ).
tff(pred_def_3,type,
g: ( '$ki_world' * $i ) > $o ).
tff(pred_def_4,type,
h: ( '$ki_world' * $i ) > $o ).
tff(pred_def_5,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f33,plain,
$false,
inference(subsumption_resolution,[],[f32,f20]) ).
tff(f20,plain,
'$ki_exists_in_world_$i'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
( ~ h(sK1,sK0)
& '$ki_accessible'('$ki_local_world',sK1)
& f('$ki_local_world',sK0)
& '$ki_exists_in_world_$i'('$ki_local_world',sK0)
& ! [X2] :
( ! [X3: '$ki_world'] :
( h(X3,X2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
| ~ g('$ki_local_world',X2)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) )
& ! [X4] :
( ! [X5: '$ki_world'] :
( g(X5,X4)
| ~ '$ki_accessible'('$ki_local_world',X5) )
| ~ f('$ki_local_world',X4)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f14,f13]) ).
tff(f13,plain,
( ? [X0] :
( ? [X1: '$ki_world'] :
( ~ h(X1,X0)
& '$ki_accessible'('$ki_local_world',X1) )
& f('$ki_local_world',X0)
& '$ki_exists_in_world_$i'('$ki_local_world',X0) )
=> ( ? [X1: '$ki_world'] :
( ~ h(X1,sK0)
& '$ki_accessible'('$ki_local_world',X1) )
& f('$ki_local_world',sK0)
& '$ki_exists_in_world_$i'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f14,plain,
( ? [X1: '$ki_world'] :
( ~ h(X1,sK0)
& '$ki_accessible'('$ki_local_world',X1) )
=> ( ~ h(sK1,sK0)
& '$ki_accessible'('$ki_local_world',sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f12,plain,
( ? [X0] :
( ? [X1: '$ki_world'] :
( ~ h(X1,X0)
& '$ki_accessible'('$ki_local_world',X1) )
& f('$ki_local_world',X0)
& '$ki_exists_in_world_$i'('$ki_local_world',X0) )
& ! [X2] :
( ! [X3: '$ki_world'] :
( h(X3,X2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
| ~ g('$ki_local_world',X2)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) )
& ! [X4] :
( ! [X5: '$ki_world'] :
( g(X5,X4)
| ~ '$ki_accessible'('$ki_local_world',X5) )
| ~ f('$ki_local_world',X4)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X4) ) ),
inference(rectify,[],[f9]) ).
tff(f9,plain,
( ? [X4] :
( ? [X5: '$ki_world'] :
( ~ h(X5,X4)
& '$ki_accessible'('$ki_local_world',X5) )
& f('$ki_local_world',X4)
& '$ki_exists_in_world_$i'('$ki_local_world',X4) )
& ! [X0] :
( ! [X1: '$ki_world'] :
( h(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ~ g('$ki_local_world',X0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
& ! [X2] :
( ! [X3: '$ki_world'] :
( g(X3,X2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
| ~ f('$ki_local_world',X2)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) ) ),
inference(flattening,[],[f8]) ).
tff(f8,plain,
( ? [X4] :
( ? [X5: '$ki_world'] :
( ~ h(X5,X4)
& '$ki_accessible'('$ki_local_world',X5) )
& f('$ki_local_world',X4)
& '$ki_exists_in_world_$i'('$ki_local_world',X4) )
& ! [X0] :
( ! [X1: '$ki_world'] :
( h(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ~ g('$ki_local_world',X0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
& ! [X2] :
( ! [X3: '$ki_world'] :
( g(X3,X2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
| ~ f('$ki_local_world',X2)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) ) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,plain,
~ ( ( ! [X0] :
( '$ki_exists_in_world_$i'('$ki_local_world',X0)
=> ( g('$ki_local_world',X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> h(X1,X0) ) ) )
& ! [X2] :
( '$ki_exists_in_world_$i'('$ki_local_world',X2)
=> ( f('$ki_local_world',X2)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X3)
=> g(X3,X2) ) ) ) )
=> ! [X4] :
( '$ki_exists_in_world_$i'('$ki_local_world',X4)
=> ( f('$ki_local_world',X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X5)
=> h(X5,X4) ) ) ) ),
inference(rectify,[],[f5]) ).
tff(f5,negated_conjecture,
~ ( ( ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ( g('$ki_local_world',X3)
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> h(X0,X3) ) ) )
& ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ( f('$ki_local_world',X3)
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> g(X0,X3) ) ) ) )
=> ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ( f('$ki_local_world',X3)
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> h(X0,X3) ) ) ) ),
inference(negated_conjecture,[],[f4]) ).
tff(f4,conjecture,
( ( ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ( g('$ki_local_world',X3)
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> h(X0,X3) ) ) )
& ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ( f('$ki_local_world',X3)
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> g(X0,X3) ) ) ) )
=> ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ( f('$ki_local_world',X3)
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> h(X0,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f32,plain,
~ '$ki_exists_in_world_$i'('$ki_local_world',sK0),
inference(subsumption_resolution,[],[f31,f21]) ).
tff(f21,plain,
f('$ki_local_world',sK0),
inference(cnf_transformation,[],[f15]) ).
tff(f31,plain,
( ~ f('$ki_local_world',sK0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',sK0) ),
inference(subsumption_resolution,[],[f30,f25]) ).
tff(f25,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f30,plain,
( ~ '$ki_accessible'('$ki_local_world','$ki_local_world')
| ~ f('$ki_local_world',sK0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',sK0) ),
inference(resolution,[],[f29,f18]) ).
tff(f18,plain,
! [X4: $i,X5: '$ki_world'] :
( g(X5,X4)
| ~ '$ki_accessible'('$ki_local_world',X5)
| ~ f('$ki_local_world',X4)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X4) ),
inference(cnf_transformation,[],[f15]) ).
tff(f29,plain,
~ g('$ki_local_world',sK0),
inference(subsumption_resolution,[],[f28,f20]) ).
tff(f28,plain,
( ~ g('$ki_local_world',sK0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',sK0) ),
inference(subsumption_resolution,[],[f27,f22]) ).
tff(f22,plain,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f15]) ).
tff(f27,plain,
( ~ '$ki_accessible'('$ki_local_world',sK1)
| ~ g('$ki_local_world',sK0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',sK0) ),
inference(resolution,[],[f19,f23]) ).
tff(f23,plain,
~ h(sK1,sK0),
inference(cnf_transformation,[],[f15]) ).
tff(f19,plain,
! [X2: $i,X3: '$ki_world'] :
( h(X3,X2)
| ~ '$ki_accessible'('$ki_local_world',X3)
| ~ g('$ki_local_world',X2)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SYO888_10 : TPTP v8.2.0. Released v8.2.0.
% 0.09/0.13 % 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.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 10:46:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TF0_THM_NEQ_NAR problem
% 0.14/0.35 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/benchmark/theBenchmark.p
% 0.58/0.73 % (7337)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.58/0.73 % (7337)First to succeed.
% 0.58/0.73 % (7330)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 theBenchmark for (2996ds/34Mi)
% 0.58/0.73 % (7332)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.73 % (7331)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 theBenchmark for (2996ds/51Mi)
% 0.58/0.73 % (7334)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 theBenchmark for (2996ds/34Mi)
% 0.58/0.73 % (7337)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-7329"
% 0.58/0.73 % (7335)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.58/0.73 % (7333)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.58/0.73 % (7336)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 theBenchmark for (2996ds/83Mi)
% 0.58/0.73 % (7337)Refutation found. Thanks to Tanya!
% 0.58/0.73 % SZS status Theorem for theBenchmark
% 0.58/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.73 % (7337)------------------------------
% 0.58/0.73 % (7337)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.73 % (7337)Termination reason: Refutation
% 0.58/0.73
% 0.58/0.73 % (7337)Memory used [KB]: 974
% 0.58/0.73 % (7337)Time elapsed: 0.002 s
% 0.58/0.73 % (7337)Instructions burned: 3 (million)
% 0.58/0.73 % (7329)Success in time 0.375 s
% 0.58/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------