%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU382+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 : n011.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:53:05 PM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 26 unt; 0 def)
% Number of atoms : 80 ( 33 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 59 ( 23 ~; 17 |; 14 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 56 ( 55 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( rel_str(X0)
=> ( strict_rel_str(X0)
=> X0 = rel_str_of(the_carrier(X0),the_InternalRel(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',abstractness_v1_orders_2) ).
fof(f27,axiom,
! [X0] : incl_POSet(X0) = rel_str_of(X0,inclusion_order(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_yellow_1) ).
fof(f31,axiom,
! [X0] :
( reflexive(inclusion_order(X0))
& antisymmetric(inclusion_order(X0))
& transitive(inclusion_order(X0))
& v1_partfun1(inclusion_order(X0),X0,X0)
& relation_of2_as_subset(inclusion_order(X0),X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_yellow_1) ).
fof(f33,axiom,
! [X0] :
( strict_rel_str(incl_POSet(X0))
& rel_str(incl_POSet(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_yellow_1) ).
fof(f60,axiom,
! [X0,X1] :
( relation_of2(X1,X0,X0)
=> ! [X2,X3] :
( rel_str_of(X0,X1) = rel_str_of(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',free_g1_orders_2) ).
fof(f77,axiom,
! [X0] : inclusion_order(X0) = inclusion_relation(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k1_yellow_1) ).
fof(f78,axiom,
! [X0,X1,X2] :
( relation_of2_as_subset(X2,X0,X1)
<=> relation_of2(X2,X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(f84,conjecture,
! [X0] : the_carrier(boole_POSet(X0)) = powerset(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_waybel_7) ).
fof(f85,negated_conjecture,
~ ! [X0] : the_carrier(boole_POSet(X0)) = powerset(X0),
inference(negated_conjecture,[status(cth)],[f84]) ).
fof(f86,axiom,
! [X0] : boole_POSet(X0) = incl_POSet(powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_yellow_1) ).
fof(f93,plain,
! [X0] :
( reflexive(inclusion_order(X0))
& antisymmetric(inclusion_order(X0))
& transitive(inclusion_order(X0))
& relation_of2_as_subset(inclusion_order(X0),X0,X0) ),
inference(pure_predicate_removal,[],[f31]) ).
fof(f94,plain,
! [X0] :
( reflexive(inclusion_order(X0))
& antisymmetric(inclusion_order(X0))
& relation_of2_as_subset(inclusion_order(X0),X0,X0) ),
inference(pure_predicate_removal,[],[f93]) ).
fof(f95,plain,
! [X0] :
( reflexive(inclusion_order(X0))
& relation_of2_as_subset(inclusion_order(X0),X0,X0) ),
inference(pure_predicate_removal,[],[f94]) ).
fof(f96,plain,
! [X0] : relation_of2_as_subset(inclusion_order(X0),X0,X0),
inference(pure_predicate_removal,[],[f95]) ).
fof(f99,plain,
! [X0] :
( X0 = rel_str_of(the_carrier(X0),the_InternalRel(X0))
| ~ strict_rel_str(X0)
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f100,plain,
! [X0] :
( X0 = rel_str_of(the_carrier(X0),the_InternalRel(X0))
| ~ strict_rel_str(X0)
| ~ rel_str(X0) ),
inference(flattening,[],[f99]) ).
fof(f161,plain,
! [X0,X1] :
( ! [X2,X3] :
( ( X0 = X2
& X1 = X3 )
| rel_str_of(X0,X1) != rel_str_of(X2,X3) )
| ~ relation_of2(X1,X0,X0) ),
inference(ennf_transformation,[],[f60]) ).
fof(f173,plain,
? [X0] : powerset(X0) != the_carrier(boole_POSet(X0)),
inference(ennf_transformation,[],[f85]) ).
fof(f214,plain,
! [X0,X1,X2] :
( ( relation_of2_as_subset(X2,X0,X1)
| ~ relation_of2(X2,X0,X1) )
& ( relation_of2(X2,X0,X1)
| ~ relation_of2_as_subset(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f78]) ).
fof(f215,plain,
powerset(sK26) != the_carrier(boole_POSet(sK26)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK26]),skolemize(X0,sK26)],[f173]) ).
fof(f216,plain,
! [X0] :
( ~ strict_rel_str(X0)
| rel_str_of(the_carrier(X0),the_InternalRel(X0)) = X0
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f323,plain,
! [X0] : incl_POSet(X0) = rel_str_of(X0,inclusion_order(X0)),
inference(cnf_transformation,[],[f27]) ).
fof(f326,plain,
! [X0] : relation_of2_as_subset(inclusion_order(X0),X0,X0),
inference(cnf_transformation,[],[f96]) ).
fof(f327,plain,
! [X0] : rel_str(incl_POSet(X0)),
inference(cnf_transformation,[],[f33]) ).
fof(f328,plain,
! [X0] : strict_rel_str(incl_POSet(X0)),
inference(cnf_transformation,[],[f33]) ).
fof(f400,plain,
! [X2,X3,X0,X1] :
( rel_str_of(X0,X1) != rel_str_of(X2,X3)
| X0 = X2
| ~ relation_of2(X1,X0,X0) ),
inference(cnf_transformation,[],[f161]) ).
fof(f493,plain,
! [X0] : inclusion_order(X0) = inclusion_relation(X0),
inference(cnf_transformation,[],[f77]) ).
fof(f494,plain,
! [X2,X0,X1] :
( ~ relation_of2_as_subset(X2,X0,X1)
| relation_of2(X2,X0,X1) ),
inference(cnf_transformation,[],[f214]) ).
fof(f501,plain,
powerset(sK26) != the_carrier(boole_POSet(sK26)),
inference(cnf_transformation,[],[f215]) ).
fof(f502,plain,
! [X0] : boole_POSet(X0) = incl_POSet(powerset(X0)),
inference(cnf_transformation,[],[f86]) ).
fof(f507,plain,
! [X0] : incl_POSet(X0) = rel_str_of(X0,inclusion_relation(X0)),
inference(definition_unfolding,[],[f323,f493]) ).
fof(f508,plain,
! [X0] : boole_POSet(X0) = rel_str_of(powerset(X0),inclusion_relation(powerset(X0))),
inference(definition_unfolding,[],[f502,f507]) ).
fof(f509,plain,
! [X0] : relation_of2_as_subset(inclusion_relation(X0),X0,X0),
inference(definition_unfolding,[],[f326,f493]) ).
fof(f510,plain,
! [X0] : strict_rel_str(rel_str_of(X0,inclusion_relation(X0))),
inference(definition_unfolding,[],[f328,f507]) ).
fof(f511,plain,
! [X0] : rel_str(rel_str_of(X0,inclusion_relation(X0))),
inference(definition_unfolding,[],[f327,f507]) ).
fof(f568,plain,
powerset(sK26) != the_carrier(rel_str_of(powerset(sK26),inclusion_relation(powerset(sK26)))),
inference(definition_unfolding,[],[f501,f508]) ).
fof(f704,plain,
! [X0] : relation_of2(inclusion_relation(X0),X0,X0),
inference(resolution,[],[f494,f509]) ).
fof(f806,plain,
! [X0] :
( rel_str_of(X0,inclusion_relation(X0)) = rel_str_of(the_carrier(rel_str_of(X0,inclusion_relation(X0))),the_InternalRel(rel_str_of(X0,inclusion_relation(X0))))
| ~ rel_str(rel_str_of(X0,inclusion_relation(X0))) ),
inference(resolution,[],[f216,f510]) ).
fof(f821,plain,
! [X0] : rel_str_of(X0,inclusion_relation(X0)) = rel_str_of(the_carrier(rel_str_of(X0,inclusion_relation(X0))),the_InternalRel(rel_str_of(X0,inclusion_relation(X0)))),
inference(forward_subsumption_resolution,[],[f806,f511]) ).
fof(f1318,plain,
! [X2,X0,X1] :
( rel_str_of(X0,inclusion_relation(X0)) != rel_str_of(X1,X2)
| the_carrier(rel_str_of(X0,inclusion_relation(X0))) = X1
| ~ relation_of2(X2,X1,X1) ),
inference(superposition,[],[f400,f821]) ).
fof(f1862,plain,
! [X0] :
( the_carrier(rel_str_of(X0,inclusion_relation(X0))) = X0
| ~ relation_of2(inclusion_relation(X0),X0,X0) ),
inference(equality_resolution,[],[f1318]) ).
fof(f1863,plain,
! [X0] : the_carrier(rel_str_of(X0,inclusion_relation(X0))) = X0,
inference(forward_subsumption_resolution,[],[f1862,f704]) ).
fof(f1978,plain,
powerset(sK26) != powerset(sK26),
inference(superposition,[],[f568,f1863]) ).
fof(f1993,plain,
$false,
inference(trivial_inequality_removal,[],[f1978]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU382+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.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 05:02:01 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.15/0.46 % (3029116)Will run a generic schedule for satisfiability detection.
% 0.15/0.46 % (3029124)dis+10_1_sil=32000:sp=arity:random_seed=177145699:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.46 % (3029122)% WARNING: option uhcvi not known.
% 0.15/0.46 % (3029121)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1030849139_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.46 % (3029125)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3922849682:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.46 % (3029122)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2100370151:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.46 % (3029123)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4280541527:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.46 % (3029127)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3578096603:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.46 % (3029126)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1032786188:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.46 % (3029124) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3029116-3029124"...
% 0.15/0.46 % (3029124)...printing done.
% 0.15/0.46 % TRYING [1]
% 0.15/0.46 % (3029124)Refutation found. Thanks to Tanya!
% 0.15/0.46 % SZS status Theorem for theBenchmark
% 0.15/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46 % (3029124)------------------------------
% 0.15/0.46 % (3029124)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.46 % (3029124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.46 % (3029124)CaDiCaL version: 2.1.3
% 0.15/0.46 % (3029124)Termination reason: Refutation
% 0.15/0.46 % (3029124)Time elapsed: 0.016 s
% 0.15/0.46 % (3029124)Peak memory usage: 12 MB
% 0.15/0.46 % (3029124)Instructions burned: 44 (million)
% 0.15/0.46 % (3029116)Success in time 0.045 s
% 0.15/0.46 % Vampire exiting
%------------------------------------------------------------------------------