↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GEO258+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n014.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:52:15 AM UTC 2026

% Result   : Theorem 2.66s 1.32s
% Output   : Refutation 2.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   28 (   8 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   74 (  29   ~;  30   |;  12   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   48 (  44   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1,X2,X3] :
      ( between_on_line(X0,X1,X2,X3)
    <=> ( ( before_on_line(X0,X1,X2)
          & before_on_line(X0,X2,X3) )
        | ( before_on_line(X0,X3,X2)
          & before_on_line(X0,X2,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',bet_def) ).

fof(f32,conjecture,
    ! [X0,X1,X2,X3] :
      ( between_on_line(X0,X1,X2,X3)
     => between_on_line(X0,X3,X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f33,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( between_on_line(X0,X1,X2,X3)
       => between_on_line(X0,X3,X2,X1) ),
    inference(negated_conjecture,[status(cth)],[f32]) ).

fof(f34,plain,
    ? [X0,X1,X2,X3] :
      ( ~ between_on_line(X0,X3,X2,X1)
      & between_on_line(X0,X1,X2,X3) ),
    inference(ennf_transformation,[],[f33]) ).

fof(f46,plain,
    ( ~ between_on_line(sK0,sK3,sK2,sK1)
    & between_on_line(sK0,sK1,sK2,sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f34]) ).

fof(f47,plain,
    ! [X0,X1,X2,X3] :
      ( ( between_on_line(X0,X1,X2,X3)
        | ( ( ~ before_on_line(X0,X1,X2)
            | ~ before_on_line(X0,X2,X3) )
          & ( ~ before_on_line(X0,X3,X2)
            | ~ before_on_line(X0,X2,X1) ) ) )
      & ( ( before_on_line(X0,X1,X2)
          & before_on_line(X0,X2,X3) )
        | ( before_on_line(X0,X3,X2)
          & before_on_line(X0,X2,X1) )
        | ~ between_on_line(X0,X1,X2,X3) ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f48,plain,
    ! [X0,X1,X2,X3] :
      ( ( between_on_line(X0,X1,X2,X3)
        | ( ( ~ before_on_line(X0,X1,X2)
            | ~ before_on_line(X0,X2,X3) )
          & ( ~ before_on_line(X0,X3,X2)
            | ~ before_on_line(X0,X2,X1) ) ) )
      & ( ( before_on_line(X0,X1,X2)
          & before_on_line(X0,X2,X3) )
        | ( before_on_line(X0,X3,X2)
          & before_on_line(X0,X2,X1) )
        | ~ between_on_line(X0,X1,X2,X3) ) ),
    inference(flattening,[],[f47]) ).

fof(f51,plain,
    between_on_line(sK0,sK1,sK2,sK3),
    inference(cnf_transformation,[],[f46]) ).

fof(f52,plain,
    ~ between_on_line(sK0,sK3,sK2,sK1),
    inference(cnf_transformation,[],[f46]) ).

fof(f53,plain,
    ! [X2,X3,X0,X1] :
      ( ~ between_on_line(X0,X1,X2,X3)
      | before_on_line(X0,X2,X1)
      | before_on_line(X0,X2,X3) ),
    inference(cnf_transformation,[],[f48]) ).

fof(f54,plain,
    ! [X2,X3,X0,X1] :
      ( ~ between_on_line(X0,X1,X2,X3)
      | before_on_line(X0,X3,X2)
      | before_on_line(X0,X2,X3) ),
    inference(cnf_transformation,[],[f48]) ).

fof(f55,plain,
    ! [X2,X3,X0,X1] :
      ( ~ between_on_line(X0,X1,X2,X3)
      | before_on_line(X0,X2,X1)
      | before_on_line(X0,X1,X2) ),
    inference(cnf_transformation,[],[f48]) ).

fof(f56,plain,
    ! [X2,X3,X0,X1] :
      ( ~ between_on_line(X0,X1,X2,X3)
      | before_on_line(X0,X3,X2)
      | before_on_line(X0,X1,X2) ),
    inference(cnf_transformation,[],[f48]) ).

fof(f57,plain,
    ! [X2,X3,X0,X1] :
      ( between_on_line(X0,X1,X2,X3)
      | ~ before_on_line(X0,X3,X2)
      | ~ before_on_line(X0,X2,X1) ),
    inference(cnf_transformation,[],[f48]) ).

fof(f58,plain,
    ! [X2,X3,X0,X1] :
      ( between_on_line(X0,X1,X2,X3)
      | ~ before_on_line(X0,X1,X2)
      | ~ before_on_line(X0,X2,X3) ),
    inference(cnf_transformation,[],[f48]) ).

fof(f82,plain,
    ( before_on_line(sK0,sK2,sK3)
    | before_on_line(sK0,sK2,sK1) ),
    inference(resolution,[],[f53,f51]) ).

fof(f84,plain,
    ( before_on_line(sK0,sK3,sK2)
    | before_on_line(sK0,sK2,sK3) ),
    inference(resolution,[],[f54,f51]) ).

fof(f86,plain,
    ( before_on_line(sK0,sK2,sK1)
    | before_on_line(sK0,sK1,sK2) ),
    inference(resolution,[],[f55,f51]) ).

fof(f88,plain,
    ( before_on_line(sK0,sK3,sK2)
    | before_on_line(sK0,sK1,sK2) ),
    inference(resolution,[],[f56,f51]) ).

fof(f90,plain,
    ( ~ before_on_line(sK0,sK2,sK3)
    | ~ before_on_line(sK0,sK1,sK2) ),
    inference(resolution,[],[f57,f52]) ).

fof(f96,plain,
    ( ~ before_on_line(sK0,sK3,sK2)
    | ~ before_on_line(sK0,sK2,sK1) ),
    inference(resolution,[],[f58,f52]) ).

fof(f109,plain,
    ( ~ before_on_line(sK0,sK1,sK2)
    | before_on_line(sK0,sK2,sK1) ),
    inference(resolution,[],[f90,f82]) ).

fof(f110,plain,
    before_on_line(sK0,sK2,sK1),
    inference(forward_subsumption_resolution,[],[f109,f86]) ).

fof(f119,plain,
    ~ before_on_line(sK0,sK3,sK2),
    inference(forward_subsumption_resolution,[],[f96,f110]) ).

fof(f120,plain,
    before_on_line(sK0,sK1,sK2),
    inference(resolution,[],[f119,f88]) ).

fof(f121,plain,
    before_on_line(sK0,sK2,sK3),
    inference(resolution,[],[f119,f84]) ).

fof(f126,plain,
    ~ before_on_line(sK0,sK1,sK2),
    inference(resolution,[],[f121,f90]) ).

fof(f128,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f126,f120]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO258+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n014.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 07:53:47 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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.66/1.32  % (482265)Detected formulas, will run a generic FOF schedule.
% 2.66/1.32  % (482274)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2257272868:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.66/1.32  % (482274)First to succeed.
% 2.66/1.32  % (482274)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-482265"
% 2.66/1.32  % (482270)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=847779063:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.66/1.32  % (482275)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2546762514:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.66/1.32  % (482273)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3804289156:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.66/1.32  % (482271)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=344625811:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.66/1.32  % (482272)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1265040955:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.66/1.32  % (482273)Also succeeded, but the first one will report.
% 2.66/1.32  % (482276)dis-21_1_sil=8000:lcm=predicate:random_seed=3684744546:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.66/1.32  % (482275)Also succeeded, but the first one will report.
% 2.66/1.32  % (482276)Also succeeded, but the first one will report.
% 2.66/1.32  % (482274)Refutation found. Thanks to Tanya!
% 2.66/1.32  % SZS status Theorem for theBenchmark
% 2.66/1.32  % SZS output start Proof for theBenchmark
% See solution above
% 2.66/1.32  % (482274)------------------------------
% 2.66/1.32  % (482274)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.32  % (482274)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.32  % (482274)CaDiCaL version: 2.1.3
% 2.66/1.32  % (482274)Termination reason: Refutation
% 2.66/1.32  % (482274)Time elapsed: 0.002 s
% 2.66/1.32  % (482274)Peak memory usage: 88 MB
% 2.66/1.32  % (482274)Instructions burned: 3 (million)
% 2.66/1.32  % (482274)------------------------------
% 2.66/1.32  % (482274)------------------------------
% 2.66/1.32  % (482265)Success in time 0.289 s
% 2.66/1.32  % Vampire exiting
%------------------------------------------------------------------------------