TSTP Solution File: DAT334_19 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT334_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 snake_tptp_uns --cores 0 -t %d %s
% Computer : n031.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.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 27 ( 5 unt; 8 typ; 0 def)
% Number of atoms : 101 ( 0 equ)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 58 ( 17 ~; 9 |; 25 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 41 ( 41 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 9 ( 5 >; 4 *; 0 +; 0 <<)
% Number of predicates : 10 ( 9 usr; 7 prp; 0-3 aty)
% Number of functors : 4 ( 4 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' ).
tff(func_def_8,type,
sK1: '$ki_world' > $i ).
tff(func_def_9,type,
sK2: '$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(f39,plain,
$false,
inference(subsumption_resolution,[],[f37,f33]) ).
tff(f33,plain,
teach(sK0,sK2(sK0),cs),
inference(unit_resulting_resolution,[],[f21,f28]) ).
tff(f28,plain,
! [X0: '$ki_world'] :
( teach(X0,sK2(X0),cs)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ( teach(X0,sue,psych)
& teach(X0,sK2(X0),cs)
& '$ki_exists_in_world_$i'(X0,sK2(X0))
& teach(X0,mary,psych)
& teach(X0,john,math) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f13,f19]) ).
tff(f19,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(f13,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ( teach(X0,sue,psych)
& ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
& teach(X0,mary,psych)
& teach(X0,john,math) ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( teach(X0,sue,psych)
& ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
& teach(X0,mary,psych)
& teach(X0,john,math) ) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( teach(X0,mary,psych)
& teach(X0,sue,psych)
& teach(X0,john,math)
& ? [X2] :
( teach(X0,X2,cs)
& '$ki_exists_in_world_$i'(X0,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',db) ).
tff(f21,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
( ! [X1] :
( ~ teach(sK0,X1,cs)
| ~ '$ki_exists_in_world_$i'(sK0,X1) )
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f14]) ).
tff(f14,plain,
( ? [X0: '$ki_world'] :
( ! [X1] :
( ~ teach(X0,X1,cs)
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X1] :
( ~ teach(sK0,X1,cs)
| ~ '$ki_exists_in_world_$i'(sK0,X1) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f12,plain,
? [X0: '$ki_world'] :
( ! [X1] :
( ~ teach(X0,X1,cs)
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
& teach(X0,X1,cs) ) ),
inference(rectify,[],[f5]) ).
tff(f5,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,[],[f4]) ).
tff(f4,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(f37,plain,
~ teach(sK0,sK2(sK0),cs),
inference(unit_resulting_resolution,[],[f31,f22]) ).
tff(f22,plain,
! [X1: $i] :
( ~ teach(sK0,X1,cs)
| ~ '$ki_exists_in_world_$i'(sK0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tff(f31,plain,
'$ki_exists_in_world_$i'(sK0,sK2(sK0)),
inference(unit_resulting_resolution,[],[f21,f27]) ).
tff(f27,plain,
! [X0: '$ki_world'] :
( '$ki_exists_in_world_$i'(X0,sK2(X0))
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT334_19 : TPTP v8.2.0. Released v8.2.0.
% 0.03/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.13/0.34 % Computer : n031.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 22 11:29:59 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (10402)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.50 % (10401)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (10401)First to succeed.
% 0.20/0.50 % (10399)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.50 % (10399)Also succeeded, but the first one will report.
% 0.20/0.50 % (10401)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (10401)------------------------------
% 0.20/0.50 % (10401)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (10401)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (10401)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (10401)Memory used [KB]: 5884
% 0.20/0.50 % (10401)Time elapsed: 0.100 s
% 0.20/0.50 % (10401)Instructions burned: 1 (million)
% 0.20/0.50 % (10401)------------------------------
% 0.20/0.50 % (10401)------------------------------
% 0.20/0.50 % (10395)Success in time 0.152 s
%------------------------------------------------------------------------------