%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL911+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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:58 PM UTC 2026
% Result : Satisfiable 0.18s 0.48s
% Output : FiniteModel 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tff('declare_$i1',type,
'fmb_$i_1': $i ).
tff('finite_domain_$i',axiom,
! [X: $i] : ( X = 'fmb_$i_1' ) ).
tff(declare_implies,type,
implies: ( $i * $i ) > $i ).
tff(function_implies,axiom,
implies('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' ).
tff(declare_equiv,type,
equiv: ( $i * $i ) > $i ).
tff(function_equiv,axiom,
equiv('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' ).
tff(declare_not,type,
not: $i > $i ).
tff(function_not,axiom,
not('fmb_$i_1') = 'fmb_$i_1' ).
tff(declare_and,type,
and: ( $i * $i ) > $i ).
tff(function_and,axiom,
and('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' ).
tff(declare_or,type,
or: ( $i * $i ) > $i ).
tff(function_or,axiom,
or('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' ).
tff(declare_necessarily,type,
necessarily: $i > $i ).
tff(function_necessarily,axiom,
necessarily('fmb_$i_1') = 'fmb_$i_1' ).
tff(declare_strict_implies,type,
strict_implies: ( $i * $i ) > $i ).
tff(function_strict_implies,axiom,
strict_implies('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' ).
tff(declare_strict_equiv,type,
strict_equiv: ( $i * $i ) > $i ).
tff(function_strict_equiv,axiom,
strict_equiv('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' ).
tff(declare_possibly,type,
possibly: $i > $i ).
tff(function_possibly,axiom,
possibly('fmb_$i_1') = 'fmb_$i_1' ).
tff(declare_modus_ponens,type,
modus_ponens: $o ).
tff(modus_ponens_definition,axiom,
modus_ponens ).
tff(declare_substitution_of_equivalents,type,
substitution_of_equivalents: $o ).
tff(substitution_of_equivalents_definition,axiom,
substitution_of_equivalents ).
tff(declare_modus_tollens,type,
modus_tollens: $o ).
tff(modus_tollens_definition,axiom,
modus_tollens ).
tff(declare_implies_1,type,
implies_1: $o ).
tff(implies_1_definition,axiom,
implies_1 ).
tff(declare_implies_2,type,
implies_2: $o ).
tff(implies_2_definition,axiom,
implies_2 ).
tff(declare_implies_3,type,
implies_3: $o ).
tff(implies_3_definition,axiom,
implies_3 ).
tff(declare_and_1,type,
and_1: $o ).
tff(and_1_definition,axiom,
and_1 ).
tff(declare_and_2,type,
and_2: $o ).
tff(and_2_definition,axiom,
and_2 ).
tff(declare_and_3,type,
and_3: $o ).
tff(and_3_definition,axiom,
and_3 ).
tff(declare_or_1,type,
or_1: $o ).
tff(or_1_definition,axiom,
or_1 ).
tff(declare_or_2,type,
or_2: $o ).
tff(or_2_definition,axiom,
or_2 ).
tff(declare_or_3,type,
or_3: $o ).
tff(or_3_definition,axiom,
or_3 ).
tff(declare_equivalence_1,type,
equivalence_1: $o ).
tff(equivalence_1_definition,axiom,
equivalence_1 ).
tff(declare_equivalence_2,type,
equivalence_2: $o ).
tff(equivalence_2_definition,axiom,
equivalence_2 ).
tff(declare_equivalence_3,type,
equivalence_3: $o ).
tff(equivalence_3_definition,axiom,
equivalence_3 ).
tff(declare_kn1,type,
kn1: $o ).
tff(kn1_definition,axiom,
kn1 ).
tff(declare_kn2,type,
kn2: $o ).
tff(kn2_definition,axiom,
kn2 ).
tff(declare_kn3,type,
kn3: $o ).
tff(kn3_definition,axiom,
kn3 ).
tff(declare_cn1,type,
cn1: $o ).
tff(cn1_definition,axiom,
cn1 ).
tff(declare_cn2,type,
cn2: $o ).
tff(cn2_definition,axiom,
cn2 ).
tff(declare_cn3,type,
cn3: $o ).
tff(cn3_definition,axiom,
cn3 ).
tff(declare_r1,type,
r1: $o ).
tff(r1_definition,axiom,
r1 ).
tff(declare_r2,type,
r2: $o ).
tff(r2_definition,axiom,
r2 ).
tff(declare_r3,type,
r3: $o ).
tff(r3_definition,axiom,
r3 ).
tff(declare_r4,type,
r4: $o ).
tff(r4_definition,axiom,
r4 ).
tff(declare_r5,type,
r5: $o ).
tff(r5_definition,axiom,
r5 ).
tff(declare_op_or,type,
op_or: $o ).
tff(op_or_definition,axiom,
op_or ).
tff(declare_op_and,type,
op_and: $o ).
tff(op_and_definition,axiom,
~ op_and ).
tff(declare_op_implies_and,type,
op_implies_and: $o ).
tff(op_implies_and_definition,axiom,
op_implies_and ).
tff(declare_op_implies_or,type,
op_implies_or: $o ).
tff(op_implies_or_definition,axiom,
~ op_implies_or ).
tff(declare_op_equiv,type,
op_equiv: $o ).
tff(op_equiv_definition,axiom,
op_equiv ).
tff(declare_necessitation,type,
necessitation: $o ).
tff(necessitation_definition,axiom,
necessitation ).
tff(declare_modus_ponens_strict_implies,type,
modus_ponens_strict_implies: $o ).
tff(modus_ponens_strict_implies_definition,axiom,
modus_ponens_strict_implies ).
tff(declare_adjunction,type,
adjunction: $o ).
tff(adjunction_definition,axiom,
adjunction ).
tff(declare_substitution_strict_equiv,type,
substitution_strict_equiv: $o ).
tff(substitution_strict_equiv_definition,axiom,
substitution_strict_equiv ).
tff(declare_axiom_K,type,
axiom_K: $o ).
tff(axiom_K_definition,axiom,
axiom_K ).
tff(declare_axiom_M,type,
axiom_M: $o ).
tff(axiom_M_definition,axiom,
axiom_M ).
tff(declare_axiom_4,type,
axiom_4: $o ).
tff(axiom_4_definition,axiom,
axiom_4 ).
tff(declare_axiom_B,type,
axiom_B: $o ).
tff(axiom_B_definition,axiom,
axiom_B ).
tff(declare_axiom_5,type,
axiom_5: $o ).
tff(axiom_5_definition,axiom,
axiom_5 ).
tff(declare_axiom_s1,type,
axiom_s1: $o ).
tff(axiom_s1_definition,axiom,
axiom_s1 ).
tff(declare_axiom_s2,type,
axiom_s2: $o ).
tff(axiom_s2_definition,axiom,
axiom_s2 ).
tff(declare_axiom_s3,type,
axiom_s3: $o ).
tff(axiom_s3_definition,axiom,
axiom_s3 ).
tff(declare_axiom_s4,type,
axiom_s4: $o ).
tff(axiom_s4_definition,axiom,
axiom_s4 ).
tff(declare_axiom_m1,type,
axiom_m1: $o ).
tff(axiom_m1_definition,axiom,
axiom_m1 ).
tff(declare_axiom_m2,type,
axiom_m2: $o ).
tff(axiom_m2_definition,axiom,
axiom_m2 ).
tff(declare_axiom_m3,type,
axiom_m3: $o ).
tff(axiom_m3_definition,axiom,
axiom_m3 ).
tff(declare_axiom_m4,type,
axiom_m4: $o ).
tff(axiom_m4_definition,axiom,
axiom_m4 ).
tff(declare_axiom_m5,type,
axiom_m5: $o ).
tff(axiom_m5_definition,axiom,
axiom_m5 ).
tff(declare_axiom_m6,type,
axiom_m6: $o ).
tff(axiom_m6_definition,axiom,
axiom_m6 ).
tff(declare_axiom_m7,type,
axiom_m7: $o ).
tff(axiom_m7_definition,axiom,
axiom_m7 ).
tff(declare_axiom_m8,type,
axiom_m8: $o ).
tff(axiom_m8_definition,axiom,
axiom_m8 ).
tff(declare_axiom_m9,type,
axiom_m9: $o ).
tff(axiom_m9_definition,axiom,
axiom_m9 ).
tff(declare_axiom_m10,type,
axiom_m10: $o ).
tff(axiom_m10_definition,axiom,
axiom_m10 ).
tff(declare_op_possibly,type,
op_possibly: $o ).
tff(op_possibly_definition,axiom,
op_possibly ).
tff(declare_op_necessarily,type,
op_necessarily: $o ).
tff(op_necessarily_definition,axiom,
~ op_necessarily ).
tff(declare_op_strict_implies,type,
op_strict_implies: $o ).
tff(op_strict_implies_definition,axiom,
~ op_strict_implies ).
tff(declare_op_strict_equiv,type,
op_strict_equiv: $o ).
tff(op_strict_equiv_definition,axiom,
~ op_strict_equiv ).
tff(declare_is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(predicate_is_a_theorem,axiom,
is_a_theorem('fmb_$i_1') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL911+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n003.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 17:07:41 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/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.18/0.48 % (790502)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (790517)dis+10_1_sil=32000:sp=arity:random_seed=3866006358:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48 % (790515)% WARNING: option uhcvi not known.
% 0.18/0.48 % (790515)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=728630344:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48 % (790514)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3702241530_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48 % (790519)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=234025747:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48 % (790516)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2645695451:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48 % (790518)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3874766203:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48 % (790520)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=887179608:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.48 % TRYING [1]
% 0.18/0.48 % Finite Model Found!
% 0.18/0.48 % SZS status Satisfiable for theBenchmark
% 0.18/0.48 % (790514) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-790502-790514"...
% 0.18/0.48 % (790516) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-790502-790516"...
% 0.18/0.48 % (790514)...printing done.
% 0.18/0.48 % (790516)...printing done.
% 0.18/0.48 % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.18/0.48 % (790514)------------------------------
% 0.18/0.48 % (790514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (790514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (790514)CaDiCaL version: 2.1.3
% 0.18/0.48 % (790514)Termination reason: Satisfiable
% 0.18/0.48 % (790514)Time elapsed: 0.004 s
% 0.18/0.48 % (790514)Peak memory usage: 11 MB
% 0.18/0.48 % (790514)Instructions burned: 5 (million)
% 0.18/0.48 % (790502)Success in time 0.05 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------