%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU157+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:28 PM UTC 2026
% Result : Theorem 4.48s 1.53s
% Output : Refutation 5.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 66 ( 7 unt; 3 def)
% Number of atoms : 214 ( 51 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 246 ( 98 ~; 105 |; 34 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 134 ( 0 sgn 110 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,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(f17,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(f46,conjecture,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X0,X2)
& in(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l55_zfmisc_1) ).
fof(f47,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X0,X2)
& in(X1,X3) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f65,axiom,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f90,plain,
? [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<~> ( in(X0,X2)
& in(X1,X3) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f93,plain,
! [X0,X1,X2,X3] :
( ( X0 = X2
& X1 = X3 )
| ordered_pair(X0,X1) != ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f65]) ).
fof(f94,plain,
? [X0,X1,X2,X3] :
( ( ~ in(X0,X2)
| ~ in(X1,X3)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) )
& ( ( in(X0,X2)
& in(X1,X3) )
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f90]) ).
fof(f95,plain,
? [X0,X1,X2,X3] :
( ( ~ in(X0,X2)
| ~ in(X1,X3)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) )
& ( ( in(X0,X2)
& in(X1,X3) )
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
( ( ~ in(sK0,sK2)
| ~ in(sK1,sK3)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) )
& ( ( in(sK0,sK2)
& in(sK1,sK3) )
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f95]) ).
fof(f99,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,[],[f12]) ).
fof(f100,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,[],[f99]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ( X2 = cartesian_product2(X0,X1)
| ( ( ! [X4,X5] :
( ~ in(X4,X0)
| ~ in(X5,X1)
| ordered_pair(X4,X5) != sK5(X0,X1,X2) )
| ~ in(sK5(X0,X1,X2),X2) )
& ( ( in(sK6(X0,X1,X2),X0)
& in(sK7(X0,X1,X2),X1)
& sK5(X0,X1,X2) = ordered_pair(sK6(X0,X1,X2),sK7(X0,X1,X2)) )
| in(sK5(X0,X1,X2),X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ~ in(X9,X0)
| ~ in(X10,X1)
| ordered_pair(X9,X10) != X8 ) )
& ( ( in(sK8(X0,X1,X8),X0)
& in(sK9(X0,X1,X8),X1)
& ordered_pair(sK8(X0,X1,X8),sK9(X0,X1,X8)) = X8 )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9]),skolemize(X3,sK5(X0,X1,X2)),skolemize(X6,sK6(X0,X1,X2)),skolemize(X7,sK7(X0,X1,X2)),skolemize(X11,sK8(X0,X1,X8)),skolemize(X12,sK9(X0,X1,X8))],[f100]) ).
fof(f102,plain,
( in(sK1,sK3)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(cnf_transformation,[],[f96]) ).
fof(f103,plain,
( in(sK0,sK2)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(cnf_transformation,[],[f96]) ).
fof(f104,plain,
( ~ in(sK0,sK2)
| ~ in(sK1,sK3)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(cnf_transformation,[],[f96]) ).
fof(f108,plain,
! [X2,X0,X1,X8] :
( ordered_pair(sK8(X0,X1,X8),sK9(X0,X1,X8)) = X8
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f101]) ).
fof(f109,plain,
! [X2,X0,X1,X8] :
( in(sK9(X0,X1,X8),X1)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f101]) ).
fof(f110,plain,
! [X2,X0,X1,X8] :
( in(sK8(X0,X1,X8),X0)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f101]) ).
fof(f111,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,[],[f101]) ).
fof(f116,plain,
! [X2,X3,X0,X1] :
( X1 = X3
| ordered_pair(X0,X1) != ordered_pair(X2,X3) ),
inference(cnf_transformation,[],[f93]) ).
fof(f117,plain,
! [X2,X3,X0,X1] :
( X0 = X2
| ordered_pair(X0,X1) != ordered_pair(X2,X3) ),
inference(cnf_transformation,[],[f93]) ).
fof(f118,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f17]) ).
fof(f119,plain,
( ~ in(sK0,sK2)
| ~ in(sK1,sK3)
| ~ in(unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)),cartesian_product2(sK2,sK3)) ),
inference(definition_unfolding,[],[f104,f118]) ).
fof(f120,plain,
( in(sK0,sK2)
| in(unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)),cartesian_product2(sK2,sK3)) ),
inference(definition_unfolding,[],[f103,f118]) ).
fof(f121,plain,
( in(sK1,sK3)
| in(unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)),cartesian_product2(sK2,sK3)) ),
inference(definition_unfolding,[],[f102,f118]) ).
fof(f124,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,[],[f111,f118]) ).
fof(f125,plain,
! [X2,X0,X1,X8] :
( unordered_pair(unordered_pair(sK8(X0,X1,X8),sK9(X0,X1,X8)),singleton(sK8(X0,X1,X8))) = X8
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f108,f118]) ).
fof(f126,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(unordered_pair(X2,X3),singleton(X2))
| X0 = X2 ),
inference(definition_unfolding,[],[f117,f118,f118]) ).
fof(f127,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(unordered_pair(X2,X3),singleton(X2))
| X1 = X3 ),
inference(definition_unfolding,[],[f116,f118,f118]) ).
fof(f128,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,[],[f124]) ).
fof(f129,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,[],[f128]) ).
fof(f130,plain,
! [X0,X1,X8] :
( in(sK8(X0,X1,X8),X0)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f110]) ).
fof(f131,plain,
! [X0,X1,X8] :
( in(sK9(X0,X1,X8),X1)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f109]) ).
fof(f132,plain,
! [X0,X1,X8] :
( ~ in(X8,cartesian_product2(X0,X1))
| unordered_pair(unordered_pair(sK8(X0,X1,X8),sK9(X0,X1,X8)),singleton(sK8(X0,X1,X8))) = X8 ),
inference(equality_resolution,[],[f125]) ).
fof(f134,definition,
( spl10_1
<=> in(unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)),cartesian_product2(sK2,sK3)) ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
fof(f136,plain,
( in(unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)),cartesian_product2(sK2,sK3))
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f134]) ).
fof(f138,definition,
( spl10_2
<=> in(sK1,sK3) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f139,plain,
( ~ in(sK1,sK3)
| spl10_2 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f141,plain,
( spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f121,f138,f134]) ).
fof(f143,definition,
( spl10_3
<=> in(sK0,sK2) ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
fof(f144,plain,
( ~ in(sK0,sK2)
| spl10_3 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f146,plain,
( spl10_1
| spl10_3 ),
inference(avatar_split_clause,[],[f120,f143,f134]) ).
fof(f147,plain,
( ~ in(sK0,sK2)
| ~ in(sK1,sK3) ),
inference(forward_subsumption_resolution,[],[f119,f129]) ).
fof(f148,plain,
( ~ spl10_2
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f147,f143,f138]) ).
fof(f181,plain,
( unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)) = unordered_pair(unordered_pair(sK8(sK2,sK3,unordered_pair(unordered_pair(sK0,sK1),singleton(sK0))),sK9(sK2,sK3,unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)))),singleton(sK8(sK2,sK3,unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)))))
| ~ spl10_1 ),
inference(unit_resulting_resolution,[],[f132,f136]) ).
fof(f215,plain,
( sK1 = sK9(sK2,sK3,unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)))
| ~ spl10_1 ),
inference(unit_resulting_resolution,[],[f127,f181]) ).
fof(f216,plain,
( sK0 = sK8(sK2,sK3,unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)))
| ~ spl10_1 ),
inference(unit_resulting_resolution,[],[f126,f181]) ).
fof(f235,plain,
( in(sK1,sK3)
| ~ in(unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)),cartesian_product2(sK2,sK3))
| ~ spl10_1 ),
inference(superposition,[],[f131,f215]) ).
fof(f236,plain,
( ~ in(unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)),cartesian_product2(sK2,sK3))
| ~ spl10_1
| spl10_2 ),
inference(forward_subsumption_resolution,[],[f235,f139]) ).
fof(f239,plain,
( $false
| ~ spl10_1
| spl10_2 ),
inference(forward_subsumption_resolution,[],[f236,f136]) ).
fof(f240,plain,
( ~ spl10_1
| spl10_2 ),
inference(avatar_contradiction_clause,[],[f239]) ).
fof(f363,plain,
( in(sK0,sK2)
| ~ in(unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)),cartesian_product2(sK2,sK3))
| ~ spl10_1 ),
inference(superposition,[],[f130,f216]) ).
fof(f364,plain,
( ~ in(unordered_pair(unordered_pair(sK0,sK1),singleton(sK0)),cartesian_product2(sK2,sK3))
| ~ spl10_1
| spl10_3 ),
inference(forward_subsumption_resolution,[],[f363,f144]) ).
fof(f367,plain,
( $false
| ~ spl10_1
| spl10_3 ),
inference(forward_subsumption_resolution,[],[f364,f136]) ).
fof(f368,plain,
( ~ spl10_1
| spl10_3 ),
inference(avatar_contradiction_clause,[],[f367]) ).
cnf(s1,plain,
( spl10_1
| spl10_2 ),
inference(sat_conversion,[],[f141]) ).
cnf(s2,plain,
( spl10_1
| spl10_3 ),
inference(sat_conversion,[],[f146]) ).
cnf(s3,plain,
( ~ spl10_2
| ~ spl10_3 ),
inference(sat_conversion,[],[f148]) ).
cnf(s5,plain,
( ~ spl10_1
| spl10_2 ),
inference(sat_conversion,[],[f240]) ).
cnf(s7,plain,
( ~ spl10_1
| spl10_3 ),
inference(sat_conversion,[],[f368]) ).
cnf(s8,plain,
spl10_1,
inference(rat,[],[s3,s1,s2]) ).
cnf(s9,plain,
spl10_3,
inference(rat,[],[s7,s8]) ).
cnf(s10,plain,
spl10_2,
inference(rat,[],[s5,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s3,s9,s10]) ).
fof(f369,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU157+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.38 % Computer : n006.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Mon Sep 28 03:47:25 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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
% 4.48/1.53 % (3559853)Detected formulas, will run a generic FOF schedule.
% 4.48/1.53 % (3559864)dis-21_1_sil=8000:lcm=predicate:random_seed=3799706451: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)
% 4.48/1.53 % (3559858)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=2942204653:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.48/1.53 % (3559860)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=113287238:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.48/1.53 % (3559862)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2250806296:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.48/1.53 % (3559859)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=3431893141:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.48/1.53 % (3559861)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3037251452:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.48/1.53 % (3559863)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1668849898:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.48/1.53 % (3559864)Instruction limit reached!
% 4.48/1.53 % (3559864)------------------------------
% 4.48/1.53 % (3559864)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.53 % (3559864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.53 % (3559864)CaDiCaL version: 2.1.3
% 4.48/1.53 % (3559864)Termination reason: Instruction limit
% 4.48/1.53 % (3559864)Termination phase: Saturation
% 4.48/1.53 % (3559864)Time elapsed: 0.044 s
% 4.48/1.53 % (3559864)Peak memory usage: 89 MB
% 4.48/1.53 % (3559864)Instructions burned: 129 (million)
% 4.48/1.53 % (3559861)Instruction limit reached!
% 4.48/1.53 % (3559861)------------------------------
% 4.48/1.53 % (3559861)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.53 % (3559861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.53 % (3559861)CaDiCaL version: 2.1.3
% 4.48/1.53 % (3559861)Termination reason: Instruction limit
% 4.48/1.53 % (3559861)Termination phase: Saturation
% 4.48/1.53 % (3559861)Time elapsed: 0.070 s
% 4.48/1.53 % (3559861)Peak memory usage: 89 MB
% 4.48/1.53 % (3559861)Instructions burned: 109 (million)
% 4.48/1.53 % (3559862)Instruction limit reached!
% 4.48/1.53 % (3559862)------------------------------
% 4.48/1.53 % (3559862)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.53 % (3559862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.53 % (3559862)CaDiCaL version: 2.1.3
% 4.48/1.53 % (3559862)Termination reason: Instruction limit
% 4.48/1.53 % (3559862)Termination phase: Saturation
% 4.48/1.53 % (3559862)Time elapsed: 0.074 s
% 4.48/1.53 % (3559862)Peak memory usage: 88 MB
% 4.48/1.53 % (3559862)Instructions burned: 120 (million)
% 4.48/1.53 % (3559863)Instruction limit reached!
% 4.48/1.53 % (3559863)------------------------------
% 4.48/1.53 % (3559863)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.53 % (3559863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.53 % (3559863)CaDiCaL version: 2.1.3
% 4.48/1.53 % (3559863)Termination reason: Instruction limit
% 4.48/1.53 % (3559863)Termination phase: Saturation
% 4.48/1.53 % (3559863)Time elapsed: 0.098 s
% 4.48/1.53 % (3559863)Peak memory usage: 90 MB
% 4.48/1.53 % (3559863)Instructions burned: 140 (million)
% 4.48/1.53 % (3559872)lrs+10_1_sil=8000:sp=occurrence:random_seed=3953210481:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 4.48/1.53 % (3559874)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2410832357:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.48/1.53 % (3559873)lrs+10_1_sil=32000:urr=on:br=off:random_seed=88964288:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.48/1.53 % (3559873)First to succeed.
% 4.48/1.53 % (3559873)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3559853"
% 4.48/1.53 % (3559875)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1970087680:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.48/1.53 % (3559872)Instruction limit reached!
% 4.48/1.53 % (3559872)------------------------------
% 4.48/1.53 % (3559872)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.53 % (3559872)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.53 % (3559872)CaDiCaL version: 2.1.3
% 4.48/1.53 % (3559872)Termination reason: Instruction limit
% 4.48/1.53 % (3559872)Termination phase: Saturation
% 4.48/1.53 % (3559872)Time elapsed: 0.102 s
% 4.48/1.53 % (3559872)Peak memory usage: 91 MB
% 4.48/1.53 % (3559872)Instructions burned: 287 (million)
% 4.48/1.53 % (3559880)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3337145183:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.48/1.53 % (3559875)Instruction limit reached!
% 4.48/1.53 % (3559875)------------------------------
% 4.48/1.53 % (3559875)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.53 % (3559875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.53 % (3559875)CaDiCaL version: 2.1.3
% 4.48/1.53 % (3559875)Termination reason: Instruction limit
% 4.48/1.53 % (3559875)Termination phase: Saturation
% 4.48/1.53 % (3559875)Time elapsed: 0.141 s
% 4.48/1.53 % (3559875)Peak memory usage: 92 MB
% 4.48/1.53 % (3559875)Instructions burned: 250 (million)
% 4.48/1.53 % (3559874)Instruction limit reached!
% 4.48/1.53 % (3559874)------------------------------
% 4.48/1.53 % (3559874)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.53 % (3559874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.53 % (3559874)CaDiCaL version: 2.1.3
% 4.48/1.53 % (3559874)Termination reason: Instruction limit
% 4.48/1.53 % (3559874)Termination phase: Saturation
% 4.48/1.53 % (3559874)Time elapsed: 0.225 s
% 4.48/1.53 % (3559874)Peak memory usage: 92 MB
% 4.48/1.53 % (3559874)Instructions burned: 325 (million)
% 4.48/1.53 % (3559880)Instruction limit reached!
% 4.48/1.53 % (3559880)------------------------------
% 4.48/1.53 % (3559880)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.48/1.53 % (3559880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.48/1.53 % (3559880)CaDiCaL version: 2.1.3
% 4.48/1.53 % (3559880)Termination reason: Instruction limit
% 4.48/1.53 % (3559880)Termination phase: Saturation
% 4.48/1.53 % (3559880)Time elapsed: 0.096 s
% 4.48/1.53 % (3559880)Peak memory usage: 89 MB
% 4.48/1.53 % (3559880)Instructions burned: 294 (million)
% 4.48/1.53 % (3559873)Refutation found. Thanks to Tanya!
% 4.48/1.53 % SZS status Theorem for theBenchmark
% 4.48/1.53 % SZS output start Proof for theBenchmark
% See solution above
% 5.24/1.66 % (3559873)------------------------------
% 5.24/1.66 % (3559873)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.24/1.66 % (3559873)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.24/1.66 % (3559873)CaDiCaL version: 2.1.3
% 5.24/1.66 % (3559873)Termination reason: Refutation
% 5.24/1.66 % (3559873)Time elapsed: 0.012 s
% 5.24/1.66 % (3559873)Peak memory usage: 90 MB
% 5.24/1.66 % (3559873)Instructions burned: 17 (million)
% 5.24/1.66 % (3559873)------------------------------
% 5.24/1.66 % (3559873)------------------------------
% 5.24/1.66 % (3559853)Success in time 0.671 s
% 5.24/1.66 % Vampire exiting
%------------------------------------------------------------------------------