%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU111+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 : n001.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:57 PM UTC 2026
% Result : Theorem 2.50s 0.96s
% Output : Refutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of formulae : 96 ( 39 unt; 5 def)
% Number of atoms : 307 ( 49 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 349 ( 138 ~; 140 |; 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 : 152 ( 142 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f8,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f9,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',fc2_finsub_1) ).
fof(f31,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f34,axiom,
! [X0,X1] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
file('/export/starexec/sandbox2/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/sandbox2/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] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
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] :
( ~ subset(X3,X0)
| in(X3,finite_subsets(X0))
| ~ finite(X3) ),
inference(forward_subsumption_resolution,[],[f189,f143]) ).
fof(f245,plain,
subset(sF15,sK13),
inference(superposition,[],[f170,f193]) ).
fof(f301,plain,
! [X0] :
( ~ in(X0,sF18)
| finite(X0) ),
inference(superposition,[],[f203,f199]) ).
fof(f310,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X1),
inference(superposition,[],[f170,f114]) ).
fof(f338,plain,
! [X0] :
( ~ in(X0,sF17)
| subset(X0,sK13) ),
inference(superposition,[],[f204,f197]) ).
fof(f339,plain,
! [X0] :
( ~ in(X0,sF18)
| subset(X0,sK14) ),
inference(superposition,[],[f204,f199]) ).
fof(f354,plain,
! [X0] :
( subset(sF16,finite_subsets(X0))
| ~ subset(sF15,X0) ),
inference(superposition,[],[f173,f195]) ).
fof(f389,plain,
! [X0] :
( ~ in(X0,sF19)
| in(X0,sF17) ),
inference(superposition,[],[f187,f201]) ).
fof(f398,plain,
! [X0] :
( ~ in(X0,sF19)
| in(X0,sF18) ),
inference(superposition,[],[f188,f201]) ).
fof(f507,plain,
! [X0] :
( ~ subset(X0,sK14)
| ~ subset(X0,sK13)
| subset(X0,sF15) ),
inference(superposition,[],[f171,f193]) ).
fof(f508,plain,
! [X0] :
( ~ subset(X0,sF18)
| ~ subset(X0,sF17)
| subset(X0,sF19) ),
inference(superposition,[],[f171,f201]) ).
fof(f635,plain,
subset(sF15,sK14),
inference(superposition,[],[f310,f193]) ).
fof(f841,plain,
( subset(sF16,sF17)
| ~ subset(sF15,sK13) ),
inference(superposition,[],[f354,f197]) ).
fof(f842,plain,
( subset(sF16,sF18)
| ~ subset(sF15,sK14) ),
inference(superposition,[],[f354,f199]) ).
fof(f843,plain,
subset(sF16,sF18),
inference(forward_subsumption_resolution,[],[f842,f635]) ).
fof(f844,plain,
subset(sF16,sF17),
inference(forward_subsumption_resolution,[],[f841,f245]) ).
fof(f1146,plain,
( ~ subset(sF16,sF17)
| subset(sF16,sF19) ),
inference(resolution,[],[f508,f843]) ).
fof(f1171,plain,
subset(sF16,sF19),
inference(forward_subsumption_resolution,[],[f1146,f844]) ).
fof(f1208,plain,
( ~ subset(sF19,sF16)
| sF16 = sF19 ),
inference(resolution,[],[f1171,f117]) ).
fof(f1210,plain,
~ subset(sF19,sF16),
inference(forward_subsumption_resolution,[],[f1208,f202]) ).
fof(f1227,plain,
in(sK0(sF19,sF16),sF19),
inference(resolution,[],[f1210,f119]) ).
fof(f1237,plain,
in(sK0(sF19,sF16),sF18),
inference(resolution,[],[f1227,f398]) ).
fof(f1238,plain,
in(sK0(sF19,sF16),sF17),
inference(resolution,[],[f1227,f389]) ).
fof(f2040,plain,
subset(sK0(sF19,sF16),sK14),
inference(resolution,[],[f1237,f339]) ).
fof(f2041,plain,
finite(sK0(sF19,sF16)),
inference(resolution,[],[f1237,f301]) ).
fof(f2063,plain,
subset(sK0(sF19,sF16),sK13),
inference(resolution,[],[f1238,f338]) ).
fof(f2225,plain,
( ~ subset(sK0(sF19,sF16),sK13)
| subset(sK0(sF19,sF16),sF15) ),
inference(resolution,[],[f2040,f507]) ).
fof(f2246,plain,
subset(sK0(sF19,sF16),sF15),
inference(forward_subsumption_resolution,[],[f2225,f2063]) ).
fof(f3739,plain,
( in(sK0(sF19,sF16),finite_subsets(sF15))
| ~ finite(sK0(sF19,sF16)) ),
inference(resolution,[],[f2246,f205]) ).
fof(f3757,plain,
in(sK0(sF19,sF16),finite_subsets(sF15)),
inference(forward_subsumption_resolution,[],[f3739,f2041]) ).
fof(f3763,plain,
in(sK0(sF19,sF16),sF16),
inference(forward_demodulation,[],[f3757,f195]) ).
fof(f3845,plain,
subset(sF19,sF16),
inference(resolution,[],[f3763,f120]) ).
fof(f3852,plain,
$false,
inference(forward_subsumption_resolution,[],[f3845,f1210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU111+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n001.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:41:22 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/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
% 2.50/0.96 % (4186919)Will run a generic schedule for satisfiability detection.
% 2.50/0.96 % (4186926)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2006441009:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.50/0.96 % (4186925)% WARNING: option uhcvi not known.
% 2.50/0.96 % (4186924)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3729341766_2999 on theBenchmark for (2999ds/0Mi)
% 2.50/0.96 % (4186925)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=773907306:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.50/0.96 % (4186928)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=250930614:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.50/0.96 % (4186927)dis+10_1_sil=32000:sp=arity:random_seed=4066839218:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.50/0.96 % (4186929)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=398738417:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.50/0.96 % (4186930)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3499641754:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.50/0.96 % TRYING [1]
% 2.50/0.96 % TRYING [2]
% 2.50/0.96 % TRYING [3]
% 2.50/0.96 % TRYING [4]
% 2.50/0.96 % TRYING [5]
% 2.50/0.96 % TRYING [6]
% 2.50/0.96 % (4186927)Instruction limit reached!
% 2.50/0.96 % (4186927)------------------------------
% 2.50/0.96 % (4186927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.96 % (4186927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.96 % (4186927)CaDiCaL version: 2.1.3
% 2.50/0.96 % (4186927)Termination reason: Instruction limit
% 2.50/0.96 % (4186927)Termination phase: Saturation
% 2.50/0.96 % (4186927)Time elapsed: 0.065 s
% 2.50/0.96 % (4186927)Peak memory usage: 12 MB
% 2.50/0.96 % (4186927)Instructions burned: 104 (million)
% 2.50/0.96 % TRYING [7]
% 2.50/0.96 % (4186928)Instruction limit reached!
% 2.50/0.96 % (4186928)------------------------------
% 2.50/0.96 % (4186928)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.96 % (4186928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.96 % (4186928)CaDiCaL version: 2.1.3
% 2.50/0.96 % (4186928)Termination reason: Instruction limit
% 2.50/0.96 % (4186928)Termination phase: Saturation
% 2.50/0.96 % (4186928)Time elapsed: 0.071 s
% 2.50/0.96 % (4186928)Peak memory usage: 12 MB
% 2.50/0.96 % (4186928)Instructions burned: 117 (million)
% 2.50/0.96 % (4186929)Instruction limit reached!
% 2.50/0.96 % (4186929)------------------------------
% 2.50/0.96 % (4186929)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.96 % (4186929)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.96 % (4186929)CaDiCaL version: 2.1.3
% 2.50/0.96 % (4186929)Termination reason: Instruction limit
% 2.50/0.96 % (4186929)Termination phase: Saturation
% 2.50/0.96 % (4186929)Time elapsed: 0.084 s
% 2.50/0.96 % (4186929)Peak memory usage: 13 MB
% 2.50/0.96 % (4186929)Instructions burned: 131 (million)
% 2.50/0.96 % (4186938)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3318286399:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.50/0.96 % TRYING [1]
% 2.50/0.96 % TRYING [2]
% 2.50/0.96 % (4186939)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4258364386:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.50/0.96 % TRYING [3]
% 2.50/0.96 % TRYING [4]
% 2.50/0.96 % (4186930)Instruction limit reached!
% 2.50/0.96 % (4186930)------------------------------
% 2.50/0.96 % (4186930)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.96 % (4186930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.96 % (4186930)CaDiCaL version: 2.1.3
% 2.50/0.96 % (4186930)Termination reason: Instruction limit
% 2.50/0.96 % (4186930)Termination phase: Saturation
% 2.50/0.96 % (4186930)Time elapsed: 0.102 s
% 2.50/0.96 % (4186930)Peak memory usage: 14 MB
% 2.50/0.96 % (4186930)Instructions burned: 159 (million)
% 2.50/0.96 % TRYING [5]
% 2.50/0.96 % (4186941)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=884188936:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.50/0.96 % TRYING [6]
% 2.50/0.96 % (4186944)ott-21_1_sil=16000:fs=off:random_seed=1630819390:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.50/0.96 % TRYING [8]
% 2.50/0.96 % TRYING [7]
% 2.50/0.96 % (4186939)Instruction limit reached!
% 2.50/0.96 % (4186939)------------------------------
% 2.50/0.96 % (4186939)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.96 % (4186939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.96 % (4186939)CaDiCaL version: 2.1.3
% 2.50/0.96 % (4186939)Termination reason: Instruction limit
% 2.50/0.96 % (4186939)Termination phase: Saturation
% 2.50/0.96 % (4186939)Time elapsed: 0.089 s
% 2.50/0.96 % (4186939)Peak memory usage: 13 MB
% 2.50/0.96 % (4186939)Instructions burned: 132 (million)
% 2.50/0.96 % (4186946)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3813174532:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.50/0.96 % (4186944)Instruction limit reached!
% 2.50/0.96 % (4186944)------------------------------
% 2.50/0.96 % (4186944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.96 % (4186944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.96 % (4186944)CaDiCaL version: 2.1.3
% 2.50/0.96 % (4186944)Termination reason: Instruction limit
% 2.50/0.96 % (4186944)Termination phase: Saturation
% 2.50/0.96 % (4186944)Time elapsed: 0.091 s
% 2.50/0.96 % (4186944)Peak memory usage: 12 MB
% 2.50/0.96 % (4186944)Instructions burned: 182 (million)
% 2.50/0.96 % (4186948)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2328710475:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.50/0.96 % TRYING [1]
% 2.50/0.96 % TRYING [2]
% 2.50/0.96 % TRYING [3]
% 2.50/0.96 % TRYING [4]
% 2.50/0.96 % TRYING [5]
% 2.50/0.96 % TRYING [6]
% 2.50/0.96 % TRYING [8]
% 2.50/0.96 % TRYING [7]
% 2.50/0.96 % (4186938)Instruction limit reached!
% 2.50/0.96 % (4186938)------------------------------
% 2.50/0.96 % (4186938)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.96 % (4186938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.96 % (4186938)CaDiCaL version: 2.1.3
% 2.50/0.96 % (4186938)Termination reason: Instruction limit
% 2.50/0.96 % (4186938)Termination phase: Finite model building constraint generation
% 2.50/0.96 % (4186938)Time elapsed: 0.302 s
% 2.50/0.96 % (4186938)Peak memory usage: 25 MB
% 2.50/0.96 % (4186938)Instructions burned: 715 (million)
% 2.50/0.96 % (4186950)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=410233109:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 2.50/0.96 % TRYING [9]
% 2.50/0.96 % (4186950) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4186919-4186950"...
% 2.50/0.96 % (4186941)Instruction limit reached!
% 2.50/0.96 % (4186941)------------------------------
% 2.50/0.96 % (4186941)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.96 % (4186941)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.96 % (4186941)CaDiCaL version: 2.1.3
% 2.50/0.96 % (4186941)Termination reason: Instruction limit
% 2.50/0.96 % (4186941)Termination phase: Saturation
% 2.50/0.96 % (4186941)Time elapsed: 0.401 s
% 2.50/0.96 % (4186941)Peak memory usage: 20 MB
% 2.50/0.96 % (4186941)Instructions burned: 684 (million)
% 2.50/0.96 % (4186950)...printing done.
% 2.50/0.96 % (4186950)Refutation found. Thanks to Tanya!
% 2.50/0.96 % SZS status Theorem for theBenchmark
% 2.50/0.96 % SZS output start Proof for theBenchmark
% See solution above
% 2.50/0.96 % (4186950)------------------------------
% 2.50/0.96 % (4186950)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.50/0.96 % (4186950)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/0.96 % (4186950)CaDiCaL version: 2.1.3
% 2.50/0.96 % (4186950)Termination reason: Refutation
% 2.50/0.96 % (4186950)Time elapsed: 0.094 s
% 2.50/0.96 % (4186950)Peak memory usage: 13 MB
% 2.50/0.96 % (4186950)Instructions burned: 153 (million)
% 2.50/0.96 % (4186919)Success in time 0.546 s
% 2.50/0.96 % Vampire exiting
%------------------------------------------------------------------------------