%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET955+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:45:04 PM UTC 2026
% Result : Theorem 13.34s 2.37s
% Output : Refutation 13.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 59 ( 10 unt; 2 def)
% Number of atoms : 138 ( 45 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 124 ( 45 ~; 64 |; 3 &)
% ( 8 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 85 ( 0 sgn 78 !; 7 ?)
% 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] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f8,conjecture,
! [X0,X1,X2,X3] :
( ! [X4,X5] :
( in(ordered_pair(X4,X5),cartesian_product2(X0,X1))
<=> in(ordered_pair(X4,X5),cartesian_product2(X2,X3)) )
=> cartesian_product2(X0,X1) = cartesian_product2(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t108_zfmisc_1) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ! [X4,X5] :
( in(ordered_pair(X4,X5),cartesian_product2(X0,X1))
<=> in(ordered_pair(X4,X5),cartesian_product2(X2,X3)) )
=> cartesian_product2(X0,X1) = cartesian_product2(X2,X3) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(f12,plain,
? [X0,X1,X2,X3] :
( cartesian_product2(X0,X1) != cartesian_product2(X2,X3)
& ! [X4,X5] :
( in(ordered_pair(X4,X5),cartesian_product2(X0,X1))
<=> in(ordered_pair(X4,X5),cartesian_product2(X2,X3)) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f13,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f15,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f20,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(f24,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f28,plain,
! [X4,X5] :
( ~ in(ordered_pair(X4,X5),cartesian_product2(sK9,sK10))
| in(ordered_pair(X4,X5),cartesian_product2(sK7,sK8)) ),
inference(cnf_transformation,[],[f12]) ).
fof(f29,plain,
! [X4,X5] :
( in(ordered_pair(X4,X5),cartesian_product2(sK9,sK10))
| ~ in(ordered_pair(X4,X5),cartesian_product2(sK7,sK8)) ),
inference(cnf_transformation,[],[f12]) ).
fof(f30,plain,
cartesian_product2(sK9,sK10) != cartesian_product2(sK7,sK8),
inference(cnf_transformation,[],[f12]) ).
fof(f31,plain,
! [X0,X1] :
( in(sK11(X0,X1),X1)
| in(sK11(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f13]) ).
fof(f32,plain,
! [X0,X1] :
( ~ in(sK11(X0,X1),X1)
| ~ in(sK11(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f13]) ).
fof(f34,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,[],[f20,f24]) ).
fof(f38,plain,
! [X4,X5] :
( in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),cartesian_product2(sK9,sK10))
| ~ in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),cartesian_product2(sK7,sK8)) ),
inference(definition_unfolding,[],[f29,f24,f24]) ).
fof(f39,plain,
! [X4,X5] :
( in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),cartesian_product2(sK7,sK8))
| ~ in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),cartesian_product2(sK9,sK10)) ),
inference(definition_unfolding,[],[f28,f24,f24]) ).
fof(f44,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,[],[f34]) ).
fof(f55,plain,
! [X0,X1] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),cartesian_product2(sK7,sK8))
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),cartesian_product2(sK9,sK10)) ),
inference(superposition,[],[f39,f15]) ).
fof(f56,plain,
! [X0,X1] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),cartesian_product2(sK9,sK10))
| ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),cartesian_product2(sK7,sK8)) ),
inference(superposition,[],[f38,f15]) ).
fof(f116,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,[],[f44,f15]) ).
fof(f132,plain,
! [X2,X0,X1] :
( in(sK11(X2,cartesian_product2(X0,X1)),X2)
| sK11(X2,cartesian_product2(X0,X1)) = unordered_pair(singleton(sK1(X0,X1,sK11(X2,cartesian_product2(X0,X1)))),unordered_pair(sK1(X0,X1,sK11(X2,cartesian_product2(X0,X1))),sK2(X0,X1,sK11(X2,cartesian_product2(X0,X1)))))
| cartesian_product2(X0,X1) = X2 ),
inference(resolution,[],[f116,f31]) ).
fof(f312,plain,
! [X2,X3,X0,X1] :
( sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) = unordered_pair(singleton(sK1(X2,X3,sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)))),unordered_pair(sK1(X2,X3,sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3))),sK2(X2,X3,sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)))))
| sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) = unordered_pair(singleton(sK1(X0,X1,sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)))),unordered_pair(sK1(X0,X1,sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3))),sK2(X0,X1,sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)))))
| cartesian_product2(X0,X1) = cartesian_product2(X2,X3) ),
inference(resolution,[],[f132,f116]) ).
fof(f6088,plain,
! [X2,X3,X0,X1] :
( in(sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)),cartesian_product2(sK7,sK8))
| ~ in(sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)),cartesian_product2(sK9,sK10))
| sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)) = unordered_pair(singleton(sK1(X2,X3,sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)))),unordered_pair(sK1(X2,X3,sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3))),sK2(X2,X3,sK11(cartesian_product2(X0,X1),cartesian_product2(X2,X3)))))
| cartesian_product2(X0,X1) = cartesian_product2(X2,X3) ),
inference(superposition,[],[f55,f312]) ).
fof(f8180,plain,
! [X0,X1] :
( ~ in(sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)),cartesian_product2(sK9,sK10))
| sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)) = unordered_pair(singleton(sK1(sK7,sK8,sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)))),unordered_pair(sK1(sK7,sK8,sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8))),sK2(sK7,sK8,sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)))))
| cartesian_product2(X0,X1) = cartesian_product2(sK7,sK8)
| ~ in(sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)),cartesian_product2(X0,X1))
| cartesian_product2(X0,X1) = cartesian_product2(sK7,sK8) ),
inference(resolution,[],[f6088,f32]) ).
fof(f8242,plain,
! [X0,X1] :
( ~ in(sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)),cartesian_product2(sK9,sK10))
| sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)) = unordered_pair(singleton(sK1(sK7,sK8,sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)))),unordered_pair(sK1(sK7,sK8,sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8))),sK2(sK7,sK8,sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)))))
| cartesian_product2(X0,X1) = cartesian_product2(sK7,sK8)
| ~ in(sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)),cartesian_product2(X0,X1)) ),
inference(duplicate_literal_removal,[],[f8180]) ).
fof(f8245,plain,
! [X0,X1] :
( ~ in(sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)),cartesian_product2(sK9,sK10))
| sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)) = unordered_pair(singleton(sK1(sK7,sK8,sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)))),unordered_pair(sK1(sK7,sK8,sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8))),sK2(sK7,sK8,sK11(cartesian_product2(X0,X1),cartesian_product2(sK7,sK8)))))
| cartesian_product2(X0,X1) = cartesian_product2(sK7,sK8) ),
inference(forward_subsumption_resolution,[],[f8242,f132]) ).
fof(f8311,plain,
( sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)) = unordered_pair(singleton(sK1(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)))),unordered_pair(sK1(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8))),sK2(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)))))
| cartesian_product2(sK9,sK10) = cartesian_product2(sK7,sK8)
| sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)) = unordered_pair(singleton(sK1(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)))),unordered_pair(sK1(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8))),sK2(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)))))
| cartesian_product2(sK9,sK10) = cartesian_product2(sK7,sK8) ),
inference(resolution,[],[f8245,f132]) ).
fof(f8318,plain,
( sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)) = unordered_pair(singleton(sK1(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)))),unordered_pair(sK1(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8))),sK2(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)))))
| cartesian_product2(sK9,sK10) = cartesian_product2(sK7,sK8) ),
inference(duplicate_literal_removal,[],[f8311]) ).
fof(f8323,plain,
sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)) = unordered_pair(singleton(sK1(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)))),unordered_pair(sK1(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8))),sK2(sK7,sK8,sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8))))),
inference(forward_subsumption_resolution,[],[f8318,f30]) ).
fof(f8325,plain,
( in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK7,sK8))
| ~ in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK9,sK10)) ),
inference(superposition,[],[f55,f8323]) ).
fof(f8326,plain,
( in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK9,sK10))
| ~ in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK7,sK8)) ),
inference(superposition,[],[f56,f8323]) ).
fof(f8766,definition,
( spl12_2
<=> in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK7,sK8)) ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
fof(f8767,plain,
( in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK7,sK8))
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f8766]) ).
fof(f8768,plain,
( ~ in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK7,sK8))
| spl12_2 ),
inference(avatar_component_clause,[],[f8766]) ).
fof(f9183,definition,
( spl12_3
<=> in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK9,sK10)) ),
introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).
fof(f9184,plain,
( in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK9,sK10))
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f9183]) ).
fof(f9185,plain,
( ~ in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK9,sK10))
| spl12_3 ),
inference(avatar_component_clause,[],[f9183]) ).
fof(f9186,plain,
( ~ spl12_3
| spl12_2 ),
inference(avatar_split_clause,[],[f8325,f8766,f9183]) ).
fof(f9814,plain,
( ~ in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK7,sK8))
| spl12_3 ),
inference(forward_subsumption_resolution,[],[f8326,f9185]) ).
fof(f9887,plain,
( ~ spl12_2
| spl12_3 ),
inference(avatar_split_clause,[],[f9814,f9183,f8766]) ).
fof(f9908,plain,
( in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK9,sK10))
| cartesian_product2(sK9,sK10) = cartesian_product2(sK7,sK8)
| spl12_2 ),
inference(resolution,[],[f8768,f31]) ).
fof(f9909,plain,
( cartesian_product2(sK9,sK10) = cartesian_product2(sK7,sK8)
| spl12_2
| spl12_3 ),
inference(forward_subsumption_resolution,[],[f9908,f9185]) ).
fof(f9910,plain,
( $false
| spl12_2
| spl12_3 ),
inference(forward_subsumption_resolution,[],[f9909,f30]) ).
fof(f9911,plain,
( spl12_2
| spl12_3 ),
inference(avatar_contradiction_clause,[],[f9910]) ).
fof(f10127,plain,
( ~ in(sK11(cartesian_product2(sK9,sK10),cartesian_product2(sK7,sK8)),cartesian_product2(sK7,sK8))
| cartesian_product2(sK9,sK10) = cartesian_product2(sK7,sK8)
| ~ spl12_3 ),
inference(resolution,[],[f9184,f32]) ).
fof(f10191,plain,
( cartesian_product2(sK9,sK10) = cartesian_product2(sK7,sK8)
| ~ spl12_2
| ~ spl12_3 ),
inference(forward_subsumption_resolution,[],[f10127,f8767]) ).
fof(f10192,plain,
( $false
| ~ spl12_2
| ~ spl12_3 ),
inference(forward_subsumption_resolution,[],[f10191,f30]) ).
fof(f10193,plain,
( ~ spl12_2
| ~ spl12_3 ),
inference(avatar_contradiction_clause,[],[f10192]) ).
cnf(s2,plain,
( spl12_2
| ~ spl12_3 ),
inference(sat_conversion,[],[f9186]) ).
cnf(s3,plain,
( ~ spl12_2
| spl12_3 ),
inference(sat_conversion,[],[f9887]) ).
cnf(s4,plain,
( spl12_2
| spl12_3 ),
inference(sat_conversion,[],[f9911]) ).
cnf(s5,plain,
( ~ spl12_2
| ~ spl12_3 ),
inference(sat_conversion,[],[f10193]) ).
cnf(s6,plain,
spl12_2,
inference(rat,[],[s2,s4]) ).
cnf(s7,plain,
~ spl12_3,
inference(rat,[],[s5,s6]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s3,s7,s6]) ).
fof(f10194,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET955+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:16:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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
% 13.34/2.37 % (398092)Will run a generic schedule for satisfiability detection.
% 13.34/2.37 % (398102)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2517753660:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 13.34/2.37 % (398098)% WARNING: option uhcvi not known.
% 13.34/2.37 % (398097)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1391430602_2999 on theBenchmark for (2999ds/0Mi)
% 13.34/2.37 % (398098)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2461478333:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 13.34/2.37 % (398099)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1170521948:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 13.34/2.37 % (398100)dis+10_1_sil=32000:sp=arity:random_seed=3554658555:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 13.34/2.37 % (398101)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3360346301:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 13.34/2.37 % (398103)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1878789746:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 13.34/2.37 % TRYING [1]
% 13.34/2.37 % TRYING [2]
% 13.34/2.37 % TRYING [3]
% 13.34/2.37 % (398102)Instruction limit reached!
% 13.34/2.37 % (398102)------------------------------
% 13.34/2.37 % (398102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398102)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398102)Termination reason: Instruction limit
% 13.34/2.37 % (398102)Termination phase: Saturation
% 13.34/2.37 % (398102)Time elapsed: 0.041 s
% 13.34/2.37 % (398102)Peak memory usage: 12 MB
% 13.34/2.37 % (398102)Instructions burned: 132 (million)
% 13.34/2.37 % (398111)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=723348800:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 13.34/2.37 % TRYING [1]
% 13.34/2.37 % TRYING [2]
% 13.34/2.37 % (398100)Instruction limit reached!
% 13.34/2.37 % (398100)------------------------------
% 13.34/2.37 % (398100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398100)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398100)Termination reason: Instruction limit
% 13.34/2.37 % (398100)Termination phase: Saturation
% 13.34/2.37 % (398100)Time elapsed: 0.057 s
% 13.34/2.37 % (398100)Peak memory usage: 12 MB
% 13.34/2.37 % (398100)Instructions burned: 105 (million)
% 13.34/2.37 % TRYING [3]
% 13.34/2.37 % (398101)Instruction limit reached!
% 13.34/2.37 % (398101)------------------------------
% 13.34/2.37 % (398101)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398101)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398101)Termination reason: Instruction limit
% 13.34/2.37 % (398101)Termination phase: Saturation
% 13.34/2.37 % (398101)Time elapsed: 0.062 s
% 13.34/2.37 % (398101)Peak memory usage: 12 MB
% 13.34/2.37 % (398101)Instructions burned: 116 (million)
% 13.34/2.37 % (398113)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2673395631:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 13.34/2.37 % (398114)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=599832818:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 13.34/2.37 % (398103)Instruction limit reached!
% 13.34/2.37 % (398103)------------------------------
% 13.34/2.37 % (398103)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398103)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398103)Termination reason: Instruction limit
% 13.34/2.37 % (398103)Termination phase: Saturation
% 13.34/2.37 % (398103)Time elapsed: 0.096 s
% 13.34/2.37 % (398103)Peak memory usage: 13 MB
% 13.34/2.37 % (398103)Instructions burned: 161 (million)
% 13.34/2.37 % (398117)ott-21_1_sil=16000:fs=off:random_seed=1599346084:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 13.34/2.37 % (398113)Instruction limit reached!
% 13.34/2.37 % (398113)------------------------------
% 13.34/2.37 % (398113)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398113)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398113)Termination reason: Instruction limit
% 13.34/2.37 % (398113)Termination phase: Saturation
% 13.34/2.37 % (398113)Time elapsed: 0.087 s
% 13.34/2.37 % (398113)Peak memory usage: 12 MB
% 13.34/2.37 % (398113)Instructions burned: 132 (million)
% 13.34/2.37 % (398119)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=693436077:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 13.34/2.37 % (398117)Instruction limit reached!
% 13.34/2.37 % (398117)------------------------------
% 13.34/2.37 % (398117)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398117)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398117)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398117)Termination reason: Instruction limit
% 13.34/2.37 % (398117)Termination phase: Saturation
% 13.34/2.37 % (398117)Time elapsed: 0.087 s
% 13.34/2.37 % (398117)Peak memory usage: 12 MB
% 13.34/2.37 % (398117)Instructions burned: 180 (million)
% 13.34/2.37 % (398121)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2786633324:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 13.34/2.37 % TRYING [1]
% 13.34/2.37 % TRYING [2]
% 13.34/2.37 % TRYING [3]
% 13.34/2.37 % TRYING [4]
% 13.34/2.37 % TRYING [4]
% 13.34/2.37 % TRYING [4]
% 13.34/2.37 % (398114)Instruction limit reached!
% 13.34/2.37 % (398114)------------------------------
% 13.34/2.37 % (398114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398114)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398114)Termination reason: Instruction limit
% 13.34/2.37 % (398114)Termination phase: Saturation
% 13.34/2.37 % (398114)Time elapsed: 0.350 s
% 13.34/2.37 % (398114)Peak memory usage: 18 MB
% 13.34/2.37 % (398114)Instructions burned: 685 (million)
% 13.34/2.37 % (398123)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=748719218:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 13.34/2.37 % (398119)Instruction limit reached!
% 13.34/2.37 % (398119)------------------------------
% 13.34/2.37 % (398119)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398119)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398119)Termination reason: Instruction limit
% 13.34/2.37 % (398119)Termination phase: Saturation
% 13.34/2.37 % (398119)Time elapsed: 0.277 s
% 13.34/2.37 % (398119)Peak memory usage: 14 MB
% 13.34/2.37 % (398119)Instructions burned: 477 (million)
% 13.34/2.37 % (398111)Instruction limit reached!
% 13.34/2.37 % (398111)------------------------------
% 13.34/2.37 % (398111)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398111)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398111)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398111)Termination reason: Instruction limit
% 13.34/2.37 % (398111)Termination phase: Finite model building SAT solving
% 13.34/2.37 % (398111)Time elapsed: 0.410 s
% 13.34/2.37 % (398111)Peak memory usage: 15 MB
% 13.34/2.37 % (398111)Instructions burned: 715 (million)
% 13.34/2.37 % (398125)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1123703218:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 13.34/2.37 % (398126)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=539302288:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 13.34/2.37 % TRYING [14]
% 13.34/2.37 % (398121)Instruction limit reached!
% 13.34/2.37 % (398121)------------------------------
% 13.34/2.37 % (398121)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398121)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398121)Termination reason: Instruction limit
% 13.34/2.37 % (398121)Termination phase: Finite model building SAT solving
% 13.34/2.37 % (398121)Time elapsed: 0.449 s
% 13.34/2.37 % (398121)Peak memory usage: 17 MB
% 13.34/2.37 % (398121)Instructions burned: 866 (million)
% 13.34/2.37 % (398129)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=818173292:i=879:kws=inv_precedence:fsr=off_2992 on theBenchmark for (2992ds/879Mi)
% 13.34/2.37 % (398125)Instruction limit reached!
% 13.34/2.37 % (398125)------------------------------
% 13.34/2.37 % (398125)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398125)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398125)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398125)Termination reason: Instruction limit
% 13.34/2.37 % (398125)Termination phase: Finite model building constraint generation
% 13.34/2.37 % (398125)Time elapsed: 0.350 s
% 13.34/2.37 % (398125)Peak memory usage: 84 MB
% 13.34/2.37 % (398125)Instructions burned: 892 (million)
% 13.34/2.37 % (398126)Instruction limit reached!
% 13.34/2.37 % (398126)------------------------------
% 13.34/2.37 % (398126)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398126)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398126)Termination reason: Instruction limit
% 13.34/2.37 % (398126)Termination phase: Saturation
% 13.34/2.37 % (398126)Time elapsed: 0.361 s
% 13.34/2.37 % (398126)Peak memory usage: 30 MB
% 13.34/2.37 % (398126)Instructions burned: 693 (million)
% 13.34/2.37 % (398131)fmb+10_1_sil=64000:random_seed=4261956250:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 13.34/2.37 % TRYING [1]
% 13.34/2.37 % TRYING [2]
% 13.34/2.37 % (398132)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3066192086:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 13.34/2.37 % TRYING [3]
% 13.34/2.37 % TRYING [20]
% 13.34/2.37 % TRYING [4]
% 13.34/2.37 % (398123)Instruction limit reached!
% 13.34/2.37 % (398123)------------------------------
% 13.34/2.37 % (398123)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398123)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398123)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398123)Termination reason: Instruction limit
% 13.34/2.37 % (398123)Termination phase: Saturation
% 13.34/2.37 % (398123)Time elapsed: 0.570 s
% 13.34/2.37 % (398123)Peak memory usage: 18 MB
% 13.34/2.37 % (398123)Instructions burned: 1180 (million)
% 13.34/2.37 % (398135)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=2725724673:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 13.34/2.37 % TRYING [8]
% 13.34/2.37 % (398129)Instruction limit reached!
% 13.34/2.37 % (398129)------------------------------
% 13.34/2.37 % (398129)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398129)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398129)Termination reason: Instruction limit
% 13.34/2.37 % (398129)Termination phase: Saturation
% 13.34/2.37 % (398129)Time elapsed: 0.488 s
% 13.34/2.37 % (398129)Peak memory usage: 18 MB
% 13.34/2.37 % (398129)Instructions burned: 880 (million)
% 13.34/2.37 % (398137)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2545831431:i=5131_2987 on theBenchmark for (2987ds/5131Mi)
% 13.34/2.37 % (398135)Instruction limit reached!
% 13.34/2.37 % (398135)------------------------------
% 13.34/2.37 % (398135)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398135)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398135)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398135)Termination reason: Instruction limit
% 13.34/2.37 % (398135)Termination phase: Finite model building constraint generation
% 13.34/2.37 % (398135)Time elapsed: 0.296 s
% 13.34/2.37 % (398135)Peak memory usage: 53 MB
% 13.34/2.37 % (398135)Instructions burned: 922 (million)
% 13.34/2.37 % (398139)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=4087139254:i=1472:ins=7:fdi=8:gsp=on_2986 on theBenchmark for (2986ds/1472Mi)
% 13.34/2.37 % (398137) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-398092-398137"...
% 13.34/2.37 % (398137)...printing done.
% 13.34/2.37 % (398137)Refutation found. Thanks to Tanya!
% 13.34/2.37 % SZS status Theorem for theBenchmark
% 13.34/2.37 % SZS output start Proof for theBenchmark
% See solution above
% 13.34/2.37 % (398137)------------------------------
% 13.34/2.37 % (398137)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 13.34/2.37 % (398137)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.34/2.37 % (398137)CaDiCaL version: 2.1.3
% 13.34/2.37 % (398137)Termination reason: Refutation
% 13.34/2.37 % (398137)Time elapsed: 0.673 s
% 13.34/2.37 % (398137)Peak memory usage: 20 MB
% 13.34/2.37 % (398137)Instructions burned: 1390 (million)
% 13.34/2.37 % (398092)Success in time 1.962 s
% 13.34/2.37 % Vampire exiting
%------------------------------------------------------------------------------