↑ 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  : GRA075+1 : TPTP v9.3.1. Released v6.4.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 10:08:36 AM UTC 2026

% Result   : Satisfiable 0.10s 0.45s
% Output   : FiniteModel 0.10s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
tff('declare_$i1',type,
    'fmb_$i_1': $i ).

tff('finite_domain_$i',axiom,
    ! [X: $i] : ( X = 'fmb_$i_1' ) ).

tff(declare_empty,type,
    empty: $i ).

tff(empty_definition,axiom,
    empty = 'fmb_$i_1' ).

tff(declare_head_of,type,
    head_of: $i > $i ).

tff(function_head_of,axiom,
    head_of('fmb_$i_1') = 'fmb_$i_1' ).

tff(declare_tail_of,type,
    tail_of: $i > $i ).

tff(function_tail_of,axiom,
    tail_of('fmb_$i_1') = 'fmb_$i_1' ).

tff(declare_path_cons,type,
    path_cons: ( $i * $i ) > $i ).

tff(function_path_cons,axiom,
    path_cons('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' ).

tff(declare_length_of,type,
    length_of: $i > $i ).

tff(function_length_of,axiom,
    length_of('fmb_$i_1') = 'fmb_$i_1' ).

tff(declare_complete,type,
    complete: $o ).

tff(complete_definition,axiom,
    ~ complete ).

tff(declare_edge,type,
    edge: $i > $o ).

tff(predicate_edge,axiom,
    ~ edge('fmb_$i_1') ).

tff(declare_vertex,type,
    vertex: $i > $o ).

tff(predicate_vertex,axiom,
    vertex('fmb_$i_1') ).

tff(declare_path,type,
    path: ( $i * $i * $i ) > $o ).

tff(predicate_path,axiom,
    ~ path('fmb_$i_1','fmb_$i_1','fmb_$i_1') ).

tff(declare_on_path,type,
    on_path: ( $i * $i ) > $o ).

tff(predicate_on_path,axiom,
    on_path('fmb_$i_1','fmb_$i_1') ).

tff(declare_in_path,type,
    in_path: ( $i * $i ) > $o ).

tff(predicate_in_path,axiom,
    in_path('fmb_$i_1','fmb_$i_1') ).

tff(declare_sequential,type,
    sequential: ( $i * $i ) > $o ).

tff(predicate_sequential,axiom,
    ~ sequential('fmb_$i_1','fmb_$i_1') ).

tff(declare_precedes,type,
    precedes: ( $i * $i * $i ) > $o ).

tff(predicate_precedes,axiom,
    precedes('fmb_$i_1','fmb_$i_1','fmb_$i_1') ).

tff(declare_shortest_path,type,
    shortest_path: ( $i * $i * $i ) > $o ).

tff(predicate_shortest_path,axiom,
    ~ shortest_path('fmb_$i_1','fmb_$i_1','fmb_$i_1') ).

tff(declare_less_or_equal,type,
    less_or_equal: ( $i * $i ) > $o ).

tff(predicate_less_or_equal,axiom,
    ~ less_or_equal('fmb_$i_1','fmb_$i_1') ).


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