↑ 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  : KRS042+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n007.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 11:42:09 AM UTC 2026

% Result   : Satisfiable 0.10s 0.44s
% Output   : FiniteModel 0.10s
% 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_i2003_11_14_17_16_10980,type,
    i2003_11_14_17_16_10980: $i ).

tff(i2003_11_14_17_16_10980_definition,axiom,
    i2003_11_14_17_16_10980 = 'fmb_$i_1' ).

tff(declare_cSatisfiable,type,
    cSatisfiable: $i > $o ).

tff(predicate_cSatisfiable,axiom,
    ( cSatisfiable('fmb_$i_1')
    & cSatisfiable('fmb_$i_2') ) ).

tff(declare_ca_Ax2,type,
    ca_Ax2: $i > $o ).

tff(predicate_ca_Ax2,axiom,
    ( ~ ca_Ax2('fmb_$i_1')
    & ~ ca_Ax2('fmb_$i_2') ) ).

tff(declare_ca_Cx1,type,
    ca_Cx1: $i > $o ).

tff(predicate_ca_Cx1,axiom,
    ( ca_Cx1('fmb_$i_1')
    & ca_Cx1('fmb_$i_2') ) ).

tff(declare_ca_Cx1xcomp,type,
    ca_Cx1xcomp: $i > $o ).

tff(predicate_ca_Cx1xcomp,axiom,
    ( ~ ca_Cx1xcomp('fmb_$i_1')
    & ~ ca_Cx1xcomp('fmb_$i_2') ) ).

tff(declare_cc1,type,
    cc1: $i > $o ).

tff(predicate_cc1,axiom,
    ( ~ cc1('fmb_$i_1')
    & cc1('fmb_$i_2') ) ).

tff(declare_cc2,type,
    cc2: $i > $o ).

tff(predicate_cc2,axiom,
    ( cc2('fmb_$i_1')
    & ~ cc2('fmb_$i_2') ) ).

tff(declare_cowlNothing,type,
    cowlNothing: $i > $o ).

tff(predicate_cowlNothing,axiom,
    ( ~ cowlNothing('fmb_$i_1')
    & ~ cowlNothing('fmb_$i_2') ) ).

tff(declare_cowlThing,type,
    cowlThing: $i > $o ).

tff(predicate_cowlThing,axiom,
    ( cowlThing('fmb_$i_1')
    & cowlThing('fmb_$i_2') ) ).

tff(declare_ra_Px1,type,
    ra_Px1: ( $i * $i ) > $o ).

tff(predicate_ra_Px1,axiom,
    ( ~ ra_Px1('fmb_$i_1','fmb_$i_1')
    & ra_Px1('fmb_$i_1','fmb_$i_2')
    & ~ ra_Px1('fmb_$i_2','fmb_$i_1')
    & ra_Px1('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrx,type,
    rrx: ( $i * $i ) > $o ).

tff(predicate_rrx,axiom,
    ( ~ rrx('fmb_$i_1','fmb_$i_1')
    & rrx('fmb_$i_1','fmb_$i_2')
    & ~ rrx('fmb_$i_2','fmb_$i_1')
    & rrx('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrx1,type,
    rrx1: ( $i * $i ) > $o ).

tff(predicate_rrx1,axiom,
    ( rrx1('fmb_$i_1','fmb_$i_1')
    & rrx1('fmb_$i_1','fmb_$i_2')
    & rrx1('fmb_$i_2','fmb_$i_1')
    & rrx1('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrx1a,type,
    rrx1a: ( $i * $i ) > $o ).

tff(predicate_rrx1a,axiom,
    ( rrx1a('fmb_$i_1','fmb_$i_1')
    & rrx1a('fmb_$i_1','fmb_$i_2')
    & rrx1a('fmb_$i_2','fmb_$i_1')
    & rrx1a('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrx2,type,
    rrx2: ( $i * $i ) > $o ).

tff(predicate_rrx2,axiom,
    ( ~ rrx2('fmb_$i_1','fmb_$i_1')
    & rrx2('fmb_$i_1','fmb_$i_2')
    & ~ rrx2('fmb_$i_2','fmb_$i_1')
    & rrx2('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrx2a,type,
    rrx2a: ( $i * $i ) > $o ).

tff(predicate_rrx2a,axiom,
    ( rrx2a('fmb_$i_1','fmb_$i_1')
    & rrx2a('fmb_$i_1','fmb_$i_2')
    & rrx2a('fmb_$i_2','fmb_$i_1')
    & rrx2a('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrx3,type,
    rrx3: ( $i * $i ) > $o ).

tff(predicate_rrx3,axiom,
    ( ~ rrx3('fmb_$i_1','fmb_$i_1')
    & rrx3('fmb_$i_1','fmb_$i_2')
    & ~ rrx3('fmb_$i_2','fmb_$i_1')
    & rrx3('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrx3a,type,
    rrx3a: ( $i * $i ) > $o ).

tff(predicate_rrx3a,axiom,
    ( ~ rrx3a('fmb_$i_1','fmb_$i_1')
    & rrx3a('fmb_$i_1','fmb_$i_2')
    & ~ rrx3a('fmb_$i_2','fmb_$i_1')
    & rrx3a('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrx4,type,
    rrx4: ( $i * $i ) > $o ).

tff(predicate_rrx4,axiom,
    ( ~ rrx4('fmb_$i_1','fmb_$i_1')
    & rrx4('fmb_$i_1','fmb_$i_2')
    & ~ rrx4('fmb_$i_2','fmb_$i_1')
    & rrx4('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrx4a,type,
    rrx4a: ( $i * $i ) > $o ).

tff(predicate_rrx4a,axiom,
    ( rrx4a('fmb_$i_1','fmb_$i_1')
    & ~ rrx4a('fmb_$i_1','fmb_$i_2')
    & rrx4a('fmb_$i_2','fmb_$i_1')
    & ~ rrx4a('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_rrxa,type,
    rrxa: ( $i * $i ) > $o ).

tff(predicate_rrxa,axiom,
    ( rrxa('fmb_$i_1','fmb_$i_1')
    & rrxa('fmb_$i_1','fmb_$i_2')
    & rrxa('fmb_$i_2','fmb_$i_1')
    & rrxa('fmb_$i_2','fmb_$i_2') ) ).

tff(declare_xsd_integer,type,
    xsd_integer: $i > $o ).

tff(predicate_xsd_integer,axiom,
    ( ~ xsd_integer('fmb_$i_1')
    & ~ xsd_integer('fmb_$i_2') ) ).

tff(declare_xsd_string,type,
    xsd_string: $i > $o ).

tff(predicate_xsd_string,axiom,
    ( xsd_string('fmb_$i_1')
    & xsd_string('fmb_$i_2') ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS042+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n007.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 13:15:10 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.40  Running first-order model finding
% 0.10/0.40  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.44  % (1412024)Will run a generic schedule for satisfiability detection.
% 0.10/0.44  % (1412029)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=665438424_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.44  % TRYING [1]
% 0.10/0.44  % TRYING [2]
% 0.10/0.44  % Finite Model Found!
% 0.10/0.44  % SZS status Satisfiable for theBenchmark
% 0.10/0.44  % (1412029) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1412024-1412029"...
% 0.10/0.44  % (1412029)...printing done.
% 0.10/0.44  % SZS output start FiniteModel for theBenchmark
% See solution above
% 0.10/0.44  % (1412029)------------------------------
% 0.10/0.44  % (1412029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44  % (1412029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44  % (1412029)CaDiCaL version: 2.1.3
% 0.10/0.44  % (1412029)Termination reason: Satisfiable
% 0.10/0.44  % (1412029)Time elapsed: 0.002 s
% 0.10/0.44  % (1412029)Peak memory usage: 12 MB
% 0.10/0.44  % (1412029)Instructions burned: 4 (million)
% 0.10/0.44  % (1412024)Success in time 0.033 s
% 0.10/0.44  % Vampire exiting
%------------------------------------------------------------------------------