%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU109+1 : 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 : n005.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:51:56 PM UTC 2026
% Result : Theorem 0.30s 0.47s
% Output : Refutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 118 ( 17 unt; 8 def)
% Number of atoms : 288 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 281 ( 111 ~; 129 |; 20 &)
% ( 13 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn 69 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f8,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f31,axiom,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(X1,X0)
& in(X2,X0) )
=> ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(f32,axiom,
! [X0] :
( ( ~ empty(X0)
& preboolean(X0) )
=> in(empty_set,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_finsub_1) ).
fof(f35,conjecture,
! [X0] :
( ( ~ empty(X0)
& preboolean(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& preboolean(X1) )
=> ( ~ empty(set_intersection2(X0,X1))
& preboolean(set_intersection2(X0,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_finsub_1) ).
fof(f36,negated_conjecture,
~ ! [X0] :
( ( ~ empty(X0)
& preboolean(X0) )
=> ! [X1] :
( ( ~ empty(X1)
& preboolean(X1) )
=> ( ~ empty(set_intersection2(X0,X1))
& preboolean(set_intersection2(X0,X1)) ) ) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f44,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f59,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f75,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X1,X0)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f76,plain,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) )
| ~ in(X1,X0)
| ~ in(X2,X0) ) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0] :
( in(empty_set,X0)
| empty(X0)
| ~ preboolean(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f78,plain,
! [X0] :
( in(empty_set,X0)
| empty(X0)
| ~ preboolean(X0) ),
inference(flattening,[],[f77]) ).
fof(f80,plain,
? [X0] :
( ? [X1] :
( ( empty(set_intersection2(X0,X1))
| ~ preboolean(set_intersection2(X0,X1)) )
& ~ empty(X1)
& preboolean(X1) )
& ~ empty(X0)
& preboolean(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f81,plain,
? [X0] :
( ? [X1] :
( ( empty(set_intersection2(X0,X1))
| ~ preboolean(set_intersection2(X0,X1)) )
& ~ empty(X1)
& preboolean(X1) )
& ~ empty(X0)
& preboolean(X0) ),
inference(flattening,[],[f80]) ).
fof(f88,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f91,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f102,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f103,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f104,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f142,plain,
! [X0] :
( preboolean(X0)
| ~ in(set_union2(sK11(X0),sK12(X0)),X0)
| ~ in(set_difference(sK11(X0),sK12(X0)),X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f143,plain,
! [X2,X0,X1] :
( ~ preboolean(X0)
| ~ in(X1,X0)
| in(set_difference(X1,X2),X0)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f144,plain,
! [X2,X0,X1] :
( ~ preboolean(X0)
| ~ in(X1,X0)
| in(set_union2(X1,X2),X0)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f145,plain,
! [X0] :
( preboolean(X0)
| in(sK12(X0),X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f146,plain,
! [X0] :
( preboolean(X0)
| in(sK11(X0),X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f147,plain,
! [X0] :
( ~ preboolean(X0)
| empty(X0)
| in(empty_set,X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f150,plain,
( ~ preboolean(set_intersection2(sK13,sK14))
| empty(set_intersection2(sK13,sK14)) ),
inference(cnf_transformation,[],[f81]) ).
fof(f151,plain,
preboolean(sK14),
inference(cnf_transformation,[],[f81]) ).
fof(f152,plain,
~ empty(sK14),
inference(cnf_transformation,[],[f81]) ).
fof(f153,plain,
preboolean(sK13),
inference(cnf_transformation,[],[f81]) ).
fof(f154,plain,
~ empty(sK13),
inference(cnf_transformation,[],[f81]) ).
fof(f162,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f88]) ).
fof(f165,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ in(X3,X0)
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f104]) ).
fof(f166,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X0) ),
inference(equality_resolution,[],[f103]) ).
fof(f167,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X1) ),
inference(equality_resolution,[],[f102]) ).
fof(f169,definition,
( spl15_1
<=> empty(set_intersection2(sK13,sK14)) ),
introduced(definition,[new_symbols(definition,[spl15_1])],[avatar_definition]) ).
fof(f171,plain,
( empty(set_intersection2(sK13,sK14))
| ~ spl15_1 ),
inference(avatar_component_clause,[],[f169]) ).
fof(f173,definition,
( spl15_2
<=> preboolean(set_intersection2(sK13,sK14)) ),
introduced(definition,[new_symbols(definition,[spl15_2])],[avatar_definition]) ).
fof(f175,plain,
( ~ preboolean(set_intersection2(sK13,sK14))
| spl15_2 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f176,plain,
( spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f150,f173,f169]) ).
fof(f199,plain,
( in(sK12(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| spl15_2 ),
inference(resolution,[],[f145,f175]) ).
fof(f204,plain,
( in(sK11(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| spl15_2 ),
inference(resolution,[],[f146,f175]) ).
fof(f240,plain,
( empty(sK13)
| in(empty_set,sK13) ),
inference(resolution,[],[f147,f153]) ).
fof(f241,plain,
( empty(sK14)
| in(empty_set,sK14) ),
inference(resolution,[],[f147,f151]) ).
fof(f242,plain,
in(empty_set,sK14),
inference(forward_subsumption_resolution,[],[f241,f152]) ).
fof(f243,plain,
in(empty_set,sK13),
inference(forward_subsumption_resolution,[],[f240,f154]) ).
fof(f298,plain,
( in(sK12(set_intersection2(sK13,sK14)),sK13)
| spl15_2 ),
inference(resolution,[],[f166,f199]) ).
fof(f299,plain,
( in(sK11(set_intersection2(sK13,sK14)),sK13)
| spl15_2 ),
inference(resolution,[],[f166,f204]) ).
fof(f308,plain,
( in(sK12(set_intersection2(sK13,sK14)),sK14)
| spl15_2 ),
inference(resolution,[],[f167,f199]) ).
fof(f309,plain,
( in(sK11(set_intersection2(sK13,sK14)),sK14)
| spl15_2 ),
inference(resolution,[],[f167,f204]) ).
fof(f376,plain,
! [X0,X1] :
( in(set_difference(X0,X1),sK13)
| ~ in(X0,sK13)
| ~ in(X1,sK13) ),
inference(resolution,[],[f143,f153]) ).
fof(f377,plain,
! [X0,X1] :
( in(set_difference(X0,X1),sK14)
| ~ in(X0,sK14)
| ~ in(X1,sK14) ),
inference(resolution,[],[f143,f151]) ).
fof(f382,plain,
! [X0,X1] :
( in(set_union2(X0,X1),sK13)
| ~ in(X0,sK13)
| ~ in(X1,sK13) ),
inference(resolution,[],[f144,f153]) ).
fof(f383,plain,
! [X0,X1] :
( in(set_union2(X0,X1),sK14)
| ~ in(X0,sK14)
| ~ in(X1,sK14) ),
inference(resolution,[],[f144,f151]) ).
fof(f384,plain,
( ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14))
| ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14))
| spl15_2 ),
inference(resolution,[],[f142,f175]) ).
fof(f390,definition,
( spl15_5
<=> in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14)) ),
introduced(definition,[new_symbols(definition,[spl15_5])],[avatar_definition]) ).
fof(f392,plain,
( ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14))
| spl15_5 ),
inference(avatar_component_clause,[],[f390]) ).
fof(f394,definition,
( spl15_6
<=> in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14)) ),
introduced(definition,[new_symbols(definition,[spl15_6])],[avatar_definition]) ).
fof(f396,plain,
( ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),set_intersection2(sK13,sK14))
| spl15_6 ),
inference(avatar_component_clause,[],[f394]) ).
fof(f397,plain,
( ~ spl15_5
| ~ spl15_6
| spl15_2 ),
inference(avatar_split_clause,[],[f384,f173,f394,f390]) ).
fof(f469,plain,
( ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13)
| ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14)
| spl15_5 ),
inference(resolution,[],[f392,f165]) ).
fof(f471,definition,
( spl15_7
<=> in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14) ),
introduced(definition,[new_symbols(definition,[spl15_7])],[avatar_definition]) ).
fof(f473,plain,
( ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14)
| spl15_7 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f475,definition,
( spl15_8
<=> in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13) ),
introduced(definition,[new_symbols(definition,[spl15_8])],[avatar_definition]) ).
fof(f477,plain,
( ~ in(set_difference(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13)
| spl15_8 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f478,plain,
( ~ spl15_7
| ~ spl15_8
| spl15_5 ),
inference(avatar_split_clause,[],[f469,f390,f475,f471]) ).
fof(f526,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),sK14)
| ~ in(sK12(set_intersection2(sK13,sK14)),sK14)
| spl15_7 ),
inference(resolution,[],[f473,f377]) ).
fof(f528,plain,
( ~ in(sK12(set_intersection2(sK13,sK14)),sK14)
| spl15_2
| spl15_7 ),
inference(forward_subsumption_resolution,[],[f526,f309]) ).
fof(f529,plain,
( $false
| spl15_2
| spl15_7 ),
inference(forward_subsumption_resolution,[],[f528,f308]) ).
fof(f530,plain,
( spl15_2
| spl15_7 ),
inference(avatar_contradiction_clause,[],[f529]) ).
fof(f537,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),sK13)
| ~ in(sK12(set_intersection2(sK13,sK14)),sK13)
| spl15_8 ),
inference(resolution,[],[f477,f376]) ).
fof(f539,plain,
( ~ in(sK12(set_intersection2(sK13,sK14)),sK13)
| spl15_2
| spl15_8 ),
inference(forward_subsumption_resolution,[],[f537,f299]) ).
fof(f540,plain,
( $false
| spl15_2
| spl15_8 ),
inference(forward_subsumption_resolution,[],[f539,f298]) ).
fof(f541,plain,
( spl15_2
| spl15_8 ),
inference(avatar_contradiction_clause,[],[f540]) ).
fof(f544,plain,
( empty_set = set_intersection2(sK13,sK14)
| ~ spl15_1 ),
inference(resolution,[],[f171,f162]) ).
fof(f557,plain,
( ! [X0] :
( ~ in(X0,sK14)
| ~ in(X0,sK13)
| in(X0,empty_set) )
| ~ spl15_1 ),
inference(superposition,[],[f165,f544]) ).
fof(f648,plain,
( ~ in(empty_set,sK13)
| in(empty_set,empty_set)
| ~ spl15_1 ),
inference(resolution,[],[f557,f242]) ).
fof(f660,plain,
( in(empty_set,empty_set)
| ~ spl15_1 ),
inference(forward_subsumption_resolution,[],[f648,f243]) ).
fof(f683,plain,
( ~ in(empty_set,empty_set)
| ~ spl15_1 ),
inference(resolution,[],[f660,f91]) ).
fof(f688,plain,
( $false
| ~ spl15_1 ),
inference(forward_subsumption_resolution,[],[f683,f660]) ).
fof(f689,plain,
~ spl15_1,
inference(avatar_contradiction_clause,[],[f688]) ).
fof(f691,plain,
( in(sK11(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| spl15_2 ),
inference(resolution,[],[f175,f146]) ).
fof(f692,plain,
( in(sK12(set_intersection2(sK13,sK14)),set_intersection2(sK13,sK14))
| spl15_2 ),
inference(resolution,[],[f175,f145]) ).
fof(f695,plain,
( in(sK11(set_intersection2(sK13,sK14)),sK14)
| spl15_2 ),
inference(resolution,[],[f691,f167]) ).
fof(f696,plain,
( in(sK11(set_intersection2(sK13,sK14)),sK13)
| spl15_2 ),
inference(resolution,[],[f691,f166]) ).
fof(f701,plain,
( in(sK12(set_intersection2(sK13,sK14)),sK14)
| spl15_2 ),
inference(resolution,[],[f692,f167]) ).
fof(f702,plain,
( in(sK12(set_intersection2(sK13,sK14)),sK13)
| spl15_2 ),
inference(resolution,[],[f692,f166]) ).
fof(f717,plain,
( ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13)
| ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14)
| spl15_6 ),
inference(resolution,[],[f396,f165]) ).
fof(f720,definition,
( spl15_15
<=> in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14) ),
introduced(definition,[new_symbols(definition,[spl15_15])],[avatar_definition]) ).
fof(f722,plain,
( ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK14)
| spl15_15 ),
inference(avatar_component_clause,[],[f720]) ).
fof(f724,definition,
( spl15_16
<=> in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13) ),
introduced(definition,[new_symbols(definition,[spl15_16])],[avatar_definition]) ).
fof(f726,plain,
( ~ in(set_union2(sK11(set_intersection2(sK13,sK14)),sK12(set_intersection2(sK13,sK14))),sK13)
| spl15_16 ),
inference(avatar_component_clause,[],[f724]) ).
fof(f727,plain,
( ~ spl15_15
| ~ spl15_16
| spl15_6 ),
inference(avatar_split_clause,[],[f717,f394,f724,f720]) ).
fof(f952,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),sK14)
| ~ in(sK12(set_intersection2(sK13,sK14)),sK14)
| spl15_15 ),
inference(resolution,[],[f722,f383]) ).
fof(f954,plain,
( ~ in(sK12(set_intersection2(sK13,sK14)),sK14)
| spl15_2
| spl15_15 ),
inference(forward_subsumption_resolution,[],[f952,f695]) ).
fof(f955,plain,
( $false
| spl15_2
| spl15_15 ),
inference(forward_subsumption_resolution,[],[f954,f701]) ).
fof(f956,plain,
( spl15_2
| spl15_15 ),
inference(avatar_contradiction_clause,[],[f955]) ).
fof(f1011,plain,
( ~ in(sK11(set_intersection2(sK13,sK14)),sK13)
| ~ in(sK12(set_intersection2(sK13,sK14)),sK13)
| spl15_16 ),
inference(resolution,[],[f726,f382]) ).
fof(f1013,plain,
( ~ in(sK12(set_intersection2(sK13,sK14)),sK13)
| spl15_2
| spl15_16 ),
inference(forward_subsumption_resolution,[],[f1011,f696]) ).
fof(f1014,plain,
( $false
| spl15_2
| spl15_16 ),
inference(forward_subsumption_resolution,[],[f1013,f702]) ).
fof(f1015,plain,
( spl15_2
| spl15_16 ),
inference(avatar_contradiction_clause,[],[f1014]) ).
cnf(s1,plain,
( spl15_1
| ~ spl15_2 ),
inference(sat_conversion,[],[f176]) ).
cnf(s6,plain,
( spl15_2
| ~ spl15_5
| ~ spl15_6 ),
inference(sat_conversion,[],[f397]) ).
cnf(s7,plain,
( spl15_5
| ~ spl15_7
| ~ spl15_8 ),
inference(sat_conversion,[],[f478]) ).
cnf(s8,plain,
( spl15_2
| spl15_7 ),
inference(sat_conversion,[],[f530]) ).
cnf(s9,plain,
( spl15_2
| spl15_8 ),
inference(sat_conversion,[],[f541]) ).
cnf(s21,plain,
~ spl15_1,
inference(sat_conversion,[],[f689]) ).
cnf(s23,plain,
( spl15_6
| ~ spl15_15
| ~ spl15_16 ),
inference(sat_conversion,[],[f727]) ).
cnf(s24,plain,
( spl15_2
| spl15_15 ),
inference(sat_conversion,[],[f956]) ).
cnf(s28,plain,
( spl15_2
| spl15_16 ),
inference(sat_conversion,[],[f1015]) ).
cnf(s29,plain,
~ spl15_2,
inference(rat,[],[s1,s21]) ).
cnf(s30,plain,
spl15_16,
inference(rat,[],[s28,s29]) ).
cnf(s31,plain,
spl15_15,
inference(rat,[],[s24,s29]) ).
cnf(s32,plain,
spl15_8,
inference(rat,[],[s9,s29]) ).
cnf(s33,plain,
spl15_7,
inference(rat,[],[s8,s29]) ).
cnf(s34,plain,
spl15_6,
inference(rat,[],[s23,s30,s31]) ).
cnf(s35,plain,
spl15_5,
inference(rat,[],[s7,s32,s33]) ).
cnf(s36,plain,
$false,
inference(rat,[],[s6,s29,s34,s35]) ).
fof(f1016,plain,
$false,
inference(avatar_sat_refutation,[],[s36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU109+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n005.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:35:22 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 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.30/0.47 % (411249)Will run a generic schedule for satisfiability detection.
% 0.30/0.47 % (411259)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=173200723:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.30/0.47 % (411255)% WARNING: option uhcvi not known.
% 0.30/0.47 % (411258)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2660444053:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.30/0.47 % (411254)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3159320280_2999 on theBenchmark for (2999ds/0Mi)
% 0.30/0.47 % (411257)dis+10_1_sil=32000:sp=arity:random_seed=3759021828:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.30/0.47 % (411256)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1702063464:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.30/0.47 % (411260)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2782928387:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.30/0.47 % (411255)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1135960812:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.30/0.47 % TRYING [1]
% 0.30/0.47 % TRYING [2]
% 0.30/0.47 % TRYING [3]
% 0.30/0.47 % TRYING [4]
% 0.30/0.47 % TRYING [5]
% 0.30/0.47 % (411258) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-411249-411258"...
% 0.30/0.47 % (411258)...printing done.
% 0.30/0.47 % (411258)Refutation found. Thanks to Tanya!
% 0.30/0.47 % SZS status Theorem for theBenchmark
% 0.30/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.30/0.47 % (411258)------------------------------
% 0.30/0.47 % (411258)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.47 % (411258)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.47 % (411258)CaDiCaL version: 2.1.3
% 0.30/0.47 % (411258)Termination reason: Refutation
% 0.30/0.47 % (411258)Time elapsed: 0.023 s
% 0.30/0.47 % (411258)Peak memory usage: 13 MB
% 0.30/0.47 % (411258)Instructions burned: 32 (million)
% 0.30/0.47 % (411249)Success in time 0.057 s
% 0.30/0.47 % Vampire exiting
%------------------------------------------------------------------------------