%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET256-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:33 PM UTC 2026
% Result : Unsatisfiable 0.42s 0.48s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 38 ( 18 unt; 0 def)
% Number of atoms : 63 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 32 ~; 25 |; 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 : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 61 ( 61 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( ~ subclass(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
fof(f2,axiom,
! [X0,X1] :
( subclass(X0,X1)
| member(not_subclass_element(X0,X1),X0) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
fof(f21,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
fof(f22,axiom,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
fof(f23,axiom,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
fof(f28,axiom,
! [X2,X0,X1] : intersection(X0,cross_product(X1,X2)) = restrict(X0,X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
fof(f122,negated_conjecture,
subclass(z1,z2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_monotonicity_of_restriction3_1) ).
fof(f123,negated_conjecture,
~ subclass(restrict(x,y,z1),restrict(x,y,z2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_monotonicity_of_restriction3_2) ).
fof(f128,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(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(X0,X2) ),
inference(definition_unfolding,[],[f14,f128]) ).
fof(f138,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,f128]) ).
fof(f139,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,f128]) ).
fof(f140,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,f128]) ).
fof(f186,plain,
~ subclass(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),
inference(definition_unfolding,[],[f123,f28,f28]) ).
fof(f195,plain,
member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),intersection(x,cross_product(y,z1))),
inference(resolution,[],[f2,f186]) ).
fof(f196,plain,
~ member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),intersection(x,cross_product(y,z2))),
inference(resolution,[],[f3,f186]) ).
fof(f197,plain,
member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),x),
inference(resolution,[],[f21,f195]) ).
fof(f199,plain,
member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),cross_product(y,z1)),
inference(resolution,[],[f22,f195]) ).
fof(f215,plain,
! [X0] :
( member(X0,z2)
| ~ member(X0,z1) ),
inference(resolution,[],[f1,f122]) ).
fof(f268,plain,
( ~ member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),cross_product(y,z2))
| ~ member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),x) ),
inference(resolution,[],[f23,f196]) ).
fof(f272,plain,
~ member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),cross_product(y,z2)),
inference(forward_subsumption_resolution,[],[f268,f197]) ).
fof(f435,plain,
not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))) = unordered_pair(unordered_pair(first(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),first(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))))),unordered_pair(first(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),unordered_pair(second(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),second(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))))))),
inference(resolution,[],[f140,f199]) ).
fof(f522,plain,
! [X0,X1] :
( ~ member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),cross_product(X0,X1))
| member(first(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),X0) ),
inference(superposition,[],[f137,f435]) ).
fof(f523,plain,
! [X0,X1] :
( ~ member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),cross_product(X0,X1))
| member(second(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),X1) ),
inference(superposition,[],[f138,f435]) ).
fof(f524,plain,
! [X0,X1] :
( member(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2))),cross_product(X0,X1))
| ~ member(second(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),X1)
| ~ member(first(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),X0) ),
inference(superposition,[],[f139,f435]) ).
fof(f685,plain,
member(first(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),y),
inference(resolution,[],[f522,f199]) ).
fof(f737,plain,
member(second(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),z1),
inference(resolution,[],[f523,f199]) ).
fof(f986,plain,
( ~ member(second(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),z2)
| ~ member(first(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),y) ),
inference(resolution,[],[f524,f272]) ).
fof(f993,plain,
~ member(second(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),z2),
inference(forward_subsumption_resolution,[],[f986,f685]) ).
fof(f1023,plain,
~ member(second(not_subclass_element(intersection(x,cross_product(y,z1)),intersection(x,cross_product(y,z2)))),z1),
inference(resolution,[],[f993,f215]) ).
fof(f1025,plain,
$false,
inference(forward_subsumption_resolution,[],[f1023,f737]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET256-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n007.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:11:40 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.48 % (1937745)Will run a generic schedule for satisfiability detection.
% 0.42/0.48 % (1937750)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3816033846_2999 on theBenchmark for (2999ds/0Mi)
% 0.42/0.48 % (1937753)dis+10_1_sil=32000:sp=arity:random_seed=3281788584:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.42/0.48 % (1937752)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=255287015:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.42/0.48 % (1937751)% WARNING: option uhcvi not known.
% 0.42/0.48 % (1937754)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=589547116:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.42/0.48 % (1937755)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1528683234:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.42/0.48 % (1937756)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1534328924:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.42/0.48 % (1937751)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3366015363:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.42/0.48 % (1937754) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1937745-1937754"...
% 0.42/0.48 % (1937754)...printing done.
% 0.42/0.48 % (1937754)Refutation found. Thanks to Tanya!
% 0.42/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.42/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.42/0.48 % (1937754)------------------------------
% 0.42/0.48 % (1937754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.48 % (1937754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.48 % (1937754)CaDiCaL version: 2.1.3
% 0.42/0.48 % (1937754)Termination reason: Refutation
% 0.42/0.48 % (1937754)Time elapsed: 0.041 s
% 0.42/0.48 % (1937754)Peak memory usage: 12 MB
% 0.42/0.48 % (1937754)Instructions burned: 70 (million)
% 0.42/0.48 % (1937745)Success in time 0.077 s
% 0.42/0.48 % Vampire exiting
%------------------------------------------------------------------------------