%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU308+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 : n004.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:49 PM UTC 2026
% Result : Theorem 0.22s 0.54s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 61 ( 24 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 22 ~; 16 |; 5 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 33 ( 31 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f40,axiom,
! [X0,X1,X2] :
( ( element(X1,powerset(X0))
& element(X2,powerset(X0)) )
=> subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k6_subset_1) ).
fof(f42,axiom,
! [X0] :
( one_sorted_str(X0)
=> element(cast_as_carrier_subset(X0),powerset(the_carrier(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_pre_topc) ).
fof(f51,axiom,
! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(f52,conjecture,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_complement(the_carrier(X0),X1) = subset_difference(the_carrier(X0),cast_as_carrier_subset(X0),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_pre_topc) ).
fof(f53,negated_conjecture,
~ ! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(the_carrier(X0)))
=> subset_complement(the_carrier(X0),X1) = subset_difference(the_carrier(X0),cast_as_carrier_subset(X0),X1) ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f54,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> subset_complement(X0,X1) = set_difference(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_subset_1) ).
fof(f99,plain,
! [X0,X1,X2] :
( subset_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(ennf_transformation,[],[f40]) ).
fof(f100,plain,
! [X0,X1,X2] :
( subset_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X1,powerset(X0))
| ~ element(X2,powerset(X0)) ),
inference(flattening,[],[f99]) ).
fof(f101,plain,
! [X0] :
( element(cast_as_carrier_subset(X0),powerset(the_carrier(X0)))
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f106,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f107,plain,
? [X0] :
( ? [X1] :
( subset_complement(the_carrier(X0),X1) != subset_difference(the_carrier(X0),cast_as_carrier_subset(X0),X1)
& element(X1,powerset(the_carrier(X0))) )
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f108,plain,
! [X0,X1] :
( subset_complement(X0,X1) = set_difference(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f114,plain,
( subset_complement(the_carrier(sK5),sK6) != subset_difference(the_carrier(sK5),cast_as_carrier_subset(sK5),sK6)
& element(sK6,powerset(the_carrier(sK5)))
& one_sorted_str(sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f107]) ).
fof(f184,plain,
! [X2,X0,X1] :
( ~ element(X2,powerset(X0))
| ~ element(X1,powerset(X0))
| subset_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(cnf_transformation,[],[f100]) ).
fof(f185,plain,
! [X0] :
( element(cast_as_carrier_subset(X0),powerset(the_carrier(X0)))
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f190,plain,
! [X0] :
( ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f191,plain,
one_sorted_str(sK5),
inference(cnf_transformation,[],[f114]) ).
fof(f192,plain,
element(sK6,powerset(the_carrier(sK5))),
inference(cnf_transformation,[],[f114]) ).
fof(f193,plain,
subset_complement(the_carrier(sK5),sK6) != subset_difference(the_carrier(sK5),cast_as_carrier_subset(sK5),sK6),
inference(cnf_transformation,[],[f114]) ).
fof(f194,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| set_difference(X0,X1) = subset_complement(X0,X1) ),
inference(cnf_transformation,[],[f108]) ).
fof(f297,plain,
the_carrier(sK5) = cast_as_carrier_subset(sK5),
inference(resolution,[],[f190,f191]) ).
fof(f299,plain,
subset_complement(cast_as_carrier_subset(sK5),sK6) != subset_difference(cast_as_carrier_subset(sK5),cast_as_carrier_subset(sK5),sK6),
inference(superposition,[],[f193,f297]) ).
fof(f503,plain,
( element(cast_as_carrier_subset(sK5),powerset(cast_as_carrier_subset(sK5)))
| ~ one_sorted_str(sK5) ),
inference(superposition,[],[f185,f297]) ).
fof(f506,plain,
element(cast_as_carrier_subset(sK5),powerset(cast_as_carrier_subset(sK5))),
inference(forward_subsumption_resolution,[],[f503,f191]) ).
fof(f606,plain,
subset_complement(the_carrier(sK5),sK6) = set_difference(the_carrier(sK5),sK6),
inference(resolution,[],[f194,f192]) ).
fof(f608,plain,
subset_complement(cast_as_carrier_subset(sK5),sK6) = set_difference(cast_as_carrier_subset(sK5),sK6),
inference(forward_demodulation,[],[f606,f297]) ).
fof(f644,plain,
! [X0] :
( ~ element(X0,powerset(the_carrier(sK5)))
| subset_difference(the_carrier(sK5),X0,sK6) = set_difference(X0,sK6) ),
inference(resolution,[],[f184,f192]) ).
fof(f646,plain,
! [X0] :
( ~ element(X0,powerset(cast_as_carrier_subset(sK5)))
| subset_difference(the_carrier(sK5),X0,sK6) = set_difference(X0,sK6) ),
inference(forward_demodulation,[],[f644,f297]) ).
fof(f649,plain,
! [X0] :
( ~ element(X0,powerset(cast_as_carrier_subset(sK5)))
| set_difference(X0,sK6) = subset_difference(cast_as_carrier_subset(sK5),X0,sK6) ),
inference(forward_demodulation,[],[f646,f297]) ).
fof(f666,plain,
subset_difference(cast_as_carrier_subset(sK5),cast_as_carrier_subset(sK5),sK6) = set_difference(cast_as_carrier_subset(sK5),sK6),
inference(resolution,[],[f649,f506]) ).
fof(f826,plain,
subset_complement(cast_as_carrier_subset(sK5),sK6) != set_difference(cast_as_carrier_subset(sK5),sK6),
inference(superposition,[],[f299,f666]) ).
fof(f828,plain,
$false,
inference(forward_subsumption_resolution,[],[f826,f608]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU308+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.40 % Computer : n004.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Mon Sep 28 04:38:07 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.46 Running first-order model finding
% 0.14/0.46 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.22/0.54 % (4151816)Will run a generic schedule for satisfiability detection.
% 0.22/0.54 % (4151826)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=402055800:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.54 % (4151822)% WARNING: option uhcvi not known.
% 0.22/0.54 % (4151824)dis+10_1_sil=32000:sp=arity:random_seed=1987460059:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.54 % (4151823)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=312003767:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.54 % (4151822)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=644426006:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.54 % (4151825)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2563675450:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.54 % (4151827)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1669887553:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.54 % (4151821)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3010219563_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.54 % TRYING [1]
% 0.22/0.54 % TRYING [2]
% 0.22/0.54 % TRYING [3]
% 0.22/0.54 % TRYING [4]
% 0.22/0.54 % (4151824) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4151816-4151824"...
% 0.22/0.54 % (4151824)...printing done.
% 0.22/0.54 % (4151824)Refutation found. Thanks to Tanya!
% 0.22/0.54 % SZS status Theorem for theBenchmark
% 0.22/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.54 % (4151824)------------------------------
% 0.22/0.54 % (4151824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.54 % (4151824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.54 % (4151824)CaDiCaL version: 2.1.3
% 0.22/0.54 % (4151824)Termination reason: Refutation
% 0.22/0.54 % (4151824)Time elapsed: 0.022 s
% 0.22/0.54 % (4151824)Peak memory usage: 12 MB
% 0.22/0.54 % (4151824)Instructions burned: 20 (million)
% 0.22/0.54 % (4151816)Success in time 0.062 s
% 0.22/0.54 % Vampire exiting
%------------------------------------------------------------------------------