TSTP Solution File: SYO902_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO902_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 : n022.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 : 11
% Number of leaves : 10
% Syntax : Number of formulae : 25 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 85 ( 30 ~; 20 |; 27 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 45 ( 25 !; 20 ?; 45 :)
% 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' > '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
p: '$ki_world' > $o ).
tff(f25,plain,
$false,
inference(subsumption_resolution,[],[f22,f14]) ).
tff(f14,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(f22,plain,
~ '$ki_accessible'(sK0,sK0),
inference(resolution,[],[f21,f10]) ).
tff(f10,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
( ! [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X3: '$ki_world'] :
( ( p(sK1(X3))
& '$ki_accessible'(X3,sK1(X3)) )
| ~ '$ki_accessible'(sK0,X3) )
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
tff(f7,plain,
( ? [X2: '$ki_world'] :
( ! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
| ~ '$ki_accessible'(X2,X3) )
& '$ki_accessible'('$ki_local_world',X2) )
=> ( ! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
| ~ '$ki_accessible'(sK0,X3) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f8,plain,
! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
=> ( p(sK1(X3))
& '$ki_accessible'(X3,sK1(X3)) ) ),
introduced(choice_axiom,[]) ).
tff(f6,plain,
( ! [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ? [X2: '$ki_world'] :
( ! [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
| ~ '$ki_accessible'(X2,X3) )
& '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f5]) ).
tff(f5,plain,
( ! [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( ~ p(X4)
| ~ '$ki_accessible'(X3,X4) )
| ~ '$ki_accessible'('$ki_local_world',X3) )
& ? [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(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ? [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( p(X4)
& '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f21,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(sK0,X0) ),
inference(duplicate_literal_removal,[],[f16]) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(sK0,X0)
| ~ '$ki_accessible'(sK0,X0) ),
inference(resolution,[],[f15,f11]) ).
tff(f11,plain,
! [X3: '$ki_world'] :
( '$ki_accessible'(X3,sK1(X3))
| ~ '$ki_accessible'(sK0,X3) ),
inference(cnf_transformation,[],[f9]) ).
tff(f15,plain,
! [X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X0,sK1(X1))
| ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(sK0,X1) ),
inference(resolution,[],[f13,f12]) ).
tff(f12,plain,
! [X3: '$ki_world'] :
( p(sK1(X3))
| ~ '$ki_accessible'(sK0,X3) ),
inference(cnf_transformation,[],[f9]) ).
tff(f13,plain,
! [X0: '$ki_world',X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO902_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.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 11:01:52 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 % (12660)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 % (12660)First to succeed.
% 0.58/0.73 % (12656)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 % (12654)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 % (12660)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12652"
% 0.58/0.73 % (12660)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 % (12660)------------------------------
% 0.58/0.73 % (12660)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.73 % (12660)Termination reason: Refutation
% 0.58/0.73
% 0.58/0.73 % (12660)Memory used [KB]: 972
% 0.58/0.73 % (12660)Time elapsed: 0.002 s
% 0.58/0.73 % (12660)Instructions burned: 3 (million)
% 0.58/0.73 % (12652)Success in time 0.377 s
% 0.58/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------