%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n012.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:12 PM UTC 2026
% Result : Theorem 0.08s 0.43s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 88 ( 12 unt; 7 def)
% Number of atoms : 216 ( 22 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 221 ( 93 ~; 109 |; 5 &)
% ( 11 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 107 ( 0 sgn 102 !; 5 ?)
% 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(f14,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f15,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(f17,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f22,plain,
! [X2,X3,X0,X1] :
( ordered_pair(sK1(X0,X1,X3),sK2(X0,X1,X3)) = X3
| ~ in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f23,plain,
! [X2,X3,X0,X1] :
( in(sK2(X0,X1,X3),X1)
| ~ in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f24,plain,
! [X2,X3,X0,X1] :
( in(sK1(X0,X1,X3),X0)
| ~ in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f25,plain,
! [X2,X3,X0,X1,X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0)
| in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X0,X1] :
( in(sK5(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X0,X1] :
( ~ in(sK5(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f29,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f5]) ).
fof(f34,plain,
( ~ subset(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))
| ~ subset(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f35,plain,
subset(sK8,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f36,plain,
! [X2,X3,X0,X1,X4,X5] :
( unordered_pair(unordered_pair(X4,X5),singleton(X4)) != X3
| ~ in(X5,X1)
| ~ in(X4,X0)
| in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f25,f29]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(sK1(X0,X1,X3),sK2(X0,X1,X3)),singleton(sK1(X0,X1,X3))) = X3
| ~ in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f22,f29]) ).
fof(f41,plain,
! [X2,X0,X1,X4,X5] :
( ~ in(X5,X1)
| ~ in(X4,X0)
| in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X2)
| cartesian_product2(X0,X1) != X2 ),
inference(equality_resolution,[],[f36]) ).
fof(f42,plain,
! [X0,X1,X4,X5] :
( ~ in(X5,X1)
| ~ in(X4,X0)
| in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f41]) ).
fof(f43,plain,
! [X3,X0,X1] :
( in(sK1(X0,X1,X3),X0)
| ~ in(X3,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f24]) ).
fof(f44,plain,
! [X3,X0,X1] :
( in(sK2(X0,X1,X3),X1)
| ~ in(X3,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f23]) ).
fof(f45,plain,
! [X3,X0,X1] :
( unordered_pair(unordered_pair(sK1(X0,X1,X3),sK2(X0,X1,X3)),singleton(sK1(X0,X1,X3))) = X3
| ~ in(X3,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f37]) ).
fof(f47,definition,
( spl11_1
<=> subset(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
fof(f49,plain,
( ~ subset(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10))
| spl11_1 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f51,definition,
( spl11_2
<=> subset(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)) ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
fof(f53,plain,
( ~ subset(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))
| spl11_2 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f54,plain,
( ~ spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f34,f51,f47]) ).
fof(f58,plain,
! [X0] :
( ~ in(X0,sK8)
| in(X0,sK9) ),
inference(resolution,[],[f26,f35]) ).
fof(f66,plain,
! [X0,X1] :
( in(sK1(sK8,X1,X0),sK9)
| ~ in(X0,cartesian_product2(sK8,X1)) ),
inference(resolution,[],[f43,f58]) ).
fof(f69,plain,
! [X0,X1] :
( in(sK2(X1,sK8,X0),sK9)
| ~ in(X0,cartesian_product2(X1,sK8)) ),
inference(resolution,[],[f44,f58]) ).
fof(f75,plain,
! [X0,X1,X4,X5] :
( in(unordered_pair(singleton(X4),unordered_pair(X4,X5)),cartesian_product2(X0,X1))
| ~ in(X5,X1)
| ~ in(X4,X0) ),
inference(forward_demodulation,[],[f42,f17]) ).
fof(f106,plain,
! [X3,X0,X1] :
( ~ in(X3,cartesian_product2(X0,X1))
| unordered_pair(singleton(sK1(X0,X1,X3)),unordered_pair(sK1(X0,X1,X3),sK2(X0,X1,X3))) = X3 ),
inference(forward_demodulation,[],[f45,f17]) ).
fof(f119,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X0,X1),X2)
| sK5(cartesian_product2(X0,X1),X2) = unordered_pair(singleton(sK1(X0,X1,sK5(cartesian_product2(X0,X1),X2))),unordered_pair(sK1(X0,X1,sK5(cartesian_product2(X0,X1),X2)),sK2(X0,X1,sK5(cartesian_product2(X0,X1),X2)))) ),
inference(resolution,[],[f106,f27]) ).
fof(f134,plain,
( sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)) = unordered_pair(singleton(sK1(sK8,sK10,sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)))),unordered_pair(sK1(sK8,sK10,sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10))),sK2(sK8,sK10,sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)))))
| spl11_1 ),
inference(resolution,[],[f119,f49]) ).
fof(f138,plain,
( ! [X0,X1] :
( ~ in(sK2(sK8,sK10,sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10))),X1)
| in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(X0,X1))
| ~ in(sK1(sK8,sK10,sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10))),X0) )
| spl11_1 ),
inference(superposition,[],[f75,f134]) ).
fof(f156,plain,
( ! [X0] :
( in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(X0,sK10))
| ~ in(sK1(sK8,sK10,sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10))),X0)
| ~ in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(sK8,sK10)) )
| spl11_1 ),
inference(resolution,[],[f138,f44]) ).
fof(f158,definition,
( spl11_3
<=> in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(sK8,sK10)) ),
introduced(definition,[new_symbols(definition,[spl11_3])],[avatar_definition]) ).
fof(f159,plain,
( in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(sK8,sK10))
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f160,plain,
( ~ in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(sK8,sK10))
| spl11_3 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f162,definition,
( spl11_4
<=> ! [X0] :
( in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(X0,sK10))
| ~ in(sK1(sK8,sK10,sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10))),X0) ) ),
introduced(definition,[new_symbols(definition,[spl11_4])],[avatar_definition]) ).
fof(f163,plain,
( ! [X0] :
( ~ in(sK1(sK8,sK10,sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10))),X0)
| in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(X0,sK10)) )
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f162]) ).
fof(f164,plain,
( ~ spl11_3
| spl11_4
| spl11_1 ),
inference(avatar_split_clause,[],[f156,f47,f162,f158]) ).
fof(f165,plain,
( subset(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10))
| spl11_3 ),
inference(resolution,[],[f160,f27]) ).
fof(f166,plain,
( $false
| spl11_1
| spl11_3 ),
inference(forward_subsumption_resolution,[],[f165,f49]) ).
fof(f167,plain,
( spl11_1
| spl11_3 ),
inference(avatar_contradiction_clause,[],[f166]) ).
fof(f169,plain,
( sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)) = unordered_pair(singleton(sK1(sK10,sK8,sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)))),unordered_pair(sK1(sK10,sK8,sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))),sK2(sK10,sK8,sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)))))
| spl11_2 ),
inference(resolution,[],[f53,f119]) ).
fof(f194,plain,
( ! [X0,X1] :
( ~ in(sK1(sK10,sK8,sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))),X0)
| ~ in(sK2(sK10,sK8,sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))),X1)
| in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(X0,X1)) )
| spl11_2 ),
inference(superposition,[],[f75,f169]) ).
fof(f212,plain,
( ! [X0] :
( ~ in(sK2(sK10,sK8,sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))),X0)
| in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,X0))
| ~ in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,sK8)) )
| spl11_2 ),
inference(resolution,[],[f194,f43]) ).
fof(f223,definition,
( spl11_7
<=> in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,sK8)) ),
introduced(definition,[new_symbols(definition,[spl11_7])],[avatar_definition]) ).
fof(f225,plain,
( ~ in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,sK8))
| spl11_7 ),
inference(avatar_component_clause,[],[f223]) ).
fof(f227,definition,
( spl11_8
<=> ! [X0] :
( ~ in(sK2(sK10,sK8,sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))),X0)
| in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,X0)) ) ),
introduced(definition,[new_symbols(definition,[spl11_8])],[avatar_definition]) ).
fof(f228,plain,
( ! [X0] :
( ~ in(sK2(sK10,sK8,sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))),X0)
| in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,X0)) )
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f227]) ).
fof(f229,plain,
( ~ spl11_7
| spl11_8
| spl11_2 ),
inference(avatar_split_clause,[],[f212,f51,f227,f223]) ).
fof(f231,plain,
( in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,sK9))
| ~ in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,sK8))
| ~ spl11_8 ),
inference(resolution,[],[f228,f69]) ).
fof(f243,definition,
( spl11_11
<=> in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,sK9)) ),
introduced(definition,[new_symbols(definition,[spl11_11])],[avatar_definition]) ).
fof(f245,plain,
( in(sK5(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9)),cartesian_product2(sK10,sK9))
| ~ spl11_11 ),
inference(avatar_component_clause,[],[f243]) ).
fof(f246,plain,
( ~ spl11_7
| spl11_11
| ~ spl11_8 ),
inference(avatar_split_clause,[],[f231,f227,f243,f223]) ).
fof(f248,plain,
( subset(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))
| ~ spl11_11 ),
inference(resolution,[],[f245,f28]) ).
fof(f250,plain,
( $false
| spl11_2
| ~ spl11_11 ),
inference(forward_subsumption_resolution,[],[f248,f53]) ).
fof(f251,plain,
( spl11_2
| ~ spl11_11 ),
inference(avatar_contradiction_clause,[],[f250]) ).
fof(f255,plain,
( subset(cartesian_product2(sK10,sK8),cartesian_product2(sK10,sK9))
| spl11_7 ),
inference(resolution,[],[f225,f27]) ).
fof(f256,plain,
( $false
| spl11_2
| spl11_7 ),
inference(forward_subsumption_resolution,[],[f255,f53]) ).
fof(f257,plain,
( spl11_2
| spl11_7 ),
inference(avatar_contradiction_clause,[],[f256]) ).
fof(f282,plain,
( in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(sK9,sK10))
| ~ in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(sK8,sK10))
| ~ spl11_4 ),
inference(resolution,[],[f163,f66]) ).
fof(f293,plain,
( in(sK5(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10)),cartesian_product2(sK9,sK10))
| ~ spl11_3
| ~ spl11_4 ),
inference(forward_subsumption_resolution,[],[f282,f159]) ).
fof(f295,plain,
( subset(cartesian_product2(sK8,sK10),cartesian_product2(sK9,sK10))
| ~ spl11_3
| ~ spl11_4 ),
inference(resolution,[],[f293,f28]) ).
fof(f297,plain,
( $false
| spl11_1
| ~ spl11_3
| ~ spl11_4 ),
inference(forward_subsumption_resolution,[],[f295,f49]) ).
fof(f298,plain,
( spl11_1
| ~ spl11_3
| ~ spl11_4 ),
inference(avatar_contradiction_clause,[],[f297]) ).
cnf(s1,plain,
( ~ spl11_1
| ~ spl11_2 ),
inference(sat_conversion,[],[f54]) ).
cnf(s2,plain,
( spl11_1
| ~ spl11_3
| spl11_4 ),
inference(sat_conversion,[],[f164]) ).
cnf(s3,plain,
( spl11_1
| spl11_3 ),
inference(sat_conversion,[],[f167]) ).
cnf(s5,plain,
( spl11_2
| ~ spl11_7
| spl11_8 ),
inference(sat_conversion,[],[f229]) ).
cnf(s7,plain,
( ~ spl11_7
| ~ spl11_8
| spl11_11 ),
inference(sat_conversion,[],[f246]) ).
cnf(s8,plain,
( spl11_2
| ~ spl11_11 ),
inference(sat_conversion,[],[f251]) ).
cnf(s9,plain,
( spl11_2
| spl11_7 ),
inference(sat_conversion,[],[f257]) ).
cnf(s11,plain,
( spl11_1
| ~ spl11_3
| ~ spl11_4 ),
inference(sat_conversion,[],[f298]) ).
cnf(s12,plain,
( ~ spl11_3
| spl11_1 ),
inference(rat,[],[s2,s11]) ).
cnf(s13,plain,
spl11_1,
inference(rat,[],[s12,s3]) ).
cnf(s14,plain,
~ spl11_2,
inference(rat,[],[s1,s13]) ).
cnf(s15,plain,
spl11_7,
inference(rat,[],[s9,s14]) ).
cnf(s16,plain,
~ spl11_11,
inference(rat,[],[s8,s14]) ).
cnf(s17,plain,
~ spl11_8,
inference(rat,[],[s7,s16,s15]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s5,s14,s17,s15]) ).
fof(f299,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU166+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/0.32 % Computer : n012.cluster.edu
% 0.05/0.32 % Model : x86_64 x86_64
% 0.05/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.32 % Memory : 8046.5625MB
% 0.05/0.32 % OS : Linux 6.8.0-71-generic
% 0.05/0.32 % CPULimit : 300
% 0.05/0.32 % WCLimit : 300
% 0.05/0.32 % DateTime : Mon Sep 28 03:50:50 UTC 2026
% 0.05/0.32 % CPUTime :
% 0.05/0.32 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.34 Running first-order model finding
% 0.08/0.34 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.43 % (2998926)Will run a generic schedule for satisfiability detection.
% 0.08/0.43 % (2998932)% WARNING: option uhcvi not known.
% 0.08/0.43 % (2998931)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3611932367_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.43 % (2998937)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1096741766:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.43 % (2998932)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2839065108:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.43 % (2998933)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=484413260:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.43 % (2998934)dis+10_1_sil=32000:sp=arity:random_seed=2112053117:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.43 % (2998935)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=515021899:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.43 % (2998936)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1594538484:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.43 % TRYING [1]
% 0.08/0.43 % TRYING [2]
% 0.08/0.43 % TRYING [3]
% 0.08/0.43 % (2998934)Instruction limit reached!
% 0.08/0.43 % (2998934)------------------------------
% 0.08/0.43 % (2998934)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.43 % (2998934)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.43 % (2998934)CaDiCaL version: 2.1.3
% 0.08/0.43 % (2998934)Termination reason: Instruction limit
% 0.08/0.43 % (2998934)Termination phase: Saturation
% 0.08/0.43 % (2998934)Time elapsed: 0.032 s
% 0.08/0.43 % (2998934)Peak memory usage: 12 MB
% 0.08/0.43 % (2998934)Instructions burned: 104 (million)
% 0.08/0.43 % (2998935)Instruction limit reached!
% 0.08/0.43 % (2998935)------------------------------
% 0.08/0.43 % (2998935)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.43 % (2998935)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.43 % (2998935)CaDiCaL version: 2.1.3
% 0.08/0.43 % (2998935)Termination reason: Instruction limit
% 0.08/0.43 % (2998935)Termination phase: Saturation
% 0.08/0.43 % (2998935)Time elapsed: 0.037 s
% 0.08/0.43 % (2998935)Peak memory usage: 12 MB
% 0.08/0.43 % (2998935)Instructions burned: 118 (million)
% 0.08/0.43 % (2998936)Instruction limit reached!
% 0.08/0.43 % (2998936)------------------------------
% 0.08/0.43 % (2998936)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.43 % (2998936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.43 % (2998936)CaDiCaL version: 2.1.3
% 0.08/0.43 % (2998936)Termination reason: Instruction limit
% 0.08/0.43 % (2998936)Termination phase: Saturation
% 0.08/0.43 % (2998936)Time elapsed: 0.041 s
% 0.08/0.43 % (2998936)Peak memory usage: 12 MB
% 0.08/0.43 % (2998936)Instructions burned: 131 (million)
% 0.08/0.43 % (2998945)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=491711736:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.08/0.43 % TRYING [1]
% 0.08/0.43 % TRYING [2]
% 0.08/0.43 % TRYING [3]
% 0.08/0.43 % (2998946)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1391417727:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.43 % TRYING [4]
% 0.08/0.43 % (2998937)Instruction limit reached!
% 0.08/0.43 % (2998937)------------------------------
% 0.08/0.43 % (2998937)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.43 % (2998937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.43 % (2998937)CaDiCaL version: 2.1.3
% 0.08/0.43 % (2998937)Termination reason: Instruction limit
% 0.08/0.43 % (2998937)Termination phase: Saturation
% 0.08/0.43 % (2998937)Time elapsed: 0.052 s
% 0.08/0.43 % (2998937)Peak memory usage: 13 MB
% 0.08/0.43 % (2998937)Instructions burned: 164 (million)
% 0.08/0.43 % (2998947)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1767913588:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.08/0.43 % (2998947) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2998926-2998947"...
% 0.08/0.43 % (2998950)ott-21_1_sil=16000:fs=off:random_seed=4292800578:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.08/0.43 % (2998947)...printing done.
% 0.08/0.43 % (2998947)Refutation found. Thanks to Tanya!
% 0.08/0.43 % SZS status Theorem for theBenchmark
% 0.08/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.43 % (2998947)------------------------------
% 0.08/0.43 % (2998947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.43 % (2998947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.43 % (2998947)CaDiCaL version: 2.1.3
% 0.08/0.43 % (2998947)Termination reason: Refutation
% 0.08/0.43 % (2998947)Time elapsed: 0.009 s
% 0.08/0.43 % (2998947)Peak memory usage: 13 MB
% 0.08/0.43 % (2998947)Instructions burned: 25 (million)
% 0.08/0.43 % (2998926)Success in time 0.086 s
% 0.08/0.43 % Vampire exiting
%------------------------------------------------------------------------------