%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU261+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:48:03 PM UTC 2026
% Result : Theorem 2.79s 1.25s
% Output : Refutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 101 ( 19 unt; 5 def)
% Number of atoms : 433 ( 0 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 599 ( 267 ~; 254 |; 53 &)
% ( 7 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 6 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 76 ( 0 sgn 70 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( relation(X0)
=> ( well_ordering(X0)
<=> ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_wellord1) ).
fof(f3,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( relation(X1)
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( relation_isomorphism(X0,X1,X2)
=> ( ( reflexive(X0)
=> reflexive(X1) )
& ( transitive(X0)
=> transitive(X1) )
& ( connected(X0)
=> connected(X1) )
& ( antisymmetric(X0)
=> antisymmetric(X1) )
& ( well_founded_relation(X0)
=> well_founded_relation(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t53_wellord1) ).
fof(f4,conjecture,
! [X0] :
( relation(X0)
=> ! [X1] :
( relation(X1)
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( ( well_ordering(X0)
& relation_isomorphism(X0,X1,X2) )
=> well_ordering(X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_wellord1) ).
fof(f5,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ! [X1] :
( relation(X1)
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( ( well_ordering(X0)
& relation_isomorphism(X0,X1,X2) )
=> well_ordering(X1) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0] :
( ( well_ordering(X0)
<=> ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( reflexive(X1)
| ~ reflexive(X0) )
& ( transitive(X1)
| ~ transitive(X0) )
& ( connected(X1)
| ~ connected(X0) )
& ( antisymmetric(X1)
| ~ antisymmetric(X0) )
& ( well_founded_relation(X1)
| ~ well_founded_relation(X0) ) )
| ~ relation_isomorphism(X0,X1,X2)
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f8,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( reflexive(X1)
| ~ reflexive(X0) )
& ( transitive(X1)
| ~ transitive(X0) )
& ( connected(X1)
| ~ connected(X0) )
& ( antisymmetric(X1)
| ~ antisymmetric(X0) )
& ( well_founded_relation(X1)
| ~ well_founded_relation(X0) ) )
| ~ relation_isomorphism(X0,X1,X2)
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1) )
| ~ relation(X0) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ well_ordering(X1)
& well_ordering(X0)
& relation_isomorphism(X0,X1,X2)
& relation(X2)
& function(X2) )
& relation(X1) )
& relation(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ well_ordering(X1)
& well_ordering(X0)
& relation_isomorphism(X0,X1,X2)
& relation(X2)
& function(X2) )
& relation(X1) )
& relation(X0) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0] :
( ( ( well_ordering(X0)
| ~ reflexive(X0)
| ~ transitive(X0)
| ~ antisymmetric(X0)
| ~ connected(X0)
| ~ well_founded_relation(X0) )
& ( ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) )
| ~ well_ordering(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f6]) ).
fof(f12,plain,
! [X0] :
( ( ( well_ordering(X0)
| ~ reflexive(X0)
| ~ transitive(X0)
| ~ antisymmetric(X0)
| ~ connected(X0)
| ~ well_founded_relation(X0) )
& ( ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) )
| ~ well_ordering(X0) ) )
| ~ relation(X0) ),
inference(flattening,[],[f11]) ).
fof(f14,plain,
( ~ well_ordering(sK2)
& well_ordering(sK1)
& relation_isomorphism(sK1,sK2,sK3)
& relation(sK3)
& function(sK3)
& relation(sK2)
& relation(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f10]) ).
fof(f15,plain,
! [X0] :
( well_founded_relation(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f16,plain,
! [X0] :
( connected(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f17,plain,
! [X0] :
( antisymmetric(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X0] :
( transitive(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
! [X0] :
( reflexive(X0)
| ~ well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
! [X0] :
( ~ well_founded_relation(X0)
| ~ reflexive(X0)
| ~ transitive(X0)
| ~ antisymmetric(X0)
| ~ connected(X0)
| well_ordering(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f23,plain,
! [X2,X0,X1] :
( well_founded_relation(X1)
| ~ well_founded_relation(X0)
| ~ relation_isomorphism(X0,X1,X2)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f24,plain,
! [X2,X0,X1] :
( antisymmetric(X1)
| ~ antisymmetric(X0)
| ~ relation_isomorphism(X0,X1,X2)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f25,plain,
! [X2,X0,X1] :
( connected(X1)
| ~ connected(X0)
| ~ relation_isomorphism(X0,X1,X2)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f26,plain,
! [X2,X0,X1] :
( transitive(X1)
| ~ transitive(X0)
| ~ relation_isomorphism(X0,X1,X2)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f27,plain,
! [X2,X0,X1] :
( reflexive(X1)
| ~ reflexive(X0)
| ~ relation_isomorphism(X0,X1,X2)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f28,plain,
relation(sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f29,plain,
relation(sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f30,plain,
function(sK3),
inference(cnf_transformation,[],[f14]) ).
fof(f31,plain,
relation(sK3),
inference(cnf_transformation,[],[f14]) ).
fof(f32,plain,
relation_isomorphism(sK1,sK2,sK3),
inference(cnf_transformation,[],[f14]) ).
fof(f33,plain,
well_ordering(sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f34,plain,
~ well_ordering(sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ well_founded_relation(X0)
| ~ relation_isomorphism(X0,X1,X2)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X0)
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| well_ordering(X1)
| ~ relation(X1) ),
inference(resolution,[],[f23,f20]) ).
fof(f38,plain,
! [X2,X0,X1] :
( well_ordering(X1)
| ~ relation_isomorphism(X0,X1,X2)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X0)
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X0) ),
inference(duplicate_literal_removal,[],[f37]) ).
fof(f39,plain,
! [X0,X1] :
( ~ relation_isomorphism(X0,sK2,X1)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(sK2)
| ~ relation(X0)
| ~ reflexive(sK2)
| ~ transitive(sK2)
| ~ antisymmetric(sK2)
| ~ connected(sK2)
| ~ well_founded_relation(X0) ),
inference(resolution,[],[f38,f34]) ).
fof(f40,plain,
! [X0,X1] :
( ~ relation_isomorphism(X0,sK2,X1)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X0)
| ~ reflexive(sK2)
| ~ transitive(sK2)
| ~ antisymmetric(sK2)
| ~ connected(sK2)
| ~ well_founded_relation(X0) ),
inference(forward_subsumption_resolution,[],[f39,f29]) ).
fof(f42,definition,
( spl4_1
<=> connected(sK2) ),
introduced(definition,[new_symbols(definition,[spl4_1])],[avatar_definition]) ).
fof(f44,plain,
( ~ connected(sK2)
| spl4_1 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f46,definition,
( spl4_2
<=> antisymmetric(sK2) ),
introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).
fof(f48,plain,
( ~ antisymmetric(sK2)
| spl4_2 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f50,definition,
( spl4_3
<=> transitive(sK2) ),
introduced(definition,[new_symbols(definition,[spl4_3])],[avatar_definition]) ).
fof(f52,plain,
( ~ transitive(sK2)
| spl4_3 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f54,definition,
( spl4_4
<=> reflexive(sK2) ),
introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).
fof(f56,plain,
( ~ reflexive(sK2)
| spl4_4 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f58,definition,
( spl4_5
<=> ! [X0,X1] :
( ~ relation_isomorphism(X0,sK2,X1)
| ~ well_founded_relation(X0)
| ~ relation(X0)
| ~ function(X1)
| ~ relation(X1) ) ),
introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).
fof(f59,plain,
( ! [X0,X1] :
( ~ relation_isomorphism(X0,sK2,X1)
| ~ well_founded_relation(X0)
| ~ relation(X0)
| ~ function(X1)
| ~ relation(X1) )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f60,plain,
( ~ spl4_1
| ~ spl4_2
| ~ spl4_3
| ~ spl4_4
| spl4_5 ),
inference(avatar_split_clause,[],[f40,f58,f54,f50,f46,f42]) ).
fof(f61,plain,
( ! [X0,X1] :
( ~ connected(X0)
| ~ relation_isomorphism(X0,sK2,X1)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(sK2)
| ~ relation(X0) )
| spl4_1 ),
inference(resolution,[],[f44,f25]) ).
fof(f63,plain,
( ! [X0,X1] :
( ~ relation_isomorphism(X0,sK2,X1)
| ~ connected(X0)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X0) )
| spl4_1 ),
inference(forward_subsumption_resolution,[],[f61,f29]) ).
fof(f64,plain,
( ~ connected(sK1)
| ~ relation(sK3)
| ~ function(sK3)
| ~ relation(sK1)
| spl4_1 ),
inference(resolution,[],[f63,f32]) ).
fof(f65,plain,
( ~ connected(sK1)
| ~ function(sK3)
| ~ relation(sK1)
| spl4_1 ),
inference(forward_subsumption_resolution,[],[f64,f31]) ).
fof(f66,plain,
( ~ connected(sK1)
| ~ relation(sK1)
| spl4_1 ),
inference(forward_subsumption_resolution,[],[f65,f30]) ).
fof(f67,plain,
( ~ connected(sK1)
| spl4_1 ),
inference(forward_subsumption_resolution,[],[f66,f28]) ).
fof(f69,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| spl4_1 ),
inference(resolution,[],[f67,f16]) ).
fof(f70,plain,
( ~ relation(sK1)
| spl4_1 ),
inference(forward_subsumption_resolution,[],[f69,f33]) ).
fof(f72,plain,
( $false
| spl4_1 ),
inference(forward_subsumption_resolution,[],[f70,f28]) ).
fof(f73,plain,
spl4_1,
inference(avatar_contradiction_clause,[],[f72]) ).
fof(f74,plain,
( ! [X0,X1] :
( ~ antisymmetric(X0)
| ~ relation_isomorphism(X0,sK2,X1)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(sK2)
| ~ relation(X0) )
| spl4_2 ),
inference(resolution,[],[f48,f24]) ).
fof(f76,plain,
( ! [X0,X1] :
( ~ relation_isomorphism(X0,sK2,X1)
| ~ antisymmetric(X0)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X0) )
| spl4_2 ),
inference(forward_subsumption_resolution,[],[f74,f29]) ).
fof(f77,plain,
( ~ antisymmetric(sK1)
| ~ relation(sK3)
| ~ function(sK3)
| ~ relation(sK1)
| spl4_2 ),
inference(resolution,[],[f76,f32]) ).
fof(f78,plain,
( ~ antisymmetric(sK1)
| ~ function(sK3)
| ~ relation(sK1)
| spl4_2 ),
inference(forward_subsumption_resolution,[],[f77,f31]) ).
fof(f79,plain,
( ~ antisymmetric(sK1)
| ~ relation(sK1)
| spl4_2 ),
inference(forward_subsumption_resolution,[],[f78,f30]) ).
fof(f80,plain,
( ~ antisymmetric(sK1)
| spl4_2 ),
inference(forward_subsumption_resolution,[],[f79,f28]) ).
fof(f82,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| spl4_2 ),
inference(resolution,[],[f80,f17]) ).
fof(f83,plain,
( ~ relation(sK1)
| spl4_2 ),
inference(forward_subsumption_resolution,[],[f82,f33]) ).
fof(f85,plain,
( $false
| spl4_2 ),
inference(forward_subsumption_resolution,[],[f83,f28]) ).
fof(f86,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f85]) ).
fof(f87,plain,
( ! [X0,X1] :
( ~ transitive(X0)
| ~ relation_isomorphism(X0,sK2,X1)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(sK2)
| ~ relation(X0) )
| spl4_3 ),
inference(resolution,[],[f52,f26]) ).
fof(f89,plain,
( ! [X0,X1] :
( ~ relation_isomorphism(X0,sK2,X1)
| ~ transitive(X0)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X0) )
| spl4_3 ),
inference(forward_subsumption_resolution,[],[f87,f29]) ).
fof(f90,plain,
( ~ transitive(sK1)
| ~ relation(sK3)
| ~ function(sK3)
| ~ relation(sK1)
| spl4_3 ),
inference(resolution,[],[f89,f32]) ).
fof(f91,plain,
( ~ transitive(sK1)
| ~ function(sK3)
| ~ relation(sK1)
| spl4_3 ),
inference(forward_subsumption_resolution,[],[f90,f31]) ).
fof(f92,plain,
( ~ transitive(sK1)
| ~ relation(sK1)
| spl4_3 ),
inference(forward_subsumption_resolution,[],[f91,f30]) ).
fof(f93,plain,
( ~ transitive(sK1)
| spl4_3 ),
inference(forward_subsumption_resolution,[],[f92,f28]) ).
fof(f95,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| spl4_3 ),
inference(resolution,[],[f93,f18]) ).
fof(f96,plain,
( ~ relation(sK1)
| spl4_3 ),
inference(forward_subsumption_resolution,[],[f95,f33]) ).
fof(f98,plain,
( $false
| spl4_3 ),
inference(forward_subsumption_resolution,[],[f96,f28]) ).
fof(f99,plain,
spl4_3,
inference(avatar_contradiction_clause,[],[f98]) ).
fof(f100,plain,
( ! [X0,X1] :
( ~ reflexive(X0)
| ~ relation_isomorphism(X0,sK2,X1)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(sK2)
| ~ relation(X0) )
| spl4_4 ),
inference(resolution,[],[f56,f27]) ).
fof(f102,plain,
( ! [X0,X1] :
( ~ relation_isomorphism(X0,sK2,X1)
| ~ reflexive(X0)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X0) )
| spl4_4 ),
inference(forward_subsumption_resolution,[],[f100,f29]) ).
fof(f103,plain,
( ~ reflexive(sK1)
| ~ relation(sK3)
| ~ function(sK3)
| ~ relation(sK1)
| spl4_4 ),
inference(resolution,[],[f102,f32]) ).
fof(f104,plain,
( ~ reflexive(sK1)
| ~ function(sK3)
| ~ relation(sK1)
| spl4_4 ),
inference(forward_subsumption_resolution,[],[f103,f31]) ).
fof(f105,plain,
( ~ reflexive(sK1)
| ~ relation(sK1)
| spl4_4 ),
inference(forward_subsumption_resolution,[],[f104,f30]) ).
fof(f106,plain,
( ~ reflexive(sK1)
| spl4_4 ),
inference(forward_subsumption_resolution,[],[f105,f28]) ).
fof(f108,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| spl4_4 ),
inference(resolution,[],[f106,f19]) ).
fof(f109,plain,
( ~ relation(sK1)
| spl4_4 ),
inference(forward_subsumption_resolution,[],[f108,f33]) ).
fof(f111,plain,
( $false
| spl4_4 ),
inference(forward_subsumption_resolution,[],[f109,f28]) ).
fof(f112,plain,
spl4_4,
inference(avatar_contradiction_clause,[],[f111]) ).
fof(f113,plain,
( ~ well_founded_relation(sK1)
| ~ relation(sK1)
| ~ function(sK3)
| ~ relation(sK3)
| ~ spl4_5 ),
inference(resolution,[],[f59,f32]) ).
fof(f114,plain,
( ~ well_founded_relation(sK1)
| ~ function(sK3)
| ~ relation(sK3)
| ~ spl4_5 ),
inference(forward_subsumption_resolution,[],[f113,f28]) ).
fof(f115,plain,
( ~ well_founded_relation(sK1)
| ~ relation(sK3)
| ~ spl4_5 ),
inference(forward_subsumption_resolution,[],[f114,f30]) ).
fof(f116,plain,
( ~ well_founded_relation(sK1)
| ~ spl4_5 ),
inference(forward_subsumption_resolution,[],[f115,f31]) ).
fof(f118,plain,
( ~ well_ordering(sK1)
| ~ relation(sK1)
| ~ spl4_5 ),
inference(resolution,[],[f116,f15]) ).
fof(f119,plain,
( ~ relation(sK1)
| ~ spl4_5 ),
inference(forward_subsumption_resolution,[],[f118,f33]) ).
fof(f121,plain,
( $false
| ~ spl4_5 ),
inference(forward_subsumption_resolution,[],[f119,f28]) ).
fof(f122,plain,
~ spl4_5,
inference(avatar_contradiction_clause,[],[f121]) ).
cnf(s1,plain,
( ~ spl4_1
| ~ spl4_2
| ~ spl4_3
| ~ spl4_4
| spl4_5 ),
inference(sat_conversion,[],[f60]) ).
cnf(s2,plain,
spl4_1,
inference(sat_conversion,[],[f73]) ).
cnf(s3,plain,
spl4_2,
inference(sat_conversion,[],[f86]) ).
cnf(s4,plain,
spl4_3,
inference(sat_conversion,[],[f99]) ).
cnf(s5,plain,
spl4_4,
inference(sat_conversion,[],[f112]) ).
cnf(s6,plain,
~ spl4_5,
inference(sat_conversion,[],[f122]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s6,s5,s4,s3,s2]) ).
fof(f123,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU261+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 04:22:31 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.25 % (3014673)Detected formulas, will run a generic FOF schedule.
% 2.79/1.25 % (3014680)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=1703164164:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.79/1.25 % (3014683)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=57107997:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.79/1.25 % (3014683)First to succeed.
% 2.79/1.25 % (3014683)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3014673"
% 2.79/1.25 % (3014681)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4085447422:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.79/1.25 % (3014682)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4142839913:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.79/1.25 % (3014678)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=255045109:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.79/1.25 % (3014679)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=3631321468:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.79/1.25 % (3014682)Also succeeded, but the first one will report.
% 2.79/1.25 % (3014681)Also succeeded, but the first one will report.
% 2.79/1.25 % (3014684)dis-21_1_sil=8000:lcm=predicate:random_seed=1483982013:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.79/1.25 % (3014684)Instruction limit reached!
% 2.79/1.25 % (3014684)------------------------------
% 2.79/1.25 % (3014684)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.79/1.25 % (3014684)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.25 % (3014684)CaDiCaL version: 2.1.3
% 2.79/1.25 % (3014684)Termination reason: Instruction limit
% 2.79/1.25 % (3014684)Termination phase: Saturation
% 2.79/1.25 % (3014684)Time elapsed: 0.053 s
% 2.79/1.25 % (3014684)Peak memory usage: 88 MB
% 2.79/1.25 % (3014684)Instructions burned: 130 (million)
% 2.79/1.25 % (3014692)lrs+10_1_sil=8000:sp=occurrence:random_seed=3216924045:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.79/1.25 % (3014692)Also succeeded, but the first one will report.
% 2.79/1.25 % (3014683)Refutation found. Thanks to Tanya!
% 2.79/1.25 % SZS status Theorem for theBenchmark
% 2.79/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 3.37/1.34 % (3014683)------------------------------
% 3.37/1.34 % (3014683)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.37/1.34 % (3014683)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.37/1.34 % (3014683)CaDiCaL version: 2.1.3
% 3.37/1.34 % (3014683)Termination reason: Refutation
% 3.37/1.34 % (3014683)Time elapsed: 0.005 s
% 3.37/1.34 % (3014683)Peak memory usage: 89 MB
% 3.37/1.34 % (3014683)Instructions burned: 5 (million)
% 3.37/1.34 % (3014683)------------------------------
% 3.37/1.34 % (3014683)------------------------------
% 3.37/1.34 % (3014673)Success in time 0.404 s
% 3.37/1.34 % Vampire exiting
%------------------------------------------------------------------------------