%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW102+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 01:29:45 PM UTC 2026
% Result : Theorem 6.34s 1.49s
% Output : Refutation 7.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 25
% Syntax : Number of formulae : 136 ( 43 unt; 6 def)
% Number of atoms : 313 ( 131 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 310 ( 133 ~; 120 |; 42 &)
% ( 11 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn 79 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( bool(X0)
<=> ( X0 = false
| X0 = true ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_bool) ).
fof(f2,axiom,
( true != false
& true != err
& false != err ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct_false_true_err) ).
fof(f3,axiom,
( d(true)
& d(false)
& d(err) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false_true_err_in_d) ).
fof(f4,axiom,
! [X0,X1] :
( forallprefers(X0,X1)
<=> ( ( ~ d(X0)
& d(X1) )
| ( d(X0)
& d(X1)
& ~ bool(X0)
& bool(X1) )
| ( X0 = false
& X1 = true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_forallprefers) ).
fof(f6,axiom,
! [X0] :
( ( d(X0)
& phi(X0) = X0 )
| ( ~ d(X0)
& phi(X0) = err ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_phi) ).
fof(f7,axiom,
! [X0] :
( prop(X0) = true
<=> bool(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop_true) ).
fof(f8,axiom,
! [X0] :
( prop(X0) = false
<=> ~ bool(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop_false) ).
fof(f9,axiom,
! [X0,X1] :
( ~ bool(X0)
=> impl(X0,X1) = phi(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',impl_axiom1) ).
fof(f11,axiom,
! [X0] :
( bool(X0)
=> impl(false,X0) = true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',impl_axiom3) ).
fof(f12,axiom,
! [X0] :
( bool(X0)
=> impl(true,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',impl_axiom4) ).
fof(f14,axiom,
! [X0] : lazy_impl(false,X0) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lazy_impl_axiom2) ).
fof(f15,axiom,
! [X0] : lazy_impl(true,X0) = phi(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lazy_impl_axiom3) ).
fof(f39,axiom,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_f7) ).
fof(f40,axiom,
? [X0] :
( false2 = phi(f7(X0))
& ~ ? [X1] : forallprefers(f7(X1),f7(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_false2) ).
fof(f41,axiom,
! [X0] :
( ~ bool(X0)
=> not1(X0) = phi(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not1_axiom1) ).
fof(f42,axiom,
not1(false) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not1_axiom2) ).
fof(f43,axiom,
not1(true) = false,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not1_axiom3) ).
fof(f44,axiom,
! [X0] : not2(X0) = impl(X0,false2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_not2) ).
fof(f45,conjecture,
! [X0] : not1(X0) = not2(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not1_not2) ).
fof(f46,negated_conjecture,
~ ! [X0] : not1(X0) = not2(X0),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
? [X0] : not1(X0) != not2(X0),
inference(ennf_transformation,[],[f46]) ).
fof(f48,plain,
! [X0] :
( not1(X0) = phi(X0)
| bool(X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f49,plain,
! [X0] :
( impl(true,X0) = X0
| ~ bool(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f50,plain,
! [X0] :
( impl(false,X0) = true
| ~ bool(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f53,plain,
! [X0,X1] :
( impl(X0,X1) = phi(X0)
| bool(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f54,plain,
? [X0] :
( false2 = phi(f7(X0))
& ! [X1] : ~ forallprefers(f7(X1),f7(X0)) ),
inference(ennf_transformation,[],[f40]) ).
fof(f62,definition,
! [X0,X1] :
( sP0(X0,X1)
<=> ( ( ~ d(X0)
& d(X1) )
| ( d(X0)
& d(X1)
& ~ bool(X0)
& bool(X1) )
| ( X0 = false
& X1 = true ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f63,plain,
! [X0,X1] :
( forallprefers(X0,X1)
<=> sP0(X0,X1) ),
inference(definition_folding,[],[f4,f62]) ).
fof(f66,plain,
not1(sK2) != not2(sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f47]) ).
fof(f67,plain,
! [X0] :
( ( bool(X0)
| ( false != X0
& true != X0 ) )
& ( X0 = false
| X0 = true
| ~ bool(X0) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f68,plain,
! [X0] :
( ( bool(X0)
| ( false != X0
& true != X0 ) )
& ( X0 = false
| X0 = true
| ~ bool(X0) ) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
( false2 = phi(f7(sK3))
& ! [X1] : ~ forallprefers(f7(X1),f7(sK3)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f54]) ).
fof(f70,plain,
! [X0] :
( ( prop(X0) = false
| bool(X0) )
& ( ~ bool(X0)
| false != prop(X0) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f71,plain,
! [X0] :
( ( prop(X0) = true
| ~ bool(X0) )
& ( bool(X0)
| true != prop(X0) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f78,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ( ( d(X0)
| ~ d(X1) )
& ( ~ d(X0)
| ~ d(X1)
| bool(X0)
| ~ bool(X1) )
& ( false != X0
| true != X1 ) ) )
& ( ( ~ d(X0)
& d(X1) )
| ( d(X0)
& d(X1)
& ~ bool(X0)
& bool(X1) )
| ( X0 = false
& X1 = true )
| ~ sP0(X0,X1) ) ),
inference(nnf_transformation,[],[f62]) ).
fof(f79,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ( ( d(X0)
| ~ d(X1) )
& ( ~ d(X0)
| ~ d(X1)
| bool(X0)
| ~ bool(X1) )
& ( false != X0
| true != X1 ) ) )
& ( ( ~ d(X0)
& d(X1) )
| ( d(X0)
& d(X1)
& ~ bool(X0)
& bool(X1) )
| ( X0 = false
& X1 = true )
| ~ sP0(X0,X1) ) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0,X1] :
( ( forallprefers(X0,X1)
| ~ sP0(X0,X1) )
& ( sP0(X0,X1)
| ~ forallprefers(X0,X1) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f84,plain,
not1(sK2) != not2(sK2),
inference(cnf_transformation,[],[f66]) ).
fof(f85,plain,
false = not1(true),
inference(cnf_transformation,[],[f43]) ).
fof(f86,plain,
true = not1(false),
inference(cnf_transformation,[],[f42]) ).
fof(f87,plain,
! [X0] :
( phi(X0) = not1(X0)
| bool(X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f88,plain,
! [X0] : not2(X0) = impl(X0,false2),
inference(cnf_transformation,[],[f44]) ).
fof(f89,plain,
! [X0] :
( ~ bool(X0)
| true = X0
| false = X0 ),
inference(cnf_transformation,[],[f68]) ).
fof(f90,plain,
! [X0] :
( bool(X0)
| true != X0 ),
inference(cnf_transformation,[],[f68]) ).
fof(f91,plain,
! [X0] :
( bool(X0)
| false != X0 ),
inference(cnf_transformation,[],[f68]) ).
fof(f97,plain,
! [X0] :
( ~ bool(X0)
| impl(true,X0) = X0 ),
inference(cnf_transformation,[],[f49]) ).
fof(f98,plain,
! [X0] :
( ~ bool(X0)
| true = impl(false,X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f100,plain,
! [X0,X1] :
( phi(X0) = impl(X0,X1)
| bool(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f101,plain,
! [X1] : ~ forallprefers(f7(X1),f7(sK3)),
inference(cnf_transformation,[],[f69]) ).
fof(f102,plain,
false2 = phi(f7(sK3)),
inference(cnf_transformation,[],[f69]) ).
fof(f103,plain,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
inference(cnf_transformation,[],[f39]) ).
fof(f105,plain,
! [X0] :
( bool(X0)
| false = prop(X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f107,plain,
! [X0] :
( ~ bool(X0)
| true = prop(X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f108,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(cnf_transformation,[],[f15]) ).
fof(f109,plain,
! [X0] : true = lazy_impl(false,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f139,plain,
! [X0,X1] :
( sP0(X0,X1)
| false != X0
| true != X1 ),
inference(cnf_transformation,[],[f79]) ).
fof(f143,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| forallprefers(X0,X1) ),
inference(cnf_transformation,[],[f80]) ).
fof(f166,plain,
! [X0] :
( phi(X0) = X0
| ~ d(X0) ),
inference(cnf_transformation,[],[f6]) ).
fof(f170,plain,
d(false),
inference(cnf_transformation,[],[f3]) ).
fof(f171,plain,
d(true),
inference(cnf_transformation,[],[f3]) ).
fof(f174,plain,
false != true,
inference(cnf_transformation,[],[f2]) ).
fof(f182,plain,
not1(sK2) != impl(sK2,false2),
inference(definition_unfolding,[],[f84,f88]) ).
fof(f183,plain,
! [X0] :
( bool(X0)
| lazy_impl(true,X0) = not1(X0) ),
inference(definition_unfolding,[],[f87,f108]) ).
fof(f185,plain,
! [X0,X1] :
( bool(X0)
| impl(X0,X1) = lazy_impl(true,X0) ),
inference(definition_unfolding,[],[f100,f108]) ).
fof(f186,plain,
false2 = lazy_impl(true,lazy_impl(prop(sK3),sK3)),
inference(definition_unfolding,[],[f102,f108,f103]) ).
fof(f187,plain,
! [X1] : ~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(sK3),sK3)),
inference(definition_unfolding,[],[f101,f103,f103]) ).
fof(f195,plain,
! [X0] :
( ~ d(X0)
| lazy_impl(true,X0) = X0 ),
inference(definition_unfolding,[],[f166,f108]) ).
fof(f197,plain,
bool(false),
inference(equality_resolution,[],[f91]) ).
fof(f198,plain,
bool(true),
inference(equality_resolution,[],[f90]) ).
fof(f199,plain,
! [X1] :
( sP0(false,X1)
| true != X1 ),
inference(equality_resolution,[],[f139]) ).
fof(f200,plain,
sP0(false,true),
inference(equality_resolution,[],[f199]) ).
fof(f204,plain,
true = prop(true),
inference(resolution,[],[f198,f107]) ).
fof(f232,definition,
( spl10_5
<=> ! [X0] : ~ forallprefers(lazy_impl(prop(X0),X0),true) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
fof(f233,plain,
( ! [X0] : ~ forallprefers(lazy_impl(prop(X0),X0),true)
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f239,plain,
true = prop(false),
inference(resolution,[],[f197,f107]) ).
fof(f240,plain,
false = impl(true,false),
inference(resolution,[],[f197,f97]) ).
fof(f244,plain,
forallprefers(false,true),
inference(resolution,[],[f200,f143]) ).
fof(f245,plain,
true = lazy_impl(true,true),
inference(resolution,[],[f195,f171]) ).
fof(f247,plain,
false = lazy_impl(true,false),
inference(resolution,[],[f170,f195]) ).
fof(f249,plain,
! [X0] :
( false = prop(X0)
| false = X0
| true = X0 ),
inference(resolution,[],[f89,f105]) ).
fof(f254,plain,
! [X0] :
( ~ forallprefers(lazy_impl(prop(X0),X0),lazy_impl(false,sK3))
| false = sK3
| true = sK3 ),
inference(superposition,[],[f187,f249]) ).
fof(f257,plain,
! [X0] :
( ~ forallprefers(lazy_impl(prop(X0),X0),true)
| false = sK3
| true = sK3 ),
inference(forward_demodulation,[],[f254,f109]) ).
fof(f263,definition,
( spl10_6
<=> true = sK3 ),
introduced(definition,[new_symbols(definition,[spl10_6])],[avatar_definition]) ).
fof(f264,plain,
( true = sK3
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f266,definition,
( spl10_7
<=> false = sK3 ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
fof(f267,plain,
( false = sK3
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f268,plain,
( spl10_6
| spl10_7
| spl10_5 ),
inference(avatar_split_clause,[],[f257,f232,f266,f263]) ).
fof(f286,plain,
( ! [X0] : ~ forallprefers(lazy_impl(prop(X0),X0),lazy_impl(prop(true),true))
| ~ spl10_6 ),
inference(superposition,[],[f187,f264]) ).
fof(f289,plain,
( ! [X0] : ~ forallprefers(lazy_impl(prop(X0),X0),lazy_impl(true,true))
| ~ spl10_6 ),
inference(forward_demodulation,[],[f286,f204]) ).
fof(f291,plain,
( ! [X0] : ~ forallprefers(lazy_impl(prop(X0),X0),true)
| ~ spl10_6 ),
inference(forward_demodulation,[],[f289,f245]) ).
fof(f293,plain,
( spl10_5
| ~ spl10_6 ),
inference(avatar_split_clause,[],[f291,f263,f232]) ).
fof(f299,plain,
( false2 = lazy_impl(true,lazy_impl(prop(false),false))
| ~ spl10_7 ),
inference(superposition,[],[f186,f267]) ).
fof(f300,plain,
( false2 = lazy_impl(true,lazy_impl(true,false))
| ~ spl10_7 ),
inference(forward_demodulation,[],[f299,f239]) ).
fof(f302,plain,
( false2 = lazy_impl(true,false)
| ~ spl10_7 ),
inference(forward_demodulation,[],[f300,f247]) ).
fof(f304,plain,
( false = false2
| ~ spl10_7 ),
inference(forward_demodulation,[],[f302,f247]) ).
fof(f305,plain,
( not1(sK2) != impl(sK2,false)
| ~ spl10_7 ),
inference(superposition,[],[f182,f304]) ).
fof(f307,plain,
! [X0] :
( lazy_impl(true,X0) = not1(X0)
| true = prop(X0) ),
inference(resolution,[],[f183,f107]) ).
fof(f310,plain,
! [X0,X1] :
( impl(X0,X1) = lazy_impl(true,X0)
| true = prop(X0) ),
inference(resolution,[],[f185,f107]) ).
fof(f462,plain,
true = impl(false,false),
inference(resolution,[],[f98,f197]) ).
fof(f501,plain,
! [X0,X1] :
( impl(X0,X1) = not1(X0)
| true = prop(X0)
| true = prop(X0) ),
inference(superposition,[],[f307,f310]) ).
fof(f509,plain,
! [X0,X1] :
( impl(X0,X1) = not1(X0)
| true = prop(X0) ),
inference(duplicate_literal_removal,[],[f501]) ).
fof(f549,plain,
( not1(sK2) != not1(sK2)
| true = prop(sK2)
| ~ spl10_7 ),
inference(superposition,[],[f305,f509]) ).
fof(f550,plain,
( true = prop(sK2)
| ~ spl10_7 ),
inference(trivial_inequality_removal,[],[f549]) ).
fof(f554,plain,
( false = true
| false = sK2
| true = sK2
| ~ spl10_7 ),
inference(superposition,[],[f550,f249]) ).
fof(f564,plain,
( false = sK2
| true = sK2
| ~ spl10_7 ),
inference(forward_subsumption_resolution,[],[f554,f174]) ).
fof(f567,definition,
( spl10_11
<=> true = sK2 ),
introduced(definition,[new_symbols(definition,[spl10_11])],[avatar_definition]) ).
fof(f568,plain,
( true = sK2
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f567]) ).
fof(f570,definition,
( spl10_12
<=> false = sK2 ),
introduced(definition,[new_symbols(definition,[spl10_12])],[avatar_definition]) ).
fof(f571,plain,
( false = sK2
| ~ spl10_12 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f574,plain,
( spl10_11
| spl10_12
| ~ spl10_7 ),
inference(avatar_split_clause,[],[f564,f266,f570,f567]) ).
fof(f639,plain,
( not1(true) != impl(true,false2)
| ~ spl10_11 ),
inference(superposition,[],[f182,f568]) ).
fof(f651,plain,
( ~ forallprefers(lazy_impl(true,false),true)
| ~ spl10_5 ),
inference(superposition,[],[f233,f239]) ).
fof(f656,plain,
( ~ forallprefers(false,true)
| ~ spl10_5 ),
inference(forward_demodulation,[],[f651,f247]) ).
fof(f661,plain,
( $false
| ~ spl10_5 ),
inference(forward_subsumption_resolution,[],[f656,f244]) ).
fof(f662,plain,
~ spl10_5,
inference(avatar_contradiction_clause,[],[f661]) ).
fof(f673,plain,
( false != impl(true,false2)
| ~ spl10_11 ),
inference(forward_demodulation,[],[f639,f85]) ).
fof(f678,plain,
( false != impl(true,false)
| ~ spl10_7
| ~ spl10_11 ),
inference(forward_demodulation,[],[f673,f304]) ).
fof(f683,plain,
( $false
| ~ spl10_7
| ~ spl10_11 ),
inference(forward_subsumption_resolution,[],[f678,f240]) ).
fof(f684,plain,
( ~ spl10_7
| ~ spl10_11 ),
inference(avatar_contradiction_clause,[],[f683]) ).
fof(f690,plain,
( not1(false) != impl(false,false2)
| ~ spl10_12 ),
inference(superposition,[],[f182,f571]) ).
fof(f691,plain,
( not1(false) != impl(false,false)
| ~ spl10_7
| ~ spl10_12 ),
inference(forward_demodulation,[],[f690,f304]) ).
fof(f692,plain,
( true != not1(false)
| ~ spl10_7
| ~ spl10_12 ),
inference(forward_demodulation,[],[f691,f462]) ).
fof(f693,plain,
( $false
| ~ spl10_7
| ~ spl10_12 ),
inference(forward_subsumption_resolution,[],[f692,f86]) ).
fof(f694,plain,
( ~ spl10_7
| ~ spl10_12 ),
inference(avatar_contradiction_clause,[],[f693]) ).
cnf(s4,plain,
( spl10_5
| spl10_6
| spl10_7 ),
inference(sat_conversion,[],[f268]) ).
cnf(s9,plain,
( spl10_5
| ~ spl10_6 ),
inference(sat_conversion,[],[f293]) ).
cnf(s12,plain,
( ~ spl10_7
| spl10_11
| spl10_12 ),
inference(sat_conversion,[],[f574]) ).
cnf(s26,plain,
~ spl10_5,
inference(sat_conversion,[],[f662]) ).
cnf(s29,plain,
( ~ spl10_7
| ~ spl10_11 ),
inference(sat_conversion,[],[f684]) ).
cnf(s30,plain,
( ~ spl10_7
| ~ spl10_12 ),
inference(sat_conversion,[],[f694]) ).
cnf(s31,plain,
~ spl10_6,
inference(rat,[],[s9,s26]) ).
cnf(s35,plain,
spl10_7,
inference(rat,[],[s4,s31,s26]) ).
cnf(s36,plain,
~ spl10_12,
inference(rat,[],[s30,s35]) ).
cnf(s37,plain,
~ spl10_11,
inference(rat,[],[s29,s35]) ).
cnf(s39,plain,
$false,
inference(rat,[],[s12,s36,s37,s35]) ).
fof(f695,plain,
$false,
inference(avatar_sat_refutation,[],[s39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW102+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 % Computer : n002.cluster.edu
% 0.07/0.20 % Model : x86_64 x86_64
% 0.07/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.20 % Memory : 8046.5625MB
% 0.07/0.20 % OS : Linux 6.8.0-71-generic
% 0.07/0.20 % CPULimit : 300
% 0.07/0.20 % WCLimit : 300
% 0.07/0.20 % DateTime : Mon Sep 28 13:14:37 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running first-order theorem proving
% 0.07/0.23 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
% 6.34/1.49 % (343534)Detected formulas, will run a generic FOF schedule.
% 6.34/1.49 % (343545)dis-21_1_sil=8000:lcm=predicate:random_seed=3588324216: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)
% 6.34/1.49 % (343545)Refutation not found, incomplete strategy
% 6.34/1.49 % (343545)------------------------------
% 6.34/1.49 % (343545)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343545)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343545)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343545)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.49 % (343545)Time elapsed: 0.002 s
% 6.34/1.49 % (343545)Peak memory usage: 88 MB
% 6.34/1.49 % (343545)Instructions burned: 5 (million)
% 6.34/1.49 % (343539)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=3141193635:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.34/1.49 % (343541)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=3409442635:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.34/1.49 % (343542)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2938442189:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.34/1.49 % (343543)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2761089750:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.34/1.49 % (343540)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=2773723851:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.34/1.49 % (343542)Refutation not found, incomplete strategy
% 6.34/1.49 % (343542)------------------------------
% 6.34/1.49 % (343542)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343542)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343542)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343542)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.49 % (343542)Time elapsed: 0.001 s
% 6.34/1.49 % (343542)Peak memory usage: 88 MB
% 6.34/1.49 % (343544)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=31700016:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.34/1.49 % (343543)Instruction limit reached!
% 6.34/1.49 % (343543)------------------------------
% 6.34/1.49 % (343543)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343543)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343543)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343543)Termination reason: Instruction limit
% 6.34/1.49 % (343543)Termination phase: Saturation
% 6.34/1.49 % (343543)Time elapsed: 0.067 s
% 6.34/1.49 % (343543)Peak memory usage: 88 MB
% 6.34/1.49 % (343543)Instructions burned: 119 (million)
% 6.34/1.49 % (343544)Instruction limit reached!
% 6.34/1.49 % (343544)------------------------------
% 6.34/1.49 % (343544)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343544)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343544)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343544)Termination reason: Instruction limit
% 6.34/1.49 % (343544)Termination phase: Saturation
% 6.34/1.49 % (343544)Time elapsed: 0.091 s
% 6.34/1.49 % (343544)Peak memory usage: 90 MB
% 6.34/1.49 % (343544)Instructions burned: 140 (million)
% 6.34/1.49 % (343545)------------------------------
% 6.34/1.49 % (343545)------------------------------
% 6.34/1.49 % (343555)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2626797290:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.34/1.49 % (343555)Refutation not found, incomplete strategy
% 6.34/1.49 % (343555)------------------------------
% 6.34/1.49 % (343555)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343555)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343555)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343555)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.49 % (343555)Time elapsed: 0.001 s
% 6.34/1.49 % (343555)Peak memory usage: 88 MB
% 6.34/1.49 % (343553)lrs+10_1_sil=8000:sp=occurrence:random_seed=3742325701:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.34/1.49 % (343554)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1918917691:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.34/1.49 % (343554)Refutation not found, incomplete strategy
% 6.34/1.49 % (343554)------------------------------
% 6.34/1.49 % (343554)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343554)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343554)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343554)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.49 % (343554)Time elapsed: 0.001 s
% 6.34/1.49 % (343554)Peak memory usage: 88 MB
% 6.34/1.49 % (343542)------------------------------
% 6.34/1.49 % (343542)------------------------------
% 6.34/1.49 % (343553)Instruction limit reached!
% 6.34/1.49 % (343553)------------------------------
% 6.34/1.49 % (343553)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343553)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343553)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343553)Termination reason: Instruction limit
% 6.34/1.49 % (343553)Termination phase: Saturation
% 6.34/1.49 % (343553)Time elapsed: 0.132 s
% 6.34/1.49 % (343553)Peak memory usage: 89 MB
% 6.34/1.49 % (343553)Instructions burned: 285 (million)
% 6.34/1.49 % (343555)------------------------------
% 6.34/1.49 % (343555)------------------------------
% 6.34/1.49 % (343559)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=360874740:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 6.34/1.49 [W928 13:14:38.606933874 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 6.34/1.49 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 6.34/1.49 [W928 13:14:38.606977077 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 6.34/1.49 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 6.34/1.49 [W928 13:14:38.607023071 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 6.34/1.49 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 6.34/1.49 [W928 13:14:38.607035881 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 6.34/1.49 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 6.34/1.49 [W928 13:14:38.607068474 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 6.34/1.49 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 6.34/1.49 [W928 13:14:38.607080797 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 6.34/1.49 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 6.34/1.49 % (343561)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3222677569:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 6.34/1.49 % (343560)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3299300522:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 6.34/1.49 % (343560)Refutation not found, incomplete strategy
% 6.34/1.49 % (343560)------------------------------
% 6.34/1.49 % (343560)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343560)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343560)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343560)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.49 % (343560)Time elapsed: 0.002 s
% 6.34/1.49 % (343560)Peak memory usage: 88 MB
% 6.34/1.49 % (343560)Instructions burned: 1 (million)
% 6.34/1.49 % (343554)------------------------------
% 6.34/1.49 % (343554)------------------------------
% 6.34/1.49 % (343559)Instruction limit reached!
% 6.34/1.49 % (343559)------------------------------
% 6.34/1.49 % (343559)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343559)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343559)Termination reason: Instruction limit
% 6.34/1.49 % (343559)Termination phase: Saturation
% 6.34/1.49 % (343559)Time elapsed: 0.161 s
% 6.34/1.49 % (343559)Peak memory usage: 91 MB
% 6.34/1.49 % (343559)Instructions burned: 248 (million)
% 6.34/1.49 % (343541)Refutation not found, incomplete strategy
% 6.34/1.49 % (343541)------------------------------
% 6.34/1.49 % (343541)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343541)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343541)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.49 % (343541)Time elapsed: 0.621 s
% 6.34/1.49 % (343541)Peak memory usage: 127 MB
% 6.34/1.49 % (343541)Instructions burned: 886 (million)
% 6.34/1.49 % (343565)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2724762458:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 6.34/1.49 % (343540)First to succeed.
% 6.34/1.49 % (343565)Refutation not found, incomplete strategy
% 6.34/1.49 % (343565)------------------------------
% 6.34/1.49 % (343565)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343565)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343565)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343565)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.49 % (343565)Time elapsed: 0.020 s
% 6.34/1.49 % (343565)Peak memory usage: 89 MB
% 6.34/1.49 % (343565)Instructions burned: 29 (million)
% 6.34/1.49 % (343540)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-343534"
% 6.34/1.49 % (343566)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1604819417:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 6.34/1.49 % (343566)Refutation not found, incomplete strategy
% 6.34/1.49 % (343566)------------------------------
% 6.34/1.49 % (343566)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.49 % (343566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.49 % (343566)CaDiCaL version: 2.1.3
% 6.34/1.49 % (343566)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.49 % (343566)Time elapsed: 0.002 s
% 6.34/1.49 % (343566)Peak memory usage: 88 MB
% 6.34/1.49 % (343566)Instructions burned: 2 (million)
% 6.34/1.49 % (343539)Also succeeded, but the first one will report.
% 6.34/1.49 % (343560)------------------------------
% 6.34/1.49 % (343560)------------------------------
% 6.34/1.49 % (343561)Also succeeded, but the first one will report.
% 6.34/1.49 % (343569)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3264871907:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 6.34/1.49 % (343541)------------------------------
% 6.34/1.49 % (343541)------------------------------
% 6.34/1.49 % (343565)------------------------------
% 6.34/1.49 % (343565)------------------------------
% 6.34/1.49 % (343566)------------------------------
% 6.34/1.49 % (343566)------------------------------
% 6.34/1.49 % (343540)Refutation found. Thanks to Tanya!
% 6.34/1.49 % SZS status Theorem for theBenchmark
% 6.34/1.49 % SZS output start Proof for theBenchmark
% See solution above
% 7.83/1.67 % (343540)------------------------------
% 7.83/1.67 % (343540)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.83/1.67 % (343540)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.83/1.67 % (343540)CaDiCaL version: 2.1.3
% 7.83/1.67 % (343540)Termination reason: Refutation
% 7.83/1.67 % (343540)Time elapsed: 0.655 s
% 7.83/1.67 % (343540)Peak memory usage: 129 MB
% 7.83/1.67 % (343540)Instructions burned: 970 (million)
% 7.83/1.67 % (343540)------------------------------
% 7.83/1.67 % (343540)------------------------------
% 7.83/1.67 % (343534)Success in time 1.058 s
% 7.83/1.67 % Vampire exiting
%------------------------------------------------------------------------------