TSTP Solution File: NLP267_5 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n017.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:56 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 33 ( 9 unt; 7 typ; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 50 ( 22 ~; 16 |; 5 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 32 ( 32 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 27 (; 25 !; 2 ?; 27 :)
% 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(f43,plain,
$false,
inference(resolution,[],[f40,f25]) ).
tff(f25,plain,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f23]) ).
tff(f23,plain,
( '$ki_accessible'('$ki_local_world',sK0)
& ~ price(sK0,seventy) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f15,f22]) ).
tff(f22,plain,
( ? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ~ price(X0,seventy) )
=> ( '$ki_accessible'('$ki_local_world',sK0)
& ~ price(sK0,seventy) ) ),
introduced(choice_axiom,[]) ).
tff(f15,plain,
? [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
& ~ price(X0,seventy) ),
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/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f40,plain,
! [X0: '$ki_world'] : price(X0,seventy),
inference(subsumption_resolution,[],[f39,f36]) ).
tff(f36,plain,
! [X0: '$ki_world'] : dest(X0,paris),
inference(subsumption_resolution,[],[f29,f27]) ).
tff(f27,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
inference(cnf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
inference(rectify,[],[f10]) ).
tff(f10,plain,
! [X1: '$ki_world',X0: '$ki_world'] : '$ki_accessible'(X1,X0),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X1: '$ki_world',X0: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
tff(f29,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| dest(X0,paris) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> dest(X0,paris) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief1) ).
tff(f39,plain,
! [X0: '$ki_world'] :
( ~ dest(X0,paris)
| price(X0,seventy) ),
inference(subsumption_resolution,[],[f38,f27]) ).
tff(f38,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ '$ki_accessible'('$ki_local_world',X0)
| ~ dest(X0,paris) ),
inference(subsumption_resolution,[],[f28,f37]) ).
tff(f37,plain,
! [X0: '$ki_world'] : class(X0,second),
inference(subsumption_resolution,[],[f31,f27]) ).
tff(f31,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f12]) ).
tff(f12,plain,
! [X0: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X0)
| class(X0,second) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> class(X0,second) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief2) ).
tff(f28,plain,
! [X0: '$ki_world'] :
( ~ class(X0,second)
| ~ dest(X0,paris)
| price(X0,seventy)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
! [X0: '$ki_world'] :
( ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0)
| price(X0,seventy) ),
inference(flattening,[],[f20]) ).
tff(f20,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ dest(X0,paris)
| ~ class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ( dest(X0,paris)
& class(X0,second) )
=> price(X0,seventy) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',law2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : NLP267_5 : TPTP v8.2.0. Released v8.2.0.
% 0.02/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 : n017.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 11:38:33 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.49 % (19253)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.50 % (19275)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.50 % (19265)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.50 % (19268)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.50 % (19279)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.50 % (19268)First to succeed.
% 0.19/0.50 % (19260)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (19274)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.50 % (19274)Also succeeded, but the first one will report.
% 0.19/0.50 % (19255)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.50 % (19268)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (19268)------------------------------
% 0.19/0.50 % (19268)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (19268)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (19268)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (19268)Memory used [KB]: 895
% 0.19/0.50 % (19268)Time elapsed: 0.105 s
% 0.19/0.50 % (19268)------------------------------
% 0.19/0.50 % (19268)------------------------------
% 0.19/0.50 % (19252)Success in time 0.164 s
%------------------------------------------------------------------------------