%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ALG282^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 : n001.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.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 41 ( 40 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 181 ( 10 ~; 0 |; 18 &; 150 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 72 ( 0 ^; 63 !; 9 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cP: a > a > a ).
thf(func_def_1,type,
cE: a ).
thf(func_def_2,type,
cJ: a > a ).
thf(func_def_4,type,
sK0: a ).
thf(func_def_5,type,
sK1: a ).
thf(f1,conjecture,
( ( ! [X1: a] :
( ( cP @ ( cJ @ X1 ) @ X1 )
= cE )
& ! [X0: a] :
( ( cP @ cE @ X0 )
= X0 )
& ! [X0: a,X1: a,X2: a] :
( ( cP @ ( cP @ X0 @ X1 ) @ X2 )
= ( cP @ X0 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X3: a,X4: a] :
? [X5: a] :
( ( cP @ X5 @ X3 )
= X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM21_pme) ).
thf(f2,negated_conjecture,
~ ( ( ! [X1: a] :
( ( cP @ ( cJ @ X1 ) @ X1 )
= cE )
& ! [X0: a] :
( ( cP @ cE @ X0 )
= X0 )
& ! [X0: a,X1: a,X2: a] :
( ( cP @ ( cP @ X0 @ X1 ) @ X2 )
= ( cP @ X0 @ ( cP @ X1 @ X2 ) ) ) )
=> ! [X3: a,X4: a] :
? [X5: a] :
( ( cP @ X5 @ X3 )
= X4 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ! [X0: a] :
( cE
= ( cP @ ( cJ @ X0 ) @ X0 ) )
& ! [X1: a] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: a,X3: a,X4: a] :
( ( cP @ ( cP @ X2 @ X3 ) @ X4 )
= ( cP @ X2 @ ( cP @ X3 @ X4 ) ) ) )
=> ! [X5: a,X6: a] :
? [X7: a] :
( ( cP @ X7 @ X5 )
= X6 ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( ? [X5: a,X6: a] :
! [X7: a] :
( ( cP @ X7 @ X5 )
!= X6 )
& ! [X0: a] :
( cE
= ( cP @ ( cJ @ X0 ) @ X0 ) )
& ! [X1: a] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: a,X3: a,X4: a] :
( ( cP @ ( cP @ X2 @ X3 ) @ X4 )
= ( cP @ X2 @ ( cP @ X3 @ X4 ) ) ) ),
inference(ennf_transformation,[],[f3]) ).
thf(f5,plain,
( ? [X5: a,X6: a] :
! [X7: a] :
( ( cP @ X7 @ X5 )
!= X6 )
& ! [X0: a] :
( cE
= ( cP @ ( cJ @ X0 ) @ X0 ) )
& ! [X1: a] :
( ( cP @ cE @ X1 )
= X1 )
& ! [X2: a,X3: a,X4: a] :
( ( cP @ ( cP @ X2 @ X3 ) @ X4 )
= ( cP @ X2 @ ( cP @ X3 @ X4 ) ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ? [X0: a,X1: a] :
! [X2: a] :
( ( cP @ X2 @ X0 )
!= X1 )
& ! [X3: a] :
( cE
= ( cP @ ( cJ @ X3 ) @ X3 ) )
& ! [X4: a] :
( ( cP @ cE @ X4 )
= X4 )
& ! [X5: a,X6: a,X7: a] :
( ( cP @ ( cP @ X5 @ X6 ) @ X7 )
= ( cP @ X5 @ ( cP @ X6 @ X7 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( ! [X2: a] :
( sK1
!= ( cP @ X2 @ sK0 ) )
& ! [X3: a] :
( cE
= ( cP @ ( cJ @ X3 ) @ X3 ) )
& ! [X4: a] :
( ( cP @ cE @ X4 )
= X4 )
& ! [X5: a,X6: a,X7: a] :
( ( cP @ ( cP @ X5 @ X6 ) @ X7 )
= ( cP @ X5 @ ( cP @ X6 @ X7 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).
thf(f8,plain,
! [X6: a,X7: a,X5: a] :
( ( cP @ ( cP @ X5 @ X6 ) @ X7 )
= ( cP @ X5 @ ( cP @ X6 @ X7 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
! [X4: a] :
( ( cP @ cE @ X4 )
= X4 ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
! [X3: a] :
( cE
= ( cP @ ( cJ @ X3 ) @ X3 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
! [X2: a] :
( sK1
!= ( cP @ X2 @ sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f15,plain,
! [X0: a,X1: a] :
( ( cP @ cE @ X1 )
= ( cP @ ( cJ @ X0 ) @ ( cP @ X0 @ X1 ) ) ),
inference(constrained_superposition,[],[f8,f10]) ).
thf(f17,plain,
! [X0: a,X1: a] :
( sK1
!= ( cP @ X0 @ ( cP @ X1 @ sK0 ) ) ),
inference(constrained_superposition,[],[f11,f8]) ).
thf(f19,plain,
! [X0: a,X1: a] :
( ( cP @ ( cJ @ X0 ) @ ( cP @ X0 @ X1 ) )
= X1 ),
inference(forward_demodulation,[],[f15,f9]) ).
thf(f22,plain,
! [X0: a] :
( sK1
!= ( cP @ X0 @ cE ) ),
inference(constrained_superposition,[],[f17,f10]) ).
thf(f28,plain,
! [X0: a] :
( ( cP @ ( cJ @ ( cJ @ X0 ) ) @ cE )
= X0 ),
inference(constrained_superposition,[],[f19,f10]) ).
thf(f30,plain,
! [X0: a,X1: a] :
( ( cP @ X1 @ X0 )
= ( cP @ ( cJ @ ( cJ @ X1 ) ) @ X0 ) ),
inference(constrained_superposition,[],[f19,f19]) ).
thf(f34,plain,
! [X0: a] :
( ( cP @ X0 @ cE )
= X0 ),
inference(forward_demodulation,[],[f28,f30]) ).
thf(f43,plain,
! [X0: a] : ( sK1 != X0 ),
inference(constrained_superposition,[],[f22,f34]) ).
thf(f46,plain,
$false,
inference(equality_resolution,[],[f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG282^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.18 % Computer : n001.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 17:43:21 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/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.09/0.25 % (1579929)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (1579938)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2788915019:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.25 % (1579938)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.09/0.25 % (1579938) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1579929-1579938"...
% 0.09/0.25 % (1579938)...printing done.
% 0.09/0.25 % (1579935)% WARNING: option uhcvi not known.
% 0.09/0.25 % (1579938)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (1579938)------------------------------
% 0.09/0.25 % (1579938)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (1579938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (1579938)CaDiCaL version: 2.1.3
% 0.09/0.25 % (1579938)Termination reason: Refutation
% 0.09/0.25 % (1579938)Time elapsed: 0.002 s
% 0.09/0.25 % (1579938)Peak memory usage: 12 MB
% 0.09/0.25 % (1579938)Instructions burned: 4 (million)
% 0.09/0.25 % (1579929)Success in time 0.03 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------