%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PUZ141^1 : TPTP v9.3.1. Released v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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 : Wed Sep 30 08:21:16 AM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 25 unt; 0 typ; 0 def)
% Number of atoms : 105 ( 54 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 202 ( 14 ~; 12 |; 0 &; 168 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 34 ( 0 ^; 32 !; 2 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
position: $tType ).
thf(type_def_6,type,
direction: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_8,type,
movelist: $tType ).
thf(func_def_0,type,
left: direction ).
thf(func_def_1,type,
right: direction ).
thf(func_def_2,type,
top: direction ).
thf(func_def_3,type,
bottom: direction ).
thf(func_def_4,type,
next: position > direction > position ).
thf(func_def_6,type,
wall: position > $o ).
thf(func_def_7,type,
nomove: movelist ).
thf(func_def_8,type,
movedir: movelist > direction > movelist ).
thf(func_def_9,type,
playerpos: movelist > position ).
thf(func_def_10,type,
c00: position ).
thf(func_def_11,type,
c10: position ).
thf(func_def_12,type,
c20: position ).
thf(f4,axiom,
! [X0: position,X1: movelist,X2: direction] :
( ( ( playerpos @ X1 )
= X0 )
=> ( ~ ( wall @ ( next @ X0 @ X2 ) )
=> ( ( playerpos @ ( movedir @ X1 @ X2 ) )
= ( next @ X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',player_move_legal) ).
thf(f6,axiom,
( c10
= ( next @ c00 @ right ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10_defin) ).
thf(f7,axiom,
( c20
= ( next @ c10 @ right ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c20_defin) ).
thf(f9,axiom,
( ( wall @ c10 )
= $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10_axiom) ).
thf(f10,axiom,
( ( wall @ c20 )
= $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c20_axiom) ).
thf(f11,axiom,
( ( playerpos @ nomove )
= c00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',start_axiom) ).
thf(f12,conjecture,
? [X0: movelist] :
( ( playerpos @ X0 )
= c20 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exercise) ).
thf(f13,negated_conjecture,
~ ? [X0: movelist] :
( ( playerpos @ X0 )
= c20 ),
inference(negated_conjecture,[status(cth)],[f12]) ).
thf(f14,plain,
! [X0: position,X1: movelist,X2: direction] :
( ( ( playerpos @ X1 )
= X0 )
=> ( ~ ( wall @ ( next @ X0 @ X2 ) )
=> ( ( playerpos @ ( movedir @ X1 @ X2 ) )
= ( next @ X0 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f15,plain,
! [X0: position,X1: movelist,X2: direction] :
( ( ( playerpos @ X1 )
= X0 )
=> ( ( ( wall @ ( next @ X0 @ X2 ) )
!= $true )
=> ( ( next @ X0 @ X2 )
= ( playerpos @ ( movedir @ X1 @ X2 ) ) ) ) ),
inference(fool_elimination,[],[f14]) ).
thf(f19,plain,
( ( wall @ c10 )
= $false ),
inference(fool_elimination,[],[f9]) ).
thf(f20,plain,
( ( wall @ c20 )
= $false ),
inference(fool_elimination,[],[f10]) ).
thf(f21,plain,
! [X0: position,X1: movelist,X2: direction] :
( ( ( playerpos @ X1 )
= X0 )
=> ( ( ( wall @ ( next @ X0 @ X2 ) )
!= $true )
=> ( ( next @ X0 @ X2 )
= ( playerpos @ ( movedir @ X1 @ X2 ) ) ) ) ),
inference(flattening,[],[f15]) ).
thf(f22,plain,
! [X0: position,X1: movelist,X2: direction] :
( ( ( next @ X0 @ X2 )
= ( playerpos @ ( movedir @ X1 @ X2 ) ) )
| ( ( wall @ ( next @ X0 @ X2 ) )
= $true )
| ( ( playerpos @ X1 )
!= X0 ) ),
inference(ennf_transformation,[],[f21]) ).
thf(f23,plain,
! [X0: position,X1: movelist,X2: direction] :
( ( ( next @ X0 @ X2 )
= ( playerpos @ ( movedir @ X1 @ X2 ) ) )
| ( ( wall @ ( next @ X0 @ X2 ) )
= $true )
| ( ( playerpos @ X1 )
!= X0 ) ),
inference(flattening,[],[f22]) ).
thf(f26,plain,
! [X0: movelist] :
( c20
!= ( playerpos @ X0 ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f30,plain,
! [X2: direction,X0: position,X1: movelist] :
( ( ( playerpos @ X1 )
!= X0 )
| ( ( wall @ ( next @ X0 @ X2 ) )
= $true )
| ( ( next @ X0 @ X2 )
= ( playerpos @ ( movedir @ X1 @ X2 ) ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f32,plain,
( c10
= ( next @ c00 @ right ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f33,plain,
( c20
= ( next @ c10 @ right ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f35,plain,
( ( wall @ c10 )
= $false ),
inference(cnf_transformation,[],[f19]) ).
thf(f36,plain,
( ( wall @ c20 )
= $false ),
inference(cnf_transformation,[],[f20]) ).
thf(f37,plain,
( c00
= ( playerpos @ nomove ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f38,plain,
! [X0: movelist] :
( c20
!= ( playerpos @ X0 ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f42,plain,
( c10
= ( next @ ( playerpos @ nomove ) @ right ) ),
inference(forward_demodulation,[],[f32,f37]) ).
thf(f56,plain,
( $false
= ( wall @ ( next @ c10 @ right ) ) ),
inference(constrained_superposition,[],[f36,f33]) ).
thf(f57,plain,
! [X0: movelist] :
( ( next @ c10 @ right )
!= ( playerpos @ X0 ) ),
inference(constrained_superposition,[],[f38,f33]) ).
thf(f58,plain,
! [X0: movelist] :
( ( playerpos @ X0 )
!= ( next @ ( next @ ( playerpos @ nomove ) @ right ) @ right ) ),
inference(forward_demodulation,[],[f57,f42]) ).
thf(f59,plain,
( $false
= ( wall @ ( next @ ( next @ ( playerpos @ nomove ) @ right ) @ right ) ) ),
inference(forward_demodulation,[],[f56,f42]) ).
thf(f60,plain,
( $false
= ( wall @ ( next @ ( playerpos @ nomove ) @ right ) ) ),
inference(constrained_superposition,[],[f35,f42]) ).
thf(f86,plain,
! [X0: movelist,X1: direction] :
( ( ( playerpos @ ( movedir @ X0 @ X1 ) )
= ( next @ ( playerpos @ X0 ) @ X1 ) )
| ( $true
= ( wall @ ( next @ ( playerpos @ X0 ) @ X1 ) ) ) ),
inference(equality_resolution,[],[f30]) ).
thf(f134,plain,
! [X0: movelist,X1: direction] :
( ( ( next @ ( next @ ( playerpos @ nomove ) @ right ) @ right )
!= ( next @ ( playerpos @ X0 ) @ X1 ) )
| ( $true
= ( wall @ ( next @ ( playerpos @ X0 ) @ X1 ) ) ) ),
inference(constrained_superposition,[],[f58,f86]) ).
thf(f139,plain,
! [X2: direction,X0: movelist,X1: direction] :
( ( ( next @ ( next @ ( playerpos @ nomove ) @ right ) @ right )
!= ( next @ ( next @ ( playerpos @ X0 ) @ X1 ) @ X2 ) )
| ( $true
= ( wall @ ( next @ ( next @ ( playerpos @ X0 ) @ X1 ) @ X2 ) ) )
| ( $true
= ( wall @ ( next @ ( playerpos @ X0 ) @ X1 ) ) ) ),
inference(constrained_superposition,[],[f134,f86]) ).
thf(f245,plain,
( ( $true
= ( wall @ ( next @ ( next @ ( playerpos @ nomove ) @ right ) @ right ) ) )
| ( $true
= ( wall @ ( next @ ( playerpos @ nomove ) @ right ) ) ) ),
inference(equality_resolution,[],[f139]) ).
thf(f246,plain,
( ( $true = $false )
| ( $true
= ( wall @ ( next @ ( playerpos @ nomove ) @ right ) ) ) ),
inference(forward_demodulation,[],[f245,f59]) ).
thf(f247,plain,
( $true
= ( wall @ ( next @ ( playerpos @ nomove ) @ right ) ) ),
inference(trivial_inequality_removal,[],[f246]) ).
thf(f248,plain,
$true = $false,
inference(forward_demodulation,[],[f247,f60]) ).
thf(f249,plain,
$false,
inference(trivial_inequality_removal,[],[f248]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ141^1 : TPTP v9.3.1. Released v6.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n014.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 13:26:45 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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.20/0.30 % (2642216)Will run a generic schedule for satisfiability detection.
% 0.20/0.30 % (2642222)% WARNING: option uhcvi not known.
% 0.20/0.30 % (2642222)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3629893446:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.30 % (2642225)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2744360137:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.30 % (2642227)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1723745893:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.30 % (2642224)dis+10_1_sil=32000:sp=arity:random_seed=856343523:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.30 % (2642223)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1296533600:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.30 % (2642226)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3438608200:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.30 % (2642221)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2888663334_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.30 % (2642222)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.30 % (2642225)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.30 % Exception at run slice level
% 0.20/0.30 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.30 % (2642222)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.30 % (2642226) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2642216-2642226"...
% 0.20/0.30 % (2642226)...printing done.
% 0.20/0.30 % (2642226)Refutation found. Thanks to Tanya!
% 0.20/0.30 % SZS status Theorem for theBenchmark
% 0.20/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (2642226)------------------------------
% 0.20/0.30 % (2642226)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (2642226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (2642226)CaDiCaL version: 2.1.3
% 0.20/0.30 % (2642226)Termination reason: Refutation
% 0.20/0.30 % (2642226)Time elapsed: 0.016 s
% 0.20/0.30 % (2642226)Peak memory usage: 12 MB
% 0.20/0.30 % (2642226)Instructions burned: 29 (million)
% 0.20/0.30 % (2642216)Success in time 0.055 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------