↑ 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  : SET852-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 : n015.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:49 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.44s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   14 (   4 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   27 (   6   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-4 aty)
%            Number of variables   :   18 (  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f2,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f3,negated_conjecture,
    ! [X0] :
      ( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X0,tc_set(tc_set(t_a)))
      | c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
      | ~ c_in(X0,v_Y,tc_set(tc_set(t_a))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f4,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(c_Zorn_OUnion__lemma0__1(X0,X1,X2,X3),X2,tc_set(X3))
      | c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
      | c_lessequals(c_Union(X2,X3),X0,tc_set(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_0) ).

fof(f5,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X0,X1,X2,X3),X0,tc_set(X3))
      | c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
      | c_lessequals(c_Union(X2,X3),X0,tc_set(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_1) ).

fof(f6,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(X0,c_Zorn_OUnion__lemma0__1(X1,X0,X2,X3),tc_set(X3))
      | c_lessequals(X0,c_Union(X2,X3),tc_set(X3))
      | c_lessequals(c_Union(X2,X3),X1,tc_set(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_2) ).

fof(f53,plain,
    ! [X0,X1] :
      ( ~ c_in(c_Zorn_OUnion__lemma0__1(X1,c_Zorn_Osucc(v_S,v_m,t_a),X0,tc_set(t_a)),v_Y,tc_set(tc_set(t_a)))
      | c_lessequals(c_Union(X0,tc_set(t_a)),X1,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_OUnion__lemma0__1(X1,c_Zorn_Osucc(v_S,v_m,t_a),X0,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(X0,tc_set(t_a)),tc_set(tc_set(t_a))) ),
    inference(resolution,[],[f6,f3]) ).

fof(f100,plain,
    ! [X0] :
      ( c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
      | c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a))) ),
    inference(resolution,[],[f53,f4]) ).

fof(f101,plain,
    ! [X0] :
      ( c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
      | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))) ),
    inference(duplicate_literal_removal,[],[f100]) ).

fof(f102,plain,
    ! [X0] :
      ( c_lessequals(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
      | c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a))) ),
    inference(forward_subsumption_resolution,[],[f101,f2]) ).

fof(f112,plain,
    ( c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
    | c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
    inference(resolution,[],[f102,f5]) ).

fof(f113,plain,
    ( c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))) ),
    inference(duplicate_literal_removal,[],[f112]) ).

fof(f114,plain,
    c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(forward_subsumption_resolution,[],[f113,f1]) ).

fof(f117,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f114,f2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET852-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n015.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.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.38  % DateTime : Mon Sep 28 03:04:31 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  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.10/0.44  % (2221360)Will run a generic schedule for satisfiability detection.
% 0.10/0.44  % (2221367)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=577744512:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.44  % (2221367) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2221360-2221367"...
% 0.10/0.44  % (2221367)...printing done.
% 0.10/0.44  % (2221367)Refutation found. Thanks to Tanya!
% 0.10/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44  % (2221367)------------------------------
% 0.10/0.44  % (2221367)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44  % (2221367)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44  % (2221367)CaDiCaL version: 2.1.3
% 0.10/0.44  % (2221367)Termination reason: Refutation
% 0.10/0.44  % (2221367)Time elapsed: 0.002 s
% 0.10/0.44  % (2221367)Peak memory usage: 11 MB
% 0.10/0.44  % (2221367)Instructions burned: 2 (million)
% 0.10/0.44  % (2221360)Success in time 0.027 s
% 0.10/0.44  % Vampire exiting
%------------------------------------------------------------------------------