↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n002.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:02:22 PM UTC 2026

% Result   : Theorem 0.17s 1.51s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   43 (  15 unt;   0 def)
%            Number of atoms       :  104 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  115 (  54   ~;  41   |;  13   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-8 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   90 (  88   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> ( less(X0,X1)
        | X0 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_def) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
     => leq(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_implies_leq) ).

fof(f15,axiom,
    ! [X0,X1,X2,X3] :
      ( axis_compatible(X0,X1,X2,X3)
    <=> ? [X4] :
          ( in_closed(X4,X0,X1)
          & in_closed(X4,X2,X3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axis_compatible_def) ).

fof(f30,axiom,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] :
      ( box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7)
    <=> ( axis_compatible(X0,X1,X4,X5)
        & axis_compatible(X2,X3,X6,X7) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',box2_overlap) ).

fof(f33,axiom,
    ! [X0,X1,X2] :
      ( in_closed(X0,X1,X2)
    <=> ( leq(X1,X0)
        & leq(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',shape_closed) ).

fof(f41,axiom,
    less(v0,v400),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v400) ).

fof(f43,axiom,
    less(v400,v600),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v600) ).

fof(f44,axiom,
    less(v400,v800),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v800) ).

fof(f47,conjecture,
    box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl624) ).

fof(f48,negated_conjecture,
    ~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
    inference(negated_conjecture,[status(cth)],[f47]) ).

fof(f49,plain,
    ~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
    inference(flattening,[],[f48]) ).

fof(f50,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] :
      ( ( axis_compatible(X0,X1,X4,X5)
        & axis_compatible(X2,X3,X6,X7) )
     => box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7) ),
    inference(unused_predicate_definition_removal,[],[f30]) ).

fof(f51,plain,
    ! [X0,X1,X2,X3] :
      ( ? [X4] :
          ( in_closed(X4,X0,X1)
          & in_closed(X4,X2,X3) )
     => axis_compatible(X0,X1,X2,X3) ),
    inference(unused_predicate_definition_removal,[],[f15]) ).

fof(f52,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] :
      ( box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7)
      | ~ axis_compatible(X0,X1,X4,X5)
      | ~ axis_compatible(X2,X3,X6,X7) ),
    inference(ennf_transformation,[],[f50]) ).

fof(f53,plain,
    ! [X0,X1,X2,X3,X4,X5,X6,X7] :
      ( box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7)
      | ~ axis_compatible(X0,X1,X4,X5)
      | ~ axis_compatible(X2,X3,X6,X7) ),
    inference(flattening,[],[f52]) ).

fof(f56,plain,
    ! [X0,X1,X2,X3] :
      ( axis_compatible(X0,X1,X2,X3)
      | ! [X4] :
          ( ~ in_closed(X4,X0,X1)
          | ~ in_closed(X4,X2,X3) ) ),
    inference(ennf_transformation,[],[f51]) ).

fof(f63,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ less(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f66,plain,
    ! [X0,X1,X2] :
      ( ( in_closed(X0,X1,X2)
        | ~ leq(X1,X0)
        | ~ leq(X0,X2) )
      & ( ( leq(X1,X0)
          & leq(X0,X2) )
        | ~ in_closed(X0,X1,X2) ) ),
    inference(nnf_transformation,[],[f33]) ).

fof(f67,plain,
    ! [X0,X1,X2] :
      ( ( in_closed(X0,X1,X2)
        | ~ leq(X1,X0)
        | ~ leq(X0,X2) )
      & ( ( leq(X1,X0)
          & leq(X0,X2) )
        | ~ in_closed(X0,X1,X2) ) ),
    inference(flattening,[],[f66]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( ( leq(X0,X1)
        | ( ~ less(X0,X1)
          & X0 != X1 ) )
      & ( less(X0,X1)
        | X0 = X1
        | ~ leq(X0,X1) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f72,plain,
    ! [X0,X1] :
      ( ( leq(X0,X1)
        | ( ~ less(X0,X1)
          & X0 != X1 ) )
      & ( less(X0,X1)
        | X0 = X1
        | ~ leq(X0,X1) ) ),
    inference(flattening,[],[f71]) ).

fof(f73,plain,
    ~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
    inference(cnf_transformation,[],[f49]) ).

fof(f81,plain,
    less(v0,v400),
    inference(cnf_transformation,[],[f41]) ).

fof(f82,plain,
    less(v400,v600),
    inference(cnf_transformation,[],[f43]) ).

fof(f84,plain,
    less(v400,v800),
    inference(cnf_transformation,[],[f44]) ).

fof(f85,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7)
      | ~ axis_compatible(X0,X1,X4,X5)
      | ~ axis_compatible(X2,X3,X6,X7) ),
    inference(cnf_transformation,[],[f53]) ).

fof(f89,plain,
    ! [X2,X3,X0,X1,X4] :
      ( axis_compatible(X0,X1,X2,X3)
      | ~ in_closed(X4,X0,X1)
      | ~ in_closed(X4,X2,X3) ),
    inference(cnf_transformation,[],[f56]) ).

fof(f92,plain,
    ! [X2,X0,X1] :
      ( in_closed(X0,X1,X2)
      | ~ leq(X1,X0)
      | ~ leq(X0,X2) ),
    inference(cnf_transformation,[],[f67]) ).

fof(f101,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f63]) ).

fof(f104,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[],[f72]) ).

fof(f107,plain,
    ! [X1] : leq(X1,X1),
    inference(equality_resolution,[],[f104]) ).

fof(f183,plain,
    ( ~ axis_compatible(v0,v600,v400,v800)
    | ~ axis_compatible(v0,v600,v400,v800) ),
    inference(resolution,[],[f85,f73]) ).

fof(f184,plain,
    ~ axis_compatible(v0,v600,v400,v800),
    inference(duplicate_literal_removal,[],[f183]) ).

fof(f185,plain,
    ! [X0] :
      ( ~ in_closed(X0,v400,v800)
      | ~ in_closed(X0,v0,v600) ),
    inference(resolution,[],[f184,f89]) ).

fof(f186,plain,
    ! [X0] :
      ( ~ in_closed(X0,v0,v600)
      | ~ leq(v400,X0)
      | ~ leq(X0,v800) ),
    inference(resolution,[],[f185,f92]) ).

fof(f187,plain,
    ! [X0] :
      ( ~ leq(v400,X0)
      | ~ leq(X0,v800)
      | ~ leq(v0,X0)
      | ~ leq(X0,v600) ),
    inference(resolution,[],[f186,f92]) ).

fof(f195,plain,
    ( ~ leq(v400,v800)
    | ~ leq(v0,v400)
    | ~ leq(v400,v600) ),
    inference(resolution,[],[f187,f107]) ).

fof(f213,plain,
    ( ~ leq(v0,v400)
    | ~ leq(v400,v600)
    | ~ less(v400,v800) ),
    inference(resolution,[],[f195,f101]) ).

fof(f214,plain,
    ( ~ leq(v400,v600)
    | ~ leq(v0,v400) ),
    inference(forward_subsumption_resolution,[],[f213,f84]) ).

fof(f216,plain,
    ( ~ leq(v0,v400)
    | ~ less(v400,v600) ),
    inference(resolution,[],[f214,f101]) ).

fof(f217,plain,
    ~ leq(v0,v400),
    inference(forward_subsumption_resolution,[],[f216,f82]) ).

fof(f222,plain,
    ~ less(v0,v400),
    inference(resolution,[],[f217,f101]) ).

fof(f223,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f222,f81]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT091+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n002.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 17:39:07 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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
% 0.17/1.50  % (3766125)Detected formulas, will run a generic FOF schedule.
% 0.17/1.50  % (3766133)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1374785221:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.17/1.50  % (3766133)Refutation not found, incomplete strategy
% 0.17/1.50  % (3766133)------------------------------
% 0.17/1.50  % (3766133)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.50  % (3766133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.50  % (3766133)CaDiCaL version: 2.1.3
% 0.17/1.50  % (3766133)Termination reason: Refutation not found, incomplete strategy
% 0.17/1.50  % (3766133)Time elapsed: 0.001 s
% 0.17/1.50  % (3766133)Peak memory usage: 87 MB
% 0.17/1.50  % (3766130)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=4154944668:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.17/1.50  % (3766132)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=1607564242:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.17/1.50  % (3766135)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1445767592:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.17/1.50  % (3766131)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=1954528217:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.17/1.50  % (3766134)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3382357268:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.17/1.50  % (3766136)dis-21_1_sil=8000:lcm=predicate:random_seed=1808898254: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)
% 0.17/1.50  % (3766134)First to succeed.
% 0.17/1.50  % (3766134)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3766125"
% 0.17/1.50  % (3766136)Also succeeded, but the first one will report.
% 0.17/1.50  % (3766135)Instruction limit reached! 
% 0.17/1.50  % (3766135)------------------------------
% 0.17/1.50  % (3766135)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.50  % (3766135)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.50  % (3766135)CaDiCaL version: 2.1.3
% 0.17/1.50  % (3766135)Termination reason: Instruction limit
% 0.17/1.50  % (3766135)Termination phase: Saturation
% 0.17/1.50  % (3766135)Time elapsed: 0.088 s
% 0.17/1.50  % (3766135)Peak memory usage: 89 MB
% 0.17/1.50  % (3766135)Instructions burned: 139 (million)
% 0.17/1.50  % (3766133)------------------------------
% 0.17/1.50  % (3766133)------------------------------
% 0.17/1.50  % (3766145)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3432935805:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 0.17/1.50  % (3766145)Refutation not found, incomplete strategy
% 0.17/1.50  % (3766145)------------------------------
% 0.17/1.50  % (3766145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.50  % (3766145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.50  % (3766145)CaDiCaL version: 2.1.3
% 0.17/1.51  % (3766145)Termination reason: Refutation not found, incomplete strategy
% 0.17/1.51  % (3766145)Time elapsed: 0.001 s
% 0.17/1.51  % (3766145)Peak memory usage: 88 MB
% 0.17/1.51  % (3766144)lrs+10_1_sil=8000:sp=occurrence:random_seed=1233493655:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 0.17/1.51  % (3766134)Refutation found. Thanks to Tanya!
% 0.17/1.51  % SZS status Theorem for theBenchmark
% 0.17/1.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/1.51  % (3766134)------------------------------
% 0.17/1.51  % (3766134)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.51  % (3766134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.51  % (3766134)CaDiCaL version: 2.1.3
% 0.17/1.51  % (3766134)Termination reason: Refutation
% 0.17/1.51  % (3766134)Time elapsed: 0.005 s
% 0.17/1.51  % (3766134)Peak memory usage: 88 MB
% 0.17/1.51  % (3766134)Instructions burned: 5 (million)
% 0.17/1.51  % (3766134)------------------------------
% 0.17/1.51  % (3766134)------------------------------
% 0.17/1.51  % (3766125)Success in time 0.447 s
% 0.17/1.51  % Vampire exiting
%------------------------------------------------------------------------------