%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET215-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:43:29 PM UTC 2026
% Result : Unsatisfiable 0.43s 0.47s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 45 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
fof(f3,axiom,
! [X0,X1] :
( subclass(X0,X1)
| ~ member(not_subclass_element(X0,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
fof(f13,axiom,
! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
fof(f14,axiom,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
fof(f15,axiom,
! [X2,X3,X0,X1] :
( ~ member(ordered_pair(X0,X1),cross_product(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
fof(f16,axiom,
! [X2,X3,X0,X1] :
( ~ member(X0,X1)
| ~ member(X2,X3)
| member(ordered_pair(X0,X2),cross_product(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product3) ).
fof(f17,axiom,
! [X2,X0,X1] :
( ~ member(X0,cross_product(X1,X2))
| ordered_pair(first(X0),second(X0)) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
fof(f22,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
fof(f122,negated_conjecture,
~ subclass(cross_product(intersection(x,y),z),cross_product(y,z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_6_to_X_product_monotonicity_1) ).
fof(f127,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f13,f12,f12]) ).
fof(f136,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3))
| member(X0,X2) ),
inference(definition_unfolding,[],[f14,f127]) ).
fof(f137,plain,
! [X2,X3,X0,X1] :
( ~ member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),cross_product(X2,X3))
| member(X1,X3) ),
inference(definition_unfolding,[],[f15,f127]) ).
fof(f138,plain,
! [X2,X3,X0,X1] :
( member(unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X2,X2))),cross_product(X1,X3))
| ~ member(X2,X3)
| ~ member(X0,X1) ),
inference(definition_unfolding,[],[f16,f127]) ).
fof(f139,plain,
! [X2,X0,X1] :
( ~ member(X0,cross_product(X1,X2))
| unordered_pair(unordered_pair(first(X0),first(X0)),unordered_pair(first(X0),unordered_pair(second(X0),second(X0)))) = X0 ),
inference(definition_unfolding,[],[f17,f127]) ).
fof(f193,plain,
member(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z)),cross_product(intersection(x,y),z)),
inference(resolution,[],[f2,f122]) ).
fof(f194,plain,
~ member(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z)),cross_product(y,z)),
inference(resolution,[],[f3,f122]) ).
fof(f431,plain,
not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z)) = unordered_pair(unordered_pair(first(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),first(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z)))),unordered_pair(first(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),unordered_pair(second(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),second(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z)))))),
inference(resolution,[],[f139,f193]) ).
fof(f438,plain,
! [X0,X1] :
( member(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z)),cross_product(X0,X1))
| ~ member(second(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),X1)
| ~ member(first(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),X0) ),
inference(superposition,[],[f138,f431]) ).
fof(f440,plain,
! [X0,X1] :
( ~ member(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z)),cross_product(X0,X1))
| member(second(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),X1) ),
inference(superposition,[],[f137,f431]) ).
fof(f441,plain,
! [X0,X1] :
( ~ member(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z)),cross_product(X0,X1))
| member(first(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),X0) ),
inference(superposition,[],[f136,f431]) ).
fof(f497,plain,
member(second(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),z),
inference(resolution,[],[f440,f193]) ).
fof(f543,plain,
member(first(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),intersection(x,y)),
inference(resolution,[],[f441,f193]) ).
fof(f548,plain,
member(first(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),y),
inference(resolution,[],[f543,f22]) ).
fof(f728,plain,
( ~ member(second(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),z)
| ~ member(first(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),y) ),
inference(resolution,[],[f438,f194]) ).
fof(f735,plain,
~ member(first(not_subclass_element(cross_product(intersection(x,y),z),cross_product(y,z))),y),
inference(forward_subsumption_resolution,[],[f728,f497]) ).
fof(f738,plain,
$false,
inference(forward_subsumption_resolution,[],[f735,f548]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET215-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n019.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 01:07:34 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/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
% 0.43/0.47 % (3567190)Will run a generic schedule for satisfiability detection.
% 0.43/0.47 % (3567196)% WARNING: option uhcvi not known.
% 0.43/0.47 % (3567195)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3099276959_2999 on theBenchmark for (2999ds/0Mi)
% 0.43/0.47 % (3567198)dis+10_1_sil=32000:sp=arity:random_seed=3360868137:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.43/0.47 % (3567197)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3249003088:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.43/0.47 % (3567199)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=151861963:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.43/0.47 % (3567200)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=531512585:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.43/0.47 % (3567201)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1982125248:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.43/0.47 % (3567196)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=448044821:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.43/0.47 % (3567199) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3567190-3567199"...
% 0.43/0.47 % (3567199)...printing done.
% 0.43/0.47 % (3567199)Refutation found. Thanks to Tanya!
% 0.43/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.43/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.43/0.47 % (3567199)------------------------------
% 0.43/0.47 % (3567199)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.43/0.47 % (3567199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.43/0.47 % (3567199)CaDiCaL version: 2.1.3
% 0.43/0.47 % (3567199)Termination reason: Refutation
% 0.43/0.47 % (3567199)Time elapsed: 0.034 s
% 0.43/0.47 % (3567199)Peak memory usage: 12 MB
% 0.43/0.47 % (3567199)Instructions burned: 55 (million)
% 0.43/0.47 % (3567190)Success in time 0.07 s
% 0.43/0.47 % Vampire exiting
%------------------------------------------------------------------------------