%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM783^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 : n008.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:31 AM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : Refutation 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM783^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.08/0.18 % Computer : n008.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 12:56:09 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.08/0.26 % (3105021)Will run a generic schedule for satisfiability detection.
% 0.08/0.26 % (3105031)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1880410653:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.26 % (3105031) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3105021-3105031"...
% 0.08/0.26 % (3105031)...printing done.
% 0.08/0.26 % (3105027)% WARNING: option uhcvi not known.
% 0.08/0.26 % (3105031)Refutation found. Thanks to Tanya!
% 0.08/0.26 % SZS status Theorem for theBenchmark
% 0.08/0.26 % SZS output start Proof for theBenchmark
% 0.08/0.26 thf(type_def_5, type, rat: $tType).
% 0.08/0.26 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.08/0.26 thf(func_def_0, type, x0: rat).
% 0.08/0.26 thf(func_def_1, type, y0: rat).
% 0.08/0.26 thf(func_def_2, type, or3: ($o > $o > $o > $o)).
% 0.08/0.26 thf(func_def_3, type, is: (rat > rat > $o)).
% 0.08/0.26 thf(func_def_4, type, more: (rat > rat > $o)).
% 0.08/0.26 thf(func_def_5, type, less: (rat > rat > $o)).
% 0.08/0.26 thf(func_def_6, type, ec3: ($o > $o > $o > $o)).
% 0.08/0.26 thf(func_def_10, type, vNOT: ($o > $o)).
% 0.08/0.26 thf(f2,axiom,(
% 0.08/0.26 ! [X0 : rat,X1 : rat] : ~((or3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1)) => ~(ec3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1)))),
% 0.08/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81)).
% 0.08/0.26 thf(f3,conjecture,(
% 0.08/0.26 (or3 @ (is @ x0 @ y0) @ (more @ x0 @ y0) @ (less @ x0 @ y0))),
% 0.08/0.26 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81a)).
% 0.08/0.26 thf(f4,negated_conjecture,(
% 0.08/0.26 ~(or3 @ (is @ x0 @ y0) @ (more @ x0 @ y0) @ (less @ x0 @ y0))),
% 0.08/0.26 inference(negated_conjecture,[status(cth)],[f3])).
% 0.08/0.26 thf(f7,plain,(
% 0.08/0.26 ! [X0 : rat,X1 : rat] : ~((or3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1)) => ~(ec3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1)))),
% 0.08/0.26 inference(rectify,[],[f2])).
% 0.08/0.26 thf(f8,plain,(
% 0.08/0.26 ! [X0 : rat,X1 : rat] : ~((((or3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1))) = $true) => ~ (((ec3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1))) = $true))),
% 0.08/0.26 inference(fool_elimination,[],[f7])).
% 0.08/0.26 thf(f9,plain,(
% 0.08/0.26 ~(or3 @ (is @ x0 @ y0) @ (more @ x0 @ y0) @ (less @ x0 @ y0))),
% 0.08/0.26 inference(rectify,[],[f4])).
% 0.08/0.26 thf(f10,plain,(
% 0.08/0.26 ~ (((or3 @ (is @ x0 @ y0) @ (more @ x0 @ y0) @ (less @ x0 @ y0))) = $true)),
% 0.08/0.26 inference(fool_elimination,[],[f9])).
% 0.08/0.26 thf(f12,plain,(
% 0.08/0.26 ! [X0 : rat,X1 : rat] : ~((((or3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1))) = $true) => (((ec3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1))) != $true))),
% 0.08/0.26 inference(flattening,[],[f8])).
% 0.08/0.26 thf(f13,plain,(
% 0.08/0.26 (((or3 @ (is @ x0 @ y0) @ (more @ x0 @ y0) @ (less @ x0 @ y0))) != $true)),
% 0.08/0.26 inference(flattening,[],[f10])).
% 0.08/0.26 thf(f15,plain,(
% 0.08/0.26 ! [X0 : rat,X1 : rat] : ((((ec3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1))) = $true) & (((or3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1))) = $true))),
% 0.08/0.26 inference(ennf_transformation,[],[f12])).
% 0.08/0.26 thf(f17,plain,(
% 0.08/0.26 ( ! [X0 : rat,X1 : rat] : ((((or3 @ (is @ X0 @ X1) @ (more @ X0 @ X1) @ (less @ X0 @ X1))) = $true)) )),
% 0.08/0.26 inference(cnf_transformation,[],[f15])).
% 0.08/0.26 thf(f19,plain,(
% 0.08/0.26 (((or3 @ (is @ x0 @ y0) @ (more @ x0 @ y0) @ (less @ x0 @ y0))) != $true)),
% 0.08/0.26 inference(cnf_transformation,[],[f13])).
% 0.08/0.26 thf(f21,definition,(
% 0.08/0.26 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.08/0.26 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.08/0.26 thf(f27,plain,(
% 0.08/0.26 ($true != $true) | (((or3 @ (is @ x0 @ y0) @ (more @ x0 @ y0) @ (less @ x0 @ y0))) = $false)),
% 0.08/0.26 inference(constrained_superposition,[],[f19,f21])).
% 0.08/0.26 thf(f29,plain,(
% 0.08/0.26 (((or3 @ (is @ x0 @ y0) @ (more @ x0 @ y0) @ (less @ x0 @ y0))) = $false)),
% 0.08/0.26 inference(trivial_inequality_removal,[],[f27])).
% 0.08/0.26 thf(f34,plain,(
% 0.08/0.26 ($true = $false)),
% 0.08/0.26 inference(forward_demodulation,[],[f29,f17])).
% 0.08/0.26 thf(f35,plain,(
% 0.08/0.26 $false),
% 0.08/0.26 inference(trivial_inequality_removal,[],[f34])).
% 0.08/0.26 % SZS output end Proof for theBenchmark
% 0.08/0.26 % (3105031)------------------------------
% 0.08/0.26 % (3105031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26 % (3105031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26 % (3105031)CaDiCaL version: 2.1.3
% 0.08/0.26 % (3105031)Termination reason: Refutation
% 0.08/0.26 % (3105031)Time elapsed: 0.001 s
% 0.08/0.26 % (3105031)Peak memory usage: 12 MB
% 0.08/0.26 % (3105031)Instructions burned: 2 (million)
% 0.08/0.26 % (3105021)Success in time 0.033 s
% 0.08/0.26 % Vampire exiting
%------------------------------------------------------------------------------