%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU210+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:52:23 PM UTC 2026
% Result : Theorem 0.36s 0.49s
% Output : Refutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 16
% Syntax : Number of formulae : 99 ( 24 unt; 4 def)
% Number of atoms : 298 ( 33 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 351 ( 152 ~; 135 |; 45 &)
% ( 12 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 3 con; 0-3 aty)
% Number of variables : 185 ( 0 sgn 165 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( X1 = relation_rng(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X3,X2),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_relat_1) ).
fof(f6,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f15,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f17,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f28,axiom,
! [X0] :
? [X1] :
( element(X1,powerset(X0))
& empty(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(f31,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_inverse_image(X2,X1))
<=> ? [X3] :
( in(X3,relation_rng(X2))
& in(ordered_pair(X0,X3),X2)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t166_relat_1) ).
fof(f32,conjecture,
! [X0,X1] :
( relation(X1)
=> ~ ( X0 != empty_set
& subset(X0,relation_rng(X1))
& relation_inverse_image(X1,X0) = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t174_relat_1) ).
fof(f33,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ~ ( X0 != empty_set
& subset(X0,relation_rng(X1))
& relation_inverse_image(X1,X0) = empty_set ) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f35,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( empty(X1)
| in(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f38,axiom,
! [X0,X1,X2] :
~ ( in(X0,X1)
& element(X1,powerset(X2))
& empty(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_subset) ).
fof(f39,axiom,
! [X0] :
( empty(X0)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(f45,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f46,plain,
! [X0] :
( ! [X1] :
( X1 = relation_rng(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X3,X2),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( in(X0,relation_inverse_image(X2,X1))
<=> ? [X3] :
( in(X3,relation_rng(X2))
& in(ordered_pair(X0,X3),X2)
& in(X3,X1) ) )
| ~ relation(X2) ),
inference(ennf_transformation,[],[f31]) ).
fof(f52,plain,
? [X0,X1] :
( X0 != empty_set
& subset(X0,relation_rng(X1))
& relation_inverse_image(X1,X0) = empty_set
& relation(X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f53,plain,
? [X0,X1] :
( X0 != empty_set
& subset(X0,relation_rng(X1))
& relation_inverse_image(X1,X0) = empty_set
& relation(X1) ),
inference(flattening,[],[f52]) ).
fof(f55,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f35]) ).
fof(f56,plain,
! [X0,X1] :
( empty(X1)
| in(X0,X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f55]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ~ in(X0,X1)
| ~ element(X1,powerset(X2))
| ~ empty(X2) ),
inference(ennf_transformation,[],[f38]) ).
fof(f60,plain,
! [X0] :
( X0 = empty_set
| ~ empty(X0) ),
inference(ennf_transformation,[],[f39]) ).
fof(f63,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,[],[f45]) ).
fof(f64,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,[],[f63]) ).
fof(f65,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))],[f64]) ).
fof(f66,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_rng(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X3,X2),X0)
| ~ in(X2,X1) )
& ( ? [X3] : in(ordered_pair(X3,X2),X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X3,X2),X0) )
& ( ? [X3] : in(ordered_pair(X3,X2),X0)
| ~ in(X2,X1) ) )
| relation_rng(X0) != X1 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f46]) ).
fof(f67,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_rng(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X3,X2),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X4,X2),X0)
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X6,X5),X0) )
& ( ? [X7] : in(ordered_pair(X7,X5),X0)
| ~ in(X5,X1) ) )
| relation_rng(X0) != X1 ) )
| ~ relation(X0) ),
inference(rectify,[],[f66]) ).
fof(f68,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_rng(X0)
| ( ( ! [X3] : ~ in(ordered_pair(X3,sK1(X0,X1)),X0)
| ~ in(sK1(X0,X1),X1) )
& ( in(ordered_pair(sK2(X0,X1),sK1(X0,X1)),X0)
| in(sK1(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X6,X5),X0) )
& ( in(ordered_pair(sK3(X0,X5),X5),X0)
| ~ in(X5,X1) ) )
| relation_rng(X0) != X1 ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X2,sK1(X0,X1)),skolemize(X4,sK2(X0,X1)),skolemize(X7,sK3(X0,X5))],[f67]) ).
fof(f69,plain,
! [X0] : element(sK4(X0),X0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X1,sK4(X0))],[f15]) ).
fof(f74,plain,
! [X0] :
( element(sK9(X0),powerset(X0))
& empty(sK9(X0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X1,sK9(X0))],[f28]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_inverse_image(X2,X1))
| ! [X3] :
( ~ in(X3,relation_rng(X2))
| ~ in(ordered_pair(X0,X3),X2)
| ~ in(X3,X1) ) )
& ( ? [X3] :
( in(X3,relation_rng(X2))
& in(ordered_pair(X0,X3),X2)
& in(X3,X1) )
| ~ in(X0,relation_inverse_image(X2,X1)) ) )
| ~ relation(X2) ),
inference(nnf_transformation,[],[f51]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_inverse_image(X2,X1))
| ! [X3] :
( ~ in(X3,relation_rng(X2))
| ~ in(ordered_pair(X0,X3),X2)
| ~ in(X3,X1) ) )
& ( ? [X4] :
( in(X4,relation_rng(X2))
& in(ordered_pair(X0,X4),X2)
& in(X4,X1) )
| ~ in(X0,relation_inverse_image(X2,X1)) ) )
| ~ relation(X2) ),
inference(rectify,[],[f76]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_inverse_image(X2,X1))
| ! [X3] :
( ~ in(X3,relation_rng(X2))
| ~ in(ordered_pair(X0,X3),X2)
| ~ in(X3,X1) ) )
& ( ( in(sK11(X0,X1,X2),relation_rng(X2))
& in(ordered_pair(X0,sK11(X0,X1,X2)),X2)
& in(sK11(X0,X1,X2),X1) )
| ~ in(X0,relation_inverse_image(X2,X1)) ) )
| ~ relation(X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X4,sK11(X0,X1,X2))],[f77]) ).
fof(f79,plain,
( empty_set != sK12
& subset(sK12,relation_rng(sK13))
& empty_set = relation_inverse_image(sK13,sK12)
& relation(sK13) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X0,sK12),skolemize(X1,sK13)],[f53]) ).
fof(f83,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f84,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f65]) ).
fof(f87,plain,
! [X0,X1,X5] :
( in(ordered_pair(sK3(X0,X5),X5),X0)
| ~ in(X5,X1)
| relation_rng(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f88,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X6,X5),X0)
| relation_rng(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f91,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f92,plain,
! [X0] : element(sK4(X0),X0),
inference(cnf_transformation,[],[f69]) ).
fof(f94,plain,
empty(empty_set),
inference(cnf_transformation,[],[f17]) ).
fof(f110,plain,
! [X0] : empty(sK9(X0)),
inference(cnf_transformation,[],[f74]) ).
fof(f111,plain,
! [X0] : element(sK9(X0),powerset(X0)),
inference(cnf_transformation,[],[f74]) ).
fof(f117,plain,
! [X2,X3,X0,X1] :
( in(X0,relation_inverse_image(X2,X1))
| ~ in(X3,relation_rng(X2))
| ~ in(ordered_pair(X0,X3),X2)
| ~ in(X3,X1)
| ~ relation(X2) ),
inference(cnf_transformation,[],[f78]) ).
fof(f118,plain,
relation(sK13),
inference(cnf_transformation,[],[f79]) ).
fof(f119,plain,
empty_set = relation_inverse_image(sK13,sK12),
inference(cnf_transformation,[],[f79]) ).
fof(f120,plain,
subset(sK12,relation_rng(sK13)),
inference(cnf_transformation,[],[f79]) ).
fof(f121,plain,
empty_set != sK12,
inference(cnf_transformation,[],[f79]) ).
fof(f123,plain,
! [X0,X1] :
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f127,plain,
! [X2,X0,X1] :
( ~ element(X1,powerset(X2))
| ~ in(X0,X1)
| ~ empty(X2) ),
inference(cnf_transformation,[],[f59]) ).
fof(f128,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f60]) ).
fof(f133,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),X0)
| relation_rng(X0) != X1
| ~ relation(X0) ),
inference(definition_unfolding,[],[f88,f91]) ).
fof(f134,plain,
! [X0,X1,X5] :
( in(unordered_pair(unordered_pair(sK3(X0,X5),X5),singleton(sK3(X0,X5))),X0)
| ~ in(X5,X1)
| relation_rng(X0) != X1
| ~ relation(X0) ),
inference(definition_unfolding,[],[f87,f91]) ).
fof(f136,plain,
! [X2,X3,X0,X1] :
( in(X0,relation_inverse_image(X2,X1))
| ~ in(X3,relation_rng(X2))
| ~ in(unordered_pair(unordered_pair(X0,X3),singleton(X0)),X2)
| ~ in(X3,X1)
| ~ relation(X2) ),
inference(definition_unfolding,[],[f117,f91]) ).
fof(f138,plain,
! [X0,X6,X5] :
( in(X5,relation_rng(X0))
| ~ in(unordered_pair(unordered_pair(X6,X5),singleton(X6)),X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f133]) ).
fof(f139,plain,
! [X0,X5] :
( in(unordered_pair(unordered_pair(sK3(X0,X5),X5),singleton(sK3(X0,X5))),X0)
| ~ in(X5,relation_rng(X0))
| ~ relation(X0) ),
inference(equality_resolution,[],[f134]) ).
fof(f149,plain,
! [X0] : empty_set = sK9(X0),
inference(resolution,[],[f128,f110]) ).
fof(f192,plain,
! [X0] :
( in(sK4(X0),X0)
| empty(X0) ),
inference(resolution,[],[f123,f92]) ).
fof(f206,plain,
! [X0] :
( in(X0,relation_rng(sK13))
| ~ in(X0,sK12) ),
inference(resolution,[],[f84,f120]) ).
fof(f216,definition,
( spl14_2
<=> ! [X0] : ~ in(X0,sK12) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f217,plain,
( ! [X0] : ~ in(X0,sK12)
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f216]) ).
fof(f223,plain,
! [X0,X1] :
( ~ in(X0,sK9(X1))
| ~ empty(X1) ),
inference(resolution,[],[f127,f111]) ).
fof(f224,plain,
! [X0,X1] :
( ~ in(X0,empty_set)
| ~ empty(X1) ),
inference(forward_demodulation,[],[f223,f149]) ).
fof(f226,definition,
( spl14_3
<=> ! [X1] : ~ empty(X1) ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
fof(f227,plain,
( ! [X1] : ~ empty(X1)
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f229,definition,
( spl14_4
<=> ! [X0] : ~ in(X0,empty_set) ),
introduced(definition,[new_symbols(definition,[spl14_4])],[avatar_definition]) ).
fof(f230,plain,
( ! [X0] : ~ in(X0,empty_set)
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f232,plain,
( spl14_3
| spl14_4 ),
inference(avatar_split_clause,[],[f224,f229,f226]) ).
fof(f251,plain,
! [X0,X6,X5] :
( ~ in(unordered_pair(singleton(X6),unordered_pair(X6,X5)),X0)
| in(X5,relation_rng(X0))
| ~ relation(X0) ),
inference(forward_demodulation,[],[f138,f83]) ).
fof(f267,plain,
! [X0,X5] :
( in(unordered_pair(singleton(sK3(X0,X5)),unordered_pair(sK3(X0,X5),X5)),X0)
| ~ in(X5,relation_rng(X0))
| ~ relation(X0) ),
inference(forward_demodulation,[],[f139,f83]) ).
fof(f268,plain,
! [X0,X5] :
( in(unordered_pair(singleton(sK3(X0,X5)),unordered_pair(X5,sK3(X0,X5))),X0)
| ~ in(X5,relation_rng(X0))
| ~ relation(X0) ),
inference(forward_demodulation,[],[f267,f83]) ).
fof(f270,plain,
( $false
| ~ spl14_3 ),
inference(resolution,[],[f227,f94]) ).
fof(f277,plain,
~ spl14_3,
inference(avatar_contradiction_clause,[],[f270]) ).
fof(f300,plain,
! [X2,X3,X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X3)),X2)
| in(X0,relation_inverse_image(X2,X1))
| ~ in(X3,relation_rng(X2))
| ~ in(X3,X1)
| ~ relation(X2) ),
inference(forward_demodulation,[],[f136,f83]) ).
fof(f301,plain,
! [X2,X3,X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X3)),X2)
| in(X0,relation_inverse_image(X2,X1))
| ~ in(X3,X1)
| ~ relation(X2) ),
inference(forward_subsumption_resolution,[],[f300,f251]) ).
fof(f308,plain,
! [X2,X3,X0,X1] :
( ~ in(unordered_pair(singleton(X1),unordered_pair(X0,X1)),X2)
| in(X1,relation_inverse_image(X2,X3))
| ~ in(X0,X3)
| ~ relation(X2) ),
inference(superposition,[],[f301,f83]) ).
fof(f564,plain,
! [X2,X0,X1] :
( in(sK3(X0,X1),relation_inverse_image(X0,X2))
| ~ in(X1,X2)
| ~ relation(X0)
| ~ in(X1,relation_rng(X0))
| ~ relation(X0) ),
inference(resolution,[],[f308,f268]) ).
fof(f571,plain,
! [X2,X0,X1] :
( in(sK3(X0,X1),relation_inverse_image(X0,X2))
| ~ in(X1,X2)
| ~ relation(X0)
| ~ in(X1,relation_rng(X0)) ),
inference(duplicate_literal_removal,[],[f564]) ).
fof(f1384,definition,
( spl14_8
<=> empty(sK12) ),
introduced(definition,[new_symbols(definition,[spl14_8])],[avatar_definition]) ).
fof(f1385,plain,
( empty(sK12)
| ~ spl14_8 ),
inference(avatar_component_clause,[],[f1384]) ).
fof(f1658,plain,
! [X0] :
( in(sK3(sK13,X0),empty_set)
| ~ in(X0,sK12)
| ~ relation(sK13)
| ~ in(X0,relation_rng(sK13)) ),
inference(superposition,[],[f571,f119]) ).
fof(f1672,plain,
! [X0] :
( in(sK3(sK13,X0),empty_set)
| ~ in(X0,sK12)
| ~ relation(sK13) ),
inference(forward_subsumption_resolution,[],[f1658,f206]) ).
fof(f1675,plain,
! [X0] :
( in(sK3(sK13,X0),empty_set)
| ~ in(X0,sK12) ),
inference(forward_subsumption_resolution,[],[f1672,f118]) ).
fof(f1678,plain,
( ! [X0] : ~ in(X0,sK12)
| ~ spl14_4 ),
inference(forward_subsumption_resolution,[],[f1675,f230]) ).
fof(f1679,plain,
( spl14_2
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f1678,f229,f216]) ).
fof(f1686,plain,
( empty(sK12)
| ~ spl14_2 ),
inference(resolution,[],[f217,f192]) ).
fof(f1688,plain,
( spl14_8
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f1686,f216,f1384]) ).
fof(f1712,plain,
( empty_set = sK12
| ~ spl14_8 ),
inference(resolution,[],[f1385,f128]) ).
fof(f1741,plain,
( $false
| ~ spl14_8 ),
inference(forward_subsumption_resolution,[],[f1712,f121]) ).
fof(f1742,plain,
~ spl14_8,
inference(avatar_contradiction_clause,[],[f1741]) ).
cnf(s3,plain,
( spl14_3
| spl14_4 ),
inference(sat_conversion,[],[f232]) ).
cnf(s8,plain,
~ spl14_3,
inference(sat_conversion,[],[f277]) ).
cnf(s11,plain,
( spl14_2
| ~ spl14_4 ),
inference(sat_conversion,[],[f1679]) ).
cnf(s12,plain,
( ~ spl14_2
| spl14_8 ),
inference(sat_conversion,[],[f1688]) ).
cnf(s16,plain,
~ spl14_8,
inference(sat_conversion,[],[f1742]) ).
cnf(s18,plain,
~ spl14_2,
inference(rat,[],[s12,s16]) ).
cnf(s19,plain,
~ spl14_4,
inference(rat,[],[s11,s18]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s3,s19,s8]) ).
fof(f1744,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU210+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n020.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:05:04 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 Running first-order model finding
% 0.12/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.36/0.49 % (4013405)Will run a generic schedule for satisfiability detection.
% 0.36/0.49 % (4013415)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2009534659:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.36/0.49 % (4013410)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1723194866_2999 on theBenchmark for (2999ds/0Mi)
% 0.36/0.49 % (4013411)% WARNING: option uhcvi not known.
% 0.36/0.49 % (4013416)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=349734250:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.36/0.49 % (4013412)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3104659701:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.36/0.49 % (4013413)dis+10_1_sil=32000:sp=arity:random_seed=4232556999:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.36/0.49 % (4013414)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2411774451:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.36/0.49 % TRYING [1]
% 0.36/0.49 % (4013411)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3509535123:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.36/0.49 % TRYING [2]
% 0.36/0.49 % TRYING [3]
% 0.36/0.49 % TRYING [4]
% 0.36/0.49 % TRYING [5]
% 0.36/0.49 % (4013413) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4013405-4013413"...
% 0.36/0.49 % (4013415)Instruction limit reached!
% 0.36/0.49 % (4013415)------------------------------
% 0.36/0.49 % (4013415)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.49 % (4013415)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.49 % (4013415)CaDiCaL version: 2.1.3
% 0.36/0.49 % (4013415)Termination reason: Instruction limit
% 0.36/0.49 % (4013415)Termination phase: Saturation
% 0.36/0.49 % (4013415)Time elapsed: 0.048 s
% 0.36/0.49 % (4013415)Peak memory usage: 13 MB
% 0.36/0.49 % (4013415)Instructions burned: 134 (million)
% 0.36/0.49 % (4013413)...printing done.
% 0.36/0.49 % (4013413)Refutation found. Thanks to Tanya!
% 0.36/0.49 % SZS status Theorem for theBenchmark
% 0.36/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.36/0.49 % (4013413)------------------------------
% 0.36/0.49 % (4013413)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.49 % (4013413)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.49 % (4013413)CaDiCaL version: 2.1.3
% 0.36/0.49 % (4013413)Termination reason: Refutation
% 0.36/0.49 % (4013413)Time elapsed: 0.042 s
% 0.36/0.49 % (4013413)Peak memory usage: 13 MB
% 0.36/0.49 % (4013413)Instructions burned: 63 (million)
% 0.36/0.49 % (4013405)Success in time 0.076 s
% 0.36/0.49 % Vampire exiting
%------------------------------------------------------------------------------