↑ 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  : SET847-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

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

% Result   : Unsatisfiable 0.18s 0.46s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   23 (   9 unt;   0 def)
%            Number of atoms       :   41 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  22   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-3 aty)
%            Number of variables   :   43 (  43   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,c_minus(X1,X3,tc_set(X2)),X2)
      | c_in(X0,X3,X2)
      | ~ c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_ODiffI_0) ).

fof(f2,axiom,
    ! [X0,X1] : ~ c_in(X0,c_emptyset,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OemptyE_0) ).

fof(f3,axiom,
    ! [X0,X1] : c_lessequals(c_emptyset,X0,tc_set(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oempty__subsetI_0) ).

fof(f4,axiom,
    ! [X2,X0,X1] :
      ( c_lessequals(X0,X1,tc_set(X2))
      | c_in(c_Main_OsubsetI__1(X0,X1,X2),X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(X0,X1,tc_set(X2))
      | ~ c_lessequals(X1,X0,tc_set(X2))
      | X1 = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).

fof(f6,plain,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(X0,X1,tc_set(X2))
      | ~ c_lessequals(X1,X0,tc_set(X2))
      | X0 = X1 ),
    inference(reorient_equations,[],[f5]) ).

fof(f7,axiom,
    ! [X0,X1] : c_lessequals(X0,X0,tc_set(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).

fof(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(tc_set(X2))))
      | c_in(c_Union(X0,tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).

fof(f9,axiom,
    ! [X2,X0,X1] :
      ( c_in(X0,c_Zorn_Ochain(X1,X2),tc_set(tc_set(X2)))
      | ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__chain__lemma4_0) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( ~ c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_OTFin(X0,X1),tc_set(tc_set(X1)))
      | c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)) = c_Zorn_Osucc(X0,c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Oequal__succ__Union_1) ).

fof(f11,axiom,
    ! [X2,X0,X1] :
      ( ~ c_in(X0,c_minus(c_Zorn_Ochain(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(tc_set(X2)))),tc_set(tc_set(X2)))
      | c_Zorn_Osucc(X1,X0,X2) != X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Osucc__not__equals_0) ).

fof(f12,negated_conjecture,
    ! [X0] : ~ c_in(X0,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ c_lessequals(X0,c_emptyset,tc_set(X1))
      | c_emptyset = X0 ),
    inference(resolution,[],[f6,f3]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( c_in(c_Main_OsubsetI__1(X0,c_emptyset,X1),X0,X1)
      | c_emptyset = X0 ),
    inference(resolution,[],[f16,f4]) ).

fof(f22,plain,
    c_emptyset = c_Zorn_Omaxchain(v_S,t_a),
    inference(resolution,[],[f21,f12]) ).

fof(f26,plain,
    ! [X0,X1] : c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_OTFin(X0,X1),tc_set(tc_set(X1))),
    inference(resolution,[],[f8,f7]) ).

fof(f30,plain,
    ! [X0] :
      ( ~ c_in(X0,c_minus(c_Zorn_Ochain(v_S,t_a),c_emptyset,tc_set(tc_set(tc_set(t_a)))),tc_set(tc_set(t_a)))
      | c_Zorn_Osucc(v_S,X0,t_a) != X0 ),
    inference(superposition,[],[f11,f22]) ).

fof(f31,plain,
    ! [X0] :
      ( c_Zorn_Osucc(v_S,X0,t_a) != X0
      | c_in(X0,c_emptyset,tc_set(tc_set(t_a)))
      | ~ c_in(X0,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
    inference(resolution,[],[f30,f1]) ).

fof(f42,plain,
    ! [X0] :
      ( ~ c_in(X0,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
      | c_Zorn_Osucc(v_S,X0,t_a) != X0 ),
    inference(forward_subsumption_resolution,[],[f31,f2]) ).

fof(f43,plain,
    ! [X0] :
      ( ~ c_in(X0,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
      | c_Zorn_Osucc(v_S,X0,t_a) != X0 ),
    inference(resolution,[],[f42,f9]) ).

fof(f54,plain,
    ! [X0,X1] : c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)) = c_Zorn_Osucc(X0,c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),X1),
    inference(resolution,[],[f26,f10]) ).

fof(f57,plain,
    c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) != c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a),
    inference(resolution,[],[f43,f26]) ).

fof(f58,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f57,f54]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET847-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n006.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 03:00:10 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.42  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.18/0.46  % (3541411)Will run a generic schedule for satisfiability detection.
% 0.18/0.46  % (3541420)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=169608958:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.46  % (3541420) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3541411-3541420"...
% 0.18/0.46  % (3541420)...printing done.
% 0.18/0.46  % (3541417)% WARNING: option uhcvi not known.
% 0.18/0.46  % (3541420)Refutation found. Thanks to Tanya!
% 0.18/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46  % (3541420)------------------------------
% 0.18/0.46  % (3541420)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.46  % (3541420)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.46  % (3541420)CaDiCaL version: 2.1.3
% 0.18/0.46  % (3541420)Termination reason: Refutation
% 0.18/0.46  % (3541420)Time elapsed: 0.002 s
% 0.18/0.46  % (3541420)Peak memory usage: 11 MB
% 0.18/0.46  % (3541420)Instructions burned: 3 (million)
% 0.18/0.46  % (3541411)Success in time 0.03 s
% 0.18/0.46  % Vampire exiting
%------------------------------------------------------------------------------