↑ 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  : RNG005-1 : 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 12:35:40 PM UTC 2026

% Result   : Unsatisfiable 0.18s 0.52s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   29 (  14 unt;   0 def)
%            Number of atoms       :   60 (   4 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   63 (  32   ~;  31   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   59 (  59   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : sum(additive_identity,X0,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).

fof(f2,axiom,
    ! [X0] : sum(X0,additive_identity,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity2) ).

fof(f4,axiom,
    ! [X0,X1] : sum(X0,X1,add(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',closure_of_addition) ).

fof(f5,axiom,
    ! [X0] : sum(additive_inverse(X0),X0,additive_identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',left_inverse) ).

fof(f6,axiom,
    ! [X0] : sum(X0,additive_inverse(X0),additive_identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',right_inverse) ).

fof(f7,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ sum(X2,X3,X5)
      | ~ sum(X1,X3,X4)
      | ~ sum(X0,X1,X2)
      | sum(X0,X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition1) ).

fof(f9,axiom,
    ! [X2,X0,X1] :
      ( ~ sum(X0,X1,X2)
      | sum(X1,X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).

fof(f14,axiom,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ product(X5,X1,X6)
      | ~ product(X3,X1,X4)
      | ~ sum(X0,X3,X5)
      | ~ product(X0,X1,X2)
      | sum(X2,X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity3) ).

fof(f15,axiom,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ product(X3,X1,X4)
      | ~ product(X0,X1,X2)
      | ~ sum(X0,X3,X5)
      | ~ sum(X2,X4,X6)
      | product(X5,X1,X6) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',distributivity4) ).

fof(f16,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ sum(X0,X1,X3)
      | ~ sum(X0,X1,X2)
      | X2 = X3 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).

fof(f18,axiom,
    product(a,b,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b) ).

fof(f19,axiom,
    product(additive_inverse(a),b,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_inverse_times_b) ).

fof(f20,negated_conjecture,
    ~ sum(c,d,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_sum_is_additive_id) ).

fof(f25,plain,
    ! [X0,X1] : sum(X0,X1,add(X1,X0)),
    inference(resolution,[],[f9,f4]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ~ sum(additive_inverse(X0),X0,X1)
      | additive_identity = X1 ),
    inference(resolution,[],[f16,f5]) ).

fof(f43,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sum(X3,X0,additive_identity)
      | ~ sum(X0,X1,X2)
      | sum(X3,X2,X1) ),
    inference(resolution,[],[f7,f1]) ).

fof(f81,plain,
    ! [X2,X3,X0,X1] :
      ( ~ product(X2,b,X3)
      | ~ sum(X2,X0,a)
      | ~ product(X0,b,X1)
      | sum(X3,X1,d) ),
    inference(resolution,[],[f14,f18]) ).

fof(f86,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sum(X0,additive_inverse(a),X2)
      | ~ product(X0,b,X1)
      | ~ sum(X1,c,X3)
      | product(X2,b,X3) ),
    inference(resolution,[],[f15,f19]) ).

fof(f118,plain,
    ! [X2,X0,X1] :
      ( sum(additive_inverse(X0),X2,X1)
      | ~ sum(X0,X1,X2) ),
    inference(resolution,[],[f43,f5]) ).

fof(f229,plain,
    ! [X0,X1] :
      ( ~ sum(X0,X1,X0)
      | additive_identity = X1 ),
    inference(resolution,[],[f118,f29]) ).

fof(f375,plain,
    ! [X0,X1] :
      ( ~ product(X0,b,X1)
      | ~ sum(a,X0,a)
      | sum(d,X1,d) ),
    inference(resolution,[],[f81,f18]) ).

fof(f435,plain,
    ! [X0,X1] :
      ( ~ product(a,b,X0)
      | ~ sum(X0,c,X1)
      | product(additive_identity,b,X1) ),
    inference(resolution,[],[f86,f6]) ).

fof(f1771,plain,
    ! [X0] :
      ( ~ sum(d,c,X0)
      | product(additive_identity,b,X0) ),
    inference(resolution,[],[f435,f18]) ).

fof(f1776,plain,
    product(additive_identity,b,add(d,c)),
    inference(resolution,[],[f1771,f4]) ).

fof(f1783,plain,
    ( ~ sum(a,additive_identity,a)
    | sum(d,add(d,c),d) ),
    inference(resolution,[],[f1776,f375]) ).

fof(f1797,plain,
    sum(d,add(d,c),d),
    inference(forward_subsumption_resolution,[],[f1783,f2]) ).

fof(f1926,plain,
    additive_identity = add(d,c),
    inference(resolution,[],[f1797,f229]) ).

fof(f2004,plain,
    sum(c,d,additive_identity),
    inference(superposition,[],[f25,f1926]) ).

fof(f2025,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2004,f20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.38  % Computer : n004.cluster.edu
% 0.14/0.38  % Model    : x86_64 x86_64
% 0.14/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38  % Memory   : 8046.5625MB
% 0.14/0.38  % OS       : Linux 6.8.0-71-generic
% 0.14/0.38  % CPULimit : 300
% 0.14/0.38  % WCLimit  : 300
% 0.14/0.38  % DateTime : Sun Sep 27 22:58:07 UTC 2026
% 0.14/0.39  % CPUTime  : 
% 0.14/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.42  Running first-order model finding
% 0.14/0.42  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.18/0.52  % (3982559)Will run a generic schedule for satisfiability detection.
% 0.18/0.52  % (3982575)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4273046106:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.52  % (3982572)% WARNING: option uhcvi not known.
% 0.18/0.52  % (3982571)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3369795018_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.52  % (3982572)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1646335718:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.52  % (3982573)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1910121845:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.52  % (3982574)dis+10_1_sil=32000:sp=arity:random_seed=2232982357:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.52  % TRYING [1]
% 0.18/0.52  % TRYING [2]
% 0.18/0.52  % TRYING [3]
% 0.18/0.52  % (3982576)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1472293294:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.52  % (3982577)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2428815944:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.52  % TRYING [4]
% 0.18/0.52  % (3982575)Instruction limit reached! 
% 0.18/0.52  % (3982575)------------------------------
% 0.18/0.52  % (3982575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.52  % (3982575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.52  % (3982575)CaDiCaL version: 2.1.3
% 0.18/0.52  % (3982575)Termination reason: Instruction limit
% 0.18/0.52  % (3982575)Termination phase: Saturation
% 0.18/0.52  % (3982575)Time elapsed: 0.037 s
% 0.18/0.52  % (3982575)Peak memory usage: 12 MB
% 0.18/0.52  % (3982575)Instructions burned: 118 (million)
% 0.18/0.52  % (3982597)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3665333513:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.52  % TRYING [1]
% 0.18/0.52  % TRYING [2]
% 0.18/0.52  % TRYING [3]
% 0.18/0.52  % (3982574) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3982559-3982574"...
% 0.18/0.52  % TRYING [4]
% 0.18/0.52  % (3982574)...printing done.
% 0.18/0.52  % (3982574)Refutation found. Thanks to Tanya!
% 0.18/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52  % (3982574)------------------------------
% 0.18/0.52  % (3982574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.52  % (3982574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.52  % (3982574)CaDiCaL version: 2.1.3
% 0.18/0.52  % (3982574)Termination reason: Refutation
% 0.18/0.52  % (3982574)Time elapsed: 0.047 s
% 0.18/0.52  % (3982574)Peak memory usage: 12 MB
% 0.18/0.52  % (3982574)Instructions burned: 71 (million)
% 0.18/0.52  % (3982559)Success in time 0.091 s
% 0.18/0.52  % Vampire exiting
%------------------------------------------------------------------------------