TSTP Solution File: DAT334_21 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT334_21 : 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 snake_tptp_uns --cores 0 -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 : Mon May 22 15:24:19 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 28 ( 4 unt; 9 typ; 0 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 62 ( 20 ~; 10 |; 25 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 39 ( 39 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 10 ( 9 usr; 7 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 24 (; 15 !; 9 ?; 13 :)
% 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' ).
tff(func_def_9,type,
sK2: '$ki_world' > $i ).
tff(func_def_10,type,
sK3: '$ki_world' > $i ).
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(f36,plain,
$false,
inference(subsumption_resolution,[],[f35,f26]) ).
tff(f26,plain,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
( '$ki_accessible'('$ki_local_world',sK1)
& ! [X1] :
( ~ '$ki_exists_in_world_$i'(sK1,X1)
| ~ teach(sK1,X1,cs) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f13,f17]) ).
tff(f17,plain,
( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ! [X1] :
( ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ teach(X0,X1,cs) ) )
=> ( '$ki_accessible'('$ki_local_world',sK1)
& ! [X1] :
( ~ '$ki_exists_in_world_$i'(sK1,X1)
| ~ teach(sK1,X1,cs) ) ) ),
introduced(choice_axiom,[]) ).
tff(f13,plain,
? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ! [X1] :
( ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ teach(X0,X1,cs) ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
& teach(X0,X1,cs) ) ),
inference(rectify,[],[f6]) ).
tff(f6,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
& teach(X0,X2,cs) ) ),
inference(negated_conjecture,[],[f5]) ).
tff(f5,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
& teach(X0,X2,cs) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f35,plain,
~ '$ki_accessible'('$ki_local_world',sK1),
inference(resolution,[],[f34,f31]) ).
tff(f31,plain,
! [X0: '$ki_world'] :
( '$ki_exists_in_world_$i'(X0,sK3(X0))
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: '$ki_world'] :
( ( teach(X0,sK3(X0),cs)
& '$ki_exists_in_world_$i'(X0,sK3(X0))
& teach(X0,sue,psych)
& teach(X0,john,math)
& teach(X0,mary,psych) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f14,f21]) ).
tff(f21,plain,
! [X0: '$ki_world'] :
( ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
=> ( teach(X0,sK3(X0),cs)
& '$ki_exists_in_world_$i'(X0,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f14,plain,
! [X0: '$ki_world'] :
( ( ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
& teach(X0,sue,psych)
& teach(X0,john,math)
& teach(X0,mary,psych) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f10]) ).
tff(f10,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
& teach(X0,sue,psych)
& teach(X0,john,math)
& teach(X0,mary,psych) ) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ? [X2] :
( teach(X0,X2,cs)
& '$ki_exists_in_world_$i'(X0,X2) )
& teach(X0,john,math)
& teach(X0,mary,psych)
& teach(X0,sue,psych) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',db) ).
tff(f34,plain,
~ '$ki_exists_in_world_$i'(sK1,sK3(sK1)),
inference(subsumption_resolution,[],[f33,f26]) ).
tff(f33,plain,
( ~ '$ki_exists_in_world_$i'(sK1,sK3(sK1))
| ~ '$ki_accessible'('$ki_local_world',sK1) ),
inference(resolution,[],[f25,f32]) ).
tff(f32,plain,
! [X0: '$ki_world'] :
( teach(X0,sK3(X0),cs)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f22]) ).
tff(f25,plain,
! [X1: $i] :
( ~ teach(sK1,X1,cs)
| ~ '$ki_exists_in_world_$i'(sK1,X1) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : DAT334_21 : TPTP v8.2.0. Released v8.2.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 22 11:02:17 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.49 % (29178)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.49 % (29177)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.50 % (29187)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.50 % (29193)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50 % (29178)First to succeed.
% 0.20/0.51 % (29201)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (29178)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (29178)------------------------------
% 0.20/0.51 % (29178)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (29178)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (29178)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (29178)Memory used [KB]: 5884
% 0.20/0.51 % (29178)Time elapsed: 0.104 s
% 0.20/0.51 % (29178)Instructions burned: 2 (million)
% 0.20/0.51 % (29178)------------------------------
% 0.20/0.51 % (29178)------------------------------
% 0.20/0.51 % (29176)Success in time 0.166 s
%------------------------------------------------------------------------------