TSTP Solution File: SYO895_9 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO895_9 : 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 : n006.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.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 27 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 81 ( 28 ~; 18 |; 20 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 23 ( 19 !; 4 ?; 23 :)
% 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' > '$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(pred_def_3,type,
q: '$ki_world' > $o ).
tff(f30,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f27,f29]) ).
tff(f29,plain,
spl2_2,
inference(avatar_split_clause,[],[f28,f22]) ).
tff(f22,plain,
( spl2_2
<=> q(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f28,plain,
q(sK1),
inference(resolution,[],[f14,f15]) ).
tff(f15,plain,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
( ( ~ q(sK1)
| ~ p(sK1) )
& '$ki_accessible'('$ki_local_world',sK1)
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f9,f10]) ).
tff(f10,plain,
( ? [X0: '$ki_world'] :
( ( ~ q(X0)
| ~ p(X0) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ( ~ q(sK1)
| ~ p(sK1) )
& '$ki_accessible'('$ki_local_world',sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
( ? [X0: '$ki_world'] :
( ( ~ q(X0)
| ~ p(X0) )
& '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f6]) ).
tff(f6,plain,
( ? [X2: '$ki_world'] :
( ( ~ q(X2)
| ~ p(X2) )
& '$ki_accessible'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(flattening,[],[f5]) ).
tff(f5,plain,
( ? [X2: '$ki_world'] :
( ( ~ q(X2)
| ~ p(X2) )
& '$ki_accessible'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( q(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)
=> q(X0) )
& ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> p(X1) ) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> ( q(X2)
& p(X2) ) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> q(X0) )
& ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( q(X0)
& p(X0) ) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> q(X0) )
& ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( q(X0)
& p(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f14,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| q(X1) ),
inference(cnf_transformation,[],[f11]) ).
tff(f27,plain,
spl2_1,
inference(avatar_split_clause,[],[f26,f18]) ).
tff(f18,plain,
( spl2_1
<=> p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f26,plain,
p(sK1),
inference(resolution,[],[f13,f15]) ).
tff(f13,plain,
! [X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| p(X2) ),
inference(cnf_transformation,[],[f11]) ).
tff(f25,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f16,f22,f18]) ).
tff(f16,plain,
( ~ q(sK1)
| ~ p(sK1) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SYO895_9 : TPTP v8.2.0. Released v8.2.0.
% 0.09/0.11 % 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.10/0.32 % Computer : n006.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon May 20 10:21:23 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a TF0_THM_NEQ_NAR problem
% 0.10/0.32 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.61/0.80 % (22882)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.61/0.80 % (22878)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.61/0.80 % (22880)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.80 % (22881)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.61/0.80 % (22879)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.61/0.80 % (22883)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.61/0.80 % (22884)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.61/0.80 % (22880)Also succeeded, but the first one will report.
% 0.61/0.80 % (22883)Also succeeded, but the first one will report.
% 0.61/0.80 % (22878)Also succeeded, but the first one will report.
% 0.61/0.80 % (22879)First to succeed.
% 0.61/0.80 % (22882)Also succeeded, but the first one will report.
% 0.61/0.80 % (22884)Also succeeded, but the first one will report.
% 0.61/0.80 % (22879)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22877"
% 0.61/0.80 % (22881)Also succeeded, but the first one will report.
% 0.61/0.80 % (22879)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Theorem for theBenchmark
% 0.61/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.80 % (22879)------------------------------
% 0.61/0.80 % (22879)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (22879)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (22879)Memory used [KB]: 967
% 0.61/0.80 % (22879)Time elapsed: 0.003 s
% 0.61/0.80 % (22879)Instructions burned: 2 (million)
% 0.61/0.80 % (22877)Success in time 0.473 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------