↑ 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  : SWV261-1 : 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 : n017.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 01:20:38 PM UTC 2026

% Result   : Unsatisfiable 0.40s 0.33s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   21 (  12 unt;   0 def)
%            Number of atoms       :   32 (   3 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  16   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-3 aty)
%            Number of variables   :   27 (  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f127,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/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).

fof(f128,axiom,
    ! [X2,X0,X1] :
      ( c_lessequals(X0,X1,tc_set(X2))
      | ~ c_in(c_Main_OsubsetI__1(X0,X1,X2),X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).

fof(f1393,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,c_union(X3,X1,X2),X2)
      | ~ c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_0) ).

fof(f1394,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(X0,c_union(X1,X3,X2),X2)
      | ~ c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_1) ).

fof(f1406,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_in(X0,c_insert(X1,X2,X3),X3)
      | c_in(X0,X2,X3)
      | X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertE_0) ).

fof(f1473,axiom,
    ! [X0,X1] : c_lessequals(c_Message_Oparts(c_union(X0,X1,tc_Message_Omsg)),c_union(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__Un__subset2_0) ).

fof(f1474,axiom,
    ! [X0,X1] :
      ( c_lessequals(c_Message_Oparts(X0),c_Message_Oparts(X1),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(X0,X1,tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts__mono_0) ).

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

fof(f1477,negated_conjecture,
    c_in(v_X,v_G,tc_Message_Omsg),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f1478,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f2909,plain,
    ! [X0] :
      ( ~ c_lessequals(X0,c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg))
      | ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),X0,tc_set(tc_Message_Omsg)) ),
    inference(resolution,[],[f1476,f1478]) ).

fof(f2923,plain,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference(resolution,[],[f2909,f1473]) ).

fof(f2938,plain,
    ~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    inference(resolution,[],[f2923,f1474]) ).

fof(f2946,plain,
    ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),
    inference(resolution,[],[f2938,f128]) ).

fof(f2947,plain,
    c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg),
    inference(resolution,[],[f2938,f127]) ).

fof(f3010,plain,
    ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),v_G,tc_Message_Omsg),
    inference(resolution,[],[f2946,f1394]) ).

fof(f3011,plain,
    ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg),
    inference(resolution,[],[f2946,f1393]) ).

fof(f3105,plain,
    ( c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg)
    | v_X = c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg) ),
    inference(resolution,[],[f2947,f1406]) ).

fof(f3107,plain,
    v_X = c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),
    inference(forward_subsumption_resolution,[],[f3105,f3011]) ).

fof(f3111,plain,
    ~ c_in(v_X,v_G,tc_Message_Omsg),
    inference(superposition,[],[f3010,f3107]) ).

fof(f3113,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f3111,f1477]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV261-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.18  % Computer : n017.cluster.edu
% 0.11/0.18  % Model    : x86_64 x86_64
% 0.11/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18  % Memory   : 8046.5625MB
% 0.11/0.18  % OS       : Linux 6.8.0-71-generic
% 0.11/0.18  % CPULimit : 300
% 0.11/0.18  % WCLimit  : 300
% 0.11/0.18  % DateTime : Mon Sep 28 10:15:06 UTC 2026
% 0.11/0.18  % CPUTime  : 
% 0.11/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21  Running first-order model finding
% 0.11/0.21  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.40/0.33  % (3456073)Will run a generic schedule for satisfiability detection.
% 0.40/0.33  % (3456084)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=319268363:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.40/0.33  % (3456079)% WARNING: option uhcvi not known.
% 0.40/0.33  % (3456083)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3202708847:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.40/0.33  % (3456078)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3037961270_2999 on theBenchmark for (2999ds/0Mi)
% 0.40/0.33  % (3456081)dis+10_1_sil=32000:sp=arity:random_seed=246612477:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.40/0.33  % (3456079)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=975931631:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.40/0.33  % (3456080)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2653974736:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.40/0.33  % (3456082)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2328729635:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.40/0.33  % (3456084)Instruction limit reached! 
% 0.40/0.33  % (3456084)------------------------------
% 0.40/0.33  % (3456084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.40/0.33  % (3456084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.40/0.33  % (3456084)CaDiCaL version: 2.1.3
% 0.40/0.33  % (3456084)Termination reason: Instruction limit
% 0.40/0.33  % (3456084)Termination phase: Saturation
% 0.40/0.33  % (3456084)Time elapsed: 0.052 s
% 0.40/0.33  % (3456084)Peak memory usage: 14 MB
% 0.40/0.33  % (3456084)Instructions burned: 160 (million)
% 0.40/0.33  % (3456092)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1761759138:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.40/0.33  % (3456082) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3456073-3456082"...
% 0.40/0.33  % TRYING [1]
% 0.40/0.33  % (3456082)...printing done.
% 0.40/0.33  % (3456082)Refutation found. Thanks to Tanya!
% 0.40/0.33  % SZS status Unsatisfiable for theBenchmark
% 0.40/0.33  % SZS output start Proof for theBenchmark
% See solution above
% 0.40/0.33  % (3456082)------------------------------
% 0.40/0.33  % (3456082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.40/0.33  % (3456082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.40/0.33  % (3456082)CaDiCaL version: 2.1.3
% 0.40/0.33  % (3456082)Termination reason: Refutation
% 0.40/0.33  % (3456082)Time elapsed: 0.060 s
% 0.40/0.33  % (3456082)Peak memory usage: 14 MB
% 0.40/0.33  % (3456082)Instructions burned: 96 (million)
% 0.40/0.33  % (3456073)Success in time 0.113 s
% 0.40/0.33  % Vampire exiting
%------------------------------------------------------------------------------