%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM755_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:36 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 84 ( 43 ~; 23 |; 4 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 50 !; 0 ?; 50 :)
% 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,
pf: ( frac * frac ) > frac ).
tff(pred_def_1,type,
moref: ( frac * frac ) > $o ).
tff(pred_def_2,type,
eq: ( frac * frac ) > $o ).
tff(pred_def_3,type,
lessf: ( frac * frac ) > $o ).
tff(f1,axiom,
moref(pf(x,z),pf(y,z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
tff(f3,axiom,
! [X0: frac,X1: frac] :
~ ( ( eq(X0,X1)
=> ~ moref(X0,X1) )
=> ~ ~ ( ( moref(X0,X1)
=> ~ lessf(X0,X1) )
=> ~ ( lessf(X0,X1)
=> ~ eq(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz41b) ).
tff(f4,axiom,
! [X0: frac,X1: frac,X2: frac] :
( eq(X0,X1)
=> eq(pf(X0,X2),pf(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62b) ).
tff(f5,axiom,
! [X0: frac,X1: frac,X2: frac] :
( lessf(X0,X1)
=> lessf(pf(X0,X2),pf(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62c) ).
tff(f6,axiom,
! [X0: frac,X1: frac] :
( ~ eq(X0,X1)
=> ( ~ moref(X0,X1)
=> lessf(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz41a) ).
tff(f7,conjecture,
moref(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz63a) ).
tff(f8,negated_conjecture,
~ moref(x,y),
inference(negated_conjecture,[status(cth)],[f7]) ).
tff(f11,plain,
! [X0: frac,X1: frac] :
~ ( ( eq(X0,X1)
=> ~ moref(X0,X1) )
=> ( ( moref(X0,X1)
=> ~ lessf(X0,X1) )
=> ~ ( lessf(X0,X1)
=> ~ eq(X0,X1) ) ) ),
inference(flattening,[],[f3]) ).
tff(f12,plain,
~ moref(x,y),
inference(flattening,[],[f8]) ).
tff(f14,plain,
! [X0: frac,X1: frac] :
( ( ~ eq(X0,X1)
| ~ lessf(X0,X1) )
& ( ~ lessf(X0,X1)
| ~ moref(X0,X1) )
& ( ~ moref(X0,X1)
| ~ eq(X0,X1) ) ),
inference(ennf_transformation,[],[f11]) ).
tff(f15,plain,
! [X0: frac,X1: frac] :
( ( ~ eq(X0,X1)
| ~ lessf(X0,X1) )
& ( ~ lessf(X0,X1)
| ~ moref(X0,X1) )
& ( ~ moref(X0,X1)
| ~ eq(X0,X1) ) ),
inference(flattening,[],[f14]) ).
tff(f16,plain,
! [X0: frac,X1: frac,X2: frac] :
( eq(pf(X0,X2),pf(X1,X2))
| ~ eq(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
tff(f17,plain,
! [X0: frac,X1: frac,X2: frac] :
( lessf(pf(X0,X2),pf(X1,X2))
| ~ lessf(X0,X1) ),
inference(ennf_transformation,[],[f5]) ).
tff(f18,plain,
! [X0: frac,X1: frac] :
( lessf(X0,X1)
| moref(X0,X1)
| eq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
tff(f19,plain,
! [X0: frac,X1: frac] :
( lessf(X0,X1)
| moref(X0,X1)
| eq(X0,X1) ),
inference(flattening,[],[f18]) ).
tff(f20,plain,
moref(pf(x,z),pf(y,z)),
inference(cnf_transformation,[],[f1]) ).
tff(f22,plain,
! [X0: frac,X1: frac] :
( ~ lessf(X0,X1)
| ~ moref(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tff(f23,plain,
! [X0: frac,X1: frac] :
( ~ eq(X0,X1)
| ~ moref(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tff(f24,plain,
! [X2: frac,X0: frac,X1: frac] :
( eq(pf(X0,X2),pf(X1,X2))
| ~ eq(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tff(f25,plain,
! [X2: frac,X0: frac,X1: frac] :
( lessf(pf(X0,X2),pf(X1,X2))
| ~ lessf(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tff(f26,plain,
! [X0: frac,X1: frac] :
( lessf(X0,X1)
| moref(X0,X1)
| eq(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
tff(f27,plain,
~ moref(x,y),
inference(cnf_transformation,[],[f12]) ).
tff(f30,plain,
! [X2: frac,X0: frac,X1: frac] :
( ~ eq(X0,X1)
| ~ moref(pf(X0,X2),pf(X1,X2)) ),
inference(resolution,[],[f24,f23]) ).
tff(f31,plain,
! [X2: frac,X0: frac,X1: frac] :
( ~ lessf(X0,X1)
| ~ moref(pf(X0,X2),pf(X1,X2)) ),
inference(resolution,[],[f25,f22]) ).
tff(f34,plain,
! [X2: frac,X0: frac,X1: frac] :
( ~ moref(pf(X0,X1),pf(X2,X1))
| moref(X0,X2)
| eq(X0,X2) ),
inference(resolution,[],[f31,f26]) ).
tff(f36,plain,
! [X2: frac,X0: frac,X1: frac] :
( ~ moref(pf(X0,X1),pf(X2,X1))
| moref(X0,X2) ),
inference(forward_subsumption_resolution,[],[f34,f30]) ).
tff(f39,plain,
moref(x,y),
inference(resolution,[],[f36,f20]) ).
tff(f40,plain,
$false,
inference(forward_subsumption_resolution,[],[f39,f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM755_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 21:22:48 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.11/0.43 % (3002426)Will run a generic schedule for satisfiability detection.
% 0.11/0.43 % (3002435)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=603166646:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.43 % (3002435) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3002426-3002435"...
% 0.11/0.43 % (3002435)...printing done.
% 0.11/0.43 % (3002435)Refutation found. Thanks to Tanya!
% 0.11/0.43 % SZS status Theorem for theBenchmark
% 0.11/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.43 % (3002435)------------------------------
% 0.11/0.43 % (3002435)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.43 % (3002435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.43 % (3002435)CaDiCaL version: 2.1.3
% 0.11/0.43 % (3002435)Termination reason: Refutation
% 0.11/0.43 % (3002435)Time elapsed: 0.001 s
% 0.11/0.43 % (3002435)Peak memory usage: 11 MB
% 0.11/0.43 % (3002435)Instructions burned: 1 (million)
% 0.11/0.43 % (3002426)Success in time 0.024 s
% 0.11/0.43 % Vampire exiting
%------------------------------------------------------------------------------