%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU089+1 : 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 : n003.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:51:54 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 46 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 43 ( 18 ~; 8 |; 14 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 26 ( 20 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0,X1,X2] : cartesian_product3(X0,X1,X2) = cartesian_product2(cartesian_product2(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_zfmisc_1) ).
fof(f17,axiom,
! [X0,X1] :
( ( finite(X0)
& finite(X1) )
=> finite(cartesian_product2(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc14_finset_1) ).
fof(f53,conjecture,
! [X0,X1,X2] :
( ( finite(X0)
& finite(X1)
& finite(X2) )
=> finite(cartesian_product3(X0,X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_finset_1) ).
fof(f54,negated_conjecture,
~ ! [X0,X1,X2] :
( ( finite(X0)
& finite(X1)
& finite(X2) )
=> finite(cartesian_product3(X0,X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f101,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X0)
| ~ finite(X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f102,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X0)
| ~ finite(X1) ),
inference(flattening,[],[f101]) ).
fof(f112,plain,
? [X0,X1,X2] :
( ~ finite(cartesian_product3(X0,X1,X2))
& finite(X0)
& finite(X1)
& finite(X2) ),
inference(ennf_transformation,[],[f54]) ).
fof(f113,plain,
? [X0,X1,X2] :
( ~ finite(cartesian_product3(X0,X1,X2))
& finite(X0)
& finite(X1)
& finite(X2) ),
inference(flattening,[],[f112]) ).
fof(f149,plain,
( ~ finite(cartesian_product3(sK26,sK27,sK28))
& finite(sK26)
& finite(sK27)
& finite(sK28) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK26,sK27,sK28]),skolemize(X0,sK26),skolemize(X1,sK27),skolemize(X2,sK28)],[f113]) ).
fof(f173,plain,
! [X2,X0,X1] : cartesian_product3(X0,X1,X2) = cartesian_product2(cartesian_product2(X0,X1),X2),
inference(cnf_transformation,[],[f14]) ).
fof(f177,plain,
! [X0,X1] :
( finite(cartesian_product2(X0,X1))
| ~ finite(X0)
| ~ finite(X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f265,plain,
finite(sK28),
inference(cnf_transformation,[],[f149]) ).
fof(f266,plain,
finite(sK27),
inference(cnf_transformation,[],[f149]) ).
fof(f267,plain,
finite(sK26),
inference(cnf_transformation,[],[f149]) ).
fof(f268,plain,
~ finite(cartesian_product3(sK26,sK27,sK28)),
inference(cnf_transformation,[],[f149]) ).
fof(f277,plain,
~ finite(cartesian_product2(cartesian_product2(sK26,sK27),sK28)),
inference(definition_unfolding,[],[f268,f173]) ).
fof(f1077,plain,
( ~ finite(cartesian_product2(sK26,sK27))
| ~ finite(sK28) ),
inference(resolution,[],[f177,f277]) ).
fof(f1078,plain,
~ finite(cartesian_product2(sK26,sK27)),
inference(forward_subsumption_resolution,[],[f1077,f265]) ).
fof(f1079,plain,
( ~ finite(sK26)
| ~ finite(sK27) ),
inference(resolution,[],[f1078,f177]) ).
fof(f1080,plain,
~ finite(sK27),
inference(forward_subsumption_resolution,[],[f1079,f267]) ).
fof(f1081,plain,
$false,
inference(forward_subsumption_resolution,[],[f1080,f266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU089+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n003.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.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 03:34:28 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 Running first-order model finding
% 0.10/0.38 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.10/0.44 % (1157890)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (1157897)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3701420085:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.44 % (1157896)% WARNING: option uhcvi not known.
% 0.10/0.44 % (1157895)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3098716903_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.44 % (1157898)dis+10_1_sil=32000:sp=arity:random_seed=316003713:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.44 % (1157899)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1290899885:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.44 % (1157900)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4188069873:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.44 % (1157901)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=524431460:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.44 % (1157896)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=154670402:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.44 % (1157897) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1157890-1157897"...
% 0.10/0.44 % (1157897)...printing done.
% 0.10/0.44 % (1157897)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Theorem for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44 % (1157897)------------------------------
% 0.10/0.44 % (1157897)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (1157897)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (1157897)CaDiCaL version: 2.1.3
% 0.10/0.44 % (1157897)Termination reason: Refutation
% 0.10/0.44 % (1157897)Time elapsed: 0.009 s
% 0.10/0.44 % (1157897)Peak memory usage: 12 MB
% 0.10/0.44 % (1157897)Instructions burned: 26 (million)
% 0.10/0.44 % (1157890)Success in time 0.044 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------