↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n005.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:49:00 PM UTC 2026

% Result   : Unsatisfiable 2.82s 1.15s
% Output   : Refutation 2.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (   4 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   45 (  24   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   32 (  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0,X1] :
      ( big_g(X1,g(X0,X1))
      | ~ big_f(X0,g(X0,X1))
      | ~ big_f(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

fof(f2,negated_conjecture,
    ! [X0,X1] :
      ( ~ big_g(X1,g(X0,X1))
      | big_f(X0,g(X0,X1))
      | ~ big_f(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

fof(f3,negated_conjecture,
    ! [X0,X1] :
      ( ~ big_f(X0,X1)
      | ~ big_f(g(X0,X1),g(X0,X1))
      | big_g(g(X0,X1),g(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

fof(f5,negated_conjecture,
    ! [X0,X1] :
      ( ~ big_g(g(X0,X1),g(X0,X1))
      | big_f(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

fof(f6,negated_conjecture,
    ! [X0,X1] :
      ( big_g(g(X0,X1),g(X0,X1))
      | big_g(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

fof(f7,negated_conjecture,
    ! [X0,X1] :
      ( ~ big_g(g(X0,X1),g(X0,X1))
      | ~ big_g(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

fof(f8,plain,
    ! [X0,X1] :
      ( big_g(X0,X1)
      | big_f(X0,X1) ),
    inference(resolution,[],[f6,f5]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( big_f(g(X0,X1),g(X0,X1))
      | ~ big_g(X0,X1) ),
    inference(resolution,[],[f8,f7]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( big_f(X1,g(X0,X1))
      | ~ big_f(X0,X1)
      | big_f(X0,g(X0,X1)) ),
    inference(resolution,[],[f2,f8]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( big_g(g(X0,X1),g(X0,X1))
      | ~ big_f(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f3,f8]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ big_g(X0,X1)
      | ~ big_f(X0,X1) ),
    inference(resolution,[],[f15,f7]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ~ big_f(X1,g(X1,X0))
      | ~ big_f(X0,g(X1,X0))
      | ~ big_f(X1,X0) ),
    inference(resolution,[],[f16,f1]) ).

fof(f27,plain,
    ! [X0] :
      ( ~ big_f(X0,g(X0,X0))
      | ~ big_f(X0,X0) ),
    inference(factoring,[],[f21]) ).

fof(f29,plain,
    ! [X0] :
      ( ~ big_f(X0,X0)
      | ~ big_f(X0,X0)
      | big_f(X0,g(X0,X0)) ),
    inference(resolution,[],[f27,f13]) ).

fof(f30,plain,
    ! [X0] :
      ( ~ big_f(X0,X0)
      | big_f(X0,g(X0,X0)) ),
    inference(duplicate_literal_removal,[],[f29]) ).

fof(f31,plain,
    ! [X0] : ~ big_f(X0,X0),
    inference(forward_subsumption_resolution,[],[f30,f27]) ).

fof(f32,plain,
    ! [X0,X1] : ~ big_g(X0,X1),
    inference(resolution,[],[f31,f10]) ).

fof(f35,plain,
    ! [X0,X1] : big_g(X0,X1),
    inference(resolution,[],[f32,f6]) ).

fof(f38,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f35,f32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN012-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18  % Computer : n005.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 15:20:01 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running first-order theorem proving
% 0.09/0.22  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
% 2.82/1.15  % (857938)Input is clausal, will run a generic CNF schedule.
% 2.82/1.15  % (857947)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3231577783:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.82/1.15  % (857947)First to succeed.
% 2.82/1.15  % (857947)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-857938"
% 2.82/1.15  % (857948)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3768270481:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.82/1.15  % (857945)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1176989917:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.82/1.15  % (857946)lrs+10_1_sil=8000:sp=occurrence:random_seed=441487571:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.82/1.15  % (857944)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=349702065:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.82/1.15  % (857943)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=496086662:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.82/1.15  % (857949)dis-21_1_sil=8000:lcm=predicate:random_seed=2733655672: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)
% 2.82/1.15  % (857946)Also succeeded, but the first one will report.
% 2.82/1.15  % (857948)Also succeeded, but the first one will report.
% 2.82/1.15  % (857949)Also succeeded, but the first one will report.
% 2.82/1.15  % (857947)Refutation found. Thanks to Tanya!
% 2.82/1.15  % SZS status Unsatisfiable for theBenchmark
% 2.82/1.15  % SZS output start Proof for theBenchmark
% See solution above
% 2.82/1.15  % (857947)------------------------------
% 2.82/1.15  % (857947)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.82/1.15  % (857947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.82/1.15  % (857947)CaDiCaL version: 2.1.3
% 2.82/1.15  % (857947)Termination reason: Refutation
% 2.82/1.15  % (857947)Time elapsed: 0.001 s
% 2.82/1.15  % (857947)Peak memory usage: 88 MB
% 2.82/1.15  % (857947)Instructions burned: 1 (million)
% 2.82/1.15  % (857947)------------------------------
% 2.82/1.15  % (857947)------------------------------
% 2.82/1.15  % (857938)Success in time 0.304 s
% 2.82/1.15  % Vampire exiting
%------------------------------------------------------------------------------