TSTP Solution File: SYO891_16 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO891_16 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.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:33 EDT 2024
% Result : Theorem 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 78 ( 21 ~; 16 |; 27 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 31 !; 21 ?; 28 :)
% 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: ( $i * '$ki_world' ) > $i ).
tff(func_def_4,type,
sK3: '$ki_world' > $i ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
qmltpeq: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_3,type,
p: ( '$ki_world' * $i ) > $o ).
tff(pred_def_4,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f57,plain,
$false,
inference(unit_resulting_resolution,[],[f35,f51,f34,f33]) ).
tff(f33,plain,
! [X6: $i,X5: '$ki_world'] :
( ~ '$ki_exists_in_world_$i'(X5,X6)
| ~ '$ki_accessible'('$ki_local_world',X5)
| ~ p(X5,X6) ),
inference(cnf_transformation,[],[f19]) ).
tff(f19,plain,
( ! [X5: '$ki_world'] :
( ! [X6] :
( ~ p(X5,X6)
| ~ '$ki_exists_in_world_$i'(X5,X6) )
| ~ '$ki_accessible'('$ki_local_world',X5) )
& ? [X3] :
( ? [X4: '$ki_world'] :
( p(X4,X3)
& '$ki_accessible'('$ki_local_world',X4) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) )
& ! [X0] :
( ! [X1: '$ki_world'] :
( ? [X2] :
( qmltpeq(X1,X0,X2)
& '$ki_exists_in_world_$i'(X1,X2) )
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ) ),
inference(flattening,[],[f18]) ).
tff(f18,plain,
( ! [X5: '$ki_world'] :
( ! [X6] :
( ~ p(X5,X6)
| ~ '$ki_exists_in_world_$i'(X5,X6) )
| ~ '$ki_accessible'('$ki_local_world',X5) )
& ? [X3] :
( ? [X4: '$ki_world'] :
( p(X4,X3)
& '$ki_accessible'('$ki_local_world',X4) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) )
& ! [X0] :
( ! [X1: '$ki_world'] :
( ? [X2] :
( qmltpeq(X1,X0,X2)
& '$ki_exists_in_world_$i'(X1,X2) )
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f11]) ).
tff(f11,plain,
~ ( ! [X0] :
( '$ki_exists_in_world_$i'('$ki_local_world',X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X2] :
( qmltpeq(X1,X0,X2)
& '$ki_exists_in_world_$i'(X1,X2) ) ) )
=> ( ? [X3] :
( ? [X4: '$ki_world'] :
( p(X4,X3)
& '$ki_accessible'('$ki_local_world',X4) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) )
=> ? [X5: '$ki_world'] :
( ? [X6] :
( p(X5,X6)
& '$ki_exists_in_world_$i'(X5,X6) )
& '$ki_accessible'('$ki_local_world',X5) ) ) ),
inference(rectify,[],[f10]) ).
tff(f10,negated_conjecture,
~ ( ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X4] :
( qmltpeq(X0,X3,X4)
& '$ki_exists_in_world_$i'(X0,X4) ) ) )
=> ( ? [X3] :
( ? [X0: '$ki_world'] :
( p(X0,X3)
& '$ki_accessible'('$ki_local_world',X0) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) )
=> ? [X0: '$ki_world'] :
( ? [X3] :
( p(X0,X3)
& '$ki_exists_in_world_$i'(X0,X3) )
& '$ki_accessible'('$ki_local_world',X0) ) ) ),
inference(negated_conjecture,[],[f9]) ).
tff(f9,conjecture,
( ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X4] :
( qmltpeq(X0,X3,X4)
& '$ki_exists_in_world_$i'(X0,X4) ) ) )
=> ( ? [X3] :
( ? [X0: '$ki_world'] :
( p(X0,X3)
& '$ki_accessible'('$ki_local_world',X0) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) )
=> ? [X0: '$ki_world'] :
( ? [X3] :
( p(X0,X3)
& '$ki_exists_in_world_$i'(X0,X3) )
& '$ki_accessible'('$ki_local_world',X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f34,plain,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f19]) ).
tff(f51,plain,
'$ki_exists_in_world_$i'(sK1,sK0),
inference(unit_resulting_resolution,[],[f34,f36,f40]) ).
tff(f40,plain,
! [X2: $i,X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| '$ki_exists_in_world_$i'(X1,X2) ),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
! [X0: '$ki_world',X1: '$ki_world',X2] :
( '$ki_exists_in_world_$i'(X1,X2)
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X2) ),
inference(flattening,[],[f25]) ).
tff(f25,plain,
! [X0: '$ki_world',X1: '$ki_world',X2] :
( '$ki_exists_in_world_$i'(X1,X2)
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X2) ),
inference(ennf_transformation,[],[f15]) ).
tff(f15,plain,
! [X0: '$ki_world',X1: '$ki_world',X2] :
( ( '$ki_accessible'(X0,X1)
& '$ki_exists_in_world_$i'(X0,X2) )
=> '$ki_exists_in_world_$i'(X1,X2) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X0: '$ki_world',X1: '$ki_world',X3] :
( ( '$ki_accessible'(X0,X1)
& '$ki_exists_in_world_$i'(X0,X3) )
=> '$ki_exists_in_world_$i'(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_cumul') ).
tff(f36,plain,
'$ki_exists_in_world_$i'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f19]) ).
tff(f35,plain,
p(sK1,sK0),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO891_16 : TPTP v8.2.0. Released v8.2.0.
% 0.04/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.14/0.35 % Computer : n020.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 : Mon May 20 11:40:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_NEQ_NAR problem
% 0.14/0.36 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/benchmark/theBenchmark.p
% 0.60/0.80 % (27244)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 (2995ds/83Mi)
% 0.60/0.80 % (27238)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 (2995ds/34Mi)
% 0.60/0.80 % (27240)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.80 % (27239)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 (2995ds/51Mi)
% 0.60/0.80 % (27242)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 (2995ds/34Mi)
% 0.60/0.80 % (27244)First to succeed.
% 0.60/0.80 % (27241)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.80 % (27243)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.80 % (27244)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27183"
% 0.60/0.80 % (27244)Refutation found. Thanks to Tanya!
% 0.60/0.80 % SZS status Theorem for theBenchmark
% 0.60/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.80 % (27244)------------------------------
% 0.60/0.80 % (27244)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80 % (27244)Termination reason: Refutation
% 0.60/0.80
% 0.60/0.80 % (27244)Memory used [KB]: 1042
% 0.60/0.80 % (27244)Time elapsed: 0.002 s
% 0.60/0.80 % (27244)Instructions burned: 4 (million)
% 0.60/0.80 % (27183)Success in time 0.438 s
% 0.60/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------