TSTP Solution File: SYO898_9 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO898_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n021.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.57s 0.73s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 20 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 37 ( 13 ~; 6 |; 6 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 21 ( 15 !; 6 ?; 21 :)
% 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(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(f14,plain,
$false,
inference(resolution,[],[f13,f12]) ).
tff(f12,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,sK0(X0)),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,sK0(X0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f8]) ).
tff(f8,plain,
! [X0: '$ki_world'] :
( ? [X1: '$ki_world'] : '$ki_accessible'(X0,X1)
=> '$ki_accessible'(X0,sK0(X0)) ),
introduced(choice_axiom,[]) ).
tff(f1,axiom,
! [X0: '$ki_world'] :
? [X1: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_serial) ).
tff(f13,plain,
! [X1: '$ki_world'] : ~ '$ki_accessible'('$ki_local_world',X1),
inference(subsumption_resolution,[],[f10,f11]) ).
tff(f11,plain,
! [X0: '$ki_world'] :
( ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f7]) ).
tff(f7,plain,
( ! [X0: '$ki_world'] :
( ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(rectify,[],[f6]) ).
tff(f6,plain,
( ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(pure_predicate_removal,[],[f4]) ).
tff(f4,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X1: '$ki_world'] :
( ( q(X1)
=> 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) )
=> ? [X0: '$ki_world'] :
( ( q(X0)
=> 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) )
=> ? [X0: '$ki_world'] :
( ( q(X0)
=> p(X0) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f10,plain,
! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO898_9 : TPTP v8.2.0. Released v8.2.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n021.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 09:53:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TF0_THM_NEQ_NAR problem
% 0.13/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.72 % (11170)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.57/0.72 % (11162)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.57/0.72 % (11163)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.57/0.72 % (11165)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.57/0.72 % (11170)First to succeed.
% 0.57/0.72 % (11170)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11161"
% 0.57/0.73 % (11169)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.57/0.73 % (11163)Also succeeded, but the first one will report.
% 0.57/0.73 % (11165)Also succeeded, but the first one will report.
% 0.57/0.73 % (11162)Also succeeded, but the first one will report.
% 0.57/0.73 % (11170)Refutation found. Thanks to Tanya!
% 0.57/0.73 % SZS status Theorem for theBenchmark
% 0.57/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.73 % (11170)------------------------------
% 0.57/0.73 % (11170)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.73 % (11170)Termination reason: Refutation
% 0.57/0.73
% 0.57/0.73 % (11170)Memory used [KB]: 970
% 0.57/0.73 % (11170)Time elapsed: 0.002 s
% 0.57/0.73 % (11170)Instructions burned: 2 (million)
% 0.57/0.73 % (11161)Success in time 0.373 s
% 0.57/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------