TSTP Solution File: PLA054_4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PLA054_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 : n017.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:20 EDT 2024
% Result : Theorem 0.73s 0.89s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 28
% Syntax : Number of formulae : 79 ( 8 unt; 12 typ; 0 def)
% Number of atoms : 397 ( 0 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 472 ( 189 ~; 180 |; 60 &)
% ( 5 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 47 ( 47 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 17 ( 8 >; 9 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 9 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 173 ( 150 !; 23 ?; 132 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_4,type,
sK0: '$ki_world' ).
tff(func_def_5,type,
sK1: '$ki_world' ).
tff(func_def_7,type,
sK3: ( '$ki_world' * $i * $i ) > $i ).
tff(func_def_8,type,
sK4: '$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,
closed: ( '$ki_world' * $i ) > $o ).
tff(pred_def_4,type,
combo: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_5,type,
open: ( '$ki_world' * $i ) > $o ).
tff(pred_def_6,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f158,plain,
$false,
inference(avatar_sat_refutation,[],[f60,f65,f69,f125,f144,f154]) ).
tff(f154,plain,
( spl5_7
| spl5_2
| ~ spl5_3
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f153,f67,f62,f57,f110]) ).
tff(f110,plain,
( spl5_7
<=> ! [X0: '$ki_world'] :
( ~ '$ki_accessible'(X0,sK1)
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_7])]) ).
tff(f57,plain,
( spl5_2
<=> open(sK1,d) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
tff(f62,plain,
( spl5_3
<=> '$ki_accessible'(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
tff(f67,plain,
( spl5_4
<=> ! [X2,X4: '$ki_world'] :
( h(X4,X2)
| ~ '$ki_exists_in_world_$i'(sK0,X2)
| ~ '$ki_accessible'(sK0,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
tff(f153,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'(X0,sK1)
| ~ '$ki_accessible'('$ki_local_world',X0) )
| spl5_2
| ~ spl5_3
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f149,f47]) ).
tff(f47,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(f149,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'(sK1,sK1)
| ~ '$ki_accessible'(X0,sK1)
| ~ '$ki_accessible'('$ki_local_world',X0) )
| spl5_2
| ~ spl5_3
| ~ spl5_4 ),
inference(resolution,[],[f137,f64]) ).
tff(f64,plain,
( '$ki_accessible'(sK0,sK1)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f62]) ).
tff(f137,plain,
( ! [X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X0)
| ~ '$ki_accessible'(X0,sK1)
| ~ '$ki_accessible'(X1,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| spl5_2
| ~ spl5_4 ),
inference(resolution,[],[f135,f59]) ).
tff(f59,plain,
( ~ open(sK1,d)
| spl5_2 ),
inference(avatar_component_clause,[],[f57]) ).
tff(f135,plain,
( ! [X2: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( open(X1,d)
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK0,X0)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_accessible'('$ki_local_world',X2) )
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f134,f46]) ).
tff(f46,plain,
! [X2: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( '$ki_accessible'(X0,X2)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_accessible'(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0: '$ki_world',X1: '$ki_world',X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_accessible'(X0,X1) ),
inference(flattening,[],[f23]) ).
tff(f23,plain,
! [X0: '$ki_world',X1: '$ki_world',X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_accessible'(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,axiom,
! [X0: '$ki_world',X1: '$ki_world',X2: '$ki_world'] :
( ( '$ki_accessible'(X1,X2)
& '$ki_accessible'(X0,X1) )
=> '$ki_accessible'(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_transitive) ).
tff(f134,plain,
( ! [X2: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| open(X1,d)
| ~ '$ki_accessible'(sK0,X0)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X0) )
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f129,f45]) ).
tff(f45,plain,
! [X0: '$ki_world'] :
( closed(X0,d)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: '$ki_world'] :
( closed(X0,d)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> closed(X0,d) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
tff(f129,plain,
( ! [X2: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| open(X1,d)
| ~ '$ki_accessible'(sK0,X0)
| ~ closed(X0,d)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X0) )
| ~ spl5_4 ),
inference(resolution,[],[f127,f43]) ).
tff(f43,plain,
! [X1: '$ki_world'] :
( combo(X1,d,sK2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
( ! [X1: '$ki_world'] :
( combo(X1,d,sK2)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& '$ki_exists_in_world_$i'('$ki_local_world',sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f19,f31]) ).
tff(f31,plain,
( ? [X0] :
( ! [X1: '$ki_world'] :
( combo(X1,d,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& '$ki_exists_in_world_$i'('$ki_local_world',X0) )
=> ( ! [X1: '$ki_world'] :
( combo(X1,d,sK2)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& '$ki_exists_in_world_$i'('$ki_local_world',sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f19,plain,
? [X0] :
( ! [X1: '$ki_world'] :
( combo(X1,d,X0)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f13]) ).
tff(f13,plain,
? [X0] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> combo(X1,d,X0) )
& '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(rectify,[],[f9]) ).
tff(f9,axiom,
? [X1] :
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> combo(X0,d,X1) )
& '$ki_exists_in_world_$i'('$ki_local_world',X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
tff(f127,plain,
( ! [X2: $i,X3: $i,X0: '$ki_world',X1: '$ki_world',X4: '$ki_world'] :
( ~ combo(X0,X2,X3)
| ~ '$ki_accessible'(X0,X1)
| open(X1,X2)
| ~ '$ki_accessible'(sK0,X0)
| ~ closed(X0,X2)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_accessible'('$ki_local_world',X4) )
| ~ spl5_4 ),
inference(resolution,[],[f126,f78]) ).
tff(f78,plain,
! [X2: $i,X0: '$ki_world',X1: $i,X6: '$ki_world',X7: '$ki_world'] :
( ~ h(X6,sK3(X0,X1,X2))
| ~ '$ki_accessible'(X6,X7)
| open(X7,X1)
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f77,f52]) ).
tff(f52,plain,
! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
inference(cnf_transformation,[],[f17]) ).
tff(f17,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(f77,plain,
! [X2: $i,X0: '$ki_world',X1: $i,X6: '$ki_world',X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7)
| ~ h(X6,sK3(X0,X1,X2))
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f49,f52]) ).
tff(f49,plain,
! [X2: $i,X0: '$ki_world',X1: $i,X6: '$ki_world',X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7)
| ~ h(X6,sK3(X0,X1,X2))
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f34]) ).
tff(f34,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,sK3(X0,X1,X2))
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(X0,sK3(X0,X1,X2)) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f26,f33]) ).
tff(f33,plain,
! [X0: '$ki_world',X1,X2] :
( ? [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,X3)
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(X0,X3) )
=> ( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,sK3(X0,X1,X2))
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(X0,sK3(X0,X1,X2)) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ? [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,X3)
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(X0,X3) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f25]) ).
tff(f25,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ? [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,X3)
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(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,[],[f15]) ).
tff(f15,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
=> ? [X3] :
( ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> ( ( h(X4,o)
& ~ combo(X4,X1,X2)
& closed(X4,X1) )
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X4,X5)
=> closed(X5,X1) ) ) )
& ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( ( h(X6,X3)
& combo(X6,X1,X2)
& closed(X6,X1) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> open(X7,X1) ) ) )
& '$ki_exists_in_world_$i'(X0,X3) ) ) ) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X0,X4)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X5] :
( ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( ( h(X6,o)
& ~ combo(X6,X4,X1)
& closed(X6,X4) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> closed(X7,X4) ) ) )
& ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( ( h(X6,X5)
& combo(X6,X4,X1)
& closed(X6,X4) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> open(X7,X4) ) ) )
& '$ki_exists_in_world_$i'(X0,X5) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
tff(f126,plain,
( ! [X2: $i,X4: '$ki_world'] :
( h(X4,X2)
| ~ '$ki_accessible'(sK0,X4) )
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f68,f52]) ).
tff(f68,plain,
( ! [X2: $i,X4: '$ki_world'] :
( h(X4,X2)
| ~ '$ki_exists_in_world_$i'(sK0,X2)
| ~ '$ki_accessible'(sK0,X4) )
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f67]) ).
tff(f144,plain,
( ~ spl5_3
| ~ spl5_7 ),
inference(avatar_contradiction_clause,[],[f143]) ).
tff(f143,plain,
( $false
| ~ spl5_3
| ~ spl5_7 ),
inference(subsumption_resolution,[],[f140,f64]) ).
tff(f140,plain,
( ~ '$ki_accessible'(sK0,sK1)
| ~ spl5_7 ),
inference(resolution,[],[f111,f37]) ).
tff(f37,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
( ! [X1] :
( ! [X2] :
( ( ~ open(sK1,d)
& '$ki_accessible'(sK0,sK1)
& ! [X4: '$ki_world'] :
( ( h(X4,X2)
& combo(X4,d,X1) )
| ~ '$ki_accessible'(sK0,X4) ) )
| ~ '$ki_exists_in_world_$i'(sK0,X2) )
| ~ '$ki_exists_in_world_$i'(sK0,X1) )
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f27,f29,f28]) ).
tff(f28,plain,
( ? [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ( ? [X3: '$ki_world'] :
( ~ open(X3,d)
& '$ki_accessible'(X0,X3) )
& ! [X4: '$ki_world'] :
( ( h(X4,X2)
& combo(X4,d,X1) )
| ~ '$ki_accessible'(X0,X4) ) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X1] :
( ! [X2] :
( ( ? [X3: '$ki_world'] :
( ~ open(X3,d)
& '$ki_accessible'(sK0,X3) )
& ! [X4: '$ki_world'] :
( ( h(X4,X2)
& combo(X4,d,X1) )
| ~ '$ki_accessible'(sK0,X4) ) )
| ~ '$ki_exists_in_world_$i'(sK0,X2) )
| ~ '$ki_exists_in_world_$i'(sK0,X1) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f29,plain,
( ? [X3: '$ki_world'] :
( ~ open(X3,d)
& '$ki_accessible'(sK0,X3) )
=> ( ~ open(sK1,d)
& '$ki_accessible'(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f27,plain,
? [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ( ? [X3: '$ki_world'] :
( ~ open(X3,d)
& '$ki_accessible'(X0,X3) )
& ! [X4: '$ki_world'] :
( ( h(X4,X2)
& combo(X4,d,X1) )
| ~ '$ki_accessible'(X0,X4) ) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(rectify,[],[f18]) ).
tff(f18,plain,
? [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ( ? [X4: '$ki_world'] :
( ~ open(X4,d)
& '$ki_accessible'(X0,X4) )
& ! [X3: '$ki_world'] :
( ( h(X3,X2)
& combo(X3,d,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,[],[f12]) ).
tff(f12,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( ? [X2] :
( ( ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ( h(X3,X2)
& combo(X3,d,X1) ) )
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> open(X4,d) ) )
& '$ki_exists_in_world_$i'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) ) ),
inference(rectify,[],[f11]) ).
tff(f11,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( ? [X5] :
( ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( h(X6,X5)
& combo(X6,d,X1) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> open(X6,d) ) )
& '$ki_exists_in_world_$i'(X0,X5) )
& '$ki_exists_in_world_$i'(X0,X1) ) ),
inference(negated_conjecture,[],[f10]) ).
tff(f10,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( ? [X5] :
( ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( h(X6,X5)
& combo(X6,d,X1) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> open(X6,d) ) )
& '$ki_exists_in_world_$i'(X0,X5) )
& '$ki_exists_in_world_$i'(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f111,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X0,sK1) )
| ~ spl5_7 ),
inference(avatar_component_clause,[],[f110]) ).
tff(f125,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f124]) ).
tff(f124,plain,
( $false
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f55,f52]) ).
tff(f55,plain,
( ! [X1: $i] : ~ '$ki_exists_in_world_$i'(sK0,X1)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f54]) ).
tff(f54,plain,
( spl5_1
<=> ! [X1] : ~ '$ki_exists_in_world_$i'(sK0,X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
tff(f69,plain,
( spl5_1
| spl5_4 ),
inference(avatar_split_clause,[],[f39,f67,f54]) ).
tff(f39,plain,
! [X2: $i,X1: $i,X4: '$ki_world'] :
( h(X4,X2)
| ~ '$ki_accessible'(sK0,X4)
| ~ '$ki_exists_in_world_$i'(sK0,X2)
| ~ '$ki_exists_in_world_$i'(sK0,X1) ),
inference(cnf_transformation,[],[f30]) ).
tff(f65,plain,
( spl5_1
| spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f40,f62,f54,f54]) ).
tff(f40,plain,
! [X2: $i,X1: $i] :
( '$ki_accessible'(sK0,sK1)
| ~ '$ki_exists_in_world_$i'(sK0,X2)
| ~ '$ki_exists_in_world_$i'(sK0,X1) ),
inference(cnf_transformation,[],[f30]) ).
tff(f60,plain,
( spl5_1
| spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f41,f57,f54,f54]) ).
tff(f41,plain,
! [X2: $i,X1: $i] :
( ~ open(sK1,d)
| ~ '$ki_exists_in_world_$i'(sK0,X2)
| ~ '$ki_exists_in_world_$i'(sK0,X1) ),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PLA054_4 : TPTP v8.2.0. Released v8.2.0.
% 0.11/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 : n017.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 : Sat May 18 13:44:08 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.73/0.89 % (5010)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.73/0.89 % (5011)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.73/0.89 % (5014)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.73/0.89 % (5012)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.73/0.89 % (5013)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.73/0.89 % (5016)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.73/0.89 % (5013)Refutation not found, incomplete strategy% (5013)------------------------------
% 0.73/0.89 % (5013)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.89 % (5013)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.89
% 0.73/0.89 % (5013)Memory used [KB]: 1040
% 0.73/0.89 % (5013)Time elapsed: 0.003 s
% 0.73/0.89 % (5013)Instructions burned: 2 (million)
% 0.73/0.89 % (5017)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.73/0.89 % (5013)------------------------------
% 0.73/0.89 % (5013)------------------------------
% 0.73/0.89 % (5010)First to succeed.
% 0.73/0.89 % (5016)Refutation not found, incomplete strategy% (5016)------------------------------
% 0.73/0.89 % (5016)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.89 % (5016)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.89
% 0.73/0.89 % (5016)Memory used [KB]: 1038
% 0.73/0.89 % (5016)Time elapsed: 0.003 s
% 0.73/0.89 % (5016)Instructions burned: 3 (million)
% 0.73/0.89 % (5016)------------------------------
% 0.73/0.89 % (5016)------------------------------
% 0.73/0.89 % (5011)Also succeeded, but the first one will report.
% 0.73/0.89 % (5017)Refutation not found, incomplete strategy% (5017)------------------------------
% 0.73/0.89 % (5017)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.89 % (5017)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.89
% 0.73/0.89 % (5017)Memory used [KB]: 964
% 0.73/0.89 % (5017)Time elapsed: 0.002 s
% 0.73/0.89 % (5017)Instructions burned: 2 (million)
% 0.73/0.89 % (5012)Also succeeded, but the first one will report.
% 0.73/0.89 % (5017)------------------------------
% 0.73/0.89 % (5017)------------------------------
% 0.73/0.89 % (5010)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5009"
% 0.73/0.89 % (5014)Also succeeded, but the first one will report.
% 0.73/0.89 % (5010)Refutation found. Thanks to Tanya!
% 0.73/0.89 % SZS status Theorem for theBenchmark
% 0.73/0.89 % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.90 % (5010)------------------------------
% 0.73/0.90 % (5010)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (5010)Termination reason: Refutation
% 0.73/0.90
% 0.73/0.90 % (5010)Memory used [KB]: 1082
% 0.73/0.90 % (5010)Time elapsed: 0.004 s
% 0.73/0.90 % (5010)Instructions burned: 10 (million)
% 0.73/0.90 % (5009)Success in time 0.529 s
% 0.73/0.90 % Vampire---4.8 exiting
%------------------------------------------------------------------------------