↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : MSC019+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n005.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 : Fri Sep 25 02:13:50 PM UTC 2026

% Result   : Theorem 4.04s 0.96s
% Output   : Proof 4.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (  19 unt;   0 def)
%            Number of atoms       :   31 (   7 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  12   ~;   6   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :   15 (   0 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f600,axiom,
    ! [X,Y,Z] :
      ( ( s_contains(Y,Z)
        & s_contains(X,Y) )
     => s_contains(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom1) ).

fof(f600_nnf,plain,
    ! [X,Y,Z] :
      ( s_contains(X,Z)
      | ~ s_contains(Y,Z)
      | ~ s_contains(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f600]) ).

fof(f600_sk,plain,
    ! [X,Y,Z] :
      ( s_contains(X,Z)
      | ~ s_contains(Y,Z)
      | ~ s_contains(X,Y) ),
    inference(skolemisation,[status(esa)],[f600_nnf]) ).

cnf(c600,plain,
    ( s_contains(X0,X2)
    | ~ s_contains(X1,X2)
    | ~ s_contains(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f600_sk]) ).

cnf(hi600,axiom,
    ifeq(s_contains(X0,X1),true,ifeq(s_contains(X1,X2),true,s_contains(X0,X2),true),true) = true,
    inference(equality_encoding,[status(esa)],[c600]) ).

fof(f18,axiom,
    s_contains(s_g019,s_g013),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kb18) ).

fof(f18_nnf,plain,
    s_contains(s_g019,s_g013),
    inference(nnf_transformation,[status(thm)],[f18]) ).

cnf(c18,plain,
    s_contains(s_g019,s_g013),
    inference(cnf_transformation,[status(esa)],[f18_nnf]) ).

cnf(hi18,axiom,
    s_contains(s_g019,s_g013) = true,
    inference(equality_encoding,[status(esa)],[c18]) ).

fof(f74,axiom,
    s_contains(s_g013,s_MX),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kb74) ).

fof(f74_nnf,plain,
    s_contains(s_g013,s_MX),
    inference(nnf_transformation,[status(thm)],[f74]) ).

cnf(c74,plain,
    s_contains(s_g013,s_MX),
    inference(cnf_transformation,[status(esa)],[f74_nnf]) ).

cnf(hi74,axiom,
    s_contains(s_g013,s_MX) = true,
    inference(equality_encoding,[status(esa)],[c74]) ).

cnf(t19,plain,
    s_contains(s_g019,s_MX) = true,
    inference(hyper_resolution,[status(thm)],[hi600,hi18,hi74]) ).

cnf(t53,plain,
    s_contains(s_g019,s_MX) = true,
    inference(orient,[status(thm)],[t19]) ).

fof(f603,conjecture,
    s_contains(s_g019,s_MX),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexico_in_america_1) ).

fof(f603_neg,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(negated_conjecture,[status(cth)],[f603]) ).

fof(f603_nnf,plain,
    ~ s_contains(s_g019,s_MX),
    inference(nnf_transformation,[status(thm)],[f603_neg]) ).

fof(f603_sk,plain,
    ~ s_contains(s_g019,s_MX),
    inference(skolemisation,[status(esa)],[f603_nnf]) ).

cnf(c603,plain,
    ~ s_contains(s_g019,s_MX),
    inference(cnf_transformation,[status(esa)],[f603_sk]) ).

cnf(goal_0,negated_conjecture,
    s_contains(s_g019,s_MX) != true,
    inference(equality_encoding,[status(esa)],[c603]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t53]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MSC019+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n005.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Thu Sep 24 01:31:33 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.04/0.96  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.04/0.96  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------