↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NUM967_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n016.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:26:18 PM UTC 2026

% Result   : Theorem 0.11s 0.43s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   21 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   17 (  10   ~;   5   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   17 (  16 usr;   1 prp; 0-3 aty)
%            Number of functors    :   23 (  23 usr;   3 con; 0-4 aty)
%            Number of variables   :    9 (   9   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    bool: $tType ).

tff(type_def_6,type,
    int: $tType ).

tff(type_def_7,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    archimedean_ceiling: 
      !>[X0: $tType] : ( X0 > int ) ).

tff(func_def_1,type,
    archim2085082626_floor: 
      !>[X0: $tType] : ( X0 > int ) ).

tff(func_def_2,type,
    one_one: 
      !>[X0: $tType] : X0 ).

tff(func_def_3,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

tff(func_def_4,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_5,type,
    fFalse: bool ).

tff(func_def_6,type,
    fTrue: bool ).

tff(func_def_7,type,
    t: int ).

tff(func_def_8,type,
    sK2: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(func_def_9,type,
    sK3: 
      !>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).

tff(func_def_10,type,
    sK4: 
      !>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).

tff(func_def_11,type,
    sK5: 
      !>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).

tff(func_def_12,type,
    sK6: 
      !>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).

tff(func_def_13,type,
    sK7: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).

tff(func_def_14,type,
    sK8: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).

tff(func_def_15,type,
    sK9: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).

tff(func_def_16,type,
    sK10: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).

tff(func_def_17,type,
    sK11: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(func_def_18,type,
    sK12: 
      !>[X0: $tType] : ( X0 > X0 ) ).

tff(func_def_19,type,
    sK13: 
      !>[X0: $tType] : ( X0 > X0 ) ).

tff(func_def_20,type,
    sK14: 
      !>[X0: $tType] : ( X0 > X0 ) ).

tff(func_def_21,type,
    sK15: 
      !>[X0: $tType] : ( X0 > X0 ) ).

tff(pred_def_1,type,
    one: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    zero: 
      !>[X0: $tType] : $o ).

tff(pred_def_3,type,
    ord: 
      !>[X0: $tType] : $o ).

tff(pred_def_4,type,
    order: 
      !>[X0: $tType] : $o ).

tff(pred_def_5,type,
    linorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_6,type,
    preorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_7,type,
    zero_neq_one: 
      !>[X0: $tType] : $o ).

tff(pred_def_8,type,
    linordered_idom: 
      !>[X0: $tType] : $o ).

tff(pred_def_9,type,
    dense_linorder: 
      !>[X0: $tType] : $o ).

tff(pred_def_10,type,
    linordered_semidom: 
      !>[X0: $tType] : $o ).

tff(pred_def_11,type,
    archim1727834104eiling: 
      !>[X0: $tType] : $o ).

tff(pred_def_12,type,
    ord_less: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_13,type,
    ord_less_eq: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_14,type,
    pp: bool > $o ).

tff(pred_def_15,type,
    sP0: ( bool * int * bool ) > $o ).

tff(pred_def_16,type,
    sP1: ( int * bool * bool ) > $o ).

tff(f1,axiom,
    ~ ord_less_eq(int,one_one(int),t),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__096_126_A1_A_060_061_At_096) ).

tff(f43,axiom,
    ! [X0: $tType] :
      ( linorder(X0)
     => ! [X1: X0,X2: X0] :
          ( ~ ord_less_eq(X0,X2,X1)
         => ord_less(X0,X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_42_not__leE) ).

tff(f106,axiom,
    linorder(int),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Orderings_Olinorder) ).

tff(f117,conjecture,
    ord_less(int,t,one_one(int)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f118,negated_conjecture,
    ~ ord_less(int,t,one_one(int)),
    inference(negated_conjecture,[status(cth)],[f117]) ).

tff(f119,plain,
    ~ ord_less(int,t,one_one(int)),
    inference(flattening,[],[f118]) ).

tff(f184,plain,
    ! [X0: $tType] :
      ( ! [X1: X0,X2: X0] :
          ( ord_less(X0,X1,X2)
          | ord_less_eq(X0,X2,X1) )
      | ~ linorder(X0) ),
    inference(ennf_transformation,[],[f43]) ).

tff(f289,plain,
    ~ ord_less_eq(int,one_one(int),t),
    inference(cnf_transformation,[],[f1]) ).

tff(f333,plain,
    ! [X0: $tType,X2: X0,X1: X0] :
      ( ord_less_eq(X0,X2,X1)
      | ord_less(X0,X1,X2)
      | ~ linorder(X0) ),
    inference(cnf_transformation,[],[f184]) ).

tff(f414,plain,
    linorder(int),
    inference(cnf_transformation,[],[f106]) ).

tff(f425,plain,
    ~ ord_less(int,t,one_one(int)),
    inference(cnf_transformation,[],[f119]) ).

tff(f482,plain,
    ( ord_less(int,t,one_one(int))
    | ~ linorder(int) ),
    inference(resolution,[],[f333,f289]) ).

tff(f486,plain,
    ~ linorder(int),
    inference(forward_subsumption_resolution,[],[f482,f425]) ).

tff(f487,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f486,f414]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM967_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n016.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 21:53:18 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  Running first-order model finding
% 0.11/0.39  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.11/0.43  % (3023601)Will run a generic schedule for satisfiability detection.
% 0.11/0.43  % (3023613)dis+10_1_sil=32000:sp=arity:random_seed=2244340471:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.43  % (3023613) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3023601-3023613"...
% 0.11/0.43  % (3023611)% WARNING: option uhcvi not known.
% 0.11/0.43  % (3023613)...printing done.
% 0.11/0.43  % (3023613)Refutation found. Thanks to Tanya!
% 0.11/0.43  % SZS status Theorem for theBenchmark
% 0.11/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.43  % (3023613)------------------------------
% 0.11/0.43  % (3023613)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.43  % (3023613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.43  % (3023613)CaDiCaL version: 2.1.3
% 0.11/0.43  % (3023613)Termination reason: Refutation
% 0.11/0.43  % (3023613)Time elapsed: 0.003 s
% 0.11/0.43  % (3023613)Peak memory usage: 11 MB
% 0.11/0.43  % (3023613)Instructions burned: 7 (million)
% 0.11/0.43  % (3023601)Success in time 0.022 s
% 0.11/0.43  % Vampire exiting
%------------------------------------------------------------------------------