%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM694^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 : n013.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:20 AM UTC 2026
% Result : Theorem 0.06s 0.29s
% Output : Refutation 0.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM694^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.06/0.18 % Computer : n013.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Tue Sep 29 12:40:16 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.06/0.22 Running first-order model finding
% 0.06/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.06/0.29 % (2043714)Will run a generic schedule for satisfiability detection.
% 0.06/0.29 % (2043720)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3420186102_2999 on theBenchmark for (2999ds/0Mi)
% 0.06/0.29 % Exception at run slice level
% 0.06/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.06/0.29 % (2043728)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2824014294:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.06/0.29 % Exception at run slice level
% 0.06/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.06/0.29 % (2043731)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3837482222:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.06/0.29 % (2043722)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1374379640:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.06/0.29 % (2043731) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2043714-2043731"...
% 0.06/0.29 % (2043731)...printing done.
% 0.06/0.29 % (2043731)Refutation found. Thanks to Tanya!
% 0.06/0.29 % SZS status Theorem for theBenchmark
% 0.06/0.29 % SZS output start Proof for theBenchmark
% 0.06/0.29 thf(type_def_5, type, nat: $tType).
% 0.06/0.29 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.06/0.29 thf(func_def_0, type, x: nat).
% 0.06/0.29 thf(func_def_1, type, lessis: (nat > nat > $o)).
% 0.06/0.29 thf(func_def_2, type, n_1: nat).
% 0.06/0.29 thf(func_def_3, type, moreis: (nat > nat > $o)).
% 0.06/0.29 thf(f1,axiom,(
% 0.06/0.29 ! [X0 : nat,X1 : nat] : ((moreis @ X0 @ X1) => (lessis @ X1 @ X0))),
% 0.06/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz13)).
% 0.06/0.29 thf(f2,axiom,(
% 0.06/0.29 ! [X0 : nat] : (moreis @ X0 @ n_1)),
% 0.06/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz24)).
% 0.06/0.29 thf(f3,conjecture,(
% 0.06/0.29 (lessis @ n_1 @ x)),
% 0.06/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz24a)).
% 0.06/0.29 thf(f4,negated_conjecture,(
% 0.06/0.29 ~(lessis @ n_1 @ x)),
% 0.06/0.29 inference(negated_conjecture,[status(cth)],[f3])).
% 0.06/0.29 thf(f5,plain,(
% 0.06/0.29 ! [X0 : nat,X1 : nat] : ((moreis @ X0 @ X1) => (lessis @ X1 @ X0))),
% 0.06/0.29 inference(rectify,[],[f1])).
% 0.06/0.29 thf(f6,plain,(
% 0.06/0.29 ! [X0 : nat,X1 : nat] : ((((moreis @ X0 @ X1)) = $true) => (((lessis @ X1 @ X0)) = $true))),
% 0.06/0.29 inference(fool_elimination,[],[f5])).
% 0.06/0.29 thf(f7,plain,(
% 0.06/0.29 ! [X0 : nat] : (moreis @ X0 @ n_1)),
% 0.06/0.29 inference(rectify,[],[f2])).
% 0.06/0.29 thf(f8,plain,(
% 0.06/0.29 ! [X0 : nat] : (((moreis @ X0 @ n_1)) = $true)),
% 0.06/0.29 inference(fool_elimination,[],[f7])).
% 0.06/0.29 thf(f9,plain,(
% 0.06/0.29 ~(lessis @ n_1 @ x)),
% 0.06/0.29 inference(rectify,[],[f4])).
% 0.06/0.29 thf(f10,plain,(
% 0.06/0.29 ~ (((lessis @ n_1 @ x)) = $true)),
% 0.06/0.29 inference(fool_elimination,[],[f9])).
% 0.06/0.29 thf(f11,plain,(
% 0.06/0.29 (((lessis @ n_1 @ x)) != $true)),
% 0.06/0.29 inference(flattening,[],[f10])).
% 0.06/0.29 thf(f12,plain,(
% 0.06/0.29 ! [X0 : nat,X1 : nat] : ((((lessis @ X1 @ X0)) = $true) | (((moreis @ X0 @ X1)) != $true))),
% 0.06/0.29 inference(ennf_transformation,[],[f6])).
% 0.06/0.29 thf(f13,plain,(
% 0.06/0.29 ( ! [X0 : nat,X1 : nat] : ((((moreis @ X0 @ X1)) != $true) | (((lessis @ X1 @ X0)) = $true)) )),
% 0.06/0.29 inference(cnf_transformation,[],[f12])).
% 0.06/0.29 thf(f14,plain,(
% 0.06/0.29 ( ! [X0 : nat] : ((((moreis @ X0 @ n_1)) = $true)) )),
% 0.06/0.29 inference(cnf_transformation,[],[f8])).
% 0.06/0.29 thf(f15,plain,(
% 0.06/0.29 (((lessis @ n_1 @ x)) != $true)),
% 0.06/0.29 inference(cnf_transformation,[],[f11])).
% 0.06/0.29 thf(f17,definition,(
% 0.06/0.29 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.06/0.29 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.06/0.29 thf(f20,plain,(
% 0.06/0.29 ($true != $true) | (((lessis @ n_1 @ x)) = $false)),
% 0.06/0.29 inference(constrained_superposition,[],[f15,f17])).
% 0.06/0.29 thf(f22,plain,(
% 0.06/0.29 (((lessis @ n_1 @ x)) = $false)),
% 0.06/0.29 inference(trivial_inequality_removal,[],[f20])).
% 0.06/0.29 thf(f31,plain,(
% 0.06/0.29 ( ! [X0 : nat] : (($true != $true) | ($true = ((lessis @ n_1 @ X0)))) )),
% 0.06/0.29 inference(constrained_superposition,[],[f13,f14])).
% 0.06/0.29 thf(f32,plain,(
% 0.06/0.29 ( ! [X0 : nat] : (($true = ((lessis @ n_1 @ X0)))) )),
% 0.06/0.29 inference(trivial_inequality_removal,[],[f31])).
% 0.06/0.29 thf(f34,plain,(
% 0.06/0.29 ($true = $false)),
% 0.06/0.29 inference(backward_demodulation,[],[f22,f32])).
% 0.06/0.29 thf(f35,plain,(
% 0.06/0.29 $false),
% 0.06/0.29 inference(trivial_inequality_removal,[],[f34])).
% 0.06/0.29 % SZS output end Proof for theBenchmark
% 0.06/0.29 % (2043731)------------------------------
% 0.06/0.29 % (2043731)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.06/0.29 % (2043731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.06/0.29 % (2043731)CaDiCaL version: 2.1.3
% 0.06/0.29 % (2043731)Termination reason: Refutation
% 0.06/0.29 % (2043731)Time elapsed: 0.001 s
% 0.06/0.29 % (2043731)Peak memory usage: 12 MB
% 0.06/0.29 % (2043731)Instructions burned: 2 (million)
% 0.06/0.29 % (2043714)Success in time 0.055 s
% 0.06/0.29 % Vampire exiting
%------------------------------------------------------------------------------