%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO504^1 : TPTP v9.3.1. Released v4.1.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 08:50:20 AM UTC 2026
% Result : Theorem 0.11s 0.23s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 30 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 294 ( 58 equ; 0 cnn)
% Maximal formula atoms : 10 ( 9 avg)
% Number of connectives : 154 ( 6 ~; 19 |; 28 &; 97 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
a: $o ).
thf(func_def_1,type,
b: $o ).
thf(func_def_2,type,
h: $o > $o > $o ).
thf(func_def_3,type,
i: $o > $o > $o ).
thf(func_def_4,type,
g: ( $o > $o > $o ) > $o ).
thf(func_def_5,type,
f: ( ( $o > $o > $o ) > $o ) > $o ).
thf(func_def_7,type,
vAND: $o > $o > $o ).
thf(func_def_8,type,
vOR: $o > $o > $o ).
thf(f1,conjecture,
( ( ( h @ a @ b )
& ( ( f @ g )
= ( i @ a @ b ) )
& ( ( ( i @ a @ b )
= b )
| a )
& ( ( h @ a @ b )
= b )
& a )
=> ( f @ g ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',claim) ).
thf(f2,negated_conjecture,
~ ( ( ( h @ a @ b )
& ( ( f @ g )
= ( i @ a @ b ) )
& ( ( ( i @ a @ b )
= b )
| a )
& ( ( h @ a @ b )
= b )
& a )
=> ( f @ g ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ( h @ a @ b )
& ( ( f @ g )
= ( i @ a @ b ) )
& ( ( ( i @ a @ b )
= b )
| a )
& ( ( h @ a @ b )
= b )
& a )
=> ( f @ g ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ( ( h @ a @ b )
= $true )
& ( ( i @ a @ b )
= ( f @ g ) )
& ( ( i @ a @ b )
= ( a
| b ) )
& ( ( h @ a @ b )
= ( a
& b ) ) )
=> ( ( f @ g )
= $true ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ( f @ g )
!= $true )
& ( ( h @ a @ b )
= $true )
& ( ( i @ a @ b )
= ( f @ g ) )
& ( ( i @ a @ b )
= ( a
| b ) )
& ( ( h @ a @ b )
= ( a
& b ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ( f @ g )
!= $true )
& ( ( h @ a @ b )
= $true )
& ( ( i @ a @ b )
= ( f @ g ) )
& ( ( i @ a @ b )
= ( a
| b ) )
& ( ( h @ a @ b )
= ( a
& b ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ( h @ a @ b )
= ( a
& b ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f8,plain,
( ( i @ a @ b )
= ( a
| b ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f9,plain,
( ( i @ a @ b )
= ( f @ g ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f10,plain,
( ( h @ a @ b )
= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f11,plain,
( ( f @ g )
!= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f15,plain,
( ( ( h @ a @ b )
= $false )
| ( ( a
& b )
= $true ) ),
inference(iff_proxy_clausification,[],[f7]) ).
thf(f16,plain,
( ( ( h @ a @ b )
= $false )
| ( b = $true ) ),
inference(and_proxy_clausification,[],[f15]) ).
thf(f17,plain,
( ( ( h @ a @ b )
= $false )
| ( a = $true ) ),
inference(and_proxy_clausification,[],[f15]) ).
thf(f19,plain,
( ( ( i @ a @ b )
= $true )
| ( ( a
| b )
= $false ) ),
inference(iff_proxy_clausification,[],[f8]) ).
thf(f22,plain,
( ( ( i @ a @ b )
= $true )
| ( b = $false ) ),
inference(or_proxy_clausification,[],[f19]) ).
thf(f25,plain,
( ( ( i @ a @ b )
= $false )
| ( ( f @ g )
= $true ) ),
inference(iff_proxy_clausification,[],[f9]) ).
thf(f26,plain,
( ( $true = $false )
| ( b = $true ) ),
inference(forward_demodulation,[],[f16,f10]) ).
thf(f27,plain,
b = $true,
inference(trivial_inequality_removal,[],[f26]) ).
thf(f29,plain,
( ( $true = $false )
| ( a = $true ) ),
inference(forward_demodulation,[],[f17,f10]) ).
thf(f30,plain,
a = $true,
inference(trivial_inequality_removal,[],[f29]) ).
thf(f34,plain,
( ( $true
= ( i @ $true @ b ) )
| ( b = $false ) ),
inference(forward_demodulation,[],[f22,f30]) ).
thf(f35,plain,
( ( $true
= ( i @ $true @ $true ) )
| ( b = $false ) ),
inference(forward_demodulation,[],[f34,f27]) ).
thf(f36,plain,
( ( $true = $false )
| ( $true
= ( i @ $true @ $true ) ) ),
inference(forward_demodulation,[],[f35,f27]) ).
thf(f37,plain,
( $true
= ( i @ $true @ $true ) ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f42,plain,
( ( i @ a @ b )
= $false ),
inference(forward_subsumption_resolution,[],[f25,f11]) ).
thf(f43,plain,
( $false
= ( i @ $true @ b ) ),
inference(forward_demodulation,[],[f42,f30]) ).
thf(f44,plain,
( $false
= ( i @ $true @ $true ) ),
inference(forward_demodulation,[],[f43,f27]) ).
thf(f46,plain,
$true = $false,
inference(constrained_superposition,[],[f37,f44]) ).
thf(f47,plain,
$false,
inference(trivial_inequality_removal,[],[f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO504^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.16 % Computer : n001.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Tue Sep 29 17:17:21 UTC 2026
% 0.11/0.16 % CPUTime :
% 0.11/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 Running first-order model finding
% 0.11/0.19 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.11/0.23 % (1537620)Will run a generic schedule for satisfiability detection.
% 0.11/0.23 % (1537627)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=494827943:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.23 % (1537627) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1537620-1537627"...
% 0.11/0.23 % (1537627)...printing done.
% 0.11/0.23 % (1537626)% WARNING: option uhcvi not known.
% 0.11/0.23 % (1537627)Refutation found. Thanks to Tanya!
% 0.11/0.23 % SZS status Theorem for theBenchmark
% 0.11/0.23 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.23 % (1537627)------------------------------
% 0.11/0.23 % (1537627)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.23 % (1537627)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.23 % (1537627)CaDiCaL version: 2.1.3
% 0.11/0.23 % (1537627)Termination reason: Refutation
% 0.11/0.23 % (1537627)Time elapsed: 0.002 s
% 0.11/0.23 % (1537627)Peak memory usage: 12 MB
% 0.11/0.23 % (1537627)Instructions burned: 3 (million)
% 0.11/0.23 % (1537620)Success in time 0.029 s
% 0.11/0.23 % Vampire exiting
%------------------------------------------------------------------------------