TSTP Solution File: SYO893_11 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO893_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 : n013.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:34 EDT 2024
% Result : Theorem 0.54s 0.73s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 22
% Syntax : Number of formulae : 54 ( 3 unt; 10 typ; 0 def)
% Number of atoms : 199 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 253 ( 98 ~; 74 |; 57 &)
% ( 7 <=>; 15 =>; 0 <=; 2 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 7 ( 6 >; 1 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 104 ( 65 !; 39 ?; 104 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_1,type,
sK1: '$ki_world' > '$ki_world' ).
tff(func_def_2,type,
sK2: '$ki_world' ).
tff(func_def_3,type,
sK3: '$ki_world' > '$ki_world' ).
tff(func_def_4,type,
sK4: '$ki_world' > '$ki_world' ).
tff(func_def_5,type,
sK5: '$ki_world' ).
tff(func_def_6,type,
sK6: '$ki_world' > '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
p: '$ki_world' > $o ).
tff(f63,plain,
$false,
inference(avatar_sat_refutation,[],[f40,f45,f54,f62]) ).
tff(f62,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_contradiction_clause,[],[f61]) ).
tff(f61,plain,
( $false
| ~ spl7_1
| ~ spl7_2 ),
inference(subsumption_resolution,[],[f60,f38]) ).
tff(f38,plain,
( sP0
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f37]) ).
tff(f37,plain,
( spl7_2
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
tff(f60,plain,
( ~ sP0
| ~ spl7_1 ),
inference(subsumption_resolution,[],[f57,f30]) ).
tff(f30,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(f57,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'(sK2,X0)
| ~ sP0 )
| ~ spl7_1 ),
inference(resolution,[],[f35,f22]) ).
tff(f22,plain,
! [X4: '$ki_world'] :
( ~ p(sK3(X4))
| ~ '$ki_accessible'(sK2,X4)
| ~ sP0 ),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
( ( sP0
| ! [X0: '$ki_world'] :
( ( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(sK1(X0),X2) )
& '$ki_accessible'(X0,sK1(X0)) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) )
& ( ( ! [X4: '$ki_world'] :
( ( ~ p(sK3(X4))
& '$ki_accessible'(X4,sK3(X4)) )
| ~ '$ki_accessible'(sK2,X4) )
& '$ki_accessible'('$ki_local_world',sK2) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f9,f12,f11,f10]) ).
tff(f10,plain,
! [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) )
& '$ki_accessible'(X0,X1) )
=> ( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(sK1(X0),X2) )
& '$ki_accessible'(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
( ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) )
=> ( ! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(sK2,X4) )
& '$ki_accessible'('$ki_local_world',sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f12,plain,
! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
=> ( ~ p(sK3(X4))
& '$ki_accessible'(X4,sK3(X4)) ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
( ( sP0
| ! [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) )
& '$ki_accessible'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) )
& ( ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) )
| ~ sP0 ) ),
inference(rectify,[],[f8]) ).
tff(f8,plain,
( ( sP0
| ! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( p(X5)
| ~ '$ki_accessible'(X4,X5) )
& '$ki_accessible'(X3,X4) )
| ~ '$ki_accessible'('$ki_local_world',X3) ) )
& ( ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f6]) ).
tff(f6,plain,
( sP0
<=> ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f35,plain,
( ! [X2: '$ki_world'] : p(X2)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f34]) ).
tff(f34,plain,
( spl7_1
<=> ! [X2: '$ki_world'] : p(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
tff(f54,plain,
( spl7_2
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f53,f43,f37]) ).
tff(f43,plain,
( spl7_3
<=> ! [X4: '$ki_world'] : ~ p(sK6(X4)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
tff(f53,plain,
( sP0
| ~ spl7_3 ),
inference(subsumption_resolution,[],[f52,f30]) ).
tff(f52,plain,
( ! [X0: '$ki_world'] :
( sP0
| ~ '$ki_accessible'('$ki_local_world',X0) )
| ~ spl7_3 ),
inference(subsumption_resolution,[],[f47,f30]) ).
tff(f47,plain,
( ! [X0: '$ki_world',X1: '$ki_world'] :
( sP0
| ~ '$ki_accessible'(sK1(X0),sK6(X1))
| ~ '$ki_accessible'('$ki_local_world',X0) )
| ~ spl7_3 ),
inference(resolution,[],[f44,f24]) ).
tff(f24,plain,
! [X2: '$ki_world',X0: '$ki_world'] :
( p(X2)
| sP0
| ~ '$ki_accessible'(sK1(X0),X2)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f13]) ).
tff(f44,plain,
( ! [X4: '$ki_world'] : ~ p(sK6(X4))
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f43]) ).
tff(f45,plain,
( spl7_3
| spl7_2 ),
inference(avatar_split_clause,[],[f41,f37,f43]) ).
tff(f41,plain,
! [X4: '$ki_world'] :
( sP0
| ~ p(sK6(X4)) ),
inference(subsumption_resolution,[],[f27,f30]) ).
tff(f27,plain,
! [X4: '$ki_world'] :
( sP0
| ~ p(sK6(X4))
| ~ '$ki_accessible'(sK5,X4) ),
inference(cnf_transformation,[],[f19]) ).
tff(f19,plain,
( ( ~ sP0
| ! [X0: '$ki_world'] :
( ( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(sK4(X0),X2) )
& '$ki_accessible'(X0,sK4(X0)) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) )
& ( sP0
| ( ! [X4: '$ki_world'] :
( ( ~ p(sK6(X4))
& '$ki_accessible'(X4,sK6(X4)) )
| ~ '$ki_accessible'(sK5,X4) )
& '$ki_accessible'('$ki_local_world',sK5) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f15,f18,f17,f16]) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) )
& '$ki_accessible'(X0,X1) )
=> ( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(sK4(X0),X2) )
& '$ki_accessible'(X0,sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f17,plain,
( ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) )
=> ( ! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(sK5,X4) )
& '$ki_accessible'('$ki_local_world',sK5) ) ),
introduced(choice_axiom,[]) ).
tff(f18,plain,
! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
=> ( ~ p(sK6(X4))
& '$ki_accessible'(X4,sK6(X4)) ) ),
introduced(choice_axiom,[]) ).
tff(f15,plain,
( ( ~ sP0
| ! [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) )
& '$ki_accessible'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) )
& ( sP0
| ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ) ),
inference(rectify,[],[f14]) ).
tff(f14,plain,
( ( ~ sP0
| ! [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) )
& '$ki_accessible'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) )
& ( sP0
| ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X1,X2) )
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ) ) ),
inference(nnf_transformation,[],[f7]) ).
tff(f7,plain,
( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X1,X2) )
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
<~> sP0 ),
inference(definition_folding,[],[f5,f6]) ).
tff(f5,plain,
( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X1,X2) )
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
<~> ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1: '$ki_world'] :
( ! [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
=> p(X2) )
& '$ki_accessible'(X0,X1) ) )
<=> ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
=> ? [X5: '$ki_world'] :
( ~ p(X5)
& '$ki_accessible'(X4,X5) ) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X2: '$ki_world'] :
( ! [X3: '$ki_world'] :
( '$ki_accessible'(X2,X3)
=> p(X3) )
& '$ki_accessible'(X0,X2) ) )
<=> ? [X0: '$ki_world'] :
( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> ? [X3: '$ki_world'] :
( ~ p(X3)
& '$ki_accessible'(X2,X3) ) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X2: '$ki_world'] :
( ! [X3: '$ki_world'] :
( '$ki_accessible'(X2,X3)
=> p(X3) )
& '$ki_accessible'(X0,X2) ) )
<=> ? [X0: '$ki_world'] :
( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> ? [X3: '$ki_world'] :
( ~ p(X3)
& '$ki_accessible'(X2,X3) ) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f40,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f32,f37,f34]) ).
tff(f32,plain,
! [X2: '$ki_world'] :
( ~ sP0
| p(X2) ),
inference(subsumption_resolution,[],[f31,f30]) ).
tff(f31,plain,
! [X2: '$ki_world',X0: '$ki_world'] :
( ~ sP0
| p(X2)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(subsumption_resolution,[],[f29,f30]) ).
tff(f29,plain,
! [X2: '$ki_world',X0: '$ki_world'] :
( ~ sP0
| p(X2)
| ~ '$ki_accessible'(sK4(X0),X2)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO893_11 : TPTP v8.2.0. Released v8.2.0.
% 0.07/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.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:18:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.37 This is a TF0_THM_NEQ_NAR problem
% 0.14/0.37 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.54/0.73 % (18650)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.54/0.73 % (18656)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.54/0.73 % (18655)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 (2996ds/83Mi)
% 0.54/0.73 % (18650)Also succeeded, but the first one will report.
% 0.54/0.73 % (18656)First to succeed.
% 0.54/0.73 % (18651)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.73 % (18652)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.54/0.73 % (18655)Also succeeded, but the first one will report.
% 0.54/0.73 % (18656)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18648"
% 0.54/0.73 % (18649)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.54/0.73 % (18656)Refutation found. Thanks to Tanya!
% 0.54/0.73 % SZS status Theorem for theBenchmark
% 0.54/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.73 % (18656)------------------------------
% 0.54/0.73 % (18656)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73 % (18656)Termination reason: Refutation
% 0.54/0.73
% 0.54/0.73 % (18656)Memory used [KB]: 975
% 0.54/0.73 % (18656)Time elapsed: 0.002 s
% 0.54/0.73 % (18656)Instructions burned: 4 (million)
% 0.54/0.73 % (18648)Success in time 0.357 s
% 0.54/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------