%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET171^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:23:36 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of formulae : 52 ( 17 unt; 0 typ; 2 def)
% Number of atoms : 331 ( 86 equ; 0 cnn)
% Maximal formula atoms : 4 ( 6 avg)
% Number of connectives : 343 ( 17 ~; 108 |; 32 &; 184 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 5 con; 0-4 aty)
% Number of variables : 35 ( 0 sgn 12 !; 3 ?; 35 :)
% 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,
vAND: $o > $o > $o ).
thf(func_def_4,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_5,type,
sK0: a > $o ).
thf(func_def_6,type,
sK1: a > $o ).
thf(func_def_7,type,
sK2: a > $o ).
thf(func_def_10,type,
sK3: a ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( ( X2 @ X3 )
& ( X1 @ X3 ) )
| ( X0 @ X3 ) ) )
= ( ^ [X4: a] :
( ( ( X2 @ X4 )
| ( X0 @ X4 ) )
& ( ( X1 @ X4 )
| ( X0 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_71_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( ( X2 @ X3 )
& ( X1 @ X3 ) )
| ( X0 @ X3 ) ) )
= ( ^ [X4: a] :
( ( ( X2 @ X4 )
| ( X0 @ X4 ) )
& ( ( X1 @ X4 )
| ( X0 @ X4 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( ( X2 @ X3 )
& ( X1 @ X3 ) )
| ( X0 @ X3 ) ) )
= ( ^ [X4: a] :
( ( ( X2 @ X4 )
| ( X0 @ X4 ) )
& ( ( X1 @ X4 )
| ( X0 @ X4 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( ( X1 @ Y0 )
& ( X2 @ Y0 ) ) ) )
= ( ^ [Y0: a] :
( ( ( X0 @ Y0 )
| ( X1 @ Y0 ) )
& ( ( X0 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
| ( ( X1 @ Y0 )
& ( X2 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( X0 @ Y0 )
| ( X1 @ Y0 ) )
& ( ( X0 @ Y0 )
| ( X2 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK0 @ Y0 )
| ( sK2 @ Y0 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f5]) ).
thf(f7,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK0 @ Y0 )
| ( sK2 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f17,plain,
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 ) ) )
@ sK3 )
!= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK0 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK3 ) ),
inference(negative_extensionality,[],[f7]) ).
thf(f18,plain,
( ( $true
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 ) ) )
@ sK3 ) )
| ( $true
= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK0 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f17]) ).
thf(f19,plain,
( ( $false
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 ) ) )
@ sK3 ) )
| ( $false
= ( ^ [Y0: a] :
( ( ( sK0 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK0 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK3 ) ) ),
inference(xor_proxy_clausification,[],[f17]) ).
thf(f20,plain,
( ( $false
= ( ( sK0 @ sK3 )
| ( ( sK1 @ sK3 )
& ( sK2 @ sK3 ) ) ) )
| ( $false
= ( ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) )
& ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) ) ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f21,plain,
( ( $false
= ( ( sK1 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $false
= ( ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) )
& ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) ) ) ),
inference(or_proxy_clausification,[],[f20]) ).
thf(f22,plain,
( ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) )
& ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) ) ) ),
inference(or_proxy_clausification,[],[f20]) ).
thf(f23,plain,
( ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) )
| ( $false
= ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f22]) ).
thf(f25,plain,
( ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) ) ) ),
inference(or_proxy_clausification,[],[f23]) ).
thf(f27,plain,
( ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) )
| ( $false
= ( sK0 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f25]) ).
thf(f28,plain,
( $false
= ( sK0 @ sK3 ) ),
inference(duplicate_literal_removal,[],[f27]) ).
thf(f33,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) )
& ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f21]) ).
thf(f34,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) )
| ( $false
= ( sK1 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) ) ) ),
inference(and_proxy_clausification,[],[f33]) ).
thf(f35,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) )
| ( $false
= ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) ) ) ),
inference(or_proxy_clausification,[],[f34]) ).
thf(f41,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f35]) ).
thf(f44,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ( $false
= ( sK1 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f41]) ).
thf(f45,plain,
( ( $true
= ( ( sK0 @ sK3 )
| ( ( sK1 @ sK3 )
& ( sK2 @ sK3 ) ) ) )
| ( $true
= ( ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) )
& ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) ) ) ),
inference(beta-eta_normalization,[],[f18]) ).
thf(f46,plain,
( ( $true
= ( ( sK1 @ sK3 )
& ( sK2 @ sK3 ) ) )
| ( $true
= ( ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) )
& ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f45]) ).
thf(f47,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) )
& ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f46]) ).
thf(f48,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) )
& ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f46]) ).
thf(f50,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
| ( sK1 @ sK3 ) ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f48]) ).
thf(f51,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f50]) ).
thf(f52,plain,
( ( $true
= ( sK1 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f51]) ).
thf(f55,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( ( sK0 @ sK3 )
| ( sK2 @ sK3 ) ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(and_proxy_clausification,[],[f47]) ).
thf(f59,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(or_proxy_clausification,[],[f55]) ).
thf(f60,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f59]) ).
thf(f62,definition,
( spl4_1
<=> ( $false
= ( sK1 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
thf(f64,plain,
( ( $false
= ( sK1 @ sK3 ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f62]) ).
thf(f66,definition,
( spl4_2
<=> ( $false
= ( sK2 @ sK3 ) ) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
thf(f68,plain,
( ( $false
= ( sK2 @ sK3 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f69,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f44,f66,f62]) ).
thf(f70,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(forward_demodulation,[],[f52,f28]) ).
thf(f71,plain,
( $true
= ( sK1 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f76,plain,
( ( $true = $false )
| ( $true
= ( sK2 @ sK3 ) ) ),
inference(forward_demodulation,[],[f60,f28]) ).
thf(f77,plain,
( $true
= ( sK2 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f81,plain,
( ( $true = $false )
| ~ spl4_2 ),
inference(constrained_superposition,[],[f68,f77]) ).
thf(f85,plain,
( $false
| ~ spl4_2 ),
inference(trivial_inequality_removal,[],[f81]) ).
thf(f86,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f85]) ).
thf(f90,plain,
( ( $true = $false )
| ~ spl4_1 ),
inference(constrained_superposition,[],[f64,f71]) ).
thf(f94,plain,
( $false
| ~ spl4_1 ),
inference(trivial_inequality_removal,[],[f90]) ).
thf(f95,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f94]) ).
cnf(s1,plain,
( spl4_1
| spl4_2 ),
inference(sat_conversion,[],[f69]) ).
cnf(s3,plain,
~ spl4_2,
inference(sat_conversion,[],[f86]) ).
cnf(s5,plain,
~ spl4_1,
inference(sat_conversion,[],[f95]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s3,s5]) ).
thf(f97,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET171^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n010.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.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 13:37:33 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.27 % (2859020)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (2859030)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1378947871:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (2859030) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2859020-2859030"...
% 0.20/0.27 % (2859026)% WARNING: option uhcvi not known.
% 0.20/0.27 % (2859030)...printing done.
% 0.20/0.27 % (2859030)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 % (2859030)------------------------------
% 0.20/0.27 % (2859030)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (2859030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (2859030)CaDiCaL version: 2.1.3
% 0.20/0.27 % (2859030)Termination reason: Refutation
% 0.20/0.27 % (2859030)Time elapsed: 0.002 s
% 0.20/0.27 % (2859030)Peak memory usage: 13 MB
% 0.20/0.27 % (2859030)Instructions burned: 4 (million)
% 0.20/0.27 % (2859020)Success in time 0.035 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------