TSTP Solution File: LCL953_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL953_8 : 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 : n014.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 00:24:10 EDT 2024
% Result : Theorem 0.60s 0.79s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 29
% Syntax : Number of formulae : 68 ( 10 unt; 17 typ; 0 def)
% Number of atoms : 446 ( 0 equ)
% Maximal formula atoms : 20 ( 8 avg)
% Number of connectives : 454 ( 168 ~; 129 |; 102 &)
% ( 2 <=>; 53 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 109 ( 109 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 26 ( 11 >; 15 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 5 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 203 ( 131 !; 72 ?; 167 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_2,type,
sK0: '$ki_world' ).
tff(func_def_4,type,
sK2: '$ki_world' ).
tff(func_def_6,type,
sK4: '$ki_world' ).
tff(func_def_7,type,
sK5: '$ki_world' ).
tff(func_def_8,type,
sK6: '$ki_world' > '$ki_world' ).
tff(func_def_9,type,
sK7: ( $i * $i * '$ki_world' ) > '$ki_world' ).
tff(func_def_10,type,
sK8: ( $i * $i * '$ki_world' ) > '$ki_world' ).
tff(func_def_11,type,
sK9: ( $i * $i * '$ki_world' ) > '$ki_world' ).
tff(func_def_12,type,
sK10: ( $i * $i * '$ki_world' ) > '$ki_world' ).
tff(func_def_13,type,
sK11: '$ki_world' > $i ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
in: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_3,type,
disjoint: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_4,type,
empty: ( '$ki_world' * $i ) > $o ).
tff(pred_def_5,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f83,plain,
$false,
inference(avatar_sat_refutation,[],[f72,f76,f82]) ).
tff(f82,plain,
~ spl12_1,
inference(avatar_contradiction_clause,[],[f81]) ).
tff(f81,plain,
( $false
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f80,f47]) ).
tff(f47,plain,
'$ki_accessible'(sK2,sK4),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
( ~ disjoint(sK5,singleton(sK1),sK3)
& '$ki_accessible'(sK4,sK5)
& ! [X6: '$ki_world'] :
( ( ~ in(sK6(X6),sK1,sK3)
& '$ki_accessible'(X6,sK6(X6)) )
| ~ '$ki_accessible'(sK4,X6) )
& '$ki_accessible'(sK2,sK4)
& '$ki_exists_in_world_$i'(sK2,sK3)
& '$ki_accessible'(sK0,sK2)
& '$ki_exists_in_world_$i'(sK0,sK1)
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f22,f29,f28,f27,f26,f25,f24,f23]) ).
tff(f23,plain,
( ? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(X1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,X1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(X1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,X1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(sK0,X2) )
& '$ki_exists_in_world_$i'(sK0,X1) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f24,plain,
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(X1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,X1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(sK0,X2) )
& '$ki_exists_in_world_$i'(sK0,X1) )
=> ( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(sK0,X2) )
& '$ki_exists_in_world_$i'(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f25,plain,
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(sK0,X2) )
=> ( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(sK2,X4) )
& '$ki_exists_in_world_$i'(sK2,X3) )
& '$ki_accessible'(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(sK2,X4) )
& '$ki_exists_in_world_$i'(sK2,X3) )
=> ( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK1),sK3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK1,sK3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(sK2,X4) )
& '$ki_exists_in_world_$i'(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f27,plain,
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK1),sK3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK1,sK3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(sK2,X4) )
=> ( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK1),sK3)
& '$ki_accessible'(sK4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK1,sK3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(sK4,X6) )
& '$ki_accessible'(sK2,sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f28,plain,
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK1),sK3)
& '$ki_accessible'(sK4,X5) )
=> ( ~ disjoint(sK5,singleton(sK1),sK3)
& '$ki_accessible'(sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
tff(f29,plain,
! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK1,sK3)
& '$ki_accessible'(X6,X7) )
=> ( ~ in(sK6(X6),sK1,sK3)
& '$ki_accessible'(X6,sK6(X6)) ) ),
introduced(choice_axiom,[]) ).
tff(f22,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(X1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,X1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(rectify,[],[f15]) ).
tff(f15,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ disjoint(X7,singleton(X1),X3)
& '$ki_accessible'(X4,X7) )
& ! [X5: '$ki_world'] :
( ? [X6: '$ki_world'] :
( ~ in(X6,X1,X3)
& '$ki_accessible'(X5,X6) )
| ~ '$ki_accessible'(X4,X5) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f14]) ).
tff(f14,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ disjoint(X7,singleton(X1),X3)
& '$ki_accessible'(X4,X7) )
& ! [X5: '$ki_world'] :
( ? [X6: '$ki_world'] :
( ~ in(X6,X1,X3)
& '$ki_accessible'(X5,X6) )
| ~ '$ki_accessible'(X4,X5) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(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: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X2,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X2,X4)
=> ( ! [X5: '$ki_world'] :
( '$ki_accessible'(X4,X5)
=> ~ ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> in(X6,X1,X3) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X4,X7)
=> disjoint(X7,singleton(X1),X3) ) ) ) ) ) ) ),
inference(rectify,[],[f9]) ).
tff(f9,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X3,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X3,X5)
=> ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> ~ ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> in(X7,X2,X4) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> disjoint(X6,singleton(X2),X4) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X3,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X3,X5)
=> ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> ~ ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> in(X7,X2,X4) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> disjoint(X6,singleton(X2),X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f80,plain,
( ~ '$ki_accessible'(sK2,sK4)
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f79,f45]) ).
tff(f45,plain,
'$ki_accessible'(sK0,sK2),
inference(cnf_transformation,[],[f30]) ).
tff(f79,plain,
( ~ '$ki_accessible'(sK0,sK2)
| ~ '$ki_accessible'(sK2,sK4)
| ~ spl12_1 ),
inference(resolution,[],[f78,f46]) ).
tff(f46,plain,
'$ki_exists_in_world_$i'(sK2,sK3),
inference(cnf_transformation,[],[f30]) ).
tff(f78,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_exists_in_world_$i'(X0,sK3)
| ~ '$ki_accessible'(sK0,X0)
| ~ '$ki_accessible'(X0,sK4) )
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f77,f43]) ).
tff(f43,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f30]) ).
tff(f77,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',sK0)
| ~ '$ki_accessible'(X0,sK4)
| ~ '$ki_accessible'(sK0,X0)
| ~ '$ki_exists_in_world_$i'(X0,sK3) )
| ~ spl12_1 ),
inference(resolution,[],[f68,f44]) ).
tff(f44,plain,
'$ki_exists_in_world_$i'(sK0,sK1),
inference(cnf_transformation,[],[f30]) ).
tff(f68,plain,
( ! [X4: '$ki_world',X5: '$ki_world'] :
( ~ '$ki_exists_in_world_$i'(X5,sK1)
| ~ '$ki_accessible'('$ki_local_world',X5)
| ~ '$ki_accessible'(X4,sK4)
| ~ '$ki_accessible'(X5,X4)
| ~ '$ki_exists_in_world_$i'(X4,sK3) )
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f67]) ).
tff(f67,plain,
( spl12_1
<=> ! [X4: '$ki_world',X5: '$ki_world'] :
( ~ '$ki_accessible'(X4,sK4)
| ~ '$ki_accessible'('$ki_local_world',X5)
| ~ '$ki_exists_in_world_$i'(X5,sK1)
| ~ '$ki_accessible'(X5,X4)
| ~ '$ki_exists_in_world_$i'(X4,sK3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
tff(f76,plain,
~ spl12_2,
inference(avatar_contradiction_clause,[],[f75]) ).
tff(f75,plain,
( $false
| ~ spl12_2 ),
inference(subsumption_resolution,[],[f74,f50]) ).
tff(f50,plain,
'$ki_accessible'(sK4,sK5),
inference(cnf_transformation,[],[f30]) ).
tff(f74,plain,
( ~ '$ki_accessible'(sK4,sK5)
| ~ spl12_2 ),
inference(resolution,[],[f71,f51]) ).
tff(f51,plain,
~ disjoint(sK5,singleton(sK1),sK3),
inference(cnf_transformation,[],[f30]) ).
tff(f71,plain,
( ! [X3: '$ki_world'] :
( disjoint(X3,singleton(sK1),sK3)
| ~ '$ki_accessible'(sK4,X3) )
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f70]) ).
tff(f70,plain,
( spl12_2
<=> ! [X3: '$ki_world'] :
( ~ '$ki_accessible'(sK4,X3)
| disjoint(X3,singleton(sK1),sK3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
tff(f72,plain,
( spl12_1
| spl12_2
| spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f65,f70,f67,f70,f67]) ).
tff(f65,plain,
! [X2: '$ki_world',X3: '$ki_world',X0: '$ki_world',X1: '$ki_world',X4: '$ki_world',X5: '$ki_world'] :
( ~ '$ki_accessible'(sK4,X0)
| disjoint(X0,singleton(sK1),sK3)
| ~ '$ki_accessible'(X1,sK4)
| ~ '$ki_exists_in_world_$i'(X1,sK3)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,sK1)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'(sK4,X3)
| disjoint(X3,singleton(sK1),sK3)
| ~ '$ki_accessible'(X4,sK4)
| ~ '$ki_exists_in_world_$i'(X4,sK3)
| ~ '$ki_accessible'(X5,X4)
| ~ '$ki_exists_in_world_$i'(X5,sK1)
| ~ '$ki_accessible'('$ki_local_world',X5) ),
inference(resolution,[],[f64,f53]) ).
tff(f53,plain,
! [X2: '$ki_world',X3: $i,X0: '$ki_world',X1: $i,X4: '$ki_world',X5: '$ki_world'] :
( '$ki_accessible'(X4,sK7(X1,X3,X4))
| ~ '$ki_accessible'(X4,X5)
| disjoint(X5,singleton(X1),X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( disjoint(X5,singleton(X1),X3)
| ~ '$ki_accessible'(X4,X5) )
| ( ! [X7: '$ki_world'] :
( in(X7,X1,X3)
| ~ '$ki_accessible'(sK7(X1,X3,X4),X7) )
& '$ki_accessible'(X4,sK7(X1,X3,X4)) )
| ~ '$ki_accessible'(X2,X4) )
| ~ '$ki_exists_in_world_$i'(X2,X3) )
| ~ '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f31,f32]) ).
tff(f32,plain,
! [X1,X3,X4: '$ki_world'] :
( ? [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( in(X7,X1,X3)
| ~ '$ki_accessible'(X6,X7) )
& '$ki_accessible'(X4,X6) )
=> ( ! [X7: '$ki_world'] :
( in(X7,X1,X3)
| ~ '$ki_accessible'(sK7(X1,X3,X4),X7) )
& '$ki_accessible'(X4,sK7(X1,X3,X4)) ) ),
introduced(choice_axiom,[]) ).
tff(f31,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( disjoint(X5,singleton(X1),X3)
| ~ '$ki_accessible'(X4,X5) )
| ? [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( in(X7,X1,X3)
| ~ '$ki_accessible'(X6,X7) )
& '$ki_accessible'(X4,X6) )
| ~ '$ki_accessible'(X2,X4) )
| ~ '$ki_exists_in_world_$i'(X2,X3) )
| ~ '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X7: '$ki_world'] :
( disjoint(X7,singleton(X1),X3)
| ~ '$ki_accessible'(X4,X7) )
| ? [X5: '$ki_world'] :
( ! [X6: '$ki_world'] :
( in(X6,X1,X3)
| ~ '$ki_accessible'(X5,X6) )
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X2,X4) )
| ~ '$ki_exists_in_world_$i'(X2,X3) )
| ~ '$ki_accessible'(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: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X7: '$ki_world'] :
( disjoint(X7,singleton(X1),X3)
| ~ '$ki_accessible'(X4,X7) )
| ? [X5: '$ki_world'] :
( ! [X6: '$ki_world'] :
( in(X6,X1,X3)
| ~ '$ki_accessible'(X5,X6) )
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X2,X4) )
| ~ '$ki_exists_in_world_$i'(X2,X3) )
| ~ '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f11]) ).
tff(f11,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X2,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X2,X4)
=> ( ! [X5: '$ki_world'] :
( '$ki_accessible'(X4,X5)
=> ~ ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> in(X6,X1,X3) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X4,X7)
=> disjoint(X7,singleton(X1),X3) ) ) ) ) ) ) ),
inference(rectify,[],[f7]) ).
tff(f7,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X3,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X3,X5)
=> ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> ~ ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> in(X7,X2,X4) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> disjoint(X6,singleton(X2),X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
tff(f64,plain,
! [X2: '$ki_world',X3: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(sK4,sK7(sK1,sK3,X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK1),sK3)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,sK3)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,sK1)
| ~ '$ki_accessible'('$ki_local_world',X3) ),
inference(duplicate_literal_removal,[],[f63]) ).
tff(f63,plain,
! [X2: '$ki_world',X3: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK4,sK7(sK1,sK3,X0))
| disjoint(X1,singleton(sK1),sK3)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,sK3)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,sK1)
| ~ '$ki_accessible'('$ki_local_world',X3)
| ~ '$ki_accessible'(sK4,sK7(sK1,sK3,X0)) ),
inference(resolution,[],[f62,f49]) ).
tff(f49,plain,
! [X6: '$ki_world'] :
( ~ in(sK6(X6),sK1,sK3)
| ~ '$ki_accessible'(sK4,X6) ),
inference(cnf_transformation,[],[f30]) ).
tff(f62,plain,
! [X2: '$ki_world',X3: '$ki_world',X0: $i,X1: $i,X4: '$ki_world',X5: '$ki_world'] :
( in(sK6(sK7(X0,X1,X2)),X0,X1)
| ~ '$ki_accessible'(X2,X3)
| ~ '$ki_accessible'(sK4,sK7(X0,X1,X2))
| disjoint(X3,singleton(X0),X1)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| ~ '$ki_accessible'(X5,X4)
| ~ '$ki_exists_in_world_$i'(X5,X0)
| ~ '$ki_accessible'('$ki_local_world',X5) ),
inference(resolution,[],[f48,f54]) ).
tff(f54,plain,
! [X2: '$ki_world',X3: $i,X0: '$ki_world',X1: $i,X7: '$ki_world',X4: '$ki_world',X5: '$ki_world'] :
( ~ '$ki_accessible'(sK7(X1,X3,X4),X7)
| ~ '$ki_accessible'(X4,X5)
| in(X7,X1,X3)
| disjoint(X5,singleton(X1),X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f33]) ).
tff(f48,plain,
! [X6: '$ki_world'] :
( '$ki_accessible'(X6,sK6(X6))
| ~ '$ki_accessible'(sK4,X6) ),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09 % Problem : LCL953_8 : TPTP v8.2.0. Released v8.2.0.
% 0.09/0.10 % 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.09/0.30 % Computer : n014.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 02:13:07 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TF0_THM_NEQ_NAR problem
% 0.09/0.31 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.60/0.79 % (28152)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.79 % (28153)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.79 % (28154)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.79 % (28155)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.79 % (28156)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.79 % (28157)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.79 % (28158)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.79 % (28159)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.60/0.79 % (28157)First to succeed.
% 0.60/0.79 % (28154)Also succeeded, but the first one will report.
% 0.60/0.79 % (28153)Also succeeded, but the first one will report.
% 0.60/0.79 % (28156)Also succeeded, but the first one will report.
% 0.60/0.79 % (28157)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28148"
% 0.60/0.79 % (28155)Also succeeded, but the first one will report.
% 0.60/0.79 % (28152)Also succeeded, but the first one will report.
% 0.60/0.79 % (28159)Also succeeded, but the first one will report.
% 0.60/0.79 % (28157)Refutation found. Thanks to Tanya!
% 0.60/0.79 % SZS status Theorem for theBenchmark
% 0.60/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.79 % (28157)------------------------------
% 0.60/0.79 % (28157)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (28157)Termination reason: Refutation
% 0.60/0.79
% 0.60/0.79 % (28157)Memory used [KB]: 1054
% 0.60/0.79 % (28157)Time elapsed: 0.005 s
% 0.60/0.79 % (28157)Instructions burned: 6 (million)
% 0.60/0.79 % (28148)Success in time 0.477 s
% 0.60/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------