%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU111+1 : 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 : n011.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:16 PM UTC 2026
% Result : Theorem 8.38s 2.25s
% Output : Refutation 10.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of formulae : 96 ( 30 unt; 5 def)
% Number of atoms : 319 ( 49 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 363 ( 140 ~; 152 |; 58 &)
% ( 9 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 162 ( 152 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f8,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f9,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f10,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f11,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f19,axiom,
! [X0] :
( ~ empty(finite_subsets(X0))
& cup_closed(finite_subsets(X0))
& diff_closed(finite_subsets(X0))
& preboolean(finite_subsets(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_finsub_1) ).
fof(f31,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f32,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f34,axiom,
! [X0,X1] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_finsub_1) ).
fof(f35,conjecture,
! [X0,X1] : finite_subsets(set_intersection2(X0,X1)) = set_intersection2(finite_subsets(X0),finite_subsets(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_finsub_1) ).
fof(f36,negated_conjecture,
~ ! [X0,X1] : finite_subsets(set_intersection2(X0,X1)) = set_intersection2(finite_subsets(X0),finite_subsets(X1)),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f62,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f63,plain,
! [X0,X1] :
( ( X1 = finite_subsets(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f69,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(ennf_transformation,[],[f32]) ).
fof(f70,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(flattening,[],[f69]) ).
fof(f72,plain,
! [X0,X1] :
( subset(finite_subsets(X0),finite_subsets(X1))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f73,plain,
? [X0,X1] : finite_subsets(set_intersection2(X0,X1)) != set_intersection2(finite_subsets(X0),finite_subsets(X1)),
inference(ennf_transformation,[],[f36]) ).
fof(f82,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f83,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f82]) ).
fof(f84,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f62]) ).
fof(f85,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f84]) ).
fof(f86,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f85]) ).
fof(f87,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,[],[f10]) ).
fof(f88,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,[],[f87]) ).
fof(f89,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,[],[f88]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X0)
& in(sK1(X0,X1,X2),X1) )
| in(sK1(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,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f89]) ).
fof(f91,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(nnf_transformation,[],[f63]) ).
fof(f92,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(flattening,[],[f91]) ).
fof(f93,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ finite(X2)
| ~ in(X2,X1) )
& ( ( subset(X2,X0)
& finite(X2) )
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( ( subset(X3,X0)
& finite(X3) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(rectify,[],[f92]) ).
fof(f94,plain,
! [X0,X1] :
( ( ( X1 = finite_subsets(X0)
| ( ( ~ subset(sK2(X0,X1),X0)
| ~ finite(sK2(X0,X1))
| ~ in(sK2(X0,X1),X1) )
& ( ( subset(sK2(X0,X1),X0)
& finite(sK2(X0,X1)) )
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3) )
& ( ( subset(X3,X0)
& finite(X3) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f93]) ).
fof(f105,plain,
finite_subsets(set_intersection2(sK13,sK14)) != set_intersection2(finite_subsets(sK13),finite_subsets(sK14)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14]),skolemize(X0,sK13),skolemize(X1,sK14)],[f73]) ).
fof(f114,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f7]) ).
fof(f117,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f83]) ).
fof(f119,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
fof(f120,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
fof(f121,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f90]) ).
fof(f122,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f90]) ).
fof(f127,plain,
! [X3,X0,X1] :
( finite(X3)
| ~ in(X3,X1)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f128,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f129,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| ~ finite(X3)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f143,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f19]) ).
fof(f170,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f31]) ).
fof(f171,plain,
! [X2,X0,X1] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X1)
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f70]) ).
fof(f173,plain,
! [X0,X1] :
( subset(finite_subsets(X0),finite_subsets(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f174,plain,
finite_subsets(set_intersection2(sK13,sK14)) != set_intersection2(finite_subsets(sK13),finite_subsets(sK14)),
inference(cnf_transformation,[],[f105]) ).
fof(f187,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f122]) ).
fof(f188,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f121]) ).
fof(f189,plain,
! [X3,X0] :
( in(X3,finite_subsets(X0))
| ~ subset(X3,X0)
| ~ finite(X3)
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f129]) ).
fof(f190,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,finite_subsets(X0))
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f128]) ).
fof(f191,plain,
! [X3,X0] :
( finite(X3)
| ~ in(X3,finite_subsets(X0))
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f127]) ).
fof(f192,definition,
sF15 = set_intersection2(sK13,sK14),
introduced(definition,[new_symbols(definition,[sF15])],[function_definition]) ).
fof(f193,plain,
set_intersection2(sK13,sK14) = sF15,
inference(reorient_equations,[],[f192]) ).
fof(f194,definition,
sF16 = finite_subsets(sF15),
introduced(definition,[new_symbols(definition,[sF16])],[function_definition]) ).
fof(f195,plain,
finite_subsets(sF15) = sF16,
inference(reorient_equations,[],[f194]) ).
fof(f196,definition,
sF17 = finite_subsets(sK13),
introduced(definition,[new_symbols(definition,[sF17])],[function_definition]) ).
fof(f197,plain,
finite_subsets(sK13) = sF17,
inference(reorient_equations,[],[f196]) ).
fof(f198,definition,
sF18 = finite_subsets(sK14),
introduced(definition,[new_symbols(definition,[sF18])],[function_definition]) ).
fof(f199,plain,
finite_subsets(sK14) = sF18,
inference(reorient_equations,[],[f198]) ).
fof(f200,definition,
sF19 = set_intersection2(sF17,sF18),
introduced(definition,[new_symbols(definition,[sF19])],[function_definition]) ).
fof(f201,plain,
set_intersection2(sF17,sF18) = sF19,
inference(reorient_equations,[],[f200]) ).
fof(f202,plain,
sF16 != sF19,
inference(definition_folding,[],[f174,f201,f199,f197,f195,f193]) ).
fof(f203,plain,
! [X3,X0] :
( ~ in(X3,finite_subsets(X0))
| finite(X3) ),
inference(forward_subsumption_resolution,[],[f191,f143]) ).
fof(f204,plain,
! [X3,X0] :
( ~ in(X3,finite_subsets(X0))
| subset(X3,X0) ),
inference(forward_subsumption_resolution,[],[f190,f143]) ).
fof(f205,plain,
! [X3,X0] :
( in(X3,finite_subsets(X0))
| ~ subset(X3,X0)
| ~ finite(X3) ),
inference(forward_subsumption_resolution,[],[f189,f143]) ).
fof(f206,plain,
! [X0] :
( ~ in(X0,sF17)
| subset(X0,sK13) ),
inference(superposition,[],[f204,f197]) ).
fof(f207,plain,
! [X0] :
( ~ in(X0,sF18)
| subset(X0,sK14) ),
inference(superposition,[],[f204,f199]) ).
fof(f212,plain,
! [X0] :
( ~ in(X0,sF19)
| in(X0,sF17) ),
inference(superposition,[],[f187,f201]) ).
fof(f214,plain,
! [X0] :
( in(sK0(sF19,X0),sF17)
| subset(sF19,X0) ),
inference(resolution,[],[f212,f119]) ).
fof(f219,plain,
! [X0] :
( ~ in(X0,sF19)
| in(X0,sF18) ),
inference(superposition,[],[f188,f201]) ).
fof(f221,plain,
! [X0] :
( in(sK0(sF19,X0),sF18)
| subset(sF19,X0) ),
inference(resolution,[],[f219,f119]) ).
fof(f225,plain,
! [X0] :
( subset(sK0(sF19,X0),sK14)
| subset(sF19,X0) ),
inference(resolution,[],[f207,f221]) ).
fof(f227,plain,
! [X0] :
( subset(sK0(sF19,X0),sK13)
| subset(sF19,X0) ),
inference(resolution,[],[f206,f214]) ).
fof(f242,plain,
! [X0] :
( ~ subset(X0,sF15)
| in(X0,sF16)
| ~ finite(X0) ),
inference(superposition,[],[f205,f195]) ).
fof(f250,plain,
! [X0] :
( ~ in(X0,sF17)
| finite(X0) ),
inference(superposition,[],[f203,f197]) ).
fof(f253,plain,
! [X0] :
( finite(sK0(sF19,X0))
| subset(sF19,X0) ),
inference(resolution,[],[f250,f214]) ).
fof(f261,plain,
! [X0] :
( subset(sF16,finite_subsets(X0))
| ~ subset(sF15,X0) ),
inference(superposition,[],[f173,f195]) ).
fof(f272,plain,
subset(sF15,sK13),
inference(superposition,[],[f170,f193]) ).
fof(f303,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X1),
inference(superposition,[],[f170,f114]) ).
fof(f332,plain,
! [X0] :
( ~ subset(X0,sF18)
| ~ subset(X0,sF17)
| subset(X0,sF19) ),
inference(superposition,[],[f171,f201]) ).
fof(f333,plain,
! [X0] :
( ~ subset(X0,sK14)
| ~ subset(X0,sK13)
| subset(X0,sF15) ),
inference(superposition,[],[f171,f193]) ).
fof(f349,plain,
! [X0] :
( ~ subset(sK0(sF19,X0),sK13)
| subset(sK0(sF19,X0),sF15)
| subset(sF19,X0) ),
inference(resolution,[],[f333,f225]) ).
fof(f350,plain,
! [X0] :
( subset(sK0(sF19,X0),sF15)
| subset(sF19,X0) ),
inference(forward_subsumption_resolution,[],[f349,f227]) ).
fof(f360,plain,
! [X0] :
( subset(sF19,X0)
| in(sK0(sF19,X0),sF16)
| ~ finite(sK0(sF19,X0)) ),
inference(resolution,[],[f350,f242]) ).
fof(f363,plain,
! [X0] :
( in(sK0(sF19,X0),sF16)
| subset(sF19,X0) ),
inference(forward_subsumption_resolution,[],[f360,f253]) ).
fof(f364,plain,
( subset(sF19,sF16)
| subset(sF19,sF16) ),
inference(resolution,[],[f363,f120]) ).
fof(f367,plain,
subset(sF19,sF16),
inference(duplicate_literal_removal,[],[f364]) ).
fof(f369,plain,
( ~ subset(sF16,sF19)
| sF16 = sF19 ),
inference(resolution,[],[f367,f117]) ).
fof(f370,plain,
~ subset(sF16,sF19),
inference(forward_subsumption_resolution,[],[f369,f202]) ).
fof(f380,plain,
subset(sF15,sK14),
inference(superposition,[],[f303,f193]) ).
fof(f394,plain,
( subset(sF16,sF17)
| ~ subset(sF15,sK13) ),
inference(superposition,[],[f261,f197]) ).
fof(f395,plain,
( subset(sF16,sF18)
| ~ subset(sF15,sK14) ),
inference(superposition,[],[f261,f199]) ).
fof(f397,plain,
subset(sF16,sF18),
inference(forward_subsumption_resolution,[],[f395,f380]) ).
fof(f398,plain,
subset(sF16,sF17),
inference(forward_subsumption_resolution,[],[f394,f272]) ).
fof(f416,plain,
( ~ subset(sF16,sF17)
| subset(sF16,sF19) ),
inference(resolution,[],[f397,f332]) ).
fof(f428,plain,
subset(sF16,sF19),
inference(forward_subsumption_resolution,[],[f416,f398]) ).
fof(f429,plain,
$false,
inference(forward_subsumption_resolution,[],[f428,f370]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU111+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n011.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Mon Sep 28 03:35:35 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 8.38/2.25 % (2991183)Detected formulas, will run a generic FOF schedule.
% 8.38/2.25 % (2991260)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=2673581096:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 8.38/2.25 % (2991265)dis-21_1_sil=8000:lcm=predicate:random_seed=3623013936: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)
% 8.38/2.25 % (2991261)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=965324903:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 8.38/2.25 % (2991259)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=100524976:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 8.38/2.25 % (2991263)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2421637205:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 8.38/2.25 % (2991262)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1968039720:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 8.38/2.25 % (2991262)Refutation not found, incomplete strategy
% 8.38/2.25 % (2991262)------------------------------
% 8.38/2.25 % (2991262)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991262)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991262)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991262)Termination reason: Refutation not found, incomplete strategy
% 8.38/2.25 % (2991262)Time elapsed: 0.002 s
% 8.38/2.25 % (2991262)Peak memory usage: 88 MB
% 8.38/2.25 % (2991262)Instructions burned: 1 (million)
% 8.38/2.25 % (2991264)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3934051429:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 8.38/2.25 % (2991263)Instruction limit reached!
% 8.38/2.25 % (2991263)------------------------------
% 8.38/2.25 % (2991263)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991263)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991263)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991263)Termination reason: Instruction limit
% 8.38/2.25 % (2991263)Termination phase: Saturation
% 8.38/2.25 % (2991263)Time elapsed: 0.072 s
% 8.38/2.25 % (2991263)Peak memory usage: 88 MB
% 8.38/2.25 % (2991263)Instructions burned: 119 (million)
% 8.38/2.25 % (2991265)Instruction limit reached!
% 8.38/2.25 % (2991265)------------------------------
% 8.38/2.25 % (2991265)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991265)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991265)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991265)Termination reason: Instruction limit
% 8.38/2.25 % (2991265)Termination phase: Saturation
% 8.38/2.25 % (2991265)Time elapsed: 0.074 s
% 8.38/2.25 % (2991265)Peak memory usage: 89 MB
% 8.38/2.25 % (2991265)Instructions burned: 130 (million)
% 8.38/2.25 % (2991264)Instruction limit reached!
% 8.38/2.25 % (2991264)------------------------------
% 8.38/2.25 % (2991264)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991264)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991264)Termination reason: Instruction limit
% 8.38/2.25 % (2991264)Termination phase: Saturation
% 8.38/2.25 % (2991264)Time elapsed: 0.132 s
% 8.38/2.25 % (2991264)Peak memory usage: 89 MB
% 8.38/2.25 % (2991264)Instructions burned: 140 (million)
% 8.38/2.25 % (2991287)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3687509538:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 8.38/2.25 % (2991286)lrs+10_1_sil=8000:sp=occurrence:random_seed=1335851261:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 8.38/2.25 % (2991287)Refutation not found, incomplete strategy
% 8.38/2.25 % (2991287)------------------------------
% 8.38/2.25 % (2991287)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991287)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991287)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991287)Termination reason: Refutation not found, incomplete strategy
% 8.38/2.25 % (2991287)Time elapsed: 0.003 s
% 8.38/2.25 % (2991287)Peak memory usage: 88 MB
% 8.38/2.25 % (2991287)Instructions burned: 2 (million)
% 8.38/2.25 % (2991262)------------------------------
% 8.38/2.25 % (2991262)------------------------------
% 8.38/2.25 % (2991288)lrs+1011_1_sil=32000:sp=occurrence:random_seed=215764647:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 8.38/2.25 % (2991286)Instruction limit reached!
% 8.38/2.25 % (2991286)------------------------------
% 8.38/2.25 % (2991286)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991286)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991286)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991286)Termination reason: Instruction limit
% 8.38/2.25 % (2991286)Termination phase: Saturation
% 8.38/2.25 % (2991286)Time elapsed: 0.170 s
% 8.38/2.25 % (2991286)Peak memory usage: 91 MB
% 8.38/2.25 % (2991286)Instructions burned: 286 (million)
% 8.38/2.25 % (2991291)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=2087342575:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 8.38/2.25 % (2991287)------------------------------
% 8.38/2.25 % (2991287)------------------------------
% 8.38/2.25 % (2991291)Instruction limit reached!
% 8.38/2.25 % (2991291)------------------------------
% 8.38/2.25 % (2991291)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991291)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991291)Termination reason: Instruction limit
% 8.38/2.25 % (2991291)Termination phase: Saturation
% 8.38/2.25 % (2991291)Time elapsed: 0.164 s
% 8.38/2.25 % (2991291)Peak memory usage: 91 MB
% 8.38/2.25 % (2991291)Instructions burned: 249 (million)
% 8.38/2.25 % (2991288)Instruction limit reached!
% 8.38/2.25 % (2991288)------------------------------
% 8.38/2.25 % (2991288)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991288)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991288)Termination reason: Instruction limit
% 8.38/2.25 % (2991288)Termination phase: Saturation
% 8.38/2.25 % (2991288)Time elapsed: 0.263 s
% 8.38/2.25 % (2991288)Peak memory usage: 90 MB
% 8.38/2.25 % (2991288)Instructions burned: 325 (million)
% 8.38/2.25 % (2991294)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=265047029:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 8.38/2.25 % (2991294)Refutation not found, incomplete strategy
% 8.38/2.25 % (2991294)------------------------------
% 8.38/2.25 % (2991294)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991294)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991294)Termination reason: Refutation not found, incomplete strategy
% 8.38/2.25 % (2991294)Time elapsed: 0.004 s
% 8.38/2.25 % (2991294)Peak memory usage: 88 MB
% 8.38/2.25 % (2991294)Instructions burned: 2 (million)
% 8.38/2.25 % (2991259)First to succeed.
% 8.38/2.25 % (2991259)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2991183"
% 8.38/2.25 % (2991303)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1702015761:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 8.38/2.25 % (2991304)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1276881458:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 8.38/2.25 % (2991307)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=4222034701:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 8.38/2.25 % (2991307)Refutation not found, incomplete strategy
% 8.38/2.25 % (2991307)------------------------------
% 8.38/2.25 % (2991307)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991307)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991307)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991307)Termination reason: Refutation not found, incomplete strategy
% 8.38/2.25 % (2991307)Time elapsed: 0.004 s
% 8.38/2.25 % (2991307)Peak memory usage: 88 MB
% 8.38/2.25 % (2991307)Instructions burned: 2 (million)
% 8.38/2.25 % (2991304)Instruction limit reached!
% 8.38/2.25 % (2991304)------------------------------
% 8.38/2.25 % (2991304)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.38/2.25 % (2991304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.38/2.25 % (2991304)CaDiCaL version: 2.1.3
% 8.38/2.25 % (2991304)Termination reason: Instruction limit
% 8.38/2.25 % (2991304)Termination phase: Saturation
% 8.38/2.25 % (2991304)Time elapsed: 0.113 s
% 8.38/2.25 % (2991304)Peak memory usage: 89 MB
% 8.38/2.25 % (2991304)Instructions burned: 114 (million)
% 8.38/2.25 % (2991261)Also succeeded, but the first one will report.
% 8.38/2.25 % (2991294)------------------------------
% 8.38/2.25 % (2991294)------------------------------
% 8.38/2.25 % (2991322)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1252656307:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2989 on theBenchmark for (2989ds/114Mi)
% 8.38/2.25 % (2991259)Refutation found. Thanks to Tanya!
% 8.38/2.25 % SZS status Theorem for theBenchmark
% 8.38/2.25 % SZS output start Proof for theBenchmark
% See solution above
% 10.23/2.45 % (2991259)------------------------------
% 10.23/2.45 % (2991259)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.23/2.45 % (2991259)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.23/2.45 % (2991259)CaDiCaL version: 2.1.3
% 10.23/2.45 % (2991259)Termination reason: Refutation
% 10.23/2.45 % (2991259)Time elapsed: 0.764 s
% 10.23/2.45 % (2991259)Peak memory usage: 129 MB
% 10.23/2.45 % (2991259)Instructions burned: 968 (million)
% 10.23/2.45 % (2991259)------------------------------
% 10.23/2.45 % (2991259)------------------------------
% 10.23/2.45 % (2991183)Success in time 1.373 s
% 10.23/2.45 % Vampire exiting
%------------------------------------------------------------------------------