TSTP Solution File: PLA053_4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PLA053_4 : 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 : n022.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 02:21:19 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of formulae : 44 ( 11 unt; 11 typ; 0 def)
% Number of atoms : 156 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 169 ( 62 ~; 46 |; 41 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 16 ( 16 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 14 ( 8 >; 6 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 67 ( 51 !; 16 ?; 36 :)
% 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' ).
tff(func_def_3,type,
sK2: '$ki_world' > $i ).
tff(func_def_5,type,
sK4: ( '$ki_world' * $i ) > $i ).
tff(func_def_6,type,
sK5: '$ki_world' > $i ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
h: ( '$ki_world' * $i ) > $o ).
tff(pred_def_3,type,
bomb: ( '$ki_world' * $i ) > $o ).
tff(pred_def_4,type,
defused: ( '$ki_world' * $i ) > $o ).
tff(pred_def_5,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f67,plain,
$false,
inference(subsumption_resolution,[],[f64,f44]) ).
tff(f44,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(f64,plain,
~ '$ki_accessible'(sK0,sK0),
inference(resolution,[],[f57,f36]) ).
tff(f36,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f27]) ).
tff(f27,plain,
( ! [X2] :
( ( ~ defused(sK0,sK1)
& h(sK0,X2)
& bomb(sK0,sK1) )
| ~ '$ki_exists_in_world_$i'(sK0,X2) )
& '$ki_exists_in_world_$i'(sK0,sK1)
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f26,f25]) ).
tff(f25,plain,
( ? [X0: '$ki_world'] :
( ? [X1] :
( ! [X2] :
( ( ~ defused(X0,X1)
& h(X0,X2)
& bomb(X0,X1) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ? [X1] :
( ! [X2] :
( ( ~ defused(sK0,X1)
& h(sK0,X2)
& bomb(sK0,X1) )
| ~ '$ki_exists_in_world_$i'(sK0,X2) )
& '$ki_exists_in_world_$i'(sK0,X1) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
( ? [X1] :
( ! [X2] :
( ( ~ defused(sK0,X1)
& h(sK0,X2)
& bomb(sK0,X1) )
| ~ '$ki_exists_in_world_$i'(sK0,X2) )
& '$ki_exists_in_world_$i'(sK0,X1) )
=> ( ! [X2] :
( ( ~ defused(sK0,sK1)
& h(sK0,X2)
& bomb(sK0,sK1) )
| ~ '$ki_exists_in_world_$i'(sK0,X2) )
& '$ki_exists_in_world_$i'(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f17,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ! [X2] :
( ( ~ defused(X0,X1)
& h(X0,X2)
& bomb(X0,X1) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ! [X2] :
( ( ~ defused(X0,X1)
& h(X0,X2)
& bomb(X0,X1) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f10]) ).
tff(f10,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X2] :
( ( ( h(X0,X2)
& bomb(X0,X1) )
=> defused(X0,X1) )
& '$ki_exists_in_world_$i'(X0,X2) ) ) ),
inference(rectify,[],[f9]) ).
tff(f9,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X0,X3)
=> ? [X7] :
( ( ( h(X0,X7)
& bomb(X0,X3) )
=> defused(X0,X3) )
& '$ki_exists_in_world_$i'(X0,X7) ) ) ),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X0,X3)
=> ? [X7] :
( ( ( h(X0,X7)
& bomb(X0,X3) )
=> defused(X0,X3) )
& '$ki_exists_in_world_$i'(X0,X7) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f57,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'(X0,sK0)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f56,f50]) ).
tff(f50,plain,
! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
! [X0: '$ki_world',X1] : '$ki_exists_in_world_$i'(X0,X1),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X0: '$ki_world',X3] : '$ki_exists_in_world_$i'(X0,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(f56,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'(X0,sK0)
| ~ '$ki_exists_in_world_$i'(X0,sK1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f55,f53]) ).
tff(f53,plain,
bomb(sK0,sK1),
inference(subsumption_resolution,[],[f38,f50]) ).
tff(f38,plain,
! [X2: $i] :
( bomb(sK0,sK1)
| ~ '$ki_exists_in_world_$i'(sK0,X2) ),
inference(cnf_transformation,[],[f27]) ).
tff(f55,plain,
! [X0: '$ki_world'] :
( ~ bomb(sK0,sK1)
| ~ '$ki_accessible'(X0,sK0)
| ~ '$ki_exists_in_world_$i'(X0,sK1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f54,f52]) ).
tff(f52,plain,
! [X2: $i] : h(sK0,X2),
inference(subsumption_resolution,[],[f39,f50]) ).
tff(f39,plain,
! [X2: $i] :
( h(sK0,X2)
| ~ '$ki_exists_in_world_$i'(sK0,X2) ),
inference(cnf_transformation,[],[f27]) ).
tff(f54,plain,
! [X0: '$ki_world'] :
( ~ h(sK0,sK4(X0,sK1))
| ~ bomb(sK0,sK1)
| ~ '$ki_accessible'(X0,sK0)
| ~ '$ki_exists_in_world_$i'(X0,sK1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(resolution,[],[f51,f48]) ).
tff(f48,plain,
! [X3: '$ki_world',X0: '$ki_world',X1: $i] :
( defused(X3,X1)
| ~ h(X3,sK4(X0,X1))
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,sK4(X0,X1))
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,sK4(X0,X1)) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f24,f32]) ).
tff(f32,plain,
! [X0: '$ki_world',X1] :
( ? [X2] :
( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,X2)
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,X2) )
=> ( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,sK4(X0,X1))
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
tff(f24,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ? [X2] :
( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,X2)
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f23]) ).
tff(f23,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ? [X2] :
( ! [X3: '$ki_world'] :
( defused(X3,X1)
| ~ h(X3,X2)
| ~ bomb(X3,X1)
| ~ '$ki_accessible'(X0,X3) )
& '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f13]) ).
tff(f13,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X2] :
( ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ( ( h(X3,X2)
& bomb(X3,X1) )
=> defused(X3,X1) ) )
& '$ki_exists_in_world_$i'(X0,X2) ) ) ),
inference(rectify,[],[f7]) ).
tff(f7,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X0,X3)
=> ? [X7] :
( ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( ( h(X6,X7)
& bomb(X6,X3) )
=> defused(X6,X3) ) )
& '$ki_exists_in_world_$i'(X0,X7) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
tff(f51,plain,
~ defused(sK0,sK1),
inference(subsumption_resolution,[],[f40,f50]) ).
tff(f40,plain,
! [X2: $i] :
( ~ defused(sK0,sK1)
| ~ '$ki_exists_in_world_$i'(sK0,X2) ),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PLA053_4 : TPTP v8.2.0. Released v8.2.0.
% 0.10/0.11 % 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.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sat May 18 13:33:07 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a TF0_THM_NEQ_NAR problem
% 0.10/0.32 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.61/0.78 % (25511)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.61/0.78 % (25513)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.78 % (25515)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.61/0.78 % (25514)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.61/0.78 % (25517)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.61/0.78 % (25512)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.61/0.78 % (25518)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 (2995ds/56Mi)
% 0.61/0.78 % (25516)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.61/0.78 % (25518)First to succeed.
% 0.61/0.78 % (25515)Also succeeded, but the first one will report.
% 0.61/0.78 % (25516)Also succeeded, but the first one will report.
% 0.61/0.78 % (25517)Also succeeded, but the first one will report.
% 0.61/0.78 % (25511)Also succeeded, but the first one will report.
% 0.61/0.78 % (25513)Also succeeded, but the first one will report.
% 0.61/0.78 % (25512)Also succeeded, but the first one will report.
% 0.61/0.78 % (25518)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25508"
% 0.61/0.78 % (25518)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for theBenchmark
% 0.61/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.78 % (25518)------------------------------
% 0.61/0.78 % (25518)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (25518)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (25518)Memory used [KB]: 1043
% 0.61/0.78 % (25518)Time elapsed: 0.003 s
% 0.61/0.78 % (25518)Instructions burned: 4 (million)
% 0.61/0.78 % (25508)Success in time 0.458 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------