%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ALG072+1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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 09:21:14 AM UTC 2026
% Result : Theorem 35.02s 5.30s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 19
% Syntax : Number of formulae : 196 ( 36 unt; 10 def)
% Number of atoms : 526 ( 146 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 501 ( 171 ~; 248 |; 44 &)
% ( 10 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 11 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 143 ( 0 sgn 131 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
sorti1(unit1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
fof(f2,axiom,
( ! [X0] :
( sorti1(X0)
=> ( op1(unit1,X0) = X0
& op1(X0,unit1) = X0 ) )
& ? [X1] :
( sorti1(X1)
& unit1 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
fof(f3,axiom,
sorti2(unit2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(f4,axiom,
( ! [X0] :
( sorti2(X0)
=> ( op2(unit2,X0) = X0
& op2(X0,unit2) = X0 ) )
& ? [X1] :
( sorti2(X1)
& unit2 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f5,axiom,
! [X0] :
( sorti1(X0)
=> ! [X1] :
( sorti1(X1)
=> sorti1(op1(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f6,axiom,
! [X0] :
( sorti2(X0)
=> ! [X1] :
( sorti2(X1)
=> sorti2(op2(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
fof(f7,axiom,
? [X0] :
( sorti1(X0)
& ! [X1] :
( sorti1(X1)
=> ! [X2] :
( sorti1(X2)
=> ( op1(X1,X2) != X0
| ( op1(X1,X0) = X2
& X0 != unit1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f8,axiom,
~ ? [X0] :
( sorti2(X0)
& ! [X1] :
( sorti2(X1)
=> ! [X2] :
( sorti2(X2)
=> ( op2(X1,X2) != X0
| ( op2(X1,X0) = X2
& X0 != unit2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax8) ).
fof(f9,conjecture,
( ( ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) )
& ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f10,negated_conjecture,
~ ( ( ! [X0] :
( sorti1(X0)
=> sorti2(h(X0)) )
& ! [X1] :
( sorti2(X1)
=> sorti1(j(X1)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> ! [X3] :
( sorti1(X3)
=> h(op1(X2,X3)) = op2(h(X2),h(X3)) ) )
& ! [X4] :
( sorti2(X4)
=> ! [X5] :
( sorti2(X5)
=> j(op2(X4,X5)) = op1(j(X4),j(X5)) ) )
& ! [X6] :
( sorti2(X6)
=> h(j(X6)) = X6 )
& ! [X7] :
( sorti1(X7)
=> j(h(X7)) = X7 ) ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
( ! [X0] :
( ( op1(unit1,X0) = X0
& op1(X0,unit1) = X0 )
| ~ sorti1(X0) )
& ? [X1] :
( sorti1(X1)
& unit1 = X1 ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f12,plain,
( ! [X0] :
( ( op2(unit2,X0) = X0
& op2(X0,unit2) = X0 )
| ~ sorti2(X0) )
& ? [X1] :
( sorti2(X1)
& unit2 = X1 ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f13,plain,
! [X0] :
( ! [X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1) )
| ~ sorti1(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f14,plain,
! [X0] :
( ! [X1] :
( sorti2(op2(X0,X1))
| ~ sorti2(X1) )
| ~ sorti2(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f15,plain,
? [X0] :
( sorti1(X0)
& ! [X1] :
( ! [X2] :
( op1(X1,X2) != X0
| ( op1(X1,X0) = X2
& X0 != unit1 )
| ~ sorti1(X2) )
| ~ sorti1(X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f16,plain,
? [X0] :
( sorti1(X0)
& ! [X1] :
( ! [X2] :
( op1(X1,X2) != X0
| ( op1(X1,X0) = X2
& X0 != unit1 )
| ~ sorti1(X2) )
| ~ sorti1(X1) ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0] :
( ~ sorti2(X0)
| ? [X1] :
( ? [X2] :
( op2(X1,X2) = X0
& ( op2(X1,X0) != X2
| unit2 = X0 )
& sorti2(X2) )
& sorti2(X1) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f18,plain,
! [X0] :
( ~ sorti2(X0)
| ? [X1] :
( ? [X2] :
( op2(X1,X2) = X0
& ( op2(X1,X0) != X2
| unit2 = X0 )
& sorti2(X2) )
& sorti2(X1) ) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
( ! [X2] :
( ! [X3] :
( h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3) )
| ~ sorti1(X2) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( h(j(X6)) = X6
| ~ sorti2(X6) )
& ! [X7] :
( j(h(X7)) = X7
| ~ sorti1(X7) )
& ! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) )
& ! [X1] :
( sorti1(j(X1))
| ~ sorti2(X1) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f20,plain,
( ! [X2] :
( ! [X3] :
( h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3) )
| ~ sorti1(X2) )
& ! [X4] :
( ! [X5] :
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5) )
| ~ sorti2(X4) )
& ! [X6] :
( h(j(X6)) = X6
| ~ sorti2(X6) )
& ! [X7] :
( j(h(X7)) = X7
| ~ sorti1(X7) )
& ! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) )
& ! [X1] :
( sorti1(j(X1))
| ~ sorti2(X1) ) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
sorti1(unit1),
inference(cnf_transformation,[],[f1]) ).
fof(f22,plain,
! [X0] :
( ~ sorti1(X0)
| op1(X0,unit1) = X0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
! [X0] :
( ~ sorti1(X0)
| op1(unit1,X0) = X0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f24,plain,
unit1 = sK0,
inference(cnf_transformation,[],[f11]) ).
fof(f26,plain,
sorti2(unit2),
inference(cnf_transformation,[],[f3]) ).
fof(f27,plain,
! [X0] :
( ~ sorti2(X0)
| op2(X0,unit2) = X0 ),
inference(cnf_transformation,[],[f12]) ).
fof(f29,plain,
unit2 = sK1,
inference(cnf_transformation,[],[f12]) ).
fof(f31,plain,
! [X0,X1] :
( ~ sorti1(X0)
| ~ sorti1(X1)
| sorti1(op1(X0,X1)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f32,plain,
! [X0,X1] :
( ~ sorti2(X0)
| ~ sorti2(X1)
| sorti2(op2(X0,X1)) ),
inference(cnf_transformation,[],[f14]) ).
fof(f33,plain,
! [X2,X1] :
( ~ sorti1(X1)
| ~ sorti1(X2)
| unit1 != sK2
| op1(X1,X2) != sK2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f34,plain,
! [X2,X1] :
( ~ sorti1(X1)
| ~ sorti1(X2)
| op1(X1,sK2) = X2
| op1(X1,X2) != sK2 ),
inference(cnf_transformation,[],[f16]) ).
fof(f35,plain,
sorti1(sK2),
inference(cnf_transformation,[],[f16]) ).
fof(f36,plain,
! [X0] :
( unit2 = X0
| sK4(X0) != op2(sK3(X0),X0)
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f37,plain,
! [X0] :
( sorti2(sK4(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f38,plain,
! [X0] :
( op2(sK3(X0),sK4(X0)) = X0
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f39,plain,
! [X0] :
( sorti2(sK3(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f40,plain,
! [X2,X3] :
( ~ sorti1(X2)
| ~ sorti1(X3)
| h(op1(X2,X3)) = op2(h(X2),h(X3)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f41,plain,
! [X4,X5] :
( ~ sorti2(X4)
| ~ sorti2(X5)
| j(op2(X4,X5)) = op1(j(X4),j(X5)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f42,plain,
! [X6] :
( ~ sorti2(X6)
| h(j(X6)) = X6 ),
inference(cnf_transformation,[],[f20]) ).
fof(f43,plain,
! [X7] :
( ~ sorti1(X7)
| j(h(X7)) = X7 ),
inference(cnf_transformation,[],[f20]) ).
fof(f44,plain,
! [X0] :
( ~ sorti1(X0)
| sorti2(h(X0)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f45,plain,
! [X1] :
( ~ sorti2(X1)
| sorti1(j(X1)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f46,plain,
sorti1(sK0),
inference(definition_unfolding,[],[f21,f24]) ).
fof(f47,plain,
! [X0] :
( ~ sorti1(X0)
| op1(sK0,X0) = X0 ),
inference(definition_unfolding,[],[f23,f24]) ).
fof(f48,plain,
! [X0] :
( ~ sorti1(X0)
| op1(X0,sK0) = X0 ),
inference(definition_unfolding,[],[f22,f24]) ).
fof(f49,plain,
sorti2(sK1),
inference(definition_unfolding,[],[f26,f29]) ).
fof(f51,plain,
! [X0] :
( ~ sorti2(X0)
| op2(X0,sK1) = X0 ),
inference(definition_unfolding,[],[f27,f29]) ).
fof(f52,plain,
! [X2,X1] :
( ~ sorti1(X1)
| ~ sorti1(X2)
| sK0 != sK2
| op1(X1,X2) != sK2 ),
inference(definition_unfolding,[],[f33,f24]) ).
fof(f53,plain,
! [X0] :
( sK1 = X0
| sK4(X0) != op2(sK3(X0),X0)
| ~ sorti2(X0) ),
inference(definition_unfolding,[],[f36,f29]) ).
fof(f54,plain,
~ sorti1(sK0),
inference(consistent_polarity_flipping,[],[f46]) ).
fof(f56,plain,
! [X0] :
( sorti1(X0)
| op1(sK0,X0) = X0 ),
inference(consistent_polarity_flipping,[],[f47]) ).
fof(f57,plain,
! [X0] :
( sorti1(X0)
| op1(X0,sK0) = X0 ),
inference(consistent_polarity_flipping,[],[f48]) ).
fof(f58,plain,
~ sorti2(sK1),
inference(consistent_polarity_flipping,[],[f49]) ).
fof(f61,plain,
! [X0] :
( sorti2(X0)
| op2(X0,sK1) = X0 ),
inference(consistent_polarity_flipping,[],[f51]) ).
fof(f62,plain,
! [X0,X1] :
( ~ sorti1(op1(X0,X1))
| sorti1(X1)
| sorti1(X0) ),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f63,plain,
! [X0,X1] :
( ~ sorti2(op2(X0,X1))
| sorti2(X1)
| sorti2(X0) ),
inference(consistent_polarity_flipping,[],[f32]) ).
fof(f64,plain,
~ sorti1(sK2),
inference(consistent_polarity_flipping,[],[f35]) ).
fof(f65,plain,
! [X2,X1] :
( op1(X1,X2) != sK2
| sorti1(X2)
| op1(X1,sK2) = X2
| sorti1(X1) ),
inference(consistent_polarity_flipping,[],[f34]) ).
fof(f66,plain,
! [X2,X1] :
( sorti1(X1)
| sorti1(X2)
| sK0 != sK2
| op1(X1,X2) != sK2 ),
inference(consistent_polarity_flipping,[],[f52]) ).
fof(f67,plain,
! [X0] :
( ~ sorti2(sK3(X0))
| sorti2(X0) ),
inference(consistent_polarity_flipping,[],[f39]) ).
fof(f68,plain,
! [X0] :
( sorti2(X0)
| op2(sK3(X0),sK4(X0)) = X0 ),
inference(consistent_polarity_flipping,[],[f38]) ).
fof(f69,plain,
! [X0] :
( ~ sorti2(sK4(X0))
| sorti2(X0) ),
inference(consistent_polarity_flipping,[],[f37]) ).
fof(f70,plain,
! [X0] :
( sK4(X0) != op2(sK3(X0),X0)
| sK1 = X0
| sorti2(X0) ),
inference(consistent_polarity_flipping,[],[f53]) ).
fof(f71,plain,
! [X1] :
( ~ sorti1(j(X1))
| sorti2(X1) ),
inference(consistent_polarity_flipping,[],[f45]) ).
fof(f72,plain,
! [X0] :
( ~ sorti2(h(X0))
| sorti1(X0) ),
inference(consistent_polarity_flipping,[],[f44]) ).
fof(f73,plain,
! [X7] :
( sorti1(X7)
| j(h(X7)) = X7 ),
inference(consistent_polarity_flipping,[],[f43]) ).
fof(f74,plain,
! [X6] :
( sorti2(X6)
| h(j(X6)) = X6 ),
inference(consistent_polarity_flipping,[],[f42]) ).
fof(f75,plain,
! [X4,X5] :
( sorti2(X5)
| sorti2(X4)
| j(op2(X4,X5)) = op1(j(X4),j(X5)) ),
inference(consistent_polarity_flipping,[],[f41]) ).
fof(f76,plain,
! [X2,X3] :
( sorti1(X2)
| sorti1(X3)
| h(op1(X2,X3)) = op2(h(X2),h(X3)) ),
inference(consistent_polarity_flipping,[],[f40]) ).
fof(f78,definition,
( spl5_1
<=> sK0 = sK2 ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
fof(f79,plain,
( sK0 = sK2
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f82,definition,
( spl5_2
<=> ! [X2,X1] :
( sorti1(X1)
| op1(X1,X2) != sK2
| sorti1(X2) ) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
fof(f83,plain,
( ! [X2,X1] :
( sorti1(X1)
| op1(X1,X2) != sK2
| sorti1(X2) )
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f84,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f66,f82,f78]) ).
fof(f92,plain,
! [X0] :
( sorti1(X0)
| h(op1(X0,X0)) = op2(h(X0),h(X0)) ),
inference(factoring,[],[f76]) ).
fof(f95,plain,
sK0 = j(h(sK0)),
inference(resolution,[],[f54,f73]) ).
fof(f97,plain,
! [X0] :
( sorti2(X0)
| j(op2(X0,sK1)) = op1(j(X0),j(sK1)) ),
inference(resolution,[],[f58,f75]) ).
fof(f100,plain,
! [X0] :
( sorti1(X0)
| h(op1(X0,sK2)) = op2(h(X0),h(sK2)) ),
inference(resolution,[],[f64,f76]) ).
fof(f102,plain,
sK2 = j(h(sK2)),
inference(resolution,[],[f64,f73]) ).
fof(f103,plain,
! [X0,X1] :
( sorti2(X0)
| sorti2(X1)
| j(op2(sK3(X0),X1)) = op1(j(sK3(X0)),j(X1)) ),
inference(resolution,[],[f67,f75]) ).
fof(f105,plain,
! [X0] :
( sorti2(X0)
| sK3(X0) = h(j(sK3(X0))) ),
inference(resolution,[],[f67,f74]) ).
fof(f108,plain,
! [X0] :
( sorti2(X0)
| sK4(X0) = h(j(sK4(X0))) ),
inference(resolution,[],[f69,f74]) ).
fof(f109,plain,
! [X0] :
( sorti2(X0)
| j(X0) = op1(sK0,j(X0)) ),
inference(resolution,[],[f56,f71]) ).
fof(f114,plain,
sK2 = op1(sK2,sK0),
inference(resolution,[],[f57,f64]) ).
fof(f120,plain,
! [X0] :
( sorti1(X0)
| h(X0) = op2(h(X0),sK1) ),
inference(resolution,[],[f61,f72]) ).
fof(f128,plain,
! [X0,X1] :
( sorti1(X0)
| sorti1(X1)
| op1(X1,X0) = j(h(op1(X1,X0))) ),
inference(resolution,[],[f62,f73]) ).
fof(f135,plain,
! [X0] :
( sorti1(X0)
| h(X0) = op2(sK3(h(X0)),sK4(h(X0))) ),
inference(resolution,[],[f68,f72]) ).
fof(f150,plain,
! [X0] :
( sorti1(X0)
| sK3(h(X0)) = h(j(sK3(h(X0)))) ),
inference(resolution,[],[f105,f72]) ).
fof(f155,plain,
! [X0] :
( sorti1(X0)
| sK4(h(X0)) = h(j(sK4(h(X0)))) ),
inference(resolution,[],[f108,f72]) ).
fof(f161,plain,
j(sK1) = op1(sK0,j(sK1)),
inference(resolution,[],[f109,f58]) ).
fof(f206,plain,
h(sK0) = op2(h(sK0),sK1),
inference(resolution,[],[f120,f54]) ).
fof(f217,plain,
h(op1(sK2,sK2)) = op2(h(sK2),h(sK2)),
inference(resolution,[],[f92,f64]) ).
fof(f269,plain,
! [X0] :
( sorti2(X0)
| h(op1(j(X0),sK2)) = op2(h(j(X0)),h(sK2)) ),
inference(resolution,[],[f100,f71]) ).
fof(f281,plain,
h(sK2) = op2(sK3(h(sK2)),sK4(h(sK2))),
inference(resolution,[],[f135,f64]) ).
fof(f286,plain,
! [X0] :
( sorti1(X0)
| op1(X0,sK2) = j(h(op1(X0,sK2))) ),
inference(resolution,[],[f128,f64]) ).
fof(f358,plain,
! [X0,X1] :
( sorti2(X1)
| sorti1(X0)
| j(op2(sK3(h(X0)),X1)) = op1(j(sK3(h(X0))),j(X1)) ),
inference(resolution,[],[f103,f72]) ).
fof(f504,plain,
( sK2 != sK2
| sorti1(sK0)
| sK0 = op1(sK2,sK2)
| sorti1(sK2) ),
inference(superposition,[],[f65,f114]) ).
fof(f506,plain,
( sorti1(sK0)
| sK0 = op1(sK2,sK2)
| sorti1(sK2) ),
inference(trivial_inequality_removal,[],[f504]) ).
fof(f507,plain,
( sK0 = op1(sK2,sK2)
| sorti1(sK2) ),
inference(forward_subsumption_resolution,[],[f506,f54]) ).
fof(f508,plain,
sK0 = op1(sK2,sK2),
inference(forward_subsumption_resolution,[],[f507,f64]) ).
fof(f758,plain,
( ~ sorti2(h(op1(sK2,sK2)))
| sorti2(h(sK2))
| sorti2(h(sK2)) ),
inference(superposition,[],[f63,f217]) ).
fof(f759,plain,
( ~ sorti2(h(op1(sK2,sK2)))
| sorti2(h(sK2)) ),
inference(duplicate_literal_removal,[],[f758]) ).
fof(f761,definition,
( spl5_16
<=> sorti2(h(sK2)) ),
introduced(definition,[new_symbols(definition,[spl5_16])],[avatar_definition]) ).
fof(f762,plain,
( ~ sorti2(h(sK2))
| spl5_16 ),
inference(avatar_component_clause,[],[f761]) ).
fof(f763,plain,
( sorti2(h(sK2))
| ~ spl5_16 ),
inference(avatar_component_clause,[],[f761]) ).
fof(f765,definition,
( spl5_17
<=> sorti2(h(op1(sK2,sK2))) ),
introduced(definition,[new_symbols(definition,[spl5_17])],[avatar_definition]) ).
fof(f767,plain,
( ~ sorti2(h(op1(sK2,sK2)))
| spl5_17 ),
inference(avatar_component_clause,[],[f765]) ).
fof(f768,plain,
( spl5_16
| ~ spl5_17 ),
inference(avatar_split_clause,[],[f759,f765,f761]) ).
fof(f967,definition,
( spl5_26
<=> sorti2(h(sK0)) ),
introduced(definition,[new_symbols(definition,[spl5_26])],[avatar_definition]) ).
fof(f969,plain,
( ~ sorti2(h(sK0))
| spl5_26 ),
inference(avatar_component_clause,[],[f967]) ).
fof(f973,definition,
( spl5_27
<=> sorti2(sK3(h(sK2))) ),
introduced(definition,[new_symbols(definition,[spl5_27])],[avatar_definition]) ).
fof(f974,plain,
( ~ sorti2(sK3(h(sK2)))
| spl5_27 ),
inference(avatar_component_clause,[],[f973]) ).
fof(f975,plain,
( sorti2(sK3(h(sK2)))
| ~ spl5_27 ),
inference(avatar_component_clause,[],[f973]) ).
fof(f977,definition,
( spl5_28
<=> sorti2(sK4(h(sK2))) ),
introduced(definition,[new_symbols(definition,[spl5_28])],[avatar_definition]) ).
fof(f978,plain,
( ~ sorti2(sK4(h(sK2)))
| spl5_28 ),
inference(avatar_component_clause,[],[f977]) ).
fof(f979,plain,
( sorti2(sK4(h(sK2)))
| ~ spl5_28 ),
inference(avatar_component_clause,[],[f977]) ).
fof(f1106,plain,
sK3(h(sK2)) = h(j(sK3(h(sK2)))),
inference(resolution,[],[f150,f64]) ).
fof(f1146,plain,
( j(op2(h(sK0),sK1)) = op1(j(h(sK0)),j(sK1))
| spl5_26 ),
inference(resolution,[],[f969,f97]) ).
fof(f1193,plain,
( op1(sK0,j(sK1)) = j(op2(h(sK0),sK1))
| spl5_26 ),
inference(forward_demodulation,[],[f1146,f95]) ).
fof(f1203,plain,
( j(h(sK0)) = op1(sK0,j(sK1))
| spl5_26 ),
inference(forward_demodulation,[],[f1193,f206]) ).
fof(f1206,plain,
( j(h(sK0)) = j(sK1)
| spl5_26 ),
inference(forward_demodulation,[],[f1203,f161]) ).
fof(f1209,plain,
( sK0 = j(sK1)
| spl5_26 ),
inference(forward_demodulation,[],[f1206,f95]) ).
fof(f1214,plain,
sK4(h(sK2)) = h(j(sK4(h(sK2)))),
inference(resolution,[],[f155,f64]) ).
fof(f1386,plain,
op1(sK2,sK2) = j(h(op1(sK2,sK2))),
inference(resolution,[],[f286,f64]) ).
fof(f1445,definition,
( spl5_29
<=> sorti1(j(sK3(h(sK2)))) ),
introduced(definition,[new_symbols(definition,[spl5_29])],[avatar_definition]) ).
fof(f1446,plain,
( ~ sorti1(j(sK3(h(sK2))))
| spl5_29 ),
inference(avatar_component_clause,[],[f1445]) ).
fof(f1447,plain,
( sorti1(j(sK3(h(sK2))))
| ~ spl5_29 ),
inference(avatar_component_clause,[],[f1445]) ).
fof(f1581,definition,
( spl5_30
<=> sorti1(j(sK4(h(sK2)))) ),
introduced(definition,[new_symbols(definition,[spl5_30])],[avatar_definition]) ).
fof(f1582,plain,
( ~ sorti1(j(sK4(h(sK2))))
| spl5_30 ),
inference(avatar_component_clause,[],[f1581]) ).
fof(f1583,plain,
( sorti1(j(sK4(h(sK2))))
| ~ spl5_30 ),
inference(avatar_component_clause,[],[f1581]) ).
fof(f1656,plain,
( ~ sorti1(op1(sK2,sK2))
| sorti2(h(op1(sK2,sK2))) ),
inference(superposition,[],[f71,f1386]) ).
fof(f1657,plain,
( ~ sorti1(op1(sK2,sK2))
| spl5_17 ),
inference(forward_subsumption_resolution,[],[f1656,f767]) ).
fof(f1737,plain,
( op1(sK2,sK2) = op1(op1(sK2,sK2),sK0)
| spl5_17 ),
inference(resolution,[],[f1657,f57]) ).
fof(f1971,plain,
( h(op1(j(sK3(h(sK2))),sK2)) = op2(h(j(sK3(h(sK2)))),h(sK2))
| spl5_27 ),
inference(resolution,[],[f269,f974]) ).
fof(f1987,plain,
( op2(sK3(h(sK2)),h(sK2)) = h(op1(j(sK3(h(sK2))),sK2))
| spl5_27 ),
inference(forward_demodulation,[],[f1971,f1106]) ).
fof(f3530,plain,
! [X0] :
( sorti2(X0)
| j(op2(sK3(h(sK2)),X0)) = op1(j(sK3(h(sK2))),j(X0)) ),
inference(resolution,[],[f358,f64]) ).
fof(f8695,plain,
( ~ sorti2(h(sK0))
| spl5_17 ),
inference(superposition,[],[f767,f508]) ).
fof(f19919,plain,
( j(op2(sK3(h(sK2)),sK4(h(sK2)))) = op1(j(sK3(h(sK2))),j(sK4(h(sK2))))
| spl5_28 ),
inference(resolution,[],[f3530,f978]) ).
fof(f19929,plain,
( j(h(sK2)) = op1(j(sK3(h(sK2))),j(sK4(h(sK2))))
| spl5_28 ),
inference(forward_demodulation,[],[f19919,f281]) ).
fof(f19934,plain,
( sK2 = op1(j(sK3(h(sK2))),j(sK4(h(sK2))))
| spl5_28 ),
inference(forward_demodulation,[],[f19929,f102]) ).
fof(f19984,definition,
( spl5_75
<=> j(sK4(h(sK2))) = op1(j(sK3(h(sK2))),sK2) ),
introduced(definition,[new_symbols(definition,[spl5_75])],[avatar_definition]) ).
fof(f19986,plain,
( j(sK4(h(sK2))) = op1(j(sK3(h(sK2))),sK2)
| ~ spl5_75 ),
inference(avatar_component_clause,[],[f19984]) ).
fof(f20026,plain,
( sorti2(sK4(h(sK2)))
| ~ spl5_30 ),
inference(resolution,[],[f1583,f71]) ).
fof(f20106,plain,
( sorti2(sK3(h(sK2)))
| ~ spl5_29 ),
inference(resolution,[],[f1447,f71]) ).
fof(f20110,plain,
( spl5_27
| ~ spl5_29 ),
inference(avatar_split_clause,[],[f20106,f1445,f973]) ).
fof(f20114,plain,
( sorti2(h(sK2))
| ~ spl5_27 ),
inference(resolution,[],[f975,f67]) ).
fof(f20117,plain,
( spl5_16
| ~ spl5_27 ),
inference(avatar_split_clause,[],[f20114,f973,f761]) ).
fof(f20118,plain,
( sorti1(sK2)
| ~ spl5_16 ),
inference(resolution,[],[f763,f72]) ).
fof(f20119,plain,
( $false
| ~ spl5_16 ),
inference(forward_subsumption_resolution,[],[f20118,f64]) ).
fof(f20120,plain,
~ spl5_16,
inference(avatar_contradiction_clause,[],[f20119]) ).
fof(f20142,plain,
( spl5_28
| ~ spl5_30 ),
inference(avatar_split_clause,[],[f20026,f1581,f977]) ).
fof(f21485,plain,
( sorti2(h(sK2))
| ~ spl5_28 ),
inference(resolution,[],[f979,f69]) ).
fof(f21486,plain,
( $false
| spl5_16
| ~ spl5_28 ),
inference(forward_subsumption_resolution,[],[f21485,f762]) ).
fof(f21487,plain,
( spl5_16
| ~ spl5_28 ),
inference(avatar_contradiction_clause,[],[f21486]) ).
fof(f30574,plain,
( sK2 != sK2
| sorti1(j(sK4(h(sK2))))
| j(sK4(h(sK2))) = op1(j(sK3(h(sK2))),sK2)
| sorti1(j(sK3(h(sK2))))
| spl5_28 ),
inference(superposition,[],[f65,f19934]) ).
fof(f30576,plain,
( sorti1(j(sK4(h(sK2))))
| j(sK4(h(sK2))) = op1(j(sK3(h(sK2))),sK2)
| sorti1(j(sK3(h(sK2))))
| spl5_28 ),
inference(trivial_inequality_removal,[],[f30574]) ).
fof(f30577,plain,
( j(sK4(h(sK2))) = op1(j(sK3(h(sK2))),sK2)
| sorti1(j(sK3(h(sK2))))
| spl5_28
| spl5_30 ),
inference(forward_subsumption_resolution,[],[f30576,f1582]) ).
fof(f30578,plain,
( j(sK4(h(sK2))) = op1(j(sK3(h(sK2))),sK2)
| spl5_28
| spl5_29
| spl5_30 ),
inference(forward_subsumption_resolution,[],[f30577,f1446]) ).
fof(f30579,plain,
( spl5_75
| spl5_28
| spl5_29
| spl5_30 ),
inference(avatar_split_clause,[],[f30578,f1581,f1445,f977,f19984]) ).
fof(f240525,plain,
( h(j(sK4(h(sK2)))) = op2(sK3(h(sK2)),h(sK2))
| spl5_27
| ~ spl5_75 ),
inference(forward_demodulation,[],[f1987,f19986]) ).
fof(f240526,plain,
( sK4(h(sK2)) = op2(sK3(h(sK2)),h(sK2))
| spl5_27
| ~ spl5_75 ),
inference(forward_demodulation,[],[f240525,f1214]) ).
fof(f240527,plain,
( sK4(h(sK2)) != sK4(h(sK2))
| sK1 = h(sK2)
| sorti2(h(sK2))
| spl5_27
| ~ spl5_75 ),
inference(superposition,[],[f70,f240526]) ).
fof(f240529,plain,
( sK1 = h(sK2)
| sorti2(h(sK2))
| spl5_27
| ~ spl5_75 ),
inference(trivial_inequality_removal,[],[f240527]) ).
fof(f240530,plain,
( sK1 = h(sK2)
| spl5_16
| spl5_27
| ~ spl5_75 ),
inference(forward_subsumption_resolution,[],[f240529,f762]) ).
fof(f240537,plain,
( sK2 = j(sK1)
| spl5_16
| spl5_27
| ~ spl5_75 ),
inference(superposition,[],[f102,f240530]) ).
fof(f240695,plain,
( sK0 = sK2
| spl5_16
| spl5_26
| spl5_27
| ~ spl5_75 ),
inference(forward_demodulation,[],[f240537,f1209]) ).
fof(f247121,plain,
( ~ spl5_26
| spl5_17 ),
inference(avatar_split_clause,[],[f8695,f765,f967]) ).
fof(f249556,plain,
( spl5_1
| spl5_16
| spl5_26
| spl5_27
| ~ spl5_75 ),
inference(avatar_split_clause,[],[f240695,f19984,f973,f967,f761,f78]) ).
fof(f250408,plain,
( ! [X2,X1] :
( op1(X1,X2) != sK0
| sorti1(X1)
| sorti1(X2) )
| ~ spl5_1
| ~ spl5_2 ),
inference(forward_demodulation,[],[f83,f79]) ).
fof(f250409,plain,
( sK0 != op1(sK2,sK2)
| sorti1(op1(sK2,sK2))
| sorti1(sK0)
| ~ spl5_1
| ~ spl5_2
| spl5_17 ),
inference(superposition,[],[f250408,f1737]) ).
fof(f250479,plain,
( sorti1(op1(sK2,sK2))
| sorti1(sK0)
| ~ spl5_1
| ~ spl5_2
| spl5_17 ),
inference(forward_subsumption_resolution,[],[f250409,f508]) ).
fof(f250499,plain,
( sorti1(sK0)
| ~ spl5_1
| ~ spl5_2
| spl5_17 ),
inference(forward_subsumption_resolution,[],[f250479,f1657]) ).
fof(f250521,plain,
( $false
| ~ spl5_1
| ~ spl5_2
| spl5_17 ),
inference(forward_subsumption_resolution,[],[f250499,f54]) ).
fof(f250522,plain,
( ~ spl5_1
| ~ spl5_2
| spl5_17 ),
inference(avatar_contradiction_clause,[],[f250521]) ).
cnf(s1,plain,
( ~ spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f84]) ).
cnf(s8,plain,
( spl5_16
| ~ spl5_17 ),
inference(sat_conversion,[],[f768]) ).
cnf(s42,plain,
( spl5_27
| ~ spl5_29 ),
inference(sat_conversion,[],[f20110]) ).
cnf(s46,plain,
( spl5_16
| ~ spl5_27 ),
inference(sat_conversion,[],[f20117]) ).
cnf(s47,plain,
~ spl5_16,
inference(sat_conversion,[],[f20120]) ).
cnf(s49,plain,
( spl5_28
| ~ spl5_30 ),
inference(sat_conversion,[],[f20142]) ).
cnf(s53,plain,
( spl5_16
| ~ spl5_28 ),
inference(sat_conversion,[],[f21487]) ).
cnf(s60,plain,
( spl5_28
| spl5_29
| spl5_30
| spl5_75 ),
inference(sat_conversion,[],[f30579]) ).
cnf(s137,plain,
( spl5_17
| ~ spl5_26 ),
inference(sat_conversion,[],[f247121]) ).
cnf(s151,plain,
( spl5_1
| spl5_16
| spl5_26
| spl5_27
| ~ spl5_75 ),
inference(sat_conversion,[],[f249556]) ).
cnf(s176,plain,
( ~ spl5_1
| ~ spl5_2
| spl5_17 ),
inference(sat_conversion,[],[f250522]) ).
cnf(s181,plain,
~ spl5_28,
inference(rat,[],[s53,s47]) ).
cnf(s183,plain,
~ spl5_30,
inference(rat,[],[s49,s181]) ).
cnf(s185,plain,
~ spl5_27,
inference(rat,[],[s46,s47]) ).
cnf(s188,plain,
~ spl5_29,
inference(rat,[],[s42,s185]) ).
cnf(s189,plain,
spl5_75,
inference(rat,[],[s60,s183,s181,s188]) ).
cnf(s220,plain,
~ spl5_17,
inference(rat,[],[s8,s47]) ).
cnf(s221,plain,
~ spl5_26,
inference(rat,[],[s137,s220]) ).
cnf(s222,plain,
spl5_1,
inference(rat,[],[s151,s189,s185,s47,s221]) ).
cnf(s223,plain,
~ spl5_2,
inference(rat,[],[s176,s220,s222]) ).
cnf(s234,plain,
$false,
inference(rat,[],[s1,s223,s222]) ).
fof(f250535,plain,
$false,
inference(avatar_sat_refutation,[],[s234]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG072+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n010.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 19:25:03 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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
% 16.68/2.66 % (2235558)Will run a generic schedule for satisfiability detection.
% 16.68/2.66 % (2235564)% WARNING: option uhcvi not known.
% 16.68/2.66 % (2235564)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=104852810:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 16.68/2.66 % (2235563)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3036790500_2999 on theBenchmark for (2999ds/0Mi)
% 16.68/2.66 % (2235565)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=63645741:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 16.68/2.66 % (2235566)dis+10_1_sil=32000:sp=arity:random_seed=859694309:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 16.68/2.66 % (2235567)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=553421482:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 16.68/2.66 % (2235568)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3518617307:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 16.68/2.66 % (2235569)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3209985960:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 16.68/2.66 % TRYING [1]
% 16.68/2.66 % TRYING [2]
% 16.68/2.66 % TRYING [3]
% 16.68/2.66 % TRYING [4]
% 16.68/2.66 % TRYING [5]
% 16.68/2.66 % (2235566)Instruction limit reached!
% 16.68/2.66 % (2235566)------------------------------
% 16.68/2.66 % (2235566)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.68/2.66 % (2235566)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.68/2.66 % (2235566)CaDiCaL version: 2.1.3
% 16.68/2.66 % (2235566)Termination reason: Instruction limit
% 16.68/2.66 % (2235566)Termination phase: Saturation
% 16.68/2.66 % (2235566)Time elapsed: 0.055 s
% 16.68/2.66 % (2235566)Peak memory usage: 12 MB
% 16.68/2.66 % (2235566)Instructions burned: 104 (million)
% 16.68/2.66 % (2235567)Instruction limit reached!
% 16.68/2.66 % (2235567)------------------------------
% 16.68/2.66 % (2235567)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.68/2.66 % (2235567)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.68/2.66 % (2235567)CaDiCaL version: 2.1.3
% 16.68/2.66 % (2235567)Termination reason: Instruction limit
% 16.68/2.66 % (2235567)Termination phase: Saturation
% 16.68/2.66 % (2235567)Time elapsed: 0.063 s
% 16.68/2.66 % (2235567)Peak memory usage: 13 MB
% 16.68/2.66 % (2235567)Instructions burned: 120 (million)
% 16.68/2.66 % (2235568)Instruction limit reached!
% 16.68/2.66 % (2235568)------------------------------
% 16.68/2.66 % (2235568)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.68/2.66 % (2235568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.68/2.66 % (2235568)CaDiCaL version: 2.1.3
% 16.68/2.66 % (2235568)Termination reason: Instruction limit
% 16.68/2.66 % (2235568)Termination phase: Saturation
% 16.68/2.66 % (2235568)Time elapsed: 0.072 s
% 16.68/2.66 % (2235568)Peak memory usage: 13 MB
% 16.68/2.66 % (2235568)Instructions burned: 132 (million)
% 16.68/2.66 % (2235577)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1880677822:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 16.68/2.66 % TRYING [1]
% 16.68/2.66 % TRYING [2]
% 16.68/2.66 % TRYING [3]
% 16.68/2.66 % (2235578)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=642849731:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 16.68/2.66 % TRYING [4]
% 16.68/2.66 % (2235579)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=45771796:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 16.68/2.66 % TRYING [6]
% 16.68/2.66 % (2235569)Instruction limit reached!
% 16.68/2.66 % (2235569)------------------------------
% 16.68/2.66 % (2235569)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.68/2.66 % (2235569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.68/2.66 % (2235569)CaDiCaL version: 2.1.3
% 16.68/2.66 % (2235569)Termination reason: Instruction limit
% 16.68/2.66 % (2235569)Termination phase: Saturation
% 16.68/2.66 % (2235569)Time elapsed: 0.093 s
% 16.68/2.66 % (2235569)Peak memory usage: 15 MB
% 16.68/2.66 % (2235569)Instructions burned: 160 (million)
% 16.68/2.66 % TRYING [5]
% 16.68/2.66 % (2235583)ott-21_1_sil=16000:fs=off:random_seed=3293588777:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 16.68/2.66 % (2235578)Instruction limit reached!
% 16.68/2.66 % (2235578)------------------------------
% 16.68/2.66 % (2235578)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235578)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235578)Termination reason: Instruction limit
% 35.02/5.30 % (2235578)Termination phase: Saturation
% 35.02/5.30 % (2235578)Time elapsed: 0.075 s
% 35.02/5.30 % (2235578)Peak memory usage: 13 MB
% 35.02/5.30 % (2235578)Instructions burned: 131 (million)
% 35.02/5.30 % TRYING [6]
% 35.02/5.30 % (2235585)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=961499101:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 35.02/5.30 % (2235583)Instruction limit reached!
% 35.02/5.30 % (2235583)------------------------------
% 35.02/5.30 % (2235583)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235583)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235583)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235583)Termination reason: Instruction limit
% 35.02/5.30 % (2235583)Termination phase: Saturation
% 35.02/5.30 % (2235583)Time elapsed: 0.081 s
% 35.02/5.30 % (2235583)Peak memory usage: 13 MB
% 35.02/5.30 % (2235583)Instructions burned: 181 (million)
% 35.02/5.30 % (2235587)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1451501050:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 35.02/5.30 % TRYING [1]
% 35.02/5.30 % TRYING [2]
% 35.02/5.30 % TRYING [3]
% 35.02/5.30 % TRYING [4]
% 35.02/5.30 % TRYING [5]
% 35.02/5.30 % TRYING [6]
% 35.02/5.30 % (2235579)Instruction limit reached!
% 35.02/5.30 % (2235579)------------------------------
% 35.02/5.30 % (2235579)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235579)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235579)Termination reason: Instruction limit
% 35.02/5.30 % (2235579)Termination phase: Saturation
% 35.02/5.30 % (2235579)Time elapsed: 0.313 s
% 35.02/5.30 % (2235579)Peak memory usage: 18 MB
% 35.02/5.30 % (2235579)Instructions burned: 685 (million)
% 35.02/5.30 % (2235589)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3355661336:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 35.02/5.30 % (2235585)Instruction limit reached!
% 35.02/5.30 % (2235585)------------------------------
% 35.02/5.30 % (2235585)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235585)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235585)Termination reason: Instruction limit
% 35.02/5.30 % (2235585)Termination phase: Saturation
% 35.02/5.30 % (2235585)Time elapsed: 0.274 s
% 35.02/5.30 % (2235585)Peak memory usage: 15 MB
% 35.02/5.30 % (2235585)Instructions burned: 477 (million)
% 35.02/5.30 % (2235591)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3569186301:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 35.02/5.30 % (2235577)Instruction limit reached!
% 35.02/5.30 % (2235577)------------------------------
% 35.02/5.30 % (2235577)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235577)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235577)Termination reason: Instruction limit
% 35.02/5.30 % (2235577)Termination phase: Finite model building SAT solving
% 35.02/5.30 % (2235577)Time elapsed: 0.405 s
% 35.02/5.30 % (2235577)Peak memory usage: 15 MB
% 35.02/5.30 % (2235577)Instructions burned: 714 (million)
% 35.02/5.30 % TRYING [14]
% 35.02/5.30 % (2235593)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3747054468:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 35.02/5.30 % (2235587)Instruction limit reached!
% 35.02/5.30 % (2235587)------------------------------
% 35.02/5.30 % (2235587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235587)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235587)Termination reason: Instruction limit
% 35.02/5.30 % (2235587)Termination phase: Finite model building SAT solving
% 35.02/5.30 % (2235587)Time elapsed: 0.492 s
% 35.02/5.30 % (2235587)Peak memory usage: 14 MB
% 35.02/5.30 % (2235587)Instructions burned: 866 (million)
% 35.02/5.30 % (2235595)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=692982832:i=879:kws=inv_precedence:fsr=off_2992 on theBenchmark for (2992ds/879Mi)
% 35.02/5.30 % (2235591)Instruction limit reached!
% 35.02/5.30 % (2235591)------------------------------
% 35.02/5.30 % (2235591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235591)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235591)Termination reason: Instruction limit
% 35.02/5.30 % (2235591)Termination phase: Finite model building SAT solving
% 35.02/5.30 % (2235591)Time elapsed: 0.353 s
% 35.02/5.30 % (2235591)Peak memory usage: 50 MB
% 35.02/5.30 % (2235591)Instructions burned: 890 (million)
% 35.02/5.30 % (2235593)Instruction limit reached!
% 35.02/5.30 % (2235593)------------------------------
% 35.02/5.30 % (2235593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235593)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235593)Termination reason: Instruction limit
% 35.02/5.30 % (2235593)Termination phase: Saturation
% 35.02/5.30 % (2235593)Time elapsed: 0.330 s
% 35.02/5.30 % (2235593)Peak memory usage: 19 MB
% 35.02/5.30 % (2235593)Instructions burned: 692 (million)
% 35.02/5.30 % (2235597)fmb+10_1_sil=64000:random_seed=2992878325:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 35.02/5.30 % (2235598)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=752351251:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 35.02/5.30 % TRYING [1]
% 35.02/5.30 % TRYING [2]
% 35.02/5.30 % TRYING [20]
% 35.02/5.30 % TRYING [3]
% 35.02/5.30 % TRYING [4]
% 35.02/5.30 % TRYING [5]
% 35.02/5.30 % TRYING [6]
% 35.02/5.30 % (2235589)Instruction limit reached!
% 35.02/5.30 % (2235589)------------------------------
% 35.02/5.30 % (2235589)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235589)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235589)Termination reason: Instruction limit
% 35.02/5.30 % (2235589)Termination phase: Saturation
% 35.02/5.30 % (2235589)Time elapsed: 0.607 s
% 35.02/5.30 % (2235589)Peak memory usage: 29 MB
% 35.02/5.30 % (2235589)Instructions burned: 1181 (million)
% 35.02/5.30 % (2235601)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2687135231:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 35.02/5.30 % TRYING [8]
% 35.02/5.30 % TRYING [7]
% 35.02/5.30 % (2235595)Instruction limit reached!
% 35.02/5.30 % (2235595)------------------------------
% 35.02/5.30 % (2235595)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235595)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235595)Termination reason: Instruction limit
% 35.02/5.30 % (2235595)Termination phase: Saturation
% 35.02/5.30 % (2235595)Time elapsed: 0.503 s
% 35.02/5.30 % (2235595)Peak memory usage: 19 MB
% 35.02/5.30 % (2235595)Instructions burned: 881 (million)
% 35.02/5.30 % (2235603)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2529727004:i=5131_2987 on theBenchmark for (2987ds/5131Mi)
% 35.02/5.30 % TRYING [7]
% 35.02/5.30 % (2235601)Instruction limit reached!
% 35.02/5.30 % (2235601)------------------------------
% 35.02/5.30 % (2235601)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235601)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235601)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235601)Termination reason: Instruction limit
% 35.02/5.30 % (2235601)Termination phase: Finite model building SAT solving
% 35.02/5.30 % (2235601)Time elapsed: 0.517 s
% 35.02/5.30 % (2235601)Peak memory usage: 22 MB
% 35.02/5.30 % (2235601)Instructions burned: 920 (million)
% 35.02/5.30 % (2235605)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=747867839:i=1472:ins=7:fdi=8:gsp=on_2983 on theBenchmark for (2983ds/1472Mi)
% 35.02/5.30 % (2235605)Instruction limit reached!
% 35.02/5.30 % (2235605)------------------------------
% 35.02/5.30 % (2235605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235605)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235605)Termination reason: Instruction limit
% 35.02/5.30 % (2235605)Termination phase: Saturation
% 35.02/5.30 % (2235605)Time elapsed: 0.764 s
% 35.02/5.30 % (2235605)Peak memory usage: 40 MB
% 35.02/5.30 % (2235605)Instructions burned: 1473 (million)
% 35.02/5.30 % (2235607)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3753568989:i=6324_2975 on theBenchmark for (2975ds/6324Mi)
% 35.02/5.30 % TRYING [77]
% 35.02/5.30 % (2235603)Instruction limit reached!
% 35.02/5.30 % (2235603)------------------------------
% 35.02/5.30 % (2235603)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235603)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235603)Termination reason: Instruction limit
% 35.02/5.30 % (2235603)Termination phase: Saturation
% 35.02/5.30 % (2235603)Time elapsed: 2.497 s
% 35.02/5.30 % (2235603)Peak memory usage: 54 MB
% 35.02/5.30 % (2235603)Instructions burned: 5132 (million)
% 35.02/5.30 % (2235609)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1359761494:fmbsr=2.30978:i=2174_2962 on theBenchmark for (2962ds/2174Mi)
% 35.02/5.30 % TRYING [16]
% 35.02/5.30 % (2235607)Instruction limit reached!
% 35.02/5.30 % (2235607)------------------------------
% 35.02/5.30 % (2235607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235607)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235607)Termination reason: Instruction limit
% 35.02/5.30 % (2235607)Termination phase: Finite model building constraint generation
% 35.02/5.30 % (2235607)Time elapsed: 2.231 s
% 35.02/5.30 % (2235607)Peak memory usage: 412 MB
% 35.02/5.30 % (2235607)Instructions burned: 6327 (million)
% 35.02/5.30 % (2235611)ott-2_1_sil=16000:newcnf=on:random_seed=4101796075:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2952 on theBenchmark for (2952ds/869Mi)
% 35.02/5.30 % (2235609)Instruction limit reached!
% 35.02/5.30 % (2235609)------------------------------
% 35.02/5.30 % (2235609)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.02/5.30 % (2235609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.02/5.30 % (2235609)CaDiCaL version: 2.1.3
% 35.02/5.30 % (2235609)Termination reason: Instruction limit
% 35.02/5.30 % (2235609)Termination phase: Finite model building SAT solving
% 35.02/5.30 % (2235609)Time elapsed: 1.009 s
% 35.02/5.30 % (2235609)Peak memory usage: 117 MB
% 35.02/5.30 % (2235609)Instructions burned: 2178 (million)
% 35.02/5.30 % (2235613)ott+10_1_sil=32000:tgt=ground:random_seed=888634986:i=5114:av=off_2951 on theBenchmark for (2951ds/5114Mi)
% 35.02/5.30 % (2235564) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2235558-2235564"...
% 35.02/5.30 % (2235564)...printing done.
% 35.02/5.30 % (2235564)Refutation found. Thanks to Tanya!
% 35.02/5.30 % SZS status Theorem for theBenchmark
% 35.02/5.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/5.30 % (2235564)------------------------------
% 0.19/5.30 % (2235564)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/5.30 % (2235564)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/5.30 % (2235564)CaDiCaL version: 2.1.3
% 0.19/5.30 % (2235564)Termination reason: Refutation
% 0.19/5.30 % (2235564)Time elapsed: 4.977 s
% 0.19/5.30 % (2235564)Peak memory usage: 133 MB
% 0.19/5.30 % (2235564)Instructions burned: 18937 (million)
% 0.19/5.30 % (2235558)Success in time 5.064 s
% 0.19/5.30 % Vampire exiting
%------------------------------------------------------------------------------