↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : MGT053-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n005.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:02:44 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.46s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   25 (   1 unt;   0 def)
%            Number of atoms       :   64 (   2 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   69 (  30   ~;  39   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   43 (  43   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    ! [X0,X1] :
      ( ~ smaller(X0,X1)
      | greater(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',definition_smaller_7) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( ~ greater(X0,X1)
      | ~ greater(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',meaning_postulate_greater_strict_9) ).

fof(f10,axiom,
    ! [X2,X0,X1] :
      ( ~ greater(X0,X1)
      | ~ greater(X1,X2)
      | greater(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',meaning_postulate_greater_transitive_10) ).

fof(f11,axiom,
    ! [X0,X1] :
      ( smaller(X0,X1)
      | X0 = X1
      | greater(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT001-0.ax',meaning_postulate_greater_comparable_11) ).

fof(f12,axiom,
    ! [X2,X0,X1] :
      ( ~ dissimilar(X0,X1,X2)
      | organization(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_2_29) ).

fof(f13,axiom,
    ! [X2,X0,X1] :
      ( ~ dissimilar(X0,X1,X2)
      | is_aligned(X0,X1)
      | is_aligned(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_2_30) ).

fof(f14,axiom,
    ! [X2,X0,X1] :
      ( ~ dissimilar(X0,X1,X2)
      | ~ is_aligned(X0,X1)
      | ~ is_aligned(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_2_31) ).

fof(f16,axiom,
    ! [X2,X0,X1] :
      ( ~ organization(X0)
      | ~ is_aligned(X0,X1)
      | is_aligned(X0,X2)
      | dissimilar(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_2_33) ).

fof(f17,axiom,
    ! [X2,X0,X1] :
      ( ~ organization(X0)
      | ~ is_aligned(X0,X1)
      | is_aligned(X0,X2)
      | dissimilar(X0,X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_2_34) ).

fof(f19,negated_conjecture,
    ( dissimilar(sk1,sk2,sk3)
    | dissimilar(sk1,sk3,sk2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_7_36) ).

fof(f20,negated_conjecture,
    ( dissimilar(sk1,sk2,sk3)
    | ~ dissimilar(sk1,sk2,sk3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_7_37) ).

fof(f21,negated_conjecture,
    ( ~ dissimilar(sk1,sk3,sk2)
    | dissimilar(sk1,sk3,sk2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_7_38) ).

fof(f22,negated_conjecture,
    ( ~ dissimilar(sk1,sk3,sk2)
    | ~ dissimilar(sk1,sk2,sk3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_7_39) ).

fof(f25,plain,
    ! [X0,X1] :
      ( smaller(X0,X1)
      | greater(X1,X0) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ~ smaller(X0,X1)
      | X0 = X1
      | greater(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f11]) ).

fof(f27,plain,
    ! [X2,X0,X1] :
      ( dissimilar(X0,X1,X2)
      | ~ organization(X0) ),
    inference(consistent_polarity_flipping,[],[f12]) ).

fof(f28,plain,
    ! [X2,X0,X1] :
      ( dissimilar(X0,X1,X2)
      | ~ is_aligned(X0,X1)
      | ~ is_aligned(X0,X2) ),
    inference(consistent_polarity_flipping,[],[f13]) ).

fof(f29,plain,
    ! [X2,X0,X1] :
      ( dissimilar(X0,X1,X2)
      | is_aligned(X0,X1)
      | is_aligned(X0,X2) ),
    inference(consistent_polarity_flipping,[],[f14]) ).

fof(f30,plain,
    ! [X2,X0,X1] :
      ( organization(X0)
      | is_aligned(X0,X1)
      | ~ is_aligned(X0,X2)
      | ~ dissimilar(X0,X1,X2) ),
    inference(consistent_polarity_flipping,[],[f16]) ).

fof(f31,plain,
    ! [X2,X0,X1] :
      ( organization(X0)
      | is_aligned(X0,X1)
      | ~ is_aligned(X0,X2)
      | ~ dissimilar(X0,X2,X1) ),
    inference(consistent_polarity_flipping,[],[f17]) ).

fof(f32,plain,
    ( ~ dissimilar(sk1,sk2,sk3)
    | ~ dissimilar(sk1,sk3,sk2) ),
    inference(consistent_polarity_flipping,[],[f19]) ).

fof(f33,plain,
    ( ~ dissimilar(sk1,sk2,sk3)
    | dissimilar(sk1,sk2,sk3) ),
    inference(consistent_polarity_flipping,[],[f20]) ).

fof(f34,plain,
    ( dissimilar(sk1,sk3,sk2)
    | ~ dissimilar(sk1,sk3,sk2) ),
    inference(consistent_polarity_flipping,[],[f21]) ).

fof(f35,plain,
    ( dissimilar(sk1,sk3,sk2)
    | dissimilar(sk1,sk2,sk3) ),
    inference(consistent_polarity_flipping,[],[f22]) ).

fof(f64,plain,
    $false,
    inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f25,f9,f10,f26,f27,f28,f29,f30,f31,f32,f33,f34,f35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT053-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n005.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.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 17:29:17 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.41  Running first-order model finding
% 0.15/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.15/0.46  % (42399)Will run a generic schedule for satisfiability detection.
% 0.15/0.46  % (42404)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=64889419_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.46  % Detected minimum model sizes of [1]
% 0.15/0.46  % Detected maximum model sizes of [3]
% 0.15/0.46  % TRYING [1]
% 0.15/0.46  % TRYING [2]
% 0.15/0.46  % (42404) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-42399-42404"...
% 0.15/0.46  % (42404)...printing done.
% 0.15/0.46  % (42405)% WARNING: option uhcvi not known.
% 0.15/0.46  % (42404)Refutation found. Thanks to Tanya!
% 0.15/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46  % (42404)------------------------------
% 0.15/0.46  % (42404)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.46  % (42404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.46  % (42404)CaDiCaL version: 2.1.3
% 0.15/0.46  % (42404)Termination reason: Refutation
% 0.15/0.46  % (42404)Time elapsed: 0.001 s
% 0.15/0.46  % (42404)Peak memory usage: 11 MB
% 0.15/0.46  % (42404)Instructions burned: 2 (million)
% 0.15/0.46  % (42399)Success in time 0.035 s
% 0.15/0.46  % Vampire exiting
%------------------------------------------------------------------------------