TSTP Solution File: SYO896_7 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO896_7 : 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 : n017.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:35 EDT 2024
% Result : Theorem 0.57s 0.74s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 21 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 93 ( 36 ~; 21 |; 20 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 24 ( 17 !; 7 ?; 24 :)
% 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(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(f15,plain,
$false,
inference(subsumption_resolution,[],[f14,f12]) ).
tff(f12,plain,
p(sK0),
inference(cnf_transformation,[],[f8]) ).
tff(f8,plain,
( p(sK0)
& '$ki_accessible'('$ki_local_world',sK0)
& ! [X1: '$ki_world'] :
( ~ q(X1)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X2: '$ki_world'] :
( q(X2)
| ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
tff(f7,plain,
( ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) )
=> ( p(sK0)
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f6,plain,
( ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( ~ q(X1)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X2: '$ki_world'] :
( q(X2)
| ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f5]) ).
tff(f5,plain,
( ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( ~ q(X0)
| ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(flattening,[],[f4]) ).
tff(f4,plain,
( ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'('$ki_local_world',X2) )
& ! [X0: '$ki_world'] :
( ~ q(X0)
| ~ p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
=> ~ q(X0) ) )
& ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( p(X1)
=> q(X1) ) ) )
=> ~ ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'('$ki_local_world',X2) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
=> ~ q(X0) ) )
& ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
=> q(X0) ) ) )
=> ~ ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
=> ~ q(X0) ) )
& ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
=> q(X0) ) ) )
=> ~ ? [X0: '$ki_world'] :
( p(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f14,plain,
~ p(sK0),
inference(resolution,[],[f13,f11]) ).
tff(f11,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f8]) ).
tff(f13,plain,
! [X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| ~ p(X2) ),
inference(subsumption_resolution,[],[f9,f10]) ).
tff(f10,plain,
! [X1: '$ki_world'] :
( ~ q(X1)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cnf_transformation,[],[f8]) ).
tff(f9,plain,
! [X2: '$ki_world'] :
( q(X2)
| ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO896_7 : TPTP v8.2.0. Released v8.2.0.
% 0.14/0.14 % 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.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 10:30:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TF0_THM_NEQ_NAR problem
% 0.15/0.36 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.57/0.74 % (31916)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.57/0.74 % (31917)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.57/0.74 % (31918)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.74 % (31919)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.74 % (31916)First to succeed.
% 0.57/0.74 % (31917)Also succeeded, but the first one will report.
% 0.57/0.74 % (31919)Also succeeded, but the first one will report.
% 0.57/0.74 % (31912)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.74 % (31918)Also succeeded, but the first one will report.
% 0.57/0.74 % (31916)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31911"
% 0.57/0.74 % (31913)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.74 % (31916)Refutation found. Thanks to Tanya!
% 0.57/0.74 % SZS status Theorem for theBenchmark
% 0.57/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.74 % (31916)------------------------------
% 0.57/0.74 % (31916)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (31916)Termination reason: Refutation
% 0.57/0.74
% 0.57/0.74 % (31916)Memory used [KB]: 970
% 0.57/0.74 % (31916)Time elapsed: 0.002 s
% 0.57/0.74 % (31916)Instructions burned: 2 (million)
% 0.57/0.74 % (31911)Success in time 0.379 s
% 0.57/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------