↑ 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  : COL058-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n004.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 09:38:18 AM UTC 2026

% Result   : Unsatisfiable 0.26s 0.36s
% Output   : Refutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   12 (  12 unt;   0 def)
%            Number of atoms       :   12 (  11 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    7 (   7   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :    8 (   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : response(response(lark,X0),X1) = response(X0,response(X1,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_exists) ).

fof(f2,negated_conjecture,
    response(response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark)))) != response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_the_bird_exists) ).

fof(f3,plain,
    response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))) != response(response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark)))),
    inference(reorient_equations,[],[f2]) ).

fof(f4,plain,
    ! [X0,X1] : response(response(X0,X0),response(X1,X1)) = response(response(response(lark,lark),X0),X1),
    inference(superposition,[],[f1,f1]) ).

fof(f5,plain,
    ! [X0,X1] : response(response(lark,X1),response(X0,X0)) = response(X1,response(response(lark,response(X0,X0)),X0)),
    inference(superposition,[],[f1,f1]) ).

fof(f11,plain,
    ! [X0,X1] : response(response(lark,response(X0,X0)),X1) = response(response(response(lark,lark),X0),X1),
    inference(superposition,[],[f4,f1]) ).

fof(f46,plain,
    response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))) != response(response(lark,response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark)))),response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),
    inference(superposition,[],[f3,f5]) ).

fof(f60,plain,
    response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))) != response(response(lark,response(lark,response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))))),response(lark,response(lark,lark))),
    inference(forward_demodulation,[],[f46,f1]) ).

fof(f71,plain,
    response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))) != response(response(lark,response(response(lark,lark),response(response(lark,response(lark,lark)),response(lark,response(lark,lark))))),response(lark,response(lark,lark))),
    inference(forward_demodulation,[],[f60,f5]) ).

fof(f76,plain,
    response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))) != response(response(lark,response(response(response(lark,lark),lark),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),
    inference(forward_demodulation,[],[f71,f4]) ).

fof(f78,plain,
    response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))) != response(response(lark,response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(lark,response(lark,lark))),
    inference(forward_demodulation,[],[f76,f11]) ).

fof(f79,plain,
    $false,
    inference(trivial_inequality_removal,[],[f78]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : COL058-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.27  % Computer : n004.cluster.edu
% 0.11/0.27  % Model    : x86_64 x86_64
% 0.11/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.27  % Memory   : 8046.5625MB
% 0.11/0.27  % OS       : Linux 6.8.0-71-generic
% 0.11/0.27  % CPULimit : 300
% 0.11/0.27  % WCLimit  : 300
% 0.11/0.27  % DateTime : Mon Sep 28 21:31:22 UTC 2026
% 0.26/0.28  % CPUTime  : 
% 0.26/0.28  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.26/0.33  Running first-order model finding
% 0.26/0.33  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.26/0.36  % (809515)Will run a generic schedule for satisfiability detection.
% 0.26/0.36  % (809523)dis+10_1_sil=32000:sp=arity:random_seed=4216555484:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.26/0.36  % (809523) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-809515-809523"...
% 0.26/0.36  % (809523)...printing done.
% 0.26/0.36  % (809523)Refutation found. Thanks to Tanya!
% 0.26/0.36  % SZS status Unsatisfiable for theBenchmark
% 0.26/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.36  % (809523)------------------------------
% 0.26/0.36  % (809523)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.36  % (809523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.36  % (809523)CaDiCaL version: 2.1.3
% 0.26/0.36  % (809523)Termination reason: Refutation
% 0.26/0.36  % (809523)Time elapsed: 0.004 s
% 0.26/0.36  % (809523)Peak memory usage: 11 MB
% 0.26/0.36  % (809523)Instructions burned: 7 (million)
% 0.26/0.36  % (809515)Success in time 0.026 s
% 0.26/0.36  % Vampire exiting
%------------------------------------------------------------------------------