↑ 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  : ANA023-2 : TPTP v9.3.1. Released v3.2.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 09:31:19 AM UTC 2026

% Result   : Unsatisfiable 0.08s 0.27s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   27 (  14 unt;   0 def)
%            Number of atoms       :   46 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   40 (  21   ~;  19   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   25 (  25   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ class_OrderedGroup_Ocomm__monoid__add(X0)
      | c_plus(c_0,X1,X0) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) ).

fof(f2,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(X1,c_minus(X2,X3,X0),X0)
      | ~ class_OrderedGroup_Opordered__ab__group__add(X0)
      | c_lessequals(c_plus(X1,X3,X0),X2,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_0) ).

fof(f3,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(c_plus(X1,X2,X0),X3,X0)
      | ~ class_OrderedGroup_Opordered__ab__group__add(X0)
      | c_lessequals(X1,c_minus(X3,X2,X0),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_OrderedGroup_Ocompare__rls__9_1) ).

fof(f4,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(X3,X1,X0)
      | ~ c_lessequals(X1,X2,X0)
      | ~ class_Orderings_Oorder(X0)
      | c_lessequals(X3,X2,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).

fof(f5,negated_conjecture,
    c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f6,negated_conjecture,
    c_lessequals(v_k(v_x),v_f(v_x),t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f7,negated_conjecture,
    ~ c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f8,axiom,
    ! [X0] :
      ( ~ class_Orderings_Olinorder(X0)
      | class_Orderings_Oorder(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Orderings_Olinorder_4) ).

fof(f9,axiom,
    ! [X0] :
      ( ~ class_Ring__and__Field_Oordered__idom(X0)
      | class_OrderedGroup_Ocomm__monoid__add(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_23) ).

fof(f10,axiom,
    ! [X0] :
      ( ~ class_Ring__and__Field_Oordered__idom(X0)
      | class_Orderings_Olinorder(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_33) ).

fof(f11,axiom,
    ! [X0] :
      ( ~ class_Ring__and__Field_Oordered__idom(X0)
      | class_OrderedGroup_Opordered__ab__group__add(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsrel_Ring__and__Field_Oordered__idom_54) ).

fof(f12,negated_conjecture,
    class_Ring__and__Field_Oordered__idom(t_b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',tfree_tcs) ).

fof(f13,plain,
    class_OrderedGroup_Ocomm__monoid__add(t_b),
    inference(resolution,[],[f9,f12]) ).

fof(f14,plain,
    class_Orderings_Olinorder(t_b),
    inference(resolution,[],[f10,f12]) ).

fof(f15,plain,
    class_Orderings_Oorder(t_b),
    inference(resolution,[],[f14,f8]) ).

fof(f16,plain,
    class_OrderedGroup_Opordered__ab__group__add(t_b),
    inference(resolution,[],[f11,f12]) ).

fof(f17,plain,
    ! [X0] : c_plus(c_0,X0,t_b) = X0,
    inference(resolution,[],[f1,f13]) ).

fof(f22,plain,
    ( ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
    | c_lessequals(c_plus(c_0,v_g(v_x),t_b),v_k(v_x),t_b) ),
    inference(resolution,[],[f2,f5]) ).

fof(f23,plain,
    c_lessequals(c_plus(c_0,v_g(v_x),t_b),v_k(v_x),t_b),
    inference(forward_subsumption_resolution,[],[f22,f16]) ).

fof(f24,plain,
    c_lessequals(v_g(v_x),v_k(v_x),t_b),
    inference(forward_demodulation,[],[f23,f17]) ).

fof(f25,plain,
    ! [X0] :
      ( ~ c_lessequals(v_k(v_x),X0,t_b)
      | ~ class_Orderings_Oorder(t_b)
      | c_lessequals(v_g(v_x),X0,t_b) ),
    inference(resolution,[],[f24,f4]) ).

fof(f26,plain,
    ! [X0] :
      ( ~ c_lessequals(v_k(v_x),X0,t_b)
      | c_lessequals(v_g(v_x),X0,t_b) ),
    inference(forward_subsumption_resolution,[],[f25,f15]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ c_lessequals(X0,X1,t_b)
      | ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
      | c_lessequals(c_0,c_minus(X1,X0,t_b),t_b) ),
    inference(superposition,[],[f3,f17]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( c_lessequals(c_0,c_minus(X1,X0,t_b),t_b)
      | ~ c_lessequals(X0,X1,t_b) ),
    inference(forward_subsumption_resolution,[],[f27,f16]) ).

fof(f29,plain,
    c_lessequals(v_g(v_x),v_f(v_x),t_b),
    inference(resolution,[],[f26,f6]) ).

fof(f32,plain,
    ~ c_lessequals(v_g(v_x),v_f(v_x),t_b),
    inference(resolution,[],[f28,f7]) ).

fof(f37,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f32,f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ANA023-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  % Computer : n005.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 20:29:46 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  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.08/0.27  % (1120347)Will run a generic schedule for satisfiability detection.
% 0.08/0.27  % (1120361)dis+10_1_sil=32000:sp=arity:random_seed=1011717492:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.27  % (1120361) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1120347-1120361"...
% 0.08/0.27  % (1120361)...printing done.
% 0.08/0.27  % (1120361)Refutation found. Thanks to Tanya!
% 0.08/0.27  % SZS status Unsatisfiable for theBenchmark
% 0.08/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.27  % (1120361)------------------------------
% 0.08/0.27  % (1120361)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.27  % (1120361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.27  % (1120361)CaDiCaL version: 2.1.3
% 0.08/0.27  % (1120361)Termination reason: Refutation
% 0.08/0.27  % (1120361)Time elapsed: 0.001 s
% 0.08/0.27  % (1120361)Peak memory usage: 11 MB
% 0.08/0.27  % (1120361)Instructions burned: 2 (million)
% 0.08/0.27  % (1120347)Success in time 0.032 s
% 0.23/0.27  % Vampire exiting
%------------------------------------------------------------------------------