↑ 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  : SET864-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 : n010.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:53 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_lessequals(c_Union(X3,X2),X0,tc_set(X2))
      | ~ c_in(X3,c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2)))
      | ~ c_in(X0,X1,tc_set(X2))
      | c_Union(X3,X2) = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).

fof(f2,negated_conjecture,
    c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f3,negated_conjecture,
    c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f4,negated_conjecture,
    ! [X0] :
      ( c_in(v_x(X0),v_S,tc_set(t_a))
      | ~ c_in(X0,v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

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

fof(f6,negated_conjecture,
    ! [X0] :
      ( X0 != v_x(X0)
      | ~ c_in(X0,v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

fof(f7,plain,
    ! [X0] :
      ( ~ c_in(X0,v_S,tc_set(t_a))
      | v_x(X0) != X0 ),
    inference(reorient_equations,[],[f6]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ c_in(X0,c_Zorn_Omaxchain(X1,t_a),tc_set(tc_set(t_a)))
      | ~ c_in(v_x(c_Union(X0,t_a)),X1,tc_set(t_a))
      | c_Union(X0,t_a) = v_x(c_Union(X0,t_a))
      | ~ c_in(c_Union(X0,t_a),v_S,tc_set(t_a)) ),
    inference(resolution,[],[f1,f5]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ~ c_in(v_x(c_Union(X0,t_a)),X1,tc_set(t_a))
      | ~ c_in(X0,c_Zorn_Omaxchain(X1,t_a),tc_set(tc_set(t_a)))
      | ~ c_in(c_Union(X0,t_a),v_S,tc_set(t_a)) ),
    inference(forward_subsumption_resolution,[],[f12,f7]) ).

fof(f14,plain,
    ! [X0] :
      ( ~ c_in(X0,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))
      | ~ c_in(c_Union(X0,t_a),v_S,tc_set(t_a))
      | ~ c_in(c_Union(X0,t_a),v_S,tc_set(t_a)) ),
    inference(resolution,[],[f13,f4]) ).

fof(f15,plain,
    ! [X0] :
      ( ~ c_in(X0,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))
      | ~ c_in(c_Union(X0,t_a),v_S,tc_set(t_a)) ),
    inference(duplicate_literal_removal,[],[f14]) ).

fof(f18,plain,
    ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
    inference(resolution,[],[f15,f2]) ).

fof(f19,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f18,f3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET864-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.11/0.36  % Computer : n010.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 28 03:04:32 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  Running first-order model finding
% 0.11/0.39  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.11/0.44  % (1524773)Will run a generic schedule for satisfiability detection.
% 0.11/0.44  % (1524782)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2740176410:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.44  % (1524782) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1524773-1524782"...
% 0.11/0.44  % (1524782)...printing done.
% 0.11/0.44  % (1524782)Refutation found. Thanks to Tanya!
% 0.11/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44  % (1524782)------------------------------
% 0.11/0.44  % (1524782)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44  % (1524782)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44  % (1524782)CaDiCaL version: 2.1.3
% 0.11/0.44  % (1524782)Termination reason: Refutation
% 0.11/0.44  % (1524782)Time elapsed: 0.001 s
% 0.11/0.44  % (1524782)Peak memory usage: 11 MB
% 0.11/0.44  % (1524782)Instructions burned: 1 (million)
% 0.11/0.44  % (1524773)Success in time 0.034 s
% 0.11/0.44  % Vampire exiting
%------------------------------------------------------------------------------