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

% Computer : n003.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 02:06:26 PM UTC 2026

% Result   : Unsatisfiable 0.07s 0.24s
% Output   : Refutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (   4 unt;   0 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   58 (  30   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   5 avg)
%            Maximal term depth    :    4 (   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   :   42 (  42   !;   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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',clause_2) ).

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

fof(f4,negated_conjecture,
    ! [X0,X1] :
      ( big_f(g(X0,X1),g(X0,X1))
      | big_f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

fof(f5,negated_conjecture,
    ! [X0,X1] :
      ( ~ big_g(g(X0,X1),g(X0,X1))
      | big_f(X0,X1) ),
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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_g(X0,X1)
      | big_f(g(X0,X1),g(X0,X1)) ),
    inference(resolution,[],[f8,f7]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( big_g(X0,X1)
      | big_f(g(g(X0,X1),g(X0,X1)),g(g(X0,X1),g(X0,X1))) ),
    inference(resolution,[],[f10,f6]) ).

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

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

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

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

fof(f22,plain,
    ! [X0,X1] :
      ( big_f(g(g(X0,X1),g(X0,X1)),g(g(X0,X1),g(X0,X1)))
      | ~ big_f(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f21,f4]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ big_g(X0,X1)
      | ~ big_f(X0,X1) ),
    inference(forward_subsumption_resolution,[],[f19,f10]) ).

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

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

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

fof(f43,plain,
    ! [X0] : ~ big_f(X0,X0),
    inference(forward_subsumption_resolution,[],[f39,f18]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( big_f(g(g(g(X0,X1),g(X0,X1)),g(g(X0,X1),g(X0,X1))),g(g(g(X0,X1),g(X0,X1)),g(g(X0,X1),g(X0,X1))))
      | big_f(X0,X1) ),
    inference(resolution,[],[f12,f5]) ).

fof(f51,plain,
    ! [X0,X1] : big_f(X0,X1),
    inference(forward_subsumption_resolution,[],[f46,f43]) ).

fof(f55,plain,
    ! [X0,X1] : ~ big_f(X0,X1),
    inference(resolution,[],[f22,f43]) ).

fof(f56,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f55,f51]) ).

%------------------------------------------------------------------------------
%----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/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17  % Computer : n003.cluster.edu
% 0.07/0.17  % Model    : x86_64 x86_64
% 0.07/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17  % Memory   : 8046.5625MB
% 0.07/0.17  % OS       : Linux 6.8.0-71-generic
% 0.07/0.17  % CPULimit : 300
% 0.07/0.17  % WCLimit  : 300
% 0.07/0.17  % DateTime : Mon Sep 28 15:21:57 UTC 2026
% 0.07/0.17  % CPUTime  : 
% 0.07/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20  Running first-order model finding
% 0.07/0.20  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.07/0.24  % (1693937)Will run a generic schedule for satisfiability detection.
% 0.07/0.24  % (1693946)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1759172442:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.24  % (1693946) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1693937-1693946"...
% 0.07/0.24  % (1693946)...printing done.
% 0.07/0.24  % (1693946)Refutation found. Thanks to Tanya!
% 0.07/0.24  % SZS status Unsatisfiable for theBenchmark
% 0.07/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.24  % (1693946)------------------------------
% 0.07/0.24  % (1693946)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.24  % (1693946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.24  % (1693946)CaDiCaL version: 2.1.3
% 0.07/0.24  % (1693946)Termination reason: Refutation
% 0.07/0.24  % (1693946)Time elapsed: 0.001 s
% 0.07/0.24  % (1693946)Peak memory usage: 11 MB
% 0.07/0.24  % (1693946)Instructions burned: 2 (million)
% 0.07/0.24  % (1693937)Success in time 0.026 s
% 0.07/0.24  % Vampire exiting
%------------------------------------------------------------------------------