TSTP Solution File: SYN932+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN932+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n006.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 : Tue Apr 30 18:11:10 EDT 2024

% Result   : Theorem 0.22s 0.38s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   3 unt;   0 def)
%            Number of atoms       :   19 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   16 (   7   ~;   4   |;   1   &)
%                                         (   3 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    2 (   1 usr;   2 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    2 (   0   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,plain,
    $false,
    inference(subsumption_resolution,[],[f9,f8]) ).

fof(f8,plain,
    c,
    inference(duplicate_literal_removal,[],[f6]) ).

fof(f6,plain,
    ( c
    | c ),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,plain,
    ( ( ~ c
      | ~ c )
    & ( c
      | c ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,plain,
    ( c
  <~> c ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( c
    <=> c ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ? [X0] : c
    <=> c ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ? [X0] : c
  <=> c ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f9,plain,
    ~ c,
    inference(duplicate_literal_removal,[],[f7]) ).

fof(f7,plain,
    ( ~ c
    | ~ c ),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SYN932+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n006.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Apr 30 01:49:50 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (30067)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38  % (30069)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38  % (30068)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38  % (30071)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.22/0.38  % (30070)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.22/0.38  % (30073)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.22/0.38  % (30072)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.22/0.38  % (30074)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38  The problem is propositional so there are no sorts!
% 0.22/0.38  The problem is propositional so there are no sorts!
% 0.22/0.38  The problem is propositional so there are no sorts!
% 0.22/0.38  The problem is propositional so there are no sorts!
% 0.22/0.38  % (30072)First to succeed.
% 0.22/0.38  TRYING []
% 0.22/0.38  TRYING []
% 0.22/0.38  TRYING []
% 0.22/0.38  % (30068)Also succeeded, but the first one will report.
% 0.22/0.38  TRYING []
% 0.22/0.38  % (30069)Also succeeded, but the first one will report.
% 0.22/0.38  % (30072)Refutation found. Thanks to Tanya!
% 0.22/0.38  % SZS status Theorem for theBenchmark
% 0.22/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.38  % (30072)------------------------------
% 0.22/0.38  % (30072)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.38  % (30072)Termination reason: Refutation
% 0.22/0.38  
% 0.22/0.38  % (30072)Memory used [KB]: 724
% 0.22/0.38  % (30072)Time elapsed: 0.003 s
% 0.22/0.38  % (30072)Instructions burned: 2 (million)
% 0.22/0.38  % (30072)------------------------------
% 0.22/0.38  % (30072)------------------------------
% 0.22/0.38  % (30067)Success in time 0.018 s
%------------------------------------------------------------------------------