%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET260-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 : 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:43:33 PM UTC 2026
% Result : Unsatisfiable 1.19s 0.61s
% Output : Refutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 51 ( 20 unt; 0 def)
% Number of atoms : 92 ( 23 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 81 ( 40 ~; 41 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 72 ( 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( ~ member(X2,X0)
| ~ subclass(X0,X1)
| member(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
fof(f4,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
fof(f10,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X1,X0))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
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(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(f24,axiom,
! [X0,X1] :
( ~ member(X0,complement(X1))
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
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(f31,axiom,
! [X0,X1] :
( ~ member(X0,universal_class)
| restrict(X1,singleton(X0),universal_class) = null_class
| member(X0,domain_of(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',domain2) ).
fof(f32,plain,
! [X0,X1] :
( ~ member(X0,universal_class)
| null_class = restrict(X1,singleton(X0),universal_class)
| member(X0,domain_of(X1)) ),
inference(reorient_equations,[],[f31]) ).
fof(f67,axiom,
! [X0] :
( X0 = null_class
| member(regular(X0),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
fof(f68,plain,
! [X0] :
( member(regular(X0),X0)
| null_class = X0 ),
inference(reorient_equations,[],[f67]) ).
fof(f122,negated_conjecture,
member(ordered_pair(x,y),xr),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_alternate_defn3_1) ).
fof(f123,negated_conjecture,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_alternate_defn3_2) ).
fof(f124,negated_conjecture,
~ member(x,domain_of(xr)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_alternate_defn3_3) ).
fof(f129,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(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(X0,X2) ),
inference(definition_unfolding,[],[f14,f129]) ).
fof(f139,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,f129]) ).
fof(f140,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,f129]) ).
fof(f146,plain,
! [X0,X1] :
( member(X0,domain_of(X1))
| null_class = intersection(X1,cross_product(unordered_pair(X0,X0),universal_class))
| ~ member(X0,universal_class) ),
inference(definition_unfolding,[],[f32,f28,f12]) ).
fof(f187,plain,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),xr),
inference(definition_unfolding,[],[f122,f129]) ).
fof(f188,plain,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),cross_product(universal_class,universal_class)),
inference(definition_unfolding,[],[f123,f129]) ).
fof(f193,plain,
member(x,universal_class),
inference(resolution,[],[f138,f188]) ).
fof(f194,plain,
member(y,universal_class),
inference(resolution,[],[f139,f188]) ).
fof(f198,plain,
! [X0] :
( ~ member(regular(complement(X0)),X0)
| complement(X0) = null_class ),
inference(resolution,[],[f68,f24]) ).
fof(f204,plain,
! [X0,X1] :
( member(regular(intersection(X0,X1)),X0)
| intersection(X0,X1) = null_class ),
inference(resolution,[],[f21,f68]) ).
fof(f207,plain,
! [X0,X1] :
( member(regular(intersection(X0,X1)),X1)
| intersection(X0,X1) = null_class ),
inference(resolution,[],[f22,f68]) ).
fof(f217,plain,
! [X0,X1] :
( member(regular(X0),X1)
| ~ subclass(X0,X1)
| null_class = X0 ),
inference(resolution,[],[f1,f68]) ).
fof(f869,plain,
! [X0] :
( ~ subclass(complement(X0),X0)
| complement(X0) = null_class
| complement(X0) = null_class ),
inference(resolution,[],[f217,f198]) ).
fof(f879,plain,
! [X0] :
( ~ subclass(complement(X0),X0)
| complement(X0) = null_class ),
inference(duplicate_literal_removal,[],[f869]) ).
fof(f885,plain,
null_class = complement(universal_class),
inference(resolution,[],[f879,f4]) ).
fof(f897,plain,
! [X0] :
( ~ member(X0,null_class)
| ~ member(X0,universal_class) ),
inference(superposition,[],[f24,f885]) ).
fof(f1126,plain,
! [X0] :
( ~ member(regular(intersection(null_class,X0)),universal_class)
| null_class = intersection(null_class,X0) ),
inference(resolution,[],[f204,f897]) ).
fof(f1292,plain,
( null_class = intersection(null_class,universal_class)
| null_class = intersection(null_class,universal_class) ),
inference(resolution,[],[f1126,f207]) ).
fof(f1295,plain,
null_class = intersection(null_class,universal_class),
inference(duplicate_literal_removal,[],[f1292]) ).
fof(f1300,plain,
! [X0] :
( ~ member(X0,null_class)
| member(X0,universal_class) ),
inference(superposition,[],[f22,f1295]) ).
fof(f1311,plain,
! [X0] : ~ member(X0,null_class),
inference(forward_subsumption_resolution,[],[f1300,f897]) ).
fof(f2361,plain,
( null_class = intersection(xr,cross_product(unordered_pair(x,x),universal_class))
| ~ member(x,universal_class) ),
inference(resolution,[],[f146,f124]) ).
fof(f2363,plain,
null_class = intersection(xr,cross_product(unordered_pair(x,x),universal_class)),
inference(forward_subsumption_resolution,[],[f2361,f193]) ).
fof(f2379,plain,
! [X0] :
( member(X0,null_class)
| ~ member(X0,cross_product(unordered_pair(x,x),universal_class))
| ~ member(X0,xr) ),
inference(superposition,[],[f23,f2363]) ).
fof(f2400,plain,
! [X0] :
( ~ member(X0,xr)
| ~ member(X0,cross_product(unordered_pair(x,x),universal_class)) ),
inference(forward_subsumption_resolution,[],[f2379,f1311]) ).
fof(f2430,plain,
~ member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),cross_product(unordered_pair(x,x),universal_class)),
inference(resolution,[],[f2400,f187]) ).
fof(f2537,plain,
( ~ member(y,universal_class)
| ~ member(x,unordered_pair(x,x)) ),
inference(resolution,[],[f2430,f140]) ).
fof(f2539,plain,
~ member(x,unordered_pair(x,x)),
inference(forward_subsumption_resolution,[],[f2537,f194]) ).
fof(f2552,plain,
~ member(x,universal_class),
inference(resolution,[],[f2539,f10]) ).
fof(f2553,plain,
$false,
inference(forward_subsumption_resolution,[],[f2552,f193]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET260-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 : n006.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.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 01:14:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.40 Running first-order model finding
% 0.14/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
% 1.19/0.61 % (3500816)Will run a generic schedule for satisfiability detection.
% 1.19/0.61 % (3500822)% WARNING: option uhcvi not known.
% 1.19/0.61 % (3500821)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3830345083_2999 on theBenchmark for (2999ds/0Mi)
% 1.19/0.61 % (3500824)dis+10_1_sil=32000:sp=arity:random_seed=3744084625:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.19/0.61 % (3500823)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1172459279:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.19/0.61 % (3500825)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3503019442:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.19/0.61 % (3500826)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2470243580:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.19/0.61 % (3500827)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3155589274:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.19/0.61 % (3500822)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=866455952:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.19/0.61 % (3500824)Instruction limit reached!
% 1.19/0.61 % (3500824)------------------------------
% 1.19/0.61 % (3500824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.19/0.61 % (3500824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.19/0.61 % (3500824)CaDiCaL version: 2.1.3
% 1.19/0.61 % (3500824)Termination reason: Instruction limit
% 1.19/0.61 % (3500824)Termination phase: Saturation
% 1.19/0.61 % (3500824)Time elapsed: 0.067 s
% 1.19/0.61 % (3500824)Peak memory usage: 13 MB
% 1.19/0.61 % (3500824)Instructions burned: 104 (million)
% 1.19/0.61 % (3500825)Instruction limit reached!
% 1.19/0.61 % (3500825)------------------------------
% 1.19/0.61 % (3500825)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.19/0.61 % (3500825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.19/0.61 % (3500825)CaDiCaL version: 2.1.3
% 1.19/0.61 % (3500825)Termination reason: Instruction limit
% 1.19/0.61 % (3500825)Termination phase: Saturation
% 1.19/0.61 % (3500825)Time elapsed: 0.068 s
% 1.19/0.61 % (3500825)Peak memory usage: 13 MB
% 1.19/0.61 % (3500825)Instructions burned: 116 (million)
% 1.19/0.61 % (3500826)Instruction limit reached!
% 1.19/0.61 % (3500826)------------------------------
% 1.19/0.61 % (3500826)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.19/0.61 % (3500826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.19/0.61 % (3500826)CaDiCaL version: 2.1.3
% 1.19/0.61 % (3500826)Termination reason: Instruction limit
% 1.19/0.61 % (3500826)Termination phase: Saturation
% 1.19/0.61 % (3500826)Time elapsed: 0.077 s
% 1.19/0.61 % (3500826)Peak memory usage: 13 MB
% 1.19/0.61 % (3500826)Instructions burned: 132 (million)
% 1.19/0.61 % (3500835)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1985718485:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.19/0.61 % (3500836)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=574651693:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.19/0.61 % (3500837)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2137602438:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.19/0.61 % (3500827)Instruction limit reached!
% 1.19/0.61 % (3500827)------------------------------
% 1.19/0.61 % (3500827)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.19/0.61 % (3500827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.19/0.61 % (3500827)CaDiCaL version: 2.1.3
% 1.19/0.61 % (3500827)Termination reason: Instruction limit
% 1.19/0.61 % (3500827)Termination phase: Saturation
% 1.19/0.61 % (3500827)Time elapsed: 0.112 s
% 1.19/0.61 % (3500827)Peak memory usage: 14 MB
% 1.19/0.61 % (3500827)Instructions burned: 162 (million)
% 1.19/0.61 % (3500841)ott-21_1_sil=16000:fs=off:random_seed=3916815940:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.19/0.61 % (3500837) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3500816-3500837"...
% 1.19/0.61 % (3500837)...printing done.
% 1.19/0.61 % (3500837)Refutation found. Thanks to Tanya!
% 1.19/0.61 % SZS status Unsatisfiable for theBenchmark
% 1.19/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 1.19/0.61 % (3500837)------------------------------
% 1.19/0.61 % (3500837)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.19/0.61 % (3500837)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.19/0.61 % (3500837)CaDiCaL version: 2.1.3
% 1.19/0.61 % (3500837)Termination reason: Refutation
% 1.19/0.61 % (3500837)Time elapsed: 0.067 s
% 1.19/0.61 % (3500837)Peak memory usage: 13 MB
% 1.19/0.61 % (3500837)Instructions burned: 85 (million)
% 1.19/0.61 % (3500816)Success in time 0.203 s
% 1.19/0.61 % Vampire exiting
%------------------------------------------------------------------------------