TSTP Solution File: SYO895_9 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYO895_9 : 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:45:52 EDT 2023
% Result : Theorem 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 29 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 84 ( 29 ~; 20 |; 20 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 23 (; 19 !; 4 ?; 23 :)
% 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' > '$ki_world' ).
tff(func_def_2,type,
sK1: '$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,[],[f25,f28,f32]) ).
tff(f32,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f31]) ).
tff(f31,plain,
( $false
| spl2_1 ),
inference(subsumption_resolution,[],[f29,f20]) ).
tff(f20,plain,
( ~ p(sK1)
| spl2_1 ),
inference(avatar_component_clause,[],[f18]) ).
tff(f18,plain,
( spl2_1
<=> p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f29,plain,
p(sK1),
inference(resolution,[],[f16,f14]) ).
tff(f14,plain,
'$ki_accessible'('$ki_local_world',sK1),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
( ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& '$ki_accessible'('$ki_local_world',sK1)
& ( ~ p(sK1)
| ~ q(sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f9,f10]) ).
tff(f10,plain,
( ? [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
& ( ~ p(X2)
| ~ q(X2) ) )
=> ( '$ki_accessible'('$ki_local_world',sK1)
& ( ~ p(sK1)
| ~ q(sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
( ! [X0: '$ki_world'] :
( p(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ? [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
& ( ~ p(X2)
| ~ q(X2) ) ) ),
inference(rectify,[],[f6]) ).
tff(f6,plain,
( ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) )
& ! [X0: '$ki_world'] :
( q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ? [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
& ( ~ p(X2)
| ~ q(X2) ) ) ),
inference(flattening,[],[f5]) ).
tff(f5,plain,
( ? [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
& ( ~ p(X2)
| ~ q(X2) ) )
& ! [X0: '$ki_world'] :
( q(X0)
| ~ '$ki_accessible'('$ki_local_world',X0) )
& ! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> q(X0) )
& ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> p(X1) ) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X2)
=> ( q(X2)
& p(X2) ) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> q(X0) )
& ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( q(X0)
& p(X0) ) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> q(X0) )
& ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> p(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( q(X0)
& p(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f16,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| p(X0) ),
inference(cnf_transformation,[],[f11]) ).
tff(f28,plain,
spl2_2,
inference(avatar_split_clause,[],[f26,f22]) ).
tff(f22,plain,
( spl2_2
<=> q(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f26,plain,
q(sK1),
inference(resolution,[],[f15,f14]) ).
tff(f15,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| q(X1) ),
inference(cnf_transformation,[],[f11]) ).
tff(f25,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f13,f22,f18]) ).
tff(f13,plain,
( ~ q(sK1)
| ~ p(sK1) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYO895_9 : TPTP v8.2.0. Released v8.2.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 22 13:29:57 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 % (13110)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.18/0.45 % (13110)First to succeed.
% 0.18/0.46 % (13110)Refutation found. Thanks to Tanya!
% 0.18/0.46 % SZS status Theorem for theBenchmark
% 0.18/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46 % (13110)------------------------------
% 0.18/0.46 % (13110)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.46 % (13110)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.46 % (13110)Termination reason: Refutation
% 0.18/0.46
% 0.18/0.46 % (13110)Memory used [KB]: 5373
% 0.18/0.46 % (13110)Time elapsed: 0.065 s
% 0.18/0.46 % (13110)Instructions burned: 2 (million)
% 0.18/0.46 % (13110)------------------------------
% 0.18/0.46 % (13110)------------------------------
% 0.18/0.46 % (13102)Success in time 0.117 s
%------------------------------------------------------------------------------