TSTP Solution File: PLA002-2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.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 : Wed Aug 31 18:09:15 EDT 2022
% Result : Unsatisfiable 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of formulae : 54 ( 5 unt; 0 def)
% Number of atoms : 154 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 221 ( 121 ~; 96 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 49 ( 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f103,plain,
$false,
inference(avatar_sat_refutation,[],[f33,f37,f75,f102]) ).
fof(f102,plain,
~ spl1_3,
inference(avatar_contradiction_clause,[],[f101]) ).
fof(f101,plain,
( $false
| ~ spl1_3 ),
inference(resolution,[],[f99,f16]) ).
fof(f16,axiom,
situation(s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_situation) ).
fof(f99,plain,
( ~ situation(s0)
| ~ spl1_3 ),
inference(resolution,[],[f93,f22]) ).
fof(f22,axiom,
at(f,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial) ).
fof(f93,plain,
( ! [X0] :
( ~ at(f,X0)
| ~ situation(X0) )
| ~ spl1_3 ),
inference(duplicate_literal_removal,[],[f92]) ).
fof(f92,plain,
( ! [X0] :
( ~ situation(X0)
| ~ situation(X0)
| ~ at(f,X0) )
| ~ spl1_3 ),
inference(resolution,[],[f87,f21]) ).
fof(f21,axiom,
! [X2,X3] :
( situation(go(X3,X2))
| ~ situation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_situation) ).
fof(f87,plain,
( ! [X0] :
( ~ situation(go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) )
| ~ spl1_3 ),
inference(resolution,[],[f85,f15]) ).
fof(f15,axiom,
! [X2] :
( at(d,go(d,X2))
| ~ at(f,X2)
| ~ situation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_f_to_d) ).
fof(f85,plain,
( ! [X0] :
( ~ at(d,X0)
| ~ situation(X0) )
| ~ spl1_3 ),
inference(duplicate_literal_removal,[],[f82]) ).
fof(f82,plain,
( ! [X0] :
( ~ situation(X0)
| ~ situation(X0)
| ~ at(d,X0) )
| ~ spl1_3 ),
inference(resolution,[],[f80,f63]) ).
fof(f63,plain,
! [X0] :
( ~ cold(go(c,X0))
| ~ situation(X0)
| ~ at(d,X0) ),
inference(duplicate_literal_removal,[],[f62]) ).
fof(f62,plain,
! [X0] :
( ~ situation(X0)
| ~ situation(X0)
| ~ at(d,X0)
| ~ cold(go(c,X0)) ),
inference(resolution,[],[f52,f21]) ).
fof(f52,plain,
! [X1] :
( ~ situation(go(c,X1))
| ~ situation(X1)
| ~ cold(go(c,X1))
| ~ at(d,X1) ),
inference(resolution,[],[f50,f11]) ).
fof(f11,axiom,
! [X2] :
( at(c,go(c,X2))
| ~ at(d,X2)
| ~ situation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_d_to_c) ).
fof(f50,plain,
! [X0] :
( ~ at(c,X0)
| ~ cold(X0)
| ~ situation(X0) ),
inference(duplicate_literal_removal,[],[f49]) ).
fof(f49,plain,
! [X0] :
( ~ at(c,X0)
| ~ situation(X0)
| ~ cold(X0)
| ~ situation(X0) ),
inference(resolution,[],[f48,f20]) ).
fof(f20,axiom,
! [X2,X3] :
( situation(skate(X3,X2))
| ~ situation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',skate_situation) ).
fof(f48,plain,
! [X0] :
( ~ situation(skate(b,X0))
| ~ at(c,X0)
| ~ cold(X0)
| ~ situation(X0) ),
inference(resolution,[],[f7,f46]) ).
fof(f46,plain,
! [X0] :
( ~ at(b,X0)
| ~ situation(X0) ),
inference(duplicate_literal_removal,[],[f45]) ).
fof(f45,plain,
! [X0] :
( ~ situation(X0)
| ~ situation(X0)
| ~ at(b,X0) ),
inference(resolution,[],[f44,f17]) ).
fof(f17,axiom,
! [X2,X3] :
( situation(walk(X3,X2))
| ~ situation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_situation) ).
fof(f44,plain,
! [X0] :
( ~ situation(walk(a,X0))
| ~ at(b,X0)
| ~ situation(X0) ),
inference(resolution,[],[f4,f23]) ).
fof(f23,axiom,
! [X4] :
( ~ at(a,X4)
| ~ situation(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a_in_a_situation) ).
fof(f4,axiom,
! [X2] :
( at(a,walk(a,X2))
| ~ at(b,X2)
| ~ situation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_b_to_a) ).
fof(f7,axiom,
! [X2] :
( at(b,skate(b,X2))
| ~ situation(X2)
| ~ at(c,X2)
| ~ cold(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_river_c_to_b) ).
fof(f80,plain,
( ! [X8,X9] :
( cold(go(X8,X9))
| ~ situation(X9) )
| ~ spl1_3 ),
inference(resolution,[],[f36,f21]) ).
fof(f36,plain,
( ! [X1] :
( ~ situation(X1)
| cold(X1) )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl1_3
<=> ! [X1] :
( ~ situation(X1)
| cold(X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
fof(f75,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f74]) ).
fof(f74,plain,
( $false
| ~ spl1_2 ),
inference(resolution,[],[f70,f16]) ).
fof(f70,plain,
( ~ situation(s0)
| ~ spl1_2 ),
inference(resolution,[],[f69,f22]) ).
fof(f69,plain,
( ! [X0] :
( ~ at(f,X0)
| ~ situation(X0) )
| ~ spl1_2 ),
inference(duplicate_literal_removal,[],[f68]) ).
fof(f68,plain,
( ! [X0] :
( ~ situation(X0)
| ~ at(f,X0)
| ~ situation(X0) )
| ~ spl1_2 ),
inference(resolution,[],[f65,f43]) ).
fof(f43,plain,
( ! [X0,X1] :
( warm(go(X1,X0))
| ~ situation(X0) )
| ~ spl1_2 ),
inference(resolution,[],[f21,f32]) ).
fof(f32,plain,
( ! [X0] :
( ~ situation(X0)
| warm(X0) )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f31,plain,
( spl1_2
<=> ! [X0] :
( warm(X0)
| ~ situation(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f65,plain,
! [X0] :
( ~ warm(go(d,X0))
| ~ situation(X0)
| ~ at(f,X0) ),
inference(duplicate_literal_removal,[],[f64]) ).
fof(f64,plain,
! [X0] :
( ~ at(f,X0)
| ~ situation(X0)
| ~ situation(X0)
| ~ warm(go(d,X0)) ),
inference(resolution,[],[f57,f21]) ).
fof(f57,plain,
! [X0] :
( ~ situation(go(d,X0))
| ~ situation(X0)
| ~ at(f,X0)
| ~ warm(go(d,X0)) ),
inference(resolution,[],[f56,f15]) ).
fof(f56,plain,
! [X0] :
( ~ at(d,X0)
| ~ warm(X0)
| ~ situation(X0) ),
inference(duplicate_literal_removal,[],[f55]) ).
fof(f55,plain,
! [X0] :
( ~ situation(X0)
| ~ situation(X0)
| ~ warm(X0)
| ~ at(d,X0) ),
inference(resolution,[],[f54,f19]) ).
fof(f19,axiom,
! [X2,X3] :
( situation(climb(X3,X2))
| ~ situation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_situation) ).
fof(f54,plain,
! [X0] :
( ~ situation(climb(b,X0))
| ~ warm(X0)
| ~ situation(X0)
| ~ at(d,X0) ),
inference(resolution,[],[f9,f46]) ).
fof(f9,axiom,
! [X2] :
( at(b,climb(b,X2))
| ~ warm(X2)
| ~ at(d,X2)
| ~ situation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).
fof(f37,plain,
( ~ spl1_1
| spl1_3 ),
inference(avatar_split_clause,[],[f25,f35,f27]) ).
fof(f27,plain,
( spl1_1
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f25,plain,
! [X1] :
( ~ situation(X1)
| cold(X1)
| ~ sP0 ),
inference(general_splitting,[],[f1,f24_D]) ).
fof(f24,plain,
! [X0] :
( warm(X0)
| sP0
| ~ situation(X0) ),
inference(cnf_transformation,[],[f24_D]) ).
fof(f24_D,plain,
( ! [X0] :
( warm(X0)
| ~ situation(X0) )
<=> ~ sP0 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP0])]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ situation(X1)
| warm(X0)
| ~ situation(X0)
| cold(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',warm_or_cold) ).
fof(f33,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f24,f31,f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n023.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.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 10:24:35 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.50 % (13524)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.50 % (13530)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.51 % (13530)First to succeed.
% 0.21/0.51 % (13530)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (13530)------------------------------
% 0.21/0.51 % (13530)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (13530)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (13530)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (13530)Memory used [KB]: 5500
% 0.21/0.51 % (13530)Time elapsed: 0.110 s
% 0.21/0.51 % (13530)Instructions burned: 2 (million)
% 0.21/0.51 % (13530)------------------------------
% 0.21/0.51 % (13530)------------------------------
% 0.21/0.51 % (13519)Success in time 0.157 s
%------------------------------------------------------------------------------