%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM739_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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:25:32 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 15 unt; 0 typ; 2 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 94 ( 49 ~; 33 |; 1 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 39 ( 0 sgn 39 !; 0 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
frac: $tType ).
tff(func_def_0,type,
x: frac ).
tff(func_def_1,type,
y: frac ).
tff(func_def_2,type,
z: frac ).
tff(func_def_3,type,
u: frac ).
tff(pred_def_1,type,
moref: ( frac * frac ) > $o ).
tff(pred_def_2,type,
eq: ( frac * frac ) > $o ).
tff(f1,axiom,
( ~ moref(x,y)
=> eq(x,y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
tff(f2,axiom,
eq(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e) ).
tff(f3,axiom,
eq(y,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f) ).
tff(f5,axiom,
! [X0: frac,X1: frac,X2: frac] :
( eq(X0,X1)
=> ( eq(X1,X2)
=> eq(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz39) ).
tff(f6,axiom,
! [X0: frac,X1: frac] :
( eq(X0,X1)
=> eq(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz38) ).
tff(f7,axiom,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X0,X1)
=> ( eq(X0,X2)
=> ( eq(X1,X3)
=> moref(X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz44) ).
tff(f8,conjecture,
( ~ moref(z,u)
=> eq(z,u) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz46) ).
tff(f9,negated_conjecture,
~ ( ~ moref(z,u)
=> eq(z,u) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
tff(f12,plain,
( eq(x,y)
| moref(x,y) ),
inference(ennf_transformation,[],[f1]) ).
tff(f14,plain,
! [X0: frac,X1: frac,X2: frac] :
( eq(X0,X2)
| ~ eq(X1,X2)
| ~ eq(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
tff(f15,plain,
! [X0: frac,X1: frac,X2: frac] :
( eq(X0,X2)
| ~ eq(X1,X2)
| ~ eq(X0,X1) ),
inference(flattening,[],[f14]) ).
tff(f16,plain,
! [X0: frac,X1: frac] :
( eq(X1,X0)
| ~ eq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
tff(f17,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2)
| ~ moref(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
tff(f18,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2)
| ~ moref(X0,X1) ),
inference(flattening,[],[f17]) ).
tff(f19,plain,
( ~ eq(z,u)
& ~ moref(z,u) ),
inference(ennf_transformation,[],[f9]) ).
tff(f20,plain,
( moref(x,y)
| eq(x,y) ),
inference(cnf_transformation,[],[f12]) ).
tff(f21,plain,
eq(x,z),
inference(cnf_transformation,[],[f2]) ).
tff(f22,plain,
eq(y,u),
inference(cnf_transformation,[],[f3]) ).
tff(f23,plain,
! [X2: frac,X0: frac,X1: frac] :
( ~ eq(X0,X1)
| ~ eq(X1,X2)
| eq(X0,X2) ),
inference(cnf_transformation,[],[f15]) ).
tff(f24,plain,
! [X0: frac,X1: frac] :
( ~ eq(X0,X1)
| eq(X1,X0) ),
inference(cnf_transformation,[],[f16]) ).
tff(f25,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ~ moref(X0,X1)
| moref(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2) ),
inference(cnf_transformation,[],[f18]) ).
tff(f26,plain,
~ moref(z,u),
inference(cnf_transformation,[],[f19]) ).
tff(f27,plain,
~ eq(z,u),
inference(cnf_transformation,[],[f19]) ).
tff(f29,definition,
( spl0_1
<=> eq(x,y) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
tff(f31,plain,
( eq(x,y)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f29]) ).
tff(f33,definition,
( spl0_2
<=> moref(x,y) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
tff(f35,plain,
( moref(x,y)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f33]) ).
tff(f36,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f20,f33,f29]) ).
tff(f41,plain,
! [X0: frac] :
( eq(X0,z)
| ~ eq(X0,x) ),
inference(resolution,[],[f23,f21]) ).
tff(f45,plain,
! [X0: frac] :
( ~ eq(z,X0)
| ~ eq(X0,u) ),
inference(resolution,[],[f23,f27]) ).
tff(f51,plain,
! [X0: frac,X1: frac] :
( ~ moref(X0,X1)
| ~ eq(X1,u)
| ~ eq(X0,z) ),
inference(resolution,[],[f25,f26]) ).
tff(f54,plain,
! [X0: frac] :
( ~ eq(X0,u)
| ~ eq(X0,z) ),
inference(resolution,[],[f45,f24]) ).
tff(f57,plain,
( ~ eq(y,u)
| ~ eq(x,z)
| ~ spl0_2 ),
inference(resolution,[],[f51,f35]) ).
tff(f59,plain,
( ~ eq(x,z)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f57,f22]) ).
tff(f60,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f59,f21]) ).
tff(f61,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f60]) ).
tff(f62,plain,
~ eq(y,z),
inference(resolution,[],[f54,f22]) ).
tff(f73,plain,
~ eq(y,x),
inference(resolution,[],[f41,f62]) ).
tff(f96,plain,
~ eq(x,y),
inference(resolution,[],[f73,f24]) ).
tff(f97,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f96,f31]) ).
tff(f98,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f97]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f36]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f61]) ).
cnf(s4,plain,
~ spl0_1,
inference(sat_conversion,[],[f98]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s1,s2,s4]) ).
tff(f99,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM739_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n003.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 21:16:56 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/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.11/0.46 % (925761)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (925770)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1524226878:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (925770) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-925761-925770"...
% 0.11/0.46 % (925770)...printing done.
% 0.11/0.46 % (925767)% WARNING: option uhcvi not known.
% 0.11/0.46 % (925770)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (925770)------------------------------
% 0.11/0.46 % (925770)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (925770)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (925770)CaDiCaL version: 2.1.3
% 0.11/0.46 % (925770)Termination reason: Refutation
% 0.11/0.46 % (925770)Time elapsed: 0.002 s
% 0.11/0.46 % (925770)Peak memory usage: 12 MB
% 0.11/0.46 % (925770)Instructions burned: 3 (million)
% 0.11/0.46 % (925761)Success in time 0.029 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------