%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM746_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:47 PM UTC 2026
% Result : Theorem 2.53s 1.32s
% Output : Refutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 94 ( 47 ~; 30 |; 5 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 43 ( 43 !; 0 ?; 43 :)
% 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(pred_def_1,type,
lessf: ( frac * frac ) > $o ).
tff(pred_def_2,type,
eq: ( frac * frac ) > $o ).
tff(f1,axiom,
( ~ lessf(x,y)
=> eq(x,y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
tff(f2,axiom,
( ~ lessf(y,z)
=> eq(y,z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).
tff(f4,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(f5,axiom,
! [X0: frac,X1: frac,X2: frac] :
( lessf(X0,X1)
=> ( ( ~ lessf(X1,X2)
=> eq(X1,X2) )
=> lessf(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz51b) ).
tff(f6,axiom,
! [X0: frac,X1: frac,X2: frac] :
( ( ~ lessf(X0,X1)
=> eq(X0,X1) )
=> ( lessf(X1,X2)
=> lessf(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz51a) ).
tff(f7,conjecture,
( ~ lessf(x,z)
=> eq(x,z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz52) ).
tff(f8,negated_conjecture,
~ ( ~ lessf(x,z)
=> eq(x,z) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
tff(f11,plain,
( ~ eq(x,z)
& ~ lessf(x,z) ),
inference(ennf_transformation,[],[f8]) ).
tff(f12,plain,
( eq(x,y)
| lessf(x,y) ),
inference(ennf_transformation,[],[f1]) ).
tff(f13,plain,
! [X0: frac,X1: frac,X2: frac] :
( lessf(X0,X2)
| ~ lessf(X1,X2)
| ( ~ eq(X0,X1)
& ~ lessf(X0,X1) ) ),
inference(ennf_transformation,[],[f6]) ).
tff(f14,plain,
! [X0: frac,X1: frac,X2: frac] :
( lessf(X0,X2)
| ~ lessf(X1,X2)
| ( ~ eq(X0,X1)
& ~ lessf(X0,X1) ) ),
inference(flattening,[],[f13]) ).
tff(f15,plain,
! [X0: frac,X1: frac,X2: frac] :
( lessf(X0,X2)
| ( ~ eq(X1,X2)
& ~ lessf(X1,X2) )
| ~ lessf(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
tff(f16,plain,
! [X0: frac,X1: frac,X2: frac] :
( lessf(X0,X2)
| ( ~ eq(X1,X2)
& ~ lessf(X1,X2) )
| ~ lessf(X0,X1) ),
inference(flattening,[],[f15]) ).
tff(f17,plain,
! [X0: frac,X1: frac,X2: frac] :
( eq(X0,X2)
| ~ eq(X1,X2)
| ~ eq(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
tff(f18,plain,
! [X0: frac,X1: frac,X2: frac] :
( eq(X0,X2)
| ~ eq(X1,X2)
| ~ eq(X0,X1) ),
inference(flattening,[],[f17]) ).
tff(f19,plain,
( eq(y,z)
| lessf(y,z) ),
inference(ennf_transformation,[],[f2]) ).
tff(f20,plain,
~ lessf(x,z),
inference(cnf_transformation,[],[f11]) ).
tff(f21,plain,
~ eq(x,z),
inference(cnf_transformation,[],[f11]) ).
tff(f22,plain,
( eq(x,y)
| lessf(x,y) ),
inference(cnf_transformation,[],[f12]) ).
tff(f23,plain,
! [X2: frac,X0: frac,X1: frac] :
( lessf(X0,X2)
| ~ lessf(X1,X2)
| ~ lessf(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
tff(f24,plain,
! [X2: frac,X0: frac,X1: frac] :
( lessf(X0,X2)
| ~ lessf(X1,X2)
| ~ eq(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
tff(f26,plain,
! [X2: frac,X0: frac,X1: frac] :
( lessf(X0,X2)
| ~ eq(X1,X2)
| ~ lessf(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tff(f27,plain,
! [X2: frac,X0: frac,X1: frac] :
( eq(X0,X2)
| ~ eq(X1,X2)
| ~ eq(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tff(f28,plain,
( eq(y,z)
| lessf(y,z) ),
inference(cnf_transformation,[],[f19]) ).
tff(f29,plain,
! [X0: frac] :
( ~ lessf(x,X0)
| ~ lessf(X0,z) ),
inference(resolution,[],[f23,f20]) ).
tff(f31,plain,
! [X0: frac] :
( ~ eq(x,X0)
| ~ lessf(X0,z) ),
inference(resolution,[],[f24,f20]) ).
tff(f33,plain,
( ~ lessf(y,z)
| lessf(x,y) ),
inference(resolution,[],[f31,f22]) ).
tff(f34,plain,
~ lessf(y,z),
inference(forward_subsumption_resolution,[],[f33,f29]) ).
tff(f39,plain,
! [X0: frac] :
( ~ eq(X0,z)
| ~ lessf(x,X0) ),
inference(resolution,[],[f26,f20]) ).
tff(f45,plain,
! [X0: frac] :
( ~ eq(x,X0)
| ~ eq(X0,z) ),
inference(resolution,[],[f27,f21]) ).
tff(f54,plain,
( ~ eq(y,z)
| lessf(x,y) ),
inference(resolution,[],[f45,f22]) ).
tff(f56,plain,
~ eq(y,z),
inference(forward_subsumption_resolution,[],[f54,f39]) ).
tff(f57,plain,
lessf(y,z),
inference(resolution,[],[f56,f28]) ).
tff(f59,plain,
$false,
inference(forward_subsumption_resolution,[],[f57,f34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM746_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 21:18:46 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.53/1.32 % (2012109)Detected formulas, will run a generic FOF schedule.
% 2.53/1.32 % (2012118)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=670908770:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.53/1.32 % (2012118)First to succeed.
% 2.53/1.32 % (2012118)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2012109"
% 2.53/1.32 % (2012117)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=38663788:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.53/1.32 % (2012116)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=2393580171:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.53/1.32 % (2012120)dis-21_1_sil=8000:lcm=predicate:random_seed=2343836684: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.53/1.32 % (2012114)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=2578607666:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.53/1.32 % (2012115)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=155239545:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.53/1.32 % (2012117)Refutation not found, incomplete strategy
% 2.53/1.32 % (2012117)------------------------------
% 2.53/1.32 % (2012117)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.32 % (2012117)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.32 % (2012117)CaDiCaL version: 2.1.3
% 2.53/1.32 % (2012117)Termination reason: Refutation not found, incomplete strategy
% 2.53/1.32 % (2012117)Time elapsed: 0.001 s
% 2.53/1.32 % (2012117)Peak memory usage: 88 MB
% 2.53/1.32 % (2012119)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3929981591:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.53/1.32 % (2012119)Also succeeded, but the first one will report.
% 2.53/1.32 % (2012120)Also succeeded, but the first one will report.
% 2.53/1.32 % (2012118)Refutation found. Thanks to Tanya!
% 2.53/1.32 % SZS status Theorem for theBenchmark
% 2.53/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 2.53/1.32 % (2012118)------------------------------
% 2.53/1.32 % (2012118)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.32 % (2012118)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.32 % (2012118)CaDiCaL version: 2.1.3
% 2.53/1.32 % (2012118)Termination reason: Refutation
% 2.53/1.32 % (2012118)Time elapsed: 0.001 s
% 2.53/1.32 % (2012118)Peak memory usage: 88 MB
% 2.53/1.32 % (2012118)Instructions burned: 1 (million)
% 2.53/1.32 % (2012118)------------------------------
% 2.53/1.32 % (2012118)------------------------------
% 2.53/1.32 % (2012109)Success in time 0.27 s
% 2.53/1.32 % Vampire exiting
%------------------------------------------------------------------------------