%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM762_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:16:54 PM UTC 2026
% Result : Theorem 2.46s 1.23s
% Output : Refutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 91 ( 46 ~; 36 |; 0 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 67 !; 0 ?; 67 :)
% 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(func_def_4,type,
pf: ( frac * frac ) > 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),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
tff(f2,axiom,
( ~ moref(z,u)
=> eq(z,u) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
tff(f4,axiom,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X0,X1)
=> ( eq(X0,X2)
=> ( eq(X1,X3)
=> moref(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz44) ).
tff(f5,axiom,
! [X0: frac,X1: frac,X2: frac] :
( moref(X0,X1)
=> moref(pf(X0,X2),pf(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz61) ).
tff(f6,axiom,
! [X0: frac] : eq(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).
tff(f7,axiom,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( eq(X0,X1)
=> ( eq(X2,X3)
=> eq(pf(X0,X2),pf(X1,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz56) ).
tff(f8,axiom,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X0,X1)
=> ( moref(X2,X3)
=> moref(pf(X0,X2),pf(X1,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz64) ).
tff(f9,conjecture,
moref(pf(x,z),pf(y,u)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65b) ).
tff(f10,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(negated_conjecture,[status(cth)],[f9]) ).
tff(f13,plain,
~ moref(pf(x,z),pf(y,u)),
inference(flattening,[],[f10]) ).
tff(f14,plain,
( eq(z,u)
| moref(z,u) ),
inference(ennf_transformation,[],[f2]) ).
tff(f15,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(pf(X0,X2),pf(X1,X3))
| ~ moref(X2,X3)
| ~ moref(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
tff(f16,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(pf(X0,X2),pf(X1,X3))
| ~ moref(X2,X3)
| ~ moref(X0,X1) ),
inference(flattening,[],[f15]) ).
tff(f17,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( eq(pf(X0,X2),pf(X1,X3))
| ~ eq(X2,X3)
| ~ eq(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
tff(f18,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( eq(pf(X0,X2),pf(X1,X3))
| ~ eq(X2,X3)
| ~ eq(X0,X1) ),
inference(flattening,[],[f17]) ).
tff(f19,plain,
! [X0: frac,X1: frac,X2: frac] :
( moref(pf(X0,X2),pf(X1,X2))
| ~ moref(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
tff(f20,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2)
| ~ moref(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
tff(f21,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2)
| ~ moref(X0,X1) ),
inference(flattening,[],[f20]) ).
tff(f22,plain,
~ moref(pf(x,z),pf(y,u)),
inference(cnf_transformation,[],[f13]) ).
tff(f23,plain,
moref(x,y),
inference(cnf_transformation,[],[f1]) ).
tff(f24,plain,
( eq(z,u)
| moref(z,u) ),
inference(cnf_transformation,[],[f14]) ).
tff(f25,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( moref(pf(X0,X2),pf(X1,X3))
| ~ moref(X2,X3)
| ~ moref(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tff(f26,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( eq(pf(X0,X2),pf(X1,X3))
| ~ eq(X2,X3)
| ~ eq(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tff(f27,plain,
! [X2: frac,X0: frac,X1: frac] :
( moref(pf(X0,X2),pf(X1,X2))
| ~ moref(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
tff(f28,plain,
! [X0: frac] : eq(X0,X0),
inference(cnf_transformation,[],[f6]) ).
tff(f29,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( moref(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2)
| ~ moref(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
tff(f30,plain,
! [X0: frac,X1: frac] :
( ~ eq(X1,pf(x,z))
| ~ eq(X0,pf(y,u))
| ~ moref(X1,X0) ),
inference(resolution,[],[f29,f22]) ).
tff(f31,plain,
( ~ moref(z,u)
| ~ moref(x,y) ),
inference(resolution,[],[f25,f22]) ).
tff(f32,plain,
~ moref(z,u),
inference(forward_subsumption_resolution,[],[f31,f23]) ).
tff(f38,plain,
! [X0: frac] :
( ~ eq(X0,pf(y,u))
| ~ moref(pf(x,z),X0) ),
inference(resolution,[],[f30,f28]) ).
tff(f42,plain,
! [X0: frac,X1: frac] :
( ~ moref(pf(x,z),pf(X0,X1))
| ~ eq(X1,u)
| ~ eq(X0,y) ),
inference(resolution,[],[f38,f26]) ).
tff(f49,plain,
! [X0: frac] :
( ~ eq(z,u)
| ~ eq(X0,y)
| ~ moref(x,X0) ),
inference(resolution,[],[f42,f27]) ).
tff(f52,plain,
! [X0: frac] :
( ~ eq(X0,y)
| ~ moref(x,X0)
| moref(z,u) ),
inference(resolution,[],[f49,f24]) ).
tff(f53,plain,
! [X0: frac] :
( ~ eq(X0,y)
| ~ moref(x,X0) ),
inference(forward_subsumption_resolution,[],[f52,f32]) ).
tff(f54,plain,
~ moref(x,y),
inference(resolution,[],[f53,f28]) ).
tff(f55,plain,
$false,
inference(forward_subsumption_resolution,[],[f54,f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM762_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n018.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 : Sun Sep 27 21:22:10 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.46/1.23 % (2732689)Detected formulas, will run a generic FOF schedule.
% 2.46/1.23 % (2732698)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1892086929:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.46/1.23 % (2732698)First to succeed.
% 2.46/1.23 % (2732698)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2732689"
% 2.46/1.23 % (2732699)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=316309177:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.46/1.23 % (2732695)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=4151963330:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.46/1.23 % (2732697)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3159612124:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.46/1.23 % (2732694)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1303427255:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.46/1.23 % (2732696)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2216014557:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.46/1.23 % (2732697)Refutation not found, incomplete strategy
% 2.46/1.23 % (2732697)------------------------------
% 2.46/1.23 % (2732697)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.23 % (2732697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.23 % (2732697)CaDiCaL version: 2.1.3
% 2.46/1.23 % (2732697)Termination reason: Refutation not found, incomplete strategy
% 2.46/1.23 % (2732697)Time elapsed: 0.001 s
% 2.46/1.23 % (2732697)Peak memory usage: 88 MB
% 2.46/1.23 % (2732699)Also succeeded, but the first one will report.
% 2.46/1.23 % (2732700)dis-21_1_sil=8000:lcm=predicate:random_seed=762014861:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.46/1.23 % (2732700)Also succeeded, but the first one will report.
% 2.46/1.23 % (2732698)Refutation found. Thanks to Tanya!
% 2.46/1.23 % SZS status Theorem for theBenchmark
% 2.46/1.23 % SZS output start Proof for theBenchmark
% See solution above
% 2.46/1.23 % (2732698)------------------------------
% 2.46/1.23 % (2732698)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.46/1.23 % (2732698)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/1.23 % (2732698)CaDiCaL version: 2.1.3
% 2.46/1.23 % (2732698)Termination reason: Refutation
% 2.46/1.23 % (2732698)Time elapsed: 0.001 s
% 2.46/1.23 % (2732698)Peak memory usage: 88 MB
% 2.46/1.23 % (2732698)Instructions burned: 2 (million)
% 2.46/1.23 % (2732698)------------------------------
% 2.46/1.23 % (2732698)------------------------------
% 2.46/1.23 % (2732689)Success in time 0.277 s
% 2.46/1.23 % Vampire exiting
%------------------------------------------------------------------------------