%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU167+1 : TPTP v9.3.1. Released v3.3.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:52:13 PM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 45 ( 20 ~; 12 |; 9 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 34 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [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(f4,conjecture,
! [X0,X1,X2,X3] :
( ( subset(X0,X1)
& subset(X2,X3) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t119_zfmisc_1) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( subset(X0,X1)
& subset(X2,X3) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X1,X2) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f8,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,[],[f3]) ).
fof(f9,plain,
? [X0,X1,X2,X3] :
( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
& subset(X0,X1)
& subset(X2,X3) ),
inference(ennf_transformation,[],[f5]) ).
fof(f10,plain,
? [X0,X1,X2,X3] :
( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
& subset(X0,X1)
& subset(X2,X3) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f12,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X0,X1)
| ~ subset(X1,X2) ),
inference(flattening,[],[f11]) ).
fof(f14,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f15,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f16,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f10]) ).
fof(f17,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f10]) ).
fof(f18,plain,
~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3)),
inference(cnf_transformation,[],[f10]) ).
fof(f19,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f12]) ).
fof(f26,plain,
! [X0] :
( ~ subset(X0,cartesian_product2(sK1,sK3))
| ~ subset(cartesian_product2(sK0,sK2),X0) ),
inference(resolution,[],[f19,f18]) ).
fof(f39,plain,
! [X0] :
( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,X0))
| ~ subset(X0,sK3) ),
inference(resolution,[],[f26,f14]) ).
fof(f452,plain,
( ~ subset(sK2,sK3)
| ~ subset(sK0,sK1) ),
inference(resolution,[],[f39,f15]) ).
fof(f461,plain,
~ subset(sK0,sK1),
inference(forward_subsumption_resolution,[],[f452,f16]) ).
fof(f462,plain,
$false,
inference(forward_subsumption_resolution,[],[f461,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU167+1 : TPTP v9.3.1. Released v3.3.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:53:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 Running first-order model finding
% 0.13/0.39 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.13/0.44 % (1167596)Will run a generic schedule for satisfiability detection.
% 0.13/0.44 % (1167605)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3518548696:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.44 % (1167602)% WARNING: option uhcvi not known.
% 0.13/0.44 % (1167601)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2316055326_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.44 % (1167602)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1043925527:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.44 % (1167603)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2339401458:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.44 % (1167604)dis+10_1_sil=32000:sp=arity:random_seed=2232297778:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.44 % (1167606)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1670703045:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.44 % (1167605) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1167596-1167605"...
% 0.13/0.44 % TRYING [1]
% 0.13/0.44 % (1167607)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1882366198:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.44 % TRYING [2]
% 0.13/0.44 % TRYING [3]
% 0.13/0.44 % (1167602) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1167596-1167602"...
% 0.13/0.44 % (1167605)...printing done.
% 0.13/0.44 % (1167604) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1167596-1167604"...
% 0.13/0.44 % (1167606) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1167596-1167606"...
% 0.13/0.44 % (1167605)Refutation found. Thanks to Tanya!
% 0.13/0.44 % SZS status Theorem for theBenchmark
% 0.13/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.44 % (1167605)------------------------------
% 0.13/0.44 % (1167605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.44 % (1167605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.44 % (1167605)CaDiCaL version: 2.1.3
% 0.13/0.44 % (1167605)Termination reason: Refutation
% 0.13/0.44 % (1167605)Time elapsed: 0.008 s
% 0.13/0.44 % (1167605)Peak memory usage: 12 MB
% 0.13/0.44 % (1167605)Instructions burned: 25 (million)
% 0.13/0.44 % (1167596)Success in time 0.034 s
% 0.13/0.44 % Vampire exiting
%------------------------------------------------------------------------------