↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---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 THM

% Computer : n001.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:07 PM UTC 2026

% Result   : Unsatisfiable 2.54s 1.32s
% Output   : Refutation 2.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   27 (   5 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   25 (  14   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-3 aty)
%            Number of variables   :   34 (  34   !;   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(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_in(c_Union(X0,tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
      | ~ c_lessequals(X0,c_Zorn_OTFin(X1,X2),tc_set(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_Zorn_Osucc(X1,X0,X2) != X0
      | ~ 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))) ),
    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(f27,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)
      | ~ c_lessequals(c_Zorn_OTFin(X0,X1),c_Zorn_OTFin(X0,X1),tc_set(tc_set(tc_set(X1)))) ),
    inference(resolution,[],[f10,f8]) ).

fof(f28,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(forward_subsumption_resolution,[],[f27,f7]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)) != c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1))
      | ~ c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_minus(c_Zorn_Ochain(X0,X1),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(tc_set(X1)))),tc_set(tc_set(X1))) ),
    inference(superposition,[],[f11,f28]) ).

fof(f30,plain,
    ! [X0,X1] : ~ c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_minus(c_Zorn_Ochain(X0,X1),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(tc_set(X1)))),tc_set(tc_set(X1))),
    inference(trivial_inequality_removal,[],[f29]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ~ c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_Ochain(X0,X1),tc_set(tc_set(X1)))
      | c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(X1))) ),
    inference(resolution,[],[f30,f1]) ).

fof(f33,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)))
      | c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(X1))) ),
    inference(resolution,[],[f31,f9]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(X1)))
      | ~ c_lessequals(c_Zorn_OTFin(X0,X1),c_Zorn_OTFin(X0,X1),tc_set(tc_set(tc_set(X1)))) ),
    inference(resolution,[],[f33,f8]) ).

fof(f37,plain,
    ! [X0,X1] : c_in(c_Union(c_Zorn_OTFin(X0,X1),tc_set(X1)),c_Zorn_Omaxchain(X0,X1),tc_set(tc_set(X1))),
    inference(forward_subsumption_resolution,[],[f36,f7]) ).

fof(f39,plain,
    $false,
    inference(resolution,[],[f37,f12]) ).

%------------------------------------------------------------------------------
%----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 THM
% 0.11/0.38  % Computer : n001.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 28 03:06:17 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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.54/1.32  % (4171443)Input is clausal, will run a generic CNF schedule.
% 2.54/1.32  % (4171453)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2823728368:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.54/1.32  % (4171453)First to succeed.
% 2.54/1.32  % (4171453)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4171443"
% 2.54/1.32  % (4171449)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=243330936:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.54/1.32  % (4171450)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1901281229:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.54/1.32  % (4171448)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=1815144501:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.54/1.32  % (4171452)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3766103343:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.54/1.32  % (4171452)Also succeeded, but the first one will report.
% 2.54/1.32  % (4171451)lrs+10_1_sil=8000:sp=occurrence:random_seed=1818137737:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.54/1.32  % (4171454)dis-21_1_sil=8000:lcm=predicate:random_seed=1207450520: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.54/1.32  % (4171454)Also succeeded, but the first one will report.
% 2.54/1.32  % (4171451)Also succeeded, but the first one will report.
% 2.54/1.32  % (4171453)Refutation found. Thanks to Tanya!
% 2.54/1.32  % SZS status Unsatisfiable for theBenchmark
% 2.54/1.32  % SZS output start Proof for theBenchmark
% See solution above
% 2.54/1.33  % (4171453)------------------------------
% 2.54/1.33  % (4171453)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.54/1.33  % (4171453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.54/1.33  % (4171453)CaDiCaL version: 2.1.3
% 2.54/1.33  % (4171453)Termination reason: Refutation
% 2.54/1.33  % (4171453)Time elapsed: 0.002 s
% 2.54/1.33  % (4171453)Peak memory usage: 88 MB
% 2.54/1.33  % (4171453)Instructions burned: 3 (million)
% 2.54/1.33  % (4171453)------------------------------
% 2.54/1.33  % (4171453)------------------------------
% 2.54/1.33  % (4171443)Success in time 0.269 s
% 2.54/1.33  % Vampire exiting
%------------------------------------------------------------------------------