↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NLP221-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 : n003.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   : Satisfiable 0.09s 0.45s
% Output   : FiniteModel 0.09s
% 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_skc29,type,
    skc29: $i ).

tff(skc29_definition,axiom,
    skc29 = 'fmb_$i_1' ).

tff(declare_skc17,type,
    skc17: $i ).

tff(skc17_definition,axiom,
    skc17 = 'fmb_$i_2' ).

tff(declare_skc30,type,
    skc30: $i ).

tff(skc30_definition,axiom,
    skc30 = 'fmb_$i_1' ).

tff(declare_skc31,type,
    skc31: $i ).

tff(skc31_definition,axiom,
    skc31 = 'fmb_$i_1' ).

tff(declare_skc32,type,
    skc32: $i ).

tff(skc32_definition,axiom,
    skc32 = 'fmb_$i_2' ).

tff(declare_skc33,type,
    skc33: $i ).

tff(skc33_definition,axiom,
    skc33 = 'fmb_$i_1' ).

tff(declare_skc34,type,
    skc34: $i ).

tff(skc34_definition,axiom,
    skc34 = 'fmb_$i_1' ).

tff(declare_skc35,type,
    skc35: $i ).

tff(skc35_definition,axiom,
    skc35 = 'fmb_$i_2' ).

tff(declare_skc36,type,
    skc36: $i ).

tff(skc36_definition,axiom,
    skc36 = 'fmb_$i_2' ).

tff(declare_skc22,type,
    skc22: $i ).

tff(skc22_definition,axiom,
    skc22 = 'fmb_$i_2' ).

tff(declare_skc23,type,
    skc23: $i ).

tff(skc23_definition,axiom,
    skc23 = 'fmb_$i_2' ).

tff(declare_skc24,type,
    skc24: $i ).

tff(skc24_definition,axiom,
    skc24 = 'fmb_$i_2' ).

tff(declare_skc25,type,
    skc25: $i ).

tff(skc25_definition,axiom,
    skc25 = 'fmb_$i_2' ).

tff(declare_skc18,type,
    skc18: $i ).

tff(skc18_definition,axiom,
    skc18 = 'fmb_$i_2' ).

tff(declare_skc19,type,
    skc19: $i ).

tff(skc19_definition,axiom,
    skc19 = 'fmb_$i_2' ).

tff(declare_skc20,type,
    skc20: $i ).

tff(skc20_definition,axiom,
    skc20 = 'fmb_$i_2' ).

tff(declare_skc21,type,
    skc21: $i ).

tff(skc21_definition,axiom,
    skc21 = 'fmb_$i_1' ).

tff(declare_skf11,type,
    skf11: $i > $i ).

tff(function_skf11,axiom,
    ( ( skf11('fmb_$i_1') = 'fmb_$i_2' )
    & ( skf11('fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_skf5,type,
    skf5: $i > $i ).

tff(function_skf5,axiom,
    ( ( skf5('fmb_$i_1') = 'fmb_$i_1' )
    & ( skf5('fmb_$i_2') = 'fmb_$i_1' ) ) ).

tff(declare_skf7,type,
    skf7: $i > $i ).

tff(function_skf7,axiom,
    ( ( skf7('fmb_$i_1') = 'fmb_$i_2' )
    & ( skf7('fmb_$i_2') = 'fmb_$i_1' ) ) ).

tff(declare_skf13,type,
    skf13: $i > $i ).

tff(function_skf13,axiom,
    ( ( skf13('fmb_$i_1') = 'fmb_$i_2' )
    & ( skf13('fmb_$i_2') = 'fmb_$i_1' ) ) ).

tff(declare_ssSkC0,type,
    ssSkC0: $o ).

tff(ssSkC0_definition,axiom,
    ssSkC0 ).

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_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_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_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_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_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_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_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_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_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_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_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_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') ) ).

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') ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NLP221-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.09/0.37  % Computer : n003.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 27 18:33:27 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41  Running first-order model finding
% 0.09/0.41  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.09/0.45  % (847475)Will run a generic schedule for satisfiability detection.
% 0.09/0.45  % (847480)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2139231561_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.45  % TRYING [1]
% 0.09/0.45  % TRYING [2]
% 0.09/0.45  % (847481)% WARNING: option uhcvi not known.
% 0.09/0.45  % Finite Model Found!
% 0.09/0.45  % SZS status Satisfiable for theBenchmark
% 0.09/0.45  % (847480) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-847475-847480"...
% 0.09/0.45  % (847480)...printing done.
% 0.09/0.45  % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.09/0.45  % (847480)------------------------------
% 0.09/0.45  % (847480)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.45  % (847480)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.45  % (847480)CaDiCaL version: 2.1.3
% 0.09/0.45  % (847480)Termination reason: Satisfiable
% 0.09/0.45  % (847480)Time elapsed: 0.005 s
% 0.09/0.45  % (847480)Peak memory usage: 11 MB
% 0.09/0.45  % (847480)Instructions burned: 15 (million)
% 0.09/0.45  % (847475)Success in time 0.032 s
% 0.09/0.45  % Vampire exiting
%------------------------------------------------------------------------------