TSTP Solution File: SYO894_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO894_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 : n009.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:35 EDT 2024
% Result : Theorem 0.56s 0.72s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 42 ( 1 unt; 6 typ; 0 def)
% Number of atoms : 129 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 158 ( 65 ~; 54 |; 21 &)
% ( 8 <=>; 8 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 28 ( 19 !; 9 ?; 28 :)
% 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_2,type,
sK1: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
p: '$ki_world' > $o ).
tff(f55,plain,
$false,
inference(avatar_sat_refutation,[],[f30,f35,f41,f42,f46,f51,f54]) ).
tff(f54,plain,
( ~ spl2_1
| ~ spl2_3
| ~ spl2_5 ),
inference(avatar_contradiction_clause,[],[f53]) ).
tff(f53,plain,
( $false
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5 ),
inference(subsumption_resolution,[],[f52,f24]) ).
tff(f24,plain,
( p(sK1)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f22]) ).
tff(f22,plain,
( spl2_1
<=> p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f52,plain,
( ~ p(sK1)
| ~ spl2_3
| ~ spl2_5 ),
inference(resolution,[],[f34,f45]) ).
tff(f45,plain,
( ! [X3: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ~ p(X3) )
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f44]) ).
tff(f44,plain,
( spl2_5
<=> ! [X3: '$ki_world'] :
( ~ p(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).
tff(f34,plain,
( '$ki_accessible'('$ki_local_world',sK1)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f32]) ).
tff(f32,plain,
( spl2_3
<=> '$ki_accessible'('$ki_local_world',sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
tff(f51,plain,
( ~ spl2_2
| ~ spl2_4
| ~ spl2_5 ),
inference(avatar_split_clause,[],[f47,f44,f37,f26]) ).
tff(f26,plain,
( spl2_2
<=> p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f37,plain,
( spl2_4
<=> '$ki_accessible'('$ki_local_world',sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
tff(f47,plain,
( ~ p(sK0)
| ~ spl2_4
| ~ spl2_5 ),
inference(resolution,[],[f45,f39]) ).
tff(f39,plain,
( '$ki_accessible'('$ki_local_world',sK0)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f37]) ).
tff(f46,plain,
( spl2_5
| spl2_5 ),
inference(avatar_split_clause,[],[f20,f44,f44]) ).
tff(f20,plain,
! [X2: '$ki_world',X3: '$ki_world'] :
( ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ p(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ),
inference(duplicate_literal_removal,[],[f12]) ).
tff(f12,plain,
! [X2: '$ki_world',X3: '$ki_world'] :
( ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ p(X3)
| ~ p(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
( ( ( p(sK0)
& '$ki_accessible'('$ki_local_world',sK0) )
| ( p(sK1)
& p(sK1)
& '$ki_accessible'('$ki_local_world',sK1) ) )
& ( ! [X2: '$ki_world'] :
( ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
| ! [X3: '$ki_world'] :
( ~ p(X3)
| ~ p(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9]) ).
tff(f9,plain,
( ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) )
=> ( p(sK0)
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f10,plain,
( ? [X1: '$ki_world'] :
( p(X1)
& p(X1)
& '$ki_accessible'('$ki_local_world',X1) )
=> ( p(sK1)
& p(sK1)
& '$ki_accessible'('$ki_local_world',sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f8,plain,
( ( ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) )
| ? [X1: '$ki_world'] :
( p(X1)
& p(X1)
& '$ki_accessible'('$ki_local_world',X1) ) )
& ( ! [X2: '$ki_world'] :
( ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
| ! [X3: '$ki_world'] :
( ~ p(X3)
| ~ p(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ) ) ),
inference(rectify,[],[f7]) ).
tff(f7,plain,
( ( ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'('$ki_local_world',X1) )
| ? [X0: '$ki_world'] :
( p(X0)
& p(X0)
& '$ki_accessible'('$ki_local_world',X0) ) )
& ( ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
| ! [X0: '$ki_world'] :
( ~ p(X0)
| ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) ) ) ),
inference(nnf_transformation,[],[f6]) ).
tff(f6,plain,
( ! [X0: '$ki_world'] :
( ~ p(X0)
| ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
<~> ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(flattening,[],[f5]) ).
tff(f5,plain,
( ! [X0: '$ki_world'] :
( ~ p(X0)
| ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
<~> ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
=> ~ p(X0) ) )
<=> ~ ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
=> ~ p(X0) ) )
<=> ~ ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
=> ~ p(X0) ) )
<=> ~ ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f42,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f13,f37,f32]) ).
tff(f13,plain,
( '$ki_accessible'('$ki_local_world',sK0)
| '$ki_accessible'('$ki_local_world',sK1) ),
inference(cnf_transformation,[],[f11]) ).
tff(f41,plain,
( spl2_1
| spl2_4 ),
inference(avatar_split_clause,[],[f14,f37,f22]) ).
tff(f14,plain,
( '$ki_accessible'('$ki_local_world',sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f11]) ).
tff(f35,plain,
( spl2_3
| spl2_2 ),
inference(avatar_split_clause,[],[f16,f26,f32]) ).
tff(f16,plain,
( p(sK0)
| '$ki_accessible'('$ki_local_world',sK1) ),
inference(cnf_transformation,[],[f11]) ).
tff(f30,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f17,f26,f22]) ).
tff(f17,plain,
( p(sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO894_8 : TPTP v8.2.0. Released v8.2.0.
% 0.13/0.13 % 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.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 10:57:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TF0_THM_NEQ_NAR problem
% 0.20/0.35 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.49/0.72 % (9651)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.49/0.72 % (9651)First to succeed.
% 0.49/0.72 % (9646)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 (2996ds/34Mi)
% 0.49/0.72 % (9648)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.49/0.72 % (9647)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 (2996ds/51Mi)
% 0.56/0.72 % (9651)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-9645"
% 0.56/0.72 % (9651)Refutation found. Thanks to Tanya!
% 0.56/0.72 % SZS status Theorem for theBenchmark
% 0.56/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.72 % (9651)------------------------------
% 0.56/0.72 % (9651)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.72 % (9651)Termination reason: Refutation
% 0.56/0.72
% 0.56/0.72 % (9651)Memory used [KB]: 981
% 0.56/0.72 % (9651)Time elapsed: 0.002 s
% 0.56/0.72 % (9651)Instructions burned: 3 (million)
% 0.56/0.72 % (9645)Success in time 0.367 s
% 0.56/0.72 % Vampire---4.8 exiting
%------------------------------------------------------------------------------