TSTP Solution File: SYO901_11 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO901_11 : 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 : n002.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:38 EDT 2024
% Result : Theorem 0.58s 0.73s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 47 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 174 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 204 ( 69 ~; 67 |; 38 &)
% ( 11 <=>; 18 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 67 ( 50 !; 17 ?; 67 :)
% 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(func_def_3,type,
sK2: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
p: '$ki_world' > $o ).
tff(pred_def_3,type,
q: '$ki_world' > $o ).
tff(f52,plain,
$false,
inference(avatar_sat_refutation,[],[f30,f39,f43,f45,f51]) ).
tff(f51,plain,
( spl3_2
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f50]) ).
tff(f50,plain,
( $false
| spl3_2
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f49,f35]) ).
tff(f35,plain,
( ! [X4: '$ki_world'] : p(X4)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f34]) ).
tff(f34,plain,
( spl3_3
<=> ! [X4: '$ki_world'] : p(X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
tff(f49,plain,
( ~ p(sK1)
| spl3_2 ),
inference(resolution,[],[f41,f29]) ).
tff(f29,plain,
( ~ q(sK1)
| spl3_2 ),
inference(avatar_component_clause,[],[f27]) ).
tff(f27,plain,
( spl3_2
<=> q(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
tff(f41,plain,
! [X5: '$ki_world'] :
( q(X5)
| ~ p(X5) ),
inference(subsumption_resolution,[],[f13,f21]) ).
tff(f21,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
tff(f13,plain,
! [X5: '$ki_world'] :
( q(X5)
| ~ p(X5)
| ~ '$ki_accessible'('$ki_local_world',X5) ),
inference(cnf_transformation,[],[f12]) ).
tff(f12,plain,
( ( ( ~ q(sK1)
& '$ki_accessible'(sK0,sK1) )
| ( ~ p(sK2)
& '$ki_accessible'(sK0,sK2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) )
| ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(sK0,X4) ) )
& '$ki_accessible'('$ki_local_world',sK0)
& ! [X5: '$ki_world'] :
( ( ( p(X5)
| ~ q(X5) )
& ( q(X5)
| ~ p(X5) ) )
| ~ '$ki_accessible'('$ki_local_world',X5) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f11,f10,f9]) ).
tff(f9,plain,
( ? [X0: '$ki_world'] :
( ( ? [X1: '$ki_world'] :
( ~ q(X1)
& '$ki_accessible'(X0,X1) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X0,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X0,X3) )
| ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(X0,X4) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ( ? [X1: '$ki_world'] :
( ~ q(X1)
& '$ki_accessible'(sK0,X1) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(sK0,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) )
| ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(sK0,X4) ) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f10,plain,
( ? [X1: '$ki_world'] :
( ~ q(X1)
& '$ki_accessible'(sK0,X1) )
=> ( ~ q(sK1)
& '$ki_accessible'(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
( ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(sK0,X2) )
=> ( ~ p(sK2)
& '$ki_accessible'(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f8,plain,
( ? [X0: '$ki_world'] :
( ( ? [X1: '$ki_world'] :
( ~ q(X1)
& '$ki_accessible'(X0,X1) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X0,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X0,X3) )
| ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(X0,X4) ) )
& '$ki_accessible'('$ki_local_world',X0) )
& ! [X5: '$ki_world'] :
( ( ( p(X5)
| ~ q(X5) )
& ( q(X5)
| ~ p(X5) ) )
| ~ '$ki_accessible'('$ki_local_world',X5) ) ),
inference(rectify,[],[f7]) ).
tff(f7,plain,
( ? [X1: '$ki_world'] :
( ( ? [X3: '$ki_world'] :
( ~ q(X3)
& '$ki_accessible'(X1,X3) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X1,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X1,X3) )
| ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X1) )
& ! [X0: '$ki_world'] :
( ( ( p(X0)
| ~ q(X0) )
& ( q(X0)
| ~ p(X0) ) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(flattening,[],[f6]) ).
tff(f6,plain,
( ? [X1: '$ki_world'] :
( ( ? [X3: '$ki_world'] :
( ~ q(X3)
& '$ki_accessible'(X1,X3) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X1,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X1,X3) )
| ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X1) )
& ! [X0: '$ki_world'] :
( ( ( p(X0)
| ~ q(X0) )
& ( q(X0)
| ~ p(X0) ) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(nnf_transformation,[],[f5]) ).
tff(f5,plain,
( ? [X1: '$ki_world'] :
( ( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) )
<~> ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X1,X3) ) )
& '$ki_accessible'('$ki_local_world',X1) )
& ! [X0: '$ki_world'] :
( ( p(X0)
<=> q(X0) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
<=> q(X0) ) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
=> p(X2) )
<=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> q(X3) ) ) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
<=> q(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> p(X2) )
<=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> q(X2) ) ) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
<=> q(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> p(X2) )
<=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> q(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f45,plain,
( spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f44,f37,f34]) ).
tff(f37,plain,
( spl3_4
<=> ! [X3: '$ki_world'] : q(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
tff(f44,plain,
( ! [X0: '$ki_world'] : p(X0)
| ~ spl3_4 ),
inference(resolution,[],[f40,f38]) ).
tff(f38,plain,
( ! [X3: '$ki_world'] : q(X3)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f37]) ).
tff(f40,plain,
! [X5: '$ki_world'] :
( ~ q(X5)
| p(X5) ),
inference(subsumption_resolution,[],[f14,f21]) ).
tff(f14,plain,
! [X5: '$ki_world'] :
( p(X5)
| ~ q(X5)
| ~ '$ki_accessible'('$ki_local_world',X5) ),
inference(cnf_transformation,[],[f12]) ).
tff(f43,plain,
( spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f42]) ).
tff(f42,plain,
( $false
| spl3_1
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f25,f35]) ).
tff(f25,plain,
( ~ p(sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f23]) ).
tff(f23,plain,
( spl3_1
<=> p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
tff(f39,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f32,f37,f34]) ).
tff(f32,plain,
! [X3: '$ki_world',X4: '$ki_world'] :
( q(X3)
| p(X4) ),
inference(subsumption_resolution,[],[f31,f21]) ).
tff(f31,plain,
! [X3: '$ki_world',X4: '$ki_world'] :
( q(X3)
| p(X4)
| ~ '$ki_accessible'(sK0,X4) ),
inference(subsumption_resolution,[],[f16,f21]) ).
tff(f16,plain,
! [X3: '$ki_world',X4: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3)
| p(X4)
| ~ '$ki_accessible'(sK0,X4) ),
inference(cnf_transformation,[],[f12]) ).
tff(f30,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f20,f27,f23]) ).
tff(f20,plain,
( ~ q(sK1)
| ~ p(sK2) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO901_11 : 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.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 08:59:37 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_NEQ_NAR problem
% 0.14/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.58/0.73 % (27254)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 (2996ds/56Mi)
% 0.58/0.73 % (27254)First to succeed.
% 0.58/0.73 % (27247)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.58/0.73 % (27249)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.73 % (27248)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.58/0.73 % (27250)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.58/0.73 % (27251)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 (2996ds/34Mi)
% 0.58/0.73 % (27254)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27246"
% 0.58/0.73 % (27254)Refutation found. Thanks to Tanya!
% 0.58/0.73 % SZS status Theorem for theBenchmark
% 0.58/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.73 % (27254)------------------------------
% 0.58/0.73 % (27254)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.73 % (27254)Termination reason: Refutation
% 0.58/0.73
% 0.58/0.73 % (27254)Memory used [KB]: 979
% 0.58/0.73 % (27254)Time elapsed: 0.002 s
% 0.58/0.73 % (27254)Instructions burned: 3 (million)
% 0.58/0.73 % (27246)Success in time 0.376 s
% 0.58/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------