↑ Up

hopCoP---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : KRS002-1 : TPTP v9.0.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n027.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 : Thu Jul 24 08:46:30 PM UTC 2025

% Result   : Unsatisfiable 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named clause_1)

% Comments : 
%------------------------------------------------------------------------------
cnf(0,plain,
    e(exist),
    inference(cnf,[status(esa)],[clause_1]) ).

cnf(l0,plain,
    e(exist),
    inference(instantiation,[status(thm)],[0]) ).

cnf(14,plain,
    ( ~ e(X0)
    | ~ r(X0,X1)
    | d(X1) ),
    inference(cnf,[status(esa)],[clause_15]) ).

cnf(l1,plain,
    ( ~ e(exist)
    | ~ r(exist,u4r2(exist))
    | d(u4r2(exist)) ),
    inference(instantiation,[status(thm)],[14]) ).

cnf(13,plain,
    ( ~ e(X0)
    | r(X0,u4r2(X0)) ),
    inference(cnf,[status(esa)],[clause_14]) ).

cnf(l2,plain,
    ( ~ e(exist)
    | r(exist,u4r2(exist)) ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(7,plain,
    ( ~ d(X0)
    | s1most(X0) ),
    inference(cnf,[status(esa)],[clause_8]) ).

cnf(l3,plain,
    ( ~ d(u4r2(exist))
    | s1most(u4r2(exist)) ),
    inference(instantiation,[status(thm)],[7]) ).

cnf(9,plain,
    ( ~ s(X0,X1)
    | ~ s(X0,X2)
    | ~ s1most(X0)
    | equalish(X1,X2) ),
    inference(cnf,[status(esa)],[clause_10]) ).

cnf(l4,plain,
    ( ~ s(u4r2(exist),u1r2(u4r2(exist)))
    | ~ s(u4r2(exist),u1r1(u4r2(exist)))
    | ~ s1most(u4r2(exist))
    | equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) ),
    inference(instantiation,[status(thm)],[9]) ).

cnf(4,plain,
    ( ~ s2least(X0)
    | s(X0,u1r1(X0)) ),
    inference(cnf,[status(esa)],[clause_5]) ).

cnf(l5,plain,
    ( ~ s2least(u4r2(exist))
    | s(u4r2(exist),u1r1(u4r2(exist))) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(5,plain,
    ( ~ s2least(X0)
    | s(X0,u1r2(X0)) ),
    inference(cnf,[status(esa)],[clause_6]) ).

cnf(l8,plain,
    ( ~ s2least(u4r2(exist))
    | s(u4r2(exist),u1r2(u4r2(exist))) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(1,plain,
    ( ~ c(X0)
    | s2least(X0) ),
    inference(cnf,[status(esa)],[clause_2]) ).

cnf(l12,plain,
    ( ~ c(u4r2(exist))
    | s2least(u4r2(exist)) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(15,plain,
    ( ~ e(X0)
    | ~ r(X0,X1)
    | c(X1) ),
    inference(cnf,[status(esa)],[clause_16]) ).

cnf(l13,plain,
    ( ~ e(exist)
    | ~ r(exist,u4r2(exist))
    | c(u4r2(exist)) ),
    inference(instantiation,[status(thm)],[15]) ).

cnf(l6,plain,
    ( ~ c(u4r2(exist))
    | s2least(u4r2(exist)) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l9,plain,
    ( ~ e(exist)
    | ~ r(exist,u4r2(exist))
    | c(u4r2(exist)) ),
    inference(instantiation,[status(thm)],[15]) ).

cnf(3,plain,
    ( ~ s2least(X0)
    | ~ equalish(u1r2(X0),u1r1(X0)) ),
    inference(cnf,[status(esa)],[clause_4]) ).

cnf(l7,plain,
    ( ~ s2least(u4r2(exist))
    | ~ equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(l15,plain,
    ( ~ e(exist)
    | r(exist,u4r2(exist)) ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(l16,plain,
    ( ~ e(exist)
    | r(exist,u4r2(exist)) ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(l11,plain,
    ( ~ c(u4r2(exist))
    | s2least(u4r2(exist)) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l18,plain,
    ( ~ e(exist)
    | ~ r(exist,u4r2(exist))
    | c(u4r2(exist)) ),
    inference(instantiation,[status(thm)],[15]) ).

cnf(l19,plain,
    ( ~ e(exist)
    | r(exist,u4r2(exist)) ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l4,l5,l8,l12,l13,l6,l9,l7,l15,l16,l11,l18,l19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : KRS002-1 : TPTP v9.0.0. Released v2.0.0.
% 0.07/0.14  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.35  % Computer : n027.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sun Jul 20 21:59:49 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % launching worker at depth: 2
% 0.13/0.36  % launching worker at depth: 3
% 0.13/0.36  % launching worker at depth: 4
% 0.13/0.36  % launching worker at depth: 5
% 0.13/0.36  % launching worker at depth: 1
% 0.13/0.36  % launching worker at depth: 6
% 0.13/0.36  % launching worker at depth: 7
% 0.13/0.36  % launching worker at depth: 8
% 0.13/0.36  % launching worker at depth: 9
% 0.13/0.36  % SZS status Theorem for theBenchmark
% 0.13/0.36  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------