%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL963_3 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:01:18 PM UTC 2026
% Result : CounterSatisfiable 0.17s 0.51s
% 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_$ki_world',type,
'$ki_world': $tType ).
tff('declare_$ki_world1',type,
'fmb_$ki_world_1': '$ki_world' ).
tff('declare_$ki_world2',type,
'fmb_$ki_world_2': '$ki_world' ).
tff('finite_domain_$ki_world',axiom,
! [X: '$ki_world'] :
( ( X = 'fmb_$ki_world_1' )
| ( X = 'fmb_$ki_world_2' ) ) ).
tff('distinct_domain_$ki_world',axiom,
'fmb_$ki_world_1' != 'fmb_$ki_world_2' ).
tff('declare_$ki_local_world',type,
'$ki_local_world': '$ki_world' ).
tff('$ki_local_world_definition',axiom,
'$ki_local_world' = 'fmb_$ki_world_1' ).
tff(declare_equiv,type,
equiv: ( $i * $i ) > $i ).
tff(function_equiv,axiom,
( ( equiv('fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
& ( equiv('fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
& ( equiv('fmb_$i_2','fmb_$i_1') = 'fmb_$i_2' )
& ( equiv('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_not,type,
not: $i > $i ).
tff(function_not,axiom,
( ( not('fmb_$i_1') = 'fmb_$i_2' )
& ( not('fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_or,type,
or: ( $i * $i ) > $i ).
tff(function_or,axiom,
( ( or('fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
& ( or('fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
& ( or('fmb_$i_2','fmb_$i_1') = 'fmb_$i_2' )
& ( or('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_and,type,
and: ( $i * $i ) > $i ).
tff(function_and,axiom,
( ( and('fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
& ( and('fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
& ( and('fmb_$i_2','fmb_$i_1') = 'fmb_$i_2' )
& ( and('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff(declare_implies,type,
implies: ( $i * $i ) > $i ).
tff(function_implies,axiom,
( ( implies('fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
& ( implies('fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
& ( implies('fmb_$i_2','fmb_$i_1') = 'fmb_$i_2' )
& ( implies('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).
tff('declare_$ki_accessible',type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff('predicate_$ki_accessible',axiom,
( ~ '$ki_accessible'('fmb_$ki_world_1','fmb_$ki_world_1')
& '$ki_accessible'('fmb_$ki_world_1','fmb_$ki_world_2')
& '$ki_accessible'('fmb_$ki_world_2','fmb_$ki_world_1')
& '$ki_accessible'('fmb_$ki_world_2','fmb_$ki_world_2') ) ).
tff(declare_r2,type,
r2: '$ki_world' > $o ).
tff(predicate_r2,axiom,
( r2('fmb_$ki_world_1')
& ~ r2('fmb_$ki_world_2') ) ).
tff(declare_r3,type,
r3: '$ki_world' > $o ).
tff(predicate_r3,axiom,
( ~ r3('fmb_$ki_world_1')
& ~ r3('fmb_$ki_world_2') ) ).
tff(declare_r4,type,
r4: '$ki_world' > $o ).
tff(predicate_r4,axiom,
( r4('fmb_$ki_world_1')
& ~ r4('fmb_$ki_world_2') ) ).
tff(declare_r5,type,
r5: '$ki_world' > $o ).
tff(predicate_r5,axiom,
( ~ r5('fmb_$ki_world_1')
& ~ r5('fmb_$ki_world_2') ) ).
tff(declare_equivalence_1,type,
equivalence_1: '$ki_world' > $o ).
tff(predicate_equivalence_1,axiom,
( ~ equivalence_1('fmb_$ki_world_1')
& equivalence_1('fmb_$ki_world_2') ) ).
tff(declare_equivalence_2,type,
equivalence_2: '$ki_world' > $o ).
tff(predicate_equivalence_2,axiom,
( ~ equivalence_2('fmb_$ki_world_1')
& equivalence_2('fmb_$ki_world_2') ) ).
tff(declare_cn2,type,
cn2: '$ki_world' > $o ).
tff(predicate_cn2,axiom,
( cn2('fmb_$ki_world_1')
& ~ cn2('fmb_$ki_world_2') ) ).
tff(declare_cn1,type,
cn1: '$ki_world' > $o ).
tff(predicate_cn1,axiom,
( ~ cn1('fmb_$ki_world_1')
& ~ cn1('fmb_$ki_world_2') ) ).
tff(declare_cn3,type,
cn3: '$ki_world' > $o ).
tff(predicate_cn3,axiom,
( cn3('fmb_$ki_world_1')
& ~ cn3('fmb_$ki_world_2') ) ).
tff(declare_kn2,type,
kn2: '$ki_world' > $o ).
tff(predicate_kn2,axiom,
( kn2('fmb_$ki_world_1')
& ~ kn2('fmb_$ki_world_2') ) ).
tff(declare_kn1,type,
kn1: '$ki_world' > $o ).
tff(predicate_kn1,axiom,
( ~ kn1('fmb_$ki_world_1')
& kn1('fmb_$ki_world_2') ) ).
tff(declare_kn3,type,
kn3: '$ki_world' > $o ).
tff(predicate_kn3,axiom,
( kn3('fmb_$ki_world_1')
& ~ kn3('fmb_$ki_world_2') ) ).
tff(declare_equivalence_3,type,
equivalence_3: '$ki_world' > $o ).
tff(predicate_equivalence_3,axiom,
( ~ equivalence_3('fmb_$ki_world_1')
& equivalence_3('fmb_$ki_world_2') ) ).
tff(declare_op_implies_or,type,
op_implies_or: '$ki_world' > $o ).
tff(predicate_op_implies_or,axiom,
( ~ op_implies_or('fmb_$ki_world_1')
& ~ op_implies_or('fmb_$ki_world_2') ) ).
tff(declare_op_and,type,
op_and: '$ki_world' > $o ).
tff(predicate_op_and,axiom,
( ~ op_and('fmb_$ki_world_1')
& ~ op_and('fmb_$ki_world_2') ) ).
tff(declare_and_2,type,
and_2: '$ki_world' > $o ).
tff(predicate_and_2,axiom,
( ~ and_2('fmb_$ki_world_1')
& and_2('fmb_$ki_world_2') ) ).
tff(declare_and_3,type,
and_3: '$ki_world' > $o ).
tff(predicate_and_3,axiom,
( ~ and_3('fmb_$ki_world_1')
& and_3('fmb_$ki_world_2') ) ).
tff(declare_and_1,type,
and_1: '$ki_world' > $o ).
tff(predicate_and_1,axiom,
( ~ and_1('fmb_$ki_world_1')
& and_1('fmb_$ki_world_2') ) ).
tff(declare_implies_2,type,
implies_2: '$ki_world' > $o ).
tff(predicate_implies_2,axiom,
( ~ implies_2('fmb_$ki_world_1')
& implies_2('fmb_$ki_world_2') ) ).
tff(declare_implies_3,type,
implies_3: '$ki_world' > $o ).
tff(predicate_implies_3,axiom,
( ~ implies_3('fmb_$ki_world_1')
& implies_3('fmb_$ki_world_2') ) ).
tff(declare_op_implies_and,type,
op_implies_and: '$ki_world' > $o ).
tff(predicate_op_implies_and,axiom,
( op_implies_and('fmb_$ki_world_1')
& op_implies_and('fmb_$ki_world_2') ) ).
tff(declare_implies_1,type,
implies_1: '$ki_world' > $o ).
tff(predicate_implies_1,axiom,
( ~ implies_1('fmb_$ki_world_1')
& implies_1('fmb_$ki_world_2') ) ).
tff(declare_substitution_of_equivalents,type,
substitution_of_equivalents: '$ki_world' > $o ).
tff(predicate_substitution_of_equivalents,axiom,
( substitution_of_equivalents('fmb_$ki_world_1')
& substitution_of_equivalents('fmb_$ki_world_2') ) ).
tff(declare_op_or,type,
op_or: '$ki_world' > $o ).
tff(predicate_op_or,axiom,
( op_or('fmb_$ki_world_1')
& op_or('fmb_$ki_world_2') ) ).
tff(declare_modus_tollens,type,
modus_tollens: '$ki_world' > $o ).
tff(predicate_modus_tollens,axiom,
( ~ modus_tollens('fmb_$ki_world_1')
& modus_tollens('fmb_$ki_world_2') ) ).
tff(declare_or_1,type,
or_1: '$ki_world' > $o ).
tff(predicate_or_1,axiom,
( ~ or_1('fmb_$ki_world_1')
& or_1('fmb_$ki_world_2') ) ).
tff(declare_or_2,type,
or_2: '$ki_world' > $o ).
tff(predicate_or_2,axiom,
( ~ or_2('fmb_$ki_world_1')
& or_2('fmb_$ki_world_2') ) ).
tff(declare_or_3,type,
or_3: '$ki_world' > $o ).
tff(predicate_or_3,axiom,
( ~ or_3('fmb_$ki_world_1')
& or_3('fmb_$ki_world_2') ) ).
tff(declare_op_equiv,type,
op_equiv: '$ki_world' > $o ).
tff(predicate_op_equiv,axiom,
( op_equiv('fmb_$ki_world_1')
& op_equiv('fmb_$ki_world_2') ) ).
tff(declare_modus_ponens,type,
modus_ponens: '$ki_world' > $o ).
tff(predicate_modus_ponens,axiom,
( modus_ponens('fmb_$ki_world_1')
& modus_ponens('fmb_$ki_world_2') ) ).
tff(declare_op_implies,type,
op_implies: '$ki_world' > $o ).
tff(predicate_op_implies,axiom,
( op_implies('fmb_$ki_world_1')
& op_implies('fmb_$ki_world_2') ) ).
tff(declare_r1,type,
r1: '$ki_world' > $o ).
tff(predicate_r1,axiom,
( r1('fmb_$ki_world_1')
& ~ r1('fmb_$ki_world_2') ) ).
tff(declare_qmltpeq,type,
qmltpeq: ( '$ki_world' * $i * $i ) > $o ).
tff(predicate_qmltpeq,axiom,
( qmltpeq('fmb_$ki_world_1','fmb_$i_1','fmb_$i_1')
& qmltpeq('fmb_$ki_world_1','fmb_$i_1','fmb_$i_2')
& qmltpeq('fmb_$ki_world_1','fmb_$i_2','fmb_$i_1')
& qmltpeq('fmb_$ki_world_1','fmb_$i_2','fmb_$i_2')
& qmltpeq('fmb_$ki_world_2','fmb_$i_1','fmb_$i_1')
& qmltpeq('fmb_$ki_world_2','fmb_$i_1','fmb_$i_2')
& qmltpeq('fmb_$ki_world_2','fmb_$i_2','fmb_$i_1')
& qmltpeq('fmb_$ki_world_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_is_a_theorem,type,
is_a_theorem: ( '$ki_world' * $i ) > $o ).
tff(predicate_is_a_theorem,axiom,
( is_a_theorem('fmb_$ki_world_1','fmb_$i_1')
& is_a_theorem('fmb_$ki_world_1','fmb_$i_2')
& ~ is_a_theorem('fmb_$ki_world_2','fmb_$i_1')
& ~ is_a_theorem('fmb_$ki_world_2','fmb_$i_2') ) ).
tff('declare_$ki_exists_in_world_$i',type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff('predicate_$ki_exists_in_world_$i',axiom,
( '$ki_exists_in_world_$i'('fmb_$ki_world_1','fmb_$i_1')
& '$ki_exists_in_world_$i'('fmb_$ki_world_1','fmb_$i_2')
& '$ki_exists_in_world_$i'('fmb_$ki_world_2','fmb_$i_1')
& '$ki_exists_in_world_$i'('fmb_$ki_world_2','fmb_$i_2') ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL963_3 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 17:09:34 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.17/0.51 % (3618467)Will run a generic schedule for satisfiability detection.
% 0.17/0.51 % (3618487)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1006512303_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.51 % (3618488)% WARNING: option uhcvi not known.
% 0.17/0.51 % (3618489)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4105379907:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.51 % (3618491)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=365705138:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.51 % (3618488)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4137876289:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.51 % (3618490)dis+10_1_sil=32000:sp=arity:random_seed=2646216005:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.51 % (3618493)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2314587680:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.51 % (3618492)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3682773327:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.51 % TRYING [1]
% 0.17/0.51 % TRYING [2]
% 0.17/0.51 % Finite Model Found!
% 0.17/0.51 % SZS status CounterSatisfiable for theBenchmark
% 0.17/0.51 % (3618487) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3618467-3618487"...
% 0.17/0.51 % (3618487)...printing done.
% 0.17/0.51 % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.17/0.51 % (3618487)------------------------------
% 0.17/0.51 % (3618487)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.51 % (3618487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.51 % (3618487)CaDiCaL version: 2.1.3
% 0.17/0.51 % (3618487)Termination reason: Satisfiable
% 0.17/0.51 % (3618487)Time elapsed: 0.054 s
% 0.17/0.51 % (3618487)Peak memory usage: 18 MB
% 0.17/0.51 % (3618487)Instructions burned: 215 (million)
% 0.17/0.51 % (3618467)Success in time 0.091 s
% 0.17/0.51 % Vampire exiting
%------------------------------------------------------------------------------