%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU368+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:02 PM UTC 2026
% Result : Theorem 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 50 ( 17 unt; 2 def)
% Number of atoms : 100 ( 43 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 88 ( 38 ~; 33 |; 10 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 3 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn 53 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f33,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/sandbox/benchmark/theBenchmark.p',free_g1_orders_2) ).
fof(f34,axiom,
! [X0] :
( rel_str(X0)
=> ( strict_rel_str(X0)
=> X0 = rel_str_of(the_carrier(X0),the_InternalRel(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',abstractness_v1_orders_2) ).
fof(f38,axiom,
! [X0,X1,X2] :
( relation_of2_as_subset(X2,X0,X1)
<=> relation_of2(X2,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(f47,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/sandbox/benchmark/theBenchmark.p',dt_k1_yellow_1) ).
fof(f48,axiom,
! [X0] :
( strict_rel_str(incl_POSet(X0))
& rel_str(incl_POSet(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_yellow_1) ).
fof(f52,axiom,
! [X0] : incl_POSet(X0) = rel_str_of(X0,inclusion_order(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_yellow_1) ).
fof(f53,conjecture,
! [X0] :
( the_carrier(incl_POSet(X0)) = X0
& the_InternalRel(incl_POSet(X0)) = inclusion_order(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_yellow_1) ).
fof(f54,negated_conjecture,
~ ! [X0] :
( the_carrier(incl_POSet(X0)) = X0
& the_InternalRel(incl_POSet(X0)) = inclusion_order(X0) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f83,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,[],[f33]) ).
fof(f84,plain,
! [X0] :
( X0 = rel_str_of(the_carrier(X0),the_InternalRel(X0))
| ~ strict_rel_str(X0)
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f34]) ).
fof(f85,plain,
! [X0] :
( X0 = rel_str_of(the_carrier(X0),the_InternalRel(X0))
| ~ strict_rel_str(X0)
| ~ rel_str(X0) ),
inference(flattening,[],[f84]) ).
fof(f92,plain,
? [X0] :
( the_carrier(incl_POSet(X0)) != X0
| inclusion_order(X0) != the_InternalRel(incl_POSet(X0)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f105,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,[],[f38]) ).
fof(f107,plain,
( sK13 != the_carrier(incl_POSet(sK13))
| inclusion_order(sK13) != the_InternalRel(incl_POSet(sK13)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X0,sK13)],[f92]) ).
fof(f151,plain,
! [X2,X3,X0,X1] :
( rel_str_of(X0,X1) != rel_str_of(X2,X3)
| X1 = X3
| ~ relation_of2(X1,X0,X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f152,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,[],[f83]) ).
fof(f153,plain,
! [X0] :
( ~ strict_rel_str(X0)
| rel_str_of(the_carrier(X0),the_InternalRel(X0)) = X0
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f157,plain,
! [X2,X0,X1] :
( ~ relation_of2_as_subset(X2,X0,X1)
| relation_of2(X2,X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f170,plain,
! [X0] : relation_of2_as_subset(inclusion_order(X0),X0,X0),
inference(cnf_transformation,[],[f47]) ).
fof(f175,plain,
! [X0] : rel_str(incl_POSet(X0)),
inference(cnf_transformation,[],[f48]) ).
fof(f176,plain,
! [X0] : strict_rel_str(incl_POSet(X0)),
inference(cnf_transformation,[],[f48]) ).
fof(f182,plain,
! [X0] : incl_POSet(X0) = rel_str_of(X0,inclusion_order(X0)),
inference(cnf_transformation,[],[f52]) ).
fof(f183,plain,
( sK13 != the_carrier(incl_POSet(sK13))
| inclusion_order(sK13) != the_InternalRel(incl_POSet(sK13)) ),
inference(cnf_transformation,[],[f107]) ).
fof(f189,plain,
! [X0] : strict_rel_str(rel_str_of(X0,inclusion_order(X0))),
inference(definition_unfolding,[],[f176,f182]) ).
fof(f190,plain,
! [X0] : rel_str(rel_str_of(X0,inclusion_order(X0))),
inference(definition_unfolding,[],[f175,f182]) ).
fof(f195,plain,
( sK13 != the_carrier(rel_str_of(sK13,inclusion_order(sK13)))
| inclusion_order(sK13) != the_InternalRel(rel_str_of(sK13,inclusion_order(sK13))) ),
inference(definition_unfolding,[],[f183,f182,f182]) ).
fof(f197,definition,
( spl14_1
<=> inclusion_order(sK13) = the_InternalRel(rel_str_of(sK13,inclusion_order(sK13))) ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f199,plain,
( inclusion_order(sK13) != the_InternalRel(rel_str_of(sK13,inclusion_order(sK13)))
| spl14_1 ),
inference(avatar_component_clause,[],[f197]) ).
fof(f201,definition,
( spl14_2
<=> sK13 = the_carrier(rel_str_of(sK13,inclusion_order(sK13))) ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f203,plain,
( sK13 != the_carrier(rel_str_of(sK13,inclusion_order(sK13)))
| spl14_2 ),
inference(avatar_component_clause,[],[f201]) ).
fof(f204,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f195,f201,f197]) ).
fof(f230,plain,
! [X0] : relation_of2(inclusion_order(X0),X0,X0),
inference(resolution,[],[f157,f170]) ).
fof(f290,plain,
! [X0] :
( rel_str_of(X0,inclusion_order(X0)) = rel_str_of(the_carrier(rel_str_of(X0,inclusion_order(X0))),the_InternalRel(rel_str_of(X0,inclusion_order(X0))))
| ~ rel_str(rel_str_of(X0,inclusion_order(X0))) ),
inference(resolution,[],[f153,f189]) ).
fof(f293,plain,
! [X0] : rel_str_of(X0,inclusion_order(X0)) = rel_str_of(the_carrier(rel_str_of(X0,inclusion_order(X0))),the_InternalRel(rel_str_of(X0,inclusion_order(X0)))),
inference(forward_subsumption_resolution,[],[f290,f190]) ).
fof(f430,plain,
! [X2,X0,X1] :
( rel_str_of(X0,inclusion_order(X0)) != rel_str_of(X1,X2)
| the_carrier(rel_str_of(X0,inclusion_order(X0))) = X1
| ~ relation_of2(X2,X1,X1) ),
inference(superposition,[],[f152,f293]) ).
fof(f432,plain,
! [X2,X0,X1] :
( rel_str_of(X0,inclusion_order(X0)) != rel_str_of(X1,X2)
| the_InternalRel(rel_str_of(X0,inclusion_order(X0))) = X2
| ~ relation_of2(X2,X1,X1) ),
inference(superposition,[],[f151,f293]) ).
fof(f616,plain,
! [X0] :
( the_carrier(rel_str_of(X0,inclusion_order(X0))) = X0
| ~ relation_of2(inclusion_order(X0),X0,X0) ),
inference(equality_resolution,[],[f430]) ).
fof(f617,plain,
! [X0] : the_carrier(rel_str_of(X0,inclusion_order(X0))) = X0,
inference(forward_subsumption_resolution,[],[f616,f230]) ).
fof(f671,plain,
! [X0] :
( inclusion_order(X0) = the_InternalRel(rel_str_of(X0,inclusion_order(X0)))
| ~ relation_of2(inclusion_order(X0),X0,X0) ),
inference(equality_resolution,[],[f432]) ).
fof(f672,plain,
! [X0] : inclusion_order(X0) = the_InternalRel(rel_str_of(X0,inclusion_order(X0))),
inference(forward_subsumption_resolution,[],[f671,f230]) ).
fof(f679,plain,
( inclusion_order(sK13) != inclusion_order(sK13)
| spl14_1 ),
inference(superposition,[],[f199,f672]) ).
fof(f694,plain,
( $false
| spl14_1 ),
inference(trivial_inequality_removal,[],[f679]) ).
fof(f695,plain,
spl14_1,
inference(avatar_contradiction_clause,[],[f694]) ).
fof(f729,plain,
( $false
| spl14_2 ),
inference(forward_subsumption_resolution,[],[f203,f617]) ).
fof(f730,plain,
spl14_2,
inference(avatar_contradiction_clause,[],[f729]) ).
cnf(s1,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(sat_conversion,[],[f204]) ).
cnf(s20,plain,
spl14_1,
inference(sat_conversion,[],[f695]) ).
cnf(s21,plain,
spl14_2,
inference(sat_conversion,[],[f730]) ).
cnf(s28,plain,
$false,
inference(rat,[],[s1,s21,s20]) ).
fof(f731,plain,
$false,
inference(avatar_sat_refutation,[],[s28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU368+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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 04:58:27 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.19/0.46 % (3026485)Will run a generic schedule for satisfiability detection.
% 0.19/0.46 % (3026495)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2944252571:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.46 % (3026491)% WARNING: option uhcvi not known.
% 0.19/0.46 % (3026490)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2448213673_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.46 % (3026492)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1875866429:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.46 % (3026493)dis+10_1_sil=32000:sp=arity:random_seed=2629998964:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.46 % (3026494)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=243898840:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.46 % (3026496)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4143049491:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.46 % (3026491)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3499396417:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.46 % TRYING [1]
% 0.19/0.46 % TRYING [2]
% 0.19/0.46 % TRYING [3]
% 0.19/0.46 % TRYING [4]
% 0.19/0.46 % TRYING [5]
% 0.19/0.46 % (3026493) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3026485-3026493"...
% 0.19/0.46 % (3026493)...printing done.
% 0.19/0.46 % (3026493)Refutation found. Thanks to Tanya!
% 0.19/0.46 % SZS status Theorem for theBenchmark
% 0.19/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46 % (3026493)------------------------------
% 0.19/0.46 % (3026493)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.46 % (3026493)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.46 % (3026493)CaDiCaL version: 2.1.3
% 0.19/0.46 % (3026493)Termination reason: Refutation
% 0.19/0.46 % (3026493)Time elapsed: 0.016 s
% 0.19/0.46 % (3026493)Peak memory usage: 12 MB
% 0.19/0.46 % (3026493)Instructions burned: 21 (million)
% 0.19/0.46 % (3026485)Success in time 0.048 s
% 0.19/0.46 % Vampire exiting
%------------------------------------------------------------------------------