%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LAT273-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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 11:48:09 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 31 ( 15 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-4 aty)
% Number of variables : 15 ( 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1,X4,X5] :
( ~ c_lessequals(X1,c_Tarski_Ointerval(X3,X4,X5,X2),tc_set(X2))
| ~ c_in(X0,X1,X2)
| c_in(c_Pair(X0,X5,X2,X2),X3,tc_prod(X2,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ~ c_Tarski_OisLub(X0,v_cl,X1,t_a)
| ~ c_in(X2,v_A,t_a)
| c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(v_sko__4mi(X0,v_r,X2),X0,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0) ).
fof(f3,axiom,
! [X2,X0,X1] :
( ~ c_Tarski_OisLub(X0,v_cl,X1,t_a)
| ~ c_in(X2,v_A,t_a)
| ~ c_in(c_Pair(v_sko__4mi(X0,v_r,X2),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1) ).
fof(f4,negated_conjecture,
c_in(v_b,v_A,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f5,negated_conjecture,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f6,negated_conjecture,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
fof(f7,negated_conjecture,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
fof(f8,plain,
! [X0] :
( c_in(c_Pair(X0,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(X0,v_S,t_a) ),
inference(resolution,[],[f1,f5]) ).
fof(f9,plain,
! [X0] :
( c_in(c_Pair(v_L,X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(X0,v_A,t_a)
| c_in(v_sko__4mi(v_S,v_r,X0),v_S,t_a) ),
inference(resolution,[],[f2,f6]) ).
fof(f11,plain,
! [X0] :
( ~ c_in(c_Pair(v_sko__4mi(v_S,v_r,X0),X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(X0,v_A,t_a)
| c_in(c_Pair(v_L,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(resolution,[],[f3,f6]) ).
fof(f14,plain,
( ~ c_in(v_b,v_A,t_a)
| c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a) ),
inference(resolution,[],[f11,f8]) ).
fof(f15,plain,
( ~ c_in(v_b,v_A,t_a)
| c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(forward_subsumption_resolution,[],[f14,f9]) ).
fof(f16,plain,
c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(forward_subsumption_resolution,[],[f15,f4]) ).
fof(f17,plain,
$false,
inference(forward_subsumption_resolution,[],[f16,f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT273-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 14:10:09 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.11/0.44 % (1251736)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (1251745)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4201541393:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.44 % (1251745) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1251736-1251745"...
% 0.11/0.44 % (1251745)...printing done.
% 0.11/0.44 % (1251745)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (1251745)------------------------------
% 0.11/0.44 % (1251745)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (1251745)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (1251745)CaDiCaL version: 2.1.3
% 0.11/0.44 % (1251745)Termination reason: Refutation
% 0.11/0.44 % (1251745)Time elapsed: 0.001 s
% 0.11/0.44 % (1251745)Peak memory usage: 11 MB
% 0.11/0.44 % (1251745)Instructions burned: 1 (million)
% 0.11/0.44 % (1251736)Success in time 0.025 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------