TSTP Solution File: COM003-2 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : COM003-2 : TPTP v8.2.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n002.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 : Mon May 20 19:11:10 EDT 2024

% Result   : Unsatisfiable 0.12s 0.34s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   16 (   9 unt;   0 def)
%            Number of atoms       :   23 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   16 (   9   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   31 (  31   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f80,plain,
    $false,
    inference(subsumption_resolution,[],[f78,f63]) ).

fof(f63,plain,
    ! [X0,X1] : halts2(X0,X1),
    inference(resolution,[],[f62,f11]) ).

fof(f11,axiom,
    ! [X0,X1] :
      ( ~ program_halts2(X0,X1)
      | halts2(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_halts3a) ).

fof(f62,plain,
    ! [X0,X1] : program_halts2(X0,X1),
    inference(resolution,[],[f22,f52]) ).

fof(f52,plain,
    ! [X0,X1] : program_halts2_halts3_outputs(c1,X0,X1,good),
    inference(resolution,[],[f35,f44]) ).

fof(f44,plain,
    program_program_decides(c1),
    inference(resolution,[],[f34,f43]) ).

fof(f43,axiom,
    algorithm_program_decides(c4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_algorithm_does_not_exist) ).

fof(f34,axiom,
    ! [X0] :
      ( ~ algorithm_program_decides(X0)
      | program_program_decides(c1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom1_1) ).

fof(f35,axiom,
    ! [X2,X3,X1] :
      ( ~ program_program_decides(X3)
      | program_halts2_halts3_outputs(X3,X1,X2,good) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom2_1) ).

fof(f22,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ program_halts2_halts3_outputs(X0,X1,X2,X3)
      | program_halts2(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_halts2_halts3_outputs1) ).

fof(f78,plain,
    ! [X0,X1] : ~ halts2(X0,X1),
    inference(resolution,[],[f76,f17]) ).

fof(f17,axiom,
    ! [X0,X1] :
      ( ~ program_not_halts2(X0,X1)
      | ~ halts2(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts3a) ).

fof(f76,plain,
    ! [X0,X1] : program_not_halts2(X0,X1),
    inference(resolution,[],[f25,f53]) ).

fof(f53,plain,
    ! [X0,X1] : program_not_halts2_halts3_outputs(c1,X0,X1,bad),
    inference(resolution,[],[f36,f44]) ).

fof(f36,axiom,
    ! [X2,X3,X1] :
      ( ~ program_program_decides(X3)
      | program_not_halts2_halts3_outputs(X3,X1,X2,bad) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom2_2) ).

fof(f25,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ program_not_halts2_halts3_outputs(X0,X1,X2,X3)
      | program_not_halts2(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',program_not_halts2_halts3_outputs1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : COM003-2 : TPTP v8.2.0. Released v1.1.0.
% 0.06/0.12  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.32  % Computer : n002.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Sun May 19 10:16:37 EDT 2024
% 0.12/0.32  % CPUTime    : 
% 0.12/0.32  % (32619)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.34  % (32624)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.12/0.34  % (32624)First to succeed.
% 0.12/0.34  % (32624)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32619"
% 0.12/0.34  % (32624)Refutation found. Thanks to Tanya!
% 0.12/0.34  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.34  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.34  % (32624)------------------------------
% 0.12/0.34  % (32624)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.34  % (32624)Termination reason: Refutation
% 0.12/0.34  
% 0.12/0.34  % (32624)Memory used [KB]: 763
% 0.12/0.34  % (32624)Time elapsed: 0.003 s
% 0.12/0.34  % (32624)Instructions burned: 3 (million)
% 0.12/0.34  % (32619)Success in time 0.015 s
%------------------------------------------------------------------------------