%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU197+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 : n001.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:20 PM UTC 2026
% Result : Theorem 0.15s 0.53s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 113 ( 14 unt; 5 def)
% Number of atoms : 321 ( 18 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 343 ( 135 ~; 180 |; 6 &)
% ( 15 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 192 ( 0 sgn 187 !; 5 ?)
% 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] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( X2 = relation_rng_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_relat_1) ).
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(f12,axiom,
! [X0,X1] :
( relation(X1)
=> relation(relation_rng_restriction(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k8_relat_1) ).
fof(f26,conjecture,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_rng(relation_rng_restriction(X1,X2)))
<=> ( in(X0,X1)
& in(X0,relation_rng(X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t115_relat_1) ).
fof(f27,negated_conjecture,
~ ! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_rng(relation_rng_restriction(X1,X2)))
<=> ( in(X0,X1)
& in(X0,relation_rng(X2)) ) ) ),
inference(negated_conjecture,[status(cth)],[f26]) ).
fof(f35,plain,
! [X0,X1] :
( ! [X2] :
( ( X2 = relation_rng_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) ) ) )
| ~ relation(X2) )
| ~ relation(X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f36,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(f37,plain,
! [X0,X1] :
( relation(relation_rng_restriction(X0,X1))
| ~ relation(X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f41,plain,
? [X0,X1,X2] :
( ( in(X0,relation_rng(relation_rng_restriction(X1,X2)))
<~> ( in(X0,X1)
& in(X0,relation_rng(X2)) ) )
& relation(X2) ),
inference(ennf_transformation,[],[f27]) ).
fof(f50,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f54,plain,
! [X2,X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(X2)
| in(ordered_pair(X3,X4),X1)
| ~ in(ordered_pair(X3,X4),X2)
| relation_rng_restriction(X0,X1) != X2 ),
inference(cnf_transformation,[],[f35]) ).
fof(f55,plain,
! [X2,X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(X2)
| in(X4,X0)
| ~ in(ordered_pair(X3,X4),X2)
| relation_rng_restriction(X0,X1) != X2 ),
inference(cnf_transformation,[],[f35]) ).
fof(f56,plain,
! [X2,X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(X2)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(X4,X0)
| in(ordered_pair(X3,X4),X2)
| relation_rng_restriction(X0,X1) != X2 ),
inference(cnf_transformation,[],[f35]) ).
fof(f57,plain,
! [X2,X3,X0,X1] :
( ~ relation(X0)
| ~ in(ordered_pair(X3,X2),X0)
| in(X2,X1)
| relation_rng(X0) != X1 ),
inference(cnf_transformation,[],[f36]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ relation(X0)
| in(ordered_pair(sK3(X0,X2),X2),X0)
| ~ in(X2,X1)
| relation_rng(X0) != X1 ),
inference(cnf_transformation,[],[f36]) ).
fof(f61,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f62,plain,
! [X0,X1] :
( ~ relation(X1)
| relation(relation_rng_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f79,plain,
( ~ in(sK10,relation_rng(sK12))
| ~ in(sK10,sK11)
| ~ in(sK10,relation_rng(relation_rng_restriction(sK11,sK12))) ),
inference(cnf_transformation,[],[f41]) ).
fof(f80,plain,
( in(sK10,relation_rng(sK12))
| in(sK10,relation_rng(relation_rng_restriction(sK11,sK12))) ),
inference(cnf_transformation,[],[f41]) ).
fof(f81,plain,
( in(sK10,sK11)
| in(sK10,relation_rng(relation_rng_restriction(sK11,sK12))) ),
inference(cnf_transformation,[],[f41]) ).
fof(f82,plain,
relation(sK12),
inference(cnf_transformation,[],[f41]) ).
fof(f88,plain,
! [X2,X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| ~ in(X4,X0)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X2)
| relation_rng_restriction(X0,X1) != X2 ),
inference(definition_unfolding,[],[f56,f61,f61]) ).
fof(f89,plain,
! [X2,X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(X2)
| in(X4,X0)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X2)
| relation_rng_restriction(X0,X1) != X2 ),
inference(definition_unfolding,[],[f55,f61]) ).
fof(f90,plain,
! [X2,X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(X2)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X2)
| relation_rng_restriction(X0,X1) != X2 ),
inference(definition_unfolding,[],[f54,f61,f61]) ).
fof(f96,plain,
! [X2,X0,X1] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(sK3(X0,X2),X2),singleton(sK3(X0,X2))),X0)
| ~ in(X2,X1)
| relation_rng(X0) != X1 ),
inference(definition_unfolding,[],[f58,f61]) ).
fof(f97,plain,
! [X2,X3,X0,X1] :
( ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(X3,X2),singleton(X3)),X0)
| in(X2,X1)
| relation_rng(X0) != X1 ),
inference(definition_unfolding,[],[f57,f61]) ).
fof(f99,plain,
! [X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(relation_rng_restriction(X0,X1))
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| ~ in(X4,X0)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(equality_resolution,[],[f88]) ).
fof(f100,plain,
! [X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(relation_rng_restriction(X0,X1))
| in(X4,X0)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(equality_resolution,[],[f89]) ).
fof(f101,plain,
! [X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(relation_rng_restriction(X0,X1))
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(equality_resolution,[],[f90]) ).
fof(f102,plain,
! [X2,X0] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(sK3(X0,X2),X2),singleton(sK3(X0,X2))),X0)
| ~ in(X2,relation_rng(X0)) ),
inference(equality_resolution,[],[f96]) ).
fof(f103,plain,
! [X2,X3,X0] :
( ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(X3,X2),singleton(X3)),X0)
| in(X2,relation_rng(X0)) ),
inference(equality_resolution,[],[f97]) ).
fof(f106,plain,
! [X3,X0,X1,X4] :
( relation(X1)
| relation(relation_rng_restriction(X0,X1))
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| in(X4,X0)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f99]) ).
fof(f107,plain,
! [X3,X0,X1,X4] :
( relation(X1)
| relation(relation_rng_restriction(X0,X1))
| ~ in(X4,X0)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f100]) ).
fof(f108,plain,
! [X3,X0,X1,X4] :
( relation(X1)
| relation(relation_rng_restriction(X0,X1))
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f101]) ).
fof(f114,plain,
! [X2,X0] :
( relation(X0)
| ~ in(unordered_pair(unordered_pair(sK3(X0,X2),X2),singleton(sK3(X0,X2))),X0)
| in(X2,relation_rng(X0)) ),
inference(consistent_polarity_flipping,[],[f102]) ).
fof(f115,plain,
! [X2,X3,X0] :
( relation(X0)
| in(unordered_pair(unordered_pair(X3,X2),singleton(X3)),X0)
| ~ in(X2,relation_rng(X0)) ),
inference(consistent_polarity_flipping,[],[f103]) ).
fof(f116,plain,
! [X0,X1] :
( ~ relation(relation_rng_restriction(X0,X1))
| relation(X1) ),
inference(consistent_polarity_flipping,[],[f62]) ).
fof(f133,plain,
~ relation(sK12),
inference(consistent_polarity_flipping,[],[f82]) ).
fof(f134,plain,
( ~ in(sK10,sK11)
| ~ in(sK10,relation_rng(relation_rng_restriction(sK11,sK12))) ),
inference(consistent_polarity_flipping,[],[f81]) ).
fof(f135,plain,
( ~ in(sK10,relation_rng(sK12))
| ~ in(sK10,relation_rng(relation_rng_restriction(sK11,sK12))) ),
inference(consistent_polarity_flipping,[],[f80]) ).
fof(f136,plain,
( in(sK10,relation_rng(sK12))
| in(sK10,sK11)
| in(sK10,relation_rng(relation_rng_restriction(sK11,sK12))) ),
inference(consistent_polarity_flipping,[],[f79]) ).
fof(f143,definition,
( spl13_1
<=> in(sK10,relation_rng(relation_rng_restriction(sK11,sK12))) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f144,plain,
( ~ in(sK10,relation_rng(relation_rng_restriction(sK11,sK12)))
| spl13_1 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f145,plain,
( in(sK10,relation_rng(relation_rng_restriction(sK11,sK12)))
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f147,definition,
( spl13_2
<=> in(sK10,sK11) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
fof(f148,plain,
( ~ in(sK10,sK11)
| spl13_2 ),
inference(avatar_component_clause,[],[f147]) ).
fof(f151,definition,
( spl13_3
<=> in(sK10,relation_rng(sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_3])],[avatar_definition]) ).
fof(f152,plain,
( ~ in(sK10,relation_rng(sK12))
| spl13_3 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f153,plain,
( in(sK10,relation_rng(sK12))
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f154,plain,
( spl13_1
| spl13_2
| spl13_3 ),
inference(avatar_split_clause,[],[f136,f151,f147,f143]) ).
fof(f155,plain,
( ~ spl13_1
| ~ spl13_3 ),
inference(avatar_split_clause,[],[f135,f151,f143]) ).
fof(f156,plain,
( ~ spl13_1
| ~ spl13_2 ),
inference(avatar_split_clause,[],[f134,f147,f143]) ).
fof(f183,plain,
! [X2,X3,X0] :
( ~ in(X2,relation_rng(X0))
| relation(X0)
| in(unordered_pair(singleton(X3),unordered_pair(X3,X2)),X0) ),
inference(forward_demodulation,[],[f115,f50]) ).
fof(f190,plain,
! [X2,X0] :
( ~ in(unordered_pair(singleton(sK3(X0,X2)),unordered_pair(sK3(X0,X2),X2)),X0)
| relation(X0)
| in(X2,relation_rng(X0)) ),
inference(forward_demodulation,[],[f114,f50]) ).
fof(f191,plain,
! [X2,X0] :
( ~ in(unordered_pair(singleton(sK3(X0,X2)),unordered_pair(X2,sK3(X0,X2))),X0)
| relation(X0)
| in(X2,relation_rng(X0)) ),
inference(forward_demodulation,[],[f190,f50]) ).
fof(f202,plain,
! [X3,X0,X1,X4] :
( relation(X1)
| ~ in(X4,X0)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f107,f116]) ).
fof(f203,plain,
! [X3,X0,X1,X4] :
( in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),relation_rng_restriction(X0,X1))
| relation(X1)
| ~ in(X4,X0) ),
inference(forward_demodulation,[],[f202,f50]) ).
fof(f209,plain,
! [X2,X3,X0,X1] :
( in(unordered_pair(singleton(X1),unordered_pair(X0,X1)),relation_rng_restriction(X2,X3))
| relation(X3)
| ~ in(X0,X2) ),
inference(superposition,[],[f203,f50]) ).
fof(f216,plain,
! [X3,X0,X1,X4] :
( relation(X1)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f108,f116]) ).
fof(f217,plain,
! [X3,X0,X1,X4] :
( ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),X1)
| relation(X1)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(forward_demodulation,[],[f216,f50]) ).
fof(f218,plain,
! [X3,X0,X1,X4] :
( in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),relation_rng_restriction(X0,X1))
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),X1)
| relation(X1) ),
inference(forward_demodulation,[],[f217,f50]) ).
fof(f228,plain,
! [X2,X3,X0,X1] :
( in(unordered_pair(singleton(X1),unordered_pair(X0,X1)),relation_rng_restriction(X2,X3))
| ~ in(unordered_pair(singleton(X1),unordered_pair(X0,X1)),X3)
| relation(X3) ),
inference(superposition,[],[f218,f50]) ).
fof(f238,plain,
! [X3,X0,X1,X4] :
( relation(X1)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| in(X4,X0)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f106,f116]) ).
fof(f239,plain,
! [X3,X0,X1,X4] :
( in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),X1)
| relation(X1)
| in(X4,X0)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(forward_demodulation,[],[f238,f50]) ).
fof(f240,plain,
! [X3,X0,X1,X4] :
( ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),relation_rng_restriction(X0,X1))
| in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),X1)
| relation(X1)
| in(X4,X0) ),
inference(forward_demodulation,[],[f239,f50]) ).
fof(f318,plain,
! [X2,X0,X1] :
( relation(X0)
| ~ in(X1,X2)
| relation(relation_rng_restriction(X2,X0))
| in(X1,relation_rng(relation_rng_restriction(X2,X0))) ),
inference(resolution,[],[f209,f191]) ).
fof(f322,plain,
! [X2,X0,X1] :
( in(X1,relation_rng(relation_rng_restriction(X2,X0)))
| ~ in(X1,X2)
| relation(X0) ),
inference(forward_subsumption_resolution,[],[f318,f116]) ).
fof(f440,plain,
! [X2,X0,X1] :
( ~ in(unordered_pair(singleton(sK3(relation_rng_restriction(X0,X1),X2)),unordered_pair(X2,sK3(relation_rng_restriction(X0,X1),X2))),X1)
| relation(X1)
| relation(relation_rng_restriction(X0,X1))
| in(X2,relation_rng(relation_rng_restriction(X0,X1))) ),
inference(resolution,[],[f228,f191]) ).
fof(f444,plain,
! [X2,X0,X1] :
( ~ in(unordered_pair(singleton(sK3(relation_rng_restriction(X0,X1),X2)),unordered_pair(X2,sK3(relation_rng_restriction(X0,X1),X2))),X1)
| relation(X1)
| in(X2,relation_rng(relation_rng_restriction(X0,X1))) ),
inference(forward_subsumption_resolution,[],[f440,f116]) ).
fof(f919,plain,
( ~ in(sK10,sK11)
| relation(sK12)
| spl13_1 ),
inference(resolution,[],[f322,f144]) ).
fof(f941,plain,
( ~ in(sK10,sK11)
| spl13_1 ),
inference(forward_subsumption_resolution,[],[f919,f133]) ).
fof(f942,plain,
( ~ spl13_2
| spl13_1 ),
inference(avatar_split_clause,[],[f941,f143,f147]) ).
fof(f944,plain,
( ! [X0] :
( relation(sK12)
| in(unordered_pair(singleton(X0),unordered_pair(X0,sK10)),sK12) )
| ~ spl13_3 ),
inference(resolution,[],[f153,f183]) ).
fof(f945,plain,
( ! [X0] : in(unordered_pair(singleton(X0),unordered_pair(X0,sK10)),sK12)
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f944,f133]) ).
fof(f946,plain,
( ! [X0] : in(unordered_pair(singleton(X0),unordered_pair(sK10,X0)),sK12)
| ~ spl13_3 ),
inference(superposition,[],[f945,f50]) ).
fof(f1681,plain,
( ! [X0] :
( relation(sK12)
| in(sK10,relation_rng(relation_rng_restriction(X0,sK12))) )
| ~ spl13_3 ),
inference(resolution,[],[f444,f946]) ).
fof(f1708,plain,
( ! [X0] : in(sK10,relation_rng(relation_rng_restriction(X0,sK12)))
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f1681,f133]) ).
fof(f1776,plain,
( $false
| spl13_1
| ~ spl13_3 ),
inference(backward_subsumption_resolution,[],[f144,f1708]) ).
fof(f1780,plain,
( spl13_1
| ~ spl13_3 ),
inference(avatar_contradiction_clause,[],[f1776]) ).
fof(f1784,plain,
( ! [X0] :
( relation(relation_rng_restriction(sK11,sK12))
| in(unordered_pair(singleton(X0),unordered_pair(X0,sK10)),relation_rng_restriction(sK11,sK12)) )
| ~ spl13_1 ),
inference(resolution,[],[f145,f183]) ).
fof(f1787,definition,
( spl13_14
<=> ! [X0] : in(unordered_pair(singleton(X0),unordered_pair(X0,sK10)),relation_rng_restriction(sK11,sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_14])],[avatar_definition]) ).
fof(f1788,plain,
( ! [X0] : in(unordered_pair(singleton(X0),unordered_pair(X0,sK10)),relation_rng_restriction(sK11,sK12))
| ~ spl13_14 ),
inference(avatar_component_clause,[],[f1787]) ).
fof(f1790,definition,
( spl13_15
<=> relation(relation_rng_restriction(sK11,sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_15])],[avatar_definition]) ).
fof(f1792,plain,
( relation(relation_rng_restriction(sK11,sK12))
| ~ spl13_15 ),
inference(avatar_component_clause,[],[f1790]) ).
fof(f1793,plain,
( spl13_14
| spl13_15
| ~ spl13_1 ),
inference(avatar_split_clause,[],[f1784,f143,f1790,f1787]) ).
fof(f1795,plain,
( ! [X0] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,sK10)),sK12)
| relation(sK12)
| in(sK10,sK11) )
| ~ spl13_14 ),
inference(resolution,[],[f1788,f240]) ).
fof(f1801,plain,
( ! [X0] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,sK10)),sK12)
| in(sK10,sK11) )
| ~ spl13_14 ),
inference(forward_subsumption_resolution,[],[f1795,f133]) ).
fof(f1803,plain,
( ! [X0] : in(unordered_pair(singleton(X0),unordered_pair(X0,sK10)),sK12)
| spl13_2
| ~ spl13_14 ),
inference(forward_subsumption_resolution,[],[f1801,f148]) ).
fof(f1846,plain,
( ! [X0] : in(unordered_pair(singleton(X0),unordered_pair(sK10,X0)),sK12)
| spl13_2
| ~ spl13_14 ),
inference(superposition,[],[f1803,f50]) ).
fof(f1861,plain,
( relation(sK12)
| in(sK10,relation_rng(sK12))
| spl13_2
| ~ spl13_14 ),
inference(resolution,[],[f1846,f191]) ).
fof(f1867,plain,
( in(sK10,relation_rng(sK12))
| spl13_2
| ~ spl13_14 ),
inference(forward_subsumption_resolution,[],[f1861,f133]) ).
fof(f1868,plain,
( $false
| spl13_2
| spl13_3
| ~ spl13_14 ),
inference(forward_subsumption_resolution,[],[f1867,f152]) ).
fof(f1869,plain,
( spl13_2
| spl13_3
| ~ spl13_14 ),
inference(avatar_contradiction_clause,[],[f1868]) ).
fof(f1870,plain,
( relation(sK12)
| ~ spl13_15 ),
inference(resolution,[],[f1792,f116]) ).
fof(f1872,plain,
( $false
| ~ spl13_15 ),
inference(forward_subsumption_resolution,[],[f1870,f133]) ).
fof(f1873,plain,
~ spl13_15,
inference(avatar_contradiction_clause,[],[f1872]) ).
cnf(s1,plain,
( spl13_1
| spl13_2
| spl13_3 ),
inference(sat_conversion,[],[f154]) ).
cnf(s2,plain,
( ~ spl13_1
| ~ spl13_3 ),
inference(sat_conversion,[],[f155]) ).
cnf(s3,plain,
( ~ spl13_1
| ~ spl13_2 ),
inference(sat_conversion,[],[f156]) ).
cnf(s5,plain,
( spl13_1
| ~ spl13_2 ),
inference(sat_conversion,[],[f942]) ).
cnf(s25,plain,
( spl13_1
| ~ spl13_3 ),
inference(sat_conversion,[],[f1780]) ).
cnf(s26,plain,
( ~ spl13_1
| spl13_14
| spl13_15 ),
inference(sat_conversion,[],[f1793]) ).
cnf(s29,plain,
( spl13_2
| spl13_3
| ~ spl13_14 ),
inference(sat_conversion,[],[f1869]) ).
cnf(s30,plain,
~ spl13_15,
inference(sat_conversion,[],[f1873]) ).
cnf(s32,plain,
( ~ spl13_1
| spl13_14 ),
inference(rat,[],[s26,s30]) ).
cnf(s39,plain,
spl13_1,
inference(rat,[],[s1,s5,s25]) ).
cnf(s40,plain,
spl13_14,
inference(rat,[],[s32,s39]) ).
cnf(s41,plain,
~ spl13_2,
inference(rat,[],[s3,s39]) ).
cnf(s42,plain,
~ spl13_3,
inference(rat,[],[s2,s39]) ).
cnf(s44,plain,
$false,
inference(rat,[],[s29,s40,s42,s41]) ).
fof(f1874,plain,
$false,
inference(avatar_sat_refutation,[],[s44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU197+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 04:05:48 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.15/0.53 % (5717)Will run a generic schedule for satisfiability detection.
% 0.15/0.53 % (5727)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4076400182:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.53 % (5723)% WARNING: option uhcvi not known.
% 0.15/0.53 % (5722)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2679841009_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.53 % (5724)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4063863697:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.53 % (5725)dis+10_1_sil=32000:sp=arity:random_seed=1908717526:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.53 % (5726)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3257369042:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.53 % (5723)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=825637966:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.53 % (5728)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1149221084:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.53 % TRYING [1]
% 0.15/0.53 % TRYING [2]
% 0.15/0.53 % TRYING [3]
% 0.15/0.53 % (5727)Instruction limit reached!
% 0.15/0.53 % (5727)------------------------------
% 0.15/0.53 % (5727)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.53 % (5727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.53 % (5727)CaDiCaL version: 2.1.3
% 0.15/0.53 % (5727)Termination reason: Instruction limit
% 0.15/0.53 % (5727)Termination phase: Saturation
% 0.15/0.53 % (5727)Time elapsed: 0.041 s
% 0.15/0.53 % (5727)Peak memory usage: 12 MB
% 0.15/0.53 % (5727)Instructions burned: 134 (million)
% 0.15/0.53 % (5736)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=861673739:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.15/0.53 % TRYING [1]
% 0.15/0.53 % TRYING [2]
% 0.15/0.53 % TRYING [3]
% 0.15/0.53 % (5726)Instruction limit reached!
% 0.15/0.53 % (5726)------------------------------
% 0.15/0.53 % (5726)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.53 % (5726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.53 % (5726)CaDiCaL version: 2.1.3
% 0.15/0.53 % (5726)Termination reason: Instruction limit
% 0.15/0.53 % (5726)Termination phase: Saturation
% 0.15/0.53 % (5726)Time elapsed: 0.062 s
% 0.15/0.53 % (5726)Peak memory usage: 12 MB
% 0.15/0.53 % (5726)Instructions burned: 117 (million)
% 0.15/0.53 % (5725)Instruction limit reached!
% 0.15/0.53 % (5725)------------------------------
% 0.15/0.53 % (5725)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.53 % (5725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.53 % (5725)CaDiCaL version: 2.1.3
% 0.15/0.53 % (5725)Termination reason: Instruction limit
% 0.15/0.53 % (5725)Termination phase: Saturation
% 0.15/0.53 % (5725)Time elapsed: 0.064 s
% 0.15/0.53 % (5725)Peak memory usage: 12 MB
% 0.15/0.53 % (5725)Instructions burned: 103 (million)
% 0.15/0.53 % (5723) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-5717-5723"...
% 0.15/0.53 % (5723)...printing done.
% 0.15/0.53 % (5723)Refutation found. Thanks to Tanya!
% 0.15/0.53 % SZS status Theorem for theBenchmark
% 0.15/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.53 % (5723)------------------------------
% 0.15/0.53 % (5723)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.53 % (5723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.53 % (5723)CaDiCaL version: 2.1.3
% 0.15/0.53 % (5723)Termination reason: Refutation
% 0.15/0.53 % (5723)Time elapsed: 0.067 s
% 0.15/0.53 % (5723)Peak memory usage: 13 MB
% 0.15/0.53 % (5723)Instructions burned: 100 (million)
% 0.15/0.53 % (5717)Success in time 0.11 s
% 0.15/0.53 % Vampire exiting
%------------------------------------------------------------------------------