%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NLP223+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:09:30 PM UTC 2026
% Result : CounterSatisfiable 0.12s 0.45s
% Output : FiniteModel 0.12s
% 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_actual_world,type,
actual_world: $i > $o ).
tff(predicate_actual_world,axiom,
( actual_world('fmb_$i_1')
& actual_world('fmb_$i_2') ) ).
tff(declare_of,type,
of: ( $i * $i * $i ) > $o ).
tff(predicate_of,axiom,
( ~ of('fmb_$i_1','fmb_$i_1','fmb_$i_1')
& ~ of('fmb_$i_1','fmb_$i_1','fmb_$i_2')
& ~ of('fmb_$i_1','fmb_$i_2','fmb_$i_1')
& of('fmb_$i_1','fmb_$i_2','fmb_$i_2')
& ~ of('fmb_$i_2','fmb_$i_1','fmb_$i_1')
& ~ of('fmb_$i_2','fmb_$i_1','fmb_$i_2')
& ~ of('fmb_$i_2','fmb_$i_2','fmb_$i_1')
& of('fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_man,type,
man: ( $i * $i ) > $o ).
tff(predicate_man,axiom,
( man('fmb_$i_1','fmb_$i_1')
& man('fmb_$i_1','fmb_$i_2')
& man('fmb_$i_2','fmb_$i_1')
& man('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_vincent_forename,type,
vincent_forename: ( $i * $i ) > $o ).
tff(predicate_vincent_forename,axiom,
( ~ vincent_forename('fmb_$i_1','fmb_$i_1')
& vincent_forename('fmb_$i_1','fmb_$i_2')
& ~ vincent_forename('fmb_$i_2','fmb_$i_1')
& vincent_forename('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_forename,type,
forename: ( $i * $i ) > $o ).
tff(predicate_forename,axiom,
( ~ forename('fmb_$i_1','fmb_$i_1')
& forename('fmb_$i_1','fmb_$i_2')
& ~ forename('fmb_$i_2','fmb_$i_1')
& forename('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_proposition,type,
proposition: ( $i * $i ) > $o ).
tff(predicate_proposition,axiom,
( proposition('fmb_$i_1','fmb_$i_1')
& proposition('fmb_$i_1','fmb_$i_2')
& proposition('fmb_$i_2','fmb_$i_1')
& proposition('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_agent,type,
agent: ( $i * $i * $i ) > $o ).
tff(predicate_agent,axiom,
( agent('fmb_$i_1','fmb_$i_1','fmb_$i_1')
& agent('fmb_$i_1','fmb_$i_1','fmb_$i_2')
& agent('fmb_$i_1','fmb_$i_2','fmb_$i_1')
& agent('fmb_$i_1','fmb_$i_2','fmb_$i_2')
& agent('fmb_$i_2','fmb_$i_1','fmb_$i_1')
& agent('fmb_$i_2','fmb_$i_1','fmb_$i_2')
& agent('fmb_$i_2','fmb_$i_2','fmb_$i_1')
& agent('fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_theme,type,
theme: ( $i * $i * $i ) > $o ).
tff(predicate_theme,axiom,
( theme('fmb_$i_1','fmb_$i_1','fmb_$i_1')
& theme('fmb_$i_1','fmb_$i_1','fmb_$i_2')
& theme('fmb_$i_1','fmb_$i_2','fmb_$i_1')
& theme('fmb_$i_1','fmb_$i_2','fmb_$i_2')
& theme('fmb_$i_2','fmb_$i_1','fmb_$i_1')
& theme('fmb_$i_2','fmb_$i_1','fmb_$i_2')
& theme('fmb_$i_2','fmb_$i_2','fmb_$i_1')
& theme('fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
tff(declare_event,type,
event: ( $i * $i ) > $o ).
tff(predicate_event,axiom,
( event('fmb_$i_1','fmb_$i_1')
& event('fmb_$i_1','fmb_$i_2')
& event('fmb_$i_2','fmb_$i_1')
& event('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_present,type,
present: ( $i * $i ) > $o ).
tff(predicate_present,axiom,
( present('fmb_$i_1','fmb_$i_1')
& present('fmb_$i_1','fmb_$i_2')
& present('fmb_$i_2','fmb_$i_1')
& present('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_think_believe_consider,type,
think_believe_consider: ( $i * $i ) > $o ).
tff(predicate_think_believe_consider,axiom,
( ~ think_believe_consider('fmb_$i_1','fmb_$i_1')
& think_believe_consider('fmb_$i_1','fmb_$i_2')
& ~ think_believe_consider('fmb_$i_2','fmb_$i_1')
& think_believe_consider('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_accessible_world,type,
accessible_world: ( $i * $i ) > $o ).
tff(predicate_accessible_world,axiom,
( accessible_world('fmb_$i_1','fmb_$i_1')
& accessible_world('fmb_$i_1','fmb_$i_2')
& accessible_world('fmb_$i_2','fmb_$i_1')
& accessible_world('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_smoke,type,
smoke: ( $i * $i ) > $o ).
tff(predicate_smoke,axiom,
( ~ smoke('fmb_$i_1','fmb_$i_1')
& ~ smoke('fmb_$i_1','fmb_$i_2')
& smoke('fmb_$i_2','fmb_$i_1')
& smoke('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_jules_forename,type,
jules_forename: ( $i * $i ) > $o ).
tff(predicate_jules_forename,axiom,
( jules_forename('fmb_$i_1','fmb_$i_1')
& jules_forename('fmb_$i_1','fmb_$i_2')
& jules_forename('fmb_$i_2','fmb_$i_1')
& jules_forename('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_state,type,
state: ( $i * $i ) > $o ).
tff(predicate_state,axiom,
( state('fmb_$i_1','fmb_$i_1')
& state('fmb_$i_1','fmb_$i_2')
& state('fmb_$i_2','fmb_$i_1')
& state('fmb_$i_2','fmb_$i_2') ) ).
tff(declare_be,type,
be: ( $i * $i * $i * $i ) > $o ).
tff(predicate_be,axiom,
( be('fmb_$i_1','fmb_$i_1','fmb_$i_1','fmb_$i_1')
& be('fmb_$i_1','fmb_$i_1','fmb_$i_1','fmb_$i_2')
& be('fmb_$i_1','fmb_$i_1','fmb_$i_2','fmb_$i_1')
& ~ be('fmb_$i_1','fmb_$i_1','fmb_$i_2','fmb_$i_2')
& be('fmb_$i_1','fmb_$i_2','fmb_$i_1','fmb_$i_1')
& be('fmb_$i_1','fmb_$i_2','fmb_$i_1','fmb_$i_2')
& be('fmb_$i_1','fmb_$i_2','fmb_$i_2','fmb_$i_1')
& ~ be('fmb_$i_1','fmb_$i_2','fmb_$i_2','fmb_$i_2')
& be('fmb_$i_2','fmb_$i_1','fmb_$i_1','fmb_$i_1')
& be('fmb_$i_2','fmb_$i_1','fmb_$i_1','fmb_$i_2')
& be('fmb_$i_2','fmb_$i_1','fmb_$i_2','fmb_$i_1')
& ~ be('fmb_$i_2','fmb_$i_1','fmb_$i_2','fmb_$i_2')
& be('fmb_$i_2','fmb_$i_2','fmb_$i_1','fmb_$i_1')
& be('fmb_$i_2','fmb_$i_2','fmb_$i_1','fmb_$i_2')
& be('fmb_$i_2','fmb_$i_2','fmb_$i_2','fmb_$i_1')
& ~ be('fmb_$i_2','fmb_$i_2','fmb_$i_2','fmb_$i_2') ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP223+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n006.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 18:31:26 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.41 Running first-order model finding
% 0.12/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.12/0.45 % (3241139)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (3241144)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1745143794_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.45 % (3241145)% WARNING: option uhcvi not known.
% 0.12/0.45 % TRYING [1]
% 0.12/0.45 % TRYING [2]
% 0.12/0.45 % Finite Model Found!
% 0.12/0.45 % SZS status CounterSatisfiable for theBenchmark
% 0.12/0.45 % (3241144) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3241139-3241144"...
% 0.12/0.45 % (3241144)...printing done.
% 0.12/0.45 % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.12/0.45 % (3241144)------------------------------
% 0.12/0.45 % (3241144)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (3241144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (3241144)CaDiCaL version: 2.1.3
% 0.12/0.45 % (3241144)Termination reason: Satisfiable
% 0.12/0.45 % (3241144)Time elapsed: 0.005 s
% 0.12/0.45 % (3241144)Peak memory usage: 12 MB
% 0.12/0.45 % (3241144)Instructions burned: 15 (million)
% 0.12/0.45 % (3241139)Success in time 0.031 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------