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

% Computer : n016.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:05:35 PM UTC 2026

% Result   : Unsatisfiable 0.29s 0.26s
% Output   : Refutation 0.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   25 (   8 unt;   0 def)
%            Number of atoms       :   58 (   2 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   70 (  37   ~;  33   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    1 (   1   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    segmentP(sk4,sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    totalorderedP(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ! [X0] :
      ( ~ neq(sk3,X0)
      | ~ ssList(X0)
      | ~ segmentP(sk4,X0)
      | ~ segmentP(X0,sk3)
      | ~ totalorderedP(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f209,negated_conjecture,
    ( ssList(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    ( neq(sk1,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f211,negated_conjecture,
    ( segmentP(sk2,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f212,negated_conjecture,
    ( segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f213,negated_conjecture,
    ( totalorderedP(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

fof(f216,plain,
    ( ssList(sk5)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f209,f204,f205,f205]) ).

fof(f217,plain,
    ( neq(sk3,sk5)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f210,f205,f204,f205,f205]) ).

fof(f218,plain,
    ( segmentP(sk4,sk5)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f211,f204,f204,f205,f205]) ).

fof(f219,plain,
    ( segmentP(sk5,sk3)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f212,f205,f204,f205,f205]) ).

fof(f220,plain,
    ( totalorderedP(sk5)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f213,f204,f205,f205]) ).

fof(f283,plain,
    ( ssList(sk5)
    | ~ totalorderedP(sk3) ),
    inference(forward_subsumption_resolution,[],[f216,f206]) ).

fof(f284,plain,
    ssList(sk5),
    inference(forward_subsumption_resolution,[],[f283,f207]) ).

fof(f285,plain,
    ( totalorderedP(sk5)
    | ~ totalorderedP(sk3) ),
    inference(forward_subsumption_resolution,[],[f220,f206]) ).

fof(f286,plain,
    totalorderedP(sk5),
    inference(forward_subsumption_resolution,[],[f285,f207]) ).

fof(f291,plain,
    ( neq(sk3,sk5)
    | ~ totalorderedP(sk3) ),
    inference(forward_subsumption_resolution,[],[f217,f206]) ).

fof(f292,plain,
    neq(sk3,sk5),
    inference(forward_subsumption_resolution,[],[f291,f207]) ).

fof(f293,plain,
    ( ~ ssList(sk5)
    | ~ segmentP(sk4,sk5)
    | ~ segmentP(sk5,sk3)
    | ~ totalorderedP(sk5) ),
    inference(resolution,[],[f292,f208]) ).

fof(f294,plain,
    ( ~ segmentP(sk4,sk5)
    | ~ segmentP(sk5,sk3)
    | ~ totalorderedP(sk5) ),
    inference(forward_subsumption_resolution,[],[f293,f284]) ).

fof(f295,plain,
    ( ~ segmentP(sk4,sk5)
    | ~ segmentP(sk5,sk3) ),
    inference(forward_subsumption_resolution,[],[f294,f286]) ).

fof(f296,plain,
    $false,
    inference(global_subsumption,[],[f295,f206,f207,f218,f219]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC333-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n016.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 09:14:25 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/0.21  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.29/0.26  % (3497246)Will run a generic schedule for satisfiability detection.
% 0.29/0.26  % (3497253)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3823919675:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.29/0.26  % (3497253) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3497246-3497253"...
% 0.29/0.26  % (3497252)% WARNING: option uhcvi not known.
% 0.29/0.26  % (3497253)...printing done.
% 0.29/0.26  % (3497253)Refutation found. Thanks to Tanya!
% 0.29/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.29/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.29/0.26  % (3497253)------------------------------
% 0.29/0.26  % (3497253)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.26  % (3497253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.26  % (3497253)CaDiCaL version: 2.1.3
% 0.29/0.26  % (3497253)Termination reason: Refutation
% 0.29/0.26  % (3497253)Time elapsed: 0.003 s
% 0.29/0.26  % (3497253)Peak memory usage: 12 MB
% 0.29/0.26  % (3497253)Instructions burned: 8 (million)
% 0.29/0.26  % (3497246)Success in time 0.034 s
% 0.29/0.26  % Vampire exiting
%------------------------------------------------------------------------------