TSTP Solution File: DAT333_3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% 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 snake_tptp_sat --cores 0 -t %d %s
% Computer : n023.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:20 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% 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 : 103 ( 0 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 54 ( 15 ~; 7 |; 25 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 43 ( 43 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 : 32 (; 23 !; 9 ?; 20 :)
% 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: $i > '$ki_world' ).
tff(func_def_8,type,
sK1: '$ki_world' > $i ).
tff(func_def_9,type,
sK2: '$ki_world' > '$ki_world' ).
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(resolution,[],[f34,f31]) ).
tff(f31,plain,
! [X0: $i] : ~ teach(sK0(X0),john,X0),
inference(subsumption_resolution,[],[f21,f28]) ).
tff(f28,plain,
! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
inference(cnf_transformation,[],[f10]) ).
tff(f10,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(f21,plain,
! [X0: $i] :
( ~ teach(sK0(X0),john,X0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f14]) ).
tff(f14,plain,
! [X0] :
( ( '$ki_accessible'('$ki_local_world',sK0(X0))
& ~ teach(sK0(X0),john,X0) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f13]) ).
tff(f13,plain,
! [X0] :
( ? [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
& ~ teach(X1,john,X0) )
=> ( '$ki_accessible'('$ki_local_world',sK0(X0))
& ~ teach(sK0(X0),john,X0) ) ),
introduced(choice_axiom,[]) ).
tff(f11,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(ennf_transformation,[],[f8]) ).
tff(f8,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(f34,plain,
! [X0: $i] : teach(sK0(X0),john,math),
inference(resolution,[],[f23,f32]) ).
tff(f32,plain,
! [X0: $i] : '$ki_accessible'('$ki_local_world',sK0(X0)),
inference(resolution,[],[f28,f22]) ).
tff(f22,plain,
! [X0: $i] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X0)
| '$ki_accessible'('$ki_local_world',sK0(X0)) ),
inference(cnf_transformation,[],[f14]) ).
tff(f23,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| teach(X0,john,math) ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ( '$ki_exists_in_world_$i'(X0,sK1(X0))
& teach(X0,sK1(X0),cs)
& teach(X0,sue,psych)
& teach(X0,mary,psych)
& teach(X0,john,math) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f12,f15]) ).
tff(f15,plain,
! [X0: '$ki_world'] :
( ? [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
& teach(X0,X1,cs) )
=> ( '$ki_exists_in_world_$i'(X0,sK1(X0))
& teach(X0,sK1(X0),cs) ) ),
introduced(choice_axiom,[]) ).
tff(f12,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| ( ? [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
& teach(X0,X1,cs) )
& teach(X0,sue,psych)
& teach(X0,mary,psych)
& teach(X0,john,math) ) ),
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) )
& teach(X0,sue,psych)
& teach(X0,mary,psych)
& teach(X0,john,math) ) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ? [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
& teach(X0,X2,cs) )
& teach(X0,mary,psych)
& teach(X0,sue,psych)
& teach(X0,john,math) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',db) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT333_3 : TPTP v8.2.0. Released v8.2.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n023.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:23:42 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (20337)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.51 % (20337)First to succeed.
% 0.20/0.51 % (20320)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.51 % (20327)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.51 % (20323)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (20327)Also succeeded, but the first one will report.
% 0.20/0.51 % (20322)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (20337)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 % (20337)------------------------------
% 0.20/0.51 % (20337)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (20337)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (20337)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (20337)Memory used [KB]: 5373
% 0.20/0.51 % (20337)Time elapsed: 0.051 s
% 0.20/0.51 % (20337)Instructions burned: 1 (million)
% 0.20/0.51 % (20337)------------------------------
% 0.20/0.51 % (20337)------------------------------
% 0.20/0.51 % (20306)Success in time 0.158 s
%------------------------------------------------------------------------------