%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS007-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:42:04 AM UTC 2026
% Result : Satisfiable 0.16s 0.46s
% Output : FiniteModel 0.16s
% 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('declare_$i3',type,
'fmb_$i_3': $i ).
tff('finite_domain_$i',axiom,
! [X: $i] :
( ( X = 'fmb_$i_1' )
| ( X = 'fmb_$i_2' )
| ( X = 'fmb_$i_3' ) ) ).
tff('distinct_domain_$i',axiom,
( ( 'fmb_$i_1' != 'fmb_$i_2' )
& ( 'fmb_$i_1' != 'fmb_$i_3' )
& ( 'fmb_$i_2' != 'fmb_$i_3' ) ) ).
tff(declare_exist,type,
exist: $i ).
tff(exist_definition,axiom,
exist = 'fmb_$i_1' ).
tff(declare_u1r2,type,
u1r2: $i > $i ).
tff(function_u1r2,axiom,
( ( u1r2('fmb_$i_1') = 'fmb_$i_2' )
& ( u1r2('fmb_$i_2') = 'fmb_$i_3' )
& ( u1r2('fmb_$i_3') = 'fmb_$i_3' ) ) ).
tff(declare_u1r1,type,
u1r1: $i > $i ).
tff(function_u1r1,axiom,
( ( u1r1('fmb_$i_1') = 'fmb_$i_3' )
& ( u1r1('fmb_$i_2') = 'fmb_$i_3' )
& ( u1r1('fmb_$i_3') = 'fmb_$i_3' ) ) ).
tff(declare_u3r2,type,
u3r2: $i > $i ).
tff(function_u3r2,axiom,
( ( u3r2('fmb_$i_1') = 'fmb_$i_3' )
& ( u3r2('fmb_$i_2') = 'fmb_$i_3' )
& ( u3r2('fmb_$i_3') = 'fmb_$i_3' ) ) ).
tff(declare_u3r1,type,
u3r1: $i > $i ).
tff(function_u3r1,axiom,
( ( u3r1('fmb_$i_1') = 'fmb_$i_3' )
& ( u3r1('fmb_$i_2') = 'fmb_$i_3' )
& ( u3r1('fmb_$i_3') = 'fmb_$i_3' ) ) ).
tff(declare_u4r3,type,
u4r3: $i > $i ).
tff(function_u4r3,axiom,
( ( u4r3('fmb_$i_1') = 'fmb_$i_2' )
& ( u4r3('fmb_$i_2') = 'fmb_$i_2' )
& ( u4r3('fmb_$i_3') = 'fmb_$i_2' ) ) ).
tff(declare_u4r2,type,
u4r2: $i > $i ).
tff(function_u4r2,axiom,
( ( u4r2('fmb_$i_1') = 'fmb_$i_1' )
& ( u4r2('fmb_$i_2') = 'fmb_$i_1' )
& ( u4r2('fmb_$i_3') = 'fmb_$i_1' ) ) ).
tff(declare_u4r1,type,
u4r1: $i > $i ).
tff(function_u4r1,axiom,
( ( u4r1('fmb_$i_1') = 'fmb_$i_2' )
& ( u4r1('fmb_$i_2') = 'fmb_$i_2' )
& ( u4r1('fmb_$i_3') = 'fmb_$i_2' ) ) ).
tff(declare_u6r2,type,
u6r2: $i > $i ).
tff(function_u6r2,axiom,
( ( u6r2('fmb_$i_1') = 'fmb_$i_3' )
& ( u6r2('fmb_$i_2') = 'fmb_$i_3' )
& ( u6r2('fmb_$i_3') = 'fmb_$i_3' ) ) ).
tff(declare_u6r1,type,
u6r1: $i > $i ).
tff(function_u6r1,axiom,
( ( u6r1('fmb_$i_1') = 'fmb_$i_3' )
& ( u6r1('fmb_$i_2') = 'fmb_$i_3' )
& ( u6r1('fmb_$i_3') = 'fmb_$i_3' ) ) ).
tff(declare_e,type,
e: $i > $o ).
tff(predicate_e,axiom,
( e('fmb_$i_1')
& e('fmb_$i_2')
& e('fmb_$i_3') ) ).
tff(declare_f,type,
f: $i > $o ).
tff(predicate_f,axiom,
( ~ f('fmb_$i_1')
& ~ f('fmb_$i_2')
& ~ f('fmb_$i_3') ) ).
tff(declare_s2least,type,
s2least: $i > $o ).
tff(predicate_s2least,axiom,
( s2least('fmb_$i_1')
& ~ s2least('fmb_$i_2')
& ~ s2least('fmb_$i_3') ) ).
tff(declare_c,type,
c: $i > $o ).
tff(predicate_c,axiom,
( c('fmb_$i_1')
& ~ c('fmb_$i_2')
& ~ c('fmb_$i_3') ) ).
tff(declare_equalish,type,
equalish: ( $i * $i ) > $o ).
tff(predicate_equalish,axiom,
( equalish('fmb_$i_1','fmb_$i_1')
& equalish('fmb_$i_1','fmb_$i_2')
& equalish('fmb_$i_1','fmb_$i_3')
& equalish('fmb_$i_2','fmb_$i_1')
& equalish('fmb_$i_2','fmb_$i_2')
& ~ equalish('fmb_$i_2','fmb_$i_3')
& equalish('fmb_$i_3','fmb_$i_1')
& equalish('fmb_$i_3','fmb_$i_2')
& ~ equalish('fmb_$i_3','fmb_$i_3') ) ).
tff(declare_s,type,
s: ( $i * $i ) > $o ).
tff(predicate_s,axiom,
( s('fmb_$i_1','fmb_$i_1')
& s('fmb_$i_1','fmb_$i_2')
& s('fmb_$i_1','fmb_$i_3')
& s('fmb_$i_2','fmb_$i_1')
& s('fmb_$i_2','fmb_$i_2')
& ~ s('fmb_$i_2','fmb_$i_3')
& s('fmb_$i_3','fmb_$i_1')
& s('fmb_$i_3','fmb_$i_2')
& ~ s('fmb_$i_3','fmb_$i_3') ) ).
tff(declare_s1most,type,
s1most: $i > $o ).
tff(predicate_s1most,axiom,
( ~ s1most('fmb_$i_1')
& s1most('fmb_$i_2')
& s1most('fmb_$i_3') ) ).
tff(declare_d,type,
d: $i > $o ).
tff(predicate_d,axiom,
( ~ d('fmb_$i_1')
& d('fmb_$i_2')
& d('fmb_$i_3') ) ).
tff(declare_r,type,
r: ( $i * $i ) > $o ).
tff(predicate_r,axiom,
( r('fmb_$i_1','fmb_$i_1')
& r('fmb_$i_1','fmb_$i_2')
& ~ r('fmb_$i_1','fmb_$i_3')
& r('fmb_$i_2','fmb_$i_1')
& r('fmb_$i_2','fmb_$i_2')
& ~ r('fmb_$i_2','fmb_$i_3')
& r('fmb_$i_3','fmb_$i_1')
& r('fmb_$i_3','fmb_$i_2')
& ~ r('fmb_$i_3','fmb_$i_3') ) ).
tff(declare_r2least,type,
r2least: $i > $o ).
tff(predicate_r2least,axiom,
( ~ r2least('fmb_$i_1')
& ~ r2least('fmb_$i_2')
& ~ r2least('fmb_$i_3') ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS007-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n009.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 13:16:15 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.42 Running first-order model finding
% 0.16/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.46 % (2034682)Will run a generic schedule for satisfiability detection.
% 0.16/0.46 % (2034705)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4198723872_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.46 % TRYING [1]
% 0.16/0.46 % TRYING [2]
% 0.16/0.46 % TRYING [3]
% 0.16/0.46 % Finite Model Found!
% 0.16/0.46 % SZS status Satisfiable for theBenchmark
% 0.16/0.46 % (2034705) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2034682-2034705"...
% 0.16/0.46 % (2034705)...printing done.
% 0.16/0.46 % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.16/0.46 % (2034705)------------------------------
% 0.16/0.46 % (2034705)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.46 % (2034705)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.46 % (2034705)CaDiCaL version: 2.1.3
% 0.16/0.46 % (2034705)Termination reason: Satisfiable
% 0.16/0.46 % (2034705)Time elapsed: 0.002 s
% 0.16/0.46 % (2034705)Peak memory usage: 11 MB
% 0.16/0.46 % (2034705)Instructions burned: 3 (million)
% 0.16/0.46 % (2034682)Success in time 0.038 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------