%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO023^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:48:44 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of formulae : 57 ( 20 unt; 0 typ; 4 def)
% Number of atoms : 249 ( 69 equ; 3 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 188 ( 96 ~; 67 |; 12 &; 9 @)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 13 usr; 9 con; 0-4 aty)
% Number of variables : 35 ( 0 sgn 0 !; 0 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
vAND: $o > $o > $o ).
thf(func_def_1,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_3,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_4,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_5,type,
vNOT: $o > $o ).
thf(func_def_6,type,
vOR: $o > $o > $o ).
thf(func_def_9,type,
sK0: $o ).
thf(func_def_10,type,
sK1: $o ).
thf(f1,conjecture,
( ( ^ [X0: $o,X1: $o] :
( X1
& X0 ) )
= ( ^ [X2: $o,X3: $o] :
~ ( ~ X3
| ~ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f2,negated_conjecture,
( ( ^ [X0: $o,X1: $o] :
( X1
& X0 ) )
!= ( ^ [X2: $o,X3: $o] :
~ ( ~ X3
| ~ X2 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
( ( ^ [X0: $o,X1: $o] :
( X1
& X0 ) )
!= ( ^ [X2: $o,X3: $o] :
~ ( ~ X3
| ~ X2 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( ( ^ [Y0: $o,Y1: $o] :
( Y0
& Y1 ) )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ^ [Y0: $o,Y1: $o] :
( Y0
& Y1 ) )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ( ^ [Y0: $o,Y1: $o] :
( Y0
& Y1 ) )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f9,plain,
( (&)
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(beta-eta_normalization,[],[f6]) ).
thf(f10,plain,
( ( (&) @ sK0 )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 )
@ sK0 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f11,plain,
( ( (&) @ sK0 )
!= ( ^ [Y0: $o] :
~ ( ~ sK0
| ~ Y0 ) ) ),
inference(beta-eta_normalization,[],[f10]) ).
thf(f12,plain,
( ( sK0
& sK1 )
!= ( ^ [Y0: $o] :
~ ( ~ sK0
| ~ Y0 )
@ sK1 ) ),
inference(negative_extensionality,[],[f11]) ).
thf(f13,plain,
( ( $true
= ( sK0
& sK1 ) )
| ( $true
= ( ^ [Y0: $o] :
~ ( ~ sK0
| ~ Y0 )
@ sK1 ) ) ),
inference(xor_proxy_clausification,[],[f12]) ).
thf(f14,plain,
( ( $false
= ( sK0
& sK1 ) )
| ( $false
= ( ^ [Y0: $o] :
~ ( ~ sK0
| ~ Y0 )
@ sK1 ) ) ),
inference(xor_proxy_clausification,[],[f12]) ).
thf(f15,plain,
( ( $false = sK1 )
| ( $false
= ( ^ [Y0: $o] :
~ ( ~ sK0
| ~ Y0 )
@ sK1 ) )
| ( $false = sK0 ) ),
inference(and_proxy_clausification,[],[f14]) ).
thf(f16,plain,
( ( $false = sK1 )
| ( $false
= ( ~ ( ~ sK0
| ~ sK1 ) ) )
| ( $false = sK0 ) ),
inference(beta-eta_normalization,[],[f15]) ).
thf(f17,plain,
( ( $false = sK1 )
| ( $true
= ( ~ sK0
| ~ sK1 ) )
| ( $false = sK0 ) ),
inference(not_proxy_clausification,[],[f16]) ).
thf(f18,plain,
( ( $false = sK1 )
| ( $true = ( ~ sK1 ) )
| ( $false = sK0 )
| ( $true = ( ~ sK0 ) ) ),
inference(or_proxy_clausification,[],[f17]) ).
thf(f19,plain,
( ( $false = sK1 )
| ( $false = sK1 )
| ( $false = sK0 )
| ( $true = ( ~ sK0 ) ) ),
inference(not_proxy_clausification,[],[f18]) ).
thf(f20,plain,
( ( $false = sK1 )
| ( $false = sK1 )
| ( $false = sK0 )
| ( $false = sK0 ) ),
inference(not_proxy_clausification,[],[f19]) ).
thf(f21,plain,
( ( $false = sK1 )
| ( $false = sK0 ) ),
inference(duplicate_literal_removal,[],[f20]) ).
thf(f22,plain,
( ( $true = sK1 )
| ( $true
= ( ^ [Y0: $o] :
~ ( ~ sK0
| ~ Y0 )
@ sK1 ) ) ),
inference(and_proxy_clausification,[],[f13]) ).
thf(f23,plain,
( ( $true = sK0 )
| ( $true
= ( ^ [Y0: $o] :
~ ( ~ sK0
| ~ Y0 )
@ sK1 ) ) ),
inference(and_proxy_clausification,[],[f13]) ).
thf(f24,plain,
( ( $true = sK0 )
| ( $true
= ( ~ ( ~ sK0
| ~ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f23]) ).
thf(f25,plain,
( ( $true = sK0 )
| ( $false
= ( ~ sK0
| ~ sK1 ) ) ),
inference(not_proxy_clausification,[],[f24]) ).
thf(f27,plain,
( ( $true = sK0 )
| ( $false = ( ~ sK0 ) ) ),
inference(or_proxy_clausification,[],[f25]) ).
thf(f28,plain,
( ( $true = sK0 )
| ( $true = sK0 ) ),
inference(not_proxy_clausification,[],[f27]) ).
thf(f29,plain,
$true = sK0,
inference(duplicate_literal_removal,[],[f28]) ).
thf(f31,plain,
( ( $true = sK1 )
| ( $true
= ( ~ ( ~ sK0
| ~ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f32,plain,
( ( $true = sK1 )
| ( $false
= ( ~ sK0
| ~ sK1 ) ) ),
inference(not_proxy_clausification,[],[f31]) ).
thf(f33,plain,
( ( $true = sK1 )
| ( $false = ( ~ sK1 ) ) ),
inference(or_proxy_clausification,[],[f32]) ).
thf(f36,plain,
( ( $true = sK1 )
| ( $true = sK1 ) ),
inference(not_proxy_clausification,[],[f33]) ).
thf(f37,plain,
$true = sK1,
inference(duplicate_literal_removal,[],[f36]) ).
thf(f39,definition,
( spl2_1
<=> ( $false = sK0 ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f41,plain,
( ( $false = sK0 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f39]) ).
thf(f43,definition,
( spl2_2
<=> ( $false = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f45,plain,
( ( $false = sK1 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f43]) ).
thf(f46,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f21,f43,f39]) ).
thf(f48,definition,
( spl2_3
<=> ( $true = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
thf(f50,plain,
( ( $true = sK1 )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f48]) ).
thf(f52,definition,
( spl2_4
<=> ( $true = sK0 ) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
thf(f54,plain,
( ( $true = sK0 )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f52]) ).
thf(f57,plain,
spl2_3,
inference(avatar_split_clause,[],[f37,f48]) ).
thf(f67,plain,
spl2_4,
inference(avatar_split_clause,[],[f29,f52]) ).
thf(f68,plain,
( ( $true = $false )
| ~ spl2_2
| ~ spl2_3 ),
inference(forward_demodulation,[],[f50,f45]) ).
thf(f69,plain,
( $false
| ~ spl2_2
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f68]) ).
thf(f70,plain,
( ~ spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f69]) ).
thf(f75,plain,
( ( $true = $false )
| ~ spl2_1
| ~ spl2_4 ),
inference(forward_demodulation,[],[f54,f41]) ).
thf(f76,plain,
( $false
| ~ spl2_1
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f75]) ).
thf(f77,plain,
( ~ spl2_1
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f76]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f46]) ).
cnf(s4,plain,
spl2_3,
inference(sat_conversion,[],[f57]) ).
cnf(s5,plain,
spl2_4,
inference(sat_conversion,[],[f67]) ).
cnf(s6,plain,
( ~ spl2_2
| ~ spl2_3 ),
inference(sat_conversion,[],[f70]) ).
cnf(s7,plain,
( ~ spl2_1
| ~ spl2_4 ),
inference(sat_conversion,[],[f77]) ).
cnf(s8,plain,
~ spl2_1,
inference(rat,[],[s7,s5]) ).
cnf(s9,plain,
~ spl2_2,
inference(rat,[],[s6,s4]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s9,s8]) ).
thf(f78,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO023^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n004.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 16:23:16 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/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.07/0.25 % (1504421)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (1504429)dis+10_1_sil=32000:sp=arity:random_seed=3745772369:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.07/0.25 % (1504429) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1504421-1504429"...
% 0.07/0.25 % (1504429)...printing done.
% 0.07/0.25 % (1504427)% WARNING: option uhcvi not known.
% 0.07/0.25 % (1504429)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Theorem for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.25 % (1504429)------------------------------
% 0.07/0.25 % (1504429)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (1504429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (1504429)CaDiCaL version: 2.1.3
% 0.07/0.25 % (1504429)Termination reason: Refutation
% 0.07/0.25 % (1504429)Time elapsed: 0.002 s
% 0.07/0.25 % (1504429)Peak memory usage: 12 MB
% 0.07/0.25 % (1504429)Instructions burned: 3 (million)
% 0.07/0.25 % (1504421)Success in time 0.017 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------