↑ 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  : SWC076-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:33 PM UTC 2026

% Result   : Unsatisfiable 0.49s 0.49s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   49 (  16 unt;   3 def)
%            Number of atoms       :  120 (  20 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  142 (  71   ~;  68   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   4 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 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(f57,axiom,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).

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

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

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

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,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ segmentP(sk2,X0)
      | ~ segmentP(sk1,X0) ),
    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,
    ssList(sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

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

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

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

fof(f217,negated_conjecture,
    ( nil != sk2
    | nil != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f220,plain,
    ! [X0] :
      ( ~ neq(X0,nil)
      | ~ ssList(X0)
      | ~ segmentP(sk4,X0)
      | ~ segmentP(sk3,X0) ),
    inference(definition_unfolding,[],[f206,f204,f205]) ).

fof(f221,plain,
    ( nil != sk4
    | nil != sk3 ),
    inference(definition_unfolding,[],[f217,f204,f205]) ).

fof(f236,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(app(X0,X1),X2))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f187]) ).

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

fof(f255,plain,
    ( nil != sk3
    | spl0_1 ),
    inference(avatar_component_clause,[],[f253]) ).

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

fof(f260,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f221,f257,f253]) ).

fof(f261,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f216,f257,f253]) ).

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

fof(f268,plain,
    ( ssList(nil)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f267]) ).

fof(f303,plain,
    spl0_4,
    inference(avatar_split_clause,[],[f8,f267]) ).

fof(f503,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ ssList(nil)
      | nil = X0
      | ~ ssList(X0)
      | ~ segmentP(sk4,X0)
      | ~ segmentP(sk3,X0) ),
    inference(resolution,[],[f102,f220]) ).

fof(f506,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ ssList(nil)
      | nil = X0
      | ~ segmentP(sk4,X0)
      | ~ segmentP(sk3,X0) ),
    inference(duplicate_literal_removal,[],[f503]) ).

fof(f507,plain,
    ( ! [X0] :
        ( ~ segmentP(sk4,X0)
        | nil = X0
        | ~ ssList(X0)
        | ~ segmentP(sk3,X0) )
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f506,f268]) ).

fof(f3327,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(sk5)
    | ~ ssList(sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk6) ),
    inference(superposition,[],[f236,f210]) ).

fof(f3334,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk6) ),
    inference(forward_subsumption_resolution,[],[f3327,f207]) ).

fof(f3344,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk6) ),
    inference(forward_subsumption_resolution,[],[f3334,f202]) ).

fof(f3354,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(sk6) ),
    inference(forward_subsumption_resolution,[],[f3344,f203]) ).

fof(f3359,plain,
    segmentP(sk4,sk3),
    inference(forward_subsumption_resolution,[],[f3354,f208]) ).

fof(f3362,plain,
    ( nil = sk3
    | ~ ssList(sk3)
    | ~ segmentP(sk3,sk3)
    | ~ spl0_4 ),
    inference(resolution,[],[f3359,f507]) ).

fof(f3368,plain,
    ( ~ ssList(sk3)
    | ~ segmentP(sk3,sk3)
    | spl0_1
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f3362,f255]) ).

fof(f3371,plain,
    ( ~ segmentP(sk3,sk3)
    | spl0_1
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f3368,f202]) ).

fof(f3403,plain,
    ( ~ ssList(sk3)
    | spl0_1
    | ~ spl0_4 ),
    inference(resolution,[],[f3371,f57]) ).

fof(f3404,plain,
    ( $false
    | spl0_1
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f3403,f202]) ).

fof(f3405,plain,
    ( spl0_1
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f3404]) ).

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

cnf(s2,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f261]) ).

cnf(s12,plain,
    spl0_4,
    inference(sat_conversion,[],[f303]) ).

cnf(s121,plain,
    ( spl0_1
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f3405]) ).

cnf(s123,plain,
    spl0_1,
    inference(rat,[],[s121,s12]) ).

cnf(s128,plain,
    spl0_2,
    inference(rat,[],[s2,s123]) ).

cnf(s131,plain,
    $false,
    inference(rat,[],[s1,s128,s123]) ).

fof(f3406,plain,
    $false,
    inference(avatar_sat_refutation,[],[s131]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC076-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.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 28 07:44:45 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39  Running first-order model finding
% 0.14/0.39  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.49/0.49  % (2868425)Will run a generic schedule for satisfiability detection.
% 0.49/0.49  % (2868431)% WARNING: option uhcvi not known.
% 0.49/0.49  % (2868435)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1458842848:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.49/0.49  % (2868431)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4040826972:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.49/0.49  % (2868433)dis+10_1_sil=32000:sp=arity:random_seed=3650801771:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.49/0.49  % (2868430)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2702725347_2999 on theBenchmark for (2999ds/0Mi)
% 0.49/0.49  % (2868434)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4272676416:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.49/0.49  % (2868432)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=900183552:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.49/0.49  % (2868436)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1395383329:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.49/0.49  % TRYING [1]
% 0.49/0.49  % TRYING [2]
% 0.49/0.49  % TRYING [3]
% 0.49/0.49  % (2868435)Instruction limit reached! 
% 0.49/0.49  % (2868435)------------------------------
% 0.49/0.49  % (2868435)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.49  % (2868435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.49  % (2868435)CaDiCaL version: 2.1.3
% 0.49/0.49  % (2868435)Termination reason: Instruction limit
% 0.49/0.49  % (2868435)Termination phase: Saturation
% 0.49/0.49  % (2868435)Time elapsed: 0.038 s
% 0.49/0.49  % (2868435)Peak memory usage: 14 MB
% 0.49/0.49  % (2868435)Instructions burned: 135 (million)
% 0.49/0.49  % TRYING [4]
% 0.49/0.49  % (2868444)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3159806239:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.49/0.49  % (2868433) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2868425-2868433"...
% 0.49/0.49  % TRYING [1]
% 0.49/0.49  % (2868433)...printing done.
% 0.49/0.49  % TRYING [2]
% 0.49/0.49  % (2868433)Refutation found. Thanks to Tanya!
% 0.49/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.49/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.49/0.49  % (2868433)------------------------------
% 0.49/0.49  % (2868433)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.49  % (2868433)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.49  % (2868433)CaDiCaL version: 2.1.3
% 0.49/0.49  % (2868433)Termination reason: Refutation
% 0.49/0.49  % (2868433)Time elapsed: 0.055 s
% 0.49/0.49  % (2868433)Peak memory usage: 14 MB
% 0.49/0.49  % (2868433)Instructions burned: 92 (million)
% 0.49/0.49  % (2868425)Success in time 0.094 s
% 0.49/0.49  % Vampire exiting
%------------------------------------------------------------------------------