TSTP Solution File: SYO899_8 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYO899_8 : 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 : n021.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:45:49 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 31 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 107 ( 39 ~; 30 |; 20 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 37 (; 27 !; 10 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_1,type,
sK0: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
p: '$ki_world' > $o ).
tff(pred_def_3,type,
q: '$ki_world' > $o ).
tff(f33,plain,
$false,
inference(avatar_sat_refutation,[],[f22,f27,f32]) ).
tff(f32,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f31]) ).
tff(f31,plain,
( $false
| ~ spl1_2 ),
inference(subsumption_resolution,[],[f30,f23]) ).
tff(f23,plain,
~ q(sK0),
inference(resolution,[],[f10,f11]) ).
tff(f11,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
( ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ( ~ p(sK0)
| ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'(sK0,X2) ) )
& '$ki_accessible'('$ki_local_world',sK0)
& ! [X3: '$ki_world'] :
( ~ q(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
tff(f8,plain,
( ? [X1: '$ki_world'] :
( ( ~ p(X1)
| ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X1) )
=> ( ( ~ p(sK0)
| ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'(sK0,X2) ) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f7,plain,
( ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ? [X1: '$ki_world'] :
( ( ~ p(X1)
| ! [X2: '$ki_world'] :
( q(X2)
| ~ '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X1) )
& ! [X3: '$ki_world'] :
( ~ q(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ) ),
inference(rectify,[],[f6]) ).
tff(f6,plain,
( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
& ? [X0: '$ki_world'] :
( ( ~ p(X0)
| ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
& ! [X3: '$ki_world'] :
( ~ q(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) ) ),
inference(flattening,[],[f5]) ).
tff(f5,plain,
( ! [X3: '$ki_world'] :
( ~ q(X3)
| ~ '$ki_accessible'('$ki_local_world',X3) )
& ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('$ki_local_world',X2) )
& ? [X0: '$ki_world'] :
( ( ~ p(X0)
| ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'(X0,X1) ) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ? [X0: '$ki_world'] :
( ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> p(X2) )
=> ? [X3: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X3)
& q(X3) ) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ? [X0: '$ki_world'] :
( ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( q(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ? [X0: '$ki_world'] :
( ( p(X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> q(X1) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) )
=> ? [X0: '$ki_world'] :
( q(X0)
& '$ki_accessible'('$ki_local_world',X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f10,plain,
! [X3: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ~ q(X3) ),
inference(cnf_transformation,[],[f9]) ).
tff(f30,plain,
( q(sK0)
| ~ spl1_2 ),
inference(resolution,[],[f14,f21]) ).
tff(f21,plain,
( ! [X2: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X2)
| q(X2) )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f20]) ).
tff(f20,plain,
( spl1_2
<=> ! [X2: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X2)
| q(X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
tff(f14,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f27,plain,
spl1_1,
inference(avatar_split_clause,[],[f24,f16]) ).
tff(f16,plain,
( spl1_1
<=> p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
tff(f24,plain,
p(sK0),
inference(resolution,[],[f13,f11]) ).
tff(f13,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| p(X0) ),
inference(cnf_transformation,[],[f9]) ).
tff(f22,plain,
( ~ spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f12,f20,f16]) ).
tff(f12,plain,
! [X2: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X2)
| q(X2)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO899_8 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.14 % 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.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 22 13:12:45 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (15319)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.50 % (15335)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.51 % (15327)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.51 % (15319)First to succeed.
% 0.20/0.51 % (15319)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 % (15319)------------------------------
% 0.20/0.51 % (15319)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (15319)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (15319)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (15319)Memory used [KB]: 5884
% 0.20/0.51 % (15319)Time elapsed: 0.102 s
% 0.20/0.51 % (15319)Instructions burned: 2 (million)
% 0.20/0.51 % (15319)------------------------------
% 0.20/0.51 % (15319)------------------------------
% 0.20/0.51 % (15310)Success in time 0.155 s
%------------------------------------------------------------------------------