TSTP Solution File: DAT333_3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT333_3 : 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 : Mon May 20 19:50:42 EDT 2024
% Result : Theorem 0.62s 0.81s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 55 ( 16 ~; 7 |; 25 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 42 ( 42 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 10 ( 9 usr; 7 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 31 ( 22 !; 9 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_7,type,
sK0: '$ki_world' > '$ki_world' ).
tff(func_def_8,type,
sK1: '$ki_world' > $i ).
tff(func_def_9,type,
sK2: '$ki_world' > $i ).
tff(func_def_10,type,
sK3: $i > '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
teach: ( '$ki_world' * $i * $i ) > $o ).
tff(pred_def_3,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(f39,plain,
$false,
inference(subsumption_resolution,[],[f38,f32]) ).
tff(f32,plain,
! [X0: $i] : '$ki_accessible'('$ki_local_world',sK3(X0)),
inference(subsumption_resolution,[],[f29,f22]) ).
tff(f22,plain,
! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
inference(cnf_transformation,[],[f7]) ).
tff(f7,plain,
! [X0: '$ki_world',X1] : '$ki_exists_in_world_$i'(X0,X1),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X0: '$ki_world',X2] : '$ki_exists_in_world_$i'(X0,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(f29,plain,
! [X0: $i] :
( '$ki_accessible'('$ki_local_world',sK3(X0))
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
! [X0] :
( ( ~ teach(sK3(X0),john,X0)
& '$ki_accessible'('$ki_local_world',sK3(X0)) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f12,f19]) ).
tff(f19,plain,
! [X0] :
( ? [X1: '$ki_world'] :
( ~ teach(X1,john,X0)
& '$ki_accessible'('$ki_local_world',X1) )
=> ( ~ teach(sK3(X0),john,X0)
& '$ki_accessible'('$ki_local_world',sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f12,plain,
! [X0] :
( ? [X1: '$ki_world'] :
( ~ teach(X1,john,X0)
& '$ki_accessible'('$ki_local_world',X1) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f10]) ).
tff(f10,plain,
~ ? [X0] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> teach(X1,john,X0) )
& '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(rectify,[],[f6]) ).
tff(f6,negated_conjecture,
~ ? [X2] :
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> teach(X0,john,X2) )
& '$ki_exists_in_world_$i'('$ki_local_world',X2) ),
inference(negated_conjecture,[],[f5]) ).
tff(f5,conjecture,
? [X2] :
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> teach(X0,john,X2) )
& '$ki_exists_in_world_$i'('$ki_local_world',X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f38,plain,
~ '$ki_accessible'('$ki_local_world',sK3(math)),
inference(resolution,[],[f31,f24]) ).
tff(f24,plain,
! [X0: '$ki_world'] :
( teach(X0,john,math)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
! [X0: '$ki_world'] :
( ( teach(X0,sue,psych)
& teach(X0,mary,psych)
& teach(X0,sK2(X0),cs)
& '$ki_exists_in_world_$i'(X0,sK2(X0))
& teach(X0,john,math) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f11,f17]) ).
tff(f17,plain,
! [X0: '$ki_world'] :
( ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
=> ( teach(X0,sK2(X0),cs)
& '$ki_exists_in_world_$i'(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
! [X0: '$ki_world'] :
( ( teach(X0,sue,psych)
& teach(X0,mary,psych)
& ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
& teach(X0,john,math) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f9]) ).
tff(f9,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( teach(X0,sue,psych)
& teach(X0,mary,psych)
& ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
& teach(X0,john,math) ) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( teach(X0,sue,psych)
& teach(X0,mary,psych)
& ? [X2] :
( teach(X0,X2,cs)
& '$ki_exists_in_world_$i'(X0,X2) )
& teach(X0,john,math) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',db) ).
tff(f31,plain,
! [X0: $i] : ~ teach(sK3(X0),john,X0),
inference(subsumption_resolution,[],[f30,f22]) ).
tff(f30,plain,
! [X0: $i] :
( ~ teach(sK3(X0),john,X0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : DAT333_3 : TPTP v8.2.0. Released v8.2.0.
% 0.08/0.17 % 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.17/0.39 % Computer : n022.cluster.edu
% 0.17/0.39 % Model : x86_64 x86_64
% 0.17/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39 % Memory : 8042.1875MB
% 0.17/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.39 % CPULimit : 300
% 0.17/0.39 % WCLimit : 300
% 0.17/0.39 % DateTime : Sun May 19 23:33:38 EDT 2024
% 0.17/0.39 % CPUTime :
% 0.17/0.39 This is a TF0_THM_NEQ_NAR problem
% 0.17/0.40 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.62/0.80 % (397)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.62/0.80 % (398)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.62/0.80 % (399)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 (2995ds/34Mi)
% 0.62/0.80 % (401)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 (2995ds/83Mi)
% 0.62/0.80 % (402)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 (2995ds/56Mi)
% 0.62/0.81 % (402)Refutation not found, incomplete strategy% (402)------------------------------
% 0.62/0.81 % (402)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (398)Refutation not found, incomplete strategy% (398)------------------------------
% 0.62/0.81 % (398)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (401)Refutation not found, incomplete strategy% (401)------------------------------
% 0.62/0.81 % (401)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (401)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81 % (398)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81 % (401)Memory used [KB]: 944
% 0.62/0.81 % (398)Memory used [KB]: 944
% 0.62/0.81 % (398)Time elapsed: 0.002 s
% 0.62/0.81 % (401)Time elapsed: 0.002 s
% 0.62/0.81 % (401)Instructions burned: 2 (million)
% 0.62/0.81 % (398)Instructions burned: 2 (million)
% 0.62/0.81 % (402)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.81
% 0.62/0.81 % (395)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 (2995ds/34Mi)
% 0.62/0.81 % (402)Memory used [KB]: 944
% 0.62/0.81 % (402)Time elapsed: 0.002 s
% 0.62/0.81 % (402)Instructions burned: 2 (million)
% 0.62/0.81 % (399)First to succeed.
% 0.62/0.81 % (402)------------------------------
% 0.62/0.81 % (402)------------------------------
% 0.62/0.81 % (398)------------------------------
% 0.62/0.81 % (398)------------------------------
% 0.62/0.81 % (401)------------------------------
% 0.62/0.81 % (401)------------------------------
% 0.62/0.81 % (397)Also succeeded, but the first one will report.
% 0.62/0.81 % (399)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-394"
% 0.62/0.81 % (396)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 (2995ds/51Mi)
% 0.62/0.81 % (399)Refutation found. Thanks to Tanya!
% 0.62/0.81 % SZS status Theorem for theBenchmark
% 0.62/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.81 % (399)------------------------------
% 0.62/0.81 % (399)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (399)Termination reason: Refutation
% 0.62/0.81
% 0.62/0.81 % (399)Memory used [KB]: 962
% 0.62/0.81 % (399)Time elapsed: 0.003 s
% 0.62/0.81 % (399)Instructions burned: 3 (million)
% 0.62/0.81 % (394)Success in time 0.405 s
% 0.62/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------