↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n020.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:49:21 AM UTC 2026

% Result   : Unsatisfiable 3.22s 0.93s
% Output   : Refutation 3.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   42 (  16 unt;   1 def)
%            Number of atoms       :   91 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   94 (  45   ~;  48   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn  26   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f11,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_definedness_of_additive_identity) ).

fof(f16,axiom,
    ! [X0,X1] :
      ( ~ less_or_equal(X1,X0)
      | ~ less_or_equal(X0,X1)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_of_order_relation) ).

fof(f18,axiom,
    ! [X0,X1] :
      ( less_or_equal(X1,X0)
      | less_or_equal(X0,X1)
      | ~ defined(X0)
      | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality_of_order_relation) ).

fof(f20,axiom,
    ! [X0,X1] :
      ( less_or_equal(additive_identity,multiply(X0,X1))
      | ~ less_or_equal(additive_identity,X0)
      | ~ less_or_equal(additive_identity,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',compatibility_of_order_relation_and_multiplication) ).

fof(f22,axiom,
    ! [X0,X1] :
      ( ~ equalish(X1,X0)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_equality) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( ~ equalish(X2,X1)
      | ~ equalish(X0,X2)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_equality) ).

fof(f26,axiom,
    ! [X2,X0,X1] :
      ( ~ less_or_equal(X2,X1)
      | less_or_equal(X0,X1)
      | ~ equalish(X2,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',compatibility_of_equality_and_order_relation) ).

fof(f30,axiom,
    defined(u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_is_defined) ).

fof(f31,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).

fof(f32,negated_conjecture,
    less_or_equal(additive_identity,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_5) ).

fof(f33,negated_conjecture,
    equalish(multiply(a,b),u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_equals_u_6) ).

fof(f34,negated_conjecture,
    ~ less_or_equal(additive_identity,u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_7) ).

fof(f35,plain,
    equalish(u,multiply(a,b)),
    inference(resolution,[],[f22,f33]) ).

fof(f60,plain,
    ! [X0] :
      ( ~ equalish(X0,multiply(a,b))
      | equalish(X0,u) ),
    inference(resolution,[],[f23,f33]) ).

fof(f71,plain,
    ! [X2,X0,X1] :
      ( ~ equalish(X0,X2)
      | ~ defined(X0)
      | ~ defined(X1)
      | less_or_equal(X2,X1)
      | less_or_equal(X1,X0) ),
    inference(resolution,[],[f18,f26]) ).

fof(f77,plain,
    ! [X0] :
      ( less_or_equal(X0,X0)
      | ~ defined(X0)
      | ~ defined(X0) ),
    inference(factoring,[],[f18]) ).

fof(f78,plain,
    ! [X0] :
      ( less_or_equal(X0,X0)
      | ~ defined(X0) ),
    inference(duplicate_literal_removal,[],[f77]) ).

fof(f90,plain,
    ! [X0,X1] :
      ( ~ less_or_equal(multiply(X0,X1),additive_identity)
      | ~ less_or_equal(additive_identity,X1)
      | ~ less_or_equal(additive_identity,X0)
      | equalish(multiply(X0,X1),additive_identity) ),
    inference(resolution,[],[f20,f16]) ).

fof(f105,plain,
    ! [X0,X1] :
      ( ~ equalish(X0,X1)
      | less_or_equal(X1,X0)
      | ~ defined(X0) ),
    inference(resolution,[],[f78,f26]) ).

fof(f125,plain,
    ! [X0] :
      ( ~ defined(u)
      | ~ defined(X0)
      | less_or_equal(multiply(a,b),X0)
      | less_or_equal(X0,u) ),
    inference(resolution,[],[f71,f35]) ).

fof(f130,plain,
    ! [X0] :
      ( less_or_equal(multiply(a,b),X0)
      | ~ defined(X0)
      | less_or_equal(X0,u) ),
    inference(forward_subsumption_resolution,[],[f125,f30]) ).

fof(f197,definition,
    ( spl0_10
  <=> equalish(additive_identity,u) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f198,plain,
    ( equalish(additive_identity,u)
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f197]) ).

fof(f199,plain,
    ( ~ equalish(additive_identity,u)
    | spl0_10 ),
    inference(avatar_component_clause,[],[f197]) ).

fof(f281,plain,
    ( ~ defined(additive_identity)
    | less_or_equal(additive_identity,u)
    | ~ less_or_equal(additive_identity,b)
    | ~ less_or_equal(additive_identity,a)
    | equalish(multiply(a,b),additive_identity) ),
    inference(resolution,[],[f130,f90]) ).

fof(f291,plain,
    ( less_or_equal(additive_identity,u)
    | ~ less_or_equal(additive_identity,b)
    | ~ less_or_equal(additive_identity,a)
    | equalish(multiply(a,b),additive_identity) ),
    inference(forward_subsumption_resolution,[],[f281,f11]) ).

fof(f294,plain,
    ( ~ less_or_equal(additive_identity,b)
    | ~ less_or_equal(additive_identity,a)
    | equalish(multiply(a,b),additive_identity) ),
    inference(forward_subsumption_resolution,[],[f291,f34]) ).

fof(f297,plain,
    ( ~ less_or_equal(additive_identity,a)
    | equalish(multiply(a,b),additive_identity) ),
    inference(forward_subsumption_resolution,[],[f294,f32]) ).

fof(f298,plain,
    equalish(multiply(a,b),additive_identity),
    inference(forward_subsumption_resolution,[],[f297,f31]) ).

fof(f357,plain,
    equalish(additive_identity,multiply(a,b)),
    inference(resolution,[],[f298,f22]) ).

fof(f743,plain,
    equalish(additive_identity,u),
    inference(resolution,[],[f357,f60]) ).

fof(f758,plain,
    ( $false
    | spl0_10 ),
    inference(forward_subsumption_resolution,[],[f743,f199]) ).

fof(f759,plain,
    spl0_10,
    inference(avatar_contradiction_clause,[],[f758]) ).

fof(f783,plain,
    ( equalish(u,additive_identity)
    | ~ spl0_10 ),
    inference(resolution,[],[f198,f22]) ).

fof(f799,plain,
    ( less_or_equal(additive_identity,u)
    | ~ defined(u)
    | ~ spl0_10 ),
    inference(resolution,[],[f783,f105]) ).

fof(f804,plain,
    ( ~ defined(u)
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f799,f34]) ).

fof(f805,plain,
    ( $false
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f804,f30]) ).

fof(f806,plain,
    ~ spl0_10,
    inference(avatar_contradiction_clause,[],[f805]) ).

cnf(s28,plain,
    spl0_10,
    inference(sat_conversion,[],[f759]) ).

cnf(s29,plain,
    ~ spl0_10,
    inference(sat_conversion,[],[f806]) ).

cnf(s30,plain,
    $false,
    inference(rat,[],[s28,s29]) ).

fof(f807,plain,
    $false,
    inference(avatar_sat_refutation,[],[s30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : FLD071-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n020.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 : Tue Sep 29 00:50:05 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.22  Running first-order theorem proving
% 0.08/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
% 3.22/0.93  % (739742)Input is clausal, will run a generic CNF schedule.
% 3.22/0.93  % (739753)dis-21_1_sil=8000:lcm=predicate:random_seed=3828502372: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)
% 3.22/0.93  % (739748)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=782019431:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.22/0.93  % (739752)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1209507417:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.22/0.93  % (739751)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1956854690:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.22/0.93  % (739747)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=1718788304:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.22/0.93  % (739750)lrs+10_1_sil=8000:sp=occurrence:random_seed=27271816:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.22/0.93  % (739749)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4231041596:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.22/0.93  % (739753)Instruction limit reached! 
% 3.22/0.93  % (739753)------------------------------
% 3.22/0.93  % (739753)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.22/0.93  % (739753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.22/0.93  % (739753)CaDiCaL version: 2.1.3
% 3.22/0.93  % (739753)Termination reason: Instruction limit
% 3.22/0.93  % (739753)Termination phase: Saturation
% 3.22/0.93  % (739753)Time elapsed: 0.028 s
% 3.22/0.93  % (739753)Peak memory usage: 88 MB
% 3.22/0.93  % (739753)Instructions burned: 119 (million)
% 3.22/0.93  % (739750)First to succeed.
% 3.22/0.93  % (739750)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-739742"
% 3.22/0.93  % (739751)Also succeeded, but the first one will report.
% 3.22/0.93  % (739761)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=1070833546:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.22/0.93  % (739752)Instruction limit reached! 
% 3.22/0.93  % (739752)------------------------------
% 3.22/0.93  % (739752)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.22/0.93  % (739752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.22/0.93  % (739752)CaDiCaL version: 2.1.3
% 3.22/0.93  % (739752)Termination reason: Instruction limit
% 3.22/0.93  % (739752)Termination phase: Saturation
% 3.22/0.93  % (739752)Time elapsed: 0.122 s
% 3.22/0.93  % (739752)Peak memory usage: 89 MB
% 3.22/0.93  % (739752)Instructions burned: 181 (million)
% 3.22/0.93  % (739761)Instruction limit reached! 
% 3.22/0.93  % (739761)------------------------------
% 3.22/0.93  % (739761)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.22/0.93  % (739761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.22/0.93  % (739761)CaDiCaL version: 2.1.3
% 3.22/0.93  % (739761)Termination reason: Instruction limit
% 3.22/0.93  % (739761)Termination phase: Saturation
% 3.22/0.93  % (739761)Time elapsed: 0.046 s
% 3.22/0.93  % (739761)Peak memory usage: 89 MB
% 3.22/0.93  % (739761)Instructions burned: 146 (million)
% 3.22/0.93  % (739764)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2795071876:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.22/0.93  % (739763)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=3864618920:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 3.22/0.93  % (739764)Also succeeded, but the first one will report.
% 3.22/0.93  % (739750)Refutation found. Thanks to Tanya!
% 3.22/0.93  % SZS status Unsatisfiable for theBenchmark
% 3.22/0.93  % SZS output start Proof for theBenchmark
% See solution above
% 3.22/0.93  % (739750)------------------------------
% 3.22/0.93  % (739750)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.22/0.93  % (739750)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.22/0.93  % (739750)CaDiCaL version: 2.1.3
% 3.22/0.93  % (739750)Termination reason: Refutation
% 3.22/0.93  % (739750)Time elapsed: 0.020 s
% 3.22/0.93  % (739750)Peak memory usage: 89 MB
% 3.22/0.93  % (739750)Instructions burned: 28 (million)
% 3.22/0.93  % (739750)------------------------------
% 3.22/0.93  % (739750)------------------------------
% 3.22/0.93  % (739742)Success in time 0.407 s
% 3.22/0.93  % Vampire exiting
%------------------------------------------------------------------------------