TSTP Solution File: SYO887_22 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO887_22 : 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 : n026.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:31 EDT 2024
% Result : Theorem 0.71s 0.91s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 24 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 64 ( 25 ~; 15 |; 17 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 32 ( 20 !; 12 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_1,type,
sK0: '$ki_world' > $i ).
tff(func_def_2,type,
sK1: '$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,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f32,plain,
$false,
inference(subsumption_resolution,[],[f31,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(f31,plain,
~ '$ki_accessible'('$ki_local_world','$ki_local_world'),
inference(resolution,[],[f29,f21]) ).
tff(f21,plain,
! [X2: '$ki_world'] :
( f(X2,sK0(X2))
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
( ! [X0] :
( ! [X1: '$ki_world'] :
( ~ f(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
& ! [X2: '$ki_world'] :
( ( f(X2,sK0(X2))
& '$ki_exists_in_world_$i'(X2,sK0(X2)) )
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f16]) ).
tff(f16,plain,
! [X2: '$ki_world'] :
( ? [X3] :
( f(X2,X3)
& '$ki_exists_in_world_$i'(X2,X3) )
=> ( f(X2,sK0(X2))
& '$ki_exists_in_world_$i'(X2,sK0(X2)) ) ),
introduced(choice_axiom,[]) ).
tff(f15,plain,
( ! [X0] :
( ! [X1: '$ki_world'] :
( ~ f(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) )
& ! [X2: '$ki_world'] :
( ? [X3] :
( f(X2,X3)
& '$ki_exists_in_world_$i'(X2,X3) )
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f10]) ).
tff(f10,plain,
( ! [X2] :
( ! [X3: '$ki_world'] :
( ~ f(X3,X2)
| ~ '$ki_accessible'('$ki_local_world',X3) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( ? [X1] :
( f(X0,X1)
& '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( f(X0,X1)
& '$ki_exists_in_world_$i'(X0,X1) ) )
=> ? [X2] :
( ? [X3: '$ki_world'] :
( f(X3,X2)
& '$ki_accessible'('$ki_local_world',X3) )
& '$ki_exists_in_world_$i'('$ki_local_world',X2) ) ),
inference(rectify,[],[f6]) ).
tff(f6,negated_conjecture,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X3] :
( f(X0,X3)
& '$ki_exists_in_world_$i'(X0,X3) ) )
=> ? [X3] :
( ? [X0: '$ki_world'] :
( f(X0,X3)
& '$ki_accessible'('$ki_local_world',X0) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) ) ),
inference(negated_conjecture,[],[f5]) ).
tff(f5,conjecture,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X3] :
( f(X0,X3)
& '$ki_exists_in_world_$i'(X0,X3) ) )
=> ? [X3] :
( ? [X0: '$ki_world'] :
( f(X0,X3)
& '$ki_accessible'('$ki_local_world',X0) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f29,plain,
~ f('$ki_local_world',sK0('$ki_local_world')),
inference(subsumption_resolution,[],[f28,f25]) ).
tff(f28,plain,
( ~ f('$ki_local_world',sK0('$ki_local_world'))
| ~ '$ki_accessible'('$ki_local_world','$ki_local_world') ),
inference(resolution,[],[f27,f20]) ).
tff(f20,plain,
! [X2: '$ki_world'] :
( '$ki_exists_in_world_$i'(X2,sK0(X2))
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(cnf_transformation,[],[f17]) ).
tff(f27,plain,
! [X0: $i] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X0)
| ~ f('$ki_local_world',X0) ),
inference(resolution,[],[f25,f22]) ).
tff(f22,plain,
! [X0: $i,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ f(X1,X0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO887_22 : TPTP v8.2.0. Released v8.2.0.
% 0.03/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.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 10:23:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_THM_NEQ_NAR problem
% 0.15/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/benchmark/theBenchmark.p
% 0.71/0.91 % (11026)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.71/0.91 % (11024)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 (2994ds/34Mi)
% 0.71/0.91 % (11025)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 (2994ds/51Mi)
% 0.71/0.91 % (11027)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.71/0.91 % (11029)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.71/0.91 % (11028)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 (2994ds/34Mi)
% 0.71/0.91 % (11030)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 (2994ds/83Mi)
% 0.71/0.91 % (11031)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 (2994ds/56Mi)
% 0.71/0.91 % (11026)First to succeed.
% 0.71/0.91 % (11024)Also succeeded, but the first one will report.
% 0.71/0.91 % (11029)Also succeeded, but the first one will report.
% 0.71/0.91 % (11027)Also succeeded, but the first one will report.
% 0.71/0.91 % (11025)Also succeeded, but the first one will report.
% 0.71/0.91 % (11031)Also succeeded, but the first one will report.
% 0.71/0.91 % (11028)Also succeeded, but the first one will report.
% 0.71/0.91 % (11030)Also succeeded, but the first one will report.
% 0.71/0.91 % (11026)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11023"
% 0.71/0.91 % (11026)Refutation found. Thanks to Tanya!
% 0.71/0.91 % SZS status Theorem for theBenchmark
% 0.71/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.91 % (11026)------------------------------
% 0.71/0.91 % (11026)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.91 % (11026)Termination reason: Refutation
% 0.71/0.91
% 0.71/0.91 % (11026)Memory used [KB]: 973
% 0.71/0.91 % (11026)Time elapsed: 0.003 s
% 0.71/0.91 % (11026)Instructions burned: 3 (million)
% 0.71/0.91 % (11023)Success in time 0.546 s
% 0.71/0.92 % Vampire---4.8 exiting
%------------------------------------------------------------------------------