%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LAT385+1 : TPTP v9.3.1. Released v4.0.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 : Tue Sep 29 11:48:45 AM UTC 2026
% Result : CounterSatisfiable 0.17s 0.47s
% Output : FiniteModel 0.17s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tff('declare_$i1',type,
'fmb_$i_1': $i ).
tff('declare_$i2',type,
'fmb_$i_2': $i ).
tff('finite_domain_$i',axiom,
! [X: $i] :
( ( X = 'fmb_$i_1' )
| ( X = 'fmb_$i_2' ) ) ).
tff('distinct_domain_$i',axiom,
'fmb_$i_1' != 'fmb_$i_2' ).
tff(declare_xU,type,
xU: $i ).
tff(xU_definition,axiom,
xU = 'fmb_$i_1' ).
tff(declare_xf,type,
xf: $i ).
tff(xf_definition,axiom,
xf = 'fmb_$i_1' ).
tff(declare_xS,type,
xS: $i ).
tff(xS_definition,axiom,
xS = 'fmb_$i_2' ).
tff(declare_xT,type,
xT: $i ).
tff(xT_definition,axiom,
xT = 'fmb_$i_2' ).
tff(declare_xP,type,
xP: $i ).
tff(xP_definition,axiom,
xP = 'fmb_$i_2' ).
tff(declare_szDzozmdt0,type,
szDzozmdt0: $i > $i ).
tff(function_szDzozmdt0,axiom,
( ( szDzozmdt0('fmb_$i_1') = 'fmb_$i_1' )
& ( szDzozmdt0('fmb_$i_2') = 'fmb_$i_1' ) ) ).
tff(declare_szRzazndt0,type,
szRzazndt0: $i > $i ).
tff(function_szRzazndt0,axiom,
( ( szRzazndt0('fmb_$i_1') = 'fmb_$i_1' )
& ( szRzazndt0('fmb_$i_2') = 'fmb_$i_1' ) ) ).
tff(declare_sdtlpdtrp0,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff(function_sdtlpdtrp0,axiom,
( ( sdtlpdtrp0('fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
& ( sdtlpdtrp0('fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
& ( sdtlpdtrp0('fmb_$i_2','fmb_$i_1') = 'fmb_$i_2' )
& ( sdtlpdtrp0('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_cS1142,type,
cS1142: $i > $i ).
tff(function_cS1142,axiom,
( ( cS1142('fmb_$i_1') = 'fmb_$i_2' )
& ( cS1142('fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_cS1241,type,
cS1241: ( $i * $i * $i ) > $i ).
tff(function_cS1241,axiom,
( ( cS1241('fmb_$i_1','fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
& ( cS1241('fmb_$i_1','fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
& ( cS1241('fmb_$i_1','fmb_$i_2','fmb_$i_1') = 'fmb_$i_2' )
& ( cS1241('fmb_$i_1','fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' )
& ( cS1241('fmb_$i_2','fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
& ( cS1241('fmb_$i_2','fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
& ( cS1241('fmb_$i_2','fmb_$i_2','fmb_$i_1') = 'fmb_$i_2' )
& ( cS1241('fmb_$i_2','fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_aSet0,type,
aSet0: $i > $o ).
tff(predicate_aSet0,axiom,
( aSet0('fmb_$i_1')
& ~ aSet0('fmb_$i_2') ) ).
tff(declare_aElement0,type,
aElement0: $i > $o ).
tff(predicate_aElement0,axiom,
( ~ aElement0('fmb_$i_1')
& aElement0('fmb_$i_2') ) ).
tff(declare_aElementOf0,type,
aElementOf0: ( $i * $i ) > $o ).
tff(predicate_aElementOf0,axiom,
( ~ aElementOf0('fmb_$i_1','fmb_$i_1')
& aElementOf0('fmb_$i_1','fmb_$i_2')
& aElementOf0('fmb_$i_2','fmb_$i_1')
& aElementOf0('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_isEmpty0,type,
isEmpty0: $i > $o ).
tff(predicate_isEmpty0,axiom,
( ~ isEmpty0('fmb_$i_1')
& ~ isEmpty0('fmb_$i_2') ) ).
tff(declare_aSubsetOf0,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff(predicate_aSubsetOf0,axiom,
( aSubsetOf0('fmb_$i_1','fmb_$i_1')
& ~ aSubsetOf0('fmb_$i_1','fmb_$i_2')
& ~ aSubsetOf0('fmb_$i_2','fmb_$i_1')
& aSubsetOf0('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_sdtlseqdt0,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(predicate_sdtlseqdt0,axiom,
( ~ sdtlseqdt0('fmb_$i_1','fmb_$i_1')
& ~ sdtlseqdt0('fmb_$i_1','fmb_$i_2')
& ~ sdtlseqdt0('fmb_$i_2','fmb_$i_1')
& sdtlseqdt0('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aLowerBoundOfIn0,type,
aLowerBoundOfIn0: ( $i * $i * $i ) > $o ).
tff(predicate_aLowerBoundOfIn0,axiom,
( ~ aLowerBoundOfIn0('fmb_$i_1','fmb_$i_1','fmb_$i_1')
& aLowerBoundOfIn0('fmb_$i_1','fmb_$i_1','fmb_$i_2')
& aLowerBoundOfIn0('fmb_$i_1','fmb_$i_2','fmb_$i_1')
& aLowerBoundOfIn0('fmb_$i_1','fmb_$i_2','fmb_$i_2')
& aLowerBoundOfIn0('fmb_$i_2','fmb_$i_1','fmb_$i_1')
& aLowerBoundOfIn0('fmb_$i_2','fmb_$i_1','fmb_$i_2')
& aLowerBoundOfIn0('fmb_$i_2','fmb_$i_2','fmb_$i_1')
& aLowerBoundOfIn0('fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aUpperBoundOfIn0,type,
aUpperBoundOfIn0: ( $i * $i * $i ) > $o ).
tff(predicate_aUpperBoundOfIn0,axiom,
( ~ aUpperBoundOfIn0('fmb_$i_1','fmb_$i_1','fmb_$i_1')
& aUpperBoundOfIn0('fmb_$i_1','fmb_$i_1','fmb_$i_2')
& aUpperBoundOfIn0('fmb_$i_1','fmb_$i_2','fmb_$i_1')
& aUpperBoundOfIn0('fmb_$i_1','fmb_$i_2','fmb_$i_2')
& aUpperBoundOfIn0('fmb_$i_2','fmb_$i_1','fmb_$i_1')
& aUpperBoundOfIn0('fmb_$i_2','fmb_$i_1','fmb_$i_2')
& aUpperBoundOfIn0('fmb_$i_2','fmb_$i_2','fmb_$i_1')
& aUpperBoundOfIn0('fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aInfimumOfIn0,type,
aInfimumOfIn0: ( $i * $i * $i ) > $o ).
tff(predicate_aInfimumOfIn0,axiom,
( ~ aInfimumOfIn0('fmb_$i_1','fmb_$i_1','fmb_$i_1')
& aInfimumOfIn0('fmb_$i_1','fmb_$i_1','fmb_$i_2')
& ~ aInfimumOfIn0('fmb_$i_1','fmb_$i_2','fmb_$i_1')
& aInfimumOfIn0('fmb_$i_1','fmb_$i_2','fmb_$i_2')
& aInfimumOfIn0('fmb_$i_2','fmb_$i_1','fmb_$i_1')
& aInfimumOfIn0('fmb_$i_2','fmb_$i_1','fmb_$i_2')
& ~ aInfimumOfIn0('fmb_$i_2','fmb_$i_2','fmb_$i_1')
& aInfimumOfIn0('fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aSupremumOfIn0,type,
aSupremumOfIn0: ( $i * $i * $i ) > $o ).
tff(predicate_aSupremumOfIn0,axiom,
( ~ aSupremumOfIn0('fmb_$i_1','fmb_$i_1','fmb_$i_1')
& aSupremumOfIn0('fmb_$i_1','fmb_$i_1','fmb_$i_2')
& aSupremumOfIn0('fmb_$i_1','fmb_$i_2','fmb_$i_1')
& aSupremumOfIn0('fmb_$i_1','fmb_$i_2','fmb_$i_2')
& aSupremumOfIn0('fmb_$i_2','fmb_$i_1','fmb_$i_1')
& aSupremumOfIn0('fmb_$i_2','fmb_$i_1','fmb_$i_2')
& aSupremumOfIn0('fmb_$i_2','fmb_$i_2','fmb_$i_1')
& aSupremumOfIn0('fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aCompleteLattice0,type,
aCompleteLattice0: $i > $o ).
tff(predicate_aCompleteLattice0,axiom,
( aCompleteLattice0('fmb_$i_1')
& ~ aCompleteLattice0('fmb_$i_2') ) ).
tff(declare_aFunction0,type,
aFunction0: $i > $o ).
tff(predicate_aFunction0,axiom,
( aFunction0('fmb_$i_1')
& ~ aFunction0('fmb_$i_2') ) ).
tff(declare_isOn0,type,
isOn0: ( $i * $i ) > $o ).
tff(predicate_isOn0,axiom,
( isOn0('fmb_$i_1','fmb_$i_1')
& isOn0('fmb_$i_1','fmb_$i_2')
& isOn0('fmb_$i_2','fmb_$i_1')
& isOn0('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_aFixedPointOf0,type,
aFixedPointOf0: ( $i * $i ) > $o ).
tff(predicate_aFixedPointOf0,axiom,
( ~ aFixedPointOf0('fmb_$i_1','fmb_$i_1')
& aFixedPointOf0('fmb_$i_1','fmb_$i_2')
& aFixedPointOf0('fmb_$i_2','fmb_$i_1')
& aFixedPointOf0('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_isMonotone0,type,
isMonotone0: $i > $o ).
tff(predicate_isMonotone0,axiom,
( isMonotone0('fmb_$i_1')
& isMonotone0('fmb_$i_2') ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT385+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n008.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 15:13:55 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 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.17/0.47 % (1355588)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (1355593)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2622724955_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (1355594)% WARNING: option uhcvi not known.
% 0.17/0.47 % TRYING [1]
% 0.17/0.47 % TRYING [2]
% 0.17/0.47 % Finite Model Found!
% 0.17/0.47 % SZS status CounterSatisfiable for theBenchmark
% 0.17/0.47 % (1355593) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1355588-1355593"...
% 0.17/0.47 % (1355593)...printing done.
% 0.17/0.47 % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.17/0.47 % (1355593)------------------------------
% 0.17/0.47 % (1355593)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (1355593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (1355593)CaDiCaL version: 2.1.3
% 0.17/0.47 % (1355593)Termination reason: Satisfiable
% 0.17/0.47 % (1355593)Time elapsed: 0.003 s
% 0.17/0.47 % (1355593)Peak memory usage: 12 MB
% 0.17/0.47 % (1355593)Instructions burned: 10 (million)
% 0.17/0.47 % (1355588)Success in time 0.03 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------