%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET860-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 : n013.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 12:44:52 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.46s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 8 unt; 2 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 98 ( 44 ~; 52 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
~ c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f2,negated_conjecture,
~ c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3,negated_conjecture,
! [X0] :
( ~ c_in(X0,v_C,tc_set(t_a))
| c_lessequals(X0,v_A,tc_set(t_a))
| c_lessequals(v_B,X0,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f14,axiom,
! [X2,X0,X1] :
( c_in(c_Main_OUnionE__1(X0,X1,X2),X1,tc_set(X2))
| ~ c_in(X0,c_Union(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnionE_0) ).
fof(f15,axiom,
! [X2,X0,X1] :
( c_in(X0,c_Main_OUnionE__1(X0,X1,X2),X2)
| ~ c_in(X0,c_Union(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnionE_1) ).
fof(f16,axiom,
! [X2,X3,X0,X1] :
( ~ c_in(X1,X3,tc_set(X2))
| ~ c_in(X0,X1,X2)
| c_in(X0,c_Union(X3,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnionI_0) ).
fof(f21,axiom,
! [X2,X3,X0,X1] :
( ~ c_lessequals(X1,X3,tc_set(X2))
| ~ c_in(X0,X1,X2)
| c_in(X0,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).
fof(f22,axiom,
! [X2,X0,X1] :
( c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
fof(f23,axiom,
! [X2,X0,X1] :
( ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2)
| c_lessequals(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).
fof(f43,plain,
! [X0] :
( c_lessequals(c_Main_OUnionE__1(X0,v_C,t_a),v_A,tc_set(t_a))
| ~ c_in(X0,c_Union(v_C,t_a),t_a)
| c_lessequals(v_B,c_Main_OUnionE__1(X0,v_C,t_a),tc_set(t_a)) ),
inference(resolution,[],[f14,f3]) ).
fof(f49,plain,
! [X0,X1] :
( ~ c_in(X1,c_Main_OUnionE__1(X0,v_C,t_a),t_a)
| c_lessequals(v_B,c_Main_OUnionE__1(X0,v_C,t_a),tc_set(t_a))
| ~ c_in(X0,c_Union(v_C,t_a),t_a)
| c_in(X1,v_A,t_a) ),
inference(resolution,[],[f43,f21]) ).
fof(f54,plain,
! [X0] :
( c_lessequals(v_B,c_Main_OUnionE__1(X0,v_C,t_a),tc_set(t_a))
| ~ c_in(X0,c_Union(v_C,t_a),t_a)
| c_in(X0,v_A,t_a)
| ~ c_in(X0,c_Union(v_C,t_a),t_a) ),
inference(resolution,[],[f49,f15]) ).
fof(f56,plain,
! [X0] :
( c_lessequals(v_B,c_Main_OUnionE__1(X0,v_C,t_a),tc_set(t_a))
| ~ c_in(X0,c_Union(v_C,t_a),t_a)
| c_in(X0,v_A,t_a) ),
inference(duplicate_literal_removal,[],[f54]) ).
fof(f61,plain,
! [X0,X1] :
( c_in(X1,c_Main_OUnionE__1(X0,v_C,t_a),t_a)
| c_in(X0,v_A,t_a)
| ~ c_in(X1,v_B,t_a)
| ~ c_in(X0,c_Union(v_C,t_a),t_a) ),
inference(resolution,[],[f56,f21]) ).
fof(f76,plain,
! [X2,X3,X0,X1] :
( ~ c_in(X0,c_Main_OUnionE__1(X1,X2,X3),X3)
| c_in(X0,c_Union(X2,X3),X3)
| ~ c_in(X1,c_Union(X2,X3),X3) ),
inference(resolution,[],[f16,f14]) ).
fof(f273,plain,
! [X0,X1] :
( c_in(X0,c_Union(v_C,t_a),t_a)
| ~ c_in(X1,c_Union(v_C,t_a),t_a)
| c_in(X1,v_A,t_a)
| ~ c_in(X0,v_B,t_a)
| ~ c_in(X1,c_Union(v_C,t_a),t_a) ),
inference(resolution,[],[f76,f61]) ).
fof(f279,plain,
! [X0,X1] :
( c_in(X0,c_Union(v_C,t_a),t_a)
| ~ c_in(X1,c_Union(v_C,t_a),t_a)
| c_in(X1,v_A,t_a)
| ~ c_in(X0,v_B,t_a) ),
inference(duplicate_literal_removal,[],[f273]) ).
fof(f282,definition,
( spl0_1
<=> ! [X1] :
( ~ c_in(X1,c_Union(v_C,t_a),t_a)
| c_in(X1,v_A,t_a) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f283,plain,
( ! [X1] :
( ~ c_in(X1,c_Union(v_C,t_a),t_a)
| c_in(X1,v_A,t_a) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f282]) ).
fof(f285,definition,
( spl0_2
<=> ! [X0] :
( c_in(X0,c_Union(v_C,t_a),t_a)
| ~ c_in(X0,v_B,t_a) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f286,plain,
( ! [X0] :
( c_in(X0,c_Union(v_C,t_a),t_a)
| ~ c_in(X0,v_B,t_a) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f285]) ).
fof(f287,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f279,f285,f282]) ).
fof(f290,plain,
( ! [X0] :
( ~ c_in(c_Main_OsubsetI__1(X0,c_Union(v_C,t_a),t_a),v_B,t_a)
| c_lessequals(X0,c_Union(v_C,t_a),tc_set(t_a)) )
| ~ spl0_2 ),
inference(resolution,[],[f286,f23]) ).
fof(f300,plain,
( c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a))
| c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a))
| ~ spl0_2 ),
inference(resolution,[],[f290,f22]) ).
fof(f305,plain,
( c_lessequals(v_B,c_Union(v_C,t_a),tc_set(t_a))
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f300]) ).
fof(f306,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f305,f2]) ).
fof(f307,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f306]) ).
fof(f313,plain,
( ! [X0] :
( c_in(c_Main_OsubsetI__1(c_Union(v_C,t_a),X0,t_a),v_A,t_a)
| c_lessequals(c_Union(v_C,t_a),X0,tc_set(t_a)) )
| ~ spl0_1 ),
inference(resolution,[],[f283,f22]) ).
fof(f323,plain,
( c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a))
| c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a))
| ~ spl0_1 ),
inference(resolution,[],[f313,f23]) ).
fof(f330,plain,
( c_lessequals(c_Union(v_C,t_a),v_A,tc_set(t_a))
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f323]) ).
fof(f331,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f330,f1]) ).
fof(f332,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f331]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f287]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f307]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f332]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f333,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET860-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.09/0.37 % Computer : n013.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 03:01:21 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41 Running first-order model finding
% 0.09/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.15/0.46 % (765370)Will run a generic schedule for satisfiability detection.
% 0.15/0.46 % (765380)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=768321391:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.46 % (765376)% WARNING: option uhcvi not known.
% 0.15/0.46 % (765375)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4048237232_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.46 % (765377)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=741047471:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.46 % (765381)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3388427637:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.46 % (765378)dis+10_1_sil=32000:sp=arity:random_seed=2335132992:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.46 % (765379)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3966025535:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.46 % (765376)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3038760980:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.46 % TRYING [1]
% 0.15/0.46 % TRYING [2]
% 0.15/0.46 % TRYING [3]
% 0.15/0.46 % TRYING [4]
% 0.15/0.46 % (765378) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-765370-765378"...
% 0.15/0.46 % (765378)...printing done.
% 0.15/0.46 % (765378)Refutation found. Thanks to Tanya!
% 0.15/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46 % (765378)------------------------------
% 0.15/0.46 % (765378)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.46 % (765378)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.46 % (765378)CaDiCaL version: 2.1.3
% 0.15/0.46 % (765378)Termination reason: Refutation
% 0.15/0.46 % (765378)Time elapsed: 0.013 s
% 0.15/0.46 % (765378)Peak memory usage: 12 MB
% 0.15/0.46 % (765378)Instructions burned: 17 (million)
% 0.15/0.46 % (765370)Success in time 0.046 s
% 0.15/0.46 % Vampire exiting
%------------------------------------------------------------------------------