%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ALG284^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 : n019.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:30 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 82 ( 45 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 257 ( 8 ~; 0 |; 18 &; 228 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 70 ( 0 ^; 64 !; 6 ?; 70 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cJ: $i > $i ).
thf(func_def_1,type,
cP: $i > $i > $i ).
thf(f1,conjecture,
( ( ! [X1: $i] :
( ( cP @ ( cJ @ X1 ) @ X1 )
= cE )
& ! [X0: $i] :
( ( cP @ cE @ X0 )
= X0 )
& ! [X0: $i,X1: $i,X2: $i] :
( ( cP @ ( cP @ X0 @ X1 ) @ X2 )
= ( cP @ X0 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X3: $i,X4: $i] :
( ( cJ @ ( cP @ X3 @ X4 ) )
= ( cP @ ( cJ @ X4 ) @ ( cJ @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM18_pme) ).
thf(f2,negated_conjecture,
~ ( ( ! [X1: $i] :
( ( cP @ ( cJ @ X1 ) @ X1 )
= cE )
& ! [X0: $i] :
( ( cP @ cE @ X0 )
= X0 )
& ! [X0: $i,X1: $i,X2: $i] :
( ( cP @ ( cP @ X0 @ X1 ) @ X2 )
= ( cP @ X0 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X3: $i,X4: $i] :
( ( cJ @ ( cP @ X3 @ X4 ) )
= ( cP @ ( cJ @ X4 ) @ ( cJ @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: $i] :
( cE
= ( cP @ ( cJ @ X0 ) @ X0 ) )
& ! [X1: $i] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: $i,X3: $i,X4: $i] :
( ( cP @ ( cP @ X2 @ X3 ) @ X4 )
= ( cP @ X2 @ ( cP @ X3 @ X4 ) ) ) )
=> ! [X5: $i,X6: $i] :
( ( cJ @ ( cP @ X5 @ X6 ) )
= ( cP @ ( cJ @ X6 ) @ ( cJ @ X5 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( ? [X5: $i,X6: $i] :
( ( cJ @ ( cP @ X5 @ X6 ) )
!= ( cP @ ( cJ @ X6 ) @ ( cJ @ X5 ) ) )
& ! [X0: $i] :
( cE
= ( cP @ ( cJ @ X0 ) @ X0 ) )
& ! [X1: $i] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: $i,X3: $i,X4: $i] :
( ( cP @ ( cP @ X2 @ X3 ) @ X4 )
= ( cP @ X2 @ ( cP @ X3 @ X4 ) ) ) ),
inference(ennf_transformation,[],[f3]) ).
thf(f5,plain,
( ? [X5: $i,X6: $i] :
( ( cJ @ ( cP @ X5 @ X6 ) )
!= ( cP @ ( cJ @ X6 ) @ ( cJ @ X5 ) ) )
& ! [X0: $i] :
( cE
= ( cP @ ( cJ @ X0 ) @ X0 ) )
& ! [X1: $i] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: $i,X3: $i,X4: $i] :
( ( cP @ ( cP @ X2 @ X3 ) @ X4 )
= ( cP @ X2 @ ( cP @ X3 @ X4 ) ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ? [X0: $i,X1: $i] :
( ( cJ @ ( cP @ X0 @ X1 ) )
!= ( cP @ ( cJ @ X1 ) @ ( cJ @ X0 ) ) )
& ! [X2: $i] :
( cE
= ( cP @ ( cJ @ X2 ) @ X2 ) )
& ! [X3: $i] :
( ( cP @ cE @ X3 )
= X3 )
& ! [X4: $i,X5: $i,X6: $i] :
( ( cP @ ( cP @ X4 @ X5 ) @ X6 )
= ( cP @ X4 @ ( cP @ X5 @ X6 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ( ( cJ @ ( cP @ sK0 @ sK1 ) )
!= ( cP @ ( cJ @ sK1 ) @ ( cJ @ sK0 ) ) )
& ! [X2: $i] :
( cE
= ( cP @ ( cJ @ X2 ) @ X2 ) )
& ! [X3: $i] :
( ( cP @ cE @ X3 )
= X3 )
& ! [X4: $i,X5: $i,X6: $i] :
( ( cP @ ( cP @ X4 @ X5 ) @ X6 )
= ( cP @ X4 @ ( cP @ X5 @ X6 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f8,plain,
! [X6: $i,X4: $i,X5: $i] :
( ( cP @ ( cP @ X4 @ X5 ) @ X6 )
= ( cP @ X4 @ ( cP @ X5 @ X6 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
! [X3: $i] :
( ( cP @ cE @ X3 )
= X3 ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
! [X2: $i] :
( cE
= ( cP @ ( cJ @ X2 ) @ X2 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( ( cJ @ ( cP @ sK0 @ sK1 ) )
!= ( cP @ ( cJ @ sK1 ) @ ( cJ @ sK0 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,plain,
! [X0: $i,X1: $i] :
( ( cP @ cE @ X1 )
= ( cP @ ( cJ @ X0 ) @ ( cP @ X0 @ X1 ) ) ),
inference(constrained_superposition,[],[f8,f10]) ).
thf(f16,plain,
! [X0: $i,X1: $i] :
( ( cP @ ( cJ @ X0 ) @ ( cP @ X0 @ X1 ) )
= X1 ),
inference(forward_demodulation,[],[f13,f9]) ).
thf(f19,plain,
! [X0: $i] :
( ( cP @ ( cJ @ ( cJ @ X0 ) ) @ cE )
= X0 ),
inference(constrained_superposition,[],[f16,f10]) ).
thf(f28,plain,
! [X0: $i] :
( cE
= ( cP @ ( cJ @ ( cJ @ ( cJ @ X0 ) ) ) @ X0 ) ),
inference(constrained_superposition,[],[f16,f19]) ).
thf(f45,plain,
! [X0: $i] :
( ( cP @ ( cJ @ ( cJ @ ( cJ @ ( cJ @ X0 ) ) ) ) @ cE )
= X0 ),
inference(constrained_superposition,[],[f16,f28]) ).
thf(f49,plain,
! [X0: $i] :
( ( cJ @ ( cJ @ X0 ) )
= X0 ),
inference(forward_demodulation,[],[f45,f19]) ).
thf(f54,plain,
! [X0: $i] :
( cE
= ( cP @ X0 @ ( cJ @ X0 ) ) ),
inference(constrained_superposition,[],[f10,f49]) ).
thf(f56,plain,
! [X0: $i] :
( ( cP @ X0 @ cE )
= X0 ),
inference(constrained_superposition,[],[f19,f49]) ).
thf(f80,plain,
! [X0: $i,X1: $i] :
( cE
= ( cP @ X0 @ ( cP @ X1 @ ( cJ @ ( cP @ X0 @ X1 ) ) ) ) ),
inference(constrained_superposition,[],[f54,f8]) ).
thf(f141,plain,
! [X0: $i,X1: $i] :
( ( cP @ ( cJ @ X0 ) @ cE )
= ( cP @ X1 @ ( cJ @ ( cP @ X0 @ X1 ) ) ) ),
inference(constrained_superposition,[],[f16,f80]) ).
thf(f152,plain,
! [X0: $i,X1: $i] :
( ( cJ @ X0 )
= ( cP @ X1 @ ( cJ @ ( cP @ X0 @ X1 ) ) ) ),
inference(forward_demodulation,[],[f141,f56]) ).
thf(f261,plain,
! [X0: $i,X1: $i] :
( ( cJ @ ( cP @ X0 @ X1 ) )
= ( cP @ ( cJ @ X1 ) @ ( cJ @ X0 ) ) ),
inference(constrained_superposition,[],[f16,f152]) ).
thf(f476,plain,
( ( cJ @ ( cP @ sK0 @ sK1 ) )
!= ( cJ @ ( cP @ sK0 @ sK1 ) ) ),
inference(constrained_superposition,[],[f11,f261]) ).
thf(f482,plain,
$false,
inference(trivial_inequality_removal,[],[f476]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG284^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.10/0.18 % Computer : n019.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 17:37:48 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/0.21 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.10/0.25 % (1131457)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (1131464)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3144237447:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.25 % (1131463)% WARNING: option uhcvi not known.
% 0.10/0.25 % (1131465)dis+10_1_sil=32000:sp=arity:random_seed=4260706938:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.25 % (1131463)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3188940512:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.25 % (1131466)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3120239419:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.25 % (1131463)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.25 % (1131466)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.25 % (1131463)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.10/0.25 % (1131464) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1131457-1131464"...
% 0.10/0.25 % (1131462)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2297274734_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.25 % Exception at run slice level
% 0.10/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.10/0.25 % (1131464)...printing done.
% 0.10/0.25 % (1131464)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25 % (1131464)------------------------------
% 0.10/0.25 % (1131464)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (1131464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (1131464)CaDiCaL version: 2.1.3
% 0.10/0.25 % (1131464)Termination reason: Refutation
% 0.10/0.25 % (1131464)Time elapsed: 0.010 s
% 0.10/0.25 % (1131464)Peak memory usage: 12 MB
% 0.10/0.25 % (1131464)Instructions burned: 33 (million)
% 0.10/0.25 % (1131457)Success in time 0.032 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------