%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO371^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 : n007.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:49:48 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 7 unt; 0 typ; 4 def)
% Number of atoms : 152 ( 30 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 98 ( 35 ~; 33 |; 1 &; 14 @)
% ( 7 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 8 con; 0-4 aty)
% Number of variables : 8 ( 0 sgn 6 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cQ: $o ).
thf(func_def_1,type,
cP: $o ).
thf(func_def_5,type,
vNOT: $o > $o ).
thf(func_def_7,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,conjecture,
( ! [X0: $o > $o] :
( ( X0 @ cP )
=> ( X0 @ cQ ) )
=> ( cP
<=> cQ ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEXT_O_LEIB) ).
thf(f2,negated_conjecture,
~ ( ! [X0: $o > $o] :
( ( X0 @ cP )
=> ( X0 @ cQ ) )
=> ( cP
<=> cQ ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ! [X0: $o > $o] :
( ( X0 @ cP )
=> ( X0 @ cQ ) )
=> ( cP
<=> cQ ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ! [X0: $o > $o] :
( ( ( X0 @ cP )
= $true )
=> ( ( X0 @ cQ )
= $true ) )
=> ( cP = cQ ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( cP != cQ )
& ! [X0: $o > $o] :
( ( ( X0 @ cQ )
= $true )
| ( ( X0 @ cP )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
! [X0: $o > $o] :
( ( ( X0 @ cP )
!= $true )
| ( ( X0 @ cQ )
= $true ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f7,plain,
cP != cQ,
inference(cnf_transformation,[],[f5]) ).
thf(f10,plain,
( ( cP = $true )
| ( cQ = $true ) ),
inference(xor_proxy_clausification,[],[f7]) ).
thf(f11,plain,
( ( cP = $false )
| ( cQ = $false ) ),
inference(xor_proxy_clausification,[],[f7]) ).
thf(f13,definition,
( spl0_1
<=> ( cQ = $false ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f15,plain,
( ( cQ = $false )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f13]) ).
thf(f17,definition,
( spl0_2
<=> ( cP = $false ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f19,plain,
( ( cP = $false )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f20,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f11,f17,f13]) ).
thf(f22,definition,
( spl0_3
<=> ( cQ = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
thf(f24,plain,
( ( cQ = $true )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f22]) ).
thf(f26,definition,
( spl0_4
<=> ( cP = $true ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
thf(f28,plain,
( ( cP = $true )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f26]) ).
thf(f29,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f10,f26,f22]) ).
thf(f30,plain,
cP = cQ,
inference(leibniz_equality_elimination,[],[f6]) ).
thf(f46,plain,
( ( cP = $true )
| ( cQ = $false ) ),
inference(iff_proxy_clausification,[],[f30]) ).
thf(f49,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f46,f26,f13]) ).
thf(f60,plain,
( ( $true = $false )
| ~ spl0_2
| ~ spl0_4 ),
inference(constrained_superposition,[],[f19,f28]) ).
thf(f62,plain,
( ( $true != $true )
| ( $true
= ( ^ [Y0: $o] : Y0
@ cQ ) )
| ~ spl0_4 ),
inference(constrained_superposition,[],[f6,f28]) ).
thf(f66,plain,
( ( $true
= ( ^ [Y0: $o] : Y0
@ cQ ) )
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f62]) ).
thf(f67,plain,
( ( cQ = $true )
| ~ spl0_4 ),
inference(beta-eta_normalization,[],[f66]) ).
thf(f68,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f60]) ).
thf(f69,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f68]) ).
thf(f72,plain,
( ( $true = $false )
| ~ spl0_1
| ~ spl0_3 ),
inference(constrained_superposition,[],[f15,f24]) ).
thf(f78,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f72]) ).
thf(f79,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f78]) ).
thf(f81,plain,
( spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f67,f26,f22]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f20]) ).
cnf(s2,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f29]) ).
cnf(s4,plain,
( spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f49]) ).
cnf(s5,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f69]) ).
cnf(s8,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(sat_conversion,[],[f79]) ).
cnf(s10,plain,
( spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f81]) ).
cnf(s13,plain,
spl0_1,
inference(rat,[],[s5,s1,s4]) ).
cnf(s14,plain,
~ spl0_3,
inference(rat,[],[s8,s13]) ).
cnf(s16,plain,
~ spl0_4,
inference(rat,[],[s10,s14]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s2,s16,s14]) ).
thf(f84,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO371^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.07/0.18 % Computer : n007.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % 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:47:26 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 % (3628029)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (3628044)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1873927138:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.25 % (3628044) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3628029-3628044"...
% 0.07/0.25 % (3628044)...printing done.
% 0.07/0.25 % (3628044)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 % (3628044)------------------------------
% 0.07/0.25 % (3628044)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (3628044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (3628044)CaDiCaL version: 2.1.3
% 0.07/0.25 % (3628044)Termination reason: Refutation
% 0.07/0.25 % (3628044)Time elapsed: 0.002 s
% 0.07/0.25 % (3628044)Peak memory usage: 13 MB
% 0.07/0.25 % (3628044)Instructions burned: 2 (million)
% 0.07/0.25 % (3628029)Success in time 0.026 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------