%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU839^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 : n026.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:34:16 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 125 ( 39 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 127 ( 7 ~; 42 |; 0 &; 78 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 30 ( 20 ^; 8 !; 2 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
vOR: $o > $o > $o ).
thf(func_def_2,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_3,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_8,type,
sK2: a ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o] :
( ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= ( ^ [X2: a] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGAZING_THM26_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= ( ^ [X2: a] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [X2: a] :
( ( X1 @ X2 )
| ( X0 @ X2 ) ) )
= ( ^ [X3: a] :
( ( X0 @ X3 )
| ( X1 @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( X1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( X1 @ Y0 )
| ( X0 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f5]) ).
thf(f7,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
@ sK2 )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f7]) ).
thf(f11,plain,
( ( $true
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
@ sK2 ) )
| ( $true
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f10]) ).
thf(f12,plain,
( ( $false
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
@ sK2 ) )
| ( $false
= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
@ sK2 ) ) ),
inference(xor_proxy_clausification,[],[f10]) ).
thf(f13,plain,
( ( $false
= ( ( sK0 @ sK2 )
| ( sK1 @ sK2 ) ) )
| ( $false
= ( ( sK1 @ sK2 )
| ( sK0 @ sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f12]) ).
thf(f14,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ( $false
= ( ( sK1 @ sK2 )
| ( sK0 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f13]) ).
thf(f15,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ( $false
= ( ( sK1 @ sK2 )
| ( sK0 @ sK2 ) ) ) ),
inference(or_proxy_clausification,[],[f13]) ).
thf(f16,plain,
( ( $false
= ( sK0 @ sK2 ) )
| ( $false
= ( sK0 @ sK2 ) ) ),
inference(or_proxy_clausification,[],[f15]) ).
thf(f18,plain,
( $false
= ( sK0 @ sK2 ) ),
inference(duplicate_literal_removal,[],[f16]) ).
thf(f20,plain,
( ( $false
= ( sK1 @ sK2 ) )
| ( $false
= ( sK1 @ sK2 ) ) ),
inference(or_proxy_clausification,[],[f14]) ).
thf(f21,plain,
( $false
= ( sK1 @ sK2 ) ),
inference(duplicate_literal_removal,[],[f20]) ).
thf(f22,plain,
( ( $true
= ( ( sK0 @ sK2 )
| ( sK1 @ sK2 ) ) )
| ( $true
= ( ( sK1 @ sK2 )
| ( sK0 @ sK2 ) ) ) ),
inference(beta-eta_normalization,[],[f11]) ).
thf(f23,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( ( sK1 @ sK2 )
| ( sK0 @ sK2 ) ) )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(or_proxy_clausification,[],[f22]) ).
thf(f24,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) ) ),
inference(or_proxy_clausification,[],[f23]) ).
thf(f25,plain,
( ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(duplicate_literal_removal,[],[f24]) ).
thf(f27,plain,
( ( $true = $false )
| ( $true
= ( sK0 @ sK2 ) ) ),
inference(forward_demodulation,[],[f25,f21]) ).
thf(f28,plain,
( $true
= ( sK0 @ sK2 ) ),
inference(trivial_inequality_removal,[],[f27]) ).
thf(f29,plain,
$true = $false,
inference(forward_demodulation,[],[f28,f18]) ).
thf(f30,plain,
$false,
inference(trivial_inequality_removal,[],[f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU839^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n026.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 14:42:27 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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 % (686919)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (686924)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2070718921_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % Exception at run slice level
% 0.20/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.27 % (686925)% WARNING: option uhcvi not known.
% 0.20/0.27 % (686928)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1526257734:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (686925)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=909547355:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (686926)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2047602453:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (686927)dis+10_1_sil=32000:sp=arity:random_seed=2183582404:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (686928)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (686925)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (686929)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=544858350:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (686925)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.27 % (686930)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2679953540:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27 % (686928) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-686919-686928"...
% 0.20/0.27 % (686926) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-686919-686926"...
% 0.20/0.27 % (686929) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-686919-686929"...
% 0.20/0.27 % (686925) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-686919-686925"...
% 0.20/0.27 % (686927) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-686919-686927"...
% 0.20/0.27 % (686930) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-686919-686930"...
% 0.20/0.27 % (686932)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1691183840:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.27 % (686926)...printing done.
% 0.20/0.27 % (686928)...printing done.
% 0.20/0.27 % Exception at run slice level
% 0.20/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.27 % (686929)...printing done.
% 0.20/0.27 % (686925)...printing done.
% 0.20/0.27 % (686927)...printing done.
% 0.20/0.27 % (686930)...printing done.
% 0.20/0.27 % (686926)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 % (686926)------------------------------
% 0.20/0.27 % (686926)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (686926)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (686926)CaDiCaL version: 2.1.3
% 0.20/0.27 % (686926)Termination reason: Refutation
% 0.20/0.27 % (686926)Time elapsed: 0.002 s
% 0.20/0.27 % (686926)Peak memory usage: 12 MB
% 0.20/0.27 % (686926)Instructions burned: 2 (million)
% 0.20/0.27 % (686919)Success in time 0.035 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------