%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM749^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:26 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM749^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n011.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 12:50:01 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.19/0.27 % (40075)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (40091)% WARNING: option uhcvi not known.
% 0.19/0.27 % (40091)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1719413334:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (40091)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27 % (40091)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.27 % (40091) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-40075-40091"...
% 0.19/0.27 % (40091)...printing done.
% 0.19/0.27 % (40091)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% 0.19/0.27 thf(type_def_5, type, frac: $tType).
% 0.19/0.27 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.27 thf(func_def_0, type, x: frac).
% 0.19/0.27 thf(func_def_1, type, y: frac).
% 0.19/0.27 thf(func_def_2, type, less: (frac > frac > $o)).
% 0.19/0.27 thf(func_def_3, type, pf: (frac > frac > frac)).
% 0.19/0.27 thf(func_def_4, type, more: (frac > frac > $o)).
% 0.19/0.27 thf(f1,axiom,(
% 0.19/0.27 ! [X0 : frac,X1 : frac] : ((more @ X0 @ X1) => (less @ X1 @ X0))),
% 0.19/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz42)).
% 0.19/0.27 thf(f2,axiom,(
% 0.19/0.27 ! [X0 : frac,X1 : frac] : (more @ (pf @ X0 @ X1) @ X0)),
% 0.19/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz60)).
% 0.19/0.27 thf(f3,conjecture,(
% 0.19/0.27 (less @ x @ (pf @ x @ y))),
% 0.19/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz60a)).
% 0.19/0.27 thf(f4,negated_conjecture,(
% 0.19/0.27 ~(less @ x @ (pf @ x @ y))),
% 0.19/0.27 inference(negated_conjecture,[status(cth)],[f3])).
% 0.19/0.27 thf(f5,plain,(
% 0.19/0.27 ! [X0 : frac,X1 : frac] : ((more @ X0 @ X1) => (less @ X1 @ X0))),
% 0.19/0.27 inference(rectify,[],[f1])).
% 0.19/0.27 thf(f6,plain,(
% 0.19/0.27 ! [X0 : frac,X1 : frac] : ((((more @ X0 @ X1)) = $true) => (((less @ X1 @ X0)) = $true))),
% 0.19/0.27 inference(fool_elimination,[],[f5])).
% 0.19/0.27 thf(f7,plain,(
% 0.19/0.27 ! [X0 : frac,X1 : frac] : (more @ (pf @ X0 @ X1) @ X0)),
% 0.19/0.27 inference(rectify,[],[f2])).
% 0.19/0.27 thf(f8,plain,(
% 0.19/0.27 ! [X0 : frac,X1 : frac] : (((more @ (pf @ X0 @ X1) @ X0)) = $true)),
% 0.19/0.27 inference(fool_elimination,[],[f7])).
% 0.19/0.27 thf(f9,plain,(
% 0.19/0.27 ~(less @ x @ (pf @ x @ y))),
% 0.19/0.27 inference(rectify,[],[f4])).
% 0.19/0.27 thf(f10,plain,(
% 0.19/0.27 ~ (((less @ x @ (pf @ x @ y))) = $true)),
% 0.19/0.27 inference(fool_elimination,[],[f9])).
% 0.19/0.27 thf(f11,plain,(
% 0.19/0.27 (((less @ x @ (pf @ x @ y))) != $true)),
% 0.19/0.27 inference(flattening,[],[f10])).
% 0.19/0.27 thf(f12,plain,(
% 0.19/0.27 ! [X0 : frac,X1 : frac] : ((((less @ X1 @ X0)) = $true) | (((more @ X0 @ X1)) != $true))),
% 0.19/0.27 inference(ennf_transformation,[],[f6])).
% 0.19/0.27 thf(f13,plain,(
% 0.19/0.27 ( ! [X0 : frac,X1 : frac] : ((((more @ X0 @ X1)) != $true) | (((less @ X1 @ X0)) = $true)) )),
% 0.19/0.27 inference(cnf_transformation,[],[f12])).
% 0.19/0.27 thf(f14,plain,(
% 0.19/0.27 ( ! [X0 : frac,X1 : frac] : ((((more @ (pf @ X0 @ X1) @ X0)) = $true)) )),
% 0.19/0.27 inference(cnf_transformation,[],[f8])).
% 0.19/0.27 thf(f15,plain,(
% 0.19/0.27 (((less @ x @ (pf @ x @ y))) != $true)),
% 0.19/0.27 inference(cnf_transformation,[],[f11])).
% 0.19/0.27 thf(f17,definition,(
% 0.19/0.27 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.19/0.27 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.19/0.27 thf(f20,plain,(
% 0.19/0.27 ($true != $true) | (((less @ x @ (pf @ x @ y))) = $false)),
% 0.19/0.27 inference(constrained_superposition,[],[f15,f17])).
% 0.19/0.27 thf(f22,plain,(
% 0.19/0.27 (((less @ x @ (pf @ x @ y))) = $false)),
% 0.19/0.27 inference(trivial_inequality_removal,[],[f20])).
% 0.19/0.27 thf(f31,plain,(
% 0.19/0.27 ( ! [X0 : frac,X1 : frac] : (($true != $true) | ($true = ((less @ X0 @ (pf @ X0 @ X1))))) )),
% 0.19/0.27 inference(constrained_superposition,[],[f13,f14])).
% 0.19/0.27 thf(f32,plain,(
% 0.19/0.27 ( ! [X0 : frac,X1 : frac] : (($true = ((less @ X0 @ (pf @ X0 @ X1))))) )),
% 0.19/0.27 inference(trivial_inequality_removal,[],[f31])).
% 0.19/0.27 thf(f36,plain,(
% 0.19/0.27 ($true = $false)),
% 0.19/0.27 inference(constrained_superposition,[],[f22,f32])).
% 0.19/0.27 thf(f37,plain,(
% 0.19/0.27 $false),
% 0.19/0.27 inference(trivial_inequality_removal,[],[f36])).
% 0.19/0.27 % SZS output end Proof for theBenchmark
% 0.19/0.27 % (40091)------------------------------
% 0.19/0.27 % (40091)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (40091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (40091)CaDiCaL version: 2.1.3
% 0.19/0.27 % (40091)Termination reason: Refutation
% 0.19/0.27 % (40091)Time elapsed: 0.001 s
% 0.19/0.27 % (40091)Peak memory usage: 12 MB
% 0.19/0.27 % (40091)Instructions burned: 2 (million)
% 0.19/0.27 % (40075)Success in time 0.026 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------