↑ 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  : LCL577+1 : TPTP v9.3.1. Released v3.3.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 11:58:57 AM UTC 2026

% Result   : CounterSatisfiable 0.12s 0.45s
% Output   : FiniteModel 0.12s
% 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_or,type,
    or: ( $i * $i ) > $i ).

tff(function_or,axiom,
    ( ( or('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' )
    & ( or('fmb_$i_1','fmb_$i_2') = 'fmb_$i_1' )
    & ( or('fmb_$i_2','fmb_$i_1') = 'fmb_$i_1' )
    & ( or('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_not,type,
    not: $i > $i ).

tff(function_not,axiom,
    ( ( not('fmb_$i_1') = 'fmb_$i_1' )
    & ( not('fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_and,type,
    and: ( $i * $i ) > $i ).

tff(function_and,axiom,
    ( ( and('fmb_$i_1','fmb_$i_1') = 'fmb_$i_1' )
    & ( and('fmb_$i_1','fmb_$i_2') = 'fmb_$i_1' )
    & ( and('fmb_$i_2','fmb_$i_1') = 'fmb_$i_1' )
    & ( and('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_implies,type,
    implies: ( $i * $i ) > $i ).

tff(function_implies,axiom,
    ( ( implies('fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
    & ( implies('fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
    & ( implies('fmb_$i_2','fmb_$i_1') = 'fmb_$i_1' )
    & ( implies('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_equiv,type,
    equiv: ( $i * $i ) > $i ).

tff(function_equiv,axiom,
    ( ( equiv('fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
    & ( equiv('fmb_$i_1','fmb_$i_2') = 'fmb_$i_1' )
    & ( equiv('fmb_$i_2','fmb_$i_1') = 'fmb_$i_1' )
    & ( equiv('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_necessarily,type,
    necessarily: $i > $i ).

tff(function_necessarily,axiom,
    ( ( necessarily('fmb_$i_1') = 'fmb_$i_1' )
    & ( necessarily('fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_strict_implies,type,
    strict_implies: ( $i * $i ) > $i ).

tff(function_strict_implies,axiom,
    ( ( strict_implies('fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
    & ( strict_implies('fmb_$i_1','fmb_$i_2') = 'fmb_$i_2' )
    & ( strict_implies('fmb_$i_2','fmb_$i_1') = 'fmb_$i_1' )
    & ( strict_implies('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_strict_equiv,type,
    strict_equiv: ( $i * $i ) > $i ).

tff(function_strict_equiv,axiom,
    ( ( strict_equiv('fmb_$i_1','fmb_$i_1') = 'fmb_$i_2' )
    & ( strict_equiv('fmb_$i_1','fmb_$i_2') = 'fmb_$i_1' )
    & ( strict_equiv('fmb_$i_2','fmb_$i_1') = 'fmb_$i_1' )
    & ( strict_equiv('fmb_$i_2','fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_possibly,type,
    possibly: $i > $i ).

tff(function_possibly,axiom,
    ( ( possibly('fmb_$i_1') = 'fmb_$i_1' )
    & ( possibly('fmb_$i_2') = 'fmb_$i_2' ) ) ).

tff(declare_op_or,type,
    op_or: $o ).

tff(op_or_definition,axiom,
    op_or ).

tff(declare_op_and,type,
    op_and: $o ).

tff(op_and_definition,axiom,
    ~ op_and ).

tff(declare_op_implies_and,type,
    op_implies_and: $o ).

tff(op_implies_and_definition,axiom,
    ~ op_implies_and ).

tff(declare_op_implies_or,type,
    op_implies_or: $o ).

tff(op_implies_or_definition,axiom,
    ~ op_implies_or ).

tff(declare_op_equiv,type,
    op_equiv: $o ).

tff(op_equiv_definition,axiom,
    op_equiv ).

tff(declare_necessitation,type,
    necessitation: $o ).

tff(necessitation_definition,axiom,
    necessitation ).

tff(declare_modus_ponens_strict_implies,type,
    modus_ponens_strict_implies: $o ).

tff(modus_ponens_strict_implies_definition,axiom,
    modus_ponens_strict_implies ).

tff(declare_adjunction,type,
    adjunction: $o ).

tff(adjunction_definition,axiom,
    adjunction ).

tff(declare_substitution_strict_equiv,type,
    substitution_strict_equiv: $o ).

tff(substitution_strict_equiv_definition,axiom,
    substitution_strict_equiv ).

tff(declare_axiom_K,type,
    axiom_K: $o ).

tff(axiom_K_definition,axiom,
    axiom_K ).

tff(declare_axiom_M,type,
    axiom_M: $o ).

tff(axiom_M_definition,axiom,
    axiom_M ).

tff(declare_axiom_4,type,
    axiom_4: $o ).

tff(axiom_4_definition,axiom,
    axiom_4 ).

tff(declare_axiom_B,type,
    axiom_B: $o ).

tff(axiom_B_definition,axiom,
    axiom_B ).

tff(declare_axiom_5,type,
    axiom_5: $o ).

tff(axiom_5_definition,axiom,
    axiom_5 ).

tff(declare_axiom_s1,type,
    axiom_s1: $o ).

tff(axiom_s1_definition,axiom,
    axiom_s1 ).

tff(declare_axiom_s2,type,
    axiom_s2: $o ).

tff(axiom_s2_definition,axiom,
    axiom_s2 ).

tff(declare_axiom_s3,type,
    axiom_s3: $o ).

tff(axiom_s3_definition,axiom,
    ~ axiom_s3 ).

tff(declare_axiom_s4,type,
    axiom_s4: $o ).

tff(axiom_s4_definition,axiom,
    axiom_s4 ).

tff(declare_axiom_m1,type,
    axiom_m1: $o ).

tff(axiom_m1_definition,axiom,
    axiom_m1 ).

tff(declare_axiom_m2,type,
    axiom_m2: $o ).

tff(axiom_m2_definition,axiom,
    axiom_m2 ).

tff(declare_axiom_m3,type,
    axiom_m3: $o ).

tff(axiom_m3_definition,axiom,
    axiom_m3 ).

tff(declare_axiom_m4,type,
    axiom_m4: $o ).

tff(axiom_m4_definition,axiom,
    axiom_m4 ).

tff(declare_axiom_m5,type,
    axiom_m5: $o ).

tff(axiom_m5_definition,axiom,
    axiom_m5 ).

tff(declare_axiom_m6,type,
    axiom_m6: $o ).

tff(axiom_m6_definition,axiom,
    axiom_m6 ).

tff(declare_axiom_m7,type,
    axiom_m7: $o ).

tff(axiom_m7_definition,axiom,
    axiom_m7 ).

tff(declare_axiom_m8,type,
    axiom_m8: $o ).

tff(axiom_m8_definition,axiom,
    axiom_m8 ).

tff(declare_axiom_m9,type,
    axiom_m9: $o ).

tff(axiom_m9_definition,axiom,
    axiom_m9 ).

tff(declare_axiom_m10,type,
    axiom_m10: $o ).

tff(axiom_m10_definition,axiom,
    axiom_m10 ).

tff(declare_op_possibly,type,
    op_possibly: $o ).

tff(op_possibly_definition,axiom,
    op_possibly ).

tff(declare_op_necessarily,type,
    op_necessarily: $o ).

tff(op_necessarily_definition,axiom,
    ~ op_necessarily ).

tff(declare_op_strict_implies,type,
    op_strict_implies: $o ).

tff(op_strict_implies_definition,axiom,
    op_strict_implies ).

tff(declare_op_strict_equiv,type,
    op_strict_equiv: $o ).

tff(op_strict_equiv_definition,axiom,
    op_strict_equiv ).

tff(declare_op_implies,type,
    op_implies: $o ).

tff(op_implies_definition,axiom,
    op_implies ).

tff(declare_is_a_theorem,type,
    is_a_theorem: $i > $o ).

tff(predicate_is_a_theorem,axiom,
    ( ~ is_a_theorem('fmb_$i_1')
    & is_a_theorem('fmb_$i_2') ) ).


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