%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU258+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:02 PM UTC 2026
% Result : Theorem 6.82s 1.94s
% Output : Refutation 8.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 90 ( 21 unt; 3 def)
% Number of atoms : 307 ( 22 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 353 ( 136 ~; 132 |; 62 &)
% ( 10 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 146 ( 138 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ( well_ordering(X0)
<=> ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_wellord1) ).
fof(f10,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f19,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(f33,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_wellord1) ).
fof(f40,axiom,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X0,X2)
& in(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t106_zfmisc_1) ).
fof(f41,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
fof(f44,axiom,
! [X0,X1] :
( relation(X1)
=> ( subset(relation_field(relation_restriction(X1,X0)),relation_field(X1))
& subset(relation_field(relation_restriction(X1,X0)),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_wellord1) ).
fof(f47,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(ordered_pair(X0,X1),X2)
=> ( in(X0,relation_field(X2))
& in(X1,relation_field(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_relat_1) ).
fof(f48,conjecture,
! [X0,X1] :
( relation(X1)
=> ( ( well_ordering(X1)
& subset(X0,relation_field(X1)) )
=> relation_field(relation_restriction(X1,X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_wellord1) ).
fof(f49,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ( ( well_ordering(X1)
& subset(X0,relation_field(X1)) )
=> relation_field(relation_restriction(X1,X0)) = X0 ) ),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f65,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f66,plain,
! [X0] :
( ( well_ordering(X0)
<=> ( reflexive(X0)
& transitive(X0)
& antisymmetric(X0)
& connected(X0)
& well_founded_relation(X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f69,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f72,plain,
! [X0] :
( ( reflexive(X0)
<=> ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f33]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) )
| ~ relation(X2) ),
inference(ennf_transformation,[],[f41]) ).
fof(f75,plain,
! [X0,X1] :
( ( subset(relation_field(relation_restriction(X1,X0)),relation_field(X1))
& subset(relation_field(relation_restriction(X1,X0)),X0) )
| ~ relation(X1) ),
inference(ennf_transformation,[],[f44]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ( in(X0,relation_field(X2))
& in(X1,relation_field(X2)) )
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( in(X0,relation_field(X2))
& in(X1,relation_field(X2)) )
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
? [X0,X1] :
( relation_field(relation_restriction(X1,X0)) != X0
& well_ordering(X1)
& subset(X0,relation_field(X1))
& relation(X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f81,plain,
? [X0,X1] :
( relation_field(relation_restriction(X1,X0)) != X0
& well_ordering(X1)
& subset(X0,relation_field(X1))
& relation(X1) ),
inference(flattening,[],[f80]) ).
fof(f88,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f89,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f88]) ).
fof(f90,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f65]) ).
fof(f91,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f90]) ).
fof(f92,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f91]) ).
fof(f93,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,[],[f66]) ).
fof(f94,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,[],[f93]) ).
fof(f96,plain,
! [X0] :
( ( ( reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f72]) ).
fof(f97,plain,
! [X0] :
( ( ( reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(rectify,[],[f96]) ).
fof(f98,plain,
! [X0] :
( ( ( reflexive(X0)
| ( ~ in(ordered_pair(sK2(X0),sK2(X0)),X0)
& in(sK2(X0),relation_field(X0)) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2(X0))],[f97]) ).
fof(f104,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) )
& ( ( in(X0,X2)
& in(X1,X3) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f40]) ).
fof(f105,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) )
& ( ( in(X0,X2)
& in(X1,X3) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f104]) ).
fof(f106,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(nnf_transformation,[],[f73]) ).
fof(f107,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(flattening,[],[f106]) ).
fof(f108,plain,
( sK8 != relation_field(relation_restriction(sK9,sK8))
& well_ordering(sK9)
& subset(sK8,relation_field(sK9))
& relation(sK9) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f81]) ).
fof(f119,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f89]) ).
fof(f120,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f121,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f122,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f127,plain,
! [X0] :
( ~ well_ordering(X0)
| reflexive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f94]) ).
fof(f129,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f132,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f140,plain,
! [X2,X0] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0))
| ~ reflexive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f155,plain,
! [X2,X3,X0,X1] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) ),
inference(cnf_transformation,[],[f105]) ).
fof(f158,plain,
! [X2,X0,X1] :
( ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2)
| in(X0,relation_restriction(X2,X1))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f107]) ).
fof(f161,plain,
! [X0,X1] :
( subset(relation_field(relation_restriction(X1,X0)),X0)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f165,plain,
! [X2,X0,X1] :
( in(X1,relation_field(X2))
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f167,plain,
relation(sK9),
inference(cnf_transformation,[],[f108]) ).
fof(f168,plain,
subset(sK8,relation_field(sK9)),
inference(cnf_transformation,[],[f108]) ).
fof(f169,plain,
well_ordering(sK9),
inference(cnf_transformation,[],[f108]) ).
fof(f170,plain,
sK8 != relation_field(relation_restriction(sK9,sK8)),
inference(cnf_transformation,[],[f108]) ).
fof(f180,plain,
! [X2,X0] :
( in(unordered_pair(unordered_pair(X2,X2),singleton(X2)),X0)
| ~ in(X2,relation_field(X0))
| ~ reflexive(X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f140,f129]) ).
fof(f181,plain,
! [X2,X3,X0,X1] :
( in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) ),
inference(definition_unfolding,[],[f155,f129]) ).
fof(f185,plain,
! [X2,X0,X1] :
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2)
| in(X1,relation_field(X2))
| ~ relation(X2) ),
inference(definition_unfolding,[],[f165,f129]) ).
fof(f188,definition,
sF10 = relation_restriction(sK9,sK8),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f189,plain,
relation_restriction(sK9,sK8) = sF10,
inference(reorient_equations,[],[f188]) ).
fof(f190,definition,
sF11 = relation_field(sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f191,plain,
relation_field(sF10) = sF11,
inference(reorient_equations,[],[f190]) ).
fof(f192,plain,
sK8 != sF11,
inference(definition_folding,[],[f170,f191,f189]) ).
fof(f193,definition,
sF12 = relation_field(sK9),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
fof(f194,plain,
relation_field(sK9) = sF12,
inference(reorient_equations,[],[f193]) ).
fof(f195,plain,
subset(sK8,sF12),
inference(definition_folding,[],[f168,f194]) ).
fof(f208,plain,
( relation(sF10)
| ~ relation(sK9) ),
inference(superposition,[],[f132,f189]) ).
fof(f209,plain,
relation(sF10),
inference(forward_subsumption_resolution,[],[f208,f167]) ).
fof(f210,plain,
! [X0] :
( ~ in(X0,sK8)
| in(X0,sF12) ),
inference(resolution,[],[f120,f195]) ).
fof(f283,plain,
! [X2,X3,X0,X1] :
( in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),relation_restriction(X3,X1))
| ~ in(X2,X1)
| ~ in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),X3)
| ~ in(X0,X1)
| ~ relation(X3) ),
inference(resolution,[],[f181,f158]) ).
fof(f286,plain,
( subset(relation_field(sF10),sK8)
| ~ relation(sK9) ),
inference(superposition,[],[f161,f189]) ).
fof(f287,plain,
subset(relation_field(sF10),sK8),
inference(forward_subsumption_resolution,[],[f286,f167]) ).
fof(f288,plain,
subset(sF11,sK8),
inference(forward_demodulation,[],[f287,f191]) ).
fof(f290,plain,
( ~ subset(sK8,sF11)
| sK8 = sF11 ),
inference(resolution,[],[f288,f119]) ).
fof(f291,plain,
~ subset(sK8,sF11),
inference(forward_subsumption_resolution,[],[f290,f192]) ).
fof(f296,plain,
( reflexive(sK9)
| ~ relation(sK9) ),
inference(resolution,[],[f127,f169]) ).
fof(f297,plain,
reflexive(sK9),
inference(forward_subsumption_resolution,[],[f296,f167]) ).
fof(f301,plain,
! [X0,X1] :
( in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sF10)
| ~ in(X1,sK8)
| ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK9)
| ~ in(X0,sK8)
| ~ relation(sK9) ),
inference(superposition,[],[f283,f189]) ).
fof(f303,plain,
! [X0,X1] :
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK9)
| ~ in(X1,sK8)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sF10)
| ~ in(X0,sK8) ),
inference(forward_subsumption_resolution,[],[f301,f167]) ).
fof(f306,plain,
! [X0] :
( ~ in(X0,sK8)
| in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sF10)
| ~ in(X0,sK8)
| ~ in(X0,relation_field(sK9))
| ~ reflexive(sK9)
| ~ relation(sK9) ),
inference(resolution,[],[f303,f180]) ).
fof(f307,plain,
! [X0] :
( ~ in(X0,sK8)
| in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sF10)
| ~ in(X0,relation_field(sK9))
| ~ reflexive(sK9)
| ~ relation(sK9) ),
inference(duplicate_literal_removal,[],[f306]) ).
fof(f308,plain,
! [X0] :
( ~ in(X0,sK8)
| in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sF10)
| ~ in(X0,relation_field(sK9))
| ~ relation(sK9) ),
inference(forward_subsumption_resolution,[],[f307,f297]) ).
fof(f309,plain,
! [X0] :
( ~ in(X0,sK8)
| in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sF10)
| ~ in(X0,relation_field(sK9)) ),
inference(forward_subsumption_resolution,[],[f308,f167]) ).
fof(f310,plain,
! [X0] :
( ~ in(X0,sF12)
| ~ in(X0,sK8)
| in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sF10) ),
inference(forward_demodulation,[],[f309,f194]) ).
fof(f311,plain,
! [X0] :
( in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sF10)
| ~ in(X0,sK8) ),
inference(forward_subsumption_resolution,[],[f310,f210]) ).
fof(f313,plain,
! [X0] :
( ~ in(X0,sK8)
| in(X0,relation_field(sF10))
| ~ relation(sF10) ),
inference(resolution,[],[f311,f185]) ).
fof(f315,plain,
! [X0] :
( ~ in(X0,sK8)
| in(X0,relation_field(sF10)) ),
inference(forward_subsumption_resolution,[],[f313,f209]) ).
fof(f317,plain,
! [X0] :
( ~ in(X0,sK8)
| in(X0,sF11) ),
inference(forward_demodulation,[],[f315,f191]) ).
fof(f320,plain,
! [X0] :
( in(sK0(sK8,X0),sF11)
| subset(sK8,X0) ),
inference(resolution,[],[f317,f121]) ).
fof(f329,plain,
( subset(sK8,sF11)
| subset(sK8,sF11) ),
inference(resolution,[],[f320,f122]) ).
fof(f332,plain,
subset(sK8,sF11),
inference(duplicate_literal_removal,[],[f329]) ).
fof(f333,plain,
$false,
inference(forward_subsumption_resolution,[],[f332,f291]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU258+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n004.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 04:21:22 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.82/1.94 % (4145204)Detected formulas, will run a generic FOF schedule.
% 6.82/1.94 % (4145215)dis-21_1_sil=8000:lcm=predicate:random_seed=4147028050: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.82/1.94 % (4145215)Instruction limit reached!
% 6.82/1.94 % (4145215)------------------------------
% 6.82/1.94 % (4145215)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145215)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145215)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145215)Termination reason: Instruction limit
% 6.82/1.94 % (4145215)Termination phase: Saturation
% 6.82/1.94 % (4145215)Time elapsed: 0.041 s
% 6.82/1.94 % (4145215)Peak memory usage: 89 MB
% 6.82/1.94 % (4145215)Instructions burned: 130 (million)
% 6.82/1.94 % (4145213)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3748585986:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.82/1.94 % (4145211)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=681071673:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.82/1.94 % (4145209)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=3751951471:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.82/1.94 % (4145210)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=2215981631:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.82/1.94 % (4145212)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=43416128:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.82/1.94 % (4145212)Refutation not found, incomplete strategy
% 6.82/1.94 % (4145212)------------------------------
% 6.82/1.94 % (4145212)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145212)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145212)Termination reason: Refutation not found, incomplete strategy
% 6.82/1.94 % (4145212)Time elapsed: 0.002 s
% 6.82/1.94 % (4145212)Peak memory usage: 88 MB
% 6.82/1.94 % (4145212)Instructions burned: 1 (million)
% 6.82/1.94 % (4145214)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1504043504:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.82/1.94 % (4145213)Instruction limit reached!
% 6.82/1.94 % (4145213)------------------------------
% 6.82/1.94 % (4145213)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145213)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145213)Termination reason: Instruction limit
% 6.82/1.94 % (4145213)Termination phase: Saturation
% 6.82/1.94 % (4145213)Time elapsed: 0.063 s
% 6.82/1.94 % (4145213)Peak memory usage: 88 MB
% 6.82/1.94 % (4145213)Instructions burned: 119 (million)
% 6.82/1.94 % (4145214)Instruction limit reached!
% 6.82/1.94 % (4145214)------------------------------
% 6.82/1.94 % (4145214)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145214)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145214)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145214)Termination reason: Instruction limit
% 6.82/1.94 % (4145214)Termination phase: Saturation
% 6.82/1.94 % (4145214)Time elapsed: 0.093 s
% 6.82/1.94 % (4145214)Peak memory usage: 90 MB
% 6.82/1.94 % (4145214)Instructions burned: 139 (million)
% 6.82/1.94 % (4145222)lrs+10_1_sil=8000:sp=occurrence:random_seed=2280948519:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.82/1.94 % (4145224)lrs+10_1_sil=32000:urr=on:br=off:random_seed=612576377:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.82/1.94 % (4145212)------------------------------
% 6.82/1.94 % (4145212)------------------------------
% 6.82/1.94 % (4145225)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2909626186:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.82/1.94 % (4145222)Instruction limit reached!
% 6.82/1.94 % (4145222)------------------------------
% 6.82/1.94 % (4145222)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145222)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145222)Termination reason: Instruction limit
% 6.82/1.94 % (4145222)Termination phase: Saturation
% 6.82/1.94 % (4145222)Time elapsed: 0.146 s
% 6.82/1.94 % (4145222)Peak memory usage: 93 MB
% 6.82/1.94 % (4145222)Instructions burned: 287 (million)
% 6.82/1.94 % (4145224)Instruction limit reached!
% 6.82/1.94 % (4145224)------------------------------
% 6.82/1.94 % (4145224)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145224)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145224)Termination reason: Instruction limit
% 6.82/1.94 % (4145224)Termination phase: Saturation
% 6.82/1.94 % (4145224)Time elapsed: 0.091 s
% 6.82/1.94 % (4145224)Peak memory usage: 89 MB
% 6.82/1.94 % (4145224)Instructions burned: 158 (million)
% 6.82/1.94 % (4145228)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=773586416:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 6.82/1.94 % (4145230)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3745323154:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 6.82/1.94 % (4145230)Refutation not found, incomplete strategy
% 6.82/1.94 % (4145230)------------------------------
% 6.82/1.94 % (4145230)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145230)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145230)Termination reason: Refutation not found, incomplete strategy
% 6.82/1.94 % (4145230)Time elapsed: 0.002 s
% 6.82/1.94 % (4145230)Peak memory usage: 88 MB
% 6.82/1.94 % (4145230)Instructions burned: 4 (million)
% 6.82/1.94 % (4145231)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=679106753:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 6.82/1.94 % (4145225)Instruction limit reached!
% 6.82/1.94 % (4145225)------------------------------
% 6.82/1.94 % (4145225)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145225)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145225)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145225)Termination reason: Instruction limit
% 6.82/1.94 % (4145225)Termination phase: Saturation
% 6.82/1.94 % (4145225)Time elapsed: 0.236 s
% 6.82/1.94 % (4145225)Peak memory usage: 92 MB
% 6.82/1.94 % (4145225)Instructions burned: 326 (million)
% 6.82/1.94 % (4145230)------------------------------
% 6.82/1.94 % (4145230)------------------------------
% 6.82/1.94 % (4145228)Instruction limit reached!
% 6.82/1.94 % (4145228)------------------------------
% 6.82/1.94 % (4145228)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145228)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145228)Termination reason: Instruction limit
% 6.82/1.94 % (4145228)Termination phase: Saturation
% 6.82/1.94 % (4145228)Time elapsed: 0.157 s
% 6.82/1.94 % (4145228)Peak memory usage: 92 MB
% 6.82/1.94 % (4145228)Instructions burned: 248 (million)
% 6.82/1.94 % (4145209)First to succeed.
% 6.82/1.94 % (4145209)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4145204"
% 6.82/1.94 % (4145235)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3565096293:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 6.82/1.94 % (4145236)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=777906177:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 6.82/1.94 % (4145237)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3689062968:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 6.82/1.94 % (4145236)Instruction limit reached!
% 6.82/1.94 % (4145236)------------------------------
% 6.82/1.94 % (4145236)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145236)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145236)Termination reason: Instruction limit
% 6.82/1.94 % (4145236)Termination phase: Saturation
% 6.82/1.94 % (4145236)Time elapsed: 0.037 s
% 6.82/1.94 % (4145236)Peak memory usage: 89 MB
% 6.82/1.94 % (4145236)Instructions burned: 128 (million)
% 6.82/1.94 % (4145235)Instruction limit reached!
% 6.82/1.94 % (4145235)------------------------------
% 6.82/1.94 % (4145235)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145235)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145235)Termination reason: Instruction limit
% 6.82/1.94 % (4145235)Termination phase: Saturation
% 6.82/1.94 % (4145235)Time elapsed: 0.085 s
% 6.82/1.94 % (4145235)Peak memory usage: 90 MB
% 6.82/1.94 % (4145235)Instructions burned: 114 (million)
% 6.82/1.94 % (4145237)Instruction limit reached!
% 6.82/1.94 % (4145237)------------------------------
% 6.82/1.94 % (4145237)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.82/1.94 % (4145237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.94 % (4145237)CaDiCaL version: 2.1.3
% 6.82/1.94 % (4145237)Termination reason: Instruction limit
% 6.82/1.94 % (4145237)Termination phase: Saturation
% 6.82/1.94 % (4145237)Time elapsed: 0.067 s
% 6.82/1.94 % (4145237)Peak memory usage: 89 MB
% 6.82/1.94 % (4145237)Instructions burned: 114 (million)
% 6.82/1.94 % (4145211)Also succeeded, but the first one will report.
% 6.82/1.94 % (4145241)lrs+10_1_sil=8000:sp=occurrence:random_seed=112814:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 6.82/1.94 % (4145242)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=314493644:i=437:sd=1:aac=none:ss=included_2990 on theBenchmark for (2990ds/437Mi)
% 6.82/1.94 % (4145209)Refutation found. Thanks to Tanya!
% 6.82/1.94 % SZS status Theorem for theBenchmark
% 6.82/1.94 % SZS output start Proof for theBenchmark
% See solution above
% 8.07/2.07 % (4145209)------------------------------
% 8.07/2.07 % (4145209)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.07/2.07 % (4145209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.07/2.07 % (4145209)CaDiCaL version: 2.1.3
% 8.07/2.07 % (4145209)Termination reason: Refutation
% 8.07/2.07 % (4145209)Time elapsed: 0.632 s
% 8.07/2.07 % (4145209)Peak memory usage: 128 MB
% 8.07/2.07 % (4145209)Instructions burned: 944 (million)
% 8.07/2.07 % (4145209)------------------------------
% 8.07/2.07 % (4145209)------------------------------
% 8.07/2.07 % (4145204)Success in time 1.073 s
% 8.07/2.07 % Vampire exiting
%------------------------------------------------------------------------------