%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU223+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:28 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 101 ( 23 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 119 ( 46 ~; 44 |; 17 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 48 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f23,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f24,axiom,
! [X0,X1] :
( ( relation(X0)
& function(X0) )
=> ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(f38,conjecture,
! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t70_funct_1) ).
fof(f39,negated_conjecture,
~ ! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
inference(negated_conjecture,[status(cth)],[f38]) ).
fof(f40,axiom,
! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( X1 = relation_dom_restriction(X2,X0)
<=> ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t68_funct_1) ).
fof(f64,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f65,plain,
! [X0,X1] :
( ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f66,plain,
! [X0,X1] :
( ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f65]) ).
fof(f72,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& relation(X2)
& function(X2) ),
inference(ennf_transformation,[],[f39]) ).
fof(f73,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,relation_dom(relation_dom_restriction(X2,X0)))
& relation(X2)
& function(X2) ),
inference(flattening,[],[f72]) ).
fof(f74,plain,
! [X0,X1] :
( ! [X2] :
( ( X1 = relation_dom_restriction(X2,X0)
<=> ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(ennf_transformation,[],[f40]) ).
fof(f75,plain,
! [X0,X1] :
( ! [X2] :
( ( X1 = relation_dom_restriction(X2,X0)
<=> ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(flattening,[],[f74]) ).
fof(f102,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f103,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f127,plain,
function(sK13),
inference(cnf_transformation,[],[f73]) ).
fof(f128,plain,
relation(sK13),
inference(cnf_transformation,[],[f73]) ).
fof(f129,plain,
in(sK12,relation_dom(relation_dom_restriction(sK13,sK11))),
inference(cnf_transformation,[],[f73]) ).
fof(f130,plain,
apply(relation_dom_restriction(sK13,sK11),sK12) != apply(sK13,sK12),
inference(cnf_transformation,[],[f73]) ).
fof(f133,plain,
! [X2,X3,X0,X1] :
( ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| ~ in(X3,relation_dom(X1))
| apply(X1,X3) = apply(X2,X3)
| relation_dom_restriction(X2,X0) != X1 ),
inference(cnf_transformation,[],[f75]) ).
fof(f136,plain,
! [X2,X3,X0] :
( ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0))
| ~ function(X2)
| ~ relation(X2)
| ~ in(X3,relation_dom(relation_dom_restriction(X2,X0)))
| apply(X2,X3) = apply(relation_dom_restriction(X2,X0),X3) ),
inference(equality_resolution,[],[f133]) ).
fof(f164,plain,
~ in(sK12,relation_dom(relation_dom_restriction(sK13,sK11))),
inference(consistent_polarity_flipping,[],[f129]) ).
fof(f165,plain,
! [X2,X3,X0] :
( ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0))
| ~ function(X2)
| ~ relation(X2)
| in(X3,relation_dom(relation_dom_restriction(X2,X0)))
| apply(X2,X3) = apply(relation_dom_restriction(X2,X0),X3) ),
inference(consistent_polarity_flipping,[],[f136]) ).
fof(f265,plain,
! [X2,X3,X0] :
( ~ relation(relation_dom_restriction(X2,X0))
| ~ function(X2)
| ~ relation(X2)
| in(X3,relation_dom(relation_dom_restriction(X2,X0)))
| apply(X2,X3) = apply(relation_dom_restriction(X2,X0),X3) ),
inference(forward_subsumption_resolution,[],[f165,f103]) ).
fof(f266,plain,
! [X2,X3,X0] :
( in(X3,relation_dom(relation_dom_restriction(X2,X0)))
| ~ relation(X2)
| ~ function(X2)
| apply(X2,X3) = apply(relation_dom_restriction(X2,X0),X3) ),
inference(forward_subsumption_resolution,[],[f265,f102]) ).
fof(f267,plain,
( ~ relation(sK13)
| ~ function(sK13)
| apply(relation_dom_restriction(sK13,sK11),sK12) = apply(sK13,sK12) ),
inference(resolution,[],[f266,f164]) ).
fof(f271,plain,
( ~ function(sK13)
| apply(relation_dom_restriction(sK13,sK11),sK12) = apply(sK13,sK12) ),
inference(forward_subsumption_resolution,[],[f267,f128]) ).
fof(f273,plain,
apply(relation_dom_restriction(sK13,sK11),sK12) = apply(sK13,sK12),
inference(forward_subsumption_resolution,[],[f271,f127]) ).
fof(f274,plain,
$false,
inference(forward_subsumption_resolution,[],[f273,f130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU223+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n009.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:09:45 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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.10/0.43 % (2651437)Will run a generic schedule for satisfiability detection.
% 0.10/0.43 % (2651443)% WARNING: option uhcvi not known.
% 0.10/0.43 % (2651443)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=766648579:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.43 % (2651442)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2873256660_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.43 % (2651444)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1247367848:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.43 % (2651445)dis+10_1_sil=32000:sp=arity:random_seed=706627349:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.43 % (2651446)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2152964081:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.43 % (2651447)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3060099273:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.43 % (2651448)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3296904652:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.44 % (2651443) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2651437-2651443"...
% 0.10/0.44 % TRYING [1]
% 0.10/0.44 % TRYING [2]
% 0.10/0.44 % (2651443)...printing done.
% 0.10/0.44 % (2651443)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Theorem for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44 % (2651443)------------------------------
% 0.10/0.44 % (2651443)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (2651443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (2651443)CaDiCaL version: 2.1.3
% 0.10/0.44 % (2651443)Termination reason: Refutation
% 0.10/0.44 % (2651443)Time elapsed: 0.003 s
% 0.10/0.44 % (2651443)Peak memory usage: 12 MB
% 0.10/0.44 % (2651443)Instructions burned: 7 (million)
% 0.10/0.44 % (2651437)Success in time 0.036 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------