%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU248+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 : n010.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:35 PM UTC 2026
% Result : Theorem 0.42s 0.55s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 6 unt; 0 def)
% Number of atoms : 109 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 125 ( 53 ~; 52 |; 3 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 100 ( 96 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( X2 = relation_rng_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_relat_1) ).
fof(f6,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f7,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
fof(f8,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(f15,axiom,
! [X0,X1] :
( relation(X1)
=> relation(relation_rng_restriction(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k8_relat_1) ).
fof(f21,conjecture,
! [X0,X1] :
( relation(X1)
=> subset(relation_dom(relation_rng_restriction(X0,X1)),relation_dom(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l29_wellord1) ).
fof(f22,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> subset(relation_dom(relation_rng_restriction(X0,X1)),relation_dom(X1)) ),
inference(negated_conjecture,[status(cth)],[f21]) ).
fof(f44,plain,
! [X0,X1] :
( ! [X2] :
( ( X2 = relation_rng_restriction(X0,X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X4,X0)
& in(ordered_pair(X3,X4),X1) ) ) )
| ~ relation(X2) )
| ~ relation(X1) ),
inference(ennf_transformation,[],[f5]) ).
fof(f45,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f46,plain,
! [X0] :
( ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f47,plain,
! [X0,X1] :
( relation(relation_rng_restriction(X0,X1))
| ~ relation(X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f50,plain,
? [X0,X1] :
( ~ subset(relation_dom(relation_rng_restriction(X0,X1)),relation_dom(X1))
& relation(X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f66,plain,
! [X2,X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(X2)
| in(ordered_pair(X3,X4),X1)
| ~ in(ordered_pair(X3,X4),X2)
| relation_rng_restriction(X0,X1) != X2 ),
inference(cnf_transformation,[],[f44]) ).
fof(f70,plain,
! [X0,X1] :
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f71,plain,
! [X0,X1] :
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f72,plain,
! [X2,X3,X0,X1] :
( ~ relation(X0)
| ~ in(ordered_pair(X2,X3),X0)
| in(X2,X1)
| relation_dom(X0) != X1 ),
inference(cnf_transformation,[],[f46]) ).
fof(f73,plain,
! [X2,X0,X1] :
( ~ relation(X0)
| in(ordered_pair(X2,sK4(X0,X2)),X0)
| ~ in(X2,X1)
| relation_dom(X0) != X1 ),
inference(cnf_transformation,[],[f46]) ).
fof(f76,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f8]) ).
fof(f77,plain,
! [X0,X1] :
( relation(relation_rng_restriction(X0,X1))
| ~ relation(X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f83,plain,
relation(sK8),
inference(cnf_transformation,[],[f50]) ).
fof(f84,plain,
~ subset(relation_dom(relation_rng_restriction(sK7,sK8)),relation_dom(sK8)),
inference(cnf_transformation,[],[f50]) ).
fof(f106,plain,
! [X2,X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(X2)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X2)
| relation_rng_restriction(X0,X1) != X2 ),
inference(definition_unfolding,[],[f66,f76,f76]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ relation(X0)
| in(unordered_pair(unordered_pair(X2,sK4(X0,X2)),singleton(X2)),X0)
| ~ in(X2,X1)
| relation_dom(X0) != X1 ),
inference(definition_unfolding,[],[f73,f76]) ).
fof(f113,plain,
! [X2,X3,X0,X1] :
( ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),X0)
| in(X2,X1)
| relation_dom(X0) != X1 ),
inference(definition_unfolding,[],[f72,f76]) ).
fof(f117,plain,
! [X3,X0,X1,X4] :
( ~ relation(X1)
| ~ relation(relation_rng_restriction(X0,X1))
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1)) ),
inference(equality_resolution,[],[f106]) ).
fof(f118,plain,
! [X2,X0] :
( in(unordered_pair(unordered_pair(X2,sK4(X0,X2)),singleton(X2)),X0)
| ~ relation(X0)
| ~ in(X2,relation_dom(X0)) ),
inference(equality_resolution,[],[f112]) ).
fof(f119,plain,
! [X2,X3,X0] :
( ~ in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),X0)
| ~ relation(X0)
| in(X2,relation_dom(X0)) ),
inference(equality_resolution,[],[f113]) ).
fof(f131,plain,
! [X3,X0,X1,X4] :
( ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),relation_rng_restriction(X0,X1))
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1)
| ~ relation(X1) ),
inference(forward_subsumption_resolution,[],[f117,f77]) ).
fof(f132,plain,
! [X2,X0,X1] :
( in(unordered_pair(unordered_pair(X0,sK4(relation_rng_restriction(X1,X2),X0)),singleton(X0)),X2)
| ~ relation(X2)
| ~ relation(relation_rng_restriction(X1,X2))
| ~ in(X0,relation_dom(relation_rng_restriction(X1,X2))) ),
inference(resolution,[],[f131,f118]) ).
fof(f133,plain,
! [X2,X0,X1] :
( in(unordered_pair(unordered_pair(X0,sK4(relation_rng_restriction(X1,X2),X0)),singleton(X0)),X2)
| ~ relation(X2)
| ~ in(X0,relation_dom(relation_rng_restriction(X1,X2))) ),
inference(forward_subsumption_resolution,[],[f132,f77]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ relation(X0)
| ~ in(X1,relation_dom(relation_rng_restriction(X2,X0)))
| ~ relation(X0)
| in(X1,relation_dom(X0)) ),
inference(resolution,[],[f133,f119]) ).
fof(f139,plain,
! [X2,X0,X1] :
( ~ in(X1,relation_dom(relation_rng_restriction(X2,X0)))
| ~ relation(X0)
| in(X1,relation_dom(X0)) ),
inference(duplicate_literal_removal,[],[f134]) ).
fof(f142,plain,
! [X2,X0,X1] :
( in(sK2(relation_dom(relation_rng_restriction(X1,X0)),X2),relation_dom(X0))
| ~ relation(X0)
| subset(relation_dom(relation_rng_restriction(X1,X0)),X2) ),
inference(resolution,[],[f139,f70]) ).
fof(f146,plain,
! [X0,X1] :
( ~ relation(X0)
| subset(relation_dom(relation_rng_restriction(X1,X0)),relation_dom(X0))
| subset(relation_dom(relation_rng_restriction(X1,X0)),relation_dom(X0)) ),
inference(resolution,[],[f142,f71]) ).
fof(f148,plain,
! [X0,X1] :
( subset(relation_dom(relation_rng_restriction(X1,X0)),relation_dom(X0))
| ~ relation(X0) ),
inference(duplicate_literal_removal,[],[f146]) ).
fof(f150,plain,
~ relation(sK8),
inference(resolution,[],[f148,f84]) ).
fof(f152,plain,
$false,
inference(forward_subsumption_resolution,[],[f150,f83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU248+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n010.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.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 04:19:33 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
% 0.42/0.55 % (1551712)Will run a generic schedule for satisfiability detection.
% 0.42/0.55 % (1551717)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=717219071_2999 on theBenchmark for (2999ds/0Mi)
% 0.42/0.55 % TRYING [1]
% 0.42/0.55 % TRYING [2]
% 0.42/0.55 % TRYING [3]
% 0.42/0.55 % (1551719)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3261067991:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.42/0.55 % (1551720)dis+10_1_sil=32000:sp=arity:random_seed=341796290:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.42/0.55 % (1551721)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3784405878:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.42/0.55 % (1551722)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2129916021:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.42/0.55 % (1551723)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=959991907:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.42/0.55 % (1551718)% WARNING: option uhcvi not known.
% 0.42/0.55 % (1551718)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2090558137:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.42/0.55 % TRYING [4]
% 0.42/0.55 % (1551720)Instruction limit reached!
% 0.42/0.55 % (1551720)------------------------------
% 0.42/0.55 % (1551720)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.55 % (1551720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.55 % (1551720)CaDiCaL version: 2.1.3
% 0.42/0.55 % (1551720)Termination reason: Instruction limit
% 0.42/0.55 % (1551720)Termination phase: Saturation
% 0.42/0.55 % (1551720)Time elapsed: 0.066 s
% 0.42/0.55 % (1551720)Peak memory usage: 12 MB
% 0.42/0.55 % (1551720)Instructions burned: 104 (million)
% 0.42/0.55 % (1551721)Instruction limit reached!
% 0.42/0.55 % (1551721)------------------------------
% 0.42/0.55 % (1551721)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.55 % (1551721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.55 % (1551721)CaDiCaL version: 2.1.3
% 0.42/0.55 % (1551721)Termination reason: Instruction limit
% 0.42/0.55 % (1551721)Termination phase: Saturation
% 0.42/0.55 % (1551721)Time elapsed: 0.074 s
% 0.42/0.55 % (1551721)Peak memory usage: 13 MB
% 0.42/0.55 % (1551721)Instructions burned: 117 (million)
% 0.42/0.55 % (1551722)Instruction limit reached!
% 0.42/0.55 % (1551722)------------------------------
% 0.42/0.55 % (1551722)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.55 % (1551722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.55 % (1551722)CaDiCaL version: 2.1.3
% 0.42/0.55 % (1551722)Termination reason: Instruction limit
% 0.42/0.55 % (1551722)Termination phase: Saturation
% 0.42/0.55 % (1551722)Time elapsed: 0.077 s
% 0.42/0.55 % (1551722)Peak memory usage: 13 MB
% 0.42/0.55 % (1551722)Instructions burned: 134 (million)
% 0.42/0.55 % (1551731)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3998563708:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.42/0.55 % TRYING [1]
% 0.42/0.55 % TRYING [2]
% 0.42/0.55 % TRYING [3]
% 0.42/0.55 % (1551732)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2677916470:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.42/0.55 % (1551723)Instruction limit reached!
% 0.42/0.55 % (1551723)------------------------------
% 0.42/0.55 % (1551723)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.55 % (1551723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.55 % (1551723)CaDiCaL version: 2.1.3
% 0.42/0.55 % (1551723)Termination reason: Instruction limit
% 0.42/0.55 % (1551723)Termination phase: Saturation
% 0.42/0.55 % (1551723)Time elapsed: 0.097 s
% 0.42/0.55 % (1551723)Peak memory usage: 14 MB
% 0.42/0.55 % (1551723)Instructions burned: 161 (million)
% 0.42/0.55 % (1551733)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=2560939427:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.42/0.55 % (1551733) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1551712-1551733"...
% 0.42/0.55 % (1551733)...printing done.
% 0.42/0.55 % (1551733)Refutation found. Thanks to Tanya!
% 0.42/0.55 % SZS status Theorem for theBenchmark
% 0.42/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.42/0.55 % (1551733)------------------------------
% 0.42/0.55 % (1551733)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.55 % (1551733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.55 % (1551733)CaDiCaL version: 2.1.3
% 0.42/0.55 % (1551733)Termination reason: Refutation
% 0.42/0.55 % (1551733)Time elapsed: 0.004 s
% 0.42/0.55 % (1551733)Peak memory usage: 12 MB
% 0.42/0.55 % (1551733)Instructions burned: 5 (million)
% 0.42/0.55 % (1551712)Success in time 0.138 s
% 0.42/0.55 % Vampire exiting
%------------------------------------------------------------------------------