%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU223+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 : n014.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.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 91 ( 22 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 110 ( 43 ~; 39 |; 17 &)
% ( 3 <=>; 8 =>; 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 : 41 ( 35 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f32,axiom,
! [X0,X1] :
( ( relation(X0)
& function(X0) )
=> ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(f36,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/sandbox2/benchmark/theBenchmark.p',t70_funct_1) ).
fof(f37,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)],[f36]) ).
fof(f38,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/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
fof(f57,plain,
! [X0,X1] :
( ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f58,plain,
! [X0,X1] :
( ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f57]) ).
fof(f63,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,[],[f37]) ).
fof(f64,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,[],[f63]) ).
fof(f65,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,[],[f38]) ).
fof(f66,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,[],[f65]) ).
fof(f104,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f105,plain,
! [X0,X1] :
( ~ function(X0)
| ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f58]) ).
fof(f109,plain,
function(sK11),
inference(cnf_transformation,[],[f64]) ).
fof(f110,plain,
relation(sK11),
inference(cnf_transformation,[],[f64]) ).
fof(f111,plain,
in(sK10,relation_dom(relation_dom_restriction(sK11,sK9))),
inference(cnf_transformation,[],[f64]) ).
fof(f112,plain,
apply(relation_dom_restriction(sK11,sK9),sK10) != apply(sK11,sK10),
inference(cnf_transformation,[],[f64]) ).
fof(f115,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,[],[f66]) ).
fof(f118,plain,
! [X2,X3,X0] :
( ~ in(X3,relation_dom(relation_dom_restriction(X2,X0)))
| ~ relation(relation_dom_restriction(X2,X0))
| ~ function(X2)
| ~ relation(X2)
| ~ function(relation_dom_restriction(X2,X0))
| apply(X2,X3) = apply(relation_dom_restriction(X2,X0),X3) ),
inference(equality_resolution,[],[f115]) ).
fof(f219,plain,
( ~ relation(relation_dom_restriction(sK11,sK9))
| ~ function(sK11)
| ~ relation(sK11)
| ~ function(relation_dom_restriction(sK11,sK9))
| apply(relation_dom_restriction(sK11,sK9),sK10) = apply(sK11,sK10) ),
inference(resolution,[],[f118,f111]) ).
fof(f225,plain,
( ~ function(sK11)
| ~ relation(sK11)
| ~ function(relation_dom_restriction(sK11,sK9))
| apply(relation_dom_restriction(sK11,sK9),sK10) = apply(sK11,sK10) ),
inference(forward_subsumption_resolution,[],[f219,f105]) ).
fof(f228,plain,
( ~ function(sK11)
| ~ relation(sK11)
| apply(relation_dom_restriction(sK11,sK9),sK10) = apply(sK11,sK10) ),
inference(forward_subsumption_resolution,[],[f225,f104]) ).
fof(f229,plain,
( ~ relation(sK11)
| apply(relation_dom_restriction(sK11,sK9),sK10) = apply(sK11,sK10) ),
inference(forward_subsumption_resolution,[],[f228,f109]) ).
fof(f230,plain,
apply(relation_dom_restriction(sK11,sK9),sK10) = apply(sK11,sK10),
inference(forward_subsumption_resolution,[],[f229,f110]) ).
fof(f231,plain,
$false,
inference(forward_subsumption_resolution,[],[f230,f112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU223+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.10/0.38 % Computer : n014.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 04:09:16 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.10/0.46 % (1423343)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (1423352)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=827995111:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46 % (1423352) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1423343-1423352"...
% 0.10/0.46 % (1423349)% WARNING: option uhcvi not known.
% 0.10/0.46 % (1423352)...printing done.
% 0.10/0.46 % (1423352)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Theorem for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (1423352)------------------------------
% 0.10/0.46 % (1423352)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (1423352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (1423352)CaDiCaL version: 2.1.3
% 0.10/0.46 % (1423352)Termination reason: Refutation
% 0.10/0.46 % (1423352)Time elapsed: 0.003 s
% 0.10/0.46 % (1423352)Peak memory usage: 12 MB
% 0.10/0.46 % (1423352)Instructions burned: 7 (million)
% 0.10/0.46 % (1423343)Success in time 0.031 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------