%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU141+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:47:23 PM UTC 2026
% Result : Theorem 2.99s 1.32s
% Output : Refutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 11
% Syntax : Number of formulae : 90 ( 16 unt; 3 def)
% Number of atoms : 318 ( 65 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 381 ( 153 ~; 164 |; 53 &)
% ( 10 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 142 ( 1 sgn 129 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f5,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(f6,axiom,
! [X0,X1,X2] :
( X2 = set_difference(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& ~ in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f12,axiom,
! [X0,X1] : set_intersection2(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(f17,axiom,
! [X0] : set_intersection2(X0,empty_set) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_boole) ).
fof(f20,axiom,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X2] : in(X2,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f23,conjecture,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(f24,negated_conjecture,
~ ! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f26,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X0,X1))
& disjoint(X0,X1) ) ),
inference(rectify,[],[f20]) ).
fof(f27,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(rectify,[],[f12]) ).
fof(f29,plain,
? [X0,X1] :
( disjoint(X0,X1)
<~> set_difference(X0,X1) = X0 ),
inference(ennf_transformation,[],[f24]) ).
fof(f30,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f37,plain,
? [X0,X1] :
( ( set_difference(X0,X1) != X0
| ~ disjoint(X0,X1) )
& ( set_difference(X0,X1) = X0
| disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f38,plain,
( ( sK0 != set_difference(sK0,sK1)
| ~ disjoint(sK0,sK1) )
& ( sK0 = set_difference(sK0,sK1)
| disjoint(sK0,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f37]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| in(X3,X1) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| in(X3,X1) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(flattening,[],[f39]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& ~ in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(rectify,[],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( X2 = set_difference(X0,X1)
| ( ( ~ in(sK2(X0,X1,X2),X0)
| in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( in(sK2(X0,X1,X2),X0)
& ~ in(sK2(X0,X1,X2),X1) )
| in(sK2(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| in(X4,X1) )
& ( ( in(X4,X0)
& ~ in(X4,X1) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| in(sK3(X0,X1),set_intersection2(X0,X1)) )
& ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f30]) ).
fof(f44,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f46]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X0)
& in(sK4(X0,X1,X2),X1) )
| in(sK4(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X3,sK4(X0,X1,X2))],[f47]) ).
fof(f56,plain,
( sK0 = set_difference(sK0,sK1)
| disjoint(sK0,sK1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f57,plain,
( sK0 != set_difference(sK0,sK1)
| ~ disjoint(sK0,sK1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f60,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f42]) ).
fof(f64,plain,
! [X2,X0,X1] :
( in(sK2(X0,X1,X2),X2)
| in(sK2(X0,X1,X2),X0)
| set_difference(X0,X1) = X2 ),
inference(cnf_transformation,[],[f42]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ in(sK2(X0,X1,X2),X2)
| ~ in(sK2(X0,X1,X2),X0)
| in(sK2(X0,X1,X2),X1)
| set_difference(X0,X1) = X2 ),
inference(cnf_transformation,[],[f42]) ).
fof(f66,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f67,plain,
! [X0,X1] :
( in(sK3(X0,X1),set_intersection2(X0,X1))
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f69,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f44]) ).
fof(f70,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f72,plain,
! [X0] : empty_set = set_intersection2(X0,empty_set),
inference(cnf_transformation,[],[f17]) ).
fof(f77,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f48]) ).
fof(f78,plain,
! [X2,X0,X1] :
( in(sK4(X0,X1,X2),X2)
| in(sK4(X0,X1,X2),X1)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f48]) ).
fof(f79,plain,
! [X2,X0,X1] :
( in(sK4(X0,X1,X2),X2)
| in(sK4(X0,X1,X2),X0)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f48]) ).
fof(f85,plain,
! [X0] : set_intersection2(X0,X0) = X0,
inference(cnf_transformation,[],[f27]) ).
fof(f86,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f96,plain,
! [X0,X1,X4] :
( ~ in(X4,set_difference(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f60]) ).
fof(f97,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f77]) ).
fof(f103,definition,
( spl8_1
<=> disjoint(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).
fof(f104,plain,
( ~ disjoint(sK0,sK1)
| spl8_1 ),
inference(avatar_component_clause,[],[f103]) ).
fof(f105,plain,
( disjoint(sK0,sK1)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f103]) ).
fof(f107,definition,
( spl8_2
<=> sK0 = set_difference(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl8_2])],[avatar_definition]) ).
fof(f108,plain,
( sK0 != set_difference(sK0,sK1)
| spl8_2 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f109,plain,
( sK0 = set_difference(sK0,sK1)
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f110,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f56,f107,f103]) ).
fof(f111,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(avatar_split_clause,[],[f57,f107,f103]) ).
fof(f118,plain,
! [X0] : empty_set = set_intersection2(empty_set,X0),
inference(superposition,[],[f72,f86]) ).
fof(f127,plain,
! [X0,X1] :
( ~ disjoint(X0,X0)
| ~ in(X1,X0) ),
inference(superposition,[],[f66,f85]) ).
fof(f135,definition,
( spl8_4
<=> ! [X0] : ~ in(X0,empty_set) ),
introduced(definition,[new_symbols(definition,[spl8_4])],[avatar_definition]) ).
fof(f136,plain,
( ! [X0] : ~ in(X0,empty_set)
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f146,plain,
! [X0] :
( empty_set != empty_set
| disjoint(empty_set,X0) ),
inference(superposition,[],[f70,f118]) ).
fof(f147,plain,
! [X0] : disjoint(empty_set,X0),
inference(trivial_inequality_removal,[],[f146]) ).
fof(f164,plain,
( ! [X0] :
( ~ in(X0,sK1)
| ~ in(X0,sK0) )
| ~ spl8_2 ),
inference(superposition,[],[f96,f109]) ).
fof(f181,plain,
! [X0] : ~ in(X0,empty_set),
inference(resolution,[],[f127,f147]) ).
fof(f268,plain,
! [X0,X1] :
( in(sK2(X0,X1,X0),X0)
| set_difference(X0,X1) = X0 ),
inference(factoring,[],[f64]) ).
fof(f291,plain,
( ! [X0,X1] :
( ~ in(sK4(X0,sK1,X1),sK0)
| set_intersection2(X0,sK1) = X1
| in(sK4(X0,sK1,X1),X1) )
| ~ spl8_2 ),
inference(resolution,[],[f78,f164]) ).
fof(f321,plain,
( ! [X0] :
( set_intersection2(sK0,sK1) = X0
| in(sK4(sK0,sK1,X0),X0)
| in(sK4(sK0,sK1,X0),X0)
| set_intersection2(sK0,sK1) = X0 )
| ~ spl8_2 ),
inference(resolution,[],[f291,f79]) ).
fof(f322,plain,
( ! [X0] :
( in(sK4(sK0,sK1,X0),X0)
| set_intersection2(sK0,sK1) = X0 )
| ~ spl8_2 ),
inference(duplicate_literal_removal,[],[f321]) ).
fof(f340,plain,
( empty_set = set_intersection2(sK0,sK1)
| ~ spl8_2
| ~ spl8_4 ),
inference(resolution,[],[f322,f136]) ).
fof(f369,plain,
( in(sK3(sK0,sK1),empty_set)
| disjoint(sK0,sK1)
| ~ spl8_2
| ~ spl8_4 ),
inference(superposition,[],[f67,f340]) ).
fof(f384,plain,
( disjoint(sK0,sK1)
| ~ spl8_2
| ~ spl8_4 ),
inference(forward_subsumption_resolution,[],[f369,f136]) ).
fof(f387,plain,
( $false
| spl8_1
| ~ spl8_2
| ~ spl8_4 ),
inference(forward_subsumption_resolution,[],[f384,f104]) ).
fof(f388,plain,
( spl8_1
| ~ spl8_2
| ~ spl8_4 ),
inference(avatar_contradiction_clause,[],[f387]) ).
fof(f389,plain,
( empty_set = set_intersection2(sK0,sK1)
| ~ spl8_1 ),
inference(resolution,[],[f105,f69]) ).
fof(f397,plain,
( ! [X0] :
( in(X0,empty_set)
| ~ in(X0,sK0)
| ~ in(X0,sK1) )
| ~ spl8_1 ),
inference(superposition,[],[f97,f389]) ).
fof(f406,plain,
( ! [X0] :
( ~ in(X0,sK1)
| ~ in(X0,sK0) )
| ~ spl8_1
| ~ spl8_4 ),
inference(forward_subsumption_resolution,[],[f397,f136]) ).
fof(f528,plain,
! [X0,X1] :
( set_difference(X0,X1) = X0
| ~ in(sK2(X0,X1,X0),X0)
| in(sK2(X0,X1,X0),X1)
| set_difference(X0,X1) = X0 ),
inference(resolution,[],[f268,f65]) ).
fof(f539,plain,
! [X0,X1] :
( set_difference(X0,X1) = X0
| ~ in(sK2(X0,X1,X0),X0)
| in(sK2(X0,X1,X0),X1) ),
inference(duplicate_literal_removal,[],[f528]) ).
fof(f541,plain,
! [X0,X1] :
( in(sK2(X0,X1,X0),X1)
| set_difference(X0,X1) = X0 ),
inference(forward_subsumption_resolution,[],[f539,f268]) ).
fof(f4002,plain,
( ! [X0] :
( ~ in(sK2(X0,sK1,X0),sK0)
| set_difference(X0,sK1) = X0 )
| ~ spl8_1
| ~ spl8_4 ),
inference(resolution,[],[f541,f406]) ).
fof(f4053,plain,
( sK0 = set_difference(sK0,sK1)
| sK0 = set_difference(sK0,sK1)
| ~ spl8_1
| ~ spl8_4 ),
inference(resolution,[],[f4002,f268]) ).
fof(f4058,plain,
( sK0 = set_difference(sK0,sK1)
| ~ spl8_1
| ~ spl8_4 ),
inference(duplicate_literal_removal,[],[f4053]) ).
fof(f4059,plain,
( $false
| ~ spl8_1
| spl8_2
| ~ spl8_4 ),
inference(forward_subsumption_resolution,[],[f4058,f108]) ).
fof(f4060,plain,
( ~ spl8_1
| spl8_2
| ~ spl8_4 ),
inference(avatar_contradiction_clause,[],[f4059]) ).
fof(f4067,plain,
spl8_4,
inference(avatar_split_clause,[],[f181,f135]) ).
cnf(s1,plain,
( spl8_1
| spl8_2 ),
inference(sat_conversion,[],[f110]) ).
cnf(s2,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(sat_conversion,[],[f111]) ).
cnf(s8,plain,
( spl8_1
| ~ spl8_2
| ~ spl8_4 ),
inference(sat_conversion,[],[f388]) ).
cnf(s12,plain,
( ~ spl8_1
| spl8_2
| ~ spl8_4 ),
inference(sat_conversion,[],[f4060]) ).
cnf(s15,plain,
spl8_4,
inference(sat_conversion,[],[f4067]) ).
cnf(s25,plain,
( ~ spl8_1
| spl8_2 ),
inference(rat,[],[s12,s15]) ).
cnf(s28,plain,
( spl8_1
| ~ spl8_2 ),
inference(rat,[],[s8,s15]) ).
cnf(s31,plain,
spl8_1,
inference(rat,[],[s1,s28]) ).
cnf(s32,plain,
spl8_2,
inference(rat,[],[s25,s31]) ).
cnf(s33,plain,
$false,
inference(rat,[],[s2,s32,s31]) ).
fof(f4105,plain,
$false,
inference(avatar_sat_refutation,[],[s33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU141+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n005.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 03:42:32 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.32 % (414976)Detected formulas, will run a generic FOF schedule.
% 2.99/1.32 % (414986)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3818405940:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.99/1.32 % (414981)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=1364847655:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.99/1.32 % (414984)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1374274436:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.99/1.32 % (414984)Refutation not found, incomplete strategy
% 2.99/1.32 % (414984)------------------------------
% 2.99/1.32 % (414984)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.32 % (414984)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.32 % (414984)CaDiCaL version: 2.1.3
% 2.99/1.32 % (414984)Termination reason: Refutation not found, incomplete strategy
% 2.99/1.32 % (414984)Time elapsed: 0.002 s
% 2.99/1.32 % (414984)Peak memory usage: 88 MB
% 2.99/1.32 % (414984)Instructions burned: 1 (million)
% 2.99/1.32 % (414983)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3196117417:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.99/1.32 % (414982)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1170675979:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.99/1.32 % (414985)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2661566008:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.99/1.32 % (414986)Instruction limit reached!
% 2.99/1.32 % (414986)------------------------------
% 2.99/1.32 % (414986)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.32 % (414986)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.32 % (414986)CaDiCaL version: 2.1.3
% 2.99/1.32 % (414986)Termination reason: Instruction limit
% 2.99/1.32 % (414986)Termination phase: Saturation
% 2.99/1.32 % (414986)Time elapsed: 0.050 s
% 2.99/1.32 % (414986)Peak memory usage: 89 MB
% 2.99/1.32 % (414986)Instructions burned: 141 (million)
% 2.99/1.32 % (414987)dis-21_1_sil=8000:lcm=predicate:random_seed=3808459709:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.99/1.32 % (414985)Instruction limit reached!
% 2.99/1.32 % (414985)------------------------------
% 2.99/1.32 % (414985)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.32 % (414985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.32 % (414985)CaDiCaL version: 2.1.3
% 2.99/1.32 % (414985)Termination reason: Instruction limit
% 2.99/1.32 % (414985)Termination phase: Saturation
% 2.99/1.32 % (414985)Time elapsed: 0.076 s
% 2.99/1.32 % (414985)Peak memory usage: 89 MB
% 2.99/1.32 % (414985)Instructions burned: 120 (million)
% 2.99/1.32 % (414987)Instruction limit reached!
% 2.99/1.32 % (414987)------------------------------
% 2.99/1.32 % (414987)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.32 % (414987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.32 % (414987)CaDiCaL version: 2.1.3
% 2.99/1.32 % (414987)Termination reason: Instruction limit
% 2.99/1.32 % (414987)Termination phase: Saturation
% 2.99/1.32 % (414987)Time elapsed: 0.073 s
% 2.99/1.32 % (414987)Peak memory usage: 89 MB
% 2.99/1.32 % (414987)Instructions burned: 130 (million)
% 2.99/1.32 % (414994)lrs+10_1_sil=8000:sp=occurrence:random_seed=2333555455:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.99/1.32 % (414994)First to succeed.
% 2.99/1.32 % (414994)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-414976"
% 2.99/1.32 % (414996)lrs+10_1_sil=32000:urr=on:br=off:random_seed=991676100:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.99/1.32 % (414997)lrs+1011_1_sil=32000:sp=occurrence:random_seed=215897366:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.99/1.32 % (414984)------------------------------
% 2.99/1.32 % (414984)------------------------------
% 2.99/1.32 % (414996)Instruction limit reached!
% 2.99/1.32 % (414996)------------------------------
% 2.99/1.32 % (414996)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.99/1.32 % (414996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.99/1.32 % (414996)CaDiCaL version: 2.1.3
% 2.99/1.32 % (414996)Termination reason: Instruction limit
% 2.99/1.32 % (414996)Termination phase: Saturation
% 2.99/1.32 % (414996)Time elapsed: 0.086 s
% 2.99/1.32 % (414996)Peak memory usage: 90 MB
% 2.99/1.32 % (414996)Instructions burned: 158 (million)
% 2.99/1.32 % (414994)Refutation found. Thanks to Tanya!
% 2.99/1.32 % SZS status Theorem for theBenchmark
% 2.99/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 3.87/1.54 % (414994)------------------------------
% 3.87/1.54 % (414994)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.87/1.54 % (414994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.87/1.54 % (414994)CaDiCaL version: 2.1.3
% 3.87/1.54 % (414994)Termination reason: Refutation
% 3.87/1.54 % (414994)Time elapsed: 0.060 s
% 3.87/1.54 % (414994)Peak memory usage: 91 MB
% 3.87/1.54 % (414994)Instructions burned: 179 (million)
% 3.87/1.54 % (414994)------------------------------
% 3.87/1.54 % (414994)------------------------------
% 3.87/1.54 % (414976)Success in time 0.458 s
% 3.87/1.54 % Vampire exiting
%------------------------------------------------------------------------------