%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU268+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 : n012.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:40 PM UTC 2026
% Result : Theorem 0.08s 0.37s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 21 unt; 0 def)
% Number of atoms : 109 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 120 ( 55 ~; 46 |; 4 &)
% ( 10 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 69 ( 68 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(X2,X1)
=> in(ordered_pair(X2,X2),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_2) ).
fof(f10,axiom,
! [X0,X1] :
( relation(X1)
=> ( X1 = inclusion_relation(X0)
<=> ( relation_field(X1) = X0
& ! [X2,X3] :
( ( in(X2,X0)
& in(X3,X0) )
=> ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_wellord2) ).
fof(f11,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f13,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_relat_2) ).
fof(f16,axiom,
! [X0] : relation(inclusion_relation(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_wellord2) ).
fof(f41,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f45,conjecture,
! [X0] : reflexive(inclusion_relation(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_wellord2) ).
fof(f46,negated_conjecture,
~ ! [X0] : reflexive(inclusion_relation(X0)),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f54,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f41]) ).
fof(f69,plain,
! [X0] :
( ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,X1) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f70,plain,
! [X0,X1] :
( ( X1 = inclusion_relation(X0)
<=> ( relation_field(X1) = X0
& ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) )
| ~ in(X2,X0)
| ~ in(X3,X0) ) ) )
| ~ relation(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f71,plain,
! [X0,X1] :
( ( X1 = inclusion_relation(X0)
<=> ( relation_field(X1) = X0
& ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
<=> subset(X2,X3) )
| ~ in(X2,X0)
| ~ in(X3,X0) ) ) )
| ~ relation(X1) ),
inference(flattening,[],[f70]) ).
fof(f73,plain,
! [X0] :
( ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f79,plain,
? [X0] : ~ reflexive(inclusion_relation(X0)),
inference(ennf_transformation,[],[f46]) ).
fof(f94,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f7]) ).
fof(f97,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| in(sK0(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f98,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ in(ordered_pair(sK0(X0,X1),sK0(X0,X1)),X0)
| is_reflexive_in(X0,X1) ),
inference(cnf_transformation,[],[f69]) ).
fof(f99,plain,
! [X2,X3,X0,X1] :
( ~ relation(X1)
| ~ in(X3,X0)
| ~ in(X2,X0)
| ~ subset(X2,X3)
| in(ordered_pair(X2,X3),X1)
| inclusion_relation(X0) != X1 ),
inference(cnf_transformation,[],[f71]) ).
fof(f105,plain,
! [X0,X1] :
( ~ relation(X1)
| relation_field(X1) = X0
| inclusion_relation(X0) != X1 ),
inference(cnf_transformation,[],[f71]) ).
fof(f106,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f11]) ).
fof(f108,plain,
! [X0] :
( reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f110,plain,
! [X0] : relation(inclusion_relation(X0)),
inference(cnf_transformation,[],[f16]) ).
fof(f147,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f54]) ).
fof(f151,plain,
~ reflexive(inclusion_relation(sK13)),
inference(cnf_transformation,[],[f79]) ).
fof(f159,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| ~ in(unordered_pair(unordered_pair(sK0(X0,X1),sK0(X0,X1)),singleton(sK0(X0,X1))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f98,f106]) ).
fof(f164,plain,
! [X2,X3,X0,X1] :
( ~ relation(X1)
| ~ in(X3,X0)
| ~ in(X2,X0)
| ~ subset(X2,X3)
| in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),X1)
| inclusion_relation(X0) != X1 ),
inference(definition_unfolding,[],[f99,f106]) ).
fof(f166,plain,
! [X0] :
( ~ relation(inclusion_relation(X0))
| relation_field(inclusion_relation(X0)) = X0 ),
inference(equality_resolution,[],[f105]) ).
fof(f172,plain,
! [X2,X3,X0] :
( ~ relation(inclusion_relation(X0))
| ~ in(X3,X0)
| ~ in(X2,X0)
| ~ subset(X2,X3)
| in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),inclusion_relation(X0)) ),
inference(equality_resolution,[],[f164]) ).
fof(f173,plain,
! [X2,X3,X0] :
( ~ in(X3,X0)
| ~ in(X2,X0)
| ~ subset(X2,X3)
| in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),inclusion_relation(X0)) ),
inference(forward_subsumption_resolution,[],[f172,f110]) ).
fof(f175,plain,
! [X0] : relation_field(inclusion_relation(X0)) = X0,
inference(forward_subsumption_resolution,[],[f166,f110]) ).
fof(f176,plain,
! [X2,X3,X0] :
( ~ subset(X2,X3)
| ~ in(X3,X0)
| ~ in(X2,X0)
| in(unordered_pair(singleton(X2),unordered_pair(X2,X3)),inclusion_relation(X0)) ),
inference(forward_demodulation,[],[f173,f94]) ).
fof(f234,plain,
( ~ is_reflexive_in(inclusion_relation(sK13),relation_field(inclusion_relation(sK13)))
| ~ relation(inclusion_relation(sK13)) ),
inference(resolution,[],[f108,f151]) ).
fof(f235,plain,
~ is_reflexive_in(inclusion_relation(sK13),relation_field(inclusion_relation(sK13))),
inference(forward_subsumption_resolution,[],[f234,f110]) ).
fof(f236,plain,
~ is_reflexive_in(inclusion_relation(sK13),sK13),
inference(forward_demodulation,[],[f235,f175]) ).
fof(f255,plain,
( in(sK0(inclusion_relation(sK13),sK13),sK13)
| ~ relation(inclusion_relation(sK13)) ),
inference(resolution,[],[f97,f236]) ).
fof(f256,plain,
in(sK0(inclusion_relation(sK13),sK13),sK13),
inference(forward_subsumption_resolution,[],[f255,f110]) ).
fof(f350,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X0,X1)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X0)),inclusion_relation(X1)) ),
inference(resolution,[],[f176,f147]) ).
fof(f352,plain,
! [X0,X1] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X0)),inclusion_relation(X1))
| ~ in(X0,X1) ),
inference(duplicate_literal_removal,[],[f350]) ).
fof(f357,plain,
( ~ in(unordered_pair(unordered_pair(sK0(inclusion_relation(sK13),sK13),sK0(inclusion_relation(sK13),sK13)),singleton(sK0(inclusion_relation(sK13),sK13))),inclusion_relation(sK13))
| ~ relation(inclusion_relation(sK13)) ),
inference(resolution,[],[f159,f236]) ).
fof(f361,plain,
~ in(unordered_pair(unordered_pair(sK0(inclusion_relation(sK13),sK13),sK0(inclusion_relation(sK13),sK13)),singleton(sK0(inclusion_relation(sK13),sK13))),inclusion_relation(sK13)),
inference(forward_subsumption_resolution,[],[f357,f110]) ).
fof(f363,plain,
~ in(unordered_pair(singleton(sK0(inclusion_relation(sK13),sK13)),unordered_pair(sK0(inclusion_relation(sK13),sK13),sK0(inclusion_relation(sK13),sK13))),inclusion_relation(sK13)),
inference(forward_demodulation,[],[f361,f94]) ).
fof(f513,plain,
~ in(sK0(inclusion_relation(sK13),sK13),sK13),
inference(resolution,[],[f352,f363]) ).
fof(f521,plain,
$false,
inference(forward_subsumption_resolution,[],[f513,f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU268+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Mon Sep 28 04:23:49 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.33 Running first-order model finding
% 0.08/0.33 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.08/0.37 % (3012770)Will run a generic schedule for satisfiability detection.
% 0.08/0.37 % (3012776)% WARNING: option uhcvi not known.
% 0.08/0.37 % (3012778)dis+10_1_sil=32000:sp=arity:random_seed=3359929649:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.37 % (3012777)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2518795088:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.37 % (3012775)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2700017233_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.37 % (3012776)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3628877607:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.37 % (3012779)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2442151180:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.37 % (3012780)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1908285824:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.37 % (3012781)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1685700523:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.37 % TRYING [1]
% 0.08/0.37 % TRYING [2]
% 0.08/0.37 % TRYING [3]
% 0.08/0.37 % (3012779) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3012770-3012779"...
% 0.08/0.37 % (3012778) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3012770-3012778"...
% 0.08/0.37 % (3012779)...printing done.
% 0.08/0.37 % (3012778)...printing done.
% 0.08/0.37 % (3012779)Refutation found. Thanks to Tanya!
% 0.08/0.37 % SZS status Theorem for theBenchmark
% 0.08/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.37 % (3012779)------------------------------
% 0.08/0.37 % (3012779)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.37 % (3012779)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.37 % (3012779)CaDiCaL version: 2.1.3
% 0.08/0.37 % (3012779)Termination reason: Refutation
% 0.08/0.37 % (3012779)Time elapsed: 0.006 s
% 0.08/0.37 % (3012779)Peak memory usage: 12 MB
% 0.08/0.37 % (3012779)Instructions burned: 14 (million)
% 0.08/0.37 % (3012770)Success in time 0.033 s
% 0.08/0.37 % Vampire exiting
%------------------------------------------------------------------------------