%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET843-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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 12:42:06 PM UTC 2026
% Result : Unsatisfiable 2.65s 1.32s
% Output : Refutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 7 unt; 2 def)
% Number of atoms : 107 ( 23 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 120 ( 58 ~; 60 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( c_lessequals(X0,c_Union(X1,X2),tc_set(X2))
| ~ c_in(X0,X1,tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnion__upper_0) ).
fof(f2,axiom,
! [X2,X0,X1] :
( ~ c_lessequals(X0,X1,tc_set(X2))
| ~ c_lessequals(X1,X0,tc_set(X2))
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
fof(f3,plain,
! [X2,X0,X1] :
( ~ c_lessequals(X0,X1,tc_set(X2))
| ~ c_lessequals(X1,X0,tc_set(X2))
| X0 = X1 ),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).
fof(f5,axiom,
! [X2,X0,X1] : c_lessequals(X0,c_Zorn_Osucc(X1,X0,X2),tc_set(tc_set(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OAbrial__axiom1_0) ).
fof(f6,axiom,
! [X2,X0,X1] :
( c_in(c_Zorn_Osucc(X1,X0,X2),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin_OsuccI_0) ).
fof(f7,axiom,
! [X2,X0,X1] :
( c_in(c_Union(X0,tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| ~ c_lessequals(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(tc_set(X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).
fof(f8,axiom,
! [X2,X3,X0,X1] :
( ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X3,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| X0 != c_Zorn_Osucc(X1,X0,X2)
| c_lessequals(X3,X0,tc_set(tc_set(X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Oeq__succ__upper_0) ).
fof(f9,plain,
! [X2,X3,X0,X1] :
( c_Zorn_Osucc(X1,X0,X2) != X0
| ~ c_in(X3,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| c_lessequals(X3,X0,tc_set(tc_set(X2))) ),
inference(reorient_equations,[],[f8]) ).
fof(f10,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f11,negated_conjecture,
( v_m != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))
| v_m != c_Zorn_Osucc(v_S,v_m,t_a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f12,negated_conjecture,
( v_m = c_Zorn_Osucc(v_S,v_m,t_a)
| v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f14,definition,
( spl0_1
<=> v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f15,plain,
( v_m != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))
| spl0_1 ),
inference(avatar_component_clause,[],[f14]) ).
fof(f16,plain,
( v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f14]) ).
fof(f18,definition,
( spl0_2
<=> v_m = c_Zorn_Osucc(v_S,v_m,t_a) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f19,plain,
( v_m != c_Zorn_Osucc(v_S,v_m,t_a)
| spl0_2 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f20,plain,
( v_m = c_Zorn_Osucc(v_S,v_m,t_a)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f21,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f12,f18,f14]) ).
fof(f22,plain,
( ~ spl0_2
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f11,f14,f18]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ c_lessequals(c_Zorn_Osucc(X0,X1,X2),X1,tc_set(tc_set(X2)))
| c_Zorn_Osucc(X0,X1,X2) = X1 ),
inference(resolution,[],[f3,f5]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ c_lessequals(c_Union(X0,X1),X2,tc_set(X1))
| c_Union(X0,X1) = X2
| ~ c_in(X2,X0,tc_set(X1)) ),
inference(resolution,[],[f3,f1]) ).
fof(f33,plain,
( ! [X0] :
( v_m != v_m
| ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_lessequals(X0,v_m,tc_set(tc_set(t_a))) )
| ~ spl0_2 ),
inference(superposition,[],[f9,f20]) ).
fof(f34,plain,
( ! [X0] :
( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_lessequals(X0,v_m,tc_set(tc_set(t_a))) )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f33]) ).
fof(f35,plain,
( ! [X0] :
( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f34,f10]) ).
fof(f38,plain,
( ! [X0] :
( ~ c_in(c_Union(X0,tc_set(t_a)),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| v_m = c_Union(X0,tc_set(t_a))
| ~ c_in(v_m,X0,tc_set(tc_set(t_a))) )
| ~ spl0_2 ),
inference(resolution,[],[f35,f26]) ).
fof(f43,plain,
( ! [X0] :
( ~ c_lessequals(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a))))
| ~ c_in(v_m,X0,tc_set(tc_set(t_a)))
| v_m = c_Union(X0,tc_set(t_a)) )
| ~ spl0_2 ),
inference(resolution,[],[f38,f7]) ).
fof(f44,plain,
( ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))
| ~ spl0_2 ),
inference(resolution,[],[f43,f4]) ).
fof(f45,plain,
( v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f44,f10]) ).
fof(f46,plain,
( $false
| spl0_1
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f45,f15]) ).
fof(f47,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_contradiction_clause,[],[f46]) ).
fof(f50,plain,
( ! [X0] :
( c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) )
| ~ spl0_1 ),
inference(superposition,[],[f1,f16]) ).
fof(f52,plain,
( ! [X0] :
( ~ c_in(c_Zorn_Osucc(X0,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| v_m = c_Zorn_Osucc(X0,v_m,t_a) )
| ~ spl0_1 ),
inference(resolution,[],[f50,f25]) ).
fof(f58,plain,
( v_m = c_Zorn_Osucc(v_S,v_m,t_a)
| ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ spl0_1 ),
inference(resolution,[],[f52,f6]) ).
fof(f59,plain,
( ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f58,f19]) ).
fof(f60,plain,
( $false
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f59,f10]) ).
fof(f61,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f60]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f21]) ).
cnf(s2,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f22]) ).
cnf(s3,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f47]) ).
cnf(s4,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f61]) ).
cnf(s5,plain,
spl0_1,
inference(rat,[],[s1,s3]) ).
cnf(s6,plain,
spl0_2,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s2,s6,s5]) ).
fof(f62,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET843-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 03:02:31 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.65/1.32 % (2218096)Input is clausal, will run a generic CNF schedule.
% 2.65/1.32 % (2218106)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=394644481:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.65/1.32 % (2218106)First to succeed.
% 2.65/1.32 % (2218106)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2218096"
% 2.65/1.32 % (2218105)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=93285150:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.65/1.32 % (2218104)lrs+10_1_sil=8000:sp=occurrence:random_seed=4008000219:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.65/1.32 % (2218103)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=31047865:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.65/1.32 % (2218101)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1519151235:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.65/1.32 % (2218102)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=630420476:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.65/1.32 % (2218105)Also succeeded, but the first one will report.
% 2.65/1.32 % (2218104)Also succeeded, but the first one will report.
% 2.65/1.32 % (2218107)dis-21_1_sil=8000:lcm=predicate:random_seed=674070980:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.65/1.32 % (2218107)Instruction limit reached!
% 2.65/1.32 % (2218107)------------------------------
% 2.65/1.32 % (2218107)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.32 % (2218107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.32 % (2218107)CaDiCaL version: 2.1.3
% 2.65/1.32 % (2218107)Termination reason: Instruction limit
% 2.65/1.32 % (2218107)Termination phase: Saturation
% 2.65/1.32 % (2218107)Time elapsed: 0.066 s
% 2.65/1.32 % (2218107)Peak memory usage: 88 MB
% 2.65/1.32 % (2218107)Instructions burned: 117 (million)
% 2.65/1.32 % (2218106)Refutation found. Thanks to Tanya!
% 2.65/1.32 % SZS status Unsatisfiable for theBenchmark
% 2.65/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 2.65/1.32 % (2218106)------------------------------
% 2.65/1.32 % (2218106)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.32 % (2218106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.32 % (2218106)CaDiCaL version: 2.1.3
% 2.65/1.32 % (2218106)Termination reason: Refutation
% 2.65/1.32 % (2218106)Time elapsed: 0.003 s
% 2.65/1.32 % (2218106)Peak memory usage: 89 MB
% 2.65/1.32 % (2218106)Instructions burned: 5 (million)
% 2.65/1.32 % (2218106)------------------------------
% 2.65/1.32 % (2218106)------------------------------
% 2.65/1.32 % (2218096)Success in time 0.291 s
% 2.65/1.32 % Vampire exiting
%------------------------------------------------------------------------------