↑ Up

Vampire-SAT---5.0.1.CSA-FMo.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NLP232+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n018.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:34 PM UTC 2026

% Result   : CounterSatisfiable 0.11s 0.46s
% Output   : FiniteModel 0.11s
% 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_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_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_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  : NLP232+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36  % Computer : n018.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 27 18:35:39 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  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.11/0.46  % (2654852)Will run a generic schedule for satisfiability detection.
% 0.11/0.46  % (2654858)% WARNING: option uhcvi not known.
% 0.11/0.46  % (2654858)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3644074226:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46  % (2654857)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3112223278_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46  % (2654860)dis+10_1_sil=32000:sp=arity:random_seed=2882963826:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46  % (2654859)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2586348020:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46  % (2654861)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=33470278:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46  % (2654862)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2276523595:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.46  % (2654863)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2735074826:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.46  % TRYING [1]
% 0.11/0.46  % TRYING [2]
% 0.11/0.46  % Finite Model Found!
% 0.11/0.46  % SZS status CounterSatisfiable for theBenchmark
% 0.11/0.46  % (2654857) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2654852-2654857"...
% 0.11/0.46  % (2654862) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2654852-2654862"...
% 0.11/0.46  % (2654857)...printing done.
% 0.11/0.46  % (2654862)...printing done.
% 0.11/0.46  % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.11/0.46  % (2654857)------------------------------
% 0.11/0.46  % (2654857)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46  % (2654857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46  % (2654857)CaDiCaL version: 2.1.3
% 0.11/0.46  % (2654857)Termination reason: Satisfiable
% 0.11/0.46  % (2654857)Time elapsed: 0.018 s
% 0.11/0.46  % (2654857)Peak memory usage: 12 MB
% 0.11/0.46  % (2654857)Instructions burned: 35 (million)
% 0.11/0.46  % (2654852)Success in time 0.051 s
% 0.11/0.46  % Vampire exiting
%------------------------------------------------------------------------------