%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL756_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 : Tue Sep 29 12:00:29 PM UTC 2026
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 36 ( 36 usr; 5 con; 0-5 aty)
% Number of variables : 4 ( 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
var: nat > dB ).
tff(func_def_2,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_3,type,
dB_rec:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,fun(X0,fun(X0,X0)))) * fun(dB,fun(X0,X0)) * dB ) > X0 ) ).
tff(func_def_4,type,
lift: ( dB * nat ) > dB ).
tff(func_def_5,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_6,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_7,type,
suc: nat > nat ).
tff(func_def_8,type,
semiri532925092at_aux:
!>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).
tff(func_def_9,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_10,type,
fFalse: bool ).
tff(func_def_11,type,
fTrue: bool ).
tff(func_def_12,type,
ia: nat ).
tff(func_def_13,type,
ja: nat ).
tff(func_def_14,type,
ra: dB ).
tff(func_def_15,type,
sK0:
!>[X0: $tType] : ( fun(nat,X0) > nat ) ).
tff(func_def_16,type,
sK1:
!>[X0: $tType] : ( fun(nat,X0) > nat ) ).
tff(func_def_17,type,
sK2: ( nat * nat ) > nat ).
tff(func_def_18,type,
sK3: ( nat * nat ) > nat ).
tff(func_def_19,type,
sK4: fun(nat,fun(nat,bool)) > nat ).
tff(func_def_20,type,
sK5: fun(nat,fun(nat,bool)) > nat ).
tff(func_def_21,type,
sK6: fun(nat,fun(nat,bool)) > nat ).
tff(func_def_22,type,
sK7: fun(nat,fun(nat,bool)) > nat ).
tff(func_def_23,type,
sK8: ( fun(nat,bool) * nat ) > nat ).
tff(func_def_24,type,
sK9: ( fun(nat,bool) * nat ) > nat ).
tff(func_def_25,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_26,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_27,type,
sK12:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_28,type,
sK13:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_29,type,
sK14:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_30,type,
sK15:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_31,type,
sK16:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_32,type,
sK17:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_33,type,
sK18: ( nat * nat ) > nat ).
tff(func_def_34,type,
sK19: ( nat * nat ) > nat ).
tff(pred_def_1,type,
ord:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
dense_linorder:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
ordere223160158up_add:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
it: dB > $o ).
tff(pred_def_13,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_14,type,
pp: bool > $o ).
tff(f117,axiom,
! [X0: nat,X1: nat] : it(subst(ra,var(X0),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f118,conjecture,
it(subst(ra,var(suc(ia)),suc(ja))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).
tff(f119,negated_conjecture,
~ it(subst(ra,var(suc(ia)),suc(ja))),
inference(negated_conjecture,[status(cth)],[f118]) ).
tff(f123,plain,
~ it(subst(ra,var(suc(ia)),suc(ja))),
inference(flattening,[],[f119]) ).
tff(f413,plain,
! [X0: nat,X1: nat] : it(subst(ra,var(X0),X1)),
inference(cnf_transformation,[],[f117]) ).
tff(f414,plain,
~ it(subst(ra,var(suc(ia)),suc(ja))),
inference(cnf_transformation,[],[f123]) ).
tff(f472,plain,
$false,
inference(resolution,[],[f413,f414]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL756_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n008.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 16:45:39 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.19/0.47 % (1445398)Will run a generic schedule for satisfiability detection.
% 0.19/0.47 % (1445405)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1156624937:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.47 % (1445404)% WARNING: option uhcvi not known.
% 0.19/0.47 % (1445405) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1445398-1445405"...
% 0.19/0.47 % (1445405)...printing done.
% 0.19/0.47 % (1445405)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (1445405)------------------------------
% 0.19/0.47 % (1445405)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.47 % (1445405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.47 % (1445405)CaDiCaL version: 2.1.3
% 0.19/0.47 % (1445405)Termination reason: Refutation
% 0.19/0.47 % (1445405)Time elapsed: 0.004 s
% 0.19/0.47 % (1445405)Peak memory usage: 12 MB
% 0.19/0.47 % (1445405)Instructions burned: 10 (million)
% 0.19/0.47 % (1445398)Success in time 0.038 s
% 0.19/0.47 % Vampire exiting
%------------------------------------------------------------------------------