↑ 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  : SWC037-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n009.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:04:23 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f80,axiom,
    ! [X0] :
      ( ~ segmentP(nil,X0)
      | ~ ssList(X0)
      | nil = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).

fof(f118,axiom,
    ! [X0,X1] :
      ( X0 != X1
      | ~ neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).

fof(f203,negated_conjecture,
    ssList(sk4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).

fof(f204,negated_conjecture,
    nil = sk2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

fof(f205,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    nil != sk1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f209,negated_conjecture,
    ( ssList(sk5)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

fof(f213,negated_conjecture,
    ( neq(sk5,nil)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

fof(f214,negated_conjecture,
    ( segmentP(sk4,sk5)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f216,plain,
    nil = sk4,
    inference(definition_unfolding,[],[f204,f205]) ).

fof(f244,plain,
    ! [X0] :
      ( ~ segmentP(sk4,X0)
      | ~ ssList(X0)
      | sk4 = X0 ),
    inference(definition_unfolding,[],[f80,f216,f216]) ).

fof(f271,plain,
    sk3 != sk4,
    inference(definition_unfolding,[],[f207,f216,f206]) ).

fof(f273,plain,
    ( ssList(sk5)
    | sk3 = sk4 ),
    inference(definition_unfolding,[],[f209,f216]) ).

fof(f277,plain,
    ( neq(sk5,sk4)
    | sk3 = sk4 ),
    inference(definition_unfolding,[],[f213,f216,f216]) ).

fof(f278,plain,
    ( segmentP(sk4,sk5)
    | sk3 = sk4 ),
    inference(definition_unfolding,[],[f214,f216]) ).

fof(f286,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f118]) ).

fof(f308,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f286]) ).

fof(f339,plain,
    ssList(sk5),
    inference(forward_subsumption_resolution,[],[f273,f271]) ).

fof(f340,plain,
    neq(sk5,sk4),
    inference(forward_subsumption_resolution,[],[f277,f271]) ).

fof(f341,plain,
    segmentP(sk4,sk5),
    inference(forward_subsumption_resolution,[],[f278,f271]) ).

fof(f496,plain,
    ( ~ ssList(sk5)
    | sk4 = sk5 ),
    inference(resolution,[],[f244,f341]) ).

fof(f498,plain,
    sk4 = sk5,
    inference(forward_subsumption_resolution,[],[f496,f339]) ).

fof(f510,plain,
    neq(sk4,sk4),
    inference(superposition,[],[f340,f498]) ).

fof(f515,plain,
    ~ ssList(sk4),
    inference(resolution,[],[f510,f308]) ).

fof(f516,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f515,f203]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC037-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41  % Computer : n009.cluster.edu
% 0.13/0.41  % Model    : x86_64 x86_64
% 0.13/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41  % Memory   : 8046.5625MB
% 0.13/0.41  % OS       : Linux 6.8.0-71-generic
% 0.13/0.41  % CPULimit : 300
% 0.13/0.41  % WCLimit  : 300
% 0.13/0.41  % DateTime : Mon Sep 28 07:32:34 UTC 2026
% 0.13/0.42  % CPUTime  : 
% 0.13/0.42  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.45  Running first-order model finding
% 0.13/0.45  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.19/0.51  % (2864105)Will run a generic schedule for satisfiability detection.
% 0.19/0.51  % (2864116)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2890307588:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.51  % (2864111)% WARNING: option uhcvi not known.
% 0.19/0.51  % (2864110)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3043005597_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.51  % (2864111)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2421032570:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.51  % (2864112)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1031388918:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.51  % (2864113)dis+10_1_sil=32000:sp=arity:random_seed=2629892931:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.51  % (2864114)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1469112757:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.51  % (2864115)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2834431127:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.51  % (2864112) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2864105-2864112"...
% 0.19/0.51  % (2864112)...printing done.
% 0.19/0.51  % TRYING [1]
% 0.19/0.51  % (2864112)Refutation found. Thanks to Tanya!
% 0.19/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51  % (2864112)------------------------------
% 0.19/0.51  % (2864112)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.51  % (2864112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.51  % (2864112)CaDiCaL version: 2.1.3
% 0.19/0.51  % (2864112)Termination reason: Refutation
% 0.19/0.51  % (2864112)Time elapsed: 0.010 s
% 0.19/0.51  % (2864112)Peak memory usage: 12 MB
% 0.19/0.51  % (2864112)Instructions burned: 13 (million)
% 0.19/0.51  % (2864105)Success in time 0.054 s
% 0.19/0.51  % Vampire exiting
%------------------------------------------------------------------------------