↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC372-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n015.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:03:41 PM UTC 2026

% Result   : Unsatisfiable 0.20s 1.31s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   24 (  12 unt;   0 def)
%            Number of atoms       :   60 (   7 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   76 (  40   ~;  36   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   20 (  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

fof(f74,axiom,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause74) ).

fof(f161,axiom,
    ! [X2,X0,X1] :
      ( app(app(X2,X1),X0) = app(X2,app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X2)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause149) ).

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/sandbox/benchmark/theBenchmark.p',clause173) ).

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

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

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,
    ssList(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    app(sk3,sk5) = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

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

fof(f216,plain,
    ~ segmentP(sk4,sk3),
    inference(definition_unfolding,[],[f212,f204,f205]) ).

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

fof(f755,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(X0,app(X1,X2)))
      | segmentP(app(app(X0,X1),X2),X1) ),
    inference(forward_subsumption_demodulation,[],[f222,f161]) ).

fof(f756,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(X0,app(X1,X2)),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(X0,app(X1,X2)))
      | ~ ssList(X2) ),
    inference(forward_subsumption_demodulation,[],[f755,f161]) ).

fof(f768,plain,
    ! [X0] :
      ( segmentP(app(X0,sk4),sk3)
      | ~ ssList(X0)
      | ~ ssList(sk3)
      | ~ ssList(app(X0,sk4))
      | ~ ssList(sk5) ),
    inference(superposition,[],[f756,f208]) ).

fof(f780,plain,
    ! [X0] :
      ( segmentP(app(X0,sk4),sk3)
      | ~ ssList(X0)
      | ~ ssList(app(X0,sk4))
      | ~ ssList(sk5) ),
    inference(forward_subsumption_resolution,[],[f768,f202]) ).

fof(f785,plain,
    ! [X0] :
      ( segmentP(app(X0,sk4),sk3)
      | ~ ssList(X0)
      | ~ ssList(app(X0,sk4)) ),
    inference(forward_subsumption_resolution,[],[f780,f206]) ).

fof(f985,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(nil)
    | ~ ssList(sk4)
    | ~ ssList(sk4) ),
    inference(superposition,[],[f785,f74]) ).

fof(f987,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(nil)
    | ~ ssList(sk4) ),
    inference(duplicate_literal_removal,[],[f985]) ).

fof(f990,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk4) ),
    inference(forward_subsumption_resolution,[],[f987,f216]) ).

fof(f993,plain,
    ~ ssList(sk4),
    inference(forward_subsumption_resolution,[],[f990,f8]) ).

fof(f994,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f993,f203]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC372-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n015.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 09:23:47 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running first-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/1.31  % (2495919)Input is clausal, will run a generic CNF schedule.
% 0.20/1.31  % (2495925)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3275358683:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.20/1.31  % (2495929)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2478405586:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.20/1.31  % (2495927)lrs+10_1_sil=8000:sp=occurrence:random_seed=1262217735:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.20/1.31  % (2495924)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=165478713:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.20/1.31  % (2495928)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2903718725:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.20/1.31  % (2495930)dis-21_1_sil=8000:lcm=predicate:random_seed=1576827688:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 0.20/1.31  % (2495926)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3528895004:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.20/1.31  % (2495928)First to succeed.
% 0.20/1.31  % (2495928)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2495919"
% 0.20/1.31  % (2495927)Also succeeded, but the first one will report.
% 0.20/1.31  % (2495930)Instruction limit reached! 
% 0.20/1.31  % (2495930)------------------------------
% 0.20/1.31  % (2495930)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.31  % (2495930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.31  % (2495930)CaDiCaL version: 2.1.3
% 0.20/1.31  % (2495930)Termination reason: Instruction limit
% 0.20/1.31  % (2495930)Termination phase: Saturation
% 0.20/1.31  % (2495930)Time elapsed: 0.051 s
% 0.20/1.31  % (2495930)Peak memory usage: 89 MB
% 0.20/1.31  % (2495930)Instructions burned: 117 (million)
% 0.20/1.31  % (2495929)Also succeeded, but the first one will report.
% 0.20/1.31  % (2495938)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2363757577:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 0.20/1.31  % (2495938)Also succeeded, but the first one will report.
% 0.20/1.31  % (2495928)Refutation found. Thanks to Tanya!
% 0.20/1.31  % SZS status Unsatisfiable for theBenchmark
% 0.20/1.31  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.31  % (2495928)------------------------------
% 0.20/1.31  % (2495928)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.31  % (2495928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.31  % (2495928)CaDiCaL version: 2.1.3
% 0.20/1.31  % (2495928)Termination reason: Refutation
% 0.20/1.31  % (2495928)Time elapsed: 0.033 s
% 0.20/1.31  % (2495928)Peak memory usage: 89 MB
% 0.20/1.31  % (2495928)Instructions burned: 55 (million)
% 0.20/1.31  % (2495928)------------------------------
% 0.20/1.31  % (2495928)------------------------------
% 0.20/1.31  % (2495919)Success in time 0.442 s
% 0.20/1.31  % Vampire exiting
%------------------------------------------------------------------------------