↑ 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  : SWC104-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 : 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:04:41 PM UTC 2026

% Result   : Unsatisfiable 0.18s 0.49s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   59 (  18 unt;   5 def)
%            Number of atoms       :  125 (  17 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  129 (  63   ~;  61   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).

fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).

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

fof(f102,plain,
    ! [X0,X1] :
      ( neq(X1,X0)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | X0 = X1 ),
    inference(reorient_equations,[],[f101]) ).

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(f155,axiom,
    ! [X2,X0,X1] :
      ( app(X0,X1) != X2
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | frontsegP(X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).

fof(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).

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

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

fof(f206,negated_conjecture,
    neq(sk2,nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    app(sk3,sk5) = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f209,plain,
    sk4 = app(sk3,sk5),
    inference(reorient_equations,[],[f208]) ).

fof(f213,negated_conjecture,
    ( nil = sk4
    | nil != sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

fof(f214,negated_conjecture,
    ( ~ neq(sk1,nil)
    | ~ frontsegP(sk2,sk1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f217,plain,
    neq(sk4,nil),
    inference(definition_unfolding,[],[f206,f204]) ).

fof(f218,plain,
    ( ~ neq(sk3,nil)
    | ~ frontsegP(sk4,sk3) ),
    inference(definition_unfolding,[],[f214,f205,f204,f205]) ).

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

fof(f230,plain,
    ! [X0,X1] :
      ( ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(app(X0,X1))
      | frontsegP(app(X0,X1),X0) ),
    inference(equality_resolution,[],[f155]) ).

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

fof(f250,definition,
    ( spl0_1
  <=> frontsegP(sk4,sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f252,plain,
    ( ~ frontsegP(sk4,sk3)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f250]) ).

fof(f254,definition,
    ( spl0_2
  <=> neq(sk3,nil) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f256,plain,
    ( ~ neq(sk3,nil)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f254]) ).

fof(f257,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f218,f254,f250]) ).

fof(f259,definition,
    ( spl0_3
  <=> nil = sk3 ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f261,plain,
    ( nil != sk3
    | spl0_3 ),
    inference(avatar_component_clause,[],[f259]) ).

fof(f263,definition,
    ( spl0_4
  <=> nil = sk4 ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f265,plain,
    ( nil = sk4
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f263]) ).

fof(f266,plain,
    ( ~ spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f213,f263,f259]) ).

fof(f272,definition,
    ( spl0_6
  <=> ssList(nil) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f273,plain,
    ( ssList(nil)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f272]) ).

fof(f308,plain,
    spl0_6,
    inference(avatar_split_clause,[],[f8,f272]) ).

fof(f585,plain,
    ( neq(nil,nil)
    | ~ spl0_4 ),
    inference(superposition,[],[f217,f265]) ).

fof(f639,plain,
    ( ~ ssList(nil)
    | ~ spl0_4 ),
    inference(resolution,[],[f247,f585]) ).

fof(f641,plain,
    ( $false
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f639,f273]) ).

fof(f642,plain,
    ( ~ spl0_4
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f641]) ).

fof(f1079,plain,
    ( ~ ssList(sk3)
    | ~ ssList(nil)
    | nil = sk3
    | spl0_2 ),
    inference(resolution,[],[f256,f102]) ).

fof(f1080,plain,
    ( ~ ssList(nil)
    | nil = sk3
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f1079,f202]) ).

fof(f1082,plain,
    ( nil = sk3
    | spl0_2
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f1080,f273]) ).

fof(f1092,plain,
    ( $false
    | spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f1082,f261]) ).

fof(f1093,plain,
    ( spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f1092]) ).

fof(f1169,plain,
    ! [X0,X1] :
      ( frontsegP(app(X0,X1),X0)
      | ~ ssList(X0)
      | ~ ssList(X1) ),
    inference(forward_subsumption_resolution,[],[f230,f85]) ).

fof(f1189,plain,
    ( frontsegP(sk4,sk3)
    | ~ ssList(sk3)
    | ~ ssList(sk5) ),
    inference(superposition,[],[f1169,f209]) ).

fof(f1195,plain,
    ( ~ ssList(sk3)
    | ~ ssList(sk5)
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f1189,f252]) ).

fof(f1197,plain,
    ( ~ ssList(sk5)
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f1195,f202]) ).

fof(f1198,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f1197,f207]) ).

fof(f1199,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f1198]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f257]) ).

cnf(s2,plain,
    ( ~ spl0_3
    | spl0_4 ),
    inference(sat_conversion,[],[f266]) ).

cnf(s12,plain,
    spl0_6,
    inference(sat_conversion,[],[f308]) ).

cnf(s17,plain,
    ( ~ spl0_4
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f642]) ).

cnf(s50,plain,
    ( spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f1093]) ).

cnf(s55,plain,
    spl0_1,
    inference(sat_conversion,[],[f1199]) ).

cnf(s56,plain,
    ~ spl0_4,
    inference(rat,[],[s17,s12]) ).

cnf(s66,plain,
    ~ spl0_3,
    inference(rat,[],[s2,s56]) ).

cnf(s67,plain,
    spl0_2,
    inference(rat,[],[s50,s12,s66]) ).

cnf(s72,plain,
    $false,
    inference(rat,[],[s1,s67,s55]) ).

fof(f1200,plain,
    $false,
    inference(avatar_sat_refutation,[],[s72]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC104-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n016.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Mon Sep 28 07:58:48 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.42  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.18/0.49  % (3462296)Will run a generic schedule for satisfiability detection.
% 0.18/0.49  % (3462307)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3790412652:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.49  % (3462302)% WARNING: option uhcvi not known.
% 0.18/0.49  % (3462301)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2755768266_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.49  % (3462302)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4230278111:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.49  % (3462303)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2185562901:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.49  % (3462304)dis+10_1_sil=32000:sp=arity:random_seed=665387034:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.49  % (3462305)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3240561572:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.49  % (3462306)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=644303540:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.49  % TRYING [1]
% 0.18/0.49  % TRYING [2]
% 0.18/0.49  % TRYING [3]
% 0.18/0.49  % (3462304) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3462296-3462304"...
% 0.18/0.49  % (3462304)...printing done.
% 0.18/0.49  % (3462302) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3462296-3462302"...
% 0.18/0.49  % (3462304)Refutation found. Thanks to Tanya!
% 0.18/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49  % (3462304)------------------------------
% 0.18/0.49  % (3462304)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49  % (3462304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49  % (3462304)CaDiCaL version: 2.1.3
% 0.18/0.49  % (3462304)Termination reason: Refutation
% 0.18/0.49  % (3462304)Time elapsed: 0.022 s
% 0.18/0.49  % (3462304)Peak memory usage: 13 MB
% 0.18/0.49  % (3462304)Instructions burned: 33 (million)
% 0.18/0.49  % (3462296)Success in time 0.057 s
% 0.18/0.49  % Vampire exiting
%------------------------------------------------------------------------------