TSTP Solution File: SYO889_16 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO889_16 : 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 : n009.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:32 EDT 2024
% Result : Theorem 0.52s 0.73s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 30 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 142 ( 0 equ)
% Maximal formula atoms : 13 ( 6 avg)
% Number of connectives : 157 ( 49 ~; 41 |; 52 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 13 ( 13 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 79 ( 47 !; 32 ?; 55 :)
% 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' * $i ) > '$ki_world' ).
tff(func_def_2,type,
sK1: '$ki_world' ).
tff(func_def_4,type,
sK3: '$ki_world' > $i ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
a: ( '$ki_world' * $i ) > $o ).
tff(pred_def_3,type,
b: ( '$ki_world' * $i ) > $o ).
tff(pred_def_4,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f60,plain,
$false,
inference(subsumption_resolution,[],[f56,f45]) ).
tff(f45,plain,
a(sK0(sK1,sK2),sK2),
inference(unit_resulting_resolution,[],[f41,f25]) ).
tff(f25,plain,
! [X8: '$ki_world'] :
( a(X8,sK2)
| ~ '$ki_accessible'(sK1,X8) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
( ! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ~ b(X2,X1)
| ~ a(X2,X1)
| ~ '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X3: '$ki_world'] :
( ! [X4] :
( ( b(sK0(X3,X4),X4)
& '$ki_accessible'(X3,sK0(X3,X4)) )
| ~ '$ki_exists_in_world_$i'(X3,X4) )
| ~ '$ki_accessible'('$ki_local_world',X3) )
& ! [X8: '$ki_world'] :
( a(X8,sK2)
| ~ '$ki_accessible'(sK1,X8) )
& '$ki_exists_in_world_$i'(sK1,sK2)
& '$ki_accessible'('$ki_local_world',sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f19,f18,f17]) ).
tff(f17,plain,
! [X3: '$ki_world',X4] :
( ? [X5: '$ki_world'] :
( b(X5,X4)
& '$ki_accessible'(X3,X5) )
=> ( b(sK0(X3,X4),X4)
& '$ki_accessible'(X3,sK0(X3,X4)) ) ),
introduced(choice_axiom,[]) ).
tff(f18,plain,
( ? [X6: '$ki_world'] :
( ? [X7] :
( ! [X8: '$ki_world'] :
( a(X8,X7)
| ~ '$ki_accessible'(X6,X8) )
& '$ki_exists_in_world_$i'(X6,X7) )
& '$ki_accessible'('$ki_local_world',X6) )
=> ( ? [X7] :
( ! [X8: '$ki_world'] :
( a(X8,X7)
| ~ '$ki_accessible'(sK1,X8) )
& '$ki_exists_in_world_$i'(sK1,X7) )
& '$ki_accessible'('$ki_local_world',sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f19,plain,
( ? [X7] :
( ! [X8: '$ki_world'] :
( a(X8,X7)
| ~ '$ki_accessible'(sK1,X8) )
& '$ki_exists_in_world_$i'(sK1,X7) )
=> ( ! [X8: '$ki_world'] :
( a(X8,sK2)
| ~ '$ki_accessible'(sK1,X8) )
& '$ki_exists_in_world_$i'(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f16,plain,
( ! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ~ b(X2,X1)
| ~ a(X2,X1)
| ~ '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X3: '$ki_world'] :
( ! [X4] :
( ? [X5: '$ki_world'] :
( b(X5,X4)
& '$ki_accessible'(X3,X5) )
| ~ '$ki_exists_in_world_$i'(X3,X4) )
| ~ '$ki_accessible'('$ki_local_world',X3) )
& ? [X6: '$ki_world'] :
( ? [X7] :
( ! [X8: '$ki_world'] :
( a(X8,X7)
| ~ '$ki_accessible'(X6,X8) )
& '$ki_exists_in_world_$i'(X6,X7) )
& '$ki_accessible'('$ki_local_world',X6) ) ),
inference(rectify,[],[f11]) ).
tff(f11,plain,
( ! [X6: '$ki_world'] :
( ! [X7] :
( ! [X8: '$ki_world'] :
( ~ b(X8,X7)
| ~ a(X8,X7)
| ~ '$ki_accessible'(X6,X8) )
| ~ '$ki_exists_in_world_$i'(X6,X7) )
| ~ '$ki_accessible'('$ki_local_world',X6) )
& ! [X0: '$ki_world'] :
( ! [X1] :
( ? [X2: '$ki_world'] :
( b(X2,X1)
& '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ? [X3: '$ki_world'] :
( ? [X4] :
( ! [X5: '$ki_world'] :
( a(X5,X4)
| ~ '$ki_accessible'(X3,X5) )
& '$ki_exists_in_world_$i'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(flattening,[],[f10]) ).
tff(f10,plain,
( ! [X6: '$ki_world'] :
( ! [X7] :
( ! [X8: '$ki_world'] :
( ~ b(X8,X7)
| ~ a(X8,X7)
| ~ '$ki_accessible'(X6,X8) )
| ~ '$ki_exists_in_world_$i'(X6,X7) )
| ~ '$ki_accessible'('$ki_local_world',X6) )
& ! [X0: '$ki_world'] :
( ! [X1] :
( ? [X2: '$ki_world'] :
( b(X2,X1)
& '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ? [X3: '$ki_world'] :
( ? [X4] :
( ! [X5: '$ki_world'] :
( a(X5,X4)
| ~ '$ki_accessible'(X3,X5) )
& '$ki_exists_in_world_$i'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X2: '$ki_world'] :
( b(X2,X1)
& '$ki_accessible'(X0,X2) ) ) )
& ? [X3: '$ki_world'] :
( ? [X4] :
( ! [X5: '$ki_world'] :
( '$ki_accessible'(X3,X5)
=> a(X5,X4) )
& '$ki_exists_in_world_$i'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) )
=> ? [X6: '$ki_world'] :
( ? [X7] :
( ? [X8: '$ki_world'] :
( b(X8,X7)
& a(X8,X7)
& '$ki_accessible'(X6,X8) )
& '$ki_exists_in_world_$i'(X6,X7) )
& '$ki_accessible'('$ki_local_world',X6) ) ),
inference(rectify,[],[f6]) ).
tff(f6,negated_conjecture,
~ ( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X0,X3)
=> ? [X4: '$ki_world'] :
( b(X4,X3)
& '$ki_accessible'(X0,X4) ) ) )
& ? [X0: '$ki_world'] :
( ? [X3] :
( ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> a(X4,X3) )
& '$ki_exists_in_world_$i'(X0,X3) )
& '$ki_accessible'('$ki_local_world',X0) ) )
=> ? [X0: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( b(X4,X3)
& a(X4,X3)
& '$ki_accessible'(X0,X4) )
& '$ki_exists_in_world_$i'(X0,X3) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(negated_conjecture,[],[f5]) ).
tff(f5,conjecture,
( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X0,X3)
=> ? [X4: '$ki_world'] :
( b(X4,X3)
& '$ki_accessible'(X0,X4) ) ) )
& ? [X0: '$ki_world'] :
( ? [X3] :
( ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> a(X4,X3) )
& '$ki_exists_in_world_$i'(X0,X3) )
& '$ki_accessible'('$ki_local_world',X0) ) )
=> ? [X0: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( b(X4,X3)
& a(X4,X3)
& '$ki_accessible'(X0,X4) )
& '$ki_exists_in_world_$i'(X0,X3) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f41,plain,
'$ki_accessible'(sK1,sK0(sK1,sK2)),
inference(unit_resulting_resolution,[],[f24,f23,f26]) ).
tff(f26,plain,
! [X3: '$ki_world',X4: $i] :
( '$ki_accessible'(X3,sK0(X3,X4))
| ~ '$ki_exists_in_world_$i'(X3,X4)
| ~ '$ki_accessible'('$ki_local_world',X3) ),
inference(cnf_transformation,[],[f20]) ).
tff(f23,plain,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f20]) ).
tff(f24,plain,
'$ki_exists_in_world_$i'(sK1,sK2),
inference(cnf_transformation,[],[f20]) ).
tff(f56,plain,
~ a(sK0(sK1,sK2),sK2),
inference(unit_resulting_resolution,[],[f24,f52,f41,f23,f28]) ).
tff(f28,plain,
! [X2: '$ki_world',X0: '$ki_world',X1: $i] :
( ~ b(X2,X1)
| ~ a(X2,X1)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f20]) ).
tff(f52,plain,
b(sK0(sK1,sK2),sK2),
inference(unit_resulting_resolution,[],[f24,f23,f27]) ).
tff(f27,plain,
! [X3: '$ki_world',X4: $i] :
( b(sK0(X3,X4),X4)
| ~ '$ki_exists_in_world_$i'(X3,X4)
| ~ '$ki_accessible'('$ki_local_world',X3) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO889_16 : 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.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 10:28:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_NEQ_NAR problem
% 0.14/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.52/0.73 % (30928)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.52/0.73 % (30932)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.52/0.73 % (30925)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.52/0.73 % (30929)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 (2996ds/34Mi)
% 0.52/0.73 % (30927)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.73 % (30928)First to succeed.
% 0.52/0.73 % (30930)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.52/0.73 % (30931)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.52/0.73 % (30928)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30924"
% 0.52/0.73 % (30932)Also succeeded, but the first one will report.
% 0.52/0.73 % (30927)Also succeeded, but the first one will report.
% 0.52/0.73 % (30925)Also succeeded, but the first one will report.
% 0.52/0.73 % (30928)Refutation found. Thanks to Tanya!
% 0.52/0.73 % SZS status Theorem for theBenchmark
% 0.52/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.73 % (30928)------------------------------
% 0.52/0.73 % (30928)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.73 % (30928)Termination reason: Refutation
% 0.52/0.73
% 0.52/0.73 % (30928)Memory used [KB]: 1046
% 0.52/0.73 % (30928)Time elapsed: 0.003 s
% 0.52/0.73 % (30928)Instructions burned: 4 (million)
% 0.52/0.73 % (30924)Success in time 0.372 s
% 0.52/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------