↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SET841-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% 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 12:42:06 PM UTC 2026

% Result   : Unsatisfiable 2.66s 1.34s
% Output   : Refutation 2.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   14 (  10 unt;   0 def)
%            Number of atoms       :   24 (   6 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   22 (  12   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :    6 (   6   !;   0   ?)

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

fof(f2,axiom,
    ! [X2,X3,X0,X1] :
      ( c_lessequals(c_Zorn_Osucc(X1,X0,X2),X3,tc_set(tc_set(X2)))
      | ~ c_in(X3,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
      | ~ c_lessequals(X0,X3,tc_set(tc_set(X2)))
      | ~ c_in(X0,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
      | X0 = X3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__subsetD_0) ).

fof(f3,negated_conjecture,
    c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f4,negated_conjecture,
    v_m = c_Zorn_Osucc(v_S,v_m,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f5,negated_conjecture,
    c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f6,negated_conjecture,
    c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f7,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f8,plain,
    ( ~ c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
    | ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | v_m = v_x ),
    inference(resolution,[],[f2,f7]) ).

fof(f10,plain,
    ( ~ c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
    | ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | v_m = v_x ),
    inference(forward_subsumption_resolution,[],[f8,f3]) ).

fof(f11,plain,
    ( ~ c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | v_m = v_x ),
    inference(forward_subsumption_resolution,[],[f10,f6]) ).

fof(f12,plain,
    v_m = v_x,
    inference(forward_subsumption_resolution,[],[f11,f5]) ).

fof(f13,plain,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_m,tc_set(tc_set(t_a))),
    inference(superposition,[],[f7,f12]) ).

fof(f17,plain,
    ~ c_lessequals(v_m,v_m,tc_set(tc_set(t_a))),
    inference(superposition,[],[f13,f4]) ).

fof(f19,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f17,f1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET841-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n005.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 28 02:57:47 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.66/1.34  % (386626)Input is clausal, will run a generic CNF schedule.
% 2.66/1.34  % (386635)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=13599837:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.66/1.34  % (386635)First to succeed.
% 2.66/1.34  % (386635)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-386626"
% 2.66/1.34  % (386631)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1571753938:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.66/1.34  % (386632)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1065872423:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.66/1.34  % (386633)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1093634235:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.66/1.34  % (386634)lrs+10_1_sil=8000:sp=occurrence:random_seed=3697812204:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.66/1.34  % (386634)Also succeeded, but the first one will report.
% 2.66/1.34  % (386637)dis-21_1_sil=8000:lcm=predicate:random_seed=4006968483:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.66/1.34  % (386636)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3894335821:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.66/1.34  % (386637)Refutation not found, incomplete strategy
% 2.66/1.34  % (386637)------------------------------
% 2.66/1.34  % (386637)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.34  % (386637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.34  % (386637)CaDiCaL version: 2.1.3
% 2.66/1.34  % (386637)Termination reason: Refutation not found, incomplete strategy
% 2.66/1.34  % (386637)Time elapsed: 0.001 s
% 2.66/1.34  % (386637)Peak memory usage: 87 MB
% 2.66/1.34  % (386636)Also succeeded, but the first one will report.
% 2.66/1.34  % (386635)Refutation found. Thanks to Tanya!
% 2.66/1.34  % SZS status Unsatisfiable for theBenchmark
% 2.66/1.34  % SZS output start Proof for theBenchmark
% See solution above
% 2.66/1.34  % (386635)------------------------------
% 2.66/1.34  % (386635)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.34  % (386635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.34  % (386635)CaDiCaL version: 2.1.3
% 2.66/1.34  % (386635)Termination reason: Refutation
% 2.66/1.34  % (386635)Time elapsed: 0.001 s
% 2.66/1.34  % (386635)Peak memory usage: 88 MB
% 2.66/1.34  % (386635)Instructions burned: 1 (million)
% 2.66/1.34  % (386635)------------------------------
% 2.66/1.34  % (386635)------------------------------
% 2.66/1.34  % (386626)Success in time 0.292 s
% 2.66/1.34  % Vampire exiting
%------------------------------------------------------------------------------