%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM771^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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 : Wed Sep 30 08:19:30 AM UTC 2026
% Result : Theorem 0.07s 0.24s
% Output : Refutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM771^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17 % Computer : n020.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 12:55:49 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.24 % (1007405)Will run a generic schedule for satisfiability detection.
% 0.07/0.24 % (1007414)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1693616528:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.24 % (1007414)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.24 % (1007414) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1007405-1007414"...
% 0.07/0.24 % (1007414)...printing done.
% 0.07/0.24 % (1007411)% WARNING: option uhcvi not known.
% 0.07/0.24 % (1007414)Refutation found. Thanks to Tanya!
% 0.07/0.24 % SZS status Theorem for theBenchmark
% 0.07/0.24 % SZS output start Proof for theBenchmark
% 0.07/0.24 thf(type_def_5, type, frac: $tType).
% 0.07/0.24 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.07/0.24 thf(type_def_7, type, nat: $tType).
% 0.07/0.24 thf(func_def_0, type, x: frac).
% 0.07/0.24 thf(func_def_1, type, y: frac).
% 0.07/0.24 thf(func_def_2, type, eq: (frac > frac > $o)).
% 0.07/0.24 thf(func_def_3, type, fr: (nat > nat > frac)).
% 0.07/0.24 thf(func_def_4, type, ts: (nat > nat > nat)).
% 0.07/0.24 thf(func_def_5, type, num: (frac > nat)).
% 0.07/0.24 thf(func_def_6, type, den: (frac > nat)).
% 0.07/0.24 thf(f1,axiom,(
% 0.07/0.24 ! [X0 : frac] : (eq @ X0 @ X0)),
% 0.07/0.24 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37)).
% 0.07/0.24 thf(f2,axiom,(
% 0.07/0.24 ! [X0 : nat,X1 : nat] : (((ts @ X0 @ X1)) = ((ts @ X1 @ X0)))),
% 0.07/0.24 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz29)).
% 0.07/0.24 thf(f3,conjecture,(
% 0.07/0.24 (eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ y) @ (num @ x)) @ (ts @ (den @ y) @ (den @ x))))),
% 0.07/0.24 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz69)).
% 0.07/0.24 thf(f4,negated_conjecture,(
% 0.07/0.24 ~(eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ y) @ (num @ x)) @ (ts @ (den @ y) @ (den @ x))))),
% 0.07/0.24 inference(negated_conjecture,[status(cth)],[f3])).
% 0.07/0.24 thf(f5,plain,(
% 0.07/0.24 ! [X0 : frac] : (eq @ X0 @ X0)),
% 0.07/0.24 inference(rectify,[],[f1])).
% 0.07/0.24 thf(f6,plain,(
% 0.07/0.24 ! [X0 : frac] : (((eq @ X0 @ X0)) = $true)),
% 0.07/0.24 inference(fool_elimination,[],[f5])).
% 0.07/0.24 thf(f7,plain,(
% 0.07/0.24 ~(eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ y) @ (num @ x)) @ (ts @ (den @ y) @ (den @ x))))),
% 0.07/0.24 inference(rectify,[],[f4])).
% 0.07/0.24 thf(f8,plain,(
% 0.07/0.24 ~ (((eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ y) @ (num @ x)) @ (ts @ (den @ y) @ (den @ x))))) = $true)),
% 0.07/0.24 inference(fool_elimination,[],[f7])).
% 0.07/0.24 thf(f9,plain,(
% 0.07/0.24 (((eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ y) @ (num @ x)) @ (ts @ (den @ y) @ (den @ x))))) != $true)),
% 0.07/0.24 inference(flattening,[],[f8])).
% 0.07/0.24 thf(f10,plain,(
% 0.07/0.24 ( ! [X0 : frac] : ((((eq @ X0 @ X0)) = $true)) )),
% 0.07/0.24 inference(cnf_transformation,[],[f6])).
% 0.07/0.24 thf(f11,plain,(
% 0.07/0.24 ( ! [X0 : nat,X1 : nat] : ((((ts @ X0 @ X1)) = ((ts @ X1 @ X0)))) )),
% 0.07/0.24 inference(cnf_transformation,[],[f2])).
% 0.07/0.24 thf(f12,plain,(
% 0.07/0.24 (((eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ y) @ (num @ x)) @ (ts @ (den @ y) @ (den @ x))))) != $true)),
% 0.07/0.24 inference(cnf_transformation,[],[f9])).
% 0.07/0.24 thf(f14,definition,(
% 0.07/0.24 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.07/0.24 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.07/0.24 thf(f22,plain,(
% 0.07/0.24 ($true != $true) | (((eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ y) @ (num @ x)) @ (ts @ (den @ y) @ (den @ x))))) = $false)),
% 0.07/0.24 inference(constrained_superposition,[],[f12,f14])).
% 0.07/0.24 thf(f23,plain,(
% 0.07/0.24 (((eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ y) @ (num @ x)) @ (ts @ (den @ y) @ (den @ x))))) = $false)),
% 0.07/0.24 inference(trivial_inequality_removal,[],[f22])).
% 0.07/0.24 thf(f24,plain,(
% 0.07/0.24 ($false = ((eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ y) @ (den @ x))))))),
% 0.07/0.24 inference(forward_demodulation,[],[f23,f11])).
% 0.07/0.24 thf(f25,plain,(
% 0.07/0.24 ($false = ((eq @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))) @ (fr @ (ts @ (num @ x) @ (num @ y)) @ (ts @ (den @ x) @ (den @ y))))))),
% 0.07/0.24 inference(forward_demodulation,[],[f24,f11])).
% 0.07/0.24 thf(f26,plain,(
% 0.07/0.24 ($true = $false)),
% 0.07/0.24 inference(forward_demodulation,[],[f25,f10])).
% 0.07/0.24 thf(f27,plain,(
% 0.07/0.24 $false),
% 0.07/0.24 inference(trivial_inequality_removal,[],[f26])).
% 0.07/0.24 % SZS output end Proof for theBenchmark
% 0.07/0.24 % (1007414)------------------------------
% 0.07/0.24 % (1007414)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24 % (1007414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24 % (1007414)CaDiCaL version: 2.1.3
% 0.07/0.24 % (1007414)Termination reason: Refutation
% 0.07/0.24 % (1007414)Time elapsed: 0.001 s
% 0.07/0.24 % (1007414)Peak memory usage: 12 MB
% 0.07/0.24 % (1007414)Instructions burned: 2 (million)
% 0.07/0.24 % (1007405)Success in time 0.025 s
% 0.07/0.24 % Vampire exiting
%------------------------------------------------------------------------------