↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : CSR028+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 : n004.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:15 PM UTC 2026

% Result   : Theorem 9.63s 1.75s
% Output   : Proof 9.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (  17 unt;   0 def)
%            Number of atoms       :   37 (  11 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  19   ~;   6   |;   4   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    2 (   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   :   18 (   2 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f45,conjecture,
    ( mtvisible(c_tptp_member2089_mt)
   => individual(c_tptptptpcol_16_25985) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query28) ).

fof(f45_neg,negated_conjecture,
    ~ ( mtvisible(c_tptp_member2089_mt)
     => individual(c_tptptptpcol_16_25985) ),
    inference(negated_conjecture,[status(cth)],[f45]) ).

fof(f45_nnf,plain,
    ( ~ individual(c_tptptptpcol_16_25985)
    & mtvisible(c_tptp_member2089_mt) ),
    inference(nnf_transformation,[status(thm)],[f45_neg]) ).

fof(f45_sk,plain,
    ( ~ individual(c_tptptptpcol_16_25985)
    & mtvisible(c_tptp_member2089_mt) ),
    inference(skolemisation,[status(esa)],[f45_nnf]) ).

cnf(c45,plain,
    mtvisible(c_tptp_member2089_mt),
    inference(cnf_transformation,[status(esa)],[f45_sk]) ).

cnf(t8,plain,
    mtvisible(c_tptp_member2089_mt) = true,
    inference(equality_encoding,[status(esa)],[c45]) ).

cnf(t169,plain,
    mtvisible(c_tptp_member2089_mt) = true,
    inference(orient,[status(thm)],[t8]) ).

fof(f7,axiom,
    individual(c_tptptptpcol_16_25985),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just8) ).

fof(f7_nnf,plain,
    individual(c_tptptptpcol_16_25985),
    inference(nnf_transformation,[status(thm)],[f7]) ).

cnf(c7,plain,
    individual(c_tptptptpcol_16_25985),
    inference(cnf_transformation,[status(esa)],[f7_nnf]) ).

cnf(t1,plain,
    individual(c_tptptptpcol_16_25985) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(t172,plain,
    individual(c_tptptptpcol_16_25985) = true,
    inference(orient,[status(thm)],[t1]) ).

cnf(t19,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t56,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t19]) ).

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

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

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

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

cnf(c46,plain,
    ~ individual(c_tptptptpcol_16_25985),
    inference(cnf_transformation,[status(esa)],[f45_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c8,c46]) ).

cnf(g0_0,plain,
    true != ifeq(individual(c_tptptptpcol_16_25985),true,false,true),
    inference(rw,[status(thm)],[goal_0]) ).

cnf(g0_1,plain,
    true != ifeq(individual(c_tptptptpcol_16_25985),true,false,mtvisible(c_tptp_member2089_mt)),
    inference(rw,[status(thm)],[g0_0,t169]) ).

cnf(g0_2,plain,
    true != ifeq(individual(c_tptptptpcol_16_25985),individual(c_tptptptpcol_16_25985),false,mtvisible(c_tptp_member2089_mt)),
    inference(rw,[status(thm)],[g0_1,t172]) ).

cnf(g0_3,plain,
    true != false,
    inference(rw,[status(thm)],[g0_2,t56]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR028+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.43  % Computer : n004.cluster.edu
% 0.15/0.43  % Model    : x86_64 x86_64
% 0.15/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43  % Memory   : 8046.5625MB
% 0.15/0.43  % OS       : Linux 6.8.0-71-generic
% 0.15/0.43  % CPULimit : 300
% 0.15/0.43  % WCLimit  : 300
% 0.15/0.43  % DateTime : Fri Sep 25 08:12:05 UTC 2026
% 0.15/0.43  % CPUTime  : 
% 0.15/0.44  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.63/1.75  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.63/1.75  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------