%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL910+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 : n014.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.16s 0.47s
% Output : FiniteModel 0.16s
% 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_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_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 : LCL910+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n014.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 17:05:48 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/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.16/0.47 % (1016530)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (1016549)dis+10_1_sil=32000:sp=arity:random_seed=871799575:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (1016547)% WARNING: option uhcvi not known.
% 0.16/0.47 % (1016546)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=316816524_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % (1016547)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1884460637:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (1016550)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1655463934:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (1016548)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=245910849:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (1016552)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=934695617:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % (1016551)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=826383234:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % Finite Model Found!
% 0.16/0.47 % SZS status Satisfiable for theBenchmark
% 0.16/0.47 % (1016546) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1016530-1016546"...
% 0.16/0.47 % (1016546)...printing done.
% 0.16/0.47 % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.16/0.47 % (1016546)------------------------------
% 0.16/0.47 % (1016546)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (1016546)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (1016546)CaDiCaL version: 2.1.3
% 0.16/0.47 % (1016546)Termination reason: Satisfiable
% 0.16/0.47 % (1016546)Time elapsed: 0.002 s
% 0.16/0.47 % (1016546)Peak memory usage: 11 MB
% 0.16/0.47 % (1016546)Instructions burned: 2 (million)
% 0.16/0.47 % (1016530)Success in time 0.044 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------