%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : TIM035_1 : TPTP v9.3.1. Released v9.3.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 : Tue Sep 29 02:33:38 PM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 8 ( 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
interval: $tType ).
tff(func_def_0,type,
a: interval ).
tff(func_def_1,type,
b: interval ).
tff(func_def_2,type,
c: interval ).
tff(pred_def_1,type,
before: ( interval * interval ) > $o ).
tff(pred_def_2,type,
after: ( interval * interval ) > $o ).
tff(pred_def_3,type,
meets: ( interval * interval ) > $o ).
tff(pred_def_4,type,
met_by: ( interval * interval ) > $o ).
tff(pred_def_5,type,
overlaps: ( interval * interval ) > $o ).
tff(pred_def_6,type,
overlapped_by: ( interval * interval ) > $o ).
tff(pred_def_7,type,
starts: ( interval * interval ) > $o ).
tff(pred_def_8,type,
started_by: ( interval * interval ) > $o ).
tff(pred_def_9,type,
during: ( interval * interval ) > $o ).
tff(pred_def_10,type,
contains: ( interval * interval ) > $o ).
tff(pred_def_11,type,
finishes: ( interval * interval ) > $o ).
tff(pred_def_12,type,
finished_by: ( interval * interval ) > $o ).
tff(f3,axiom,
! [X0: interval,X1: interval] :
( overlaps(X0,X1)
<=> overlapped_by(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/TIM002_0.ax',overlaps_inverse) ).
tff(f9,axiom,
overlaps(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1) ).
tff(f12,conjecture,
overlapped_by(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
tff(f13,negated_conjecture,
~ overlapped_by(b,a),
inference(negated_conjecture,[status(cth)],[f12]) ).
tff(f14,plain,
~ overlapped_by(b,a),
inference(flattening,[],[f13]) ).
tff(f15,plain,
! [X0: interval,X1: interval] :
( overlaps(X0,X1)
=> overlapped_by(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
tff(f16,plain,
! [X0: interval,X1: interval] :
( overlapped_by(X1,X0)
| ~ overlaps(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
tff(f21,plain,
! [X0: interval,X1: interval] :
( overlapped_by(X1,X0)
| ~ overlaps(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tff(f24,plain,
overlaps(a,b),
inference(cnf_transformation,[],[f9]) ).
tff(f27,plain,
~ overlapped_by(b,a),
inference(cnf_transformation,[],[f14]) ).
tff(f28,plain,
~ overlaps(a,b),
inference(resolution,[],[f21,f27]) ).
tff(f29,plain,
$false,
inference(forward_subsumption_resolution,[],[f28,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : TIM035_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n001.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 18:53:48 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/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.20/0.27 % (623806)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (623815)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1737550948:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (623815) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-623806-623815"...
% 0.20/0.27 % (623815)...printing done.
% 0.20/0.27 % (623815)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (623815)------------------------------
% 0.20/0.27 % (623815)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (623815)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (623815)CaDiCaL version: 2.1.3
% 0.20/0.27 % (623815)Termination reason: Refutation
% 0.20/0.27 % (623815)Time elapsed: 0.001 s
% 0.20/0.27 % (623815)Peak memory usage: 11 MB
% 0.20/0.27 % (623806)Success in time 0.038 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------