%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : CSR126_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n015.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 : Tue Sep 29 09:45:58 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 62 ( 14 unt; 0 typ; 8 def)
% Number of atoms : 213 ( 0 equ)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 122 ( 57 ~; 56 |; 0 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 86 ( 86 fml; 0 var)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 14 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
num: $tType ).
tff(pred_def_1,type,
holdsDuring_THFTYPE_IiooI: ( $i * $o ) > $o ).
tff(f1,axiom,
! [X0: $i] : holdsDuring_THFTYPE_IiooI(X0,likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).
tff(f2,axiom,
! [X0: $i] :
holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),
( likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0)
=> likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0) )),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_001) ).
tff(f3,conjecture,
holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(f4,negated_conjecture,
~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)),
inference(negated_conjecture,[status(cth)],[f3]) ).
tff(f5,plain,
~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)),
inference(flattening,[],[f4]) ).
tff(f6,plain,
! [X0: $i] :
holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),
( likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
| ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) )),
inference(ennf_transformation,[],[f2]) ).
tff(f8,plain,
! [X0: $i] :
( likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
| holdsDuring_THFTYPE_IiooI(X0,$false) ),
inference(cnf_transformation,[],[f1]) ).
tff(f9,plain,
! [X0: $i] :
( ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0)
| likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
| holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false) ),
inference(cnf_transformation,[],[f6]) ).
tff(f10,plain,
! [X0: $i] :
( likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0)
| holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true) ),
inference(cnf_transformation,[],[f6]) ).
tff(f11,plain,
! [X0: $i] :
( ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
| holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true) ),
inference(cnf_transformation,[],[f6]) ).
tff(f12,plain,
( ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
| ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true) ),
inference(cnf_transformation,[],[f5]) ).
tff(f13,plain,
( likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
| ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false) ),
inference(cnf_transformation,[],[f5]) ).
tff(f17,definition,
( spl0_1
<=> holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
tff(f21,definition,
( spl0_2
<=> likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
tff(f22,plain,
( likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f21]) ).
tff(f23,plain,
( ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
| spl0_2 ),
inference(avatar_component_clause,[],[f21]) ).
tff(f24,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f12,f21,f17]) ).
tff(f26,definition,
( spl0_3
<=> holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
tff(f28,plain,
( ~ holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)
| spl0_3 ),
inference(avatar_component_clause,[],[f26]) ).
tff(f29,plain,
( ~ spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f13,f21,f26]) ).
tff(f31,definition,
( spl0_4
<=> ! [X0: $i] :
( ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0)
| likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
tff(f32,plain,
( ! [X0: $i] :
( likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
| ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f31]) ).
tff(f33,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f9,f31,f26]) ).
tff(f35,definition,
( spl0_5
<=> ! [X0: $i] : likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
tff(f36,plain,
( ! [X0: $i] : likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f35]) ).
tff(f37,plain,
( spl0_1
| spl0_5 ),
inference(avatar_split_clause,[],[f10,f35,f17]) ).
tff(f39,definition,
( spl0_6
<=> ! [X0: $i] : ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
tff(f40,plain,
( ! [X0: $i] : ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f39]) ).
tff(f41,plain,
( spl0_1
| spl0_6 ),
inference(avatar_split_clause,[],[f11,f39,f17]) ).
tff(f46,definition,
( spl0_8
<=> likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
tff(f47,plain,
( likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f46]) ).
tff(f51,definition,
( spl0_9
<=> ! [X0: $i] : holdsDuring_THFTYPE_IiooI(X0,$false) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
tff(f52,plain,
( ! [X0: $i] : holdsDuring_THFTYPE_IiooI(X0,$false)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f51]) ).
tff(f53,plain,
( spl0_9
| spl0_8 ),
inference(avatar_split_clause,[],[f8,f46,f51]) ).
tff(f54,plain,
( $false
| ~ spl0_2
| ~ spl0_6 ),
inference(resolution,[],[f40,f22]) ).
tff(f55,plain,
( ~ spl0_2
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f54]) ).
tff(f56,plain,
( ! [X0: $i] : likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
| ~ spl0_4
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f32,f36]) ).
tff(f57,plain,
( $false
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f56,f40]) ).
tff(f58,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f57]) ).
tff(f62,plain,
( $false
| spl0_3
| ~ spl0_9 ),
inference(resolution,[],[f52,f28]) ).
tff(f63,plain,
( spl0_3
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f62]) ).
tff(f64,plain,
( ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
| spl0_2
| ~ spl0_4 ),
inference(resolution,[],[f32,f23]) ).
tff(f65,plain,
( $false
| spl0_2
| ~ spl0_4
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f64,f47]) ).
tff(f66,plain,
( spl0_2
| ~ spl0_4
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[],[f65]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f24]) ).
cnf(s2,plain,
( spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f29]) ).
cnf(s3,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f33]) ).
cnf(s4,plain,
( spl0_1
| spl0_5 ),
inference(sat_conversion,[],[f37]) ).
cnf(s5,plain,
( spl0_1
| spl0_6 ),
inference(sat_conversion,[],[f41]) ).
cnf(s7,plain,
( spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f53]) ).
cnf(s8,plain,
( ~ spl0_2
| ~ spl0_6 ),
inference(sat_conversion,[],[f55]) ).
cnf(s9,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f58]) ).
cnf(s11,plain,
( spl0_3
| ~ spl0_9 ),
inference(sat_conversion,[],[f63]) ).
cnf(s12,plain,
( spl0_2
| ~ spl0_4
| ~ spl0_8 ),
inference(sat_conversion,[],[f66]) ).
cnf(s13,plain,
spl0_1,
inference(rat,[],[s3,s2,s9,s8,s4,s5]) ).
cnf(s14,plain,
~ spl0_2,
inference(rat,[],[s1,s13]) ).
cnf(s15,plain,
~ spl0_3,
inference(rat,[],[s2,s14]) ).
cnf(s16,plain,
~ spl0_9,
inference(rat,[],[s11,s15]) ).
cnf(s17,plain,
spl0_4,
inference(rat,[],[s3,s15]) ).
cnf(s18,plain,
spl0_8,
inference(rat,[],[s7,s16]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s12,s14,s18,s17]) ).
tff(f67,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR126_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n015.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.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 23:38:32 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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 % (3142541)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (3142551)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=654139723:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.25 % (3142551) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3142541-3142551"...
% 0.07/0.25 % (3142551)...printing done.
% 0.07/0.25 % (3142551)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 % (3142551)------------------------------
% 0.07/0.25 % (3142551)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (3142551)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (3142551)CaDiCaL version: 2.1.3
% 0.07/0.25 % (3142551)Termination reason: Refutation
% 0.07/0.25 % (3142551)Time elapsed: 0.001 s
% 0.07/0.25 % (3142551)Peak memory usage: 12 MB
% 0.07/0.25 % (3142551)Instructions burned: 1 (million)
% 0.07/0.25 % (3142541)Success in time 0.029 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------