TSTP Solution File: SWV371+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SWV371+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:45:20 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (   9 unt;   0 def)
%            Number of atoms       :   67 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   57 (  24   ~;  14   |;   8   &)
%                                         (   2 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   68 (  59   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f246,plain,
    $false,
    inference(subsumption_resolution,[],[f243,f224]) ).

fof(f224,plain,
    issmallestelement_pq(i(triple(sK2,sK0,sK1)),removemin_cpq_res(triple(sK2,sK0,sK1))),
    inference(unit_resulting_resolution,[],[f159,f204]) ).

fof(f204,plain,
    ! [X2,X0,X1] :
      ( issmallestelement_pq(i(triple(X1,X2,X0)),removemin_cpq_res(triple(X1,X2,X0)))
      | ~ phi(findmin_cpq_eff(triple(X1,X2,X0))) ),
    inference(definition_unfolding,[],[f196,f161]) ).

fof(f161,plain,
    ! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
    inference(cnf_transformation,[],[f53]) ).

fof(f53,axiom,
    ! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax53) ).

fof(f196,plain,
    ! [X2,X0,X1] :
      ( issmallestelement_pq(i(triple(X1,X2,X0)),findmin_cpq_res(triple(X1,X2,X0)))
      | ~ phi(findmin_cpq_eff(triple(X1,X2,X0))) ),
    inference(cnf_transformation,[],[f155]) ).

fof(f155,plain,
    ! [X0,X1,X2] :
      ( issmallestelement_pq(i(triple(X1,X2,X0)),findmin_cpq_res(triple(X1,X2,X0)))
      | ~ phi(findmin_cpq_eff(triple(X1,X2,X0))) ),
    inference(rectify,[],[f110]) ).

fof(f110,plain,
    ! [X1,X0,X2] :
      ( issmallestelement_pq(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1)))
      | ~ phi(findmin_cpq_eff(triple(X0,X2,X1))) ),
    inference(ennf_transformation,[],[f67]) ).

fof(f67,plain,
    ! [X1,X0,X2] :
      ( phi(findmin_cpq_eff(triple(X0,X2,X1)))
     => issmallestelement_pq(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1))) ),
    inference(rectify,[],[f64]) ).

fof(f64,axiom,
    ! [X0,X2,X1] :
      ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
     => issmallestelement_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_lX) ).

fof(f159,plain,
    phi(findmin_cpq_eff(triple(sK2,sK0,sK1))),
    inference(cnf_transformation,[],[f131]) ).

fof(f131,plain,
    ( ~ pi_sharp_find_min(i(triple(sK2,sK0,sK1)),findmin_cpq_res(triple(sK2,sK0,sK1)))
    & phi(findmin_cpq_eff(triple(sK2,sK0,sK1))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f129,f130]) ).

fof(f130,plain,
    ( ? [X0,X1,X2] :
        ( ~ pi_sharp_find_min(i(triple(X2,X0,X1)),findmin_cpq_res(triple(X2,X0,X1)))
        & phi(findmin_cpq_eff(triple(X2,X0,X1))) )
   => ( ~ pi_sharp_find_min(i(triple(sK2,sK0,sK1)),findmin_cpq_res(triple(sK2,sK0,sK1)))
      & phi(findmin_cpq_eff(triple(sK2,sK0,sK1))) ) ),
    introduced(choice_axiom,[]) ).

fof(f129,plain,
    ? [X0,X1,X2] :
      ( ~ pi_sharp_find_min(i(triple(X2,X0,X1)),findmin_cpq_res(triple(X2,X0,X1)))
      & phi(findmin_cpq_eff(triple(X2,X0,X1))) ),
    inference(rectify,[],[f127]) ).

fof(f127,plain,
    ? [X2,X1,X0] :
      ( ~ pi_sharp_find_min(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1)))
      & phi(findmin_cpq_eff(triple(X0,X2,X1))) ),
    inference(ennf_transformation,[],[f68]) ).

fof(f68,plain,
    ~ ! [X0,X2,X1] :
        ( phi(findmin_cpq_eff(triple(X0,X2,X1)))
       => pi_sharp_find_min(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1))) ),
    inference(rectify,[],[f66]) ).

fof(f66,negated_conjecture,
    ~ ! [X0,X2,X1] :
        ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
       => pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
    inference(negated_conjecture,[],[f65]) ).

fof(f65,conjecture,
    ! [X0,X2,X1] :
      ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
     => pi_sharp_find_min(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_co) ).

fof(f243,plain,
    ~ issmallestelement_pq(i(triple(sK2,sK0,sK1)),removemin_cpq_res(triple(sK2,sK0,sK1))),
    inference(unit_resulting_resolution,[],[f200,f212,f190]) ).

fof(f190,plain,
    ! [X0,X1] :
      ( pi_sharp_find_min(X1,X0)
      | ~ contains_pq(X1,X0)
      | ~ issmallestelement_pq(X1,X0) ),
    inference(cnf_transformation,[],[f117]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( ~ contains_pq(X1,X0)
      | ~ issmallestelement_pq(X1,X0)
      | pi_sharp_find_min(X1,X0) ),
    inference(flattening,[],[f116]) ).

fof(f116,plain,
    ! [X0,X1] :
      ( pi_sharp_find_min(X1,X0)
      | ~ issmallestelement_pq(X1,X0)
      | ~ contains_pq(X1,X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f97,plain,
    ! [X0,X1] :
      ( ( issmallestelement_pq(X1,X0)
        & contains_pq(X1,X0) )
     => pi_sharp_find_min(X1,X0) ),
    inference(unused_predicate_definition_removal,[],[f74]) ).

fof(f74,plain,
    ! [X0,X1] :
      ( ( issmallestelement_pq(X1,X0)
        & contains_pq(X1,X0) )
    <=> pi_sharp_find_min(X1,X0) ),
    inference(rectify,[],[f58]) ).

fof(f58,axiom,
    ! [X1,X0] :
      ( pi_sharp_find_min(X0,X1)
    <=> ( contains_pq(X0,X1)
        & issmallestelement_pq(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).

fof(f212,plain,
    contains_pq(i(triple(sK2,sK0,sK1)),removemin_cpq_res(triple(sK2,sK0,sK1))),
    inference(unit_resulting_resolution,[],[f159,f201]) ).

fof(f201,plain,
    ! [X2,X0,X1] :
      ( contains_pq(i(triple(X1,X0,X2)),removemin_cpq_res(triple(X1,X0,X2)))
      | ~ phi(findmin_cpq_eff(triple(X1,X0,X2))) ),
    inference(definition_unfolding,[],[f184,f161]) ).

fof(f184,plain,
    ! [X2,X0,X1] :
      ( contains_pq(i(triple(X1,X0,X2)),findmin_cpq_res(triple(X1,X0,X2)))
      | ~ phi(findmin_cpq_eff(triple(X1,X0,X2))) ),
    inference(cnf_transformation,[],[f147]) ).

fof(f147,plain,
    ! [X0,X1,X2] :
      ( contains_pq(i(triple(X1,X0,X2)),findmin_cpq_res(triple(X1,X0,X2)))
      | ~ phi(findmin_cpq_eff(triple(X1,X0,X2))) ),
    inference(rectify,[],[f107]) ).

fof(f107,plain,
    ! [X2,X0,X1] :
      ( contains_pq(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1)))
      | ~ phi(findmin_cpq_eff(triple(X0,X2,X1))) ),
    inference(ennf_transformation,[],[f69]) ).

fof(f69,plain,
    ! [X0,X2,X1] :
      ( phi(findmin_cpq_eff(triple(X0,X2,X1)))
     => contains_pq(i(triple(X0,X2,X1)),findmin_cpq_res(triple(X0,X2,X1))) ),
    inference(rectify,[],[f63]) ).

fof(f63,axiom,
    ! [X0,X2,X1] :
      ( phi(findmin_cpq_eff(triple(X0,X1,X2)))
     => contains_pq(i(triple(X0,X1,X2)),findmin_cpq_res(triple(X0,X1,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_l8) ).

fof(f200,plain,
    ~ pi_sharp_find_min(i(triple(sK2,sK0,sK1)),removemin_cpq_res(triple(sK2,sK0,sK1))),
    inference(definition_unfolding,[],[f160,f161]) ).

fof(f160,plain,
    ~ pi_sharp_find_min(i(triple(sK2,sK0,sK1)),findmin_cpq_res(triple(sK2,sK0,sK1))),
    inference(cnf_transformation,[],[f131]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWV371+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 19:24:45 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.50  % (21047)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.50  % (21039)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51  % (21054)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.51  % (21046)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.51  % (21037)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.51  % (21039)Instruction limit reached!
% 0.19/0.51  % (21039)------------------------------
% 0.19/0.51  % (21039)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51  % (21039)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51  % (21039)Termination reason: Unknown
% 0.19/0.51  % (21039)Termination phase: Property scanning
% 0.19/0.51  
% 0.19/0.51  % (21039)Memory used [KB]: 1535
% 0.19/0.51  % (21039)Time elapsed: 0.005 s
% 0.19/0.51  % (21039)Instructions burned: 3 (million)
% 0.19/0.51  % (21039)------------------------------
% 0.19/0.51  % (21039)------------------------------
% 0.19/0.51  % (21046)First to succeed.
% 0.19/0.51  % (21031)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.51  % (21038)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52  % (21045)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.52  % (21029)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52  % (21046)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (21046)------------------------------
% 0.19/0.52  % (21046)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (21046)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (21046)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (21046)Memory used [KB]: 6140
% 0.19/0.52  % (21046)Time elapsed: 0.113 s
% 0.19/0.52  % (21046)Instructions burned: 7 (million)
% 0.19/0.52  % (21046)------------------------------
% 0.19/0.52  % (21046)------------------------------
% 0.19/0.52  % (21024)Success in time 0.178 s
%------------------------------------------------------------------------------