%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n013.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:27:40 PM UTC 2026
% Result : Unsatisfiable 0.18s 1.51s
% Output : Refutation 0.18s
% 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 : 161 ( 89 ~; 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(f40,plain,
! [X0] :
( ~ at(c,X0)
| ~ cold(X0)
| ~ situation(X0)
| ~ situation(skate(b,X0)) ),
inference(resolution,[],[f7,f38]) ).
fof(f41,plain,
! [X0] :
( ~ at(c,X0)
| ~ cold(X0)
| ~ situation(X0) ),
inference(forward_subsumption_resolution,[],[f40,f20]) ).
fof(f43,plain,
! [X0] :
( ~ cold(go(c,X0))
| ~ situation(go(c,X0))
| ~ at(d,X0)
| ~ situation(X0) ),
inference(resolution,[],[f41,f11]) ).
fof(f45,plain,
! [X0] :
( ~ cold(go(c,X0))
| ~ at(d,X0)
| ~ situation(X0) ),
inference(forward_subsumption_resolution,[],[f43,f21]) ).
fof(f47,plain,
! [X0] :
( ~ at(d,X0)
| ~ warm(X0)
| ~ situation(X0)
| ~ situation(climb(b,X0)) ),
inference(resolution,[],[f9,f38]) ).
fof(f48,plain,
( ! [X0] :
( ~ at(d,X0)
| ~ situation(X0)
| ~ situation(climb(b,X0)) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f47,f29]) ).
fof(f49,plain,
( ! [X0] :
( ~ at(d,X0)
| ~ situation(X0) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f48,f19]) ).
fof(f50,plain,
( ! [X0] :
( ~ situation(go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) )
| ~ spl0_2 ),
inference(resolution,[],[f49,f15]) ).
fof(f54,plain,
( ! [X0] :
( ~ at(f,X0)
| ~ situation(X0) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f50,f21]) ).
fof(f59,plain,
( ~ situation(s0)
| ~ spl0_2 ),
inference(resolution,[],[f54,f22]) ).
fof(f61,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f59,f16]) ).
fof(f62,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f61]) ).
fof(f68,plain,
( ! [X0,X1] :
( cold(go(X0,X1))
| ~ situation(X1) )
| ~ spl0_1 ),
inference(resolution,[],[f26,f21]) ).
fof(f76,plain,
( ! [X0] :
( ~ situation(X0)
| ~ at(d,X0)
| ~ situation(X0) )
| ~ spl0_1 ),
inference(resolution,[],[f68,f45]) ).
fof(f77,plain,
( ! [X0] :
( ~ at(d,X0)
| ~ situation(X0) )
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f76]) ).
fof(f79,plain,
( ! [X0] :
( ~ situation(go(d,X0))
| ~ at(f,X0)
| ~ situation(X0) )
| ~ spl0_1 ),
inference(resolution,[],[f77,f15]) ).
fof(f83,plain,
( ! [X0] :
( ~ at(f,X0)
| ~ situation(X0) )
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f79,f21]) ).
fof(f88,plain,
( ~ situation(s0)
| ~ spl0_1 ),
inference(resolution,[],[f83,f22]) ).
fof(f90,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f88,f16]) ).
fof(f91,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f90]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f30]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f62]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f91]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f92,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.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 % Computer : n013.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Sun Sep 27 22:08:37 UTC 2026
% 0.12/0.41 % CPUTime :
% 0.12/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/0.44 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/1.51 % (601223)Input is clausal, will run a generic CNF schedule.
% 0.18/1.51 % (601234)dis-21_1_sil=8000:lcm=predicate:random_seed=2576137135:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 0.18/1.51 % (601234)Instruction limit reached!
% 0.18/1.51 % (601234)------------------------------
% 0.18/1.51 % (601234)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.51 % (601234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.51 % (601234)CaDiCaL version: 2.1.3
% 0.18/1.51 % (601234)Termination reason: Instruction limit
% 0.18/1.51 % (601234)Termination phase: Saturation
% 0.18/1.51 % (601234)Time elapsed: 0.033 s
% 0.18/1.51 % (601234)Peak memory usage: 90 MB
% 0.18/1.51 % (601234)Instructions burned: 121 (million)
% 0.18/1.51 % (601228)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1961472369:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.18/1.51 % (601231)lrs+10_1_sil=8000:sp=occurrence:random_seed=1420631835:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.18/1.51 % (601232)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4166603240:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.18/1.51 % (601230)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1358413511:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.18/1.51 % (601229)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2437646246:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.18/1.51 % (601233)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1601856095:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.18/1.51 % (601232)Also succeeded, but the first one will report.
% 0.18/1.51 % (601231)First to succeed.
% 0.18/1.51 % (601233)Also succeeded, but the first one will report.
% 0.18/1.51 % (601231)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-601223"
% 0.18/1.51 % (601236)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=39523290:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 0.18/1.51 % (601236)Also succeeded, but the first one will report.
% 0.18/1.51 % (601231)Refutation found. Thanks to Tanya!
% 0.18/1.51 % SZS status Unsatisfiable for theBenchmark
% 0.18/1.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.51 % (601231)------------------------------
% 0.18/1.51 % (601231)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.51 % (601231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.51 % (601231)CaDiCaL version: 2.1.3
% 0.18/1.51 % (601231)Termination reason: Refutation
% 0.18/1.51 % (601231)Time elapsed: 0.003 s
% 0.18/1.51 % (601231)Peak memory usage: 89 MB
% 0.18/1.51 % (601231)Instructions burned: 3 (million)
% 0.18/1.51 % (601231)------------------------------
% 0.18/1.51 % (601231)------------------------------
% 0.18/1.51 % (601223)Success in time 0.434 s
% 0.18/1.51 % Vampire exiting
%------------------------------------------------------------------------------