TSTP Solution File: LCL954_19 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL954_19 : 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 : n024.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 00:24:10 EDT 2024
% Result : Theorem 0.68s 0.88s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 26 ( 4 unt; 12 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 59 ( 18 ~; 7 |; 20 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 20 ( 8 >; 12 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 26 ( 16 !; 10 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_29,type,
sK0: '$ki_world' ).
tff(func_def_30,type,
sK1: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
customqmltpeq: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_3,type,
true: '$ki_world' > $o ).
tff(pred_def_4,type,
geq: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_5,type,
lt: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_6,type,
leq: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_7,type,
gt: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_8,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f163,plain,
$false,
inference(subsumption_resolution,[],[f162,f158]) ).
tff(f158,plain,
~ true(sK1),
inference(cnf_transformation,[],[f154]) ).
tff(f154,plain,
( ~ true(sK1)
& '$ki_accessible'(sK0,sK1)
& ! [X2: '$ki_world'] :
( true(X2)
| ~ '$ki_accessible'(sK0,X2) )
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f151,f153,f152]) ).
tff(f152,plain,
( ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ true(X1)
& '$ki_accessible'(X0,X1) )
& ! [X2: '$ki_world'] :
( true(X2)
| ~ '$ki_accessible'(X0,X2) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ? [X1: '$ki_world'] :
( ~ true(X1)
& '$ki_accessible'(sK0,X1) )
& ! [X2: '$ki_world'] :
( true(X2)
| ~ '$ki_accessible'(sK0,X2) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f153,plain,
( ? [X1: '$ki_world'] :
( ~ true(X1)
& '$ki_accessible'(sK0,X1) )
=> ( ~ true(sK1)
& '$ki_accessible'(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f151,plain,
? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( ~ true(X1)
& '$ki_accessible'(X0,X1) )
& ! [X2: '$ki_world'] :
( true(X2)
| ~ '$ki_accessible'(X0,X2) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(rectify,[],[f147]) ).
tff(f147,plain,
? [X0: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ true(X2)
& '$ki_accessible'(X0,X2) )
& ! [X1: '$ki_world'] :
( true(X1)
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f146]) ).
tff(f146,plain,
? [X0: '$ki_world'] :
( ? [X2: '$ki_world'] :
( ~ true(X2)
& '$ki_accessible'(X0,X2) )
& ! [X1: '$ki_world'] :
( true(X1)
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f139]) ).
tff(f139,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> true(X1) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> true(X2) ) ) ),
inference(rectify,[],[f138]) ).
tff(f138,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> true(X4) )
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> true(X4) ) ) ),
inference(negated_conjecture,[],[f137]) ).
tff(f137,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> true(X4) )
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> true(X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f162,plain,
true(sK1),
inference(resolution,[],[f156,f157]) ).
tff(f157,plain,
'$ki_accessible'(sK0,sK1),
inference(cnf_transformation,[],[f154]) ).
tff(f156,plain,
! [X2: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X2)
| true(X2) ),
inference(cnf_transformation,[],[f154]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL954_19 : TPTP v8.2.0. Released v8.2.0.
% 0.07/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 : n024.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 03:31:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TF0_THM_NEQ_NAR problem
% 0.13/0.34 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.87 % (10693)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.87 % (10692)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.87 % (10691)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.87 % (10694)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.87 % (10690)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.87 % (10695)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.87 % (10697)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.88 % (10695)Also succeeded, but the first one will report.
% 0.68/0.88 % (10693)Also succeeded, but the first one will report.
% 0.68/0.88 % (10690)First to succeed.
% 0.68/0.88 % (10697)Also succeeded, but the first one will report.
% 0.68/0.88 % (10690)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10689"
% 0.68/0.88 % (10696)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.88 % (10692)Also succeeded, but the first one will report.
% 0.68/0.88 % (10690)Refutation found. Thanks to Tanya!
% 0.68/0.88 % SZS status Theorem for theBenchmark
% 0.68/0.88 % SZS output start Proof for theBenchmark
% See solution above
% 0.68/0.88 % (10690)------------------------------
% 0.68/0.88 % (10690)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.88 % (10690)Termination reason: Refutation
% 0.68/0.88
% 0.68/0.88 % (10690)Memory used [KB]: 1282
% 0.68/0.88 % (10690)Time elapsed: 0.005 s
% 0.68/0.88 % (10690)Instructions burned: 4 (million)
% 0.68/0.88 % (10689)Success in time 0.534 s
% 0.68/0.88 % Vampire---4.8 exiting
%------------------------------------------------------------------------------