%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO089^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 : n011.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:56 AM UTC 2026
% Result : Theorem 0.18s 0.26s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 394 ( 111 equ)
% Maximal formula atoms : 20 ( 20 avg)
% Number of connectives : 271 ( 118 ~; 78 |; 70 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 222 ( 222 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 4 usr; 6 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
t: $o ).
tff(func_def_1,type,
s: $o ).
tff(func_def_2,type,
q: $o ).
tff(func_def_3,type,
p: $o ).
tff(f1,conjecture,
( ( ~ t
| ~ s
| ~ q
| ~ ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) )
=> ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cDMG7) ).
tff(f2,negated_conjecture,
~ ( ( ~ t
| ~ s
| ~ q
| ~ ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) )
=> ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
tff(f3,plain,
~ ( ( ~ t
| ~ s
| ~ q
| ~ ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) )
=> ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
tff(f4,plain,
~ ( ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ~ ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) ) ) ) )
=> ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
tff(f5,plain,
~ ( ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ~ ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) ) ) ) )
=> ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) ) ) ) ) ) ),
inference(flattening,[],[f4]) ).
tff(f6,plain,
( ( t = $true )
& ( s = $true )
& ( q = $true )
& ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( ( t = $true )
& ( s = $true )
& ( q = $true )
& ( p = $true ) ) )
& ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( ( t = $true )
& ( s = $true )
& ( q = $true )
& ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( p != $true ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f7,plain,
( ( t = $true )
& ( s = $true )
& ( q = $true )
& ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( ( t = $true )
& ( s = $true )
& ( q = $true )
& ( p = $true ) ) )
& ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( ( t = $true )
& ( s = $true )
& ( q = $true )
& ( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( p != $true ) ) ) ) ),
inference(flattening,[],[f6]) ).
tff(f8,plain,
( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( t != $true )
| ( s != $true )
| ( q != $true )
| ( p != $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f12,plain,
( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( p = $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f16,plain,
q = $true,
inference(cnf_transformation,[],[f7]) ).
tff(f17,plain,
s = $true,
inference(cnf_transformation,[],[f7]) ).
tff(f18,plain,
t = $true,
inference(cnf_transformation,[],[f7]) ).
tff(f24,plain,
( ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( p = $true ) ),
inference(definition_unfolding,[],[f12,f18,f17,f16]) ).
tff(f28,plain,
( ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( p != $true ) ),
inference(definition_unfolding,[],[f8,f18,f17,f16,f18,f17,f16]) ).
tff(f29,plain,
( ( $true != $true )
| ( p != $true ) ),
inference(duplicate_literal_removal,[],[f28]) ).
tff(f30,plain,
p != $true,
inference(trivial_inequality_removal,[],[f29]) ).
tff(f34,plain,
( ( $true != $true )
| ( p = $true ) ),
inference(duplicate_literal_removal,[],[f24]) ).
tff(f35,plain,
p = $true,
inference(trivial_inequality_removal,[],[f34]) ).
tff(f39,plain,
$false,
inference(forward_subsumption_resolution,[],[f35,f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO089^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.08/0.19 % Computer : n011.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 16:33:31 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.22 Running first-order model finding
% 0.08/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.18/0.26 % (304779)Will run a generic schedule for satisfiability detection.
% 0.18/0.26 % (304795)dis+10_1_sil=32000:sp=arity:random_seed=2962816738:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.26 % (304795) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-304779-304795"...
% 0.18/0.26 % (304795)...printing done.
% 0.18/0.26 % (304795)Refutation found. Thanks to Tanya!
% 0.18/0.26 % SZS status Theorem for theBenchmark
% 0.18/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.26 % (304795)------------------------------
% 0.18/0.26 % (304795)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.26 % (304795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.26 % (304795)CaDiCaL version: 2.1.3
% 0.18/0.26 % (304795)Termination reason: Refutation
% 0.18/0.26 % (304795)Time elapsed: 0.001 s
% 0.18/0.26 % (304795)Peak memory usage: 11 MB
% 0.18/0.26 % (304795)Instructions burned: 1 (million)
% 0.18/0.26 % (304779)Success in time 0.03 s
% 0.18/0.26 % Vampire exiting
%------------------------------------------------------------------------------