%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU166+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:47:32 PM UTC 2026
% Result : Theorem 2.80s 1.33s
% Output : Refutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 9
% Syntax : Number of formulae : 84 ( 10 unt; 4 def)
% Number of atoms : 266 ( 40 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 297 ( 115 ~; 138 |; 33 &)
% ( 8 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 150 ( 0 sgn 133 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,axiom,
! [X0,X1,X2] :
( X2 = cartesian_product2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4,X5] :
( in(X4,X0)
& in(X5,X1)
& X3 = ordered_pair(X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f5,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(f10,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
& subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t118_zfmisc_1) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
& subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f13,plain,
? [X0,X1,X2] :
( ( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
| ~ subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) )
& subset(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f16,plain,
( ( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))
| ~ subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)) )
& subset(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f13]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( X2 = cartesian_product2(X0,X1)
| ? [X3] :
( ( ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != X3 )
| ~ in(X3,X2) )
& ( ? [X4,X5] :
( in(X4,X0)
& in(X5,X1)
& X3 = ordered_pair(X4,X5) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != X3 ) )
& ( ? [X4,X5] :
( in(X4,X0)
& in(X5,X1)
& X3 = ordered_pair(X4,X5) )
| ~ in(X3,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( X2 = cartesian_product2(X0,X1)
| ? [X3] :
( ( ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != X3 )
| ~ in(X3,X2) )
& ( ? [X6,X7] :
( in(X6,X0)
& in(X7,X1)
& ordered_pair(X6,X7) = X3 )
| in(X3,X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ~ in(X9,X0)
| ~ in(X10,X1)
| ordered_pair(X9,X10) != X8 ) )
& ( ? [X11,X12] :
( in(X11,X0)
& in(X12,X1)
& ordered_pair(X11,X12) = X8 )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(rectify,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( X2 = cartesian_product2(X0,X1)
| ( ( ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != sK3(X0,X1,X2) )
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X0)
& in(sK5(X0,X1,X2),X1)
& sK3(X0,X1,X2) = ordered_pair(sK4(X0,X1,X2),sK5(X0,X1,X2)) )
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ~ in(X9,X0)
| ~ in(X10,X1)
| ordered_pair(X9,X10) != X8 ) )
& ( ( in(sK6(X0,X1,X8),X0)
& in(sK7(X0,X1,X8),X1)
& ordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)) = X8 )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7]),skolemize(X3,sK3(X0,X1,X2)),skolemize(X6,sK4(X0,X1,X2)),skolemize(X7,sK5(X0,X1,X2)),skolemize(X11,sK6(X0,X1,X8)),skolemize(X12,sK7(X0,X1,X8))],[f18]) ).
fof(f20,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,[],[f14]) ).
fof(f21,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,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0,X1))],[f21]) ).
fof(f25,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))
| ~ subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
! [X2,X0,X1,X8] :
( ordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)) = X8
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
! [X2,X0,X1,X8] :
( in(sK7(X0,X1,X8),X1)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
! [X2,X0,X1,X8] :
( in(sK6(X0,X1,X8),X0)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
! [X2,X10,X0,X1,X8,X9] :
( in(X8,X2)
| ~ in(X9,X0)
| ~ in(X10,X1)
| ordered_pair(X9,X10) != X8
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
! [X0,X1] :
( in(sK8(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X0,X1] :
( ~ in(sK8(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f5]) ).
fof(f40,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f47,plain,
! [X2,X10,X0,X1,X8,X9] :
( in(X8,X2)
| ~ in(X9,X0)
| ~ in(X10,X1)
| unordered_pair(unordered_pair(X9,X10),singleton(X9)) != X8
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f30,f39]) ).
fof(f48,plain,
! [X2,X0,X1,X8] :
( unordered_pair(unordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)),singleton(sK6(X0,X1,X8))) = X8
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f27,f39]) ).
fof(f50,plain,
! [X2,X10,X0,X1,X9] :
( in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),X2)
| ~ in(X9,X0)
| ~ in(X10,X1)
| cartesian_product2(X0,X1) != X2 ),
inference(equality_resolution,[],[f47]) ).
fof(f51,plain,
! [X10,X0,X1,X9] :
( in(unordered_pair(unordered_pair(X9,X10),singleton(X9)),cartesian_product2(X0,X1))
| ~ in(X9,X0)
| ~ in(X10,X1) ),
inference(equality_resolution,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X8] :
( in(sK6(X0,X1,X8),X0)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f29]) ).
fof(f53,plain,
! [X0,X1,X8] :
( in(sK7(X0,X1,X8),X1)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f28]) ).
fof(f54,plain,
! [X0,X1,X8] :
( unordered_pair(unordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8)),singleton(sK6(X0,X1,X8))) = X8
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f48]) ).
fof(f55,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| unordered_pair(singleton(sK6(X0,X1,X8)),unordered_pair(sK6(X0,X1,X8),sK7(X0,X1,X8))) = X8 ),
inference(forward_demodulation,[],[f54,f40]) ).
fof(f56,plain,
! [X10,X0,X1,X9] :
( in(unordered_pair(singleton(X9),unordered_pair(X9,X10)),cartesian_product2(X0,X1))
| ~ in(X9,X0)
| ~ in(X10,X1) ),
inference(forward_demodulation,[],[f51,f40]) ).
fof(f60,definition,
( spl11_1
<=> subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
fof(f62,plain,
( ~ subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))
| spl11_1 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f64,definition,
( spl11_2
<=> subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)) ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
fof(f66,plain,
( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))
| spl11_2 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f67,plain,
( ~ spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f26,f64,f60]) ).
fof(f81,plain,
! [X0] :
( ~ in(X0,sK0)
| in(X0,sK1) ),
inference(resolution,[],[f36,f25]) ).
fof(f85,plain,
! [X0,X1] :
( in(sK6(sK0,X1,X0),sK1)
| ~ in(X0,cartesian_product2(sK0,X1)) ),
inference(resolution,[],[f52,f81]) ).
fof(f90,plain,
! [X0,X1] :
( in(sK7(X1,sK0,X0),sK1)
| ~ in(X0,cartesian_product2(X1,sK0)) ),
inference(resolution,[],[f53,f81]) ).
fof(f103,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X0,X1),X2)
| sK8(cartesian_product2(X0,X1),X2) = unordered_pair(singleton(sK6(X0,X1,sK8(cartesian_product2(X0,X1),X2))),unordered_pair(sK6(X0,X1,sK8(cartesian_product2(X0,X1),X2)),sK7(X0,X1,sK8(cartesian_product2(X0,X1),X2)))) ),
inference(resolution,[],[f55,f37]) ).
fof(f132,plain,
( sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)) = unordered_pair(singleton(sK6(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)))),unordered_pair(sK6(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),sK7(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)))))
| spl11_1 ),
inference(resolution,[],[f103,f62]) ).
fof(f136,plain,
( ! [X0,X1] :
( ~ in(sK7(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),X1)
| ~ in(sK6(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),X0)
| in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(X0,X1)) )
| spl11_1 ),
inference(superposition,[],[f56,f132]) ).
fof(f206,definition,
( spl11_3
<=> in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK0)) ),
introduced(definition,[new_symbols(definition,[spl11_3])],[avatar_definition]) ).
fof(f207,plain,
( in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK0))
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f208,plain,
( ~ in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK0))
| spl11_3 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f223,plain,
( subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))
| spl11_3 ),
inference(resolution,[],[f208,f37]) ).
fof(f224,plain,
( $false
| spl11_1
| spl11_3 ),
inference(forward_subsumption_resolution,[],[f223,f62]) ).
fof(f225,plain,
( spl11_1
| spl11_3 ),
inference(avatar_contradiction_clause,[],[f224]) ).
fof(f274,plain,
( ! [X0] :
( ~ in(sK6(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),X0)
| in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(X0,sK1))
| ~ in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK0)) )
| spl11_1 ),
inference(resolution,[],[f136,f90]) ).
fof(f275,plain,
( ! [X0] :
( ~ in(sK6(sK2,sK0,sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))),X0)
| in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(X0,sK1)) )
| spl11_1
| ~ spl11_3 ),
inference(forward_subsumption_resolution,[],[f274,f207]) ).
fof(f294,plain,
( in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK1))
| ~ in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK0))
| spl11_1
| ~ spl11_3 ),
inference(resolution,[],[f275,f52]) ).
fof(f295,plain,
( in(sK8(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1)),cartesian_product2(sK2,sK1))
| spl11_1
| ~ spl11_3 ),
inference(forward_subsumption_resolution,[],[f294,f207]) ).
fof(f298,plain,
( subset(cartesian_product2(sK2,sK0),cartesian_product2(sK2,sK1))
| spl11_1
| ~ spl11_3 ),
inference(resolution,[],[f295,f38]) ).
fof(f301,plain,
( $false
| spl11_1
| ~ spl11_3 ),
inference(forward_subsumption_resolution,[],[f298,f62]) ).
fof(f302,plain,
( spl11_1
| ~ spl11_3 ),
inference(avatar_contradiction_clause,[],[f301]) ).
fof(f304,plain,
( sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)) = unordered_pair(singleton(sK6(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)))),unordered_pair(sK6(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),sK7(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)))))
| spl11_2 ),
inference(resolution,[],[f66,f103]) ).
fof(f413,plain,
( ! [X0,X1] :
( ~ in(sK7(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),X1)
| ~ in(sK6(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),X0)
| in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(X0,X1)) )
| spl11_2 ),
inference(superposition,[],[f56,f304]) ).
fof(f1032,definition,
( spl11_18
<=> in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK0,sK2)) ),
introduced(definition,[new_symbols(definition,[spl11_18])],[avatar_definition]) ).
fof(f1033,plain,
( in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK0,sK2))
| ~ spl11_18 ),
inference(avatar_component_clause,[],[f1032]) ).
fof(f1034,plain,
( ~ in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK0,sK2))
| spl11_18 ),
inference(avatar_component_clause,[],[f1032]) ).
fof(f1079,plain,
( subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))
| spl11_18 ),
inference(resolution,[],[f1034,f37]) ).
fof(f1080,plain,
( $false
| spl11_2
| spl11_18 ),
inference(forward_subsumption_resolution,[],[f1079,f66]) ).
fof(f1081,plain,
( spl11_2
| spl11_18 ),
inference(avatar_contradiction_clause,[],[f1080]) ).
fof(f1166,plain,
( ! [X0] :
( ~ in(sK6(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),X0)
| in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(X0,sK2))
| ~ in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK0,sK2)) )
| spl11_2 ),
inference(resolution,[],[f413,f53]) ).
fof(f1167,plain,
( ! [X0] :
( ~ in(sK6(sK0,sK2,sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))),X0)
| in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(X0,sK2)) )
| spl11_2
| ~ spl11_18 ),
inference(forward_subsumption_resolution,[],[f1166,f1033]) ).
fof(f1220,plain,
( in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK1,sK2))
| ~ in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK0,sK2))
| spl11_2
| ~ spl11_18 ),
inference(resolution,[],[f1167,f85]) ).
fof(f1221,plain,
( in(sK8(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2)),cartesian_product2(sK1,sK2))
| spl11_2
| ~ spl11_18 ),
inference(forward_subsumption_resolution,[],[f1220,f1033]) ).
fof(f1250,plain,
( subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK2))
| spl11_2
| ~ spl11_18 ),
inference(resolution,[],[f1221,f38]) ).
fof(f1261,plain,
( $false
| spl11_2
| ~ spl11_18 ),
inference(forward_subsumption_resolution,[],[f1250,f66]) ).
fof(f1262,plain,
( spl11_2
| ~ spl11_18 ),
inference(avatar_contradiction_clause,[],[f1261]) ).
cnf(s1,plain,
( ~ spl11_1
| ~ spl11_2 ),
inference(sat_conversion,[],[f67]) ).
cnf(s4,plain,
( spl11_1
| spl11_3 ),
inference(sat_conversion,[],[f225]) ).
cnf(s5,plain,
( spl11_1
| ~ spl11_3 ),
inference(sat_conversion,[],[f302]) ).
cnf(s13,plain,
( spl11_2
| spl11_18 ),
inference(sat_conversion,[],[f1081]) ).
cnf(s14,plain,
( spl11_2
| ~ spl11_18 ),
inference(sat_conversion,[],[f1262]) ).
cnf(s15,plain,
spl11_1,
inference(rat,[],[s4,s5]) ).
cnf(s16,plain,
~ spl11_2,
inference(rat,[],[s1,s15]) ).
cnf(s17,plain,
~ spl11_18,
inference(rat,[],[s14,s16]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s13,s17,s16]) ).
fof(f1263,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU166+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n026.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 03:53:57 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 2.80/1.33 % (3444316)Detected formulas, will run a generic FOF schedule.
% 2.80/1.33 % (3444327)dis-21_1_sil=8000:lcm=predicate:random_seed=2757603258: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.80/1.33 % (3444323)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=616449577:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.80/1.33 % (3444324)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1316337799:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.80/1.33 % (3444322)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=3670471059:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.80/1.33 % (3444321)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=1345521677:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.80/1.33 % (3444325)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3908690594:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.80/1.33 % (3444326)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=221572240:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.80/1.33 % (3444327)Instruction limit reached!
% 2.80/1.33 % (3444327)------------------------------
% 2.80/1.33 % (3444327)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.33 % (3444327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.33 % (3444327)CaDiCaL version: 2.1.3
% 2.80/1.33 % (3444327)Termination reason: Instruction limit
% 2.80/1.33 % (3444327)Termination phase: Saturation
% 2.80/1.33 % (3444327)Time elapsed: 0.041 s
% 2.80/1.33 % (3444327)Peak memory usage: 89 MB
% 2.80/1.33 % (3444327)Instructions burned: 129 (million)
% 2.80/1.33 % (3444324)Refutation not found, incomplete strategy
% 2.80/1.33 % (3444324)------------------------------
% 2.80/1.33 % (3444324)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.33 % (3444324)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.33 % (3444324)CaDiCaL version: 2.1.3
% 2.80/1.33 % (3444324)Termination reason: Refutation not found, incomplete strategy
% 2.80/1.33 % (3444324)Time elapsed: 0.002 s
% 2.80/1.33 % (3444324)Peak memory usage: 88 MB
% 2.80/1.33 % (3444324)Instructions burned: 1 (million)
% 2.80/1.33 % (3444325)Instruction limit reached!
% 2.80/1.33 % (3444325)------------------------------
% 2.80/1.33 % (3444325)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.33 % (3444325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.33 % (3444325)CaDiCaL version: 2.1.3
% 2.80/1.33 % (3444325)Termination reason: Instruction limit
% 2.80/1.33 % (3444325)Termination phase: Saturation
% 2.80/1.33 % (3444325)Time elapsed: 0.065 s
% 2.80/1.33 % (3444325)Peak memory usage: 88 MB
% 2.80/1.33 % (3444325)Instructions burned: 121 (million)
% 2.80/1.33 % (3444335)lrs+10_1_sil=8000:sp=occurrence:random_seed=3621272884:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.80/1.33 % (3444326)Instruction limit reached!
% 2.80/1.33 % (3444326)------------------------------
% 2.80/1.33 % (3444326)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.33 % (3444326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.33 % (3444326)CaDiCaL version: 2.1.3
% 2.80/1.33 % (3444326)Termination reason: Instruction limit
% 2.80/1.33 % (3444326)Termination phase: Saturation
% 2.80/1.33 % (3444326)Time elapsed: 0.092 s
% 2.80/1.33 % (3444326)Peak memory usage: 89 MB
% 2.80/1.33 % (3444326)Instructions burned: 139 (million)
% 2.80/1.33 % (3444335)First to succeed.
% 2.80/1.33 % (3444335)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3444316"
% 2.80/1.33 % (3444336)lrs+10_1_sil=32000:urr=on:br=off:random_seed=552446296:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.80/1.33 % (3444336)Also succeeded, but the first one will report.
% 2.80/1.33 % (3444338)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2052013029:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.80/1.33 % (3444324)------------------------------
% 2.80/1.33 % (3444324)------------------------------
% 2.80/1.33 % (3444338)Also succeeded, but the first one will report.
% 2.80/1.33 % (3444335)Refutation found. Thanks to Tanya!
% 2.80/1.33 % SZS status Theorem for theBenchmark
% 2.80/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 3.91/1.51 % (3444335)------------------------------
% 3.91/1.51 % (3444335)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.91/1.51 % (3444335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.91/1.51 % (3444335)CaDiCaL version: 2.1.3
% 3.91/1.51 % (3444335)Termination reason: Refutation
% 3.91/1.51 % (3444335)Time elapsed: 0.062 s
% 3.91/1.51 % (3444335)Peak memory usage: 92 MB
% 3.91/1.51 % (3444335)Instructions burned: 201 (million)
% 3.91/1.51 % (3444335)------------------------------
% 3.91/1.51 % (3444335)------------------------------
% 3.91/1.51 % (3444316)Success in time 0.464 s
% 3.91/1.51 % Vampire exiting
%------------------------------------------------------------------------------