↑ 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  : NLP139+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 : n008.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:03 PM UTC 2026

% Result   : CounterSatisfiable 0.17s 0.46s
% Output   : FiniteModel 0.17s
% 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_actual_world,type,
    actual_world: $i > $o ).

tff(predicate_actual_world,axiom,
    actual_world('fmb_$i_1') ).

tff(declare_of,type,
    of: ( $i * $i * $i ) > $o ).

tff(predicate_of,axiom,
    of('fmb_$i_1','fmb_$i_1','fmb_$i_1') ).

tff(declare_city,type,
    city: ( $i * $i ) > $o ).

tff(predicate_city,axiom,
    city('fmb_$i_1','fmb_$i_1') ).

tff(declare_hollywood_placename,type,
    hollywood_placename: ( $i * $i ) > $o ).

tff(predicate_hollywood_placename,axiom,
    hollywood_placename('fmb_$i_1','fmb_$i_1') ).

tff(declare_placename,type,
    placename: ( $i * $i ) > $o ).

tff(predicate_placename,axiom,
    placename('fmb_$i_1','fmb_$i_1') ).

tff(declare_chevy,type,
    chevy: ( $i * $i ) > $o ).

tff(predicate_chevy,axiom,
    chevy('fmb_$i_1','fmb_$i_1') ).

tff(declare_white,type,
    white: ( $i * $i ) > $o ).

tff(predicate_white,axiom,
    white('fmb_$i_1','fmb_$i_1') ).

tff(declare_dirty,type,
    dirty: ( $i * $i ) > $o ).

tff(predicate_dirty,axiom,
    dirty('fmb_$i_1','fmb_$i_1') ).

tff(declare_old,type,
    old: ( $i * $i ) > $o ).

tff(predicate_old,axiom,
    old('fmb_$i_1','fmb_$i_1') ).

tff(declare_street,type,
    street: ( $i * $i ) > $o ).

tff(predicate_street,axiom,
    street('fmb_$i_1','fmb_$i_1') ).

tff(declare_lonely,type,
    lonely: ( $i * $i ) > $o ).

tff(predicate_lonely,axiom,
    lonely('fmb_$i_1','fmb_$i_1') ).

tff(declare_event,type,
    event: ( $i * $i ) > $o ).

tff(predicate_event,axiom,
    event('fmb_$i_1','fmb_$i_1') ).

tff(declare_agent,type,
    agent: ( $i * $i * $i ) > $o ).

tff(predicate_agent,axiom,
    agent('fmb_$i_1','fmb_$i_1','fmb_$i_1') ).

tff(declare_present,type,
    present: ( $i * $i ) > $o ).

tff(predicate_present,axiom,
    present('fmb_$i_1','fmb_$i_1') ).

tff(declare_barrel,type,
    barrel: ( $i * $i ) > $o ).

tff(predicate_barrel,axiom,
    barrel('fmb_$i_1','fmb_$i_1') ).

tff(declare_down,type,
    down: ( $i * $i * $i ) > $o ).

tff(predicate_down,axiom,
    down('fmb_$i_1','fmb_$i_1','fmb_$i_1') ).

tff(declare_in,type,
    in: ( $i * $i * $i ) > $o ).

tff(predicate_in,axiom,
    in('fmb_$i_1','fmb_$i_1','fmb_$i_1') ).

tff(declare_frontseat,type,
    frontseat: ( $i * $i ) > $o ).

tff(predicate_frontseat,axiom,
    ~ frontseat('fmb_$i_1','fmb_$i_1') ).

tff(declare_member,type,
    member: ( $i * $i * $i ) > $o ).

tff(predicate_member,axiom,
    member('fmb_$i_1','fmb_$i_1','fmb_$i_1') ).

tff(declare_state,type,
    state: ( $i * $i ) > $o ).

tff(predicate_state,axiom,
    state('fmb_$i_1','fmb_$i_1') ).

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

tff(declare_two,type,
    two: ( $i * $i ) > $o ).

tff(predicate_two,axiom,
    two('fmb_$i_1','fmb_$i_1') ).

tff(declare_group,type,
    group: ( $i * $i ) > $o ).

tff(predicate_group,axiom,
    group('fmb_$i_1','fmb_$i_1') ).

tff(declare_fellow,type,
    fellow: ( $i * $i ) > $o ).

tff(predicate_fellow,axiom,
    fellow('fmb_$i_1','fmb_$i_1') ).

tff(declare_young,type,
    young: ( $i * $i ) > $o ).

tff(predicate_young,axiom,
    young('fmb_$i_1','fmb_$i_1') ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP139+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n008.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 18:08:55 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/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.17/0.46  % (1509988)Will run a generic schedule for satisfiability detection.
% 0.17/0.46  % (1509993)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2625883909_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46  % (1509994)% WARNING: option uhcvi not known.
% 0.17/0.46  % TRYING [1]
% 0.17/0.46  % Finite Model Found!
% 0.17/0.46  % SZS status CounterSatisfiable for theBenchmark
% 0.17/0.46  % (1509993) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1509988-1509993"...
% 0.17/0.46  % (1509993)...printing done.
% 0.17/0.46  % (1509998)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=735539718:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46  % (1509995)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1633017577:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46  % (1509996)dis+10_1_sil=32000:sp=arity:random_seed=3481732672:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46  % (1509997)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4268463279:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46  % (1509994)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1705159144:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46  % (1509999)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=448512053:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46  % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.17/0.46  % (1509993)------------------------------
% 0.17/0.46  % (1509993)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46  % (1509993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46  % (1509993)CaDiCaL version: 2.1.3
% 0.17/0.46  % (1509993)Termination reason: Satisfiable
% 0.17/0.46  % (1509993)Time elapsed: 0.006 s
% 0.17/0.46  % (1509993)Peak memory usage: 12 MB
% 0.17/0.46  % (1509993)Instructions burned: 24 (million)
% 0.17/0.46  % (1509988)Success in time 0.04 s
% 0.17/0.46  % Vampire exiting
%------------------------------------------------------------------------------