TSTP Solution File: SYO899_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO899_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 : 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:36 EDT 2024
% Result : Theorem 0.68s 0.91s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 31 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 107 ( 39 ~; 30 |; 20 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 37 ( 27 !; 10 ?; 37 :)
% 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(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(f31,plain,
$false,
inference(avatar_sat_refutation,[],[f22,f24,f30]) ).
tff(f30,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f29]) ).
tff(f29,plain,
( $false
| ~ spl1_2 ),
inference(resolution,[],[f28,f25]) ).
tff(f25,plain,
~ q(sK0),
inference(resolution,[],[f14,f11]) ).
tff(f11,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
( ! [X0: '$ki_world'] :
( ~ q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) )
| ~ p(sK0) )
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
tff(f8,plain,
( ? [X2: '$ki_world'] :
( ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X2,X3) )
| ~ p(X2) )
& '$ki_accessible'('$ki_local_world',X2) )
=> ( ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) )
| ~ p(sK0) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f7,plain,
( ! [X0: '$ki_world'] :
( ~ q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ? [X2: '$ki_world'] :
( ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X2,X3) )
| ~ p(X2) )
& '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f6]) ).
tff(f6,plain,
( ! [X3: '$ki_world'] :
( ~ q(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
& ? [X0: '$ki_world'] :
( ( ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ p(X0) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(flattening,[],[f5]) ).
tff(f5,plain,
( ! [X3: '$ki_world'] :
( ~ q(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
& ? [X0: '$ki_world'] :
( ( ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ p(X0) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ? [X0: '$ki_world'] :
( ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> p(X2) )
=> ? [X3: '$ki_world'] :
( q(X3)
& '$ki_accessible'('$ki_local_world',X3) ) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ? [X0: '$ki_world'] :
( ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( q(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ? [X0: '$ki_world'] :
( ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( q(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f14,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ q(X0) ),
inference(cnf_transformation,[],[f9]) ).
tff(f28,plain,
( q(sK0)
| ~ spl1_2 ),
inference(resolution,[],[f10,f21]) ).
tff(f21,plain,
( ! [X3: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X3)
| q(X3) )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f20]) ).
tff(f20,plain,
( spl1_2
<=> ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
tff(f10,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f24,plain,
spl1_1,
inference(avatar_split_clause,[],[f23,f16]) ).
tff(f16,plain,
( spl1_1
<=> p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
tff(f23,plain,
p(sK0),
inference(resolution,[],[f13,f11]) ).
tff(f13,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| p(X1) ),
inference(cnf_transformation,[],[f9]) ).
tff(f22,plain,
( ~ spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f12,f20,f16]) ).
tff(f12,plain,
! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO899_8 : 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.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 09:44:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_THM_NEQ_NAR problem
% 0.15/0.36 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.68/0.91 % (2546)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 (2994ds/34Mi)
% 0.68/0.91 % (2548)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.68/0.91 % (2547)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 (2994ds/51Mi)
% 0.68/0.91 % (2549)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.68/0.91 % (2550)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 (2994ds/34Mi)
% 0.68/0.91 % (2551)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.68/0.91 % (2552)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 (2994ds/83Mi)
% 0.68/0.91 % (2553)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 (2994ds/56Mi)
% 0.68/0.91 % (2546)Also succeeded, but the first one will report.
% 0.68/0.91 % (2548)Also succeeded, but the first one will report.
% 0.68/0.91 % (2550)Also succeeded, but the first one will report.
% 0.68/0.91 % (2547)First to succeed.
% 0.68/0.91 % (2551)Also succeeded, but the first one will report.
% 0.68/0.91 % (2549)Also succeeded, but the first one will report.
% 0.68/0.91 % (2553)Also succeeded, but the first one will report.
% 0.68/0.91 % (2552)Also succeeded, but the first one will report.
% 0.68/0.91 % (2547)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2545"
% 0.68/0.91 % (2547)Refutation found. Thanks to Tanya!
% 0.68/0.91 % SZS status Theorem for theBenchmark
% 0.68/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 0.68/0.91 % (2547)------------------------------
% 0.68/0.91 % (2547)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.91 % (2547)Termination reason: Refutation
% 0.68/0.91
% 0.68/0.91 % (2547)Memory used [KB]: 968
% 0.68/0.91 % (2547)Time elapsed: 0.003 s
% 0.68/0.91 % (2547)Instructions burned: 3 (million)
% 0.68/0.91 % (2545)Success in time 0.54 s
% 0.68/0.91 % Vampire---4.8 exiting
%------------------------------------------------------------------------------