TSTP Solution File: NLP267_5 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NLP267_5 : 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 : n020.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:39:55 EDT 2023
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 43 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 66 ( 28 ~; 23 |; 5 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 33 ( 33 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 19 (; 17 !; 2 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_6,type,
sK0: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
price: ( '$ki_world' * $i ) > $o ).
tff(pred_def_3,type,
dest: ( '$ki_world' * $i ) > $o ).
tff(pred_def_4,type,
class: ( '$ki_world' * $i ) > $o ).
tff(f61,plain,
$false,
inference(avatar_sat_refutation,[],[f50,f54,f58,f60]) ).
tff(f60,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f59]) ).
tff(f59,plain,
( $false
| ~ spl1_1 ),
inference(resolution,[],[f41,f25]) ).
tff(f25,plain,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
( ~ price(sK0,seventy)
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f21]) ).
tff(f21,plain,
( ? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ~ price(sK0,seventy)
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f14,plain,
? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f9]) ).
tff(f9,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> price(X0,seventy) ),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> price(X0,seventy) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f41,plain,
( price(sK0,seventy)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f39]) ).
tff(f39,plain,
( spl1_1
<=> price(sK0,seventy) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
tff(f58,plain,
spl1_3,
inference(avatar_contradiction_clause,[],[f56]) ).
tff(f56,plain,
( $false
| spl1_3 ),
inference(resolution,[],[f49,f27]) ).
tff(f27,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_universal) ).
tff(f49,plain,
( ~ '$ki_accessible'('$ki_local_world',sK0)
| spl1_3 ),
inference(avatar_component_clause,[],[f47]) ).
tff(f47,plain,
( spl1_3
<=> '$ki_accessible'('$ki_local_world',sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
tff(f54,plain,
spl1_2,
inference(avatar_contradiction_clause,[],[f52]) ).
tff(f52,plain,
( $false
| spl1_2 ),
inference(resolution,[],[f45,f33]) ).
tff(f33,plain,
! [X0: '$ki_world'] : dest(X0,paris),
inference(resolution,[],[f26,f27]) ).
tff(f26,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| dest(X0,paris) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> dest(X0,paris) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief1) ).
tff(f45,plain,
( ~ dest(sK0,paris)
| spl1_2 ),
inference(avatar_component_clause,[],[f43]) ).
tff(f43,plain,
( spl1_2
<=> dest(sK0,paris) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
tff(f50,plain,
( spl1_1
| ~ spl1_2
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f36,f47,f43,f39]) ).
tff(f36,plain,
( ~ '$ki_accessible'('$ki_local_world',sK0)
| ~ dest(sK0,paris)
| price(sK0,seventy) ),
inference(resolution,[],[f29,f34]) ).
tff(f34,plain,
class(sK0,second),
inference(resolution,[],[f31,f24]) ).
tff(f24,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f22]) ).
tff(f31,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| class(X0,second) ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> class(X0,second) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief2) ).
tff(f29,plain,
! [X0: '$ki_world'] :
( ~ class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0)
| price(X0,seventy)
| ~ dest(X0,paris) ),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris) ),
inference(flattening,[],[f12]) ).
tff(f12,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ( class(X0,second)
& dest(X0,paris) )
=> price(X0,seventy) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',law2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NLP267_5 : 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_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % 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 : Mon May 22 12:11:16 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.50 % (30171)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.50 % (30191)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.50 % (30191)First to succeed.
% 0.20/0.50 % (30180)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50 % (30180)Also succeeded, but the first one will report.
% 0.20/0.50 % (30191)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (30191)------------------------------
% 0.20/0.50 % (30191)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (30191)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (30191)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (30191)Memory used [KB]: 5884
% 0.20/0.50 % (30191)Time elapsed: 0.055 s
% 0.20/0.50 % (30191)Instructions burned: 2 (million)
% 0.20/0.50 % (30191)------------------------------
% 0.20/0.50 % (30191)------------------------------
% 0.20/0.50 % (30167)Success in time 0.15 s
%------------------------------------------------------------------------------