%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO090^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 : n018.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.21s 0.29s
% Output : Refutation 0.21s
% 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 : 502 ( 141 equ)
% Maximal formula atoms : 26 ( 26 avg)
% Number of connectives : 351 ( 150 ~; 100 |; 96 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 282 ( 282 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
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) ) ) )
=> ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDMG8) ).
tff(f2,negated_conjecture,
~ ( ( ~ t
| ~ s
| ~ q
| ~ ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) ) ) )
=> ( ~ ( t
& s )
| ~ ( q
& ( ~ ( 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
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) ) ) ) )
=> ( ~ ( t
& s )
| ~ ( q
& ( ~ ( 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 )
& ( ~ ( ( 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 )
& ( ~ ( ( 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 )
& ( ~ ( ( 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 )
& ( ~ ( ( 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 )
& ( ( 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 )
| ( ( 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 )
& ( ( 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 )
| ( ( 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(f15,plain,
( ( t != $true )
| ( s != $true )
| ( q != $true )
| ( t != $true )
| ( s != $true )
| ( q != $true )
| ( p != $true ) ),
inference(cnf_transformation,[],[f7]) ).
tff(f19,plain,
q = $true,
inference(cnf_transformation,[],[f7]) ).
tff(f20,plain,
s = $true,
inference(cnf_transformation,[],[f7]) ).
tff(f21,plain,
t = $true,
inference(cnf_transformation,[],[f7]) ).
tff(f27,plain,
( ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( p != $true ) ),
inference(definition_unfolding,[],[f15,f21,f20,f19,f21,f20,f19]) ).
tff(f34,plain,
( ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( p = $true ) ),
inference(definition_unfolding,[],[f8,f21,f20,f19,f21,f20,f19]) ).
tff(f35,plain,
( ( $true != $true )
| ( p = $true ) ),
inference(duplicate_literal_removal,[],[f34]) ).
tff(f36,plain,
p = $true,
inference(trivial_inequality_removal,[],[f35]) ).
tff(f43,plain,
( ( $true != $true )
| ( p != $true ) ),
inference(duplicate_literal_removal,[],[f27]) ).
tff(f44,plain,
p != $true,
inference(trivial_inequality_removal,[],[f43]) ).
tff(f48,plain,
$false,
inference(forward_subsumption_resolution,[],[f44,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO090^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n018.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % 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 16:35:27 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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.21/0.29 % (299150)Will run a generic schedule for satisfiability detection.
% 0.21/0.29 % (299156)% WARNING: option uhcvi not known.
% 0.21/0.29 % (299156)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3614280870:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29 % (299158)dis+10_1_sil=32000:sp=arity:random_seed=138686648:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29 % (299157)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2463757130:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29 % (299155)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=961367885_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29 % (299157) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-299150-299157"...
% 0.21/0.29 % (299156) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-299150-299156"...
% 0.21/0.29 % (299158) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-299150-299158"...
% 0.21/0.29 % (299159)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2379414816:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29 % Detected minimum model sizes of [1]
% 0.21/0.29 % Detected maximum model sizes of [3]
% 0.21/0.29 % TRYING [1]
% 0.21/0.29 % TRYING [2]
% 0.21/0.29 % (299155) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-299150-299155"...
% 0.21/0.29 % (299156)...printing done.
% 0.21/0.29 % (299159) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-299150-299159"...
% 0.21/0.29 % (299158)...printing done.
% 0.21/0.29 % (299157)...printing done.
% 0.21/0.29 % (299158)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (299158)------------------------------
% 0.21/0.29 % (299158)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (299158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (299158)CaDiCaL version: 2.1.3
% 0.21/0.29 % (299158)Termination reason: Refutation
% 0.21/0.29 % (299158)Time elapsed: 0.002 s
% 0.21/0.29 % (299158)Peak memory usage: 11 MB
% 0.21/0.29 % (299158)Instructions burned: 2 (million)
% 0.21/0.29 % (299150)Success in time 0.036 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------