%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ALG287^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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 07:45:31 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 66 ( 65 equ; 0 cnn)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 184 ( 17 ~; 6 |; 34 &; 116 @)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 ^; 34 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
v: a ).
thf(func_def_1,type,
u: a ).
thf(func_def_2,type,
y: a ).
thf(func_def_3,type,
x: a ).
thf(func_def_4,type,
cP: a > a > a ).
thf(func_def_5,type,
cR: a > a ).
thf(func_def_6,type,
cL: a > a ).
thf(func_def_7,type,
cZ: a ).
thf(f1,conjecture,
( ( ! [X2: a] :
( ( X2 != cZ )
<=> ( X2
= ( cP @ ( cL @ X2 ) @ ( cR @ X2 ) ) ) )
& ! [X0: a,X1: a] :
( ( cR @ ( cP @ X0 @ X1 ) )
= X1 )
& ! [X0: a,X1: a] :
( ( cL @ ( cP @ X0 @ X1 ) )
= X0 )
& ( ( cR @ cZ )
= cZ )
& ( ( cL @ cZ )
= cZ ) )
=> ( ( ( cP @ x @ u )
= ( cP @ y @ v ) )
=> ( ( u = v )
& ( x = y ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cPU_P_INJ_pme) ).
thf(f2,negated_conjecture,
~ ( ( ! [X2: a] :
( ( X2 != cZ )
<=> ( X2
= ( cP @ ( cL @ X2 ) @ ( cR @ X2 ) ) ) )
& ! [X0: a,X1: a] :
( ( cR @ ( cP @ X0 @ X1 ) )
= X1 )
& ! [X0: a,X1: a] :
( ( cL @ ( cP @ X0 @ X1 ) )
= X0 )
& ( ( cR @ cZ )
= cZ )
& ( ( cL @ cZ )
= cZ ) )
=> ( ( ( cP @ x @ u )
= ( cP @ y @ v ) )
=> ( ( u = v )
& ( x = y ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: a] :
( ( cZ != X0 )
<=> ( ( cP @ ( cL @ X0 ) @ ( cR @ X0 ) )
= X0 ) )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a,X4: a] :
( ( cL @ ( cP @ X3 @ X4 ) )
= X3 )
& ( ( cR @ cZ )
= cZ )
& ( ( cL @ cZ )
= cZ ) )
=> ( ( ( cP @ x @ u )
= ( cP @ y @ v ) )
=> ( ( u = v )
& ( x = y ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( ( ( u != v )
| ( x != y ) )
& ( ( cP @ x @ u )
= ( cP @ y @ v ) )
& ! [X0: a] :
( ( cZ != X0 )
<=> ( ( cP @ ( cL @ X0 ) @ ( cR @ X0 ) )
= X0 ) )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a,X4: a] :
( ( cL @ ( cP @ X3 @ X4 ) )
= X3 )
& ( ( cR @ cZ )
= cZ )
& ( ( cL @ cZ )
= cZ ) ),
inference(ennf_transformation,[],[f3]) ).
thf(f5,plain,
( ( ( u != v )
| ( x != y ) )
& ( ( cP @ x @ u )
= ( cP @ y @ v ) )
& ! [X0: a] :
( ( cZ != X0 )
<=> ( ( cP @ ( cL @ X0 ) @ ( cR @ X0 ) )
= X0 ) )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a,X4: a] :
( ( cL @ ( cP @ X3 @ X4 ) )
= X3 )
& ( ( cR @ cZ )
= cZ )
& ( ( cL @ cZ )
= cZ ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ( ( u != v )
| ( x != y ) )
& ( ( cP @ x @ u )
= ( cP @ y @ v ) )
& ! [X0: a] :
( ( ( cZ != X0 )
| ( ( cP @ ( cL @ X0 ) @ ( cR @ X0 ) )
!= X0 ) )
& ( ( ( cP @ ( cL @ X0 ) @ ( cR @ X0 ) )
= X0 )
| ( cZ = X0 ) ) )
& ! [X1: a,X2: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 )
& ! [X3: a,X4: a] :
( ( cL @ ( cP @ X3 @ X4 ) )
= X3 )
& ( ( cR @ cZ )
= cZ )
& ( ( cL @ cZ )
= cZ ) ),
inference(nnf_transformation,[],[f5]) ).
thf(f9,plain,
! [X3: a,X4: a] :
( ( cL @ ( cP @ X3 @ X4 ) )
= X3 ),
inference(cnf_transformation,[],[f6]) ).
thf(f10,plain,
! [X2: a,X1: a] :
( ( cR @ ( cP @ X1 @ X2 ) )
= X2 ),
inference(cnf_transformation,[],[f6]) ).
thf(f13,plain,
( ( cP @ x @ u )
= ( cP @ y @ v ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f14,plain,
( ( u != v )
| ( x != y ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f29,plain,
( u
= ( cR @ ( cP @ y @ v ) ) ),
inference(constrained_superposition,[],[f10,f13]) ).
thf(f30,plain,
( x
= ( cL @ ( cP @ y @ v ) ) ),
inference(constrained_superposition,[],[f9,f13]) ).
thf(f31,plain,
x = y,
inference(forward_demodulation,[],[f30,f9]) ).
thf(f32,plain,
u = v,
inference(forward_demodulation,[],[f29,f10]) ).
thf(f39,plain,
$false,
inference(global_subsumption,[],[f31,f32,f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG287^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n016.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 17:42:35 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.27 % (675348)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (675365)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=191120285:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (675365) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-675348-675365"...
% 0.20/0.27 % (675364)% WARNING: option uhcvi not known.
% 0.20/0.27 % (675365)...printing done.
% 0.20/0.27 % (675365)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (675365)------------------------------
% 0.20/0.27 % (675365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (675365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (675365)CaDiCaL version: 2.1.3
% 0.20/0.27 % (675365)Termination reason: Refutation
% 0.20/0.27 % (675365)Time elapsed: 0.002 s
% 0.20/0.27 % (675365)Peak memory usage: 12 MB
% 0.20/0.27 % (675365)Instructions burned: 3 (million)
% 0.20/0.27 % (675348)Success in time 0.04 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------