TSTP Solution File: DAT333_3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : DAT333_3 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n016.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 : Sun May 5 05:06:24 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 31 ( 7 unt; 10 typ; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 54 ( 17 ~; 8 |; 23 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 40 ( 40 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 12 ( 8 >; 4 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 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,
sK1: $i > '$ki_world' ).
tff(func_def_8,type,
sK2: '$ki_world' > $i ).
tff(func_def_9,type,
sK3: '$ki_world' > '$ki_world' ).
tff(func_def_10,type,
sK4: '$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(pred_def_4,type,
sP0: '$ki_world' > $o ).
tff(f40,plain,
$false,
inference(subsumption_resolution,[],[f39,f36]) ).
tff(f36,plain,
! [X0: $i] : '$ki_accessible'('$ki_local_world',sK1(X0)),
inference(subsumption_resolution,[],[f24,f34]) ).
tff(f34,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/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(f24,plain,
! [X0: $i] :
( '$ki_accessible'('$ki_local_world',sK1(X0))
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
! [X0] :
( ( ~ teach(sK1(X0),john,X0)
& '$ki_accessible'('$ki_local_world',sK1(X0)) )
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f11,f15]) ).
tff(f15,plain,
! [X0] :
( ? [X1: '$ki_world'] :
( ~ teach(X1,john,X0)
& '$ki_accessible'('$ki_local_world',X1) )
=> ( ~ teach(sK1(X0),john,X0)
& '$ki_accessible'('$ki_local_world',sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f11,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,[],[f7]) ).
tff(f7,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/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f39,plain,
~ '$ki_accessible'('$ki_local_world',sK1(math)),
inference(resolution,[],[f38,f28]) ).
tff(f28,plain,
! [X0: '$ki_world'] :
( teach(X0,john,math)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f14]) ).
tff(f14,plain,
! [X0: '$ki_world'] :
( ( teach(X0,sue,psych)
& teach(X0,mary,psych)
& sP0(X0)
& teach(X0,john,math) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(definition_folding,[],[f12,f13]) ).
tff(f13,plain,
! [X0: '$ki_world'] :
( ? [X1] :
( teach(X0,X1,cs)
& '$ki_exists_in_world_$i'(X0,X1) )
| ~ sP0(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f12,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,[],[f8]) ).
tff(f8,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/sandbox2/benchmark/theBenchmark.p',db) ).
tff(f38,plain,
! [X0: $i] : ~ teach(sK1(X0),john,X0),
inference(subsumption_resolution,[],[f25,f34]) ).
tff(f25,plain,
! [X0: $i] :
( ~ teach(sK1(X0),john,X0)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT333_3 : TPTP v8.2.0. Released v8.2.0.
% 0.11/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 13:35:31 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (29791)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (29797)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.38 % (29797)First to succeed.
% 0.14/0.38 % (29797)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29791"
% 0.14/0.38 % (29797)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (29797)------------------------------
% 0.14/0.38 % (29797)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38 % (29797)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (29797)Memory used [KB]: 736
% 0.14/0.38 % (29797)Time elapsed: 0.004 s
% 0.14/0.38 % (29797)Instructions burned: 3 (million)
% 0.14/0.38 % (29791)Success in time 0.022 s
%------------------------------------------------------------------------------