%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET005-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:42:31 PM UTC 2026
% Result : Unsatisfiable 0.05s 10.48s
% Output : Refutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 65 ( 9 unt; 3 def)
% Number of atoms : 149 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 155 ( 71 ~; 81 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X2,X3,X0,X1] :
( ~ intersection(X0,X1,X2)
| ~ member(X3,X2)
| member(X3,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set1) ).
fof(f8,axiom,
! [X2,X3,X0,X1] :
( ~ intersection(X0,X1,X2)
| ~ member(X3,X2)
| member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set2) ).
fof(f9,axiom,
! [X2,X3,X0,X1] :
( ~ intersection(X0,X1,X2)
| ~ member(X3,X1)
| ~ member(X3,X0)
| member(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_both_is_member_of_intersection) ).
fof(f10,axiom,
! [X2,X0,X1] :
( intersection(X0,X1,X2)
| member(h(X0,X1,X2),X2)
| member(h(X0,X1,X2),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom1) ).
fof(f11,axiom,
! [X2,X0,X1] :
( intersection(X0,X1,X2)
| member(h(X0,X1,X2),X2)
| member(h(X0,X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom2) ).
fof(f12,axiom,
! [X2,X0,X1] :
( intersection(X0,X1,X2)
| ~ member(h(X0,X1,X2),X1)
| ~ member(h(X0,X1,X2),X0)
| ~ member(h(X0,X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom3) ).
fof(f13,axiom,
intersection(a,b,aIb),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_intersection_b) ).
fof(f14,axiom,
intersection(b,c,bIc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_intersection_c) ).
fof(f15,axiom,
intersection(a,bIc,aIbIc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_intersection_bIc) ).
fof(f16,negated_conjecture,
~ intersection(aIb,c,aIbIc),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_aIb_intersection_c_is_aIbIc) ).
fof(f19,plain,
! [X0] :
( ~ member(X0,aIb)
| member(X0,a) ),
inference(resolution,[],[f7,f13]) ).
fof(f20,plain,
! [X0] :
( ~ member(X0,aIbIc)
| member(X0,a) ),
inference(resolution,[],[f7,f15]) ).
fof(f21,plain,
! [X0] :
( ~ member(X0,bIc)
| member(X0,b) ),
inference(resolution,[],[f7,f14]) ).
fof(f22,plain,
! [X0] :
( ~ member(X0,aIb)
| member(X0,b) ),
inference(resolution,[],[f8,f13]) ).
fof(f23,plain,
! [X0] :
( ~ member(X0,aIbIc)
| member(X0,bIc) ),
inference(resolution,[],[f8,f15]) ).
fof(f24,plain,
! [X0] :
( ~ member(X0,bIc)
| member(X0,c) ),
inference(resolution,[],[f8,f14]) ).
fof(f25,plain,
! [X0] :
( member(X0,aIb)
| ~ member(X0,a)
| ~ member(X0,b) ),
inference(resolution,[],[f9,f13]) ).
fof(f26,plain,
! [X0] :
( member(X0,aIbIc)
| ~ member(X0,a)
| ~ member(X0,bIc) ),
inference(resolution,[],[f9,f15]) ).
fof(f27,plain,
! [X0] :
( member(X0,bIc)
| ~ member(X0,b)
| ~ member(X0,c) ),
inference(resolution,[],[f9,f14]) ).
fof(f28,plain,
( member(h(aIb,c,aIbIc),aIbIc)
| member(h(aIb,c,aIbIc),aIb) ),
inference(resolution,[],[f10,f16]) ).
fof(f33,definition,
( spl0_1
<=> member(h(aIb,c,aIbIc),aIb) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f34,plain,
( ~ member(h(aIb,c,aIbIc),aIb)
| spl0_1 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f35,plain,
( member(h(aIb,c,aIbIc),aIb)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f37,definition,
( spl0_2
<=> member(h(aIb,c,aIbIc),aIbIc) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f38,plain,
( ~ member(h(aIb,c,aIbIc),aIbIc)
| spl0_2 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f39,plain,
( member(h(aIb,c,aIbIc),aIbIc)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f40,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f28,f37,f33]) ).
fof(f41,plain,
( member(h(aIb,c,aIbIc),a)
| ~ spl0_2 ),
inference(resolution,[],[f39,f20]) ).
fof(f42,plain,
( member(h(aIb,c,aIbIc),aIbIc)
| member(h(aIb,c,aIbIc),c) ),
inference(resolution,[],[f11,f16]) ).
fof(f46,plain,
( ~ member(h(aIb,c,aIbIc),c)
| ~ member(h(aIb,c,aIbIc),aIb)
| ~ member(h(aIb,c,aIbIc),aIbIc) ),
inference(resolution,[],[f12,f16]) ).
fof(f50,plain,
( ~ member(h(aIb,c,aIbIc),c)
| ~ member(h(aIb,c,aIbIc),aIb)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f46,f39]) ).
fof(f52,definition,
( spl0_3
<=> member(h(aIb,c,aIbIc),c) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f53,plain,
( member(h(aIb,c,aIbIc),c)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f54,plain,
( ~ member(h(aIb,c,aIbIc),c)
| spl0_3 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f55,plain,
( ~ spl0_1
| ~ spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f50,f37,f52,f33]) ).
fof(f56,plain,
( member(h(aIb,c,aIbIc),bIc)
| ~ spl0_2 ),
inference(resolution,[],[f23,f39]) ).
fof(f57,plain,
( member(h(aIb,c,aIbIc),c)
| ~ spl0_2 ),
inference(resolution,[],[f56,f24]) ).
fof(f58,plain,
( member(h(aIb,c,aIbIc),b)
| ~ spl0_2 ),
inference(resolution,[],[f56,f21]) ).
fof(f59,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f57,f37,f52]) ).
fof(f62,plain,
( ~ member(h(aIb,c,aIbIc),a)
| ~ member(h(aIb,c,aIbIc),b)
| spl0_1 ),
inference(resolution,[],[f25,f34]) ).
fof(f63,plain,
( ~ member(h(aIb,c,aIbIc),b)
| spl0_1
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f62,f41]) ).
fof(f64,plain,
( $false
| spl0_1
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f63,f58]) ).
fof(f65,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f66,plain,
( member(h(aIb,c,aIbIc),b)
| ~ spl0_1 ),
inference(resolution,[],[f35,f22]) ).
fof(f67,plain,
( member(h(aIb,c,aIbIc),a)
| ~ spl0_1 ),
inference(resolution,[],[f35,f19]) ).
fof(f70,plain,
( ~ member(h(aIb,c,aIbIc),a)
| ~ member(h(aIb,c,aIbIc),bIc)
| spl0_2 ),
inference(resolution,[],[f26,f38]) ).
fof(f71,plain,
( ~ member(h(aIb,c,aIbIc),bIc)
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f70,f67]) ).
fof(f74,plain,
( ~ member(h(aIb,c,aIbIc),b)
| ~ member(h(aIb,c,aIbIc),c)
| ~ spl0_1
| spl0_2 ),
inference(resolution,[],[f71,f27]) ).
fof(f75,plain,
( ~ member(h(aIb,c,aIbIc),c)
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f74,f66]) ).
fof(f76,plain,
( $false
| ~ spl0_1
| spl0_2
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f75,f53]) ).
fof(f77,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f76]) ).
fof(f78,plain,
( member(h(aIb,c,aIbIc),c)
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f42,f38]) ).
fof(f79,plain,
( $false
| spl0_2
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f78,f54]) ).
fof(f80,plain,
( spl0_2
| spl0_3 ),
inference(avatar_contradiction_clause,[],[f79]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f40]) ).
cnf(s2,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f55]) ).
cnf(s3,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f59]) ).
cnf(s4,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f65]) ).
cnf(s5,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f77]) ).
cnf(s6,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f80]) ).
cnf(s7,plain,
spl0_1,
inference(rat,[],[s1,s4]) ).
cnf(s8,plain,
spl0_2,
inference(rat,[],[s5,s6,s7]) ).
cnf(s9,plain,
spl0_3,
inference(rat,[],[s3,s8]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s2,s7,s9,s8]) ).
fof(f81,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/10.40 % Computer : n004.cluster.edu
% 0.13/10.40 % Model : x86_64 x86_64
% 0.13/10.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.40 % Memory : 8046.5625MB
% 0.13/10.40 % OS : Linux 6.8.0-71-generic
% 0.05/10.40 % CPULimit : 300
% 0.05/10.40 % WCLimit : 300
% 0.05/10.40 % DateTime : Mon Sep 28 00:03:03 UTC 2026
% 0.05/10.40 % CPUTime :
% 0.05/10.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/10.43 Running first-order model finding
% 0.05/10.43 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.05/10.48 % (4019999)Will run a generic schedule for satisfiability detection.
% 0.05/10.48 % (4020009)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4039056832:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.05/10.48 % (4020005)% WARNING: option uhcvi not known.
% 0.05/10.48 % (4020004)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1617449489_2999 on theBenchmark for (2999ds/0Mi)
% 0.05/10.48 % (4020010)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=564313884:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.05/10.48 % (4020006)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4113403003:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.05/10.48 % (4020005)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1232676067:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.05/10.48 % (4020007)dis+10_1_sil=32000:sp=arity:random_seed=1958383717:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.05/10.48 % (4020008)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3705998935:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.05/10.48 % TRYING [1]
% 0.05/10.48 % TRYING [2]
% 0.05/10.48 % TRYING [3]
% 0.05/10.48 % (4020008) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4019999-4020008"...
% 0.05/10.48 % (4020008)...printing done.
% 0.05/10.48 % (4020008)Refutation found. Thanks to Tanya!
% 0.05/10.48 % SZS status Unsatisfiable for theBenchmark
% 0.05/10.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.05/10.48 % (4020008)------------------------------
% 0.05/10.48 % (4020008)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.05/10.48 % (4020008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.05/10.48 % (4020008)CaDiCaL version: 2.1.3
% 0.05/10.48 % (4020008)Termination reason: Refutation
% 0.05/10.48 % (4020008)Time elapsed: 0.003 s
% 0.05/10.48 % (4020008)Peak memory usage: 12 MB
% 0.05/10.48 % (4020008)Instructions burned: 3 (million)
% 0.05/10.48 % (4019999)Success in time 0.036 s
% 0.05/10.48 % Vampire exiting
%------------------------------------------------------------------------------