TSTP Solution File: SYO900_11 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO900_11 : 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 : n008.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:37 EDT 2024
% Result : Theorem 0.57s 0.73s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 26 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 10 ( 6 avg)
% Number of connectives : 120 ( 32 ~; 16 |; 44 &)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 56 ( 36 !; 20 ?; 56 :)
% 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' ).
tff(func_def_3,type,
sK2: '$ki_world' ).
tff(func_def_4,type,
sK3: '$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(f23,plain,
$false,
inference(subsumption_resolution,[],[f16,f22]) ).
tff(f22,plain,
! [X2: '$ki_world'] : q(X2),
inference(subsumption_resolution,[],[f18,f21]) ).
tff(f21,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
tff(f18,plain,
! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'(sK0,X2) ),
inference(cnf_transformation,[],[f12]) ).
tff(f12,plain,
( ~ p(sK1)
& '$ki_accessible'(sK0,sK1)
& ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'(sK0,X2) )
& '$ki_accessible'('$ki_local_world',sK0)
& ~ q(sK3)
& '$ki_accessible'(sK2,sK3)
& ! [X5: '$ki_world'] :
( p(X5)
| ~ '$ki_accessible'(sK2,X5) )
& '$ki_accessible'('$ki_local_world',sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f11,f10,f9,f8]) ).
tff(f8,plain,
( ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ p(X1)
& '$ki_accessible'(X0,X1) )
& ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'(X0,X2) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ? [X1: '$ki_world'] :
( ~ p(X1)
& '$ki_accessible'(sK0,X1) )
& ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'(sK0,X2) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
( ? [X1: '$ki_world'] :
( ~ p(X1)
& '$ki_accessible'(sK0,X1) )
=> ( ~ p(sK1)
& '$ki_accessible'(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f10,plain,
( ? [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( ~ q(X4)
& '$ki_accessible'(X3,X4) )
& ! [X5: '$ki_world'] :
( p(X5)
| ~ '$ki_accessible'(X3,X5) )
& '$ki_accessible'('$ki_local_world',X3) )
=> ( ? [X4: '$ki_world'] :
( ~ q(X4)
& '$ki_accessible'(sK2,X4) )
& ! [X5: '$ki_world'] :
( p(X5)
| ~ '$ki_accessible'(sK2,X5) )
& '$ki_accessible'('$ki_local_world',sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
( ? [X4: '$ki_world'] :
( ~ q(X4)
& '$ki_accessible'(sK2,X4) )
=> ( ~ q(sK3)
& '$ki_accessible'(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f7,plain,
( ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ p(X1)
& '$ki_accessible'(X0,X1) )
& ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'(X0,X2) )
& '$ki_accessible'('$ki_local_world',X0) )
& ? [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( ~ q(X4)
& '$ki_accessible'(X3,X4) )
& ! [X5: '$ki_world'] :
( p(X5)
| ~ '$ki_accessible'(X3,X5) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(rectify,[],[f6]) ).
tff(f6,plain,
( ? [X0: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X0,X2) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
& ? [X3: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ q(X5)
& '$ki_accessible'(X3,X5) )
& ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(flattening,[],[f5]) ).
tff(f5,plain,
( ? [X0: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X0,X2) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
& ? [X3: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ q(X5)
& '$ki_accessible'(X3,X5) )
& ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(X3,X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> p(X2) ) ) )
| ! [X3: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X3)
=> ( ! [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
=> p(X4) )
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X3,X5)
=> q(X5) ) ) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> q(X2) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> p(X2) ) ) )
| ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> p(X2) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> q(X2) ) ) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> q(X2) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> p(X2) ) ) )
| ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> p(X2) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> q(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f16,plain,
~ q(sK3),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYO900_11 : TPTP v8.2.0. Released v8.2.0.
% 0.10/0.13 % 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.13/0.34 % Computer : n008.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:56:53 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.57/0.73 % (1220)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.73 % (1221)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.73 % (1219)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.73 % (1225)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.73 % (1218)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.73 % (1224)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 % (1219)Also succeeded, but the first one will report.
% 0.57/0.73 % (1225)First to succeed.
% 0.57/0.73 % (1220)Also succeeded, but the first one will report.
% 0.57/0.73 % (1221)Also succeeded, but the first one will report.
% 0.57/0.73 % (1224)Also succeeded, but the first one will report.
% 0.57/0.73 % (1218)Also succeeded, but the first one will report.
% 0.57/0.73 % (1225)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1217"
% 0.57/0.73 % (1225)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 % (1225)------------------------------
% 0.57/0.73 % (1225)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.73 % (1225)Termination reason: Refutation
% 0.57/0.73
% 0.57/0.73 % (1225)Memory used [KB]: 956
% 0.57/0.73 % (1225)Time elapsed: 0.003 s
% 0.57/0.73 % (1225)Instructions burned: 3 (million)
% 0.57/0.73 % (1217)Success in time 0.381 s
% 0.57/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------