%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PLA002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:28:33 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.44s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of formulae : 45 ( 8 unt; 2 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 160 ( 88 ~; 70 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( warm(X0)
| cold(X1)
| ~ situation(X0)
| ~ situation(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',warm_or_cold) ).
fof(f4,axiom,
! [X0] :
( at(a,walk(a,X0))
| ~ at(b,X0)
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_b_to_a) ).
fof(f7,axiom,
! [X0] :
( at(b,skate(b,X0))
| ~ at(c,X0)
| ~ cold(X0)
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_river_c_to_b) ).
fof(f9,axiom,
! [X0] :
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ warm(X0)
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).
fof(f11,axiom,
! [X0] :
( at(c,go(c,X0))
| ~ at(d,X0)
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_d_to_c) ).
fof(f15,axiom,
! [X0] :
( at(d,go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_f_to_d) ).
fof(f16,axiom,
situation(s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_situation) ).
fof(f17,axiom,
! [X0,X1] :
( situation(walk(X1,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_situation) ).
fof(f19,axiom,
! [X0,X1] :
( situation(climb(X1,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_situation) ).
fof(f20,axiom,
! [X0,X1] :
( situation(skate(X1,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',skate_situation) ).
fof(f21,axiom,
! [X0,X1] :
( situation(go(X1,X0))
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_situation) ).
fof(f22,axiom,
at(f,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial) ).
fof(f23,negated_conjecture,
! [X0] :
( ~ at(a,X0)
| ~ situation(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a_in_a_situation) ).
fof(f25,definition,
( spl0_1
<=> ! [X1] :
( cold(X1)
| ~ situation(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f26,plain,
( ! [X1] :
( ~ situation(X1)
| cold(X1) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f28,definition,
( spl0_2
<=> ! [X0] :
( warm(X0)
| ~ situation(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f29,plain,
( ! [X0] :
( ~ situation(X0)
| warm(X0) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f30,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f1,f28,f25]) ).
fof(f37,plain,
! [X0] :
( ~ at(b,X0)
| ~ situation(X0)
| ~ situation(walk(a,X0)) ),
inference(resolution,[],[f4,f23]) ).
fof(f38,plain,
! [X0] :
( ~ at(b,X0)
| ~ situation(X0) ),
inference(forward_subsumption_resolution,[],[f37,f17]) ).
fof(f39,plain,
! [X0] :
( ~ at(c,X0)
| ~ cold(X0)
| ~ situation(X0)
| ~ situation(skate(b,X0)) ),
inference(resolution,[],[f7,f38]) ).
fof(f40,plain,
! [X0] :
( ~ at(c,X0)
| ~ cold(X0)
| ~ situation(X0) ),
inference(forward_subsumption_resolution,[],[f39,f20]) ).
fof(f42,plain,
! [X0] :
( ~ cold(go(c,X0))
| ~ situation(go(c,X0))
| ~ at(d,X0)
| ~ situation(X0) ),
inference(resolution,[],[f40,f11]) ).
fof(f43,plain,
! [X0] :
( ~ cold(go(c,X0))
| ~ at(d,X0)
| ~ situation(X0) ),
inference(forward_subsumption_resolution,[],[f42,f21]) ).
fof(f45,plain,
( ! [X0] :
( at(b,climb(b,X0))
| ~ at(d,X0)
| ~ situation(X0) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f9,f29]) ).
fof(f46,plain,
( ! [X0] :
( ~ at(d,X0)
| ~ situation(X0)
| ~ situation(climb(b,X0)) )
| ~ spl0_2 ),
inference(resolution,[],[f45,f38]) ).
fof(f47,plain,
( ! [X0] :
( ~ at(d,X0)
| ~ situation(X0) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f46,f19]) ).
fof(f48,plain,
( ! [X0] :
( ~ situation(go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) )
| ~ spl0_2 ),
inference(resolution,[],[f47,f15]) ).
fof(f51,plain,
( ! [X0] :
( ~ at(f,X0)
| ~ situation(X0) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f48,f21]) ).
fof(f55,plain,
( ~ situation(s0)
| ~ spl0_2 ),
inference(resolution,[],[f51,f22]) ).
fof(f57,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f55,f16]) ).
fof(f58,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f57]) ).
fof(f63,plain,
( ! [X0,X1] :
( cold(go(X0,X1))
| ~ situation(X1) )
| ~ spl0_1 ),
inference(resolution,[],[f26,f21]) ).
fof(f72,plain,
( ! [X0] :
( ~ situation(X0)
| ~ at(d,X0)
| ~ situation(X0) )
| ~ spl0_1 ),
inference(resolution,[],[f63,f43]) ).
fof(f73,plain,
( ! [X0] :
( ~ at(d,X0)
| ~ situation(X0) )
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f72]) ).
fof(f75,plain,
( ! [X0] :
( ~ situation(go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) )
| ~ spl0_1 ),
inference(resolution,[],[f73,f15]) ).
fof(f78,plain,
( ! [X0] :
( ~ at(f,X0)
| ~ situation(X0) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f75,f21]) ).
fof(f83,plain,
( ~ situation(s0)
| ~ spl0_1 ),
inference(resolution,[],[f78,f22]) ).
fof(f85,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f83,f16]) ).
fof(f86,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f85]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f30]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f58]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f86]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f87,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PLA002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n018.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 22:11:24 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.44 % (2781240)Will run a generic schedule for satisfiability detection.
% 0.09/0.44 % (2781253)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1738679684:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.44 % (2781249)% WARNING: option uhcvi not known.
% 0.09/0.44 % (2781251)dis+10_1_sil=32000:sp=arity:random_seed=2319148251:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.44 % (2781248)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1822750057_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.44 % (2781252)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1944870489:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.44 % (2781254)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=158326512:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.44 % (2781250)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1747869207:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.44 % (2781249)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=467042088:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.44 % TRYING [1]
% 0.09/0.44 % (2781251) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2781240-2781251"...
% 0.09/0.44 % TRYING [2]
% 0.09/0.44 % TRYING [3]
% 0.09/0.44 % (2781251)...printing done.
% 0.09/0.44 % (2781249) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2781240-2781249"...
% 0.09/0.44 % (2781251)Refutation found. Thanks to Tanya!
% 0.09/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.44 % (2781251)------------------------------
% 0.09/0.44 % (2781251)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.44 % (2781251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.44 % (2781251)CaDiCaL version: 2.1.3
% 0.09/0.44 % (2781251)Termination reason: Refutation
% 0.09/0.44 % (2781251)Time elapsed: 0.003 s
% 0.09/0.44 % (2781251)Peak memory usage: 12 MB
% 0.09/0.44 % (2781251)Instructions burned: 3 (million)
% 0.09/0.44 % (2781240)Success in time 0.026 s
% 0.09/0.44 % Vampire exiting
%------------------------------------------------------------------------------