TSTP Solution File: SYO902_8 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYO902_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 : n018.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.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 22 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 61 ( 17 ~; 12 |; 24 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 36 (; 18 !; 18 ?; 36 :)
% 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(func_def_2,type,
sK1: '$ki_world' > '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
p: '$ki_world' > $o ).
tff(f18,plain,
$false,
inference(unit_resulting_resolution,[],[f14,f10,f15,f9]) ).
tff(f9,plain,
! [X3: '$ki_world',X4: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ~ '$ki_accessible'(X3,X4)
| ~ p(X4) ),
inference(cnf_transformation,[],[f8]) ).
tff(f8,plain,
( ! [X1: '$ki_world'] :
( ( '$ki_accessible'(X1,sK1(X1))
& p(sK1(X1)) )
| ~ '$ki_accessible'(sK0,X1) )
& '$ki_accessible'('$ki_local_world',sK0)
& ! [X3: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ! [X4: '$ki_world'] :
( ~ '$ki_accessible'(X3,X4)
| ~ p(X4) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f7,f6]) ).
tff(f6,plain,
( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) )
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) )
| ~ '$ki_accessible'(sK0,X1) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f7,plain,
! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) )
=> ( '$ki_accessible'(X1,sK1(X1))
& p(sK1(X1)) ) ),
introduced(choice_axiom,[]) ).
tff(f5,plain,
( ? [X0: '$ki_world'] :
( ! [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) )
| ~ '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
& ! [X3: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ! [X4: '$ki_world'] :
( ~ '$ki_accessible'(X3,X4)
| ~ p(X4) ) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f4,plain,
~ ( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) ) ) )
=> ? [X3: '$ki_world'] :
( ? [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
& p(X4) )
& '$ki_accessible'('$ki_local_world',X3) ) ),
inference(rectify,[],[f3]) ).
tff(f3,negated_conjecture,
~ ( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) ) ) )
=> ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f2,conjecture,
( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ! [X1: '$ki_world'] :
( '$ki_accessible'(X0,X1)
=> ? [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
& p(X2) ) ) )
=> ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f15,plain,
'$ki_accessible'(sK0,sK1(sK0)),
inference(resolution,[],[f12,f13]) ).
tff(f13,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/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f12,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X1)
| '$ki_accessible'(X1,sK1(X1)) ),
inference(cnf_transformation,[],[f8]) ).
tff(f10,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f8]) ).
tff(f14,plain,
p(sK1(sK0)),
inference(resolution,[],[f11,f13]) ).
tff(f11,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(sK0,X1)
| p(sK1(X1)) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYO902_8 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n018.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:21:46 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.20/0.47 % (17101)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.47 % (17101)First to succeed.
% 0.20/0.48 % (17093)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.48 % (17101)Refutation found. Thanks to Tanya!
% 0.20/0.48 % SZS status Theorem for theBenchmark
% 0.20/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.48 % (17101)------------------------------
% 0.20/0.48 % (17101)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (17101)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (17101)Termination reason: Refutation
% 0.20/0.48
% 0.20/0.48 % (17101)Memory used [KB]: 1407
% 0.20/0.48 % (17101)Time elapsed: 0.048 s
% 0.20/0.48 % (17101)Instructions burned: 2 (million)
% 0.20/0.48 % (17101)------------------------------
% 0.20/0.48 % (17101)------------------------------
% 0.20/0.48 % (17077)Success in time 0.14 s
%------------------------------------------------------------------------------