↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n019.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 01:05:33 PM UTC 2026

% Result   : Theorem 4.79s 1.20s
% Output   : Proof 4.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   33 (  17 unt;   0 def)
%            Number of atoms       :   57 (   9 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   59 (  35   ~;  18   |;   5   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :   39 (   2 sgn  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f31,axiom,
    ! [INS,ARG2] :
      ( disjointwith(INS,ARG2)
     => collection(INS) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just32) ).

fof(f31_nnf,plain,
    ! [INS,ARG2] :
      ( collection(INS)
      | ~ disjointwith(INS,ARG2) ),
    inference(nnf_transformation,[status(thm)],[f31]) ).

fof(f31_sk,plain,
    ! [INS,ARG2] :
      ( collection(INS)
      | ~ disjointwith(INS,ARG2) ),
    inference(skolemisation,[status(esa)],[f31_nnf]) ).

cnf(c31,plain,
    ( collection(X0)
    | ~ disjointwith(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f31_sk]) ).

cnf(hi28,axiom,
    ifeq(disjointwith(X0,X1),true,collection(X0),true) = true,
    inference(equality_encoding,[status(esa)],[c31]) ).

fof(f55,conjecture,
    ~ disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query55) ).

fof(f55_neg,negated_conjecture,
    ~ ~ disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
    inference(negated_conjecture,[status(cth)],[f55]) ).

fof(f55_nnf,plain,
    disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
    inference(nnf_transformation,[status(thm)],[f55_neg]) ).

cnf(c55,plain,
    disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
    inference(cnf_transformation,[status(esa)],[f55_nnf]) ).

cnf(hi52,negated_conjecture,
    disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) = true,
    inference(equality_encoding,[status(esa)],[c55]) ).

cnf(h11,plain,
    collection(c_xskijump_thegame) = true,
    inference(hyper_resolution,[status(thm)],[hi28,hi52]) ).

fof(f4,axiom,
    ! [OBJ] :
      ~ ( individual(OBJ)
        & collection(OBJ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just5) ).

fof(f4_nnf,plain,
    ! [OBJ] :
      ( ~ individual(OBJ)
      | ~ collection(OBJ) ),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [OBJ] :
      ( ~ individual(OBJ)
      | ~ collection(OBJ) ),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    ( ~ individual(X0)
    | ~ collection(X0) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(hi53,axiom,
    ifeq(collection(X0),true,ifeq(individual(X0),true,false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

fof(f0,axiom,
    individual(c_xskijump_thegame),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).

fof(f0_nnf,plain,
    individual(c_xskijump_thegame),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    individual(c_xskijump_thegame),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(hi0,axiom,
    individual(c_xskijump_thegame) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi53,h11,hi0]) ).

cnf(t291,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

fof(f6,axiom,
    ! [OBJ,COL1,COL2] :
      ~ ( disjointwith(COL1,COL2)
        & isa(OBJ,COL2)
        & isa(OBJ,COL1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just7) ).

fof(f6_nnf,plain,
    ! [OBJ,COL1,COL2] :
      ( ~ disjointwith(COL1,COL2)
      | ~ isa(OBJ,COL2)
      | ~ isa(OBJ,COL1) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [OBJ,COL1,COL2] :
      ( ~ disjointwith(COL1,COL2)
      | ~ isa(OBJ,COL2)
      | ~ isa(OBJ,COL1) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( ~ disjointwith(X1,X2)
    | ~ isa(X0,X2)
    | ~ isa(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

fof(f10,axiom,
    ! [OBJ,COL1,COL2] :
      ~ ( disjointwith(COL1,COL2)
        & isa(OBJ,COL2)
        & isa(OBJ,COL1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just11) ).

fof(f10_nnf,plain,
    ! [OBJ,COL1,COL2] :
      ( ~ disjointwith(COL1,COL2)
      | ~ isa(OBJ,COL2)
      | ~ isa(OBJ,COL1) ),
    inference(nnf_transformation,[status(thm)],[f10]) ).

fof(f10_sk,plain,
    ! [OBJ,COL1,COL2] :
      ( ~ disjointwith(COL1,COL2)
      | ~ isa(OBJ,COL2)
      | ~ isa(OBJ,COL1) ),
    inference(skolemisation,[status(esa)],[f10_nnf]) ).

cnf(c10,plain,
    ( ~ disjointwith(X1,X2)
    | ~ isa(X0,X2)
    | ~ isa(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f10_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c4,c6,c10]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : CSR055+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.17/0.45  % Computer : n019.cluster.edu
% 0.17/0.45  % Model    : x86_64 x86_64
% 0.17/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45  % Memory   : 8046.5625MB
% 0.17/0.45  % OS       : Linux 6.8.0-71-generic
% 0.17/0.45  % CPULimit : 300
% 0.17/0.45  % WCLimit  : 300
% 0.17/0.45  % DateTime : Fri Sep 25 08:39:34 UTC 2026
% 0.17/0.46  % CPUTime  : 
% 0.17/0.46  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.79/1.20  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.79/1.20  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------